{"meta":{"query_hash":"4d4108f4fc85","filters":{"topic":"Cellular Automata and Applications"},"cohort_total":448,"direct_labels_cover":0,"predictions_cover":448,"exported":448,"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/4d4108f4fc85","api":"https://metacan.xera.ac/api/v1/cohort?topic=Cellular+Automata+and+Applications"},"results":[{"id":"W101209889","doi":"","title":"An improved cellular automata based algorithm for the 45-convex hull problem","year":2010,"lang":"en","type":"article","venue":"Journal of cellular automata","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Cellular automaton; Convex hull; Correctness; Computer science; Algorithm; Elementary cellular automaton; Asynchronous cellular automaton; Computation; Continuous automaton; Deterministic automaton; Lift (data mining); Block cellular automaton; Reversible cellular automaton; Set (abstract data type); Automaton; Regular polygon; Theoretical computer science; Mathematics; Finite-state machine; Mobile automaton; Automata theory","score_opus":0.008886097054628372,"score_gpt":0.24467937764166367,"score_spread":0.2357932805870353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101209889","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.004490534,0.000039819508,0.9925506,0.00007981256,0.000033880147,0.00005588903,0.000043786757,0.0005269324,0.0021787444],"genre_scores_gemma":[0.09332889,0.00008716812,0.9012937,0.00008490658,0.00002816682,0.00025824647,0.00034833065,0.00020213996,0.0043683783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999363,0.000088765555,0.00004383465,0.0001639023,0.0002241563,0.00011632481],"domain_scores_gemma":[0.99940014,0.00024874054,0.000035270703,0.00011149664,0.00016803459,0.000036398087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005588559,0.0008368276,0.0010899642,0.0008744502,0.0008574026,0.001339531,0.0018416992,0.0012652309,0.008295763],"category_scores_gemma":[0.0021206925,0.00043229945,0.0011947994,0.00078653824,0.00087038067,0.0014736083,0.0019032928,0.0016316064,0.001762321],"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.00020361229,0.00015377365,0.000858928,0.00018615238,0.000048609585,0.00024842232,0.00022444202,0.5681542,0.013876463,0.13727137,0.008435331,0.27033874],"study_design_scores_gemma":[0.000030976487,0.00002295961,0.000058664882,0.000009331942,0.0000075930484,0.000043379794,0.000017578814,0.97309566,0.0023059314,0.02142653,0.0029709127,0.00001046725],"about_ca_topic_score_codex":0.00767845,"about_ca_topic_score_gemma":0.0066616763,"teacher_disagreement_score":0.008295763,"about_ca_system_score_codex":0.001396923,"about_ca_system_score_gemma":0.0019670574,"threshold_uncertainty_score":0.027752101},"labels":[],"label_agreement":null},{"id":"W116072621","doi":"","title":"Emergent Defect Dynamics in Two-Dimensional Cellular Automata.","year":2009,"lang":"en","type":"article","venue":"Journal of cellular automata","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Cellular automaton; Homogeneous; Dynamics (music); Computer science; Statistical physics; Neighbourhood (mathematics); Reversible cellular automaton; Automaton; Biological system; Theoretical computer science; Algorithm; Physics; Mathematics; Biology; Mobile automaton; Mathematical analysis; Automata theory","score_opus":0.009231937196577087,"score_gpt":0.2569307636936297,"score_spread":0.24769882649705263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116072621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68654484,0.00077098294,0.29725328,0.0007675312,0.00011042374,0.00008748634,0.00042618287,0.0006515041,0.0133878],"genre_scores_gemma":[0.97535783,0.00018044392,0.022653759,0.000059429458,0.000014092478,0.00006217608,0.00016583293,0.000028765628,0.0014777124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995814,0.00009025771,0.000030908934,0.000071025584,0.00016204486,0.00006438781],"domain_scores_gemma":[0.9975569,0.0013331895,0.00030454606,0.00034345817,0.00025809344,0.00020385021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004997829,0.00029399892,0.0005949481,0.0007589658,0.0005795383,0.0013069784,0.0006918969,0.0009345564,0.00147224],"category_scores_gemma":[0.005009115,0.00024866548,0.000659763,0.00040457462,0.0015670857,0.0014832994,0.0010441208,0.0008177859,0.00020133369],"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.00019826354,0.00009175245,0.0113505535,0.000304321,0.00009461173,0.0014253294,0.0010123574,0.3379438,0.030955693,0.5912228,0.003056285,0.022344198],"study_design_scores_gemma":[0.000037224512,0.000049893966,0.0012161883,0.000018795849,0.000018132005,0.00052755675,0.00014015613,0.8056639,0.0041121272,0.18512188,0.0030662715,0.000027878064],"about_ca_topic_score_codex":0.0014611656,"about_ca_topic_score_gemma":0.00090494717,"teacher_disagreement_score":0.00147224,"about_ca_system_score_codex":0.0009329448,"about_ca_system_score_gemma":0.00037204297,"threshold_uncertainty_score":0.006769061},"labels":[],"label_agreement":null},{"id":"W12089331","doi":"10.1073/pnas.142136499","title":"Evidence for S-nitrosothiol-dependent changes in fibrinogen that do not involve transnitrosation or thiolation.","year":2002,"lang":"en","type":"article","venue":"PubMed","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science","score_opus":0.1979872644979746,"score_gpt":0.27374629262509015,"score_spread":0.07575902812711555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12089331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.981934,0.0069685937,0.006188619,0.0002764332,0.000083632374,0.00006030211,0.00039007128,0.000111736736,0.003986628],"genre_scores_gemma":[0.9924138,0.0017887142,0.0028345298,0.00015327343,0.000021617148,0.000048328016,0.00055470335,0.000014198752,0.0021707327],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99983585,0.000028729735,0.000016791611,0.000032950647,0.00006299129,0.000022720133],"domain_scores_gemma":[0.99967086,0.00006685229,0.000113593196,0.000041744468,0.00006836432,0.000038579787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022152936,0.00025370874,0.00013993811,0.00013433788,0.00009558403,0.00014965664,0.00019087832,0.00033382763,0.00100547],"category_scores_gemma":[0.00038713627,0.00013352947,0.00020570122,0.00016092439,0.00028120333,0.00013055201,0.00013533173,0.00036513913,0.000308341],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00005641034,0.000008544568,0.00026124157,0.00005579431,0.000011151042,0.0000615958,0.000015829884,0.000012851012,0.9986914,0.000053866304,0.000027454555,0.00074378436],"study_design_scores_gemma":[0.000016111433,0.00050809636,0.022762086,0.000013826888,0.000038890572,0.0013192389,0.00002649824,0.0005996063,0.9722224,0.00009017046,0.0023960532,0.0000070154574],"about_ca_topic_score_codex":0.0010452529,"about_ca_topic_score_gemma":0.0011744507,"teacher_disagreement_score":0.0010452529,"about_ca_system_score_codex":0.00023243517,"about_ca_system_score_gemma":0.00017542412,"threshold_uncertainty_score":0.0033636093},"labels":[],"label_agreement":null},{"id":"W126171308","doi":"","title":"The cellular automata formalism and its relationship to DEVS","year":2000,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"DEVS; Rotation formalisms in three dimensions; Computer science; Theoretical computer science; Automaton; Formalism (music); Cellular automaton; Discrete event simulation; Distributed computing; Algorithm; Modeling and simulation; Mathematics; Simulation","score_opus":0.01512519721440306,"score_gpt":0.234164195379807,"score_spread":0.21903899816540395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126171308","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.005401373,0.004000718,0.9448716,0.0018780514,0.00038645553,0.000118948,0.0005655469,0.0005249463,0.04225236],"genre_scores_gemma":[0.33254135,0.010028254,0.62882984,0.0011529359,0.0009309579,0.0008757663,0.0015231423,0.00044100787,0.0236767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816847,0.00054105464,0.00021207759,0.00041192374,0.00050455274,0.00016194239],"domain_scores_gemma":[0.99685884,0.0016409893,0.0002623336,0.00046879446,0.000584865,0.00018409517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019520434,0.0008394707,0.0010272479,0.0017573427,0.0013144799,0.0033607972,0.0020241647,0.0014096247,0.0042124046],"category_scores_gemma":[0.0058892146,0.0006717658,0.0015698494,0.002564802,0.0038161397,0.0033101721,0.0023786712,0.0036101167,0.0015125307],"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.000004992456,0.0000053723866,0.00008411035,0.00003211609,0.0000042275656,0.000059628157,0.00009299208,0.0059533925,0.00024517704,0.98686814,0.000663269,0.0059864963],"study_design_scores_gemma":[0.000009226786,0.000012153785,0.000095871634,0.000042554468,0.0000072820653,0.00010885968,0.00005181079,0.04129056,0.0005535956,0.9141257,0.043682907,0.000019496349],"about_ca_topic_score_codex":0.006089568,"about_ca_topic_score_gemma":0.003398836,"teacher_disagreement_score":0.006089568,"about_ca_system_score_codex":0.0026201522,"about_ca_system_score_gemma":0.0022415079,"threshold_uncertainty_score":0.019010603},"labels":[],"label_agreement":null},{"id":"W129388523","doi":"","title":"On the Computation and Chromatic Number of Colored Domino Tilings.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Colored; Domino; Rectangle; Polygon (computer graphics); Mathematics; Combinatorics; Set (abstract data type); Simple (philosophy); Computer science; Frame (networking); Geometry","score_opus":0.020398733762552145,"score_gpt":0.25723889698568386,"score_spread":0.23684016322313173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129388523","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.35912827,0.0007433611,0.60560066,0.00075687334,0.00022922989,0.00019731514,0.0010613797,0.0016036292,0.03067929],"genre_scores_gemma":[0.6007229,0.000325381,0.3887938,0.00013585492,0.00007292179,0.000223242,0.001357471,0.0004223496,0.007946052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934775,0.00010576787,0.00003748926,0.00017749937,0.00018348047,0.00014797144],"domain_scores_gemma":[0.995316,0.0032470722,0.0003226534,0.00046808273,0.00041888736,0.00022735211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008249355,0.00074602297,0.0007337354,0.0014186888,0.0012174469,0.002123458,0.001485687,0.00072095485,0.008618155],"category_scores_gemma":[0.008624272,0.00049493526,0.0007090313,0.0018480382,0.0015750831,0.0034366257,0.0016591041,0.00096101145,0.0007712804],"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.001125246,0.00019009999,0.008274377,0.0003901082,0.00010888898,0.00023033799,0.0004777063,0.64692837,0.016201062,0.16172233,0.010578035,0.15377353],"study_design_scores_gemma":[0.00007654857,0.000051266863,0.00070396916,0.000030156893,0.000021295727,0.00005406181,0.00007766132,0.87306833,0.0041080588,0.11947667,0.0023077088,0.00002431791],"about_ca_topic_score_codex":0.008236293,"about_ca_topic_score_gemma":0.019564943,"teacher_disagreement_score":0.008618155,"about_ca_system_score_codex":0.002609774,"about_ca_system_score_gemma":0.0016579342,"threshold_uncertainty_score":0.028830588},"labels":[],"label_agreement":null},{"id":"W1480664545","doi":"10.1007/978-3-642-15979-4_31","title":"Network Decontamination with Temporal Immunity by Cellular Automata","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":9,"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 Ottawa","funders":"","keywords":"Computer science; Human decontamination; Automaton; Set (abstract data type); Distributed computing; Process (computing); Cellular automaton; Grid; Theoretical computer science; Artificial intelligence; Programming language; Mathematics","score_opus":0.008417724696126465,"score_gpt":0.21334596251043272,"score_spread":0.20492823781430625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480664545","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.15578058,0.0006420223,0.82093793,0.0006129223,0.00036667878,0.00008327387,0.000058429727,0.0017523245,0.019765884],"genre_scores_gemma":[0.93362296,0.0002987217,0.057445046,0.00019000874,0.000061114304,0.000075273245,0.000072019524,0.00016091819,0.0080740545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956876,0.000100727084,0.0000240387,0.000099171135,0.00010672385,0.00010054886],"domain_scores_gemma":[0.9986706,0.000509934,0.00008416034,0.0005030649,0.00016934366,0.00006302969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042238948,0.00046056812,0.0007810943,0.00044160368,0.0005435331,0.00091534376,0.001262562,0.0007231747,0.0034598524],"category_scores_gemma":[0.002609269,0.00026008874,0.0007997231,0.00028955287,0.0011437698,0.0013876258,0.0017833606,0.001235002,0.0005192705],"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.0005488424,0.00019397409,0.0010865992,0.00029489867,0.000101218015,0.000451904,0.00039749502,0.3948569,0.075455785,0.40531313,0.005106347,0.11619294],"study_design_scores_gemma":[0.00003071534,0.00009774374,0.000121800076,0.000017602442,0.000033912547,0.00012879603,0.0000543328,0.84662974,0.019188462,0.12883955,0.0048403926,0.00001692171],"about_ca_topic_score_codex":0.0007979129,"about_ca_topic_score_gemma":0.0007248538,"teacher_disagreement_score":0.0034598524,"about_ca_system_score_codex":0.0005209764,"about_ca_system_score_gemma":0.00041862484,"threshold_uncertainty_score":0.011574328},"labels":[],"label_agreement":null},{"id":"W1484474385","doi":"10.1016/j.tcs.2015.08.010","title":"Limit behaviour of μ-equicontinuous cellular automata","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"University of British Columbia","funders":"","keywords":"Equicontinuity; Ergodic theory; Limit (mathematics); Mathematics; Measure (data warehouse); Cellular automaton; Bernoulli's principle; Sequence (biology); Discrete mathematics; Uniform limit theorem; Pure mathematics; Mathematical analysis; Computer science; Algorithm; Physics; Data mining","score_opus":0.017775764243146655,"score_gpt":0.25038534269210844,"score_spread":0.2326095784489618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484474385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83254343,0.0009859584,0.11983908,0.0006756601,0.00006136494,0.00003282011,0.00012470238,0.00042542003,0.045311566],"genre_scores_gemma":[0.991293,0.00022110497,0.003770388,0.00005259838,0.000014245914,0.000028174996,0.000045743353,0.000030897,0.0045438614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943894,0.00017839194,0.000035167206,0.000086365384,0.0001616592,0.00009940234],"domain_scores_gemma":[0.9954184,0.0025579662,0.0003865208,0.00024791286,0.00087708863,0.00051217515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009517976,0.0005014022,0.0007933419,0.0014820345,0.0010880941,0.0029715057,0.0012346185,0.00096156046,0.003813925],"category_scores_gemma":[0.007572208,0.0004019287,0.0005086559,0.00067366415,0.0021025655,0.0017115705,0.0011844086,0.0011689244,0.00038629625],"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.00014805187,0.000088254514,0.0015965413,0.00010755359,0.000035104247,0.000331097,0.0006899871,0.059376933,0.007114664,0.9221754,0.00095645693,0.007379932],"study_design_scores_gemma":[0.000027512531,0.0000580309,0.00060492946,0.00004029443,0.000016999353,0.0002073799,0.00022493384,0.56172264,0.0025929955,0.43359166,0.00088381936,0.000028780467],"about_ca_topic_score_codex":0.0033526595,"about_ca_topic_score_gemma":0.0016529465,"teacher_disagreement_score":0.003813925,"about_ca_system_score_codex":0.0017915511,"about_ca_system_score_gemma":0.0006924516,"threshold_uncertainty_score":0.0129987},"labels":[],"label_agreement":null},{"id":"W1485356454","doi":"10.1007/978-3-540-30479-1_83","title":"Improved Cell-DEVS Model Definition in CD++","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Computer science; Formalism (music); Cover (algebra); Theoretical computer science; Programming language; Modeling and simulation; Distributed computing; Simulation","score_opus":0.019426267320199555,"score_gpt":0.2270055634178707,"score_spread":0.20757929609767115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485356454","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.0057518873,0.00017596847,0.9748452,0.00031100132,0.00017097808,0.0000678142,0.0007192747,0.0008439223,0.017114015],"genre_scores_gemma":[0.271337,0.0005785239,0.6739038,0.0006049121,0.00015284847,0.0006659118,0.0024597042,0.0015754986,0.048721787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943084,0.0001359337,0.000036600122,0.00009730646,0.00022940268,0.00007003216],"domain_scores_gemma":[0.9994319,0.00015082538,0.000021407077,0.000149797,0.00020617331,0.00003993872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060409814,0.0006156332,0.0009387629,0.0005610487,0.0006053059,0.001596802,0.0022792045,0.0009309168,0.01081652],"category_scores_gemma":[0.0017046958,0.00034834814,0.00091493054,0.0008234352,0.0005913588,0.0018324353,0.0014059285,0.0019862074,0.0032837335],"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.00007954278,0.000045976856,0.00030630387,0.000112130394,0.000015771106,0.00014627671,0.00012337815,0.11909255,0.005105106,0.81805974,0.010673524,0.04623976],"study_design_scores_gemma":[0.000027418813,0.000021196935,0.000075167576,0.000017486362,0.000018612645,0.00011285647,0.000031806983,0.6631448,0.0048726806,0.28428763,0.047371294,0.000019146382],"about_ca_topic_score_codex":0.0048432257,"about_ca_topic_score_gemma":0.0052335365,"teacher_disagreement_score":0.01081652,"about_ca_system_score_codex":0.001060705,"about_ca_system_score_gemma":0.001216779,"threshold_uncertainty_score":0.036184847},"labels":[],"label_agreement":null},{"id":"W1500780220","doi":"10.1016/s1571-0831(04)80046-7","title":"18 Visualising, interacting and experimenting with lattices using a diagrammatic representation","year":2005,"lang":"en","type":"book-chapter","venue":"Studies in multidisciplinarity","topic":"Cellular Automata and Applications","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":"Western University","funders":"","keywords":"Diagrammatic reasoning; Representation (politics); Lattice (music); Diagram; State diagram; Computer science; Theoretical computer science; State (computer science); Statistical physics; Theoretical physics; Physics; Algorithm; Programming language","score_opus":0.17125838129250984,"score_gpt":0.4315726093428609,"score_spread":0.2603142280503511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500780220","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.016861547,0.00037674198,0.920756,0.00085565425,0.00016099284,0.000049826947,0.00018297904,0.0024061212,0.058350217],"genre_scores_gemma":[0.29011276,0.00071618805,0.6759766,0.00016043948,0.00005215109,0.00021299234,0.00038671814,0.0008926587,0.031489477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971324,0.00011496502,0.000013958296,0.000052907944,0.000079973,0.000024946652],"domain_scores_gemma":[0.9994474,0.00032897113,0.000026634685,0.00007393536,0.00007215305,0.000050796767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038005516,0.00055874593,0.00034025332,0.00063617184,0.0007417239,0.0032462026,0.0008069121,0.0009987849,0.016595528],"category_scores_gemma":[0.0014956966,0.0003918305,0.00053868914,0.00060609134,0.0021826448,0.0036120554,0.0013229413,0.0011407852,0.0019155233],"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.00006880648,0.000029021523,0.00028230058,0.00026839817,0.000010031512,0.00027771993,0.0032096705,0.022154959,0.020941392,0.89855343,0.005919727,0.048284497],"study_design_scores_gemma":[0.00006085984,0.00005113488,0.0003170878,0.0001387892,0.00002681491,0.00047368117,0.0015310234,0.13496312,0.016075712,0.5953298,0.250972,0.000059993483],"about_ca_topic_score_codex":0.0020366372,"about_ca_topic_score_gemma":0.0017146008,"teacher_disagreement_score":0.016595528,"about_ca_system_score_codex":0.0007159144,"about_ca_system_score_gemma":0.0006654622,"threshold_uncertainty_score":0.055517495},"labels":[],"label_agreement":null},{"id":"W1502886634","doi":"10.5555/2331751.2331754","title":"Content-based image recognition using cellular discrete-event system specifications methodology","year":2012,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; DEVS; Context (archaeology); Event (particle physics); Object (grammar); Grid; Distributed computing; Ubiquitous computing; Pixel; Human–computer interaction; Real-time computing; Artificial intelligence; Modeling and simulation; Simulation","score_opus":0.3284703607492747,"score_gpt":0.3301861508443636,"score_spread":0.001715790095088876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502886634","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.002661538,0.000051354105,0.99538785,0.00003771132,0.0000152540815,0.000044862038,0.00005652492,0.00027824639,0.0014666757],"genre_scores_gemma":[0.35786965,0.0003080026,0.6370322,0.00007724219,0.000035574583,0.0004358492,0.0006098292,0.000112849935,0.0035187835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938214,0.00018788605,0.00006414559,0.00008614799,0.00023756505,0.00004218723],"domain_scores_gemma":[0.9990876,0.000418986,0.00006840215,0.00013203433,0.0002683324,0.000024725374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067360606,0.0005280934,0.0004514849,0.00072894216,0.00033559895,0.001634464,0.0013036187,0.00078381214,0.0019502772],"category_scores_gemma":[0.00196955,0.0002603594,0.0008608428,0.0005464702,0.00060996733,0.0009045675,0.00060681324,0.0006314077,0.0006678168],"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.000058358626,0.00007159091,0.001191632,0.00022390613,0.000057821257,0.0004915808,0.00031227726,0.6438494,0.03243523,0.24505946,0.002010719,0.074238025],"study_design_scores_gemma":[0.0000052340665,0.000013704764,0.000074861404,0.0000069660855,0.000010054167,0.000040218663,0.00001546679,0.9809326,0.004467384,0.011370511,0.0030552777,0.000007764266],"about_ca_topic_score_codex":0.0036307683,"about_ca_topic_score_gemma":0.0033609662,"teacher_disagreement_score":0.0036307683,"about_ca_system_score_codex":0.000997936,"about_ca_system_score_gemma":0.00073680165,"threshold_uncertainty_score":0.007240534},"labels":[],"label_agreement":null},{"id":"W1503701362","doi":"10.1007/3-540-45005-x_35","title":"Automaton Representation of Linear Conjunctive Languages","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":15,"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":"Equivalence (formal languages); Computer science; Context-free language; Embedded pushdown automaton; Rule-based machine translation; Theoretical computer science; Automaton; Deterministic context-free grammar; Intersection (aeronautics); Discrete mathematics; Algorithm; Algebra over a field; Context-free grammar; Mathematics; Tree-adjoining grammar; Artificial intelligence; Pure mathematics","score_opus":0.015731086478756092,"score_gpt":0.27623560685484627,"score_spread":0.2605045203760902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503701362","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.05145444,0.0006405246,0.8969414,0.00051109144,0.00022851399,0.00016265843,0.0020132074,0.004667942,0.043380313],"genre_scores_gemma":[0.7077475,0.00056827546,0.25929508,0.00022738638,0.000107437685,0.00040910195,0.0032678302,0.000553266,0.027824102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996613,0.00007638463,0.000035476347,0.00008476282,0.00008124219,0.000060758353],"domain_scores_gemma":[0.99944204,0.00025621726,0.00004503527,0.00008335945,0.00014764314,0.000025701689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002350029,0.00041563282,0.00048933184,0.0006439731,0.0006378274,0.0023529138,0.0011434805,0.000643712,0.014852571],"category_scores_gemma":[0.00095792115,0.00036243023,0.0009474412,0.0009225541,0.00075957755,0.0018572729,0.00068340206,0.0010057843,0.0025645702],"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.00019099888,0.00009910081,0.00038569697,0.00028087737,0.000034337838,0.00034349906,0.00081989967,0.036049113,0.010781526,0.8696597,0.0074016685,0.07395359],"study_design_scores_gemma":[0.00006283248,0.000073438714,0.00017074769,0.000072318224,0.00005134756,0.00022644893,0.00026107585,0.35845697,0.008064166,0.6097175,0.022791598,0.000051578918],"about_ca_topic_score_codex":0.0037206162,"about_ca_topic_score_gemma":0.0049420735,"teacher_disagreement_score":0.014852571,"about_ca_system_score_codex":0.0009038076,"about_ca_system_score_gemma":0.00078100874,"threshold_uncertainty_score":0.04968685},"labels":[],"label_agreement":null},{"id":"W1507170210","doi":"10.1090/s0002-9939-02-06794-1","title":"Ordered group invariants for nonorientable one-dimensional generalized solenoids","year":2002,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Invariant (physics); Homeomorphism (graph theory); Group (periodic table); Dimension (graph theory); Solenoid; Wedge (geometry); Physics; Pure mathematics; Geometry; Mathematical physics; Quantum mechanics","score_opus":0.023133366393908162,"score_gpt":0.235972268456964,"score_spread":0.21283890206305583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507170210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44768378,0.0008007955,0.28660133,0.00095391757,0.0018244254,0.0001736411,0.0008610213,0.0023099084,0.2587912],"genre_scores_gemma":[0.9110494,0.0003635453,0.03736682,0.00031968288,0.00032119403,0.00009084395,0.0007586493,0.0006491658,0.049080722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994271,0.00007260847,0.00006679495,0.000101218226,0.00020840754,0.0001238628],"domain_scores_gemma":[0.9995265,0.000073340896,0.00008112339,0.00008810195,0.00010949335,0.00012146515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050330727,0.00073241536,0.00051152747,0.0019631127,0.0011052154,0.0024198648,0.0007827481,0.00059757766,0.00921498],"category_scores_gemma":[0.0009364666,0.00028456948,0.0008520124,0.00075636833,0.0022651034,0.0026872198,0.0018144327,0.0011310865,0.0022168073],"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.000036392063,0.000022524526,0.00018691689,0.000036208618,0.000006551386,0.00027770782,0.0002584311,0.00073793123,0.0019691119,0.98624724,0.0019859776,0.008234896],"study_design_scores_gemma":[0.000034793098,0.000061990926,0.0004922169,0.000028380973,0.00001502864,0.00030283545,0.00041204737,0.0057847816,0.0037978971,0.9623263,0.026703084,0.000040699524],"about_ca_topic_score_codex":0.0015955984,"about_ca_topic_score_gemma":0.0020480568,"teacher_disagreement_score":0.00921498,"about_ca_system_score_codex":0.0013386173,"about_ca_system_score_gemma":0.00044061316,"threshold_uncertainty_score":0.030827165},"labels":[],"label_agreement":null},{"id":"W1525993358","doi":"10.37236/1644","title":"Non-Repetitive Tilings","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Alphabet; Construct (python library); Combinatorics; Word (group theory); Plane (geometry); Type (biology); Square (algebra); Property (philosophy); Combinatorics on words; Discrete mathematics; Geometry; Computer science; Linguistics","score_opus":0.007394260334922949,"score_gpt":0.20476788377673022,"score_spread":0.19737362344180728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525993358","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.34595016,0.0027924082,0.54364955,0.0005287088,0.00071513763,0.000103649065,0.00021315552,0.0010213838,0.1050258],"genre_scores_gemma":[0.8112829,0.0011468082,0.14378688,0.00034152888,0.00017515637,0.000124143,0.00041270847,0.0002467301,0.042483192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996567,0.000043102827,0.000036955524,0.00011648423,0.000094180876,0.00005271056],"domain_scores_gemma":[0.9995203,0.00016855879,0.00006496587,0.00012605175,0.00007248656,0.000047700512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016364295,0.00026269676,0.0003516868,0.0002872983,0.00071421685,0.00066312985,0.00046388793,0.00049610424,0.006062701],"category_scores_gemma":[0.0011224407,0.00024676093,0.0005091813,0.0002735307,0.0010944371,0.0010504979,0.0011658459,0.00064665487,0.0018658274],"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.0001378668,0.000058766862,0.001068225,0.00040208607,0.000024225546,0.000791728,0.0009510024,0.011486412,0.09293843,0.7878492,0.0026125545,0.10167947],"study_design_scores_gemma":[0.00006995909,0.00052175164,0.0014887395,0.00013513741,0.00004836146,0.0023581479,0.00050374534,0.043533422,0.113826334,0.71873623,0.11869802,0.00007997293],"about_ca_topic_score_codex":0.00019098316,"about_ca_topic_score_gemma":0.00037095093,"teacher_disagreement_score":0.006062701,"about_ca_system_score_codex":0.00029122178,"about_ca_system_score_gemma":0.00019666736,"threshold_uncertainty_score":0.020281732},"labels":[],"label_agreement":null},{"id":"W1531490209","doi":"10.1109/isit.1997.613137","title":"On achieving frame synchronization in guided scrambling line codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Technical University of Nova Scotia","funders":"","keywords":"Scrambling; Computer science; Line code; Framing (construction); Frame (networking); Synchronization (alternating current); Algorithm; Random walk; Telecommunications; Mathematics; Statistics; Baseband; Engineering; Bandwidth (computing)","score_opus":0.03567752481243636,"score_gpt":0.26794074313430827,"score_spread":0.2322632183218719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531490209","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.13989714,0.00023571726,0.8549352,0.000073117684,0.000040937146,0.000046132074,0.000016906877,0.0003260946,0.0044287364],"genre_scores_gemma":[0.8670692,0.00026458097,0.13063961,0.000053199554,0.000036086192,0.00007529549,0.000026551052,0.00006484157,0.001770705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964595,0.00013159809,0.000009928256,0.00003121177,0.000119065975,0.00006228739],"domain_scores_gemma":[0.99907947,0.0005050334,0.00013914776,0.00012615293,0.00011046761,0.00003965764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055287004,0.00040867724,0.00027208976,0.00032523082,0.00029369045,0.00038914764,0.0004336621,0.00044086442,0.0007846293],"category_scores_gemma":[0.0025995057,0.00016168943,0.00019680428,0.00028871544,0.00065344456,0.0005012545,0.00048451367,0.0003673284,0.00030141906],"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.00056293973,0.00009620372,0.0010371291,0.00019166626,0.000046101635,0.0004726114,0.00053601764,0.4210597,0.20503227,0.24161318,0.0012484773,0.1281037],"study_design_scores_gemma":[0.00004602361,0.0002625448,0.0003098949,0.000023364059,0.000017730757,0.0001435858,0.0000479494,0.91027665,0.06476,0.021417903,0.0026576756,0.00003675623],"about_ca_topic_score_codex":0.0008135751,"about_ca_topic_score_gemma":0.00072213344,"teacher_disagreement_score":0.0008135751,"about_ca_system_score_codex":0.00030488757,"about_ca_system_score_gemma":0.00033330577,"threshold_uncertainty_score":0.0029238462},"labels":[],"label_agreement":null},{"id":"W1545221819","doi":"10.1109/cec.2015.7257151","title":"Evolution of 2D apoptotic cellular automata","year":2015,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Cellular automaton; Mobile automaton; Automaton; Computer science; Theoretical computer science; State (computer science); Stochastic cellular automaton; Asynchronous cellular automaton; Continuous spatial automaton; Mutation rate; Automata theory; Algorithm; Quantum finite automata; Biology; Genetics","score_opus":0.022320684331316967,"score_gpt":0.23640430286754005,"score_spread":0.2140836185362231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545221819","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6211123,0.00023869274,0.35737094,0.00037012034,0.00014666888,0.00009322104,0.0002937926,0.0005023211,0.019871987],"genre_scores_gemma":[0.89143574,0.00014673786,0.099913605,0.00009333153,0.000012791584,0.00011081216,0.00023126445,0.000058042126,0.007997752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974364,0.00006827802,0.000016796981,0.000061027473,0.000077167075,0.00003316807],"domain_scores_gemma":[0.9994223,0.0002213001,0.00006106642,0.00010989513,0.00012514132,0.000060312454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003324784,0.000223979,0.0003272032,0.0003761266,0.00043244864,0.001064601,0.0006999432,0.0006524328,0.0019466152],"category_scores_gemma":[0.0023593171,0.000245549,0.000501856,0.00029205784,0.00055011903,0.00065985165,0.00083081063,0.0005120014,0.00032390273],"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.00013144538,0.00005793558,0.0050459406,0.00007962201,0.000040542098,0.00058229576,0.00044203014,0.82601374,0.052102067,0.068175815,0.0010375433,0.04629101],"study_design_scores_gemma":[0.000016297703,0.000053436477,0.0007013874,0.000008728391,0.000010121074,0.00020272617,0.00005961065,0.9722384,0.008499039,0.013877939,0.0043112687,0.000021115768],"about_ca_topic_score_codex":0.0013791195,"about_ca_topic_score_gemma":0.0012499968,"teacher_disagreement_score":0.0019466152,"about_ca_system_score_codex":0.00084225385,"about_ca_system_score_gemma":0.0003284286,"threshold_uncertainty_score":0.0065121055},"labels":[],"label_agreement":null},{"id":"W1565384686","doi":"10.1007/11830924_2","title":"Analysis of Algorithms on the Cores of Random Graphs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Random graph; Combinatorics; Mathematics; Random regular graph; Degree (music); Vertex (graph theory); Induced subgraph; Discrete mathematics; Graph; Algorithm; Line graph; 1-planar graph","score_opus":0.013823140652413484,"score_gpt":0.23618294035192283,"score_spread":0.22235979969950934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565384686","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.34008262,0.001908601,0.617679,0.0022382776,0.00014481918,0.0002952976,0.00050373666,0.0009096959,0.036237925],"genre_scores_gemma":[0.90605044,0.0013166087,0.07355495,0.000327777,0.00042558138,0.000425456,0.0008418006,0.00068268843,0.016374804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772197,0.00087058323,0.000084246865,0.00034089186,0.0005817259,0.0004006014],"domain_scores_gemma":[0.9731828,0.020781336,0.0015439732,0.0016260785,0.0016567495,0.0012090502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002845509,0.0016300264,0.0020908515,0.0030756593,0.0010293748,0.00345429,0.0041006203,0.0019638408,0.008230526],"category_scores_gemma":[0.027023967,0.0012963822,0.0016617577,0.0020517295,0.0038837276,0.007400057,0.0027621316,0.0031409469,0.000585807],"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.00019060589,0.00012364214,0.0013786077,0.00019877894,0.000053242926,0.00006522041,0.00019435801,0.13771117,0.0012920067,0.8393258,0.0039684046,0.015498137],"study_design_scores_gemma":[0.000029891326,0.00003597106,0.00039197266,0.000029793428,0.000017331875,0.000038231297,0.000049762923,0.49401742,0.0004647126,0.5041568,0.00075667875,0.000011452142],"about_ca_topic_score_codex":0.0020027806,"about_ca_topic_score_gemma":0.002378272,"teacher_disagreement_score":0.008230526,"about_ca_system_score_codex":0.0033189782,"about_ca_system_score_gemma":0.0018841353,"threshold_uncertainty_score":0.027533889},"labels":[],"label_agreement":null},{"id":"W1566659289","doi":"10.1007/978-3-540-24854-5_9","title":"Bluenome: A Novel Developmental Model of Artificial Morphogenesis","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cellular automaton; Artificial life; Component (thermodynamics); Morphogenesis; Feature (linguistics); Relation (database); Automaton; Development (topology); Theoretical computer science; Artificial intelligence; Biology; Mathematics; Data mining","score_opus":0.02916209321312204,"score_gpt":0.2340792648274338,"score_spread":0.20491717161431175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566659289","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.03593755,0.0005010355,0.92488104,0.0007942285,0.00017075299,0.000049158807,0.0002489137,0.00094696414,0.03647033],"genre_scores_gemma":[0.54512537,0.0011811572,0.4040681,0.00039971835,0.000120389195,0.00027980463,0.00038190014,0.0006347935,0.047808748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990416,0.000022046148,0.00000362063,0.000025802006,0.00003354056,0.0000108644845],"domain_scores_gemma":[0.9998838,0.000044334458,0.00001364459,0.00002238672,0.000014076131,0.000021882548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017758792,0.0003268113,0.0004385704,0.00038633624,0.00052553095,0.0011730923,0.0011453567,0.0010922727,0.003807671],"category_scores_gemma":[0.0005396054,0.0002950415,0.0005504314,0.00034819372,0.0011964445,0.0012714711,0.0011537408,0.0010098933,0.00069316145],"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.000033311622,0.000016392403,0.00021616348,0.00005589047,0.00000901415,0.00015885192,0.0001396198,0.08347132,0.010952323,0.88834226,0.001907697,0.014697167],"study_design_scores_gemma":[0.00003067453,0.00002647363,0.00014715087,0.000013046762,0.0000111516565,0.00021174956,0.000026840953,0.5557472,0.0034818584,0.4156711,0.024616292,0.000016407686],"about_ca_topic_score_codex":0.0012583805,"about_ca_topic_score_gemma":0.0013154335,"teacher_disagreement_score":0.003807671,"about_ca_system_score_codex":0.0005034241,"about_ca_system_score_gemma":0.00049338577,"threshold_uncertainty_score":0.01273793},"labels":[],"label_agreement":null},{"id":"W1570304560","doi":"10.1109/iscas.2004.1329412","title":"A novel scheme of implementing high speed AWGN communication channel emulators in FPGAs","year":2004,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Additive white Gaussian noise; Emulation; Computer science; Field-programmable gate array; Channel (broadcasting); Process (computing); Communications system; Scheme (mathematics); Software; Embedded system; Computer architecture; Computer engineering; Computer network; Mathematics","score_opus":0.021907776331846176,"score_gpt":0.2649069094979995,"score_spread":0.24299913316615332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570304560","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.023092689,0.00014261552,0.97233653,0.00006427958,0.00009381281,0.00009658669,0.000034623394,0.0014056438,0.0027331852],"genre_scores_gemma":[0.42323038,0.0001729832,0.5727293,0.00007795724,0.00005156443,0.0001373239,0.000067278095,0.000046574318,0.0034866475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973077,0.00007122724,0.000021389475,0.00005079063,0.000094715615,0.000031090975],"domain_scores_gemma":[0.9996625,0.00009710039,0.000043331864,0.00009237548,0.000085435386,0.000019187073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025137677,0.0005395166,0.0002913673,0.00046450764,0.00028765845,0.00049584475,0.0008771945,0.00038946737,0.0018228065],"category_scores_gemma":[0.0008644497,0.00018996107,0.00017750819,0.00023412712,0.0003188757,0.0006864187,0.00036196478,0.0004606553,0.00058418117],"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.0006691134,0.00025111096,0.001846215,0.00032490375,0.00012242407,0.00061058643,0.00023194218,0.06966455,0.346648,0.06730129,0.0036588311,0.508671],"study_design_scores_gemma":[0.00014869153,0.00077085063,0.0010701052,0.00005682443,0.00008139499,0.0014950229,0.000036974707,0.5795322,0.3801992,0.007936244,0.028590722,0.00008170063],"about_ca_topic_score_codex":0.00032057535,"about_ca_topic_score_gemma":0.0006367994,"teacher_disagreement_score":0.0018228065,"about_ca_system_score_codex":0.00024557544,"about_ca_system_score_gemma":0.00026113554,"threshold_uncertainty_score":0.006097853},"labels":[],"label_agreement":null},{"id":"W1574266679","doi":"10.1007/978-3-642-05434-1_24","title":"Gossiping in Jail","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Toronto","funders":"","keywords":"Gossip; Computer science; RADIUS; Set (abstract data type); Transmission (telecommunications); Interference (communication); Upper and lower bounds; Broadcasting (networking); Algorithm; Computer network; Combinatorics; Telecommunications; Mathematics; Law; Programming language","score_opus":0.014837868749372431,"score_gpt":0.24138704546160036,"score_spread":0.22654917671222793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574266679","genre_codex":"other","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.10467505,0.008529006,0.2051506,0.0054762596,0.0028577473,0.00015795042,0.00038196563,0.0031227171,0.66964865],"genre_scores_gemma":[0.8452146,0.002295769,0.035665844,0.00053153344,0.00070383004,0.0001424685,0.0002686309,0.00061407324,0.11456334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994593,0.00020096902,0.0000368348,0.000058147903,0.00012013875,0.00012460291],"domain_scores_gemma":[0.99842703,0.0008164671,0.00012594773,0.0002781635,0.00017280842,0.00017960118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078083016,0.0004034729,0.00047659306,0.00089474866,0.0022308868,0.003497281,0.00074267027,0.0007529982,0.010599677],"category_scores_gemma":[0.0030980029,0.00030379425,0.00034643602,0.0009154249,0.0019519532,0.00393683,0.0015154463,0.0018198052,0.001986476],"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.00017164134,0.000051159015,0.0003999193,0.00020014346,0.000017915943,0.00020159743,0.0014692859,0.003693145,0.0013218285,0.90417945,0.018654266,0.06963971],"study_design_scores_gemma":[0.000048392165,0.000117916214,0.0006747646,0.000240533,0.000048226586,0.0005684917,0.001121722,0.036146976,0.0044079917,0.7751817,0.18137003,0.00007326292],"about_ca_topic_score_codex":0.00086792477,"about_ca_topic_score_gemma":0.0011616987,"teacher_disagreement_score":0.010599677,"about_ca_system_score_codex":0.0007792884,"about_ca_system_score_gemma":0.0005402466,"threshold_uncertainty_score":0.03545946},"labels":[],"label_agreement":null},{"id":"W1577577485","doi":"","title":"Radial View of Continuous Cellular Automata","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Continuous spatial automaton; Cellular automaton; Mobile automaton; Asynchronous cellular automaton; Stochastic cellular automaton; Continuous automaton; Mathematics; Quantum cellular automaton; Boolean function; Diagram; Elementary cellular automaton; Discrete mathematics; Quantum finite automata; Theoretical computer science; Computer science; Algorithm; Automaton; Automata theory","score_opus":0.016944709139934847,"score_gpt":0.22366183988554011,"score_spread":0.20671713074560527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577577485","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.044644095,0.002514764,0.8922534,0.00071835757,0.00022394267,0.000049594586,0.00037824412,0.0010592197,0.05815841],"genre_scores_gemma":[0.761081,0.0019645032,0.22490701,0.00020705217,0.00019918471,0.00014319329,0.00022463623,0.00014589865,0.011127583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996983,0.000101073,0.000013045006,0.00007863635,0.00007699179,0.000032014188],"domain_scores_gemma":[0.9995307,0.0001763377,0.000058712874,0.0000813211,0.000104760074,0.000048249305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002908042,0.00051787286,0.0003690775,0.000854554,0.0004008823,0.0020511409,0.0007189192,0.0008029561,0.004888689],"category_scores_gemma":[0.0013118758,0.00023084915,0.00052929076,0.00047598517,0.0011936863,0.0012903799,0.0006637312,0.0009486037,0.0008648583],"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.000053480246,0.000011881003,0.00038408715,0.000086221786,0.000014851452,0.00019029864,0.00031761176,0.05299857,0.014434668,0.9144687,0.0013748225,0.015664747],"study_design_scores_gemma":[0.000024894845,0.000072408315,0.0006835439,0.000043515545,0.000019847032,0.0003997705,0.00021195791,0.5570508,0.0056585106,0.4049961,0.030786723,0.00005191372],"about_ca_topic_score_codex":0.0024912732,"about_ca_topic_score_gemma":0.0010703681,"teacher_disagreement_score":0.004888689,"about_ca_system_score_codex":0.00069706683,"about_ca_system_score_gemma":0.00032060195,"threshold_uncertainty_score":0.016354263},"labels":[],"label_agreement":null},{"id":"W1602847274","doi":"10.1007/978-3-642-04397-0_7","title":"Christoffel and Fibonacci Tiles","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Fibonacci number; Tile; Plane (geometry); Combinatorics; Mathematics; Computer science; Arithmetic; Geometry; Art","score_opus":0.011391689286614373,"score_gpt":0.22979759057103807,"score_spread":0.2184059012844237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602847274","genre_codex":"other","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.107219376,0.00602061,0.108768925,0.0012121617,0.0024480238,0.00008112653,0.00023410286,0.00026466037,0.773751],"genre_scores_gemma":[0.68776923,0.004003073,0.059615195,0.00073553703,0.0012496201,0.00017722689,0.00034466595,0.00028388732,0.24582154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967754,0.00005012906,0.000017040074,0.00005996814,0.00011649488,0.000078755926],"domain_scores_gemma":[0.9997551,0.00009854893,0.00001883284,0.00004305867,0.000055233406,0.000029314831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032760337,0.0006747346,0.0007841894,0.0020384116,0.0020130053,0.0021784802,0.0006103602,0.0010188323,0.010841804],"category_scores_gemma":[0.0011901469,0.0003929774,0.000642416,0.0013178292,0.0025009115,0.001608278,0.0010559527,0.0014541876,0.002187604],"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.000006874776,0.0000020535595,0.000016107593,0.000011188028,0.0000013021737,0.00004153714,0.000051292063,0.00024597754,0.00032167824,0.99372935,0.001099367,0.0044732867],"study_design_scores_gemma":[0.000007327426,0.0000093540175,0.000074249474,0.000011726101,0.0000036323686,0.00018036782,0.00005669877,0.0011995676,0.00060389325,0.97893494,0.018907746,0.000010368677],"about_ca_topic_score_codex":0.0015282001,"about_ca_topic_score_gemma":0.001640476,"teacher_disagreement_score":0.010841804,"about_ca_system_score_codex":0.0011457485,"about_ca_system_score_gemma":0.00061178475,"threshold_uncertainty_score":0.036269486},"labels":[],"label_agreement":null},{"id":"W1605818467","doi":"10.1023/a:1021074813291","title":"Multiplicative Cellular Automata on Nilpotent Groups: Structure, Entropy, and Asymptotics","year":2003,"lang":"en","type":"article","venue":"Journal of Statistical Physics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Multiplicative function; Combinatorics; Group (periodic table); Physics; Compact group; Mathematics; Haar measure; Endomorphism; Discrete mathematics; Pure mathematics; Quantum mechanics; Mathematical analysis; Lie group","score_opus":0.010406572566164398,"score_gpt":0.24046790964026618,"score_spread":0.23006133707410178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605818467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8256197,0.0013976513,0.15730433,0.0013366595,0.00016436356,0.000039105238,0.00021744172,0.00024849206,0.013672214],"genre_scores_gemma":[0.99141276,0.00030546045,0.0058898306,0.00007722749,0.00018062636,0.000037682206,0.000102125945,0.000027538252,0.0019667211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939656,0.00018066519,0.00003641525,0.00011619987,0.0001787836,0.00009123521],"domain_scores_gemma":[0.9920459,0.0052076858,0.0006861055,0.0007305266,0.0008581146,0.00047166678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010613449,0.00040290056,0.000982232,0.0021243808,0.0010653072,0.002878103,0.0010479949,0.001262223,0.0025011136],"category_scores_gemma":[0.009756127,0.0003918512,0.0005308638,0.0007694422,0.002947509,0.0034086865,0.0014578834,0.0012831881,0.00022608081],"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.000040285646,0.000026951748,0.0010158039,0.000033448017,0.000014126063,0.00004685542,0.00018353546,0.014771771,0.001529673,0.97847146,0.00037013253,0.0034958827],"study_design_scores_gemma":[0.000011220987,0.000023354543,0.00050098845,0.000013338679,0.00000956914,0.00006869396,0.00004924994,0.1392997,0.00070871646,0.8589008,0.00039530647,0.00001909519],"about_ca_topic_score_codex":0.00072048226,"about_ca_topic_score_gemma":0.00083644013,"teacher_disagreement_score":0.002878103,"about_ca_system_score_codex":0.0011521599,"about_ca_system_score_gemma":0.00066863064,"threshold_uncertainty_score":0.008367002},"labels":[],"label_agreement":null},{"id":"W1610257179","doi":"10.1214/074921706000000130","title":"Attractiveness of the Haar measure for linear cellular automata on Markov subgroups","year":2006,"lang":"en","type":"book-chapter","venue":"Institute of Mathematical Statistics eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Markov chain; Measure (data warehouse); Haar measure; Discrete mathematics; Cellular automaton; Markov model; Markov property; Combinatorics; Markov kernel; Variable-order Markov model; Computer science; Statistics; Algorithm; Data mining","score_opus":0.031036425196877694,"score_gpt":0.2504979608043033,"score_spread":0.21946153560742562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1610257179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41942433,0.0020648006,0.27104223,0.0028002071,0.0005452919,0.000120645724,0.00023776667,0.00034117542,0.30342358],"genre_scores_gemma":[0.9562347,0.000875062,0.011829815,0.00022103816,0.00032754266,0.000105761865,0.00009932234,0.000095063704,0.030211732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993623,0.00015781661,0.00003096972,0.000098054115,0.00025942427,0.00009140852],"domain_scores_gemma":[0.99796104,0.0010785616,0.00017849103,0.00019546991,0.00029210045,0.00029443635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009881553,0.00030939962,0.00057161145,0.0013199402,0.0011983818,0.0034743159,0.00068358216,0.000924331,0.008414279],"category_scores_gemma":[0.005029404,0.00028602115,0.0007741259,0.0006319221,0.0020327324,0.002675644,0.0013808899,0.0016436012,0.0009466778],"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.000007731954,0.0000040844284,0.0000970483,0.000010773554,0.0000021908204,0.000021125543,0.00006644434,0.0010513492,0.00054298545,0.9961588,0.0003205679,0.0017170573],"study_design_scores_gemma":[0.000008503193,0.000026579492,0.00034386577,0.00001004193,0.0000064632527,0.0001311509,0.0000689922,0.028669678,0.0008869828,0.9664248,0.0034073426,0.00001565984],"about_ca_topic_score_codex":0.00075958914,"about_ca_topic_score_gemma":0.0005156103,"teacher_disagreement_score":0.008414279,"about_ca_system_score_codex":0.0015477261,"about_ca_system_score_gemma":0.0006569301,"threshold_uncertainty_score":0.028148532},"labels":[],"label_agreement":null},{"id":"W1619743887","doi":"10.1007/978-3-540-39432-7_92","title":"Coevolving Communication and Cooperation for Lattice Formation Tasks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":13,"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 Toronto","funders":"","keywords":"Computer science; Cellular automaton; Automaton; Distributed computing; Theoretical computer science; Entropy (arrow of time); Lattice (music); Artificial intelligence","score_opus":0.019347911653475276,"score_gpt":0.25159275266616454,"score_spread":0.23224484101268927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1619743887","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.17205052,0.00032587931,0.80485266,0.000509797,0.000117460804,0.00011658051,0.000070622715,0.00035735537,0.021599188],"genre_scores_gemma":[0.92664045,0.00022349384,0.06276465,0.00007424576,0.000052240714,0.00020540736,0.00009298918,0.00009893145,0.009847685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991085,0.0003166366,0.000055413984,0.00015408255,0.00019048496,0.00017489737],"domain_scores_gemma":[0.99080527,0.007125186,0.0003865469,0.00063871604,0.0004094286,0.00063485856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001554185,0.00071044796,0.0010840642,0.00060299627,0.0011230359,0.0016257826,0.0019191115,0.0016526568,0.005543978],"category_scores_gemma":[0.010742568,0.00049566134,0.0005423514,0.00081965985,0.0018076254,0.0026944114,0.0032668188,0.0019671032,0.0006977189],"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.0007167113,0.00031137318,0.0005656602,0.00021580009,0.000039520393,0.00023110233,0.0005620963,0.5069848,0.010106576,0.36279866,0.0037553061,0.11371235],"study_design_scores_gemma":[0.000041308045,0.00006312863,0.00006577128,0.000007657473,0.000008298374,0.000043867305,0.00005201126,0.8576182,0.0013493977,0.14021637,0.0005222885,0.000011642517],"about_ca_topic_score_codex":0.0013420153,"about_ca_topic_score_gemma":0.0016067221,"teacher_disagreement_score":0.005543978,"about_ca_system_score_codex":0.00071023335,"about_ca_system_score_gemma":0.000985348,"threshold_uncertainty_score":0.018546462},"labels":[],"label_agreement":null},{"id":"W163326684","doi":"10.5555/2346616.2346653","title":"Music generation using cellular models","year":2012,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Chord (peer-to-peer); Computer science; Musical composition; Musical; Pop music automation; Variety (cybernetics); Focus (optics); Music theory; Computer music; Human–computer interaction; Artificial intelligence; Visual arts; Art","score_opus":0.12453560145615229,"score_gpt":0.2597710456393357,"score_spread":0.1352354441831834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163326684","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.0328713,0.0006639631,0.93561697,0.00027725138,0.00016156053,0.00007083816,0.0001232715,0.0007651021,0.029449742],"genre_scores_gemma":[0.79142755,0.0011320846,0.18427928,0.00014757946,0.000069599264,0.00023731311,0.00028736185,0.00014256933,0.022276677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997485,0.00007495793,0.00001223637,0.00004776649,0.000086457905,0.000030034842],"domain_scores_gemma":[0.9996517,0.00018512612,0.000024461746,0.000057690537,0.000056481116,0.000024622163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018989839,0.0004607034,0.0004464458,0.00055950106,0.0005835076,0.0012625362,0.0006324032,0.0007288525,0.0038841446],"category_scores_gemma":[0.0013956545,0.00024986448,0.00082027947,0.00044081025,0.0006224277,0.00076099066,0.0010281673,0.0005394079,0.0010254268],"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.00007972485,0.000044294582,0.0005793315,0.000125251,0.000040528164,0.00031944943,0.00026731656,0.5017828,0.023131127,0.39963663,0.0024376758,0.07155586],"study_design_scores_gemma":[0.000017491768,0.000029705589,0.00011667357,0.000014804493,0.000012608246,0.000098867094,0.00003262001,0.9250649,0.0033408068,0.06406379,0.007191671,0.000015937283],"about_ca_topic_score_codex":0.0022037884,"about_ca_topic_score_gemma":0.0014719184,"teacher_disagreement_score":0.0038841446,"about_ca_system_score_codex":0.00071616034,"about_ca_system_score_gemma":0.0003665525,"threshold_uncertainty_score":0.012993753},"labels":[],"label_agreement":null},{"id":"W1660276127","doi":"10.48550/arxiv.nlin/0610077","title":"Dynamics of the Cellular Automaton Rule 142","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Cellular automaton; Dissenting opinion; Mathematics; Surjective function; Uniqueness; Invariant (physics); Jamming; Automaton; Deterministic automaton; Statistical physics; Discrete mathematics; Computer science; Combinatorics; Algorithm; Theoretical computer science; Physics; Mathematical analysis","score_opus":0.01619981483636999,"score_gpt":0.22920853965724333,"score_spread":0.21300872482087335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1660276127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8428537,0.00032699187,0.10006879,0.0008697368,0.00018827629,0.00011037549,0.00037757112,0.00046942366,0.05473512],"genre_scores_gemma":[0.98421127,0.00009307381,0.010090963,0.00007529947,0.000019222845,0.00006782225,0.00019168083,0.000038035218,0.0052125677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999548,0.00008412888,0.000018149658,0.000113857626,0.000128916,0.00010698137],"domain_scores_gemma":[0.99922633,0.00026486264,0.0000831246,0.0001152243,0.0001871947,0.00012314391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036130456,0.00026254778,0.00051171985,0.00041495092,0.0007898302,0.001849307,0.00064603024,0.00079416105,0.0048004105],"category_scores_gemma":[0.0026707368,0.00016775411,0.00040661648,0.00032703072,0.0010983141,0.0010462143,0.0009134936,0.0007240001,0.00054742186],"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.00028851826,0.00015871433,0.006808528,0.0001040342,0.000055807086,0.0010344635,0.00071185664,0.21274026,0.03443679,0.70962775,0.004631976,0.02940135],"study_design_scores_gemma":[0.000062813866,0.00014426433,0.0016562102,0.000021139587,0.000018077699,0.00030577596,0.00023514293,0.802515,0.0063182875,0.18005423,0.008614865,0.000054234722],"about_ca_topic_score_codex":0.0034254817,"about_ca_topic_score_gemma":0.0012666718,"teacher_disagreement_score":0.0048004105,"about_ca_system_score_codex":0.000668659,"about_ca_system_score_gemma":0.0007924429,"threshold_uncertainty_score":0.016058981},"labels":[],"label_agreement":null},{"id":"W166272629","doi":"","title":"Multiagent coordination by stochastic cellular automata","year":2001,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cellular automaton; Computer science; Stochastic cellular automaton; Automaton; Mechanism (biology); Distributed computing; Robot; Mobile robot; Coordination game; Theoretical computer science; Artificial intelligence; Mathematics; Physics","score_opus":0.010315529983519141,"score_gpt":0.2283173188451554,"score_spread":0.21800178886163626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166272629","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.038908746,0.0006671639,0.94994295,0.00038966598,0.00015853418,0.00006709508,0.000085406384,0.00062634965,0.00915417],"genre_scores_gemma":[0.9040403,0.00067797187,0.087715134,0.00011953719,0.0000830634,0.0002743793,0.00012562095,0.000083483355,0.006880507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992551,0.00022975708,0.000055202418,0.00015773256,0.00021434043,0.000087901055],"domain_scores_gemma":[0.9989435,0.0004606624,0.00017393343,0.00015072766,0.0001519149,0.000119204924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006544892,0.0005968619,0.00091347325,0.000571399,0.00075057,0.0015141086,0.0012316316,0.0010943392,0.0017343484],"category_scores_gemma":[0.0025686927,0.00040641538,0.0010071372,0.00050641265,0.0012922112,0.0008963788,0.0011835583,0.0008592887,0.00040538944],"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.00004856754,0.000021544462,0.0004005275,0.000054395092,0.00004964196,0.00017795943,0.00008610547,0.8191543,0.0051487,0.16334632,0.0010417273,0.0104700895],"study_design_scores_gemma":[0.000013176976,0.00001352153,0.000052163934,0.000003886591,0.00000673671,0.000022507134,0.0000070907195,0.96915203,0.00043905183,0.02911034,0.0011706296,0.000008818469],"about_ca_topic_score_codex":0.003703412,"about_ca_topic_score_gemma":0.002655002,"teacher_disagreement_score":0.003703412,"about_ca_system_score_codex":0.0011984565,"about_ca_system_score_gemma":0.00076110644,"threshold_uncertainty_score":0.008695424},"labels":[],"label_agreement":null},{"id":"W1718957939","doi":"10.25088/complexsystems.14.1.29","title":"Sequences of Preimages in Elementary Cellular Automata","year":2003,"lang":"en","type":"article","venue":"Complex Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cellular automaton; Elementary proof; Mathematics; Automaton; Computer science; Artificial intelligence; Pure mathematics; Algorithm","score_opus":0.034956219619584526,"score_gpt":0.26031499860462814,"score_spread":0.2253587789850436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1718957939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51111776,0.0009841585,0.46007955,0.00026336702,0.00009657469,0.00011344627,0.00019819458,0.0009882177,0.026158681],"genre_scores_gemma":[0.9276168,0.0003424807,0.067832224,0.000050662908,0.000040621453,0.00010586281,0.00018940456,0.000063247215,0.003758763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994585,0.00011461206,0.000046458652,0.00013100734,0.00018969785,0.000059743816],"domain_scores_gemma":[0.99825937,0.00094068254,0.00018874492,0.00022932967,0.00025592212,0.00012596573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042070355,0.00027767493,0.00047523328,0.00094511156,0.0007120761,0.0014668711,0.0007470994,0.0007142969,0.002156012],"category_scores_gemma":[0.0046894546,0.00032412205,0.00034893758,0.00050995377,0.0018304478,0.0014647585,0.0006034643,0.00089055585,0.00046482566],"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.000196482,0.000052305408,0.0030560468,0.00012415528,0.000013304017,0.00049134396,0.00055533624,0.06725918,0.014622158,0.87188214,0.00080304564,0.04094463],"study_design_scores_gemma":[0.000021057102,0.00009716846,0.0010678326,0.00004174841,0.00001414125,0.00040234855,0.00012170255,0.29967794,0.01231321,0.68222034,0.0039838436,0.00003864088],"about_ca_topic_score_codex":0.00082851644,"about_ca_topic_score_gemma":0.00084760494,"teacher_disagreement_score":0.002156012,"about_ca_system_score_codex":0.0007004794,"about_ca_system_score_gemma":0.0004149157,"threshold_uncertainty_score":0.0072125793},"labels":[],"label_agreement":null},{"id":"W1728991103","doi":"10.1002/mana.201500309","title":"Sliding block codes between shift spaces over infinite alphabets","year":2016,"lang":"en","type":"article","venue":"Mathematische Nachrichten","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Block (permutation group theory); Block code; Pure mathematics; Discrete mathematics; Combinatorics; Statistics; Decoding methods","score_opus":0.021151614663750613,"score_gpt":0.25941402468133234,"score_spread":0.23826241001758172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1728991103","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.44581592,0.00089269,0.52857995,0.00039956399,0.0002540418,0.000109157234,0.00027171292,0.00033076247,0.023346266],"genre_scores_gemma":[0.9470715,0.00033214196,0.040430665,0.00014098326,0.00009323581,0.00016178832,0.00017509931,0.000049681585,0.011544922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990748,0.00014695799,0.000087194705,0.00020675342,0.000304835,0.00017932052],"domain_scores_gemma":[0.9978702,0.0009118813,0.0003124272,0.00028469999,0.00044536754,0.00017548341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005721808,0.00037010317,0.00042707086,0.0010163235,0.0007288585,0.0010999087,0.00052389776,0.0007466243,0.0035285067],"category_scores_gemma":[0.0032840865,0.00022358814,0.00044781546,0.0007298357,0.00195356,0.0015628962,0.0013077031,0.0011033777,0.0004947909],"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.00009383685,0.000015610238,0.00051884266,0.000044169257,0.000010034332,0.00016059617,0.00045399065,0.011349773,0.008562524,0.9620535,0.00043425424,0.016302878],"study_design_scores_gemma":[0.00004406897,0.00015566962,0.0007085065,0.000044137272,0.000015066412,0.00025952767,0.00025962523,0.0954809,0.015565196,0.8758481,0.011561601,0.000057520967],"about_ca_topic_score_codex":0.0016266915,"about_ca_topic_score_gemma":0.0010376426,"teacher_disagreement_score":0.0035285067,"about_ca_system_score_codex":0.0008299932,"about_ca_system_score_gemma":0.000798413,"threshold_uncertainty_score":0.011804044},"labels":[],"label_agreement":null},{"id":"W1789386201","doi":"10.1109/isit.1995.535800","title":"Properties of guided scrambling encoders and their coded sequences","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Scrambling; Encoder; Quotient; Remainder; Synchronizing; Mathematics; Arithmetic; Algorithm; Computer science; Discrete mathematics; Theoretical computer science; Combinatorics; Topology (electrical circuits)","score_opus":0.07527916002561309,"score_gpt":0.23514852060218022,"score_spread":0.15986936057656714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1789386201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5328884,0.0009422791,0.43213776,0.00036578125,0.00008982458,0.00022300438,0.00074166403,0.0014468817,0.031164378],"genre_scores_gemma":[0.9498,0.00033100788,0.045228478,0.00008258144,0.000031168034,0.00018531771,0.00032041504,0.00010909435,0.0039118947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932146,0.00010971534,0.00006772375,0.000120527584,0.00028892694,0.000091804286],"domain_scores_gemma":[0.9952107,0.0021626079,0.00075837615,0.00070508965,0.0010018273,0.00016148809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042530807,0.00025413727,0.0003028619,0.0007768784,0.00041075767,0.0010596778,0.00042187158,0.0006149169,0.0016709007],"category_scores_gemma":[0.0056736437,0.00025909796,0.00019306033,0.0006008064,0.0008238056,0.00088795554,0.00042809252,0.00054677814,0.00053084234],"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.0004895169,0.0000847941,0.0030187177,0.0002519007,0.00003531765,0.0007399566,0.0007688577,0.11264341,0.09231688,0.7074949,0.0018039818,0.08035182],"study_design_scores_gemma":[0.00008213244,0.00040465966,0.0022816234,0.000093104296,0.00004427862,0.001244869,0.00015472187,0.6772908,0.08719972,0.21886483,0.012250731,0.00008854849],"about_ca_topic_score_codex":0.0016694114,"about_ca_topic_score_gemma":0.0014752608,"teacher_disagreement_score":0.0016709007,"about_ca_system_score_codex":0.0007509102,"about_ca_system_score_gemma":0.00088235404,"threshold_uncertainty_score":0.0055897236},"labels":[],"label_agreement":null},{"id":"W1836633975","doi":"10.1109/mwscas.1990.140893","title":"Bit-level designer's assistant-a knowledge based approach to systolic processor design","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Knowledge base; Very-large-scale integration; Expert system; Base (topology); Computer architecture; Extensibility; Knowledge-based systems; Programming language; Artificial intelligence; Embedded system; Mathematics","score_opus":0.13092645811455644,"score_gpt":0.2606944246464135,"score_spread":0.12976796653185707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836633975","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.0012230533,0.000035255252,0.99199975,0.00009977682,0.000009425473,0.000048584323,0.00007677078,0.0023842333,0.0041232076],"genre_scores_gemma":[0.034008402,0.00020456503,0.9546787,0.00018352993,0.000017520744,0.00018193922,0.00037262499,0.00042045093,0.009932342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906915,0.000310469,0.00007608333,0.00017231079,0.00030637853,0.00006571686],"domain_scores_gemma":[0.998393,0.0008341224,0.00007239782,0.0003473979,0.0002614307,0.00009164293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014771515,0.00057682913,0.0005582921,0.0010229553,0.0006788245,0.002873901,0.0021853133,0.0012510063,0.018448815],"category_scores_gemma":[0.0049145757,0.0006724166,0.00070870394,0.00081174565,0.0008623559,0.002492283,0.0019306227,0.0017938406,0.007193185],"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.0002779764,0.00029641073,0.0007587984,0.00042397372,0.00006815834,0.00055702904,0.0019823164,0.059894294,0.019033154,0.1460351,0.019934224,0.7507386],"study_design_scores_gemma":[0.00014501577,0.00016913461,0.00033044364,0.00020541843,0.00010924277,0.0007984689,0.00033683848,0.6613196,0.026546389,0.11706642,0.19289811,0.00007490002],"about_ca_topic_score_codex":0.0015832365,"about_ca_topic_score_gemma":0.0030003565,"teacher_disagreement_score":0.018448815,"about_ca_system_score_codex":0.0007519818,"about_ca_system_score_gemma":0.001753005,"threshold_uncertainty_score":0.06171739},"labels":[],"label_agreement":null},{"id":"W1844304435","doi":"10.1126/science.1198594","title":"Irremediable Complexity?","year":2010,"lang":"en","type":"article","venue":"Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":242,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Dalhousie University","funders":"","keywords":"Physics","score_opus":0.01884103371675665,"score_gpt":0.26462287622025005,"score_spread":0.2457818425034934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844304435","genre_codex":"other","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.25778013,0.013354556,0.2843813,0.050163273,0.002610971,0.00007308096,0.00040228487,0.0008264283,0.39040804],"genre_scores_gemma":[0.97470677,0.0017539676,0.0074313465,0.001065637,0.00071948813,0.000056149867,0.00008527916,0.00006561262,0.014115855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991554,0.0002136016,0.000033894736,0.00023327337,0.00023440135,0.00012932297],"domain_scores_gemma":[0.9961584,0.0017944371,0.00033413406,0.0009902531,0.0004086352,0.00031414055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013465849,0.00036410516,0.0005585686,0.0006616265,0.0011569032,0.0034556675,0.0010242327,0.0012668781,0.008963656],"category_scores_gemma":[0.008590691,0.00024778815,0.00040913103,0.00035489484,0.007570492,0.007117283,0.0022164362,0.0023593353,0.0010656178],"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.000008169724,0.0000042958,0.0001396203,0.000022390926,0.000004466473,0.0000351449,0.00008107883,0.0006426124,0.00038551062,0.9949974,0.0006022352,0.0030770884],"study_design_scores_gemma":[0.0000028604409,0.0000073084816,0.00009713634,0.000011479318,0.000002696989,0.000047955866,0.000039503626,0.00154272,0.0003779419,0.9917291,0.0061360365,0.0000051634024],"about_ca_topic_score_codex":0.00042238005,"about_ca_topic_score_gemma":0.0004352244,"teacher_disagreement_score":0.008963656,"about_ca_system_score_codex":0.0012204923,"about_ca_system_score_gemma":0.00069901533,"threshold_uncertainty_score":0.029986382},"labels":[],"label_agreement":null},{"id":"W1862479866","doi":"10.1090/s0002-9947-2014-06247-8","title":"Rudolph’s two step coding theorem and Alpern’s lemma for ℝ^{𝕕} actions","year":2014,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Algorithm; Annotation; Artificial intelligence; Computer science; Mathematics","score_opus":0.019353735300143785,"score_gpt":0.2751524816494668,"score_spread":0.25579874634932304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1862479866","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.058921415,0.0012951766,0.6389588,0.0048774546,0.0006149182,0.000110849585,0.00096216676,0.0013012431,0.29295793],"genre_scores_gemma":[0.7494498,0.0014682786,0.13394235,0.0022814046,0.00054095936,0.0004333866,0.0011893442,0.000949924,0.109744504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983835,0.00026261786,0.00009344409,0.00044101744,0.00047119762,0.00034818932],"domain_scores_gemma":[0.997773,0.0010718851,0.00015811928,0.00037143772,0.00045020066,0.00017534016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014745643,0.0010117274,0.0008170222,0.0020864964,0.0017096391,0.0030169366,0.0014000502,0.0012803065,0.010473711],"category_scores_gemma":[0.0042597395,0.000603659,0.0029805722,0.0012298159,0.0034698662,0.006975535,0.0037875026,0.0044429493,0.0025701479],"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.000010689836,0.0000056947415,0.000050528768,0.000020133562,0.0000046072755,0.0000254164,0.0001058737,0.0003888272,0.0002494824,0.9939184,0.0013347727,0.003885486],"study_design_scores_gemma":[0.000013736434,0.000014782282,0.00013136787,0.000016107728,0.000008603389,0.000049700724,0.000044901164,0.003758747,0.0012386742,0.9866927,0.008011906,0.0000185555],"about_ca_topic_score_codex":0.0040758126,"about_ca_topic_score_gemma":0.0022938093,"teacher_disagreement_score":0.010473711,"about_ca_system_score_codex":0.0026213087,"about_ca_system_score_gemma":0.000996135,"threshold_uncertainty_score":0.035037994},"labels":[],"label_agreement":null},{"id":"W186958188","doi":"","title":"A Good Number of Forms Fairly Beautiful: An Exploration of Biologically-Inspired Automated Design","year":2007,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cellular automaton; Robustness (evolution); Computer science; Modular design; Context (archaeology); Theoretical computer science; Data science; Process (computing); Field (mathematics); Interpretation (philosophy); Artificial intelligence; Machine learning; Mathematics; Geography; Biology; Archaeology","score_opus":0.06268090574892465,"score_gpt":0.3344084722669648,"score_spread":0.27172756651804014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186958188","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.02807453,0.0038331354,0.9123596,0.00385232,0.00018757714,0.00012178414,0.00006916185,0.00068938156,0.050812546],"genre_scores_gemma":[0.29073334,0.0028815796,0.6899984,0.0005038881,0.000088153785,0.00024038994,0.00016089319,0.00038622782,0.015007111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986858,0.00048091862,0.000072567214,0.00023899988,0.0004561399,0.000065611304],"domain_scores_gemma":[0.99815995,0.0009091759,0.00012838644,0.0005420422,0.0001655895,0.00009485954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017974704,0.000684653,0.0005029792,0.0009771865,0.0013199591,0.0030328033,0.0014553388,0.0013323792,0.0050254446],"category_scores_gemma":[0.005543076,0.0005246721,0.0010048064,0.00072757073,0.004945993,0.0037433126,0.0020720954,0.0017905222,0.0010285161],"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.000038807157,0.000048019945,0.0012768412,0.0002881977,0.000030303798,0.00012112055,0.0008579299,0.06817894,0.002719938,0.7318559,0.0035153562,0.1910686],"study_design_scores_gemma":[0.000024905126,0.0001518025,0.00044611233,0.00020626187,0.000026137164,0.00027285545,0.00034756836,0.15820473,0.002018268,0.7400706,0.09819991,0.000030835607],"about_ca_topic_score_codex":0.00090541417,"about_ca_topic_score_gemma":0.0010715853,"teacher_disagreement_score":0.0050254446,"about_ca_system_score_codex":0.0013840147,"about_ca_system_score_gemma":0.0010250947,"threshold_uncertainty_score":0.016811788},"labels":[],"label_agreement":null},{"id":"W1871468840","doi":"10.1007/978-3-642-00982-2_27","title":"A Cryptosystem Based on the Composition of Reversible Cellular Automata","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":14,"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":"Cryptosystem; Cellular automaton; Computer science; Automaton; Theoretical computer science; Neighbourhood (mathematics); Key (lock); Public key cryptosystem; Algorithm; Cryptography; Computer security; Mathematics","score_opus":0.013818549331408176,"score_gpt":0.21991515311317492,"score_spread":0.20609660378176675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871468840","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.07211979,0.0012722489,0.893848,0.00077279145,0.0010109307,0.00030088122,0.00015888081,0.002979247,0.027537264],"genre_scores_gemma":[0.7348543,0.0013122612,0.2443096,0.00026636478,0.00022273509,0.00024911747,0.00015549459,0.00018992242,0.018440166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958545,0.00009096936,0.000025772022,0.00008123672,0.00016176635,0.000054751337],"domain_scores_gemma":[0.99955946,0.00018656852,0.000032067794,0.00010810018,0.000073275216,0.000040529994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003734996,0.0004486546,0.0007895966,0.00048331826,0.0008020091,0.0011941412,0.00070286304,0.0008306127,0.0044797254],"category_scores_gemma":[0.0011770115,0.00030619782,0.0005673606,0.00049296574,0.0009953257,0.0014334578,0.0012010552,0.0012701639,0.0010434058],"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.0005951435,0.00022355138,0.00036884117,0.0003983684,0.00011421601,0.00053867896,0.00023433703,0.07725371,0.11690382,0.6404892,0.0047614817,0.1581187],"study_design_scores_gemma":[0.00032206482,0.000448655,0.0002655687,0.00007928949,0.0001332515,0.00068007695,0.000044884135,0.58164,0.12368824,0.24922475,0.04336848,0.00010472364],"about_ca_topic_score_codex":0.0003991895,"about_ca_topic_score_gemma":0.00045050148,"teacher_disagreement_score":0.0044797254,"about_ca_system_score_codex":0.00047548683,"about_ca_system_score_gemma":0.0008033289,"threshold_uncertainty_score":0.014986217},"labels":[],"label_agreement":null},{"id":"W1887353995","doi":"10.1007/11861201_12","title":"On the Dynamics of Some Exceptional Fuzzy Cellular Automata","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","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":"Carleton University","funders":"","keywords":"Cellular automaton; Computer science; Mobile automaton; Stochastic cellular automaton; Fuzzy logic; Theoretical computer science; Continuous spatial automaton; Term (time); Automaton; Fuzzy set; Asynchronous cellular automaton; Automata theory; Algorithm; Artificial intelligence; Quantum finite automata","score_opus":0.01148303974785472,"score_gpt":0.21929581325036088,"score_spread":0.20781277350250615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887353995","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.3952748,0.0023447815,0.49835166,0.0013645903,0.0004799079,0.000048737442,0.0002313434,0.0003178261,0.101586275],"genre_scores_gemma":[0.9689999,0.00079061475,0.019829875,0.00010191179,0.00011263751,0.00004028032,0.00008584043,0.000039523802,0.009999398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997657,0.000053137064,0.00001465688,0.00004550167,0.00007298448,0.000048035836],"domain_scores_gemma":[0.99932706,0.0002953792,0.000072305746,0.000066205095,0.00014067469,0.00009832822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004333643,0.00035423334,0.0006698214,0.00090538565,0.0009638852,0.0015587066,0.0006685717,0.0006976102,0.0031480885],"category_scores_gemma":[0.0021397541,0.00023723369,0.0006607673,0.00053567305,0.0015974948,0.0013088768,0.0008951899,0.0010194663,0.0002715564],"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.000018948314,0.000007636051,0.00026608462,0.000026068175,0.000008922375,0.000093687646,0.00017148793,0.022033498,0.0016707826,0.9692638,0.0006371947,0.0058018547],"study_design_scores_gemma":[0.000009101914,0.000017414872,0.00027531557,0.00002045354,0.00000979623,0.00013429203,0.00008866314,0.22909713,0.00085906667,0.76673925,0.0027318543,0.0000176526],"about_ca_topic_score_codex":0.002090985,"about_ca_topic_score_gemma":0.0013903301,"teacher_disagreement_score":0.0031480885,"about_ca_system_score_codex":0.00091450743,"about_ca_system_score_gemma":0.000436319,"threshold_uncertainty_score":0.010531366},"labels":[],"label_agreement":null},{"id":"W1913278076","doi":"10.1109/csac.1998.738644","title":"Two improved algorithms and hardware implementations for key distribution using extended programmable cellular automata","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Regina","funders":"","keywords":"Computer science; Key (lock); Cryptography; Algorithm; Key exchange; Very-large-scale integration; Table (database); Computer hardware; Simple (philosophy); Cellular automaton; Automaton; Parallel computing; Theoretical computer science; Embedded system; Encryption; Public-key cryptography","score_opus":0.03805562588103008,"score_gpt":0.2973840757843333,"score_spread":0.2593284499033032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913278076","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.014457999,0.0004942242,0.97799087,0.00021219112,0.00022172999,0.00012511913,0.00008202289,0.0020767797,0.0043389904],"genre_scores_gemma":[0.1615241,0.0004455063,0.831908,0.00015146476,0.00006792049,0.00028533646,0.00024360216,0.00009425348,0.0052799513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947816,0.00009948448,0.000057444915,0.00008647617,0.00020305443,0.00007549191],"domain_scores_gemma":[0.9992224,0.0002241953,0.000054462264,0.00023873548,0.00022707677,0.000033220123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031294054,0.00067478546,0.0005071701,0.0006905293,0.00039734054,0.00078705326,0.0014321533,0.00079739455,0.0032563999],"category_scores_gemma":[0.0015047259,0.00033457828,0.0005759485,0.00082835264,0.00051199284,0.0013606942,0.0005975435,0.0013454477,0.001471261],"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.00047192708,0.00027555422,0.0010141216,0.00054314354,0.000121565194,0.0005035605,0.00030652148,0.05506033,0.14178278,0.17749111,0.011345861,0.61108357],"study_design_scores_gemma":[0.00040227213,0.00075476646,0.0009424958,0.000086775835,0.00019343969,0.0014312506,0.000089468,0.60324776,0.24018063,0.049636353,0.102865815,0.00016900034],"about_ca_topic_score_codex":0.00070786354,"about_ca_topic_score_gemma":0.0008811317,"teacher_disagreement_score":0.0032563999,"about_ca_system_score_codex":0.00053952873,"about_ca_system_score_gemma":0.00052689976,"threshold_uncertainty_score":0.010893762},"labels":[],"label_agreement":null},{"id":"W1940678198","doi":"10.1002/jcd.21414","title":"Constructing Pandiagonal Latin Squares from Linear Cellular Automaton on Elementary Abelian Groups","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Latin square; Mathematics; Permutation (music); Lexicographical order; Combinatorics; Abelian group; Order (exchange); Prime (order theory); Cellular automaton; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.0422532410936953,"score_gpt":0.26833807122476705,"score_spread":0.22608483013107175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1940678198","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.24173704,0.00020724695,0.7382604,0.00021747898,0.00013486897,0.00018307,0.00016620141,0.0016205753,0.017473152],"genre_scores_gemma":[0.7395007,0.00015335511,0.2531572,0.00010191073,0.000019264238,0.00026163633,0.00024270748,0.00009078385,0.0064724553],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996958,0.00008354379,0.000024667108,0.00008597195,0.000059420552,0.000050564122],"domain_scores_gemma":[0.9996916,0.000114299066,0.00002877574,0.00007221227,0.000070622475,0.000022567821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016007548,0.00040068573,0.0003901913,0.0003906104,0.0005079519,0.0005152232,0.00046269683,0.00036849585,0.0029077525],"category_scores_gemma":[0.00075593276,0.00019142308,0.00051389454,0.0004266719,0.0005996073,0.0004908141,0.00082231854,0.00031874533,0.0005743264],"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.0006427344,0.00019601647,0.006017604,0.00065793464,0.00012067325,0.0015309772,0.00093624165,0.2525878,0.18067592,0.26900196,0.0049455296,0.28268656],"study_design_scores_gemma":[0.00013313904,0.0005521208,0.0011900758,0.0000670726,0.000092317045,0.00061395887,0.00035732193,0.75482064,0.09183091,0.1202984,0.029959451,0.00008451299],"about_ca_topic_score_codex":0.0014735879,"about_ca_topic_score_gemma":0.0014672114,"teacher_disagreement_score":0.0029077525,"about_ca_system_score_codex":0.00034665607,"about_ca_system_score_gemma":0.00049814093,"threshold_uncertainty_score":0.009727418},"labels":[],"label_agreement":null},{"id":"W1947011871","doi":"10.1109/cig.2015.7317958","title":"Evolvable fashion-based cellular automata for generating cavern systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Cellular automaton; Automaton; Computer science; Theoretical computer science; Artificial intelligence","score_opus":0.04308627970307399,"score_gpt":0.25417316700224074,"score_spread":0.21108688729916675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1947011871","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.19301419,0.00022633308,0.7886798,0.00016033233,0.000079923455,0.00009971318,0.00015778007,0.00105684,0.016525146],"genre_scores_gemma":[0.7736688,0.00017857866,0.21988797,0.000064749176,0.000008520535,0.00017133418,0.00020291773,0.00014174655,0.005675378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998903,0.0000293226,0.0000072395337,0.000022329381,0.000035021338,0.00001571738],"domain_scores_gemma":[0.99977726,0.00008829921,0.000020945297,0.00005086255,0.000041762647,0.000020906082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018490864,0.0002319145,0.00028789026,0.00033758944,0.00037225938,0.00057533674,0.0006425765,0.0005296569,0.0017953645],"category_scores_gemma":[0.0010836641,0.00019551374,0.00054281455,0.00025972023,0.0005081621,0.00041391485,0.0006426898,0.000513552,0.00035359312],"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.000060146835,0.00003612944,0.0017992465,0.000095899195,0.000028350561,0.00041698446,0.00023331004,0.83326155,0.041062016,0.08687873,0.0009878186,0.035139795],"study_design_scores_gemma":[0.0000127538315,0.000042728894,0.00039137478,0.0000107215365,0.0000094100515,0.0001198918,0.000032545915,0.9735747,0.0059328647,0.016396632,0.0034572368,0.000019220099],"about_ca_topic_score_codex":0.001422623,"about_ca_topic_score_gemma":0.0017951534,"teacher_disagreement_score":0.0017953645,"about_ca_system_score_codex":0.000520585,"about_ca_system_score_gemma":0.00029713777,"threshold_uncertainty_score":0.006006062},"labels":[],"label_agreement":null},{"id":"W1964667683","doi":"10.1016/s0166-218x(00)00240-7","title":"On the number of generators for transeunt triangles","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":9,"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 New Brunswick","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Generator (circuit theory); Element (criminal law); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.023782838325275574,"score_gpt":0.26715552964723055,"score_spread":0.24337269132195496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964667683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5316338,0.0018165996,0.31109884,0.0059610577,0.0008677209,0.00025804204,0.0011984487,0.0005957002,0.14656986],"genre_scores_gemma":[0.9044192,0.0007732952,0.06140902,0.000573991,0.0005159211,0.0003849384,0.00092201395,0.00043510715,0.030566527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788433,0.00077935547,0.00014297056,0.0003803881,0.00049079605,0.00032210804],"domain_scores_gemma":[0.9686983,0.02398071,0.0018210432,0.0018508992,0.001816445,0.0018324838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002419171,0.0007212352,0.0013705179,0.0017702534,0.002242837,0.0052667097,0.002713843,0.002400568,0.02284737],"category_scores_gemma":[0.022058597,0.0007419632,0.0009599297,0.0013748268,0.0039509367,0.0071419706,0.002773336,0.0031280436,0.0020423944],"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.00038164805,0.0000688979,0.0018031913,0.00011848573,0.000020104333,0.00012351506,0.00035813657,0.008193753,0.002895438,0.95916086,0.0050598113,0.021816077],"study_design_scores_gemma":[0.00009596569,0.000077455086,0.00059868663,0.000043421063,0.000023277646,0.00027713273,0.00022909517,0.03780448,0.002335448,0.9528621,0.005626651,0.000026258213],"about_ca_topic_score_codex":0.0008944337,"about_ca_topic_score_gemma":0.0013179673,"teacher_disagreement_score":0.02284737,"about_ca_system_score_codex":0.0014200081,"about_ca_system_score_gemma":0.0010029776,"threshold_uncertainty_score":0.07643211},"labels":[],"label_agreement":null},{"id":"W1965756130","doi":"10.1142/s0129183106010029","title":"MOTION REPRESENTATION OF ONE-DIMENSIONAL CELLULAR AUTOMATON RULES","year":2006,"lang":"en","type":"article","venue":"International Journal of Modern Physics C","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Representation (politics); Cellular automaton; Motion (physics); Elementary cellular automaton; Block cellular automaton; Construct (python library); Continuous automaton; Theoretical computer science; Büchi automaton; Asynchronous cellular automaton; Stochastic cellular automaton; Term (time); Mathematics; Expression (computer science); Computer science; Current (fluid); Reversible cellular automaton; Deterministic automaton; Automaton; Algorithm; Mobile automaton; Artificial intelligence; Automata theory; Physics; Programming language","score_opus":0.017774880759917674,"score_gpt":0.26121217692866394,"score_spread":0.24343729616874626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965756130","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.05351372,0.00036732186,0.918834,0.00033591647,0.00023371012,0.000081059115,0.00021925279,0.00047714022,0.025937866],"genre_scores_gemma":[0.6998291,0.0005988826,0.27983797,0.00026570962,0.00013949984,0.0003142095,0.0005459786,0.00021156437,0.018257087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996966,0.00005482886,0.00003603636,0.00007456668,0.00010298419,0.000035110083],"domain_scores_gemma":[0.9996536,0.00007490471,0.00004706257,0.00010356941,0.00009310643,0.000027794338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031197479,0.00027089388,0.00042797727,0.0005169269,0.0004556285,0.0012365392,0.0010534904,0.0006656608,0.0041063377],"category_scores_gemma":[0.001053051,0.00016843354,0.00056514883,0.0003625315,0.0010650464,0.0013729217,0.00067895063,0.0007237535,0.0006355246],"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.000015824318,0.000011541128,0.00014346087,0.00005121142,0.00000560435,0.00010105648,0.0001360791,0.03455831,0.005955971,0.94249564,0.00062474795,0.01590057],"study_design_scores_gemma":[0.000028213963,0.000042144173,0.0001601445,0.000032919845,0.000012628418,0.00015342877,0.00005882157,0.40761772,0.0045883437,0.56915784,0.0181184,0.000029363966],"about_ca_topic_score_codex":0.0011197051,"about_ca_topic_score_gemma":0.0008162965,"teacher_disagreement_score":0.0041063377,"about_ca_system_score_codex":0.00050154154,"about_ca_system_score_gemma":0.00046697826,"threshold_uncertainty_score":0.0137370825},"labels":[],"label_agreement":null},{"id":"W1966167489","doi":"10.4108/icst.simutools2009.5742","title":"Tools for DEVS Modeling, Simulation and 3D Visualization","year":2009,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Computer science; Formalism (music); Cellular automaton; Visualization; Automaton; Extension (predicate logic); Theoretical computer science; Object-oriented modeling; Modeling and simulation; Distributed computing; Programming language; Artificial intelligence; Object-oriented programming; Simulation","score_opus":0.04996324726490831,"score_gpt":0.33316143233202805,"score_spread":0.28319818506711975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966167489","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.00097199855,0.00017600485,0.9349217,0.00021233539,0.00012769761,0.000114900286,0.0033232952,0.052688673,0.0074634007],"genre_scores_gemma":[0.036790002,0.0014380292,0.8986802,0.0003598057,0.00011062432,0.0015149673,0.022392564,0.023199074,0.015514839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998828,0.0002005127,0.0001722017,0.00012716636,0.0005735701,0.00009855035],"domain_scores_gemma":[0.9971818,0.0014264601,0.00013615799,0.00055757945,0.00049880194,0.00019930484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020872024,0.0016155104,0.0011398216,0.0020812885,0.0010031272,0.0026990294,0.0035017275,0.0016512618,0.04538777],"category_scores_gemma":[0.006786055,0.0015431046,0.002325063,0.0018833535,0.00088382367,0.0028084354,0.0039910628,0.0035178796,0.014602236],"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.00034636364,0.00023106369,0.002107495,0.0020308986,0.00019100563,0.0011283598,0.001147508,0.10949626,0.018659601,0.28945667,0.28030738,0.2948975],"study_design_scores_gemma":[0.0001971346,0.000040176295,0.0004286982,0.00022981525,0.000046592122,0.00070485484,0.00011334942,0.3217609,0.021216942,0.09495649,0.5601944,0.0001107653],"about_ca_topic_score_codex":0.003133273,"about_ca_topic_score_gemma":0.0035298648,"teacher_disagreement_score":0.04538777,"about_ca_system_score_codex":0.00095854705,"about_ca_system_score_gemma":0.001593205,"threshold_uncertainty_score":0.15183723},"labels":[],"label_agreement":null},{"id":"W1967644423","doi":"10.1109/icsmc.2012.6378059","title":"3D edge detection of medical images using mathematical morphological and cellular logic array processing techniques","year":2012,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Computer science; Mathematical morphology; Edge detection; Artificial intelligence; Computer vision; Image processing; Enhanced Data Rates for GSM Evolution; Sample (material); Pattern recognition (psychology); Medical imaging; Filter (signal processing); Image (mathematics); Algorithm","score_opus":0.03290219863975896,"score_gpt":0.29322301989136057,"score_spread":0.2603208212516016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967644423","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.009531957,0.00011867198,0.98903054,0.00005924306,0.000019994963,0.000019603402,0.000022404618,0.00033332917,0.00086425664],"genre_scores_gemma":[0.103334166,0.00036303492,0.894823,0.00009427484,0.00002720527,0.000062412255,0.00006590149,0.00005728898,0.001172639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963915,0.00005073079,0.00003105195,0.000058018544,0.00019816082,0.000022846321],"domain_scores_gemma":[0.99942076,0.0002518742,0.00009325001,0.00006591663,0.00015049624,0.000017653207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003747497,0.0003855845,0.00035757263,0.0013796109,0.00022148521,0.0010182942,0.0005564335,0.0006684994,0.0012284875],"category_scores_gemma":[0.0015019086,0.00027863626,0.00059064705,0.0007955343,0.00046653196,0.0011055355,0.00047114247,0.000415031,0.0006879603],"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.00019393227,0.000058998172,0.0013421911,0.00031793892,0.000063768515,0.00041981073,0.00020035566,0.045117144,0.33358335,0.027936004,0.0013261982,0.5894403],"study_design_scores_gemma":[0.000027733231,0.00025047312,0.0026931714,0.000048281665,0.00006271669,0.0016959284,0.000094299045,0.69644463,0.26540777,0.015693326,0.017486932,0.000094715804],"about_ca_topic_score_codex":0.00028626996,"about_ca_topic_score_gemma":0.00047600784,"teacher_disagreement_score":0.0013796109,"about_ca_system_score_codex":0.00029883868,"about_ca_system_score_gemma":0.00027523452,"threshold_uncertainty_score":0.0041096807},"labels":[],"label_agreement":null},{"id":"W1967743161","doi":"10.1109/coginf.2011.6016142","title":"A modular dynamical cryptosystem based on continuous cellular automata","year":2011,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cryptosystem; Encryption; Theoretical computer science; Computer science; Cellular automaton; Cryptography; Chaotic; Modular design; Dynamical systems theory; Measure (data warehouse); Attractor; Algorithm; Mathematics; Artificial intelligence; Data mining; Physics","score_opus":0.017391323751223486,"score_gpt":0.20426004519249727,"score_spread":0.18686872144127378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967743161","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.14867139,0.0008872303,0.82133734,0.00064617035,0.0004936514,0.0001308424,0.00015333276,0.0009052493,0.026774852],"genre_scores_gemma":[0.8749081,0.000547665,0.11677366,0.00009197401,0.000071898256,0.000092186085,0.000081046426,0.00003756872,0.0073960554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998085,0.0000370908,0.00001339604,0.000042404045,0.00007321552,0.00002550716],"domain_scores_gemma":[0.99983275,0.000045212688,0.000022517062,0.000044833214,0.000033325734,0.000021270049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015746838,0.00026829424,0.00028377754,0.0003943308,0.0003615046,0.0006361133,0.0003122182,0.0004717373,0.0015607658],"category_scores_gemma":[0.0005508282,0.00011005136,0.00046885782,0.00027791355,0.0006109704,0.00066601613,0.00052290247,0.00050583587,0.0003422024],"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.00015356643,0.00008028917,0.0007297237,0.0001454304,0.000058336405,0.00052996894,0.00015665099,0.1132239,0.11782251,0.7011675,0.0018018676,0.06413021],"study_design_scores_gemma":[0.000074442425,0.0002980932,0.0006570449,0.000030945692,0.000042666175,0.0006306322,0.000030669282,0.8493377,0.042030584,0.078713164,0.028097965,0.000055990964],"about_ca_topic_score_codex":0.0006890693,"about_ca_topic_score_gemma":0.00045218092,"teacher_disagreement_score":0.0015607658,"about_ca_system_score_codex":0.00044610884,"about_ca_system_score_gemma":0.00040245455,"threshold_uncertainty_score":0.0052213073},"labels":[],"label_agreement":null},{"id":"W1968109124","doi":"10.1007/s11047-009-9144-x","title":"Modelling programmed frameshifting with frameshift machines","year":2009,"lang":"en","type":"article","venue":"Natural Computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Translational frameshift; ENCODE; Computer science; Frameshift mutation; Translation (biology); Reading frame; Theory of computation; Open reading frame; Frame (networking); Computational biology; Gene; Messenger RNA; Biology; Genetics; Algorithm; Mutation","score_opus":0.01001756640748301,"score_gpt":0.24277800606892952,"score_spread":0.23276043966144652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968109124","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.06151771,0.00019969525,0.9290573,0.00013229017,0.00012480935,0.00005298345,0.00014000798,0.00075694453,0.008018171],"genre_scores_gemma":[0.7888184,0.00026489783,0.2031951,0.00006426308,0.00005357167,0.00015179385,0.00031142792,0.00023865204,0.0069018593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948126,0.00015638188,0.000033253866,0.0001524518,0.00009106273,0.00008569707],"domain_scores_gemma":[0.999231,0.0003637106,0.00007681458,0.00015221302,0.0001299906,0.000046326244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004907458,0.00057005597,0.00052110525,0.00054501323,0.0006728018,0.0013864469,0.0013177934,0.0010068705,0.004764823],"category_scores_gemma":[0.0025661392,0.00041848302,0.001038962,0.00056244095,0.0016382283,0.0018513824,0.00095509057,0.0007793174,0.0006754118],"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.00015849798,0.0000482741,0.0005958456,0.00012325942,0.000033190645,0.00035285906,0.00040198717,0.31032917,0.012611192,0.64389026,0.0011780069,0.030277383],"study_design_scores_gemma":[0.000025756177,0.000052395088,0.00014427729,0.000019004532,0.00002074402,0.000076518976,0.00008308742,0.6236662,0.008796059,0.3601359,0.006954749,0.000025259744],"about_ca_topic_score_codex":0.003730602,"about_ca_topic_score_gemma":0.0038693564,"teacher_disagreement_score":0.004764823,"about_ca_system_score_codex":0.001090566,"about_ca_system_score_gemma":0.0007443527,"threshold_uncertainty_score":0.015939951},"labels":[],"label_agreement":null},{"id":"W1971733981","doi":"10.1017/s0143385701001584","title":"Measures that maximize weighted entropy for factor maps between subshifts of finite type","year":2001,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Subshift of finite type; Mathematics; Invariant measure; Entropy (arrow of time); Combinatorics; Measure (data warehouse); Markov chain; Topological entropy; Invariant (physics); Function (biology); Discrete mathematics; Binary entropy function; Ergodic theory; Pure mathematics; Mathematical physics; Statistics; Physics; Principle of maximum entropy","score_opus":0.025363893024377113,"score_gpt":0.24407007287816326,"score_spread":0.21870617985378615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971733981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79498255,0.0003879149,0.19699593,0.00016343122,0.000039061706,0.000043945656,0.00012144251,0.00019278585,0.007073033],"genre_scores_gemma":[0.97369325,0.0001679574,0.023221478,0.000045770055,0.00005367796,0.00007219205,0.00011459436,0.0000685093,0.0025626193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993975,0.000115955336,0.00004479011,0.00013888336,0.00016648181,0.00013640875],"domain_scores_gemma":[0.99732447,0.0013002346,0.00050464174,0.00016091447,0.0002954442,0.0004141704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011111996,0.00048289346,0.00061461364,0.0021693613,0.0007404551,0.0014540442,0.00056281185,0.0008030969,0.0021292586],"category_scores_gemma":[0.0059843026,0.0003381733,0.0006370944,0.00077770307,0.002254127,0.002606535,0.0011453388,0.00044958986,0.00022593295],"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.00023244732,0.00006249085,0.0042824442,0.00013581061,0.00006743025,0.00026469058,0.00053770875,0.03337214,0.02797505,0.91096383,0.0005824477,0.021523597],"study_design_scores_gemma":[0.00004074154,0.0002386937,0.00749998,0.00005479185,0.000045648292,0.00038892592,0.00037249218,0.2084157,0.01931487,0.7611523,0.0023607858,0.0001150333],"about_ca_topic_score_codex":0.00056950445,"about_ca_topic_score_gemma":0.00068417983,"teacher_disagreement_score":0.0021693613,"about_ca_system_score_codex":0.0013959536,"about_ca_system_score_gemma":0.00046221438,"threshold_uncertainty_score":0.0101284385},"labels":[],"label_agreement":null},{"id":"W1972326562","doi":"10.4018/jncr.2010070106","title":"Response Curves for Cellular Automata in One and Two Dimensions","year":2010,"lang":"en","type":"article","venue":"International Journal of Natural Computing Research","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Cellular automaton; Mathematics; Binary number; Automaton; Finite set; Discrete mathematics; Statistical physics; Combinatorics; Pure mathematics; Algorithm; Mathematical analysis; Computer science; Theoretical computer science; Physics; Arithmetic","score_opus":0.056994265160404955,"score_gpt":0.40738817398283245,"score_spread":0.3503939088224275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972326562","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.3420143,0.0020891917,0.6267645,0.0011938707,0.0001918367,0.0001679157,0.00028690315,0.0014676523,0.025823759],"genre_scores_gemma":[0.92780685,0.0007222152,0.063995436,0.00018674429,0.00004951474,0.00020489223,0.00023146343,0.00019163298,0.0066111838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993568,0.00020372297,0.000042723266,0.000104519146,0.00020369014,0.00008852044],"domain_scores_gemma":[0.9953518,0.003149792,0.00033891512,0.00025271784,0.00063936727,0.00026751572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010394047,0.0006057621,0.0007791711,0.0017598221,0.00074947387,0.0022220616,0.001038444,0.001527008,0.0038648979],"category_scores_gemma":[0.011468791,0.0003159398,0.00076080253,0.0009592208,0.0018213972,0.0018564147,0.0011672365,0.0013710003,0.0005918609],"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.00016102084,0.00006399965,0.0011211982,0.00021029175,0.000034392528,0.0001878645,0.00045175286,0.37090445,0.009471843,0.59640145,0.00088760967,0.02010423],"study_design_scores_gemma":[0.0000135169785,0.000026358086,0.0001941631,0.000021804075,0.000005132732,0.000041839896,0.00006228261,0.8351251,0.0017874397,0.16123436,0.0014595949,0.000028389371],"about_ca_topic_score_codex":0.0026184544,"about_ca_topic_score_gemma":0.0008900185,"teacher_disagreement_score":0.0038648979,"about_ca_system_score_codex":0.0025140892,"about_ca_system_score_gemma":0.00065576006,"threshold_uncertainty_score":0.018241107},"labels":[],"label_agreement":null},{"id":"W1972483293","doi":"10.1016/s0304-3975(01)00092-5","title":"On two-sided infinite fixed points of morphisms","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"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 Waterloo","funders":"","keywords":"Morphism; Mathematics; Fixed point; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.014840616386578827,"score_gpt":0.24063132006135882,"score_spread":0.22579070367478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972483293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61217695,0.0016367772,0.2765257,0.0013906232,0.00036480254,0.000084950196,0.00023374388,0.00044874562,0.107137755],"genre_scores_gemma":[0.922906,0.00082151906,0.04208043,0.00029007622,0.00023433428,0.00018038471,0.00029449761,0.00022016502,0.03297265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998089,0.00046601883,0.00013313328,0.0003808624,0.0004936572,0.0004372968],"domain_scores_gemma":[0.9948427,0.003102073,0.00040900335,0.00049206143,0.00053712045,0.00061698817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021363534,0.0011666158,0.0017778152,0.0040155384,0.0038878175,0.004630283,0.0019408284,0.003360101,0.006064177],"category_scores_gemma":[0.0068796393,0.0011901888,0.0022716322,0.0023930282,0.0067852675,0.006871274,0.0062920395,0.004865667,0.0009854706],"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.00004398201,0.0000174598,0.00016031237,0.000020961672,0.000007957876,0.0001597564,0.0003809558,0.0011164197,0.00059288274,0.9944944,0.00016618469,0.002838693],"study_design_scores_gemma":[0.00002340552,0.00001869872,0.000111352994,0.00001804722,0.000007818923,0.00008748369,0.00010015726,0.0038107955,0.00038941865,0.9944564,0.00096164,0.000014680516],"about_ca_topic_score_codex":0.0017605418,"about_ca_topic_score_gemma":0.0012723064,"teacher_disagreement_score":0.006064177,"about_ca_system_score_codex":0.0025907885,"about_ca_system_score_gemma":0.00085117744,"threshold_uncertainty_score":0.02028668},"labels":[],"label_agreement":null},{"id":"W1974089078","doi":"10.1049/iet-com.2013.0895","title":"Evaluation of the capacity of constrained codes with multiple constrained signalling dimensions","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Signalling; Computer science; Telecommunications; Mathematical optimization; Mathematics; Mathematical economics","score_opus":0.05790657004328654,"score_gpt":0.2757744603460956,"score_spread":0.21786789030280906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974089078","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.09106556,0.00063981157,0.8976457,0.00017630612,0.000035949353,0.00005921622,0.00016894568,0.00019950683,0.010008861],"genre_scores_gemma":[0.88516164,0.0006803212,0.110489,0.000079011676,0.0000505926,0.00017651683,0.00024005488,0.0001235369,0.0029993113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979335,0.00073633075,0.00009085333,0.00019218156,0.0008224483,0.00022475547],"domain_scores_gemma":[0.9892944,0.008204139,0.00053149124,0.0007226971,0.001038569,0.0002087347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00201236,0.001092256,0.0007223877,0.001374629,0.00042621297,0.0014476817,0.0010127852,0.0009987334,0.0020236906],"category_scores_gemma":[0.014368283,0.00035962928,0.00046402393,0.0012559216,0.0018966926,0.0023555246,0.0019195846,0.0010025324,0.0002870089],"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.00016254687,0.00002892754,0.0006660755,0.00012208846,0.0000490736,0.00010659597,0.000067863606,0.8639934,0.011251796,0.10172592,0.00036525298,0.021460446],"study_design_scores_gemma":[0.000004656269,0.000038847174,0.00021319298,0.000022353652,0.0000077566565,0.000055068303,0.000022250202,0.9690633,0.005724582,0.024255691,0.00056597905,0.0000263417],"about_ca_topic_score_codex":0.0023732483,"about_ca_topic_score_gemma":0.0015241129,"teacher_disagreement_score":0.0023732483,"about_ca_system_score_codex":0.001713164,"about_ca_system_score_gemma":0.0013579897,"threshold_uncertainty_score":0.012429893},"labels":[],"label_agreement":null},{"id":"W1977814360","doi":"10.1090/s0002-9947-2014-06259-4","title":"Classification of sofic projective subdynamics of multidimensional shifts of finite type","year":2014,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Algorithm; Type (biology); Annotation; Mathematics; Artificial intelligence; Computer science; Geology; Paleontology","score_opus":0.015920111948730664,"score_gpt":0.25813944224658836,"score_spread":0.2422193302978577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977814360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65884304,0.001164996,0.24263914,0.0008683264,0.00040394792,0.00015531664,0.0005831019,0.0009700276,0.09437209],"genre_scores_gemma":[0.9601074,0.00035492596,0.021689089,0.00022687938,0.00019063843,0.0001354526,0.00045874534,0.00024840145,0.016588438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986451,0.00017674793,0.00015066107,0.00034819602,0.0004015028,0.00027762764],"domain_scores_gemma":[0.9987708,0.0003138726,0.00018984378,0.0002527052,0.000295499,0.00017733464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052165,0.00066006865,0.0005326637,0.0024852208,0.0017356335,0.0027184633,0.0009640735,0.0009508441,0.009616548],"category_scores_gemma":[0.0029220227,0.00047720657,0.00122577,0.0013442277,0.0036386878,0.005136257,0.0027223353,0.0016775212,0.0011855373],"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.0000423853,0.000015672293,0.0008835696,0.000036936202,0.00000791145,0.00017723696,0.000523335,0.0004337753,0.0011980406,0.9869006,0.0005040573,0.009276413],"study_design_scores_gemma":[0.00004486287,0.00012420584,0.0018701698,0.000076679804,0.000026426593,0.00063057797,0.0012512873,0.0067227054,0.0046402067,0.9686141,0.015936319,0.00006235273],"about_ca_topic_score_codex":0.0010580437,"about_ca_topic_score_gemma":0.00072670326,"teacher_disagreement_score":0.009616548,"about_ca_system_score_codex":0.0018667732,"about_ca_system_score_gemma":0.00064703554,"threshold_uncertainty_score":0.032170594},"labels":[],"label_agreement":null},{"id":"W1978671960","doi":"10.1016/j.aam.2014.10.002","title":"A characterization of p-automatic sequences as columns of linear cellular automata","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cellular automaton; Characterization (materials science); Computer science; Computational biology; Mathematics; Algorithm; Biology; Materials science; Nanotechnology","score_opus":0.008061664681708791,"score_gpt":0.24596809812479858,"score_spread":0.2379064334430898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978671960","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.39686516,0.00041786343,0.5542625,0.00048565873,0.00014850723,0.000111796566,0.0010623464,0.0009441273,0.045702044],"genre_scores_gemma":[0.925616,0.00029686245,0.056238513,0.0002323882,0.0001937518,0.00019389097,0.0008801719,0.00023920543,0.016109325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953425,0.00007445942,0.000031786625,0.00014304058,0.00011992418,0.00009655828],"domain_scores_gemma":[0.9976192,0.0011588442,0.0003150465,0.00016052788,0.0004488269,0.00029757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021641112,0.0004986865,0.00044965095,0.0011871764,0.000805454,0.0022764099,0.000657466,0.0006355585,0.008267026],"category_scores_gemma":[0.0027578478,0.00036557068,0.00047495752,0.0010347305,0.0012988051,0.0014041655,0.0007607315,0.0010717185,0.00111335],"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.0001470158,0.00006476026,0.0013247352,0.00011529318,0.000017572589,0.00028676208,0.00040584416,0.013194095,0.024381608,0.9349915,0.0022771915,0.022793576],"study_design_scores_gemma":[0.000036548612,0.00019171137,0.001432104,0.000058479483,0.000024553097,0.00063301413,0.00028957048,0.245776,0.014686768,0.7243815,0.012423228,0.00006649167],"about_ca_topic_score_codex":0.001215832,"about_ca_topic_score_gemma":0.0009229506,"teacher_disagreement_score":0.008267026,"about_ca_system_score_codex":0.00056971697,"about_ca_system_score_gemma":0.00066479226,"threshold_uncertainty_score":0.0276559},"labels":[],"label_agreement":null},{"id":"W1982056354","doi":"10.1109/isit.2007.4557263","title":"Universal Data Compression with Side Information at the Decoder by Using Traditional Universal Lossless Compression Algorithms","year":2007,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lossless compression; Algorithm; Encoder; Computer science; Decoding methods; Data compression; Coding (social sciences); Theoretical computer science; Mathematics; Statistics","score_opus":0.04486756574396492,"score_gpt":0.26025750879519094,"score_spread":0.21538994305122602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982056354","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.02038561,0.0005973423,0.97454447,0.00018677473,0.000044442837,0.000052746884,0.000044915498,0.00028940514,0.003854186],"genre_scores_gemma":[0.55935615,0.0015881405,0.4310532,0.00040950204,0.00018690029,0.00013614711,0.0002047933,0.00016011573,0.006905014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880695,0.0002819378,0.00007501685,0.00019246244,0.00053214194,0.000111520414],"domain_scores_gemma":[0.99766386,0.0012586281,0.00019744945,0.0005661245,0.00026817297,0.000045821915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017169318,0.0010955997,0.0008376808,0.00077522034,0.00037441298,0.0011284132,0.0012434676,0.0010142555,0.0015567131],"category_scores_gemma":[0.0051400135,0.0003689646,0.0005272653,0.00087055645,0.0014455266,0.0035850145,0.0016937308,0.0013137719,0.0005180575],"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.00040582794,0.00013781329,0.0013315179,0.00040016382,0.0001126245,0.00045584858,0.00034182906,0.45217657,0.037282903,0.2934791,0.0015998891,0.21227597],"study_design_scores_gemma":[0.000017744473,0.00009427664,0.000100230616,0.000041203934,0.00002345183,0.00023708738,0.00003400763,0.932263,0.029420426,0.035567444,0.0021833153,0.000017778368],"about_ca_topic_score_codex":0.00068349973,"about_ca_topic_score_gemma":0.0008202474,"teacher_disagreement_score":0.0017169318,"about_ca_system_score_codex":0.0008077426,"about_ca_system_score_gemma":0.00085661496,"threshold_uncertainty_score":0.009080112},"labels":[],"label_agreement":null},{"id":"W1983153254","doi":"10.1049/iet-com.2009.0643","title":"Multimode two-dimensional balanced conservative codes for holographic storage","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multi-mode optical fiber; Coding (social sciences); Decoding methods; Computer science; Encoder; Algorithm; Encoding (memory); Mathematics; Telecommunications; Optical fiber","score_opus":0.030434688415123808,"score_gpt":0.31305131123673247,"score_spread":0.28261662282160865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983153254","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.049958687,0.0005599372,0.9371942,0.00026981113,0.00012471984,0.00007629833,0.000102549384,0.00032308922,0.0113907],"genre_scores_gemma":[0.56129944,0.00080608367,0.4237177,0.00026260334,0.0000673007,0.0002988884,0.00016814675,0.000086425774,0.013293452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998758,0.000021998438,0.000008942255,0.000015721245,0.00006274833,0.000014828638],"domain_scores_gemma":[0.99963474,0.000118106866,0.00005148854,0.000094839554,0.000080409576,0.000020422622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017882581,0.00034154422,0.0002124269,0.00039475207,0.0003382097,0.0005466236,0.00041025013,0.00039695075,0.0019036896],"category_scores_gemma":[0.0007938339,0.00014252709,0.00016154055,0.00048271744,0.00045675962,0.000671131,0.0006218075,0.00049283163,0.00043503923],"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.0001508722,0.00005309696,0.0004480499,0.00020006264,0.000016509648,0.00017009217,0.000265377,0.04252302,0.24745065,0.5365067,0.0023347219,0.16988087],"study_design_scores_gemma":[0.000040674207,0.0002329891,0.00035016055,0.00006911529,0.000018577342,0.00036883447,0.00007229191,0.5264347,0.32160586,0.11865688,0.032080244,0.000069598005],"about_ca_topic_score_codex":0.00040085614,"about_ca_topic_score_gemma":0.00090231164,"teacher_disagreement_score":0.0019036896,"about_ca_system_score_codex":0.00042206727,"about_ca_system_score_gemma":0.00045796265,"threshold_uncertainty_score":0.0063684583},"labels":[],"label_agreement":null},{"id":"W1985268884","doi":"10.1002/cplx.20115","title":"Emergence and induction of cellular automata rules via probabilistic reinforcement paradigms","year":2006,"lang":"en","type":"article","venue":"Complexity","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Computer science; Simple (philosophy); Algorithm; Probabilistic logic; Process (computing); Noise (video); Selection (genetic algorithm); Cellular automaton; Binary number; Automaton; Class (philosophy); Stochastic process; Theoretical computer science; Artificial intelligence; Mathematics; Statistics","score_opus":0.03198408503466922,"score_gpt":0.24249458930568585,"score_spread":0.21051050427101664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985268884","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.055634808,0.00013702105,0.9358536,0.00038459082,0.0000356354,0.00006064238,0.000057936697,0.00027362077,0.007562185],"genre_scores_gemma":[0.8008652,0.00020655397,0.19484185,0.00011970444,0.000042816715,0.00028309177,0.000118810734,0.00007290749,0.003449129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877435,0.00051545905,0.00007001619,0.00024325558,0.00030430593,0.000092617964],"domain_scores_gemma":[0.99519944,0.0030947682,0.00047354036,0.0007211864,0.00035269756,0.00015825729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013489582,0.00038305947,0.00046886585,0.00053990586,0.0004944675,0.0012404136,0.0011944228,0.0007818368,0.0015345862],"category_scores_gemma":[0.009410816,0.00032069182,0.00087786507,0.00035464694,0.0019615132,0.00185795,0.0013632547,0.0013817113,0.000340278],"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.000050955852,0.000053664353,0.0017345621,0.00007148627,0.0000358283,0.00020243986,0.00039719595,0.26762104,0.004595924,0.6896215,0.0007648709,0.03485051],"study_design_scores_gemma":[0.00001603036,0.000024798042,0.00021401698,0.000009437154,0.0000075062107,0.00005392841,0.000024156787,0.6872736,0.0014564628,0.30943125,0.0014774009,0.000011445254],"about_ca_topic_score_codex":0.0011178614,"about_ca_topic_score_gemma":0.0012514944,"teacher_disagreement_score":0.0015345862,"about_ca_system_score_codex":0.0009850102,"about_ca_system_score_gemma":0.00067849597,"threshold_uncertainty_score":0.0071467757},"labels":[],"label_agreement":null},{"id":"W1986516285","doi":"10.5555/1400549.1400699","title":"Design of Persian tapestry in CD","year":2008,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Formalism (music); Cellular automaton; Computer science; Automaton; Theoretical computer science; Modeling and simulation; Simulation; Algorithm","score_opus":0.031505829681491265,"score_gpt":0.22614012597642874,"score_spread":0.19463429629493748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986516285","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.2875892,0.00069440104,0.6107797,0.0003992907,0.00020110347,0.00041738254,0.0010762769,0.0037709402,0.09507169],"genre_scores_gemma":[0.8182397,0.0003015475,0.16357723,0.00009772492,0.000007668538,0.00030833966,0.0004583349,0.00017943347,0.016830096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997342,0.00007835411,0.000014810754,0.0000452575,0.0000907382,0.0000366938],"domain_scores_gemma":[0.9996693,0.00009409364,0.00003156916,0.000084167405,0.000088574554,0.000032364005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032579282,0.00036973393,0.00027083038,0.00032605758,0.00047042177,0.00087799015,0.0008347999,0.0005430761,0.008014723],"category_scores_gemma":[0.00082129,0.00018598,0.0003362805,0.00032866353,0.0006038472,0.000595734,0.0005915068,0.00038277014,0.0007392344],"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.00020599418,0.0000957381,0.0028831342,0.0003483122,0.000037029953,0.00066399155,0.0007135369,0.81328946,0.024335379,0.09899234,0.004494626,0.053940427],"study_design_scores_gemma":[0.00007038796,0.00017634798,0.00053633715,0.00005268658,0.000031731117,0.0003055919,0.00019740942,0.8836666,0.031059945,0.016759945,0.06711513,0.000028028984],"about_ca_topic_score_codex":0.0026501769,"about_ca_topic_score_gemma":0.0022421286,"teacher_disagreement_score":0.008014723,"about_ca_system_score_codex":0.0006906152,"about_ca_system_score_gemma":0.00076551735,"threshold_uncertainty_score":0.026811898},"labels":[],"label_agreement":null},{"id":"W1987783833","doi":"10.3934/dcds.2005.12.723","title":"Invariant measures for bipermutative cellular automata","year":2005,"lang":"en","type":"article","venue":"Discrete and Continuous Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Invariant (physics); Bijection; Physics; Mathematical physics; Mathematics","score_opus":0.009629854834946269,"score_gpt":0.23397129943212797,"score_spread":0.2243414445971817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987783833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5397318,0.0008026268,0.41687882,0.00055446726,0.00021381184,0.00010521778,0.0004675519,0.00076375226,0.040481918],"genre_scores_gemma":[0.9607105,0.000231813,0.03084443,0.00010178215,0.00011063742,0.00016163182,0.00028584464,0.000104472056,0.0074489457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983144,0.000249483,0.00014102043,0.000375806,0.00063582556,0.00028350018],"domain_scores_gemma":[0.997285,0.0009582205,0.0004544356,0.00042398673,0.0005032406,0.00037516493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007545351,0.00052814727,0.00060079544,0.0017372081,0.0011430068,0.0030241597,0.0012039561,0.0010040647,0.0032589608],"category_scores_gemma":[0.0031330583,0.00030236974,0.00080184935,0.0007434488,0.0031433052,0.0024623405,0.0014555855,0.0012069978,0.00052629295],"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.000020022093,0.000026818749,0.00030151734,0.000023666153,0.000009206092,0.000058907553,0.00027304844,0.0063848794,0.003142854,0.9849358,0.00028583402,0.004537497],"study_design_scores_gemma":[0.000014938894,0.000052895142,0.00049185345,0.000014501108,0.000011593045,0.00009413576,0.00014445683,0.106550105,0.003196272,0.8859555,0.0034344571,0.00003924196],"about_ca_topic_score_codex":0.0015586168,"about_ca_topic_score_gemma":0.000952892,"teacher_disagreement_score":0.0032589608,"about_ca_system_score_codex":0.0024323703,"about_ca_system_score_gemma":0.0006139723,"threshold_uncertainty_score":0.01764822},"labels":[],"label_agreement":null},{"id":"W1989320714","doi":"10.1016/j.mcm.2004.04.004","title":"Assessing cellular automata based models using partial differential equations","year":2004,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Cellular automaton; Implementation; Partial differential equation; Computer science; Convergence (economics); Ordinary differential equation; Stability (learning theory); Applied mathematics; Partial derivative; Differential equation; Mathematical optimization; Algorithm; Mathematics; Mathematical analysis; Machine learning","score_opus":0.08642092190042383,"score_gpt":0.274568494669337,"score_spread":0.1881475727689132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989320714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71427,0.00034481086,0.2781876,0.0005135465,0.000066446984,0.00018881982,0.00038624185,0.00033680486,0.005705727],"genre_scores_gemma":[0.98497885,0.00008640379,0.014168105,0.000020788786,0.000011033947,0.00006824147,0.0001650898,0.00002138507,0.00048013523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972537,0.0014459167,0.00013220121,0.0002991882,0.0007189853,0.0001500385],"domain_scores_gemma":[0.9755322,0.019732352,0.0015014932,0.00094444695,0.0018779024,0.00041172883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004059962,0.0012284489,0.0015453163,0.002016287,0.0007282957,0.0036471945,0.0015715611,0.0034389766,0.00224766],"category_scores_gemma":[0.035265207,0.0007474013,0.0010033724,0.0010728135,0.0012238252,0.003394834,0.002019529,0.00124351,0.0003398478],"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.000036378427,0.000030615975,0.0026675684,0.00002940087,0.000038948638,0.000039164817,0.0000388848,0.98762244,0.0004722571,0.0062651797,0.00007152917,0.002687601],"study_design_scores_gemma":[0.0000051374386,0.000030309922,0.00030971126,0.0000039022784,0.000009658739,0.000009432403,0.000023331178,0.99286836,0.00026102172,0.00640191,0.0000700196,0.0000071598533],"about_ca_topic_score_codex":0.011009453,"about_ca_topic_score_gemma":0.006970988,"teacher_disagreement_score":0.011009453,"about_ca_system_score_codex":0.0026044757,"about_ca_system_score_gemma":0.0017143526,"threshold_uncertainty_score":0.02189076},"labels":[],"label_agreement":null},{"id":"W1989852134","doi":"10.1177/0037549705060238","title":"Simulation and Performance Evaluation of a Public Safety Wireless Network: Case Study","year":2005,"lang":"en","type":"article","venue":"SIMULATION","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Network simulation; Sample (material); Wireless; Computer network; Wireless network; Network traffic simulation; Real-time computing; Simulation; Network traffic control; Telecommunications; Network packet","score_opus":0.07090657805984552,"score_gpt":0.3382257271841292,"score_spread":0.2673191491242837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989852134","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97681946,0.00014895709,0.016872821,0.00025994165,0.000028963306,0.00009546326,0.00022168079,0.00013433944,0.0054183216],"genre_scores_gemma":[0.99177575,0.00012882699,0.0069901883,0.000021368392,0.0000076125257,0.000048154,0.000108458466,0.000010897089,0.0009087107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917287,0.0003971322,0.00003589804,0.00007817983,0.00015821388,0.00015779541],"domain_scores_gemma":[0.99602664,0.0030134516,0.00020529082,0.00021081617,0.00037800468,0.00016570349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012065058,0.0007168261,0.0005547075,0.0007370744,0.00054134143,0.0007403804,0.0010597182,0.0010955782,0.0015072089],"category_scores_gemma":[0.0035132559,0.00027046032,0.00047157946,0.0010690617,0.0006070001,0.0008767416,0.0005983379,0.00073783804,0.00014981425],"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.00013112453,0.00028383927,0.005724494,0.000049648468,0.000038511553,0.00045168318,0.00011591646,0.9834215,0.0014245594,0.0020112856,0.0004897713,0.0058576674],"study_design_scores_gemma":[0.00003940083,0.00023016881,0.001240806,0.0000061691894,0.000018254195,0.00008124268,0.00013588977,0.99486345,0.0022634454,0.0005723402,0.0005401042,0.000008672499],"about_ca_topic_score_codex":0.012387518,"about_ca_topic_score_gemma":0.009275871,"teacher_disagreement_score":0.012387518,"about_ca_system_score_codex":0.0014195201,"about_ca_system_score_gemma":0.0006500655,"threshold_uncertainty_score":0.024630845},"labels":[],"label_agreement":null},{"id":"W1990016503","doi":"10.1016/j.crma.2012.06.007","title":"Combinatorics and topology of the Robinson tiling","year":2012,"lang":"en","type":"preprint","venue":"Comptes Rendus Mathématique","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Substitution (logic); Set (abstract data type); Mathematics; Space (punctuation); Substitution tiling; Cohomology; Combinatorics; Topology (electrical circuits); Pure mathematics; Discrete mathematics; Computer science","score_opus":0.018219426372401797,"score_gpt":0.2506366450347331,"score_spread":0.2324172186623313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990016503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8875761,0.0011172624,0.0649759,0.00041848322,0.00012546992,0.00004350518,0.0002777631,0.00018242851,0.045282986],"genre_scores_gemma":[0.97568226,0.0005490602,0.013594166,0.00006714596,0.000117858195,0.000052490734,0.0003503588,0.00006904279,0.009517566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949634,0.000092283786,0.000040370585,0.00013081817,0.00012517805,0.000114903254],"domain_scores_gemma":[0.99945956,0.00016538582,0.00013775239,0.00006826649,0.000059818627,0.00010925467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040616904,0.00044712424,0.00055594184,0.0015548385,0.0009491298,0.0023891623,0.00080345944,0.000537574,0.006712763],"category_scores_gemma":[0.0010496805,0.00033402216,0.00068129256,0.00097387674,0.002110464,0.0025817978,0.0015846089,0.00073159614,0.00083332433],"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.00006336675,0.00002067413,0.000720266,0.00007195454,0.000012083497,0.00045317868,0.000443197,0.0033339942,0.0059239725,0.9823745,0.00042635863,0.0061564036],"study_design_scores_gemma":[0.000052022908,0.00015274058,0.0013627078,0.000037959853,0.000029737179,0.00084450736,0.00088985934,0.014148051,0.007034945,0.9624672,0.012937978,0.00004233629],"about_ca_topic_score_codex":0.00071989716,"about_ca_topic_score_gemma":0.00053190347,"teacher_disagreement_score":0.006712763,"about_ca_system_score_codex":0.0005672132,"about_ca_system_score_gemma":0.00029091234,"threshold_uncertainty_score":0.022456408},"labels":[],"label_agreement":null},{"id":"W1996579752","doi":"10.1016/j.tcs.2014.11.005","title":"A family of sand automata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Surjective function; Mathematics; Equicontinuity; Deterministic automaton; Automaton; Two-way deterministic finite automaton; Stochastic cellular automaton; Continuous automaton; Simple (philosophy); Discrete mathematics; Cellular automaton; Mobile automaton; Theoretical computer science; Algorithm; Automata theory; Computer science; Quantum finite automata; Finite-state machine","score_opus":0.007572707418624368,"score_gpt":0.23374007002613253,"score_spread":0.22616736260750817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996579752","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.2262765,0.0033831666,0.5358855,0.0016281914,0.000637639,0.00024796618,0.0010937374,0.0022951984,0.22855219],"genre_scores_gemma":[0.8478988,0.0018629787,0.07052388,0.00053676765,0.00020633638,0.00036479405,0.0008554477,0.00029697595,0.07745396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995215,0.00008876016,0.00003080356,0.00014055213,0.00012716731,0.00009119771],"domain_scores_gemma":[0.99870884,0.00043738837,0.00011579357,0.00026570784,0.0003066719,0.00016549233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225475,0.0007631421,0.0009442375,0.0015995434,0.0026197473,0.0028227887,0.0011146793,0.0016544177,0.009354547],"category_scores_gemma":[0.0033093512,0.0005497718,0.0012679296,0.0012575903,0.0017444396,0.002382678,0.00145249,0.0015398191,0.0017111273],"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.00003618121,0.000017428842,0.0004408278,0.000045424873,0.000019227773,0.00016419047,0.0001749937,0.0059911655,0.0013004942,0.97721523,0.0026169408,0.01197792],"study_design_scores_gemma":[0.00002404666,0.000016669506,0.00030098815,0.000028177385,0.00001969056,0.000320574,0.00012256156,0.059029747,0.0009581115,0.9213635,0.01779306,0.00002276907],"about_ca_topic_score_codex":0.003620529,"about_ca_topic_score_gemma":0.0027644918,"teacher_disagreement_score":0.009354547,"about_ca_system_score_codex":0.0013486075,"about_ca_system_score_gemma":0.0011902862,"threshold_uncertainty_score":0.031294107},"labels":[],"label_agreement":null},{"id":"W1997620176","doi":"10.1016/j.laa.2012.01.025","title":"Theory and applications of matrices described by patterns: Preface and workshop report","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","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":"University of Victoria; University of Regina","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics","score_opus":0.010946673526751691,"score_gpt":0.25454846255762165,"score_spread":0.24360178903086996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997620176","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011617177,0.43584493,0.22416605,0.03997952,0.13140754,0.000421826,0.0026352364,0.0005496231,0.15337808],"genre_scores_gemma":[0.09879844,0.37629175,0.077640936,0.0073931837,0.105099805,0.0006339146,0.0058290204,0.00087696646,0.32743603],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988304,0.00022446582,0.00010391848,0.00034580444,0.00038750464,0.0001079717],"domain_scores_gemma":[0.9976762,0.0006315316,0.000090129244,0.00020202718,0.0011207662,0.000279329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002797074,0.0018520401,0.0012611991,0.0026115843,0.0010790372,0.003874364,0.0017191062,0.0018600144,0.023851514],"category_scores_gemma":[0.003940927,0.00084247376,0.001510686,0.0042090975,0.0013157956,0.004927315,0.0022813354,0.0044398946,0.009584733],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00015608605,0.00042358667,0.00055447925,0.0020948073,0.00009483896,0.00022374994,0.0007913818,0.005731075,0.0037136448,0.2146698,0.4192363,0.3523103],"study_design_scores_gemma":[0.000020813237,0.00020507321,0.0012800463,0.00075506716,0.00004514387,0.00032967207,0.00036019026,0.003514955,0.0022787587,0.13697006,0.8541546,0.00008569718],"about_ca_topic_score_codex":0.0023681833,"about_ca_topic_score_gemma":0.0020486123,"teacher_disagreement_score":0.023851514,"about_ca_system_score_codex":0.0030145396,"about_ca_system_score_gemma":0.0017795304,"threshold_uncertainty_score":0.07979125},"labels":[],"label_agreement":null},{"id":"W1998330138","doi":"10.1177/0037549705052233","title":"Cell-DEVS/GDEVS for Complex Continuous Systems","year":2005,"lang":"en","type":"article","venue":"SIMULATION","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Formalism (music); Computer science; Cellular automaton; Asynchronous communication; Ordinary differential equation; Automaton; Theoretical computer science; Modeling and simulation; Complex system; Discrete event simulation; Distributed computing; Differential equation; Algorithm; Mathematics; Simulation; Artificial intelligence","score_opus":0.030830416995493392,"score_gpt":0.285843586839928,"score_spread":0.2550131698444346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998330138","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.001077701,0.00013416095,0.9937836,0.0001344762,0.00008614836,0.000036871643,0.00023833351,0.0017109094,0.0027977454],"genre_scores_gemma":[0.091952555,0.000773223,0.8968181,0.00029383268,0.00010638769,0.0005337114,0.0018430172,0.0012970486,0.0063821175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898976,0.0002993277,0.00015302238,0.00011818238,0.00037808754,0.000061527535],"domain_scores_gemma":[0.9978441,0.0012328209,0.00010335404,0.00047957455,0.0002793464,0.000060788843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018796192,0.00094852824,0.0006663247,0.00059678085,0.00049312436,0.001817688,0.0017638995,0.0011411275,0.007896929],"category_scores_gemma":[0.004952982,0.0006252227,0.0016451636,0.0006022941,0.0011619908,0.0015847455,0.0018347751,0.0026566782,0.0021777507],"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.000060111393,0.000030296615,0.00043260976,0.00035659855,0.000040717223,0.00028148547,0.00022525367,0.119889624,0.006496298,0.79002523,0.01091975,0.071242034],"study_design_scores_gemma":[0.000058784186,0.000036081197,0.0000888415,0.00007092106,0.000019843836,0.00024114251,0.000037127298,0.61199856,0.012577343,0.21150875,0.16333044,0.00003218031],"about_ca_topic_score_codex":0.0014615385,"about_ca_topic_score_gemma":0.0017927651,"teacher_disagreement_score":0.007896929,"about_ca_system_score_codex":0.00093308574,"about_ca_system_score_gemma":0.0010482201,"threshold_uncertainty_score":0.026417851},"labels":[],"label_agreement":null},{"id":"W1998871257","doi":"10.1162/leon_a_00525","title":"<i>Context Machines:</i> A Series of Situated and Self-Organizing Artworks","year":2013,"lang":"en","type":"article","venue":"Leonardo","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kwantlen Polytechnic University; Surrey Memorial Hospital","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Situated; Generative grammar; Creativity; Context (archaeology); Computer science; Process (computing); Associative property; Visual arts; Association (psychology); Cognitive science; Art; Artificial intelligence; Psychology; History; Archaeology; Mathematics","score_opus":0.004879217012595659,"score_gpt":0.18161393585996927,"score_spread":0.1767347188473736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998871257","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055368625,0.017059274,0.5286856,0.013999271,0.0027323337,0.0001669114,0.00022404459,0.0015535338,0.38021037],"genre_scores_gemma":[0.77365875,0.007515847,0.11291448,0.0021561517,0.0008716598,0.00029124622,0.00014392045,0.00028825365,0.10215964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998012,0.00004879514,0.000008251789,0.00006237269,0.00004513398,0.00003428132],"domain_scores_gemma":[0.9998073,0.000072671086,0.000023017106,0.000039065282,0.000028447526,0.000029482231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020407604,0.00041899315,0.00024300707,0.0005984275,0.0014046564,0.0038619454,0.00078903657,0.0014747382,0.0051380848],"category_scores_gemma":[0.0008900592,0.00025050805,0.0004944152,0.0006996445,0.0035394009,0.0033762353,0.0013934532,0.0010902616,0.0010390913],"study_design_candidate":"not_applicable","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.000022945089,0.000012093588,0.00034759386,0.00009039432,0.000011734761,0.0001900145,0.0014548342,0.004664713,0.0026988215,0.943132,0.010818893,0.036556013],"study_design_scores_gemma":[0.000011534802,0.00005302129,0.000717377,0.00014966763,0.000031369673,0.0006422442,0.0010355444,0.04314261,0.006717035,0.4213963,0.52605724,0.000046100587],"about_ca_topic_score_codex":0.0019017155,"about_ca_topic_score_gemma":0.002028084,"teacher_disagreement_score":0.0051380848,"about_ca_system_score_codex":0.0010084545,"about_ca_system_score_gemma":0.00031127693,"threshold_uncertainty_score":0.017188668},"labels":[],"label_agreement":null},{"id":"W1999245225","doi":"10.1109/cjece.2009.5599419","title":"Guest editorial: Special issue on the 2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","year":2009,"lang":"en","type":"editorial","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Pacific Rim; Telecommunications; Event (particle physics); Library science; Asia pacific; Political science; Media studies; Engineering; History; Computer science; Sociology; Archaeology; Ethnology","score_opus":0.009193422414868832,"score_gpt":0.20682954647783441,"score_spread":0.19763612406296557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999245225","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043899985,0.0028789062,0.00012623021,0.017836371,0.97645265,0.000026048878,0.00006229468,0.000048386468,0.0025251713],"genre_scores_gemma":[0.00051341706,0.0046508634,0.0001269099,0.009334003,0.9635078,0.000026741838,0.0000742758,0.00006718577,0.021698862],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99730116,0.0002970952,0.00031002806,0.00037972574,0.0015098074,0.0002022334],"domain_scores_gemma":[0.9891972,0.0021827372,0.00070739904,0.00022364872,0.005819661,0.0018693743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037473426,0.0037018552,0.003283022,0.0029876912,0.0022898244,0.005956908,0.0028040719,0.008985288,0.029659921],"category_scores_gemma":[0.0121415295,0.0010257653,0.002056464,0.001257683,0.0014767528,0.0037240575,0.0009377255,0.011368904,0.029523067],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000034646095,0.000011692862,0.000020629928,0.00013213023,0.000009830961,0.00009167969,0.00000545467,0.000022309843,0.000078230914,0.00014610622,0.9956552,0.0037920661],"study_design_scores_gemma":[0.0000528612,0.00003088034,0.00026276062,0.00022588628,0.00003704019,0.00027410474,0.000026624475,0.00012979664,0.00022069782,0.00047439302,0.998251,0.000013855341],"about_ca_topic_score_codex":0.001187168,"about_ca_topic_score_gemma":0.0041236216,"teacher_disagreement_score":0.029659921,"about_ca_system_score_codex":0.0023470446,"about_ca_system_score_gemma":0.0022309856,"threshold_uncertainty_score":0.09922236},"labels":[],"label_agreement":null},{"id":"W1999636241","doi":"10.1016/j.dam.2014.02.005","title":"Diametral broadcast graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","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":"Concordia University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009687206107418208,"score_gpt":0.22364444937069797,"score_spread":0.21395724326327975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999636241","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.30922624,0.0012226017,0.3910204,0.0058639543,0.0005934757,0.0003533649,0.0032917198,0.0013112219,0.28711694],"genre_scores_gemma":[0.8451319,0.0010077846,0.051906057,0.0014522192,0.0003266714,0.00039746505,0.0022054645,0.00035050552,0.09722199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999358,0.00015902062,0.00002771604,0.00016929288,0.00012928752,0.00015668818],"domain_scores_gemma":[0.99661344,0.0015325164,0.00032550414,0.0005413655,0.0004721203,0.00051505014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004235186,0.00053823105,0.00074526976,0.0012992728,0.0017356534,0.0017808973,0.0014996993,0.0012762302,0.019647554],"category_scores_gemma":[0.003577592,0.00047814412,0.000488663,0.0011694601,0.0014622672,0.0022066578,0.0022869774,0.0026114003,0.0023330895],"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.00013910342,0.000025870544,0.0002183228,0.00006962309,0.000010241746,0.00010299394,0.00014514933,0.0040546027,0.0021833219,0.9772321,0.0063838763,0.009434833],"study_design_scores_gemma":[0.000070572554,0.00003358482,0.00033759302,0.000031445124,0.00002504441,0.0002642379,0.00022928222,0.029562688,0.0021395772,0.94889003,0.018399315,0.000016656402],"about_ca_topic_score_codex":0.0020544357,"about_ca_topic_score_gemma":0.0025402035,"teacher_disagreement_score":0.019647554,"about_ca_system_score_codex":0.0015569319,"about_ca_system_score_gemma":0.0007875909,"threshold_uncertainty_score":0.06572765},"labels":[],"label_agreement":null},{"id":"W1999980641","doi":"10.1109/tip.2015.2409571","title":"Generation of Spatial Orders and Space-Filling Curves","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Space (punctuation); Raster graphics; Scaling; Integer (computer science); Algorithm; Decoding methods; Domain (mathematical analysis); Family of curves; Geometry; Mathematical analysis; Computer science; Computer vision","score_opus":0.04916345716011654,"score_gpt":0.2793771381688666,"score_spread":0.23021368100875006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999980641","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.07715411,0.000289316,0.8893356,0.00021651872,0.0001221434,0.00019201274,0.00024795055,0.002123663,0.03031866],"genre_scores_gemma":[0.35249382,0.0003853349,0.632799,0.00009546762,0.000039314462,0.00023305615,0.0005889204,0.0009771121,0.012387933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934727,0.00008528,0.000049115308,0.000111247944,0.00032274396,0.000084337604],"domain_scores_gemma":[0.9986187,0.00044979274,0.00009751971,0.00037721306,0.00038054772,0.00007613859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048831984,0.00058540073,0.0005675158,0.0011967449,0.00092324615,0.001546912,0.00085339847,0.00049670687,0.00672938],"category_scores_gemma":[0.003229739,0.00035915716,0.00052361796,0.0011436385,0.0013231264,0.0014993965,0.0016037852,0.0009335873,0.0023268845],"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.00017143696,0.00006819265,0.0010486464,0.0002407426,0.000015110908,0.0005042336,0.00081417593,0.050374046,0.06603052,0.6119832,0.004982519,0.26376718],"study_design_scores_gemma":[0.000061190236,0.00019172228,0.0005640402,0.000108409695,0.000020721236,0.00087726605,0.00041704625,0.34288284,0.17850682,0.37572524,0.10053971,0.00010501418],"about_ca_topic_score_codex":0.00070618076,"about_ca_topic_score_gemma":0.0006076281,"teacher_disagreement_score":0.00672938,"about_ca_system_score_codex":0.0007310643,"about_ca_system_score_gemma":0.00084085774,"threshold_uncertainty_score":0.022512078},"labels":[],"label_agreement":null},{"id":"W2000347498","doi":"10.2495/dne-v6-n1-34-51","title":"Application of Semitotalistic 2D Cellular Automata on a Triangulated 3D Surface","year":2011,"lang":"en","type":"article","venue":"International Journal of Design & Nature and Ecodynamics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cellular automaton; Grid; Tessellation (computer graphics); Surface (topology); Context (archaeology); State (computer science); Boundary (topology); Envelope (radar); Regular grid; Mathematics; Type (biology); Theoretical computer science; Computer science; Geometry; Algorithm; Mathematical analysis; Geography","score_opus":0.013780509006726347,"score_gpt":0.24405124533567393,"score_spread":0.2302707363289476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000347498","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.09481961,0.00026224784,0.88488024,0.00015751646,0.0000772849,0.000059136255,0.00014504982,0.00057397044,0.019024946],"genre_scores_gemma":[0.8206853,0.00027315557,0.17554966,0.00005018523,0.00001482945,0.00008947022,0.00015270908,0.00006208401,0.003122581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996847,0.000067298184,0.000026192007,0.00007177777,0.00011547543,0.000034585097],"domain_scores_gemma":[0.9996859,0.00011438521,0.000025070345,0.00007908821,0.00007272056,0.000022984286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023581182,0.0003107056,0.00048257044,0.00035642824,0.00056656403,0.001098282,0.0009893978,0.0005994698,0.001275152],"category_scores_gemma":[0.00091601344,0.0002070199,0.0009916197,0.00040255144,0.0009492546,0.0006343528,0.0012497909,0.0003569446,0.00024971584],"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.000047364898,0.000014074023,0.00090660213,0.0001010934,0.000030087502,0.00028523096,0.00032842453,0.8092558,0.019007146,0.13840443,0.00046577395,0.031153994],"study_design_scores_gemma":[0.0000040924956,0.000018636701,0.00009161337,0.0000056890685,0.000006349538,0.0000544034,0.000027582531,0.9785725,0.0022396431,0.017090669,0.0018784252,0.000010389539],"about_ca_topic_score_codex":0.005951162,"about_ca_topic_score_gemma":0.0033693686,"teacher_disagreement_score":0.005951162,"about_ca_system_score_codex":0.00073839334,"about_ca_system_score_gemma":0.00051801675,"threshold_uncertainty_score":0.011833072},"labels":[],"label_agreement":null},{"id":"W2000986355","doi":"10.1016/s0020-0190(01)00231-9","title":"On enumeration of catastrophic fault patterns","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Cellular Automata and Applications","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":"Carleton University","funders":"","keywords":"Combinatorics; Enumeration; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","score_opus":0.009894622370969868,"score_gpt":0.20068764577932288,"score_spread":0.19079302340835302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000986355","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.26990053,0.0009058736,0.6850488,0.0018917704,0.00028238594,0.00013001564,0.0013233068,0.0010791095,0.03943821],"genre_scores_gemma":[0.83276695,0.00095783395,0.15002622,0.0006031073,0.00020776833,0.00023381397,0.0025716804,0.00029076744,0.0123418635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991685,0.00024160893,0.000070124435,0.00013093774,0.0002522529,0.00013647092],"domain_scores_gemma":[0.99058867,0.006865363,0.0005591535,0.0009123553,0.00081283966,0.00026170284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070358947,0.0006856697,0.0008861219,0.0016312537,0.00080994726,0.0016662095,0.0012118373,0.0011404244,0.0061295484],"category_scores_gemma":[0.01293974,0.0005069712,0.00072028633,0.002039174,0.001082326,0.0027354741,0.0019382816,0.0013427384,0.00065224903],"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.00044966882,0.00014210398,0.0054027783,0.00051227707,0.00007770165,0.00045826557,0.00041272445,0.13796519,0.006250289,0.6426857,0.017517474,0.18812586],"study_design_scores_gemma":[0.000023482016,0.000043553406,0.0005071412,0.000050736056,0.000018509048,0.0002305637,0.00007361777,0.21359,0.0015561476,0.7816882,0.0022022813,0.000015809797],"about_ca_topic_score_codex":0.00077133405,"about_ca_topic_score_gemma":0.0014251054,"teacher_disagreement_score":0.0061295484,"about_ca_system_score_codex":0.0005968477,"about_ca_system_score_gemma":0.00065516785,"threshold_uncertainty_score":0.020505428},"labels":[],"label_agreement":null},{"id":"W2001707131","doi":"10.1007/s11047-010-9193-1","title":"Towards a neighborhood simplification of tile systems: From Moore to quasi-linear dependencies","year":2010,"lang":"en","type":"article","venue":"Natural Computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Academy of Finland","keywords":"Tile; Matching (statistics); Ribbon; Enhanced Data Rates for GSM Evolution; Dependency (UML); Process (computing); Computer science; Mathematics; Square (algebra); Topology (electrical circuits); Algorithm; Combinatorics; Geometry; Artificial intelligence","score_opus":0.012164872325349992,"score_gpt":0.26569957477120976,"score_spread":0.25353470244585974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001707131","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.0880636,0.00044900159,0.88656217,0.0008212368,0.00012873298,0.00005246643,0.00024791982,0.00048451006,0.023190336],"genre_scores_gemma":[0.7425047,0.00070293323,0.24012025,0.00045255743,0.0002388822,0.00014336084,0.00066267635,0.00053365174,0.014641002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993316,0.00019848223,0.00004392739,0.00018199637,0.00015840644,0.00008557587],"domain_scores_gemma":[0.9973072,0.0011785991,0.00015901061,0.0009317273,0.0002905432,0.00013301757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006611437,0.0003115572,0.0011322502,0.0006893783,0.001315223,0.0016693574,0.0015500992,0.00088813953,0.0059792357],"category_scores_gemma":[0.0049084043,0.0005724713,0.0015304798,0.00078389276,0.0029063893,0.0041052536,0.0027711673,0.0021806518,0.0007707723],"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.00003720529,0.00002240737,0.00035317946,0.00007080646,0.000014824498,0.00006979552,0.00032008323,0.032038253,0.0015601745,0.94462806,0.0022500113,0.018635174],"study_design_scores_gemma":[0.000010336741,0.000018125982,0.00016880786,0.000011736969,0.00001179713,0.000043807668,0.000069759335,0.10488269,0.0010625191,0.888786,0.004922365,0.000011963644],"about_ca_topic_score_codex":0.0035207742,"about_ca_topic_score_gemma":0.0047934926,"teacher_disagreement_score":0.0059792357,"about_ca_system_score_codex":0.0009908656,"about_ca_system_score_gemma":0.0007553491,"threshold_uncertainty_score":0.020002544},"labels":[],"label_agreement":null},{"id":"W2002921350","doi":"10.1145/2486159.2486178","title":"Parallel rotor walks on finite graphs and applications in discrete load balancing","year":2013,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Security token; Rotor (electric); Computer science; Node (physics); Graph; Process (computing); Topology (electrical circuits); Mathematics; Computer network; Theoretical computer science; Combinatorics; Engineering; Electrical engineering; Structural engineering","score_opus":0.008214123691781969,"score_gpt":0.22481321151460154,"score_spread":0.21659908782281956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002921350","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.14612316,0.0031946143,0.8323758,0.0014000094,0.00034373175,0.00007201619,0.00011712546,0.0003692544,0.016004322],"genre_scores_gemma":[0.8851879,0.0027250599,0.09981068,0.0003160576,0.0004212034,0.00016869737,0.00018737494,0.00019861717,0.010984417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995691,0.00020192424,0.000022503462,0.00006850989,0.000078273595,0.000059644764],"domain_scores_gemma":[0.9972372,0.00193346,0.00028422568,0.00018320598,0.00014831986,0.00021349406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007638748,0.0008262537,0.0008335127,0.001319019,0.0010522286,0.0014939066,0.0011661196,0.0015430151,0.003000917],"category_scores_gemma":[0.00427077,0.0004512558,0.0007543424,0.001517442,0.0020787616,0.002334666,0.0012911108,0.0013501536,0.00046295955],"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.000055827863,0.00006912307,0.0005603186,0.00008948466,0.000021030963,0.00024877576,0.0002014369,0.16712406,0.0020475476,0.8168087,0.0014507482,0.011322925],"study_design_scores_gemma":[0.000017264249,0.000024118699,0.00011045784,0.000013748044,0.0000069815696,0.000079487225,0.000048149956,0.51974225,0.00034464872,0.4777938,0.0018055375,0.000013559965],"about_ca_topic_score_codex":0.001725943,"about_ca_topic_score_gemma":0.0018754909,"teacher_disagreement_score":0.003000917,"about_ca_system_score_codex":0.0008487566,"about_ca_system_score_gemma":0.00046710513,"threshold_uncertainty_score":0.0100390315},"labels":[],"label_agreement":null},{"id":"W2003034217","doi":"10.1016/j.biosystems.2009.04.001","title":"Information processing mechanisms in microtubules at physiological temperature: Model predictions for experimental tests","year":2009,"lang":"en","type":"article","venue":"Biosystems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Alberta","funders":"","keywords":"Asynchronous communication; Cellular automaton; Information processing; Statistical physics; Biological system; Microtubule; Computer science; Quantum cellular automaton; Quantum; Quantum information processing; Signal processing; Phase diagram; Theoretical computer science; Physics; Algorithm; Phase (matter); Biology; Quantum mechanics; Neuroscience; Digital signal processing","score_opus":0.018078329084991247,"score_gpt":0.25613196470957733,"score_spread":0.2380536356245861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003034217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88350046,0.0014357711,0.09994452,0.00251185,0.00017242097,0.000065918226,0.00048013026,0.00039249475,0.011496519],"genre_scores_gemma":[0.99549806,0.0004510019,0.0031765148,0.000050643932,0.000022687242,0.000046968995,0.00009443052,0.000024410805,0.00063528994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987113,0.000029949735,0.000008121899,0.000030182964,0.000031987496,0.000028692633],"domain_scores_gemma":[0.99822634,0.0011876515,0.00015462213,0.00013012472,0.00021763792,0.00008371858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064838375,0.0004363121,0.0006076516,0.000443892,0.00050334446,0.00094466674,0.0011673166,0.0009168494,0.002542112],"category_scores_gemma":[0.00454486,0.00032807278,0.0005983012,0.00030007714,0.001106536,0.0024830278,0.00038023037,0.0007198447,0.000403007],"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.00026312162,0.00014595399,0.0019560712,0.00030128087,0.00004016063,0.0001554182,0.0001536147,0.84839696,0.025975795,0.11490848,0.0015129292,0.006190227],"study_design_scores_gemma":[0.000030160521,0.000032309104,0.0008458885,0.000012579937,0.000013812721,0.00002350228,0.000034677785,0.94929075,0.005090251,0.044415887,0.00018532824,0.00002475612],"about_ca_topic_score_codex":0.0032415632,"about_ca_topic_score_gemma":0.0016259049,"teacher_disagreement_score":0.0032415632,"about_ca_system_score_codex":0.0012345373,"about_ca_system_score_gemma":0.0008561507,"threshold_uncertainty_score":0.008957207},"labels":[],"label_agreement":null},{"id":"W2004426031","doi":"10.1371/annotation/9a35fa58-f81c-41b4-9fa9-c1aeedbf0fff","title":"Correction: Estimating the Stochastic Bifurcation Structure of Cellular Networks","year":2010,"lang":"en","type":"article","venue":"PLoS Computational Biology","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Ottawa; Ottawa Hospital","funders":"Mitacs; Ottawa Hospital Research Institute","keywords":"Computer science; Statistical physics; Physics","score_opus":0.008962325876049884,"score_gpt":0.23272813572676135,"score_spread":0.22376580985071146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004426031","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003185748,0.0026033958,0.0528354,0.039488338,0.86370397,0.00014114678,0.016320957,0.0068558822,0.01486517],"genre_scores_gemma":[0.2135985,0.00712395,0.08241458,0.020715153,0.17035809,0.0009392786,0.030950354,0.012567254,0.46133274],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963559,0.00067460374,0.00051542575,0.0007442076,0.0014620718,0.00024776324],"domain_scores_gemma":[0.94996566,0.0121934945,0.002077756,0.007024401,0.027470853,0.0012678703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036124054,0.001674558,0.0013234717,0.005104628,0.0019532086,0.0032145127,0.0033421412,0.0029567794,0.16037509],"category_scores_gemma":[0.10421177,0.0008145696,0.0014181662,0.0046863956,0.0011872811,0.0030608228,0.0025647604,0.0041657435,0.048294652],"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.00013811469,0.000011101643,0.0008485827,0.0005397676,0.00007768255,0.00029008993,0.00010466318,0.0016939556,0.00058415026,0.008933686,0.9394788,0.047299348],"study_design_scores_gemma":[0.00011586536,0.000053529457,0.0047079264,0.00048963795,0.00011703297,0.0010616338,0.0001266621,0.011708601,0.0027307314,0.01863078,0.96012914,0.00012843976],"about_ca_topic_score_codex":0.008745542,"about_ca_topic_score_gemma":0.0073715625,"teacher_disagreement_score":0.16037509,"about_ca_system_score_codex":0.0026985942,"about_ca_system_score_gemma":0.0031647421,"threshold_uncertainty_score":0.5365081},"labels":[],"label_agreement":null},{"id":"W2004793105","doi":"10.1007/s00224-010-9264-9","title":"Tilings and Submonoids of Metabelian Groups","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Undecidable problem; Mathematics; Rank (graph theory); Group (periodic table); Combinatorics; Wreath product; Free product; Pure mathematics; Discrete mathematics; Product (mathematics); Physics; Decidability","score_opus":0.008176804284704712,"score_gpt":0.22122718702054084,"score_spread":0.21305038273583612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004793105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6268089,0.004945254,0.29051027,0.0014405134,0.00069568685,0.00009528604,0.00040444505,0.00050306885,0.07459658],"genre_scores_gemma":[0.94617236,0.0010874895,0.03468605,0.00028645262,0.0004331258,0.00012357935,0.00027333474,0.000101012694,0.016836671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995541,0.000111665366,0.000038543516,0.00011733239,0.00010463703,0.00007378442],"domain_scores_gemma":[0.9991099,0.00036323068,0.00014698923,0.000120942335,0.000098203025,0.00016063014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045627044,0.00047153406,0.00077720266,0.0014548405,0.0011897717,0.002238181,0.0007498122,0.00075210613,0.0056709647],"category_scores_gemma":[0.0016009795,0.0003447541,0.0007453919,0.00086360826,0.0023492766,0.0027133902,0.0015422822,0.0008288772,0.0005719278],"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.000017223974,0.000006591202,0.00016430145,0.00002407267,0.000005428687,0.0000623916,0.00035227902,0.0005640061,0.001197792,0.9921238,0.0003747504,0.0051073725],"study_design_scores_gemma":[0.000009669686,0.000013674287,0.0001556331,0.000008809422,0.0000048468855,0.00007627778,0.00010997365,0.0025416268,0.0004836423,0.9930339,0.0035551204,0.0000068246004],"about_ca_topic_score_codex":0.0007614441,"about_ca_topic_score_gemma":0.00075804855,"teacher_disagreement_score":0.0056709647,"about_ca_system_score_codex":0.0007274346,"about_ca_system_score_gemma":0.00035120314,"threshold_uncertainty_score":0.018971264},"labels":[],"label_agreement":null},{"id":"W2005442946","doi":"10.1007/s11227-006-2742-9","title":"A Parallel Approach Eliminates Measurement Perturbations in RLC Circuits","year":2006,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; RLC circuit; Electronic circuit; Parallel computing; Electrical engineering; Voltage; Capacitor","score_opus":0.02849223114808994,"score_gpt":0.221802715866332,"score_spread":0.19331048471824205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005442946","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.0144091975,0.0000967779,0.97404027,0.0003415738,0.00016707757,0.00013732472,0.00009283707,0.002854364,0.007860537],"genre_scores_gemma":[0.48672915,0.00014958577,0.49625474,0.0006213299,0.0002829339,0.00029389738,0.00028215197,0.0008918679,0.014494318],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99811906,0.0002985786,0.00008661194,0.0005109732,0.00081714283,0.00016750516],"domain_scores_gemma":[0.9967354,0.0006233292,0.00019004628,0.0018105512,0.0005422017,0.000098547614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088942004,0.0015941839,0.0016146332,0.0007042274,0.0014047286,0.0016732066,0.0027311475,0.0014985772,0.008444189],"category_scores_gemma":[0.003487114,0.0007337365,0.00080017967,0.0008526467,0.001124457,0.0026249916,0.0024221323,0.0020514482,0.0028404857],"study_design_candidate":"bench_or_experimental","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.0009836908,0.00068445323,0.0014014741,0.00036065813,0.0001399227,0.00050660095,0.00021931544,0.059046593,0.28893548,0.1368576,0.006475698,0.5043886],"study_design_scores_gemma":[0.000106590865,0.00032765864,0.00067801465,0.000025802568,0.0001168432,0.000655451,0.000052819778,0.72356415,0.20724425,0.055561304,0.01160685,0.00006025469],"about_ca_topic_score_codex":0.0017922294,"about_ca_topic_score_gemma":0.0036930707,"teacher_disagreement_score":0.008444189,"about_ca_system_score_codex":0.0010886665,"about_ca_system_score_gemma":0.0018418132,"threshold_uncertainty_score":0.028248608},"labels":[],"label_agreement":null},{"id":"W2005871446","doi":"10.1016/s0166-218x(03)00261-0","title":"Dynamic monopolies in tori","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Mathematics; Torus; Monotone polygon; Context (archaeology); Simple (philosophy); Upper and lower bounds; Constructive; Node (physics); Dynamo; Topology (electrical circuits); Combinatorics; Discrete mathematics; Process (computing); Computer science; Geometry; Mathematical analysis","score_opus":0.009067863765680985,"score_gpt":0.240658269237084,"score_spread":0.23159040547140303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005871446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7140805,0.0018781207,0.0508516,0.0028922725,0.00066749135,0.00012772957,0.00045256648,0.00059205637,0.22845769],"genre_scores_gemma":[0.9801893,0.00047742116,0.0038470991,0.00015689644,0.00014868788,0.00007410154,0.00015794675,0.00009405903,0.014854517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997249,0.000059337453,0.000011590105,0.000041711064,0.000057757472,0.000104647326],"domain_scores_gemma":[0.9992355,0.00019414327,0.00012718768,0.000105046034,0.00008366395,0.00025443177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030573373,0.00044797428,0.0010231214,0.0015168706,0.0024835167,0.0028073394,0.0009634004,0.0013319794,0.0113132205],"category_scores_gemma":[0.001640223,0.0004374009,0.00068806496,0.00081269373,0.002513452,0.0020908497,0.0016595513,0.0014480981,0.0011192429],"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.00006354401,0.000017209064,0.00013629008,0.00004164906,0.00000923701,0.00010715022,0.0002141896,0.0076187323,0.00086956343,0.9858132,0.0021947734,0.0029144497],"study_design_scores_gemma":[0.000053808617,0.000035850284,0.0003523028,0.000021739153,0.000009971664,0.00011701102,0.00029089107,0.03197544,0.00031015734,0.9620973,0.004714733,0.000020727095],"about_ca_topic_score_codex":0.0021404924,"about_ca_topic_score_gemma":0.0021136075,"teacher_disagreement_score":0.0113132205,"about_ca_system_score_codex":0.0014759923,"about_ca_system_score_gemma":0.0006292615,"threshold_uncertainty_score":0.037846506},"labels":[],"label_agreement":null},{"id":"W2009138921","doi":"10.1016/j.ejc.2004.04.011","title":"Counting unrooted loopless planar maps","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Planar; Enhanced Data Rates for GSM Evolution; Orientation (vector space); Discrete mathematics; Geometry; Crystallography","score_opus":0.01216748856328748,"score_gpt":0.21037650164486088,"score_spread":0.1982090130815734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009138921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67887986,0.00087516446,0.27795732,0.00066376734,0.00020393475,0.000118009026,0.0006778437,0.0011327284,0.039491367],"genre_scores_gemma":[0.9218754,0.00047961433,0.062145393,0.00017133643,0.00016445192,0.00012717304,0.0007057947,0.00033393936,0.013996936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856144,0.00021020208,0.000082060484,0.00029646352,0.00060748804,0.00024244926],"domain_scores_gemma":[0.9921699,0.004462753,0.0008704759,0.0007712879,0.0011513338,0.0005742635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076323084,0.0008419312,0.001143272,0.004366777,0.001305082,0.0036233687,0.0028892267,0.0024104132,0.008680827],"category_scores_gemma":[0.012197419,0.00063302467,0.0005232647,0.003261462,0.0022241052,0.005894636,0.0026299348,0.0016574141,0.00089146773],"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.0003740971,0.00012817273,0.0041922103,0.0006281214,0.00006192528,0.00057655264,0.0007204531,0.037315805,0.01712229,0.86832374,0.004308515,0.06624819],"study_design_scores_gemma":[0.000028836605,0.000060941227,0.0010172363,0.00006397869,0.00005419088,0.00044452053,0.00021371718,0.15594323,0.009744638,0.82822007,0.00417367,0.00003497615],"about_ca_topic_score_codex":0.00084477034,"about_ca_topic_score_gemma":0.0011628657,"teacher_disagreement_score":0.008680827,"about_ca_system_score_codex":0.0013427876,"about_ca_system_score_gemma":0.0005064264,"threshold_uncertainty_score":0.029040217},"labels":[],"label_agreement":null},{"id":"W2012030515","doi":"10.1006/jcph.2000.6580","title":"Convolution–Thresholding Methods for Interface Motion","year":2001,"lang":"en","type":"article","venue":"Journal of Computational Physics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Curvature; Thresholding; Convolution (computer science); Computer science; Cellular automaton; Motion (physics); Interface (matter); Computation; Artificial intelligence; Algorithm; Mathematics; Geometry; Artificial neural network","score_opus":0.04060905330121274,"score_gpt":0.3770059370644711,"score_spread":0.3363968837632584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012030515","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.01000238,0.0005281657,0.987275,0.00017716644,0.00010363516,0.000014098045,0.000021991169,0.000183522,0.0016940339],"genre_scores_gemma":[0.3696529,0.0014667652,0.6108836,0.00023166365,0.00027436262,0.00012129823,0.00023206267,0.000573577,0.016563708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997702,0.00006253538,0.000018187935,0.00004317347,0.000076587945,0.000029245493],"domain_scores_gemma":[0.99898857,0.0005642589,0.00007745674,0.00010689081,0.00019711914,0.00006573725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009180313,0.0005632215,0.0009840253,0.0008560704,0.0004743293,0.0010740883,0.0010695746,0.0014937551,0.0027987715],"category_scores_gemma":[0.0038636795,0.00051843986,0.0006660917,0.00091100385,0.0010204581,0.0015420979,0.0013869697,0.0016145317,0.00055890146],"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.00024309692,0.000091555856,0.0007820995,0.00032032063,0.00009095701,0.00011490414,0.00026466706,0.18797655,0.03203542,0.37458184,0.005037078,0.39846155],"study_design_scores_gemma":[0.000009856578,0.000010513608,0.00013387308,0.000010085424,0.000008920417,0.000031131367,0.0000075981316,0.9577632,0.0021621503,0.038275946,0.0015771639,0.000009721439],"about_ca_topic_score_codex":0.0030597434,"about_ca_topic_score_gemma":0.0026444423,"teacher_disagreement_score":0.0030597434,"about_ca_system_score_codex":0.00074034825,"about_ca_system_score_gemma":0.00073835754,"threshold_uncertainty_score":0.009362817},"labels":[],"label_agreement":null},{"id":"W2016353291","doi":"10.1103/physreve.64.016117","title":"Convergence to equilibrium in a class of interacting particle systems evolving in discrete time","year":2001,"lang":"en","type":"article","venue":"Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; Brock University","funders":"","keywords":"Convergence (economics); Particle system; Class (philosophy); Limit (mathematics); Annihilation; Relaxation (psychology); Mathematics; Discrete time and continuous time; Collision; Conjecture; Statistical physics; Piecewise linear function; Cellular automaton; Piecewise; Set (abstract data type); Physics; Mathematical analysis; Pure mathematics; Computer science; Quantum mechanics","score_opus":0.012219549546937037,"score_gpt":0.31373820657197155,"score_spread":0.3015186570250345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016353291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8099188,0.0005623261,0.17976575,0.0006982478,0.000038468803,0.000069177644,0.00010182303,0.0002174272,0.008628005],"genre_scores_gemma":[0.98335934,0.00026144824,0.014343108,0.00005364296,0.000028948254,0.000071938055,0.000112394424,0.00002730476,0.0017417531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963224,0.00011399293,0.000019919558,0.00007718365,0.00009440807,0.00006224438],"domain_scores_gemma":[0.9966265,0.0021266786,0.00048781306,0.0001834659,0.00029687045,0.00027862904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011592059,0.00053611334,0.00058152823,0.0015586829,0.0008765307,0.0017521256,0.000955644,0.0008104209,0.0012421062],"category_scores_gemma":[0.007659102,0.00033590736,0.0006164567,0.00036926617,0.0021764776,0.0016472106,0.0010439646,0.00092792773,0.00013512593],"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.00016636906,0.00014860752,0.00823512,0.00013779516,0.00010672221,0.00066940166,0.0011649348,0.22207884,0.008260051,0.7472329,0.00069742976,0.0111017795],"study_design_scores_gemma":[0.000026150154,0.000048879432,0.0012496975,0.000014147343,0.000011574031,0.00012755262,0.00009157145,0.81953275,0.00092381495,0.1773478,0.0006086379,0.000017421022],"about_ca_topic_score_codex":0.0022632342,"about_ca_topic_score_gemma":0.0010829375,"teacher_disagreement_score":0.0022632342,"about_ca_system_score_codex":0.0012747536,"about_ca_system_score_gemma":0.0003842005,"threshold_uncertainty_score":0.009248972},"labels":[],"label_agreement":null},{"id":"W2016502207","doi":"10.1142/s0129626409000079","title":"TOWARDS A FRAMEWORK FOR INTUITIVE PROGRAMMING OF CELLULAR AUTOMATA","year":2009,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Cellular automaton; Computer science; Asynchronous cellular automaton; Theoretical computer science; Mobile automaton; Automaton; Simple (philosophy); Computation; Genetic programming; Programmer; Distributed computing; Automata theory; Programming language; Algorithm; Artificial intelligence","score_opus":0.019491425004029013,"score_gpt":0.2830307755182556,"score_spread":0.2635393505142266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016502207","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.0010159909,0.00012763789,0.99613476,0.0002562403,0.00003218579,0.000048095462,0.000029585464,0.00039824258,0.0019573907],"genre_scores_gemma":[0.04642646,0.00043986016,0.9502318,0.00022313383,0.00007738379,0.00041514958,0.000105585066,0.0002470837,0.0018335733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980806,0.00072136713,0.00017579983,0.000329335,0.00054868934,0.00014411351],"domain_scores_gemma":[0.9983323,0.0007074662,0.00012620365,0.00040148193,0.00032731742,0.000105262225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031225635,0.0011477907,0.0010571051,0.0011647819,0.0013187709,0.0040564104,0.0036443798,0.0019930454,0.0034806065],"category_scores_gemma":[0.004796601,0.0010912068,0.0027911086,0.001115951,0.0044207997,0.0040595266,0.0030532584,0.0051316735,0.0013098782],"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.000010901207,0.000018710647,0.000086365566,0.000076456934,0.0000103958455,0.00007893594,0.00027294923,0.018489037,0.0015885975,0.9671103,0.0008662545,0.01139106],"study_design_scores_gemma":[0.000030520827,0.00003922317,0.000052067222,0.000082536644,0.000022907054,0.00008988245,0.00009719065,0.15736818,0.001852714,0.8054662,0.034871504,0.000027115875],"about_ca_topic_score_codex":0.001991789,"about_ca_topic_score_gemma":0.002499336,"teacher_disagreement_score":0.0040564104,"about_ca_system_score_codex":0.0014306866,"about_ca_system_score_gemma":0.0020468244,"threshold_uncertainty_score":0.016513944},"labels":[],"label_agreement":null},{"id":"W2016819899","doi":"10.1016/j.entcs.2009.09.011","title":"On the Relationship Between Boolean and Fuzzy Cellular Automata","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Discrete mathematics; Boolean network; Two-element Boolean algebra; Complete Boolean algebra; Boolean domain; Stone's representation theorem for Boolean algebras; Boolean expression; Boolean function; Pure mathematics; Algebra over a field","score_opus":0.013898130151227525,"score_gpt":0.25650775269609166,"score_spread":0.24260962254486412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016819899","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.118884824,0.0058614495,0.8242303,0.002768985,0.00021008507,0.00006535505,0.00023173097,0.00020109533,0.047546227],"genre_scores_gemma":[0.91738725,0.0031233546,0.07166205,0.00053526,0.00034044197,0.000154036,0.00014582834,0.00006098051,0.006590781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848026,0.00044284662,0.00008580095,0.00036321423,0.00050317385,0.00012476169],"domain_scores_gemma":[0.99105597,0.006972281,0.000524449,0.0005696593,0.00063171523,0.00024592952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017251439,0.00045230225,0.00083930395,0.0013572405,0.0010792902,0.0023452223,0.0011003137,0.0015444056,0.0030093372],"category_scores_gemma":[0.014024052,0.00039598756,0.000873696,0.0013746644,0.0034209331,0.004160944,0.0018488141,0.0021552306,0.0002847288],"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.000017722812,0.000011398607,0.00042393943,0.000042275507,0.000012137308,0.00007649143,0.00017622861,0.021492751,0.00058084744,0.9697277,0.00028703347,0.007151359],"study_design_scores_gemma":[0.000007860124,0.00002275218,0.00033606566,0.000030563046,0.000014398669,0.00010506925,0.000046832178,0.15512638,0.00032220746,0.84167,0.002301796,0.000016051497],"about_ca_topic_score_codex":0.0038922264,"about_ca_topic_score_gemma":0.0021917506,"teacher_disagreement_score":0.0038922264,"about_ca_system_score_codex":0.002021679,"about_ca_system_score_gemma":0.0007260788,"threshold_uncertainty_score":0.014668405},"labels":[],"label_agreement":null},{"id":"W2018554016","doi":"10.1016/j.tcs.2007.03.014","title":"Defect particle kinematics in one-dimensional cellular automata","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kinematics; Cellular automaton; Automaton; Particle (ecology); Computer science; Mathematics; Theoretical computer science; Geometry; Classical mechanics; Algorithm; Topology (electrical circuits); Discrete mathematics; Combinatorics; Physics; Geology","score_opus":0.01497642273216219,"score_gpt":0.2539691154864794,"score_spread":0.2389926927543172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018554016","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.46240494,0.0008767076,0.4931425,0.001559676,0.00072123465,0.00010849324,0.00019782117,0.00047630616,0.04051228],"genre_scores_gemma":[0.96555394,0.00034527952,0.022103412,0.0001321157,0.000058530404,0.00007909661,0.00010284267,0.0000925092,0.011532249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968743,0.00008510913,0.000022257122,0.000046587014,0.00010897465,0.000049629234],"domain_scores_gemma":[0.99876946,0.0005552537,0.0001416554,0.0001616642,0.00022295854,0.00014886018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924132,0.00047321155,0.00093554845,0.0011098292,0.000982842,0.0029409386,0.0013649144,0.0018984202,0.0031265037],"category_scores_gemma":[0.0036282924,0.00046032367,0.000762327,0.00063655333,0.002985915,0.0020509728,0.0013973123,0.001413408,0.00052066095],"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.000036427416,0.000024614314,0.000559373,0.000037244703,0.0000095691175,0.00013671965,0.00016231617,0.08209848,0.0013646056,0.91178185,0.0005984785,0.003190344],"study_design_scores_gemma":[0.00003561657,0.000027613502,0.00019362093,0.000013464806,0.000008237468,0.00008709353,0.00008476188,0.47849244,0.00067486893,0.5194348,0.0009173518,0.000030074503],"about_ca_topic_score_codex":0.0032186022,"about_ca_topic_score_gemma":0.0017500211,"teacher_disagreement_score":0.0032186022,"about_ca_system_score_codex":0.0014062973,"about_ca_system_score_gemma":0.00086619065,"threshold_uncertainty_score":0.010459185},"labels":[],"label_agreement":null},{"id":"W2022621125","doi":"10.48550/arxiv.0710.3608","title":"Embedding Bratteli-Vershik systems in cellular automata","year":2007,"lang":"en","type":"preprint","venue":"Open Research Online (The Open University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Embedding; Cellular automaton; Computer science; Business; Artificial intelligence","score_opus":0.19057309691405463,"score_gpt":0.4189503070818149,"score_spread":0.22837721016776028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022621125","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.35240474,0.0004795067,0.61672294,0.0003112907,0.00014852882,0.000060289967,0.00017836891,0.00055863167,0.029135717],"genre_scores_gemma":[0.89656097,0.00036615817,0.09083299,0.00007755935,0.0000463757,0.00010718379,0.00013453531,0.000104245155,0.011770035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959,0.0001022004,0.00002906543,0.00011394268,0.00009158382,0.00007314326],"domain_scores_gemma":[0.99956495,0.0001254113,0.00007083069,0.00011488484,0.00006954303,0.000054369757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028054617,0.0004496535,0.00032225426,0.0006826847,0.0006508376,0.001452674,0.00061595364,0.00067307474,0.003224341],"category_scores_gemma":[0.001193692,0.00034529087,0.00044676018,0.00048053052,0.001662993,0.0015143335,0.0014036355,0.00086422026,0.00073509425],"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.000027912938,0.000011519459,0.0003098165,0.000022894588,0.0000048296497,0.0000784072,0.00044459695,0.016034564,0.006445032,0.96842337,0.00018062838,0.008016461],"study_design_scores_gemma":[0.000026349186,0.00008095249,0.0003513746,0.000029653394,0.000011890222,0.00012947267,0.0002805825,0.15129648,0.008624551,0.82249445,0.01663723,0.000037012207],"about_ca_topic_score_codex":0.0014851297,"about_ca_topic_score_gemma":0.0017506526,"teacher_disagreement_score":0.003224341,"about_ca_system_score_codex":0.0010892504,"about_ca_system_score_gemma":0.00040778727,"threshold_uncertainty_score":0.010786474},"labels":[],"label_agreement":null},{"id":"W2023171134","doi":"10.1023/b:desi.0000029231.44423.43","title":"On a Bound of Cover-Free Families","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Stirling engine; Upper and lower bounds; Mathematics; Combinatorics; Computer science; Engineering; Mathematical analysis; Mechanical engineering","score_opus":0.014380880511451666,"score_gpt":0.22724741568630147,"score_spread":0.2128665351748498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023171134","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41164383,0.003928067,0.37382776,0.0154579105,0.0005882758,0.00012615594,0.0016003129,0.0010306012,0.19179712],"genre_scores_gemma":[0.92635536,0.002565488,0.03313907,0.002267551,0.0009473103,0.00038003712,0.001153472,0.00050458446,0.032687172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964115,0.0008379517,0.00013768216,0.0006761457,0.0010677812,0.0008689855],"domain_scores_gemma":[0.9680935,0.025121143,0.001112844,0.0022717349,0.0012705054,0.0021301894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030500004,0.0015858617,0.0028245957,0.0037220092,0.0059408243,0.006161559,0.0032168191,0.004332557,0.018046383],"category_scores_gemma":[0.023594085,0.0016594399,0.0023310957,0.0040937327,0.0061764247,0.014457843,0.007995801,0.007911096,0.0018974193],"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.00021829613,0.000044477423,0.0003419301,0.00007614747,0.000025192467,0.00007735576,0.00035068646,0.007022163,0.00064362795,0.982612,0.0036784816,0.0049096355],"study_design_scores_gemma":[0.000035417357,0.000028449474,0.00019044097,0.00003888352,0.000026631136,0.000104125706,0.00006320671,0.020321151,0.000420182,0.9759837,0.0027682576,0.00001949909],"about_ca_topic_score_codex":0.002711115,"about_ca_topic_score_gemma":0.0019168969,"teacher_disagreement_score":0.018046383,"about_ca_system_score_codex":0.005689305,"about_ca_system_score_gemma":0.0017783671,"threshold_uncertainty_score":0.06037116},"labels":[],"label_agreement":null},{"id":"W2024243717","doi":"10.1007/s00224-013-9485-9","title":"Computational Aspects of M.C. Escher’s Ribbon Patterns","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","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":"University of British Columbia","funders":"","keywords":"Escher; Ribbon; Equilateral triangle; Cork; Mathematics; Motif (music); Set (abstract data type); Combinatorics; Computer science; Geometry; Art; Programming language","score_opus":0.013431341548140682,"score_gpt":0.2318013323387935,"score_spread":0.2183699907906528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024243717","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.24235396,0.00280724,0.3892631,0.006169888,0.0006651194,0.00005573298,0.00026956032,0.00034406045,0.3580714],"genre_scores_gemma":[0.92801315,0.001045912,0.044388935,0.0004314087,0.00022076057,0.000054438548,0.00017114819,0.000111106965,0.025563138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996854,0.00009219365,0.000016143196,0.00006076897,0.00009677876,0.000048778835],"domain_scores_gemma":[0.9991278,0.00047774706,0.00005592158,0.00015558887,0.00011711905,0.00006583727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038511908,0.00026271632,0.0004537593,0.00097343157,0.0011108562,0.0018426365,0.00063477154,0.0013376042,0.0081433365],"category_scores_gemma":[0.0038245055,0.0003430257,0.00062058197,0.00096590683,0.0019827075,0.0029962016,0.001247078,0.0011382721,0.0011312362],"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.000014242074,0.0000052851037,0.00011184752,0.000016787924,0.000002587404,0.000041604115,0.00006398786,0.004665176,0.00037976398,0.9882322,0.0011552016,0.0053113657],"study_design_scores_gemma":[0.0000054891543,0.0000068426175,0.00009943979,0.0000070962283,0.0000018979437,0.000060855695,0.000031297997,0.016806068,0.00033370062,0.9791196,0.0035221754,0.0000055132928],"about_ca_topic_score_codex":0.0010944777,"about_ca_topic_score_gemma":0.0011609553,"teacher_disagreement_score":0.0081433365,"about_ca_system_score_codex":0.00064470107,"about_ca_system_score_gemma":0.00033727533,"threshold_uncertainty_score":0.027242184},"labels":[],"label_agreement":null},{"id":"W2026523180","doi":"10.1017/s0143385710000040","title":"Perturbations of multidimensional shifts of finite type","year":2010,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Type (biology); Cube (algebra); Combinatorics; Finite set; Upper and lower bounds; Pure mathematics; Set (abstract data type); Mathematical analysis","score_opus":0.006323819498805996,"score_gpt":0.22360378233352984,"score_spread":0.21727996283472384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026523180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9286377,0.00020660766,0.06527885,0.00032047497,0.00009211612,0.00003603025,0.000094653784,0.0001704501,0.005163136],"genre_scores_gemma":[0.99141216,0.000064597116,0.0066481275,0.00006294506,0.000045542038,0.000036085687,0.00006994872,0.000023168785,0.0016374672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990095,0.00016905156,0.000074495954,0.00022017761,0.0003567168,0.00017006042],"domain_scores_gemma":[0.9948749,0.0019606224,0.0010067187,0.0008093718,0.0007291188,0.0006193318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089993764,0.0003870711,0.0005507334,0.00092766335,0.00076947216,0.001257743,0.0008284091,0.0008191882,0.0027995768],"category_scores_gemma":[0.00781725,0.0003082193,0.0005293864,0.0004707645,0.0019672352,0.0022610808,0.0019661598,0.0013522408,0.00023900546],"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.0013227962,0.00017053899,0.0128728,0.00018562285,0.000108524575,0.0016702521,0.00095521676,0.14723992,0.083534114,0.7275984,0.0015112679,0.022830533],"study_design_scores_gemma":[0.000076867094,0.00040384088,0.0038934345,0.00004079819,0.000041296906,0.0005994456,0.00064000033,0.45393288,0.030344239,0.5063424,0.0036162592,0.00006856582],"about_ca_topic_score_codex":0.001068028,"about_ca_topic_score_gemma":0.0005144464,"teacher_disagreement_score":0.0027995768,"about_ca_system_score_codex":0.0015445653,"about_ca_system_score_gemma":0.00041037038,"threshold_uncertainty_score":0.011206627},"labels":[],"label_agreement":null},{"id":"W2026834093","doi":"10.1145/968708.968715","title":"Review of <i>D-Branes</i> by Clifford V. Johnson. Cambridge University Press 2002.","year":2003,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University","funders":"","keywords":"Citation; History; Art history; Library science; Computer science","score_opus":0.011534525753173744,"score_gpt":0.21311095035581457,"score_spread":0.20157642460264083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026834093","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013590857,0.9423096,0.0010476677,0.010379713,0.021918757,0.000030737563,0.0003638157,0.00008508714,0.023728628],"genre_scores_gemma":[0.0030553318,0.88357556,0.0008820116,0.005628315,0.01196444,0.00005970707,0.00071749376,0.0001148739,0.09400229],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924856,0.00011771923,0.00008224517,0.00012247285,0.0003580996,0.000071000795],"domain_scores_gemma":[0.99811304,0.0003183855,0.00017615849,0.00010745896,0.0010288742,0.00025602887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014822736,0.0013109259,0.0011865761,0.005576397,0.0006551766,0.0017163206,0.0011412237,0.0013500423,0.034810103],"category_scores_gemma":[0.00273839,0.0005053694,0.0005177571,0.005281875,0.0010577671,0.0034406553,0.0012853624,0.0020610706,0.026037235],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000012174703,0.0000050791036,0.000043325894,0.0011391847,0.000010994293,0.000021834592,0.00003131983,0.000047788515,0.00022695474,0.0032080847,0.9119413,0.08331188],"study_design_scores_gemma":[0.0000016906847,0.000006471656,0.00016995646,0.0004378756,0.0000057421494,0.00006668431,0.000017831857,0.000014385957,0.00008343819,0.0013557667,0.99783534,0.0000047641247],"about_ca_topic_score_codex":0.0043454883,"about_ca_topic_score_gemma":0.006823842,"teacher_disagreement_score":0.034810103,"about_ca_system_score_codex":0.0023788253,"about_ca_system_score_gemma":0.0026110304,"threshold_uncertainty_score":0.11645138},"labels":[],"label_agreement":null},{"id":"W2028913248","doi":"10.1109/ia.2014.7009455","title":"Na&amp;#x00EF;ve creature learns to cross a highway in a simulated CA-like environment","year":2014,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Creatures; Computer science; Population; Process (computing); Artificial intelligence; Base (topology); Human–computer interaction; Natural (archaeology); Sociology; Geography","score_opus":0.010259797709542271,"score_gpt":0.24857258451048295,"score_spread":0.23831278680094067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028913248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9050034,0.000053897234,0.0822362,0.0003535147,0.000033766006,0.000053953492,0.00023150722,0.00031899923,0.011714791],"genre_scores_gemma":[0.9878115,0.000040728803,0.009099533,0.00003201557,0.000003050186,0.000061597915,0.00007941814,0.0000105394865,0.0028615862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999014,0.00002834345,0.0000041686517,0.000027005637,0.000013787093,0.00002517418],"domain_scores_gemma":[0.9992895,0.00033212485,0.000108818924,0.00008583185,0.00007444857,0.00010926067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022193274,0.0002814077,0.0003376152,0.00026998887,0.0004378479,0.0005970166,0.0009703111,0.0009866938,0.004020719],"category_scores_gemma":[0.0016260543,0.00017527917,0.00035447555,0.00025027027,0.00087940757,0.00080123835,0.0004964434,0.0005315586,0.00026342837],"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.000081051985,0.0000636959,0.002833114,0.000022549026,0.00002782933,0.00012151702,0.0000820146,0.9825699,0.0020100728,0.009141541,0.0003328974,0.002713865],"study_design_scores_gemma":[0.000020574176,0.000049620972,0.00036079134,0.0000038146736,0.000008135029,0.000020508474,0.00003710886,0.99643266,0.00049688626,0.0022189694,0.0003448309,0.000006043838],"about_ca_topic_score_codex":0.018143674,"about_ca_topic_score_gemma":0.011016552,"teacher_disagreement_score":0.018143674,"about_ca_system_score_codex":0.00071553036,"about_ca_system_score_gemma":0.0006458413,"threshold_uncertainty_score":0.03607613},"labels":[],"label_agreement":null},{"id":"W2031122969","doi":"10.1049/el:20091870","title":"Embedded method for indexing control arrays in multimode conservative codes for holographic storage","year":2009,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Search engine indexing; Decoding methods; Binary number; Multi-mode optical fiber; Coding (social sciences); Algorithm; Embedding; Computer science; Set (abstract data type); Redundancy (engineering); Mathematics; Arithmetic; Telecommunications; Optical fiber","score_opus":0.011490527207856939,"score_gpt":0.2847622873007852,"score_spread":0.27327176009292825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031122969","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.048237585,0.00031388464,0.9451774,0.00014477942,0.00010066388,0.00007511559,0.00008889751,0.0006998619,0.005161792],"genre_scores_gemma":[0.39831597,0.00030034315,0.58967626,0.00018946307,0.000046752593,0.00027707618,0.00016473685,0.000117868934,0.01091158],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998332,0.000028038,0.000012149309,0.000027519305,0.0000845011,0.000014526682],"domain_scores_gemma":[0.9996057,0.00010834463,0.00004449433,0.00014669266,0.00007714502,0.000017772229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018535966,0.00031871343,0.000261924,0.00038143026,0.0003552765,0.00050890056,0.0006494391,0.00037265354,0.0020041],"category_scores_gemma":[0.0008129048,0.00018570162,0.00015520953,0.00040689958,0.0004994822,0.000811112,0.0006619078,0.00053722877,0.0004437759],"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.0004118515,0.00013627563,0.00059079257,0.00021591825,0.000024252126,0.0002675629,0.00038087767,0.039720327,0.40121752,0.1998732,0.002938396,0.35422307],"study_design_scores_gemma":[0.00010023094,0.00036589688,0.0004950554,0.00006564335,0.000033112097,0.00055812066,0.000083611456,0.47007558,0.44000104,0.058250625,0.029880978,0.00009007894],"about_ca_topic_score_codex":0.0004681908,"about_ca_topic_score_gemma":0.0010333502,"teacher_disagreement_score":0.0020041,"about_ca_system_score_codex":0.00053699734,"about_ca_system_score_gemma":0.00045343762,"threshold_uncertainty_score":0.0067043304},"labels":[],"label_agreement":null},{"id":"W2031394416","doi":"10.1109/icci-cc.2012.6311130","title":"Security testing of a modular cryptosystem based on continuous cellular automata","year":2012,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cryptosystem; Modular design; Computer science; Automaton; Theoretical computer science; Cellular automaton; Hybrid cryptosystem; Cryptography; Dimension (graph theory); Modular arithmetic; Sliding window protocol; Chaotic; Algorithm; Mathematics; Window (computing); Artificial intelligence; Programming language","score_opus":0.018070797476228046,"score_gpt":0.2268907671233166,"score_spread":0.20881996964708854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031394416","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8584729,0.00014452057,0.1382539,0.00010468851,0.00009362888,0.00007711447,0.00010361035,0.0005598378,0.0021898698],"genre_scores_gemma":[0.99043757,0.000028506593,0.009268361,0.000007255733,0.0000051329507,0.000014935096,0.000022401897,0.000008652645,0.00020726382],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897707,0.00025574586,0.0000714491,0.00022362015,0.000339468,0.0001326391],"domain_scores_gemma":[0.9966425,0.0019012092,0.00040990429,0.0005482061,0.00033725557,0.00016096384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007086199,0.00051076326,0.00045087503,0.00059946644,0.00038754835,0.0005921752,0.0005287913,0.00048876525,0.00093813473],"category_scores_gemma":[0.0042842804,0.00011565303,0.0003885729,0.00026014252,0.000983692,0.00069274066,0.00065941096,0.00039814838,0.000120512115],"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.0027495383,0.00047431633,0.017323244,0.0005638208,0.00035405852,0.0013454282,0.00049610605,0.29084677,0.4919101,0.077440366,0.0009742953,0.11552202],"study_design_scores_gemma":[0.00009161056,0.0019177636,0.0031513635,0.000028441971,0.00006412842,0.0004240892,0.00006013734,0.7164223,0.26784292,0.008626781,0.0013127608,0.00005774142],"about_ca_topic_score_codex":0.0005483219,"about_ca_topic_score_gemma":0.00032005104,"teacher_disagreement_score":0.00093813473,"about_ca_system_score_codex":0.0005755712,"about_ca_system_score_gemma":0.0004911595,"threshold_uncertainty_score":0.00417608},"labels":[],"label_agreement":null},{"id":"W2033534074","doi":"10.1103/physrevlett.98.198701","title":"Network Analysis of the State Space of Discrete Dynamical Systems","year":2007,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Scaling; Cellular automaton; Node (physics); Statistical physics; Complex network; Class (philosophy); Measure (data warehouse); Path (computing); Function (biology); Variety (cybernetics); State space; Space (punctuation); Simple (philosophy); Complex system; Computer science; Topology (electrical circuits); Mathematics; Physics; Combinatorics; Algorithm; Quantum mechanics; Artificial intelligence; Geometry","score_opus":0.009571394653827168,"score_gpt":0.2712746619802195,"score_spread":0.2617032673263923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033534074","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51398176,0.0013628963,0.46761218,0.0012997439,0.000048646845,0.000052610067,0.0005636525,0.000218643,0.014859853],"genre_scores_gemma":[0.98729706,0.0004488941,0.0100423815,0.000035034755,0.00003735959,0.000062654144,0.00018718778,0.000020033185,0.0018694312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997141,0.000104375686,0.000012181109,0.000057037752,0.00007791648,0.000034443976],"domain_scores_gemma":[0.9984738,0.00102529,0.00023391975,0.00007059957,0.00012918732,0.00006721621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004644972,0.00036875167,0.00043069315,0.0010731223,0.00035761934,0.0010885089,0.00048705417,0.00044126195,0.0018816609],"category_scores_gemma":[0.0036599038,0.00019530172,0.00035737973,0.0006741706,0.0011100222,0.0015583112,0.00062226166,0.0006277316,0.00013098208],"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.000036839992,0.000023983514,0.0021655825,0.00006444517,0.000044436325,0.000096971446,0.0001664132,0.66868114,0.0024512168,0.31943533,0.0004461727,0.0063874302],"study_design_scores_gemma":[0.000003589931,0.0000059645913,0.0003545499,0.0000050201897,0.000003917222,0.000012417223,0.00001783441,0.9177188,0.00018718994,0.081303276,0.0003824643,0.0000049483533],"about_ca_topic_score_codex":0.0028079187,"about_ca_topic_score_gemma":0.0014140508,"teacher_disagreement_score":0.0028079187,"about_ca_system_score_codex":0.00096194586,"about_ca_system_score_gemma":0.00031761598,"threshold_uncertainty_score":0.006979406},"labels":[],"label_agreement":null},{"id":"W2036107212","doi":"10.1109/tevc.2013.2243454","title":"Fitness Landscapes of Evolved Apoptotic Cellular Automata","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Fitness approximation; Fitness landscape; Fitness function; Cellular automaton; Robustness (evolution); Evolutionary algorithm; Computer science; Genetic Fitness; Survival of the fittest; Function (biology); Automaton; Artificial intelligence; Evolutionary computation; Machine learning; Biology; Genetic algorithm; Evolutionary biology; Population; Selection (genetic algorithm); Genetics","score_opus":0.010292490494980287,"score_gpt":0.2191020108133134,"score_spread":0.2088095203183331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036107212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80672616,0.0005136087,0.17741725,0.00044150566,0.000031248605,0.000053365795,0.000109787885,0.000152886,0.014554252],"genre_scores_gemma":[0.9804685,0.00012033656,0.016975908,0.0000365292,0.000004520773,0.00004350752,0.00008301762,0.00003339918,0.002234317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997427,0.00008543702,0.000013914355,0.000038430862,0.00008287215,0.00003671742],"domain_scores_gemma":[0.99875665,0.0006852449,0.00012757695,0.00009349346,0.00025205038,0.00008488648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006650514,0.0003029321,0.0003412043,0.0008732445,0.0005671327,0.0012786369,0.0006132924,0.0007793642,0.0012595953],"category_scores_gemma":[0.0055601797,0.00022186292,0.00034233456,0.0002973957,0.00094301393,0.0007342058,0.000549956,0.00044887495,0.00015311236],"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.00008520324,0.00003239009,0.0035609435,0.000052219522,0.00003776496,0.00029757805,0.00022265111,0.8981475,0.010876713,0.06858763,0.0005013055,0.017598221],"study_design_scores_gemma":[0.000015127401,0.000048098853,0.0009984508,0.000011894304,0.0000131860625,0.000105998624,0.00006593145,0.97515124,0.0021492457,0.020338073,0.00108762,0.0000151705235],"about_ca_topic_score_codex":0.0016809521,"about_ca_topic_score_gemma":0.0010575762,"teacher_disagreement_score":0.0016809521,"about_ca_system_score_codex":0.0012928981,"about_ca_system_score_gemma":0.00040366928,"threshold_uncertainty_score":0.009380698},"labels":[],"label_agreement":null},{"id":"W2038152055","doi":"10.5555/2429759.2429764","title":"Advanced spatial systems with cellular discrete-event modeling and simulation","year":2012,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Computer science; Asynchronous communication; Cellular automaton; Formalism (music); Distributed computing; Discrete event simulation; Grid; Modeling and simulation; Theoretical computer science; Simulation; Artificial intelligence; Computer network","score_opus":0.024878199327406533,"score_gpt":0.273667678251061,"score_spread":0.24878947892365444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038152055","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.004478951,0.0007606636,0.98280877,0.00029521948,0.0001144409,0.0000771848,0.0003169533,0.000507453,0.010640486],"genre_scores_gemma":[0.28469408,0.0053551067,0.69348633,0.00023222533,0.00026769238,0.00084730174,0.001246186,0.00020921128,0.013661917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995516,0.0001541891,0.000033629003,0.000052659998,0.00017477715,0.000033169006],"domain_scores_gemma":[0.9994307,0.00025324797,0.000043447802,0.00012677241,0.00010811678,0.000037663027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005789392,0.00080034515,0.00082242314,0.00061916764,0.00044397413,0.0017393387,0.0015706515,0.0013497459,0.0048901187],"category_scores_gemma":[0.001724716,0.00046254692,0.0013160344,0.0012900297,0.0007197713,0.0014244342,0.0013458815,0.0015125191,0.0013109653],"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.000017787746,0.000029286228,0.00048474298,0.0001296012,0.00004329351,0.00010691728,0.000091412134,0.76557255,0.0018706142,0.20872465,0.0019403268,0.020988842],"study_design_scores_gemma":[0.000009243354,0.000008767086,0.00006430028,0.000013578444,0.000009112103,0.000029625737,0.000011148922,0.9489328,0.0005058496,0.03848179,0.011926508,0.000007196782],"about_ca_topic_score_codex":0.0046970877,"about_ca_topic_score_gemma":0.0028521463,"teacher_disagreement_score":0.0048901187,"about_ca_system_score_codex":0.00069897604,"about_ca_system_score_gemma":0.0009099438,"threshold_uncertainty_score":0.01635909},"labels":[],"label_agreement":null},{"id":"W2041342760","doi":"10.1016/j.tcs.2006.11.019","title":"RealLife: The continuum limit of Larger than Life cellular automata","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Cellular automaton; Limit (mathematics); Conjecture; Infinity; Euclidean geometry; Pure mathematics; Combinatorics; Mathematical analysis; Geometry; Algorithm","score_opus":0.006382036356419492,"score_gpt":0.21267497150496656,"score_spread":0.20629293514854707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041342760","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.38023955,0.012419584,0.38557667,0.012781146,0.0014214938,0.00008188753,0.00062388246,0.0021703397,0.20468555],"genre_scores_gemma":[0.9516916,0.0017403531,0.027772808,0.001123028,0.0005381615,0.000090607304,0.00021592675,0.00024974663,0.016577687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995425,0.00012085492,0.000019214964,0.000108865366,0.0001532714,0.00005537116],"domain_scores_gemma":[0.9978345,0.00089016865,0.00020054454,0.00030893678,0.0002931249,0.0004726967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063949305,0.00032316401,0.0006552331,0.0011654943,0.0012012973,0.0043058596,0.0010769361,0.0013202261,0.008372627],"category_scores_gemma":[0.0057093897,0.00034955156,0.00042522216,0.0006451956,0.0032078854,0.0058359094,0.0018902034,0.0019959745,0.00087301864],"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.000018613371,0.000013061443,0.00016369391,0.00003089912,0.0000035250446,0.00008184426,0.00019259861,0.001714907,0.0007574499,0.9921308,0.0016721159,0.003220536],"study_design_scores_gemma":[0.000008609124,0.000010662711,0.00015232978,0.000016243443,0.0000037416326,0.00020422896,0.00011082799,0.023904365,0.00042009976,0.96858037,0.006576827,0.000011708655],"about_ca_topic_score_codex":0.0009842166,"about_ca_topic_score_gemma":0.0008200689,"teacher_disagreement_score":0.008372627,"about_ca_system_score_codex":0.0010212376,"about_ca_system_score_gemma":0.00059265684,"threshold_uncertainty_score":0.028009236},"labels":[],"label_agreement":null},{"id":"W2042519643","doi":"10.1155/s1110865702204138","title":"A DSP Based POD Implementation for High Speed Multimedia Communications","year":2002,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Regina","funders":"","keywords":"Computer science; Elliptic Curve Digital Signature Algorithm; Encryption; Elliptic curve cryptography; Cryptography; Key (lock); Digital signal processing; Embedded system; Public-key cryptography; Computer hardware; Computer security","score_opus":0.04039586108695611,"score_gpt":0.34437499469247324,"score_spread":0.30397913360551715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042519643","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.08523204,0.0003039102,0.8836815,0.00018085698,0.00037620656,0.0002838252,0.00015609294,0.007561444,0.022224164],"genre_scores_gemma":[0.7459348,0.0002130343,0.23409764,0.00018145937,0.000061734085,0.00015796829,0.00029362616,0.000117623356,0.018942054],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978036,0.000037416816,0.00001863539,0.000040250103,0.000092930604,0.000030486104],"domain_scores_gemma":[0.9997087,0.00005320208,0.000024046054,0.00007962758,0.000110259876,0.000024126912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022720815,0.00028880793,0.0002507666,0.00037770183,0.000276908,0.00071761623,0.00072007766,0.00043155046,0.0067470986],"category_scores_gemma":[0.00069336686,0.00013795082,0.0001953358,0.00024295796,0.00017181368,0.00057530217,0.00026389543,0.00056861195,0.0018597152],"study_design_candidate":"bench_or_experimental","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.0011739462,0.0004922323,0.002494368,0.00053730566,0.000077446944,0.0006613563,0.00021570441,0.011532318,0.46074075,0.036592614,0.01059766,0.47488436],"study_design_scores_gemma":[0.00046742952,0.002112586,0.0031855016,0.000088590816,0.00013888239,0.0030860235,0.000121967794,0.3092217,0.55930847,0.005434907,0.11676058,0.00007329518],"about_ca_topic_score_codex":0.00032753244,"about_ca_topic_score_gemma":0.0004935516,"teacher_disagreement_score":0.0067470986,"about_ca_system_score_codex":0.00027440052,"about_ca_system_score_gemma":0.00042240138,"threshold_uncertainty_score":0.022571266},"labels":[],"label_agreement":null},{"id":"W2045708161","doi":"10.1016/j.simpat.2007.08.006","title":"Modeling physical systems using finite element Cell-DEVS","year":2007,"lang":"en","type":"article","venue":"Simulation Modelling Practice and Theory","topic":"Cellular Automata and Applications","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":"Carleton University","funders":"","keywords":"DEVS; Rotation formalisms in three dimensions; Computer science; Partial differential equation; Formalism (music); Computational science; Modeling and simulation; Theoretical computer science; Algorithm; Parallel computing; Mathematics; Simulation; Geometry","score_opus":0.04456855906862085,"score_gpt":0.3192063004803141,"score_spread":0.2746377414116933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045708161","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.010968206,0.00012477364,0.97957164,0.00014059333,0.000094023875,0.000072797375,0.0002596112,0.0010150977,0.0077532106],"genre_scores_gemma":[0.42517343,0.0007011283,0.5584323,0.00018319962,0.000064208674,0.000712715,0.00080852397,0.0006528183,0.01327176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997632,0.00005418682,0.000017740684,0.000030474828,0.00011435545,0.000019957462],"domain_scores_gemma":[0.9993149,0.00034687214,0.00006022993,0.00011356899,0.00013360199,0.000030718697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044567804,0.00056495005,0.0010422221,0.0007306217,0.000607947,0.0011597616,0.0020027843,0.0015382958,0.0047999704],"category_scores_gemma":[0.0015574049,0.0006744299,0.0010514616,0.0006042905,0.0008147574,0.0009545753,0.0011685075,0.0010440209,0.0013328183],"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.0000054773077,0.000015667441,0.00028016037,0.000046483558,0.000020027996,0.00004384473,0.000041674823,0.9757391,0.0013382012,0.015227192,0.00033031244,0.0069116787],"study_design_scores_gemma":[0.0000022641548,0.0000031941638,0.000023808845,0.0000038927597,0.000003732864,0.000014452424,0.0000061320316,0.9944358,0.00070543354,0.003035097,0.0017628524,0.0000033389167],"about_ca_topic_score_codex":0.0058774482,"about_ca_topic_score_gemma":0.00458359,"teacher_disagreement_score":0.0058774482,"about_ca_system_score_codex":0.0006660168,"about_ca_system_score_gemma":0.0009435487,"threshold_uncertainty_score":0.016057491},"labels":[],"label_agreement":null},{"id":"W2048616123","doi":"10.1109/isit.2007.4557460","title":"Synchronizing block codes with a decoder for variable-length codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Block code; Synchronizing; Synchronization (alternating current); Decoding methods; Linear code; Bounded function; Code (set theory); Computer science; Algorithm; Discrete mathematics; Concatenated error correction code; Fountain code; Mathematics; Combinatorics; Topology (electrical circuits)","score_opus":0.012751606599006815,"score_gpt":0.2474188611682351,"score_spread":0.2346672545692283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048616123","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.09634475,0.00020527976,0.8969567,0.00012618308,0.00004307352,0.00005045751,0.00008821196,0.00039128313,0.005794131],"genre_scores_gemma":[0.65939283,0.00045098414,0.3341786,0.00013615185,0.00006058919,0.00021660651,0.00028604225,0.00016453036,0.005113662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997123,0.000073369294,0.000026595819,0.00005915844,0.00009776309,0.000030854575],"domain_scores_gemma":[0.9992841,0.00034270383,0.00010426525,0.00012083186,0.00011348927,0.000034592307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029453757,0.00019991166,0.00027918242,0.00028715725,0.0002680276,0.0004459388,0.00032756492,0.00038895127,0.0008587222],"category_scores_gemma":[0.0020058306,0.00018011127,0.00029671597,0.0002954074,0.00053264265,0.00063144503,0.00080104324,0.00046916204,0.00043044856],"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.00034770835,0.0000350778,0.0013430745,0.00020811222,0.000028054343,0.00035791198,0.0005712075,0.11934824,0.1687121,0.63083297,0.0012252647,0.07699037],"study_design_scores_gemma":[0.00005868801,0.00020411215,0.00053785724,0.000045893295,0.000027066022,0.00038996284,0.00006220369,0.692311,0.10566455,0.18906364,0.01160023,0.000034871584],"about_ca_topic_score_codex":0.00053499464,"about_ca_topic_score_gemma":0.0005401496,"teacher_disagreement_score":0.0008587222,"about_ca_system_score_codex":0.00033363514,"about_ca_system_score_gemma":0.0005029133,"threshold_uncertainty_score":0.0028727055},"labels":[],"label_agreement":null},{"id":"W2057053708","doi":"10.1016/j.autcon.2014.10.007","title":"Exploring cellular automata for high density residential building form generation","year":2014,"lang":"en","type":"article","venue":"Automation in Construction","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":43,"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 Calgary","funders":"","keywords":"Cellular automaton; Computer science; Context (archaeology); Diagrammatic reasoning; Adaptation (eye); Process (computing); Architectural design; Architectural engineering; Architectural model; Theoretical computer science; Architecture; Programming language; Engineering; Artificial intelligence; Geography","score_opus":0.04911065660645651,"score_gpt":0.24921699244995185,"score_spread":0.20010633584349535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057053708","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.23061323,0.00038789064,0.74326867,0.00039046715,0.000059407856,0.00004861322,0.00011682108,0.00034108444,0.024773845],"genre_scores_gemma":[0.9539808,0.00014190472,0.043340143,0.000031475625,0.000009721956,0.00003717762,0.000042505613,0.000030515517,0.0023857853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998709,0.00005150163,0.000004016729,0.00002367249,0.000031285083,0.000018643337],"domain_scores_gemma":[0.9994184,0.0004369294,0.000027332007,0.000047266567,0.000051568146,0.00001861891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021577385,0.00032316588,0.0004970493,0.00041498116,0.00054486026,0.00096104166,0.00073866925,0.00083694916,0.0024054183],"category_scores_gemma":[0.0015531095,0.00040615318,0.00059398205,0.00052266754,0.0007218816,0.0006648933,0.0009192843,0.00045870693,0.0002481598],"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.000016189782,0.000018369885,0.0005250612,0.000025632831,0.000009244529,0.00006403757,0.00007580581,0.9488796,0.0014171525,0.041668776,0.00026380166,0.0070364093],"study_design_scores_gemma":[0.000002471291,0.0000031822256,0.000054469765,0.0000016211761,0.0000017869506,0.000008596534,0.000011984606,0.9916435,0.00015750997,0.00790834,0.00020446208,0.0000020709288],"about_ca_topic_score_codex":0.008185517,"about_ca_topic_score_gemma":0.008739252,"teacher_disagreement_score":0.008185517,"about_ca_system_score_codex":0.00075943646,"about_ca_system_score_gemma":0.00048418398,"threshold_uncertainty_score":0.016275704},"labels":[],"label_agreement":null},{"id":"W2059937103","doi":"10.1016/j.simpat.2013.09.001","title":"Adaptive agent abstractions to speed up spatial agent-based simulations","year":2013,"lang":"en","type":"article","venue":"Simulation Modelling Practice and Theory","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":24,"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 Calgary","funders":"","keywords":"Computer science; Abstraction; Observer (physics); Cluster (spacecraft); Cluster analysis; Process (computing); Multi-agent system; Mechanism (biology); Distributed computing; Artificial intelligence","score_opus":0.04692854746229932,"score_gpt":0.3016999441893789,"score_spread":0.2547713967270796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059937103","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.014519085,0.00009180265,0.98084486,0.00007974819,0.00007202807,0.00003521346,0.000041913394,0.0019649013,0.0023504582],"genre_scores_gemma":[0.39858088,0.00027542686,0.59686255,0.000109633744,0.00003561358,0.00017306516,0.00017795245,0.0004317563,0.003353171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949014,0.0001388618,0.000038803566,0.000073345785,0.0002007398,0.00005802262],"domain_scores_gemma":[0.9982829,0.00073844363,0.0000888973,0.0005355046,0.00025819015,0.0000960693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095532,0.00064070214,0.00085166417,0.00061451737,0.0007392886,0.0013178913,0.002071975,0.0010108063,0.004621562],"category_scores_gemma":[0.004257279,0.00066193746,0.000990197,0.0007006303,0.00094070093,0.0020748747,0.0033088038,0.0024297014,0.000943903],"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.00014229985,0.000091808775,0.0010749856,0.00011879261,0.000080505066,0.00012479824,0.00042854075,0.76283365,0.010498604,0.15149486,0.0029581299,0.0701529],"study_design_scores_gemma":[0.00001446338,0.000010200073,0.000045132016,0.0000062507374,0.0000139514505,0.000014960842,0.000016750939,0.97940105,0.001946722,0.015724758,0.0028003873,0.0000052697205],"about_ca_topic_score_codex":0.0043072808,"about_ca_topic_score_gemma":0.0055459025,"teacher_disagreement_score":0.004621562,"about_ca_system_score_codex":0.0008063114,"about_ca_system_score_gemma":0.00096515566,"threshold_uncertainty_score":0.01546067},"labels":[],"label_agreement":null},{"id":"W2066112251","doi":"10.4153/cjm-2001-016-3","title":"Building a Stationary Stochastic Process From a Finite-Dimensional Marginal","year":2001,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ergodic theory; Mathematics; Mixing (physics); Decidability; Extension (predicate logic); Process (computing); Projection (relational algebra); Measure (data warehouse); Alphabet; Stationary ergodic process; Work (physics); Stochastic process; Pure mathematics; Discrete mathematics; Invariant measure; Computer science; Algorithm; Statistics","score_opus":0.018479627832010768,"score_gpt":0.2493467516426647,"score_spread":0.23086712381065394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066112251","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.16191253,0.00014490954,0.82796764,0.0006766241,0.00006537555,0.00004440857,0.00014840953,0.0007722692,0.008267796],"genre_scores_gemma":[0.8383909,0.0001610351,0.15722339,0.00018758897,0.00009145984,0.00008735711,0.00025158236,0.00018039618,0.0034264198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987413,0.0004057423,0.00008709148,0.00035855433,0.00026289144,0.00014454115],"domain_scores_gemma":[0.99578995,0.0022414033,0.00023154616,0.0009337702,0.00033012574,0.0004731359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002590022,0.00039556783,0.0008047539,0.0007106863,0.0010823002,0.0017998198,0.001110924,0.00082351756,0.0040635327],"category_scores_gemma":[0.0076951156,0.0006270033,0.0018436497,0.0006922385,0.0034495036,0.0035407702,0.004936111,0.0023873502,0.00064382027],"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.00012428564,0.00005694169,0.0014992604,0.00008461395,0.000039916118,0.0006256503,0.0008623432,0.042768672,0.007435016,0.9341248,0.0004731501,0.011905467],"study_design_scores_gemma":[0.000019351199,0.000044962813,0.0004218638,0.000036438705,0.000027817798,0.0002088959,0.00009090155,0.22885811,0.004113685,0.7618281,0.004321305,0.00002853933],"about_ca_topic_score_codex":0.001188828,"about_ca_topic_score_gemma":0.00090225233,"teacher_disagreement_score":0.0040635327,"about_ca_system_score_codex":0.0010996489,"about_ca_system_score_gemma":0.0007884635,"threshold_uncertainty_score":0.013697445},"labels":[],"label_agreement":null},{"id":"W2072378642","doi":"10.4018/jcini.2011100106","title":"A Modular Dynamical Cryptosystem Based on Continuous-Interval Cellular Automata","year":2011,"lang":"en","type":"article","venue":"International Journal of Cognitive Informatics and Natural Intelligence","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Encryption; Cryptosystem; Cellular automaton; Theoretical computer science; Chaotic; Attractor; Interval (graph theory); Measure (data warehouse); Cryptography; Algorithm; Dynamical systems theory; Modular design; Mathematics; Data mining; Artificial intelligence; Physics","score_opus":0.017646820100397136,"score_gpt":0.25988010089993513,"score_spread":0.242233280799538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072378642","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.094042465,0.0007371108,0.88222647,0.0004910137,0.0004688995,0.00013801597,0.0001385794,0.0009292179,0.020828238],"genre_scores_gemma":[0.82246566,0.00058044295,0.16945475,0.00010833583,0.00009040609,0.00012734682,0.0000980505,0.000045434288,0.007029619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998072,0.000035107005,0.000015249066,0.0000422643,0.00007717433,0.000022955965],"domain_scores_gemma":[0.99982554,0.000047150905,0.000025106223,0.000047300793,0.000033963013,0.000020896206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001676406,0.00027803518,0.00029439383,0.00037761847,0.00032807497,0.00055365235,0.00036876838,0.00041599094,0.001706815],"category_scores_gemma":[0.0006134728,0.00009861234,0.0004554123,0.00027609628,0.00054819783,0.00068579713,0.00051249156,0.00052330113,0.00040108242],"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.00022860928,0.00010873634,0.00078357395,0.00021211113,0.0000753679,0.0006021666,0.00019327276,0.10435157,0.14103085,0.64351463,0.0024862324,0.10641293],"study_design_scores_gemma":[0.00009801363,0.00044231344,0.0007390302,0.00004185162,0.000053415628,0.0008932472,0.000032697313,0.84201777,0.05130509,0.069865786,0.03444272,0.00006804043],"about_ca_topic_score_codex":0.00046493576,"about_ca_topic_score_gemma":0.00034927722,"teacher_disagreement_score":0.001706815,"about_ca_system_score_codex":0.00038323645,"about_ca_system_score_gemma":0.00036538165,"threshold_uncertainty_score":0.005709827},"labels":[],"label_agreement":null},{"id":"W2075765532","doi":"10.1090/noti1064","title":"Infrastructure: Structure Inside the Class Group of a Real Quadratic Field","year":2013,"lang":"en","type":"article","venue":"Notices of the American Mathematical Society","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Group (periodic table); Quadratic equation; Class (philosophy); Field (mathematics); Mathematics; Pure mathematics; Computer science; Combinatorics; Physics; Geometry; Artificial intelligence; Quantum mechanics","score_opus":0.006936693886391604,"score_gpt":0.23490312235836722,"score_spread":0.22796642847197562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075765532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5215791,0.0009838254,0.21161664,0.00491833,0.00037400823,0.00021871326,0.0012594574,0.0012091167,0.25784078],"genre_scores_gemma":[0.9484161,0.0003262284,0.0132766375,0.0002938735,0.00026803766,0.000081389975,0.0006193648,0.00012744548,0.036590908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950564,0.00008537604,0.000019636547,0.00011198862,0.000116894145,0.00016040314],"domain_scores_gemma":[0.9990233,0.00031705864,0.00016222891,0.00014042447,0.00013774718,0.00021917526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004224646,0.00033123663,0.00037018594,0.0011696283,0.0014267565,0.0021821319,0.00061198504,0.0005768256,0.021142514],"category_scores_gemma":[0.0017713846,0.00026657825,0.00033122336,0.0009204654,0.002207832,0.00408675,0.001532048,0.001197943,0.0027935994],"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.000054424032,0.000018288452,0.00047978343,0.000044726425,0.0000036774659,0.00010895862,0.00045134278,0.0009524832,0.0006853998,0.98445326,0.003300892,0.00944678],"study_design_scores_gemma":[0.000051249433,0.000039687257,0.0009542344,0.000019740184,0.0000063877033,0.0001656033,0.00020760158,0.0050451183,0.0006447775,0.97137004,0.021477664,0.000017909273],"about_ca_topic_score_codex":0.0022795645,"about_ca_topic_score_gemma":0.0013108104,"teacher_disagreement_score":0.021142514,"about_ca_system_score_codex":0.0012957718,"about_ca_system_score_gemma":0.000639996,"threshold_uncertainty_score":0.07072878},"labels":[],"label_agreement":null},{"id":"W2076251080","doi":"10.1007/s11047-013-9374-9","title":"Solving the parity problem in one-dimensional cellular automata","year":2013,"lang":"en","type":"article","venue":"Natural Computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Theory of computation; Conjecture; Parity (physics); Cellular automaton; Correctness; Mathematics; RADIUS; Existential quantification; Combinatorics; Discrete mathematics; Computer science; Algorithm; Physics","score_opus":0.014755651990404803,"score_gpt":0.22995825035915582,"score_spread":0.21520259836875102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076251080","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.39271107,0.00035352656,0.58341384,0.0017604661,0.00022314797,0.0000553132,0.00017936269,0.00046721884,0.020836042],"genre_scores_gemma":[0.9348655,0.00014686892,0.061057676,0.00014002653,0.000036171466,0.00005682929,0.0001258474,0.000069500195,0.0035015084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996413,0.0001315651,0.000022835087,0.00007312673,0.00006520191,0.000065981694],"domain_scores_gemma":[0.9972487,0.0021745113,0.000102301055,0.00022883808,0.00016485654,0.000080659425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000582239,0.00032620307,0.00091729424,0.00032121077,0.0006512738,0.0015125918,0.0011393857,0.0013572786,0.003374939],"category_scores_gemma":[0.0059968526,0.00029990185,0.0006269861,0.0003371636,0.0013546841,0.0019639537,0.0014297379,0.001229236,0.0002861515],"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.0002039004,0.00009287657,0.0020708214,0.00030953393,0.000040950603,0.00032048728,0.00033351572,0.39536747,0.0063924757,0.5344819,0.0028805537,0.057505544],"study_design_scores_gemma":[0.00003355939,0.000026006493,0.00010687817,0.000010171301,0.0000105409945,0.000042548734,0.00006526911,0.6838639,0.0018075047,0.31327546,0.0007464933,0.000011744939],"about_ca_topic_score_codex":0.0022809727,"about_ca_topic_score_gemma":0.0019679414,"teacher_disagreement_score":0.003374939,"about_ca_system_score_codex":0.0005346761,"about_ca_system_score_gemma":0.0007879643,"threshold_uncertainty_score":0.011290252},"labels":[],"label_agreement":null},{"id":"W2076471571","doi":"10.4204/eptcs.90.9","title":"On the Parity Problem in One-Dimensional Cellular Automata","year":2012,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Parity (physics); Mathematics; Cellular automaton; Existential quantification; RADIUS; Neighbourhood (mathematics); Combinatorics; Discrete mathematics; Computer science; Algorithm; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.009925712297043532,"score_gpt":0.22783236351567598,"score_spread":0.21790665121863245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076471571","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.31081706,0.00053173426,0.6627043,0.0014842518,0.00019591002,0.00010556183,0.00009728791,0.000599615,0.023464363],"genre_scores_gemma":[0.86276644,0.0003939021,0.1308312,0.00033808604,0.0000754911,0.00019197431,0.00014526762,0.00019556732,0.005062021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986771,0.0004972276,0.00012997715,0.00022987481,0.00030194438,0.00016393261],"domain_scores_gemma":[0.9931335,0.0047593648,0.0004021484,0.000795168,0.0005930338,0.00031676053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002221713,0.00041936096,0.0009266876,0.0005635112,0.0013520875,0.0017184535,0.0014958071,0.0018847398,0.002178216],"category_scores_gemma":[0.01722648,0.00038185192,0.00094928633,0.00043582934,0.0042884727,0.0034115906,0.002686028,0.0017996681,0.00045040765],"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.00016221988,0.00005625305,0.0018354183,0.00015788057,0.000024613884,0.0004336417,0.0005189831,0.19739562,0.0058732075,0.77157515,0.0009503771,0.021016568],"study_design_scores_gemma":[0.00003874814,0.000062312465,0.0001182087,0.000025100275,0.000010769457,0.00011395319,0.000087224165,0.39386526,0.0032709406,0.60140246,0.000980235,0.0000248586],"about_ca_topic_score_codex":0.0015492331,"about_ca_topic_score_gemma":0.00083755393,"teacher_disagreement_score":0.002221713,"about_ca_system_score_codex":0.0009581133,"about_ca_system_score_gemma":0.0008126372,"threshold_uncertainty_score":0.011749685},"labels":[],"label_agreement":null},{"id":"W2076767174","doi":"10.4018/jssci.2012070105","title":"Evaluating the Security Level of a Cryptosystem based on Chaos","year":2012,"lang":"en","type":"article","venue":"International Journal of Software Science and Computational Intelligence","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cryptosystem; Computer science; Chaotic; Surrogate data; Attractor; Hybrid cryptosystem; Dimension (graph theory); Theoretical computer science; CHAOS (operating system); Paillier cryptosystem; Algorithm; Cryptography; Mathematics; Artificial intelligence; Computer security; Nonlinear system","score_opus":0.1398345414593873,"score_gpt":0.3974886792284687,"score_spread":0.2576541377690814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076767174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8658842,0.00033544557,0.12988116,0.00012001997,0.000073349394,0.00009313042,0.00012867621,0.00029042023,0.003193526],"genre_scores_gemma":[0.9870165,0.00007159874,0.012591643,0.0000069587104,0.0000060008206,0.000020022337,0.000056381017,0.000013996745,0.00021681013],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827504,0.00042802212,0.00014047997,0.0001913653,0.00081608206,0.00014899609],"domain_scores_gemma":[0.9913818,0.005473408,0.00094092236,0.0009995064,0.00093513937,0.00026918517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014523136,0.0005040656,0.00053684047,0.0012244442,0.0004576201,0.0007631014,0.00040299393,0.00074006466,0.001216833],"category_scores_gemma":[0.011418931,0.00013821626,0.00031159402,0.00041644147,0.0011382223,0.0016952858,0.00076475093,0.0005354931,0.00021441844],"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.0027573344,0.0004884714,0.035723988,0.00079601386,0.00032547218,0.0007390654,0.0005123963,0.1328138,0.6492427,0.03781004,0.0006693629,0.1381214],"study_design_scores_gemma":[0.00007390163,0.004378895,0.01497889,0.00007812509,0.00009161927,0.0009643202,0.00020182352,0.36924532,0.59819937,0.009613484,0.0020499465,0.00012435399],"about_ca_topic_score_codex":0.00021227644,"about_ca_topic_score_gemma":0.00015380273,"teacher_disagreement_score":0.0014523136,"about_ca_system_score_codex":0.0005693424,"about_ca_system_score_gemma":0.00033753423,"threshold_uncertainty_score":0.0076806545},"labels":[],"label_agreement":null},{"id":"W2078005650","doi":"10.1177/0037549706073698","title":"Applying Cell-DEVS Methodology for Modeling the Environment","year":2006,"lang":"en","type":"article","venue":"SIMULATION","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Computer science; Cellular automaton; Formalism (music); Distributed computing; Usability; Discrete event simulation; Automaton; Modeling and simulation; Theoretical computer science; Simulation; Artificial intelligence; Human–computer interaction","score_opus":0.07650001709710176,"score_gpt":0.30216969761457757,"score_spread":0.22566968051747582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078005650","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.0017019568,0.000069516194,0.9950694,0.000062264015,0.000035091613,0.00003676567,0.00013711186,0.00050388597,0.0023840133],"genre_scores_gemma":[0.060029425,0.00048901787,0.93371576,0.0001204351,0.000033858887,0.0006264197,0.0008645317,0.0003928687,0.0037276016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996309,0.00010862547,0.000035184265,0.00005327196,0.0001407572,0.00003123873],"domain_scores_gemma":[0.9993174,0.0003410458,0.00004376791,0.00011576992,0.00014857469,0.000033524306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009299531,0.00063741015,0.00054990593,0.0006480579,0.00057504454,0.0012344739,0.0019430196,0.00088934845,0.0029793936],"category_scores_gemma":[0.0017382826,0.0003763457,0.001347273,0.0007261698,0.00068659533,0.0009044916,0.001298065,0.001265921,0.0008695161],"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.000019066447,0.00003432864,0.0014614934,0.00030221886,0.00005899465,0.00029011804,0.00030780083,0.48627102,0.007843485,0.45369995,0.003772929,0.045938645],"study_design_scores_gemma":[0.0000126007035,0.000017269846,0.0001095061,0.000026627878,0.000019969319,0.00013841536,0.000034918434,0.8793989,0.005996289,0.054525383,0.05970365,0.00001647875],"about_ca_topic_score_codex":0.0036170015,"about_ca_topic_score_gemma":0.0037055817,"teacher_disagreement_score":0.0036170015,"about_ca_system_score_codex":0.0006664939,"about_ca_system_score_gemma":0.0013104229,"threshold_uncertainty_score":0.009967089},"labels":[],"label_agreement":null},{"id":"W2078059505","doi":"10.1090/s0002-9947-10-05003-8","title":"Multidimensional sofic shifts without separation and their factors","year":2010,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Universidad de Chile; National Science Foundation","keywords":"Mathematics; Separation (statistics); Pure mathematics; Statistics","score_opus":0.011056475398771306,"score_gpt":0.26016774233398327,"score_spread":0.24911126693521196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078059505","genre_codex":"other","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.08683688,0.0012052834,0.36743864,0.0019456417,0.002630137,0.00016411053,0.00086758024,0.0023457396,0.5365659],"genre_scores_gemma":[0.63806367,0.0010752726,0.124482475,0.0014196043,0.0010502938,0.00034448682,0.0012472636,0.0038307828,0.22848624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886715,0.00014883827,0.00008780219,0.0002813021,0.00035957168,0.00025533658],"domain_scores_gemma":[0.9993561,0.00010852334,0.000049886305,0.0001785947,0.00021060302,0.00009625865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007302083,0.001041972,0.00059773686,0.0022456131,0.002156258,0.002849663,0.00087202474,0.0011311759,0.04582291],"category_scores_gemma":[0.0026598892,0.00061679137,0.0014767831,0.0010884539,0.0021552478,0.005141567,0.0036282283,0.0029381658,0.014912001],"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.000037798087,0.000015071318,0.0000943844,0.000031542684,0.0000061408105,0.00008759618,0.00020879372,0.000267679,0.0009419179,0.9763017,0.005632498,0.01637488],"study_design_scores_gemma":[0.000016448192,0.000026130327,0.000207759,0.000037183123,0.000011072615,0.00016851847,0.0002689894,0.0024993417,0.0026492646,0.9549368,0.039154734,0.000023784878],"about_ca_topic_score_codex":0.0010702601,"about_ca_topic_score_gemma":0.0012747615,"teacher_disagreement_score":0.04582291,"about_ca_system_score_codex":0.001659534,"about_ca_system_score_gemma":0.0006617908,"threshold_uncertainty_score":0.15329295},"labels":[],"label_agreement":null},{"id":"W2078935483","doi":"10.1007/s000260200006","title":"Enumeration of Rooted Cubic Planar Maps","year":2002,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Enumeration; Combinatorics; Mathematics; Planar; Planar graph; Discrete mathematics; Computer science; Graph; Computer graphics (images)","score_opus":0.05856235887585335,"score_gpt":0.26827064313871196,"score_spread":0.20970828426285862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078935483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5628834,0.00097231957,0.24076127,0.0013445357,0.00016811867,0.00018920946,0.002400931,0.0011163577,0.19016382],"genre_scores_gemma":[0.83196133,0.0010770736,0.11724873,0.00023846058,0.00006887295,0.0001709783,0.0031530082,0.00026307398,0.04581854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996196,0.000059919046,0.000024269542,0.00006566627,0.00012090448,0.000109510336],"domain_scores_gemma":[0.9988883,0.0005817321,0.00008352679,0.00014266389,0.00021119535,0.00009260875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016155998,0.00045183342,0.00067641767,0.0011228117,0.0012187735,0.0027471504,0.0011677492,0.00090538006,0.011770697],"category_scores_gemma":[0.0022989188,0.00042735637,0.0005104323,0.002801032,0.00071656867,0.0018244444,0.0017334166,0.0014750508,0.0017422813],"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.0001964679,0.0001521105,0.0016010512,0.00047190825,0.0000292854,0.0002094314,0.00066938007,0.024068657,0.008158032,0.8054497,0.012305128,0.14668891],"study_design_scores_gemma":[0.000059512455,0.000042648655,0.0009563725,0.000081526625,0.000044171655,0.0002498093,0.00044553328,0.077747494,0.0061995606,0.8878155,0.026328586,0.000029298379],"about_ca_topic_score_codex":0.004389149,"about_ca_topic_score_gemma":0.007563911,"teacher_disagreement_score":0.011770697,"about_ca_system_score_codex":0.0014144072,"about_ca_system_score_gemma":0.0010699277,"threshold_uncertainty_score":0.039376915},"labels":[],"label_agreement":null},{"id":"W2080501520","doi":"10.1504/ijica.2012.046779","title":"Knowledge-based image segmentation using swarm intelligence techniques","year":2012,"lang":"en","type":"article","venue":"International Journal of Innovative Computing and Applications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Swarm behaviour; Artificial intelligence; Image segmentation; Swarm intelligence; Segmentation; Segmentation-based object categorization; Image (mathematics); Computer vision; Cellular automaton; Scale-space segmentation; Pixel; Pattern recognition (psychology); Machine learning; Particle swarm optimization","score_opus":0.03440100883696548,"score_gpt":0.3687368195775669,"score_spread":0.33433581074060137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080501520","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.0062000416,0.00016612478,0.9910149,0.00008871554,0.000016070904,0.00003040954,0.000012010636,0.0003829634,0.0020887149],"genre_scores_gemma":[0.33577785,0.0005334553,0.660086,0.000095517156,0.000041834945,0.00013168476,0.00012028425,0.000113954105,0.003099402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997211,0.000049133025,0.000025448076,0.00007050753,0.00010704307,0.000026653363],"domain_scores_gemma":[0.99963593,0.00016224543,0.000050031456,0.000064820386,0.00006806504,0.00001888541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004299474,0.0005245551,0.00090963166,0.001162952,0.0005279522,0.0014136598,0.0007662256,0.00083677296,0.001180851],"category_scores_gemma":[0.0011288857,0.00040424522,0.00089641387,0.0007378574,0.0007914927,0.0014397043,0.0009825334,0.00059484184,0.00038759416],"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.00009894293,0.0000910789,0.0008521694,0.00019797203,0.00013759876,0.00025435074,0.0004138892,0.5983866,0.053568874,0.043651138,0.002019022,0.30032843],"study_design_scores_gemma":[0.0000087054705,0.000023324592,0.00019041325,0.000012268512,0.000018839608,0.000050241113,0.000033140368,0.9758406,0.0065721055,0.014781281,0.0024566832,0.000012245029],"about_ca_topic_score_codex":0.003330668,"about_ca_topic_score_gemma":0.0024968998,"teacher_disagreement_score":0.003330668,"about_ca_system_score_codex":0.0007398902,"about_ca_system_score_gemma":0.0006531772,"threshold_uncertainty_score":0.006622553},"labels":[],"label_agreement":null},{"id":"W2081706679","doi":"10.1109/cec.2012.6256126","title":"Single parent generalization of cellular automata rules","year":2012,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Generalization; Cellular automaton; Computer science; Crossover; Automaton; Set (abstract data type); Theoretical computer science; Population; Fidelity; Evolutionary computation; Mobile automaton; Evolutionary algorithm; Mathematics; Automata theory; Artificial intelligence","score_opus":0.030654312706322944,"score_gpt":0.24654055923307566,"score_spread":0.21588624652675273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081706679","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.1867792,0.0004481592,0.8011884,0.00031689694,0.0001380353,0.00015388646,0.0001092619,0.0010484697,0.009817647],"genre_scores_gemma":[0.7614338,0.00036806008,0.23301882,0.00015039323,0.000039666305,0.00015484689,0.00011424414,0.00012514686,0.0045950417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935037,0.00013547059,0.000048566682,0.00019181438,0.00022525815,0.00004841897],"domain_scores_gemma":[0.9976094,0.00080421526,0.00020773865,0.0010001269,0.00030273537,0.00007570616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008748373,0.00035178286,0.00074731937,0.00030493757,0.00055004144,0.0006605362,0.0014928415,0.00081889244,0.0017855419],"category_scores_gemma":[0.00423035,0.00023756482,0.0007901204,0.0003281576,0.0010192741,0.0012305856,0.0009579915,0.001322683,0.00045974174],"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.00013988528,0.00015196906,0.0038631393,0.00025984796,0.00009921613,0.0014887439,0.0011979974,0.4919009,0.09141541,0.17403844,0.003038118,0.23240636],"study_design_scores_gemma":[0.000027149843,0.00019205203,0.0008673019,0.000025581308,0.000037023463,0.0008780725,0.00007077507,0.8930646,0.024365075,0.071011215,0.009421493,0.000039688228],"about_ca_topic_score_codex":0.0011090017,"about_ca_topic_score_gemma":0.0013449821,"teacher_disagreement_score":0.0017855419,"about_ca_system_score_codex":0.00046871058,"about_ca_system_score_gemma":0.00048675088,"threshold_uncertainty_score":0.00597322},"labels":[],"label_agreement":null},{"id":"W2086933643","doi":"10.1088/1742-5468/2014/02/p02009","title":"Minimal entropy approximation for cellular automata","year":2014,"lang":"en","type":"article","venue":"Journal of Statistical Mechanics Theory and Experiment","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Cellular automaton; Entropy (arrow of time); Mathematics; Extension (predicate logic); Applied mathematics; Computer science; Algorithm; Physics","score_opus":0.010334406438703954,"score_gpt":0.2612652352551137,"score_spread":0.2509308288164097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086933643","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.03457979,0.00023476778,0.9586861,0.00016152288,0.000038336886,0.0000245678,0.000048142672,0.00020087724,0.006025921],"genre_scores_gemma":[0.80483705,0.0002480276,0.18952093,0.00008056893,0.00004785936,0.00011884717,0.00013339747,0.00011017382,0.0049031707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995622,0.00015395299,0.000016756338,0.00005388557,0.00017680415,0.000036370155],"domain_scores_gemma":[0.9990392,0.0005712248,0.0000811479,0.00014278469,0.00010462631,0.00006110265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005907208,0.00042002232,0.00068770593,0.00072954607,0.0005344345,0.00080895267,0.0008481571,0.0007205245,0.0016528016],"category_scores_gemma":[0.0033739915,0.00026592382,0.00075084297,0.00033241347,0.0013460751,0.0011445552,0.0010915025,0.0010425419,0.00032800683],"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.0000418138,0.000018584175,0.00056459825,0.00005706081,0.000019566938,0.000065658176,0.0001291275,0.3310954,0.0036271682,0.6525456,0.00055022386,0.011285172],"study_design_scores_gemma":[0.0000028741263,0.000009377797,0.000057977802,0.0000045123,0.0000021947553,0.000014054372,0.000006087961,0.8538783,0.00050135265,0.14504734,0.000470895,0.000005042892],"about_ca_topic_score_codex":0.0015349004,"about_ca_topic_score_gemma":0.0009596367,"teacher_disagreement_score":0.0016528016,"about_ca_system_score_codex":0.0011918333,"about_ca_system_score_gemma":0.000533434,"threshold_uncertainty_score":0.008647442},"labels":[],"label_agreement":null},{"id":"W2087852087","doi":"10.1117/12.477185","title":"Video object segmentation in the cellular neural networks architecture","year":2002,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction; National Science Foundation","keywords":"Computer science; Artificial intelligence; Segmentation; Computer vision; Image segmentation; Video tracking; Key (lock); Object (grammar); Cellular neural network; Scale-space segmentation; Segmentation-based object categorization; Artificial neural network; Interactivity; Pattern recognition (psychology); Multimedia","score_opus":0.010511773175466008,"score_gpt":0.21399574319449177,"score_spread":0.20348397001902577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087852087","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.27247322,0.00068394287,0.71183926,0.0005089704,0.00013493423,0.00004813238,0.00012512792,0.0008921794,0.013294118],"genre_scores_gemma":[0.9000238,0.00025681354,0.093363374,0.000074078416,0.000016082655,0.00006456054,0.00008401568,0.000027755677,0.0060895574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999529,0.000008881706,0.0000019981999,0.000015959544,0.000011388859,0.0000087463595],"domain_scores_gemma":[0.99994576,0.000015978649,0.000005811418,0.0000065018785,0.000021105841,0.000004802046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000896536,0.00016858024,0.00017685119,0.00015722249,0.00025534703,0.0003373271,0.00034492256,0.00047661102,0.0009788353],"category_scores_gemma":[0.00033348028,0.00012284232,0.00017516805,0.00020877419,0.00029328867,0.00039775934,0.00017367343,0.00021562085,0.00015047425],"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.00008789513,0.000025065405,0.0007293065,0.000042929132,0.000015142279,0.00010217896,0.000054125736,0.88721997,0.03145842,0.0435652,0.00089647394,0.03580333],"study_design_scores_gemma":[0.0000030379986,0.000011163522,0.00013799533,0.0000019747379,0.0000029667235,0.000010930794,0.0000037337454,0.9931758,0.002833028,0.0032166142,0.00060024444,0.0000025453921],"about_ca_topic_score_codex":0.010210423,"about_ca_topic_score_gemma":0.008049787,"teacher_disagreement_score":0.010210423,"about_ca_system_score_codex":0.00085674354,"about_ca_system_score_gemma":0.0004817576,"threshold_uncertainty_score":0.020301998},"labels":[],"label_agreement":null},{"id":"W2088745724","doi":"10.1109/icci-cc.2013.6622230","title":"Comparison of selected cryptosystems using single-scale and poly-scale measures","year":2013,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"ElGamal encryption; Cryptosystem; Cryptanalysis; Hybrid cryptosystem; Cryptography; Public-key cryptography; Computer science; Algorithm; Theoretical computer science; Plaintext; Elliptic curve cryptography; Mathematics; Encryption; Computer security","score_opus":0.03861754344867175,"score_gpt":0.2721292727625662,"score_spread":0.23351172931389447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088745724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7624122,0.002353568,0.22266793,0.00019901484,0.00015275713,0.00026870554,0.00033995337,0.0005074966,0.011098273],"genre_scores_gemma":[0.9661592,0.0003923646,0.03274903,0.000013639957,0.000019579746,0.000083091676,0.00018395795,0.000033026503,0.0003661559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976131,0.0006592036,0.00018469484,0.00021055713,0.001198995,0.00013345628],"domain_scores_gemma":[0.99214125,0.004913539,0.0008293385,0.0012267937,0.00074549404,0.00014364212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021025564,0.00044574734,0.00047265054,0.00302309,0.00037871982,0.0009097752,0.0003950732,0.00040006777,0.0009947096],"category_scores_gemma":[0.011610373,0.00009664518,0.00034124803,0.0018378805,0.00091707223,0.002104449,0.0007220811,0.00046719218,0.0001704375],"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.00255149,0.0005519481,0.028052576,0.0015878901,0.0005182082,0.00040628997,0.0005738394,0.1732521,0.10784917,0.24203685,0.0019028558,0.44071674],"study_design_scores_gemma":[0.00018427522,0.0030315742,0.049445145,0.00015533504,0.00018577294,0.0012829083,0.00065807917,0.66972154,0.18507178,0.07889387,0.011161491,0.00020826704],"about_ca_topic_score_codex":0.00017297552,"about_ca_topic_score_gemma":0.0002137096,"teacher_disagreement_score":0.00302309,"about_ca_system_score_codex":0.0007178451,"about_ca_system_score_gemma":0.00034788265,"threshold_uncertainty_score":0.011119485},"labels":[],"label_agreement":null},{"id":"W2091933094","doi":"10.1016/j.tcs.2010.11.006","title":"On the relationship between fuzzy and Boolean cellular automata","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":19,"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 Ottawa","funders":"","keywords":"Automaton; Fuzzy logic; Mathematics; Boolean expression; Cellular automaton; Theoretical computer science; Computer science; Discrete mathematics; Algebra over a field; Boolean function; Algorithm; Artificial intelligence; Pure mathematics","score_opus":0.018595582783489318,"score_gpt":0.2532387237377519,"score_spread":0.23464314095426259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091933094","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.17105556,0.015381071,0.682992,0.00867962,0.0010291132,0.00007881554,0.00053565693,0.00025904307,0.11998909],"genre_scores_gemma":[0.91104895,0.0058984077,0.06662128,0.0010240901,0.00085166324,0.0001266231,0.00023903158,0.00008527738,0.014104734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986889,0.0004920962,0.00008562365,0.00029054034,0.00032003998,0.00012290607],"domain_scores_gemma":[0.980959,0.016197821,0.0006814901,0.0007780742,0.0010902578,0.0002933256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020431438,0.00047359624,0.0009587831,0.0017221696,0.0016633556,0.0039611016,0.0014100483,0.0023707738,0.006054379],"category_scores_gemma":[0.022751674,0.0005842937,0.000879755,0.0021937503,0.0047915047,0.0069176713,0.0018422384,0.002858197,0.00047100172],"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.000021303054,0.000007696905,0.00018625891,0.00003220413,0.0000070788847,0.000034746263,0.00012376769,0.0053966143,0.00020772147,0.9884444,0.00045993322,0.005078409],"study_design_scores_gemma":[0.0000065865083,0.000009771619,0.00013464704,0.000017081074,0.000009446415,0.000040353374,0.00004054575,0.031754445,0.00013200873,0.96604544,0.0017986476,0.000011141227],"about_ca_topic_score_codex":0.0044458504,"about_ca_topic_score_gemma":0.0031471802,"teacher_disagreement_score":0.006054379,"about_ca_system_score_codex":0.0025181894,"about_ca_system_score_gemma":0.0009500273,"threshold_uncertainty_score":0.020253897},"labels":[],"label_agreement":null},{"id":"W2092383642","doi":"10.1016/j.dam.2007.07.003","title":"Hybrid one-dimensional reversible cellular automata are regular","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"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 British Columbia","funders":"","keywords":"Cellular automaton; Mathematics; Constant (computer programming); Boundary (topology); Set (abstract data type); Automaton; Discrete mathematics; Combinatorics; Null (SQL); Uniform distribution (continuous); Periodic boundary conditions; Algorithm; Boundary value problem; Theoretical computer science; Computer science; Mathematical analysis; Statistics","score_opus":0.015882856268701333,"score_gpt":0.2307198706222915,"score_spread":0.21483701435359015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092383642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47152495,0.0016587225,0.4009484,0.0011179156,0.0003456214,0.000125801,0.0010086469,0.0022652585,0.121004626],"genre_scores_gemma":[0.9636248,0.00040758975,0.019423926,0.00011666999,0.00006934244,0.000081622806,0.00022186701,0.00013737543,0.015916828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995602,0.000082054794,0.000026502075,0.00013774709,0.00012483363,0.00006872194],"domain_scores_gemma":[0.99864906,0.00055917125,0.00020895131,0.0002771124,0.0002176537,0.00008815953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030564747,0.0004615434,0.00090986537,0.00071795995,0.00075169845,0.0019995586,0.0009317141,0.0010977816,0.0054504327],"category_scores_gemma":[0.0020622527,0.0004071863,0.0007987444,0.00055079325,0.001792823,0.0013904659,0.00085120305,0.0010658528,0.0010904766],"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.000086272645,0.00003055915,0.00035460308,0.00010620373,0.00002668168,0.00020220442,0.00018023443,0.023306755,0.010222079,0.9536854,0.0013456128,0.010453401],"study_design_scores_gemma":[0.000041260577,0.000048564896,0.00041147906,0.000019274978,0.00003307991,0.00041511309,0.00011841682,0.17661716,0.0072849784,0.8089988,0.0059684943,0.000043374534],"about_ca_topic_score_codex":0.00083890493,"about_ca_topic_score_gemma":0.0008829672,"teacher_disagreement_score":0.0054504327,"about_ca_system_score_codex":0.00069604395,"about_ca_system_score_gemma":0.00038356445,"threshold_uncertainty_score":0.018233478},"labels":[],"label_agreement":null},{"id":"W2093783531","doi":"10.1016/j.tcs.2011.02.021","title":"Positive expansiveness versus network dimension in symbolic dynamical systems","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dynamical systems theory; Countable set; Dynamical system (definition); Topological entropy; Symbolic dynamics; Counterexample; Discrete mathematics; Invariant (physics); Exponent; Dimension (graph theory); Function (biology); Topological conjugacy; Pure mathematics; Combinatorics","score_opus":0.014673494038912948,"score_gpt":0.23768209010071864,"score_spread":0.2230085960618057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093783531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7309556,0.0020057845,0.20287225,0.0031427091,0.00015854288,0.000043318087,0.00016370104,0.000084220286,0.060573943],"genre_scores_gemma":[0.9936069,0.00047676978,0.00417949,0.000048541642,0.00010090006,0.00003352913,0.000022766788,0.000009508149,0.0015215781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936324,0.00028193748,0.000033379314,0.00011100523,0.00014157507,0.000068896596],"domain_scores_gemma":[0.9914683,0.006314428,0.0007882383,0.00046700664,0.00036264857,0.0005993899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010923997,0.00046417164,0.0006632825,0.0012706025,0.0010271134,0.0026686722,0.00054444076,0.0007366749,0.0033223839],"category_scores_gemma":[0.006419997,0.00033187892,0.00036523698,0.00071831414,0.005791295,0.004879345,0.002368573,0.0012981879,0.00016325692],"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.000042841733,0.000014656973,0.00075798645,0.000044395296,0.00001233776,0.00006848702,0.00037589722,0.012135766,0.00070768053,0.9816098,0.00018450065,0.004045622],"study_design_scores_gemma":[0.000017733008,0.000026362502,0.00042087625,0.000016308952,0.000011022641,0.00006279108,0.0001438443,0.028421473,0.00024695243,0.9697379,0.0008828232,0.000011895414],"about_ca_topic_score_codex":0.00047193872,"about_ca_topic_score_gemma":0.00040893446,"teacher_disagreement_score":0.0033223839,"about_ca_system_score_codex":0.0006243596,"about_ca_system_score_gemma":0.000320528,"threshold_uncertainty_score":0.011114538},"labels":[],"label_agreement":null},{"id":"W2094358031","doi":"10.3934/dcds.2005.13.339","title":"Structure of a class of traveling waves in delayed cellular neural networks","year":2005,"lang":"en","type":"article","venue":"Discrete and Continuous Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Traveling wave; Monotonic function; Mathematical analysis; Lattice (music); Physics; Mathematics; Plane (geometry); Partition (number theory); Artificial neural network; Complex plane; Computer science; Combinatorics; Geometry; Acoustics","score_opus":0.004314712209468552,"score_gpt":0.2047729388503904,"score_spread":0.20045822664092186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094358031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8357599,0.00080954144,0.15034601,0.00047522568,0.000040919727,0.0000639172,0.00015765229,0.00012014058,0.012226666],"genre_scores_gemma":[0.98780024,0.0002535607,0.008839686,0.000056152116,0.000031673375,0.00005246036,0.00011417154,0.000016708342,0.002835326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991274,0.00001657616,0.000005174165,0.000017152652,0.00002418049,0.000024214689],"domain_scores_gemma":[0.99959177,0.00008957256,0.00011075914,0.000025493631,0.00011522962,0.00006723547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022443413,0.00030113297,0.00031486154,0.00093507173,0.0006159155,0.0010760357,0.0006393867,0.0006494364,0.0018812867],"category_scores_gemma":[0.0011345175,0.00023263802,0.00035237308,0.00033318793,0.0007891039,0.00085068727,0.0003952742,0.0005187527,0.0001678807],"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.00019531652,0.000071071176,0.0043620137,0.00014422959,0.00007988217,0.00078649307,0.0005391695,0.105932005,0.042200472,0.82636327,0.0018921801,0.017433891],"study_design_scores_gemma":[0.0000683869,0.000101888305,0.0018604873,0.000027053564,0.000023907087,0.00044176413,0.00021815,0.7461016,0.004460464,0.24440424,0.002261485,0.000030463183],"about_ca_topic_score_codex":0.00085257355,"about_ca_topic_score_gemma":0.00045583138,"teacher_disagreement_score":0.0018812867,"about_ca_system_score_codex":0.0006714586,"about_ca_system_score_gemma":0.00032513318,"threshold_uncertainty_score":0.006293595},"labels":[],"label_agreement":null},{"id":"W2096616111","doi":"10.1016/j.comgeo.2004.12.004","title":"When can a net fold to a polyhedron?","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":17,"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 Waterloo","funders":"","keywords":"Polyhedron; Dihedral angle; Net (polyhedron); Fold (higher-order function); Folding (DSP implementation); Combinatorics; Time complexity; Mathematics; Computer science; Geometry; Algorithm; Physics; Structural engineering; Engineering","score_opus":0.01190106065325264,"score_gpt":0.2493156393802527,"score_spread":0.23741457872700006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096616111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5060579,0.00068183464,0.26474753,0.01508455,0.0023527122,0.00016465533,0.0005780114,0.0013972697,0.20893548],"genre_scores_gemma":[0.92940843,0.0004018179,0.034793984,0.0005937761,0.00017556969,0.0000985008,0.00028232703,0.00033489423,0.033910606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994837,0.00007302802,0.000023860337,0.00014137692,0.00011354702,0.00016453429],"domain_scores_gemma":[0.9981781,0.0006154008,0.00012323372,0.00033644936,0.0003157745,0.00043096495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005937908,0.00035959025,0.00058973633,0.000571007,0.0020867675,0.003611031,0.00086911273,0.0022595474,0.016030231],"category_scores_gemma":[0.0063409763,0.0004879708,0.0006984726,0.00039848365,0.0032781262,0.0106013585,0.0019010223,0.0018600401,0.0032751486],"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.0005204427,0.00008876654,0.0047665397,0.00014828528,0.00003636442,0.0015834906,0.0012528766,0.015422776,0.006857728,0.8792588,0.016678816,0.07338523],"study_design_scores_gemma":[0.000021829857,0.00006983783,0.00070221577,0.00009269345,0.000016559203,0.00062682363,0.0038779576,0.032210644,0.004414183,0.93474036,0.023186734,0.000040108236],"about_ca_topic_score_codex":0.0017426783,"about_ca_topic_score_gemma":0.002016714,"teacher_disagreement_score":0.016030231,"about_ca_system_score_codex":0.00083239947,"about_ca_system_score_gemma":0.0006785305,"threshold_uncertainty_score":0.053626418},"labels":[],"label_agreement":null},{"id":"W2096765921","doi":"10.1109/imtc.2003.1207980","title":"Robotic tactile recognition of pseudo-random encoded objects","year":2004,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Canadian Space Agency","keywords":"Object (grammar); Computer vision; Computer science; Artificial intelligence; Property (philosophy); Encoding (memory); Cognitive neuroscience of visual object recognition; Identity (music); Window (computing); Surface (topology); Tactile sensor; Simple (philosophy); Pattern recognition (psychology); Computer graphics (images); Robot; Mathematics; Acoustics; Geometry; Physics","score_opus":0.017169318664538878,"score_gpt":0.2318389183017824,"score_spread":0.21466959963724352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096765921","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.14559513,0.0005235587,0.84740525,0.00019272738,0.00019209724,0.000036457008,0.000082908955,0.0018076915,0.0041641425],"genre_scores_gemma":[0.8004449,0.00024146822,0.19454858,0.00011413453,0.000029764631,0.00005412259,0.000095446674,0.00005940078,0.004412263],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997123,0.000047115274,0.000013892453,0.000054604603,0.00014785091,0.000024128287],"domain_scores_gemma":[0.99960774,0.00012553178,0.00005552454,0.00014121026,0.00005022571,0.00001989587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020180034,0.00022008365,0.00042571817,0.00021472818,0.00016664325,0.0005697678,0.0007581352,0.0004539726,0.0011345715],"category_scores_gemma":[0.001316628,0.00018855945,0.00027127875,0.00015914574,0.0004560324,0.00088767346,0.0007691515,0.00030195634,0.00041852688],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0004912776,0.000086737724,0.00049379765,0.00018691145,0.000031483152,0.00028719837,0.0002104181,0.040298123,0.6944051,0.022887168,0.0019291473,0.23869258],"study_design_scores_gemma":[0.000048146565,0.0004274747,0.0016750962,0.000023331815,0.000030259884,0.0011240615,0.00007888912,0.55913574,0.4084702,0.016151732,0.012740039,0.00009496607],"about_ca_topic_score_codex":0.00026133528,"about_ca_topic_score_gemma":0.000350871,"teacher_disagreement_score":0.0011345715,"about_ca_system_score_codex":0.0002272513,"about_ca_system_score_gemma":0.0001646839,"threshold_uncertainty_score":0.0037955046},"labels":[],"label_agreement":null},{"id":"W2098493855","doi":"10.3390/sym5010001","title":"Taylor–Socolar Hexagonal Tilings as Model Sets","year":2012,"lang":"en","type":"article","venue":"Symmetry","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea; National Research Foundation","keywords":"Substitution tiling; Aperiodic graph; Combinatorics; Bijection; Hexagonal tiling; Mathematics; Square tiling; Countable set; Penrose tiling; Geometry; Quasicrystal","score_opus":0.01825239701514192,"score_gpt":0.27454718979611725,"score_spread":0.25629479278097533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098493855","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6769688,0.0005041036,0.21649662,0.0006468863,0.00014823841,0.00010851013,0.0003698687,0.00037394266,0.10438305],"genre_scores_gemma":[0.9656393,0.00017498259,0.023498029,0.00007189419,0.00006651789,0.000096765514,0.00025583952,0.00006952478,0.010127206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995802,0.00009482236,0.000026880249,0.000083493505,0.00013103767,0.00008344526],"domain_scores_gemma":[0.9995728,0.00013567311,0.00007031987,0.00008284211,0.000058053545,0.00008033262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036511058,0.000327445,0.00037057663,0.0007939504,0.0009677376,0.0020156298,0.0005888792,0.00061762106,0.0038717112],"category_scores_gemma":[0.0009867507,0.00026997752,0.00055915106,0.00033366057,0.0024272487,0.0018187169,0.0014305919,0.0008059638,0.0005269749],"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.000011800101,0.000008575052,0.0002682161,0.000014453609,0.000002267476,0.00006786197,0.00021012226,0.0037655912,0.0014707817,0.992432,0.00023504495,0.0015132662],"study_design_scores_gemma":[0.000016915421,0.000026597636,0.00037934375,0.0000133290305,0.000004945381,0.000088832036,0.00023189325,0.054180387,0.0021344782,0.9383304,0.0045783585,0.00001457693],"about_ca_topic_score_codex":0.0017327839,"about_ca_topic_score_gemma":0.0014291715,"teacher_disagreement_score":0.0038717112,"about_ca_system_score_codex":0.0013547821,"about_ca_system_score_gemma":0.00040111513,"threshold_uncertainty_score":0.012952149},"labels":[],"label_agreement":null},{"id":"W2098563094","doi":"10.1111/tgis.12113","title":"Integrating <scp>GIS</scp>‐Based Geo‐Atom Theory and Voxel Automata to Simulate the Dispersal of Airborne Pollutants","year":2014,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cellular automaton; Computer science; Voxel; Automaton; Process (computing); Biological dispersal; Theoretical computer science; Algorithm; Statistical physics; Biological system; Artificial intelligence; Physics","score_opus":0.009015602181565984,"score_gpt":0.24509380994726698,"score_spread":0.236078207765701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098563094","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.33684552,0.00013649726,0.650617,0.0002591753,0.000099327364,0.00008020626,0.00025683633,0.00080446375,0.0109010525],"genre_scores_gemma":[0.92000234,0.00007307604,0.078231014,0.000031900603,0.0000084592375,0.00007870336,0.000079855745,0.00004353797,0.0014510346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999007,0.000032674714,0.000007067076,0.000014663235,0.000030309855,0.000014697802],"domain_scores_gemma":[0.99957126,0.00024281691,0.00004374906,0.000048981485,0.000069703754,0.000023538449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022812419,0.00023082626,0.00033791,0.0004213258,0.0003282264,0.0006528778,0.0006487555,0.00066569727,0.0013409805],"category_scores_gemma":[0.000981078,0.00019009097,0.00050420524,0.000457428,0.00072490145,0.00047293623,0.00059691677,0.00038497392,0.0001475364],"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.000010222977,0.000012405977,0.00077600026,0.000009403433,0.00000750915,0.000044224984,0.00002738635,0.9874402,0.0011412373,0.008516926,0.00009387597,0.0019206556],"study_design_scores_gemma":[0.0000011309395,0.0000036993704,0.000045266563,8.171154e-7,0.000001000165,0.000004655692,0.0000034247598,0.9986307,0.00020910833,0.0009505967,0.00014821414,0.0000013982431],"about_ca_topic_score_codex":0.019047625,"about_ca_topic_score_gemma":0.011018184,"teacher_disagreement_score":0.019047625,"about_ca_system_score_codex":0.0007572367,"about_ca_system_score_gemma":0.0008822919,"threshold_uncertainty_score":0.037873507},"labels":[],"label_agreement":null},{"id":"W2099650939","doi":"10.1109/glocom.2000.891242","title":"An importance sampling analysis of a sub-carrier synchronized OFDM/QAM","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Orthogonal frequency-division multiplexing; QAM; Estimator; Monte Carlo method; Computer science; Importance sampling; Sampling (signal processing); Equalization (audio); Quadrature amplitude modulation; Channel (broadcasting); Electronic engineering; Algorithm; Statistics; Telecommunications; Bit error rate; Mathematics; Engineering","score_opus":0.02840607100226317,"score_gpt":0.26884132859810556,"score_spread":0.2404352575958424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099650939","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.0432891,0.00011560874,0.9550252,0.00007307362,0.000020802083,0.000013755999,0.000009755506,0.00006782366,0.0013847874],"genre_scores_gemma":[0.9373102,0.00025189892,0.0597583,0.000050008366,0.000051342427,0.00003577695,0.00003708521,0.000050526483,0.0024550078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973744,0.000084669016,0.0000062162508,0.000032021915,0.00011063001,0.000029014212],"domain_scores_gemma":[0.99897385,0.0006846223,0.000083597464,0.0000606311,0.0001602776,0.000037033333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006383525,0.0002486956,0.000386928,0.00037689038,0.00019072948,0.00032429112,0.0003654278,0.00026333748,0.0018609556],"category_scores_gemma":[0.00235835,0.00018425008,0.00034943692,0.00018132126,0.00053449464,0.0005501851,0.0002854793,0.000476373,0.00014881066],"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.00008616507,0.000030322512,0.0016328654,0.000064093234,0.000037916696,0.00012169058,0.00007470988,0.9003813,0.0143327825,0.054338723,0.0003573032,0.028542072],"study_design_scores_gemma":[9.902473e-7,0.0000079697675,0.00015680763,0.0000011483652,0.0000025825457,0.000012539734,0.0000021337898,0.99732816,0.00085922994,0.0015031132,0.00012384904,0.0000015205565],"about_ca_topic_score_codex":0.0013086968,"about_ca_topic_score_gemma":0.0008118075,"teacher_disagreement_score":0.0018609556,"about_ca_system_score_codex":0.0005236903,"about_ca_system_score_gemma":0.00031884958,"threshold_uncertainty_score":0.0062254667},"labels":[],"label_agreement":null},{"id":"W2100027272","doi":"10.1109/isit.2009.5205825","title":"The zeta function of a periodic-finite-type shift","year":2009,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Riemann zeta function; Type (biology); Class (philosophy); Function (biology); Pure mathematics; Arithmetic zeta function; Mathematical analysis; Generating function; Computer science","score_opus":0.012286373517116157,"score_gpt":0.22980255142749426,"score_spread":0.2175161779103781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100027272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7262895,0.00059629773,0.2331721,0.0005460248,0.00024314159,0.000036451922,0.00026924306,0.0002561043,0.038591173],"genre_scores_gemma":[0.9808348,0.0003780695,0.012117559,0.00007287727,0.0001504003,0.000033346463,0.00017922245,0.00006751594,0.00616635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979883,0.000022444028,0.000011681224,0.00003932031,0.00007310248,0.00005467176],"domain_scores_gemma":[0.9994548,0.00019853398,0.00005241691,0.00005209617,0.00015853434,0.00008362256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040357077,0.00035873987,0.0004710439,0.0015343803,0.0006326185,0.0015353397,0.00043565093,0.00048715566,0.0030781548],"category_scores_gemma":[0.0023242005,0.00016860549,0.00042410727,0.00061026507,0.0013482063,0.0020931251,0.0008507469,0.0007607232,0.00075497275],"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.00008184765,0.000018381428,0.0018230436,0.000055273358,0.000009513904,0.00022841516,0.00024961182,0.0076318784,0.008518308,0.95079786,0.0014498957,0.029135982],"study_design_scores_gemma":[0.000020448124,0.000044329314,0.0011223846,0.00003857768,0.0000138085,0.0002985341,0.00015195749,0.061037906,0.006572723,0.926152,0.0045129005,0.000034416244],"about_ca_topic_score_codex":0.00048750456,"about_ca_topic_score_gemma":0.00021198983,"teacher_disagreement_score":0.0030781548,"about_ca_system_score_codex":0.0007634101,"about_ca_system_score_gemma":0.00040672155,"threshold_uncertainty_score":0.010297477},"labels":[],"label_agreement":null},{"id":"W2101822023","doi":"10.1109/cec.2009.4983368","title":"Evolved art via control of cellular automata","year":2009,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Cellular automaton; Computer science; Representation (politics); Simple (philosophy); Automaton; Fitness function; Fitness landscape; Feature (linguistics); String (physics); Function (biology); State (computer science); Artificial intelligence; Theoretical computer science; Mathematics; Machine learning; Algorithm; Biology; Evolutionary biology","score_opus":0.005945413344899192,"score_gpt":0.20873088463534867,"score_spread":0.20278547129044946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101822023","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.25911993,0.0015590144,0.6948183,0.00049280585,0.00027189613,0.000112942,0.00008701236,0.00065404724,0.042884044],"genre_scores_gemma":[0.9404773,0.00043492715,0.05228953,0.00007114044,0.000023073817,0.000073632575,0.000041890846,0.00006324768,0.0065251985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983156,0.00004536709,0.000008559717,0.00003571201,0.000060225677,0.000018605091],"domain_scores_gemma":[0.99965346,0.00017684864,0.000037291877,0.000057581918,0.000054870376,0.000020022124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030663778,0.00034625674,0.0003947011,0.00035247105,0.00035787394,0.0013261739,0.0006580841,0.0005265067,0.0021288432],"category_scores_gemma":[0.001575119,0.00020766478,0.000520653,0.00025401564,0.0009959759,0.00059609493,0.00074062345,0.00059750705,0.00017570738],"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.00004179648,0.000038506485,0.0007509772,0.000101031656,0.00005617588,0.00016062189,0.00015992353,0.8321298,0.018859379,0.10350131,0.0006567879,0.043543674],"study_design_scores_gemma":[0.000014041808,0.000027678521,0.0001460555,0.000009652994,0.000011554995,0.00003810602,0.000012439783,0.9821578,0.0033527669,0.011854123,0.0023655714,0.000010105335],"about_ca_topic_score_codex":0.0015816017,"about_ca_topic_score_gemma":0.0010279318,"teacher_disagreement_score":0.0021288432,"about_ca_system_score_codex":0.00074494985,"about_ca_system_score_gemma":0.00027285557,"threshold_uncertainty_score":0.007121682},"labels":[],"label_agreement":null},{"id":"W2104496560","doi":"10.1017/s0143385706000228","title":"Asymptotic randomization of sofic shifts by linear cellular automata","year":2006,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Combinatorics; Abelian group; Mathematics","score_opus":0.0025462481221476974,"score_gpt":0.18830439203057053,"score_spread":0.18575814390842282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104496560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7951372,0.00025448125,0.19107525,0.0004807273,0.00008476662,0.00006952865,0.00019292379,0.00071454386,0.011990575],"genre_scores_gemma":[0.990072,0.000050017978,0.00704666,0.00006394201,0.00002906872,0.000068502224,0.000093107585,0.000040165898,0.0025365725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856216,0.00044026572,0.00007967557,0.00034633826,0.00027822852,0.00029344947],"domain_scores_gemma":[0.994493,0.0026898428,0.00081171276,0.0007452891,0.00064665807,0.0006134098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012931377,0.0003718834,0.0007974363,0.0009922921,0.0010111463,0.0016813715,0.00090089726,0.0008858551,0.004305874],"category_scores_gemma":[0.008789261,0.0004686523,0.00087746285,0.00036470636,0.0022046168,0.0013412475,0.0013005461,0.0009043968,0.0005267376],"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.0006575108,0.00013917912,0.00804273,0.000116253344,0.000098604054,0.00042796455,0.00046288298,0.14943343,0.023060516,0.7988979,0.0017242908,0.016938768],"study_design_scores_gemma":[0.00007389831,0.00015620986,0.001387624,0.000026295533,0.000032730095,0.00015786698,0.00012199038,0.74225205,0.005664265,0.24851523,0.0015597115,0.000052172174],"about_ca_topic_score_codex":0.0016225376,"about_ca_topic_score_gemma":0.0017516136,"teacher_disagreement_score":0.004305874,"about_ca_system_score_codex":0.0017734439,"about_ca_system_score_gemma":0.0008736261,"threshold_uncertainty_score":0.014404595},"labels":[],"label_agreement":null},{"id":"W2104553574","doi":"10.1109/tip.2006.873472","title":"Pattern generation using likelihood inference for cellular automata","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cellular automaton; Continuous spatial automaton; Stochastic cellular automaton; Inference; Algorithm; Binary number; Automaton; Computer science; Mathematics; Theoretical computer science; Quantum finite automata; Automata theory; Artificial intelligence","score_opus":0.024947018607504458,"score_gpt":0.2748644632190721,"score_spread":0.24991744461156765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104553574","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.011691673,0.0001708143,0.9870544,0.00018115014,0.000014367411,0.00002373722,0.0000684413,0.00033347664,0.0004618879],"genre_scores_gemma":[0.63090616,0.00034829267,0.3652328,0.0001640244,0.00009685039,0.00027146126,0.0005831431,0.00024640936,0.0021506788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989598,0.00045510585,0.000054070828,0.00023176058,0.00023573602,0.000063501364],"domain_scores_gemma":[0.9861655,0.011856391,0.00061039324,0.00062003516,0.00057484565,0.0001728374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023229427,0.0005196522,0.001144245,0.0015200438,0.0006496422,0.0016335042,0.0020766528,0.0013467906,0.002057687],"category_scores_gemma":[0.020464558,0.0007510555,0.0010319435,0.0012001215,0.0013430549,0.0020024392,0.0015505643,0.00186159,0.00048478163],"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.000093967225,0.000032523018,0.0025209126,0.000089337234,0.000064177926,0.00018476503,0.000114972165,0.8930881,0.0016130692,0.051947072,0.0008374616,0.049413584],"study_design_scores_gemma":[0.0000054820284,0.0000026944726,0.00006530432,0.0000029218113,0.0000019279387,0.000010993673,0.0000030059127,0.9783625,0.00017522402,0.021250622,0.000115261544,0.00000403208],"about_ca_topic_score_codex":0.004424438,"about_ca_topic_score_gemma":0.0041859215,"teacher_disagreement_score":0.004424438,"about_ca_system_score_codex":0.0013802022,"about_ca_system_score_gemma":0.00077875325,"threshold_uncertainty_score":0.012285054},"labels":[],"label_agreement":null},{"id":"W2105454564","doi":"10.46298/dmtcs.388","title":"On the tileability of polygons with colored dominoes","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Colored; Mathematics; Combinatorics; Rectangle; Polygon (computer graphics); Domino; Simple (philosophy); Set (abstract data type); Frame (networking); Computer science; Geometry","score_opus":0.009981600331774546,"score_gpt":0.24900182296748405,"score_spread":0.2390202226357095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105454564","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.45288187,0.0007786433,0.5239401,0.0006019586,0.00005132223,0.00023233282,0.0005322784,0.0007081076,0.020273428],"genre_scores_gemma":[0.8492777,0.000569386,0.14466666,0.00013191353,0.000060034534,0.00020423337,0.0009900122,0.00020412859,0.0038958814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984946,0.0003844236,0.0001007528,0.00033767745,0.0002901903,0.00039237147],"domain_scores_gemma":[0.9878335,0.009205267,0.00091577944,0.0011156407,0.0005283561,0.00040143137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013444057,0.00067464745,0.0009621424,0.0010297097,0.0011124404,0.0032081082,0.0014291417,0.0010346969,0.0043126913],"category_scores_gemma":[0.015575259,0.0005769597,0.0015738066,0.0014946643,0.0021887368,0.0036757414,0.0019023853,0.00087721244,0.00043427042],"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.0009038887,0.00014259052,0.008313957,0.0004939529,0.00012587613,0.0003913506,0.00068359624,0.6611791,0.014109444,0.24513663,0.0035084358,0.065011136],"study_design_scores_gemma":[0.00008180567,0.000118800424,0.0007624451,0.000050168594,0.00004895286,0.00020924963,0.00018139675,0.819951,0.005335138,0.17036486,0.00287427,0.00002194008],"about_ca_topic_score_codex":0.0033197762,"about_ca_topic_score_gemma":0.0018868983,"teacher_disagreement_score":0.0043126913,"about_ca_system_score_codex":0.0017430128,"about_ca_system_score_gemma":0.0009487845,"threshold_uncertainty_score":0.0144274235},"labels":[],"label_agreement":null},{"id":"W2105465869","doi":"10.1145/355483.355488","title":"A lower bound on the average-case complexity of shellsort","year":2000,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Distribution (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.04482802075209594,"score_gpt":0.2642642397316009,"score_spread":0.21943621897950497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105465869","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.25110924,0.0029822113,0.62858325,0.008169143,0.0007443528,0.00027794958,0.002112726,0.006279151,0.09974202],"genre_scores_gemma":[0.8455578,0.0018465816,0.12788248,0.0018320602,0.0011126072,0.00058360613,0.0019691281,0.0032708007,0.015944874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99040514,0.0014342817,0.00059054646,0.002132989,0.0029549454,0.002481996],"domain_scores_gemma":[0.9576651,0.02611803,0.0021700964,0.009269569,0.0023212763,0.0024559593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044984673,0.0025231794,0.0025919606,0.0023396604,0.0027561528,0.008153888,0.007047123,0.0032918812,0.027055608],"category_scores_gemma":[0.04173655,0.0013746702,0.0035243863,0.0032179186,0.0039651017,0.019886801,0.007335639,0.007116184,0.0041340683],"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.002799406,0.0009883357,0.00911434,0.0013986388,0.0004550608,0.000874507,0.0009032406,0.26292017,0.057152215,0.4918139,0.039258018,0.13232213],"study_design_scores_gemma":[0.00010288273,0.00023638252,0.0016393276,0.00012546233,0.0001744946,0.000883203,0.00014311697,0.65552735,0.01588533,0.3163457,0.008831108,0.00010560152],"about_ca_topic_score_codex":0.0030157506,"about_ca_topic_score_gemma":0.0038068064,"teacher_disagreement_score":0.027055608,"about_ca_system_score_codex":0.00551085,"about_ca_system_score_gemma":0.0038493157,"threshold_uncertainty_score":0.09051007},"labels":[],"label_agreement":null},{"id":"W2109231686","doi":"10.1109/iscas.1989.100615","title":"Homogeneous VLSI for 2-D digital signal processing","year":2003,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Very-large-scale integration; CMOS; Throughput; Computer science; Homogeneous; Signal processing; Digital signal processing; Computer architecture; Systolic array; Computer hardware; Parallel computing; Computational science; Electronic engineering; Embedded system; Engineering; Telecommunications; Mathematics","score_opus":0.013997822771404699,"score_gpt":0.23250874740798994,"score_spread":0.21851092463658522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109231686","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.00729532,0.0027391273,0.94378763,0.0003771483,0.00028618035,0.000083180355,0.00016822519,0.0015226469,0.04374058],"genre_scores_gemma":[0.27917418,0.0053624464,0.6464548,0.00087994663,0.00042579146,0.00035936057,0.0005898824,0.00026154937,0.06649199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998627,0.000028638673,0.00000780363,0.000021534372,0.000061830215,0.000017577971],"domain_scores_gemma":[0.9999068,0.000029211717,0.0000087747385,0.00002647574,0.000021345106,0.0000073792457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014170751,0.0003215714,0.000210909,0.0003287817,0.00025210716,0.0007983601,0.00041518456,0.0002871775,0.010368592],"category_scores_gemma":[0.0003653388,0.00015462442,0.00026791237,0.00048284561,0.0003357508,0.00072246586,0.0004346991,0.00037874636,0.0022140688],"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.00006715562,0.00003322428,0.0003339097,0.0003006437,0.000030345253,0.00016004074,0.000110348985,0.02983039,0.046279587,0.7206287,0.02119892,0.18102668],"study_design_scores_gemma":[0.00006403464,0.0003452452,0.0008136295,0.00008414507,0.00005514753,0.00069438847,0.00006601674,0.25970626,0.04034786,0.21062143,0.48716483,0.000037024336],"about_ca_topic_score_codex":0.00060754904,"about_ca_topic_score_gemma":0.001099541,"teacher_disagreement_score":0.010368592,"about_ca_system_score_codex":0.0005403465,"about_ca_system_score_gemma":0.00037407887,"threshold_uncertainty_score":0.034686387},"labels":[],"label_agreement":null},{"id":"W2109313589","doi":"10.1109/ccece.1997.614794","title":"Metric based node synchronization of the Viterbi decoder","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Technical University of Nova Scotia","funders":"","keywords":"Viterbi decoder; Computer science; Viterbi algorithm; Convolutional code; Code word; Algorithm; Soft-decision decoder; Synchronization (alternating current); Node (physics); Decoding methods; Theoretical computer science; Computer network","score_opus":0.012965293428807959,"score_gpt":0.20724452745371033,"score_spread":0.19427923402490238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109313589","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.075259775,0.00016880188,0.92040104,0.00010749088,0.00004947767,0.00005202894,0.000024911795,0.0003589646,0.0035774554],"genre_scores_gemma":[0.8597281,0.00010865596,0.13777237,0.000034149707,0.000016339643,0.0000697453,0.000042049985,0.000045431592,0.0021831957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944276,0.00022406368,0.00002583165,0.00008719986,0.00017372388,0.00004645057],"domain_scores_gemma":[0.99901426,0.00052990613,0.00011154802,0.00013433232,0.00017765569,0.000032243574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010533977,0.0003277605,0.00035217783,0.00037686183,0.00030875194,0.0005101349,0.00080311875,0.0005089697,0.0008330445],"category_scores_gemma":[0.004460276,0.0002342229,0.00015882435,0.00038300906,0.0006001999,0.0007244453,0.0005451522,0.0004871847,0.0003466445],"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.00030738648,0.000044115626,0.0025288695,0.00006362569,0.000035044046,0.00013281692,0.0002697089,0.69499344,0.045560095,0.15857926,0.0007922534,0.096693344],"study_design_scores_gemma":[0.000016695016,0.00010367698,0.00022023315,0.000007392207,0.00000927738,0.000044281096,0.000012893836,0.9747201,0.015256371,0.008404919,0.0011889664,0.000015107263],"about_ca_topic_score_codex":0.0019445237,"about_ca_topic_score_gemma":0.0020610401,"teacher_disagreement_score":0.0019445237,"about_ca_system_score_codex":0.00086313934,"about_ca_system_score_gemma":0.0010001332,"threshold_uncertainty_score":0.006262541},"labels":[],"label_agreement":null},{"id":"W2111095022","doi":"10.1109/cec.1999.781955","title":"An evolutionary approach to multiagent heap formation","year":2003,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heap (data structure); Computer science; Cellular automaton; Automaton; Distributed computing; Robot; Mobile robot; Theoretical computer science; Task (project management); Artificial intelligence; Programming language; Engineering","score_opus":0.021150468325663033,"score_gpt":0.2485615586318899,"score_spread":0.22741109030622686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111095022","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.008871671,0.00059425866,0.97593653,0.00041327058,0.00006613624,0.000042349602,0.000016886299,0.00009608324,0.013962801],"genre_scores_gemma":[0.3668597,0.0012561047,0.6098461,0.00023945712,0.000091916685,0.00034000614,0.0000815651,0.000092314105,0.021192836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975187,0.00008643717,0.00001118315,0.000039108967,0.00007979522,0.00003147842],"domain_scores_gemma":[0.9997609,0.00009080927,0.000026013075,0.000032506854,0.000057119792,0.00003266996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041767658,0.00035977556,0.00044506244,0.0005398083,0.000800405,0.0010282134,0.0014793708,0.0010903676,0.0022503007],"category_scores_gemma":[0.0012706576,0.0002967007,0.00056486577,0.0005827692,0.0009947276,0.0009023577,0.0011555919,0.0010306549,0.00032803995],"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.000018784396,0.000046084162,0.0005554336,0.00010200445,0.000059193502,0.0003152558,0.00036663286,0.42679828,0.0039239046,0.48625362,0.0017411531,0.07981963],"study_design_scores_gemma":[0.000018771469,0.0000438471,0.00025224563,0.0000320528,0.000024054747,0.00019032166,0.00009413523,0.77813154,0.0011688557,0.19889948,0.021122802,0.000021903204],"about_ca_topic_score_codex":0.0016915174,"about_ca_topic_score_gemma":0.0019186182,"teacher_disagreement_score":0.0022503007,"about_ca_system_score_codex":0.00072442315,"about_ca_system_score_gemma":0.00048301567,"threshold_uncertainty_score":0.0075280666},"labels":[],"label_agreement":null},{"id":"W2111174221","doi":"10.1109/icc.1994.368982","title":"ATM framing using CRC byte","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Header; Framing (construction); Byte; Computer science; Sliding window protocol; Window (computing); Operating system; Computer network; Engineering","score_opus":0.04381640422643902,"score_gpt":0.24278533082760104,"score_spread":0.19896892660116203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111174221","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.096470095,0.0014823474,0.85772026,0.00038432685,0.0009263668,0.00021176164,0.00029569888,0.00809516,0.034413964],"genre_scores_gemma":[0.7124714,0.0007845182,0.2693314,0.00029725314,0.00034230776,0.00011922878,0.00031521235,0.00033256106,0.016006107],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949265,0.000070943264,0.000036766185,0.00011036311,0.0002227373,0.000066521905],"domain_scores_gemma":[0.9988728,0.00033685952,0.00015044272,0.00029106313,0.00030860063,0.000040264415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046445953,0.00064189953,0.00030628455,0.0011709293,0.0005796982,0.001127487,0.00082729757,0.00052651373,0.0063723987],"category_scores_gemma":[0.0020610923,0.00021942238,0.00021927828,0.00056152826,0.0005700804,0.0015800236,0.0006063398,0.00055962475,0.0017463621],"study_design_candidate":"not_applicable","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.0006940643,0.000094784504,0.0018360749,0.00033947913,0.000044209562,0.0005044095,0.000534602,0.011351212,0.24777187,0.11919814,0.012036262,0.60559493],"study_design_scores_gemma":[0.00009993902,0.0007052185,0.0012929622,0.00012849814,0.00014410184,0.0009225971,0.00019016383,0.118054,0.7298578,0.026231013,0.12222835,0.00014532336],"about_ca_topic_score_codex":0.0006373923,"about_ca_topic_score_gemma":0.00084404217,"teacher_disagreement_score":0.0063723987,"about_ca_system_score_codex":0.0004939015,"about_ca_system_score_gemma":0.0004605034,"threshold_uncertainty_score":0.02131778},"labels":[],"label_agreement":null},{"id":"W2112503782","doi":"10.1007/s11856-012-0052-x","title":"Intrinsic ergodicity beyond specification: β-shifts, S-gap shifts, and their factors","year":2012,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":77,"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 Toronto","funders":"","keywords":"Novelty; Property (philosophy); Ergodicity; Space (punctuation); Symbolic dynamics; Factor (programming language); Algebra over a field","score_opus":0.038850489760256804,"score_gpt":0.25335145140070037,"score_spread":0.21450096164044358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112503782","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65144175,0.0015437057,0.2763584,0.0032853542,0.000245265,0.00007906385,0.00027111336,0.0005251784,0.066250086],"genre_scores_gemma":[0.981372,0.00047597883,0.009953609,0.00021089995,0.00023421696,0.00006346167,0.00009610457,0.00015555428,0.007438277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862695,0.00028492374,0.000085500775,0.00036836992,0.00028116957,0.00035311325],"domain_scores_gemma":[0.9899857,0.004922034,0.0010306347,0.0014824688,0.0011014242,0.001477709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023697715,0.0006357718,0.0010426864,0.0016947194,0.0018267054,0.0031303521,0.0008942824,0.0015654952,0.0072405646],"category_scores_gemma":[0.014430861,0.00054834306,0.0014944951,0.000992772,0.0057179313,0.0061565037,0.0034380779,0.0031457937,0.0007263546],"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.000046346027,0.000019792928,0.00053816254,0.000019212213,0.0000067764468,0.000077444274,0.00023993553,0.0018031585,0.00073828,0.99212146,0.00044584463,0.003943609],"study_design_scores_gemma":[0.00001838216,0.0000272015,0.000374021,0.000012536668,0.000009454793,0.000083151775,0.000113728296,0.012077508,0.0006510938,0.98553085,0.0010808082,0.000021207474],"about_ca_topic_score_codex":0.0019236114,"about_ca_topic_score_gemma":0.0009955197,"teacher_disagreement_score":0.0072405646,"about_ca_system_score_codex":0.0016640067,"about_ca_system_score_gemma":0.0015434178,"threshold_uncertainty_score":0.024222076},"labels":[],"label_agreement":null},{"id":"W2112775448","doi":"10.1109/iwsoc.2004.8","title":"A framework for implementing reusable digital signal processing modules","year":2004,"lang":"en","type":"article","venue":"IEEE International Workshop on System-on-Chip for Real-Time Applications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Digital signal processing; Signal processing; Digital signal; Estimator; SIGNAL (programming language); Computer architecture; Architecture; Embedded system; Multidimensional signal processing; Computer hardware; Programming language","score_opus":0.031991094468034866,"score_gpt":0.31780150315199335,"score_spread":0.28581040868395846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112775448","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.0012747265,0.00015157997,0.9929934,0.000055384793,0.000029429062,0.00012512224,0.00005899983,0.002849932,0.002461431],"genre_scores_gemma":[0.0378427,0.00050552655,0.9556534,0.00012580863,0.000045268698,0.0006604524,0.00042070163,0.0004690183,0.00427711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871886,0.0001987091,0.00016094102,0.00023351038,0.0004977193,0.00019026619],"domain_scores_gemma":[0.99927455,0.00018750642,0.000057508463,0.00022715298,0.00017753546,0.000075782205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001599727,0.0013128433,0.00087617495,0.0012181642,0.00094021036,0.003155606,0.003625816,0.0018951143,0.006410499],"category_scores_gemma":[0.0021284726,0.0009019885,0.0018151143,0.0008113508,0.001504763,0.0026176001,0.0018238358,0.002541169,0.0034526456],"study_design_candidate":"not_applicable","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.00013149156,0.00017212685,0.0005158261,0.0008571176,0.00011291649,0.00075491436,0.00048458143,0.06258204,0.051235087,0.68295574,0.0069999173,0.19319825],"study_design_scores_gemma":[0.00017402753,0.00041103724,0.00038212555,0.00046630538,0.00025324308,0.0015203746,0.00013119297,0.3211373,0.074555755,0.22645834,0.37432995,0.00018036042],"about_ca_topic_score_codex":0.001903733,"about_ca_topic_score_gemma":0.0014358412,"teacher_disagreement_score":0.006410499,"about_ca_system_score_codex":0.0008681423,"about_ca_system_score_gemma":0.0015883059,"threshold_uncertainty_score":0.021445274},"labels":[],"label_agreement":null},{"id":"W2112783293","doi":"10.1090/s1088-4165-07-00319-6","title":"Computation in Coxeter groups II. Constructing minimal roots","year":2008,"lang":"en","type":"article","venue":"Representation Theory of the American Mathematical Society","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Coxeter group; Mathematics; Coxeter complex; Multiplication (music); Coxeter element; Reflection (computer programming); Computation; Artin group; Construct (python library); Table (database); Longest element of a Coxeter group; Arithmetic; Root (linguistics); Basis (linear algebra); Algebra over a field; Combinatorics; Algorithm; Pure mathematics; Computer science; Geometry; Data mining; Linguistics","score_opus":0.0245632180426783,"score_gpt":0.2841952648127224,"score_spread":0.2596320467700441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112783293","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.18471368,0.0005316112,0.75467515,0.00087138347,0.00017695862,0.00018469687,0.00035506213,0.0015239418,0.056967575],"genre_scores_gemma":[0.6679334,0.00041796823,0.30938834,0.00016071966,0.00009664266,0.00018295953,0.0005031644,0.0004467378,0.020870054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995265,0.000093408074,0.000031328396,0.00012463269,0.00012448087,0.00009958878],"domain_scores_gemma":[0.99960214,0.00019867784,0.000032246488,0.000089685556,0.000046554662,0.00003066968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057805097,0.00046753074,0.0006299786,0.0007154676,0.0009249428,0.0020986153,0.0011374549,0.00070474076,0.0180346],"category_scores_gemma":[0.0027511877,0.00035966374,0.0007059665,0.0006883249,0.0015253621,0.004012865,0.0020790603,0.0014757393,0.0032989227],"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.0001118412,0.000037458358,0.0006700583,0.00018180248,0.000013171799,0.00013118453,0.00065355486,0.008792719,0.0061844448,0.9165777,0.0027017025,0.0639443],"study_design_scores_gemma":[0.000031601052,0.00005247612,0.0001605241,0.000034952598,0.000010385393,0.00009572542,0.00028278888,0.01760472,0.009502502,0.9599037,0.012299028,0.000021525439],"about_ca_topic_score_codex":0.00048792173,"about_ca_topic_score_gemma":0.0005657384,"teacher_disagreement_score":0.0180346,"about_ca_system_score_codex":0.000771781,"about_ca_system_score_gemma":0.0006100859,"threshold_uncertainty_score":0.06033176},"labels":[],"label_agreement":null},{"id":"W2115774893","doi":"10.13001/1081-3810.1180","title":"Inertially arbitrary nonzero patterns of order 4","year":2007,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University College; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Order (exchange); Equivalence (formal languages); Sign (mathematics); Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.006131947615819681,"score_gpt":0.239668162957194,"score_spread":0.23353621534137434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115774893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.864788,0.00014088888,0.07339715,0.00019417204,0.00014385248,0.00005530516,0.00020654945,0.0003618212,0.06071228],"genre_scores_gemma":[0.97790694,0.00009680986,0.01121451,0.000038106664,0.000029184392,0.000027769893,0.00022518457,0.000059248254,0.010402257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995982,0.000051224775,0.000029817063,0.000059922906,0.00011032163,0.00015055943],"domain_scores_gemma":[0.99934715,0.000097691605,0.00017131158,0.00017319183,0.000134862,0.000075732074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020067746,0.00038832347,0.00026598672,0.0006333605,0.00074635574,0.0010653508,0.0003982389,0.0002855234,0.006986893],"category_scores_gemma":[0.0011643459,0.00018859432,0.00030703182,0.0005141069,0.0014666491,0.0011157251,0.0008701767,0.00053800043,0.0006791441],"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.00030218915,0.000084256826,0.006847243,0.00010062491,0.000017352242,0.0007630624,0.000737226,0.004212078,0.0920287,0.84773403,0.0028885733,0.04428464],"study_design_scores_gemma":[0.00006976105,0.00040405552,0.007721171,0.00005357357,0.00005120618,0.0014845184,0.0012257636,0.045644064,0.10654718,0.8059577,0.030714462,0.0001265603],"about_ca_topic_score_codex":0.0005038775,"about_ca_topic_score_gemma":0.0011819341,"teacher_disagreement_score":0.006986893,"about_ca_system_score_codex":0.0003663916,"about_ca_system_score_gemma":0.00045576817,"threshold_uncertainty_score":0.023373485},"labels":[],"label_agreement":null},{"id":"W2115814444","doi":"10.1017/s0143385704000288","title":"Limit measures for affine cellular automata II","year":2004,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Abelian group; Combinatorics; Mathematics; Endomorphism; Group (periodic table); Prime (order theory); Monoid; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.009014872145899952,"score_gpt":0.2197660738144691,"score_spread":0.21075120166856914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115814444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48570505,0.004068963,0.4518644,0.0019541923,0.00023613704,0.00016410492,0.0008360145,0.00066653144,0.05450466],"genre_scores_gemma":[0.94973433,0.0010948718,0.032776363,0.00022673153,0.00022687255,0.0003693151,0.0004469107,0.0000945273,0.015030124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896455,0.00021846205,0.00009905931,0.00027551744,0.00028547467,0.00015689169],"domain_scores_gemma":[0.99486357,0.0025802567,0.0006944282,0.00032716113,0.0008722883,0.0006623103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014003842,0.00064808753,0.00091715704,0.0024480575,0.0018965588,0.0037935274,0.0010242737,0.001190846,0.0053893146],"category_scores_gemma":[0.008325355,0.0005270065,0.0012618371,0.000816419,0.0025445048,0.003335125,0.0020242657,0.0014872482,0.0006801977],"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.000014698146,0.000015679645,0.00066278205,0.000037287857,0.000013903641,0.00007954901,0.0001960338,0.0048474316,0.0012448408,0.989881,0.0003462577,0.0026604552],"study_design_scores_gemma":[0.000020814306,0.000053102347,0.0008098682,0.000044459655,0.000019044348,0.00021902204,0.0001800271,0.12975642,0.001472378,0.8641224,0.0032723243,0.000030285617],"about_ca_topic_score_codex":0.0025887424,"about_ca_topic_score_gemma":0.0016525642,"teacher_disagreement_score":0.0053893146,"about_ca_system_score_codex":0.0026886105,"about_ca_system_score_gemma":0.0009573272,"threshold_uncertainty_score":0.019507349},"labels":[],"label_agreement":null},{"id":"W2115816066","doi":"10.1016/s0166-218x(00)00388-7","title":"Optimal irreversible dynamos in chordal rings","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Mathematics; Chordal graph; Constructive; Upper and lower bounds; Dynamo; Combinatorics; Simple (philosophy); Class (philosophy); Discrete mathematics; Pure mathematics; Graph; Mathematical analysis; Computer science; Physics; Magnetic field","score_opus":0.01130383720653694,"score_gpt":0.23722613059077993,"score_spread":0.225922293384243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115816066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7269457,0.0023822754,0.1849272,0.0026443044,0.00045767677,0.00013408948,0.00063765096,0.00040816682,0.081462994],"genre_scores_gemma":[0.98452735,0.00065703626,0.0070702047,0.0000854203,0.00006248505,0.000045227196,0.000086300126,0.00005688705,0.0074091298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963284,0.000098274104,0.0000313688,0.0000654914,0.00007027588,0.0001017218],"domain_scores_gemma":[0.9979753,0.0010709298,0.00020711069,0.00024271538,0.00018668256,0.0003172983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008600254,0.0003800372,0.0009659523,0.0006825611,0.0011983385,0.0022840493,0.0010953774,0.00087314175,0.006668669],"category_scores_gemma":[0.0043470995,0.00042174474,0.0005739995,0.0005390042,0.0019165785,0.0032252162,0.0016182238,0.001317863,0.00031111788],"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.000095357296,0.0000314101,0.00015439671,0.00007460884,0.000010653718,0.00003517456,0.000050723975,0.033085667,0.0014494613,0.9596847,0.0008620588,0.004465728],"study_design_scores_gemma":[0.00004111266,0.000034554654,0.00016729624,0.00001677051,0.000010973433,0.000037681573,0.00008424233,0.12405516,0.0011138095,0.8729271,0.0014962117,0.000015126076],"about_ca_topic_score_codex":0.0011313467,"about_ca_topic_score_gemma":0.0017714512,"teacher_disagreement_score":0.006668669,"about_ca_system_score_codex":0.0021292365,"about_ca_system_score_gemma":0.0011740213,"threshold_uncertainty_score":0.022308886},"labels":[],"label_agreement":null},{"id":"W2116501055","doi":"10.1103/physreve.66.066106","title":"Nondeterministic density classification with diffusive probabilistic cellular automata","year":2002,"lang":"en","type":"article","venue":"Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Nondeterministic algorithm; Cellular automaton; Probabilistic logic; Stochastic cellular automaton; String (physics); Probabilistic automaton; Binary number; Mathematics; Probability density function; Discrete mathematics; Combinatorics; Computer science; Algorithm; Statistics; Arithmetic","score_opus":0.01702914256608409,"score_gpt":0.2791472115642058,"score_spread":0.26211806899812173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116501055","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.09034255,0.00019886717,0.9032968,0.00046728525,0.00009645833,0.00006939522,0.00013706225,0.00077715353,0.004614347],"genre_scores_gemma":[0.8178132,0.00015906559,0.17880593,0.00011341288,0.00005412259,0.00017449589,0.00015166713,0.00006951977,0.002658547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984901,0.0004704132,0.0001326326,0.00032312036,0.0004346302,0.0001492216],"domain_scores_gemma":[0.99509335,0.0026236658,0.00043103355,0.0009748245,0.00064272585,0.00023442421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012932627,0.00052871293,0.0009421473,0.00085583417,0.0011700741,0.0024209092,0.0019176835,0.0015432135,0.001342911],"category_scores_gemma":[0.008676208,0.0005537888,0.001150443,0.0007300107,0.0018614305,0.0024138282,0.0017745536,0.001410182,0.0003347174],"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.00014103488,0.00008793543,0.0032990149,0.000060541435,0.000038183294,0.00021650804,0.00026661297,0.55610025,0.005993663,0.40129364,0.0009987528,0.031503793],"study_design_scores_gemma":[0.0000067926176,0.000007445192,0.00007627076,0.000002351295,0.0000046027913,0.000022271734,0.000005005602,0.9573891,0.0009367611,0.041059133,0.0004805818,0.00000966852],"about_ca_topic_score_codex":0.0056626843,"about_ca_topic_score_gemma":0.003343196,"teacher_disagreement_score":0.0056626843,"about_ca_system_score_codex":0.0019125391,"about_ca_system_score_gemma":0.0012198251,"threshold_uncertainty_score":0.013876498},"labels":[],"label_agreement":null},{"id":"W2116802570","doi":"10.1109/ccece.1998.682762","title":"Characterizing behaviour of birth/death processes using fractal measures","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Hausdorff dimension; Fractal; Fractal dimension; Cellular automaton; Entropy (arrow of time); Mathematics; Automaton; Dimension (graph theory); Fractal dimension on networks; Fractal analysis; Statistical physics; Theoretical computer science; Computer science; Algorithm; Pure mathematics; Mathematical analysis; Physics","score_opus":0.05873960799223538,"score_gpt":0.2607834637644074,"score_spread":0.20204385577217204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116802570","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71610713,0.0008360191,0.27957305,0.00015764793,0.000024306431,0.000058524143,0.00015378556,0.00022915138,0.0028603987],"genre_scores_gemma":[0.97063893,0.00025208286,0.028699521,0.000016400505,0.000014481513,0.000029315126,0.00010021724,0.000013013024,0.00023602486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999708,0.00006384738,0.0000349378,0.000059130154,0.000100888996,0.000033102046],"domain_scores_gemma":[0.99683917,0.0018388653,0.0007089988,0.00028233224,0.00023897467,0.00009171145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078959577,0.00027271098,0.00035250935,0.0016370533,0.00031420126,0.0007650878,0.00029011216,0.00037522765,0.00034970537],"category_scores_gemma":[0.005037528,0.0001792454,0.00028915645,0.0005728957,0.0008415707,0.0011894515,0.00035375883,0.0003703144,0.00010407787],"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.00039469023,0.00017992826,0.06521709,0.00065720384,0.00024827046,0.0007456458,0.0020872592,0.40479952,0.26751742,0.135401,0.00079809845,0.12195384],"study_design_scores_gemma":[0.000022210725,0.00015468108,0.032068945,0.000043763444,0.000041924017,0.00056908955,0.00021576569,0.843294,0.033595443,0.0872845,0.0026258358,0.000083920706],"about_ca_topic_score_codex":0.00055237045,"about_ca_topic_score_gemma":0.0003681742,"teacher_disagreement_score":0.0016370533,"about_ca_system_score_codex":0.00045072957,"about_ca_system_score_gemma":0.00020180496,"threshold_uncertainty_score":0.004175842},"labels":[],"label_agreement":null},{"id":"W2116825378","doi":"10.1109/phycmp.1994.363677","title":"The complexity and entropy of Turing machines","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Turing machine; Universal Turing machine; Time hierarchy theorem; Computer science; Theoretical computer science; Entropy (arrow of time); Turing; Automaton; Cellular automaton; Dynamical systems theory; Symbolic dynamics; Computation; Algorithm; Mathematics; Pure mathematics; Programming language","score_opus":0.03382134274789048,"score_gpt":0.2311019121613642,"score_spread":0.19728056941347372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116825378","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.3181011,0.016775304,0.5452156,0.007132729,0.00075748103,0.00010286397,0.0011036883,0.0004778656,0.11033339],"genre_scores_gemma":[0.9670693,0.0027066327,0.025299769,0.00017502678,0.00055555825,0.00007512468,0.00025708973,0.000059999,0.0038014336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910873,0.00029709912,0.000049593313,0.00015300252,0.00031037116,0.00008125809],"domain_scores_gemma":[0.99383825,0.0046703536,0.00056643365,0.0005164748,0.00028955002,0.00011895864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007163597,0.0004292132,0.00064529397,0.00219853,0.00071729213,0.0021785009,0.0005322006,0.0007194212,0.002930076],"category_scores_gemma":[0.009075813,0.00031358298,0.00062776037,0.0012153451,0.0036263773,0.004224742,0.0011286916,0.0010051013,0.00032138263],"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.000030337986,0.000011644304,0.0015964722,0.00013252578,0.00004201782,0.000057129295,0.00014094335,0.041519307,0.0014364837,0.9381781,0.0012922701,0.01556271],"study_design_scores_gemma":[0.000003134979,0.000017162636,0.0013642445,0.000022020311,0.000007938296,0.00008494959,0.000031501153,0.061739374,0.00077469705,0.9334402,0.002495151,0.000019673591],"about_ca_topic_score_codex":0.00047935094,"about_ca_topic_score_gemma":0.00040933245,"teacher_disagreement_score":0.002930076,"about_ca_system_score_codex":0.0013474713,"about_ca_system_score_gemma":0.0004858282,"threshold_uncertainty_score":0.009802103},"labels":[],"label_agreement":null},{"id":"W2117673653","doi":"10.1109/tit.2010.2040942","title":"Improved Lower Bounds on Capacities of Symmetric 2D Constraints Using Rayleigh Quotients","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Generalization; Quotient; Mathematics; Upper and lower bounds; Constraint (computer-aided design); Emphasis (telecommunications); Combinatorics; Applied mathematics; Discrete mathematics; Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.00975577503316551,"score_gpt":0.22282044891041353,"score_spread":0.213064673877248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117673653","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.028088393,0.0022586312,0.93036747,0.000663821,0.000277923,0.000119691875,0.00078913436,0.00045055142,0.036984365],"genre_scores_gemma":[0.53919125,0.0032202534,0.43521294,0.00051456504,0.0006373813,0.0006894068,0.0017458394,0.0012406223,0.017547749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690384,0.0009892083,0.0001886609,0.0003371041,0.0011283181,0.00045282525],"domain_scores_gemma":[0.98673624,0.009281164,0.0004892477,0.0014312052,0.0016347433,0.0004273971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003595319,0.0025565883,0.0018409936,0.004250216,0.00089633185,0.0038636278,0.003000629,0.0014892381,0.015644927],"category_scores_gemma":[0.02090256,0.0009150447,0.0018621827,0.0035982444,0.0028764887,0.006547501,0.0036804476,0.004463063,0.0029653555],"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.00015882235,0.00008418958,0.0006237449,0.00044141395,0.0000713811,0.00014869297,0.00021151015,0.51835173,0.004026173,0.40265748,0.009353703,0.063871205],"study_design_scores_gemma":[0.000014515537,0.00003753897,0.00024432447,0.0000987808,0.000015372809,0.00005720741,0.00004264637,0.8086211,0.0035014076,0.18329965,0.004017719,0.00004978084],"about_ca_topic_score_codex":0.0036217163,"about_ca_topic_score_gemma":0.0045559667,"teacher_disagreement_score":0.015644927,"about_ca_system_score_codex":0.0030693172,"about_ca_system_score_gemma":0.0014981355,"threshold_uncertainty_score":0.052337527},"labels":[],"label_agreement":null},{"id":"W2119193554","doi":"10.1109/glsv.1991.143967","title":"Designing VLSI systolic arrays with complex processing elements","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Systolic array; Computer science; Very-large-scale integration; Representation (politics); Simple (philosophy); Throughput; Parallel computing; Theoretical computer science; Algorithm; Computer engineering; Embedded system; Wireless","score_opus":0.04533480704908061,"score_gpt":0.2456942710382007,"score_spread":0.2003594639891201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119193554","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.019935215,0.00023705716,0.9752636,0.00008515083,0.00005347245,0.00004543513,0.000037713162,0.0006548867,0.003687578],"genre_scores_gemma":[0.1849326,0.00043072473,0.8103405,0.0001132139,0.000061731334,0.00015396679,0.00012346191,0.00007919215,0.003764593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998247,0.000042401578,0.000015877287,0.000028044822,0.000066441404,0.000022668848],"domain_scores_gemma":[0.99974006,0.00009165576,0.000037854257,0.000041084488,0.000075336764,0.000014026031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033767844,0.00033726534,0.00029062098,0.0002851542,0.0002430034,0.0006488783,0.00071285624,0.00033597462,0.0016746065],"category_scores_gemma":[0.00082647137,0.00026844113,0.00024740124,0.0005078301,0.0003296115,0.0006373006,0.00048104476,0.00034205042,0.0007208398],"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.00017764122,0.00007911027,0.0010871146,0.00037701702,0.00008335494,0.00025225335,0.00026344325,0.3118013,0.16434948,0.1340965,0.0054083383,0.38202444],"study_design_scores_gemma":[0.000076931596,0.0003206685,0.00032707176,0.000033942182,0.000039560455,0.00022490075,0.000054075153,0.8654275,0.06253654,0.039978713,0.030951118,0.000028942492],"about_ca_topic_score_codex":0.0003245262,"about_ca_topic_score_gemma":0.0007346411,"teacher_disagreement_score":0.0016746065,"about_ca_system_score_codex":0.00027339722,"about_ca_system_score_gemma":0.0005297728,"threshold_uncertainty_score":0.0056020617},"labels":[],"label_agreement":null},{"id":"W2122612273","doi":"10.1186/1471-2288-12-155","title":"Social interactions of eating behaviour among high school students: a cellular automata approach","year":2012,"lang":"en","type":"article","venue":"BMC Medical Research Methodology","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"SFU Community Trust Endowment Fund; Simon Fraser University","keywords":"Overweight; Cafeteria; Affect (linguistics); Obesity; Food choice; Psychology; Developmental psychology; Social psychology; Medicine","score_opus":0.36933105736852057,"score_gpt":0.5282128909256791,"score_spread":0.15888183355715857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122612273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81182885,0.0006012304,0.1651654,0.0013246813,0.00014594241,0.00022152133,0.0007524668,0.00020151751,0.019758383],"genre_scores_gemma":[0.9847143,0.00023977908,0.010841111,0.00008280981,0.000029246332,0.00022439739,0.00017176782,0.00001942856,0.0036771437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995832,0.00017028599,0.000019425537,0.00010363177,0.000045750716,0.00007767599],"domain_scores_gemma":[0.99787486,0.0013921319,0.00025620052,0.00008530123,0.00021410949,0.00017734867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005776698,0.000703686,0.00094368303,0.0009433199,0.0011842054,0.0018023314,0.0016893679,0.0019171989,0.0040114303],"category_scores_gemma":[0.003169567,0.00053848996,0.0015350019,0.00070603716,0.0014314723,0.0012294457,0.0013423759,0.0011647552,0.00030847243],"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.000039311522,0.00006254459,0.008355109,0.00003249797,0.00007616647,0.00015989503,0.0002632259,0.97918975,0.0005295845,0.009250256,0.00026727986,0.001774362],"study_design_scores_gemma":[0.000008684563,0.000022687931,0.00090062706,0.0000067533856,0.000021851672,0.000015884685,0.00008646973,0.9960563,0.000046203728,0.002597436,0.00022769898,0.000009393233],"about_ca_topic_score_codex":0.053314257,"about_ca_topic_score_gemma":0.026826711,"teacher_disagreement_score":0.053314257,"about_ca_system_score_codex":0.0023308874,"about_ca_system_score_gemma":0.0016188349,"threshold_uncertainty_score":0.106007874},"labels":[],"label_agreement":null},{"id":"W2128248218","doi":"10.1109/wescan.1993.270554","title":"ATM framing acquisition","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Framing (construction); Computer science; Byte; Header; Theoretical computer science; Computer hardware; Computer network; Engineering","score_opus":0.015800667295029363,"score_gpt":0.21417895674991588,"score_spread":0.19837828945488653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128248218","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.058606323,0.0011197898,0.7610687,0.0005545989,0.0011353713,0.000437503,0.00082832965,0.008178049,0.16807133],"genre_scores_gemma":[0.72377026,0.0009992467,0.21256338,0.0005395611,0.00085807283,0.0002726969,0.0013587966,0.0003661973,0.059271812],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960166,0.00006394033,0.00002203906,0.00007506637,0.00016527041,0.000072015755],"domain_scores_gemma":[0.99938834,0.00012409223,0.00006094717,0.00012581315,0.00026562327,0.00003505744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005427307,0.00062423997,0.00029714798,0.0010923814,0.0008183475,0.0009973581,0.00073428487,0.00060466613,0.022536358],"category_scores_gemma":[0.0013488131,0.00023876173,0.0002407537,0.0007359592,0.0003372454,0.0011680295,0.0007445017,0.00051752303,0.0038909914],"study_design_candidate":"not_applicable","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.00057414465,0.00011761392,0.002285813,0.00021906197,0.00002677146,0.000610061,0.0003708201,0.011022952,0.076913,0.15392204,0.046616334,0.7073213],"study_design_scores_gemma":[0.00023522491,0.0009096043,0.004933141,0.0001600212,0.00018755895,0.0033817065,0.000299877,0.21170093,0.24804163,0.036501687,0.4934097,0.00023904335],"about_ca_topic_score_codex":0.00096624787,"about_ca_topic_score_gemma":0.00088707055,"teacher_disagreement_score":0.022536358,"about_ca_system_score_codex":0.0005433881,"about_ca_system_score_gemma":0.0004185562,"threshold_uncertainty_score":0.07539165},"labels":[],"label_agreement":null},{"id":"W2128330344","doi":"10.1109/allerton.2010.5706930","title":"On the capacity of high-density recording on a 1-D granular magnetic medium","year":2010,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Probabilistic logic; Upper and lower bounds; Binary number; Channel (broadcasting); Channel capacity; Terabit; Computer science; Magnetic storage; Expression (computer science); Simple (philosophy); Algorithm; Statistical physics; Mathematics; Physics; Mathematical analysis; Telecommunications; Optics; Arithmetic","score_opus":0.013286628981102106,"score_gpt":0.20586320990541915,"score_spread":0.19257658092431704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128330344","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6278509,0.0034604433,0.31298408,0.0043165134,0.0002698786,0.000058354042,0.0009549649,0.00062201853,0.049482938],"genre_scores_gemma":[0.99367565,0.0007982427,0.0034923446,0.00007798288,0.00007574668,0.000033616296,0.00009806621,0.00004654115,0.0017018779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939454,0.00017851045,0.000024056662,0.00008152043,0.00015128372,0.00017005329],"domain_scores_gemma":[0.99132407,0.007131915,0.00039823342,0.00042946392,0.00044774392,0.00026849602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011921694,0.00064350467,0.0009519255,0.0011101209,0.00088017253,0.0018442913,0.0012021632,0.0010784365,0.0034002075],"category_scores_gemma":[0.00708987,0.00042617315,0.0004235507,0.0009870257,0.0031460912,0.0036469675,0.0016009558,0.0015411928,0.00040205152],"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.00023207015,0.00007829049,0.0005082951,0.00021614201,0.000032396223,0.0002522105,0.00014760002,0.6087132,0.0086147105,0.37457517,0.001700375,0.004929603],"study_design_scores_gemma":[0.000008600713,0.0000120794275,0.0001681578,0.000021848562,0.000006831369,0.00003360767,0.000024123965,0.93457556,0.0011957979,0.0637226,0.00020778563,0.00002306346],"about_ca_topic_score_codex":0.004267529,"about_ca_topic_score_gemma":0.0016876599,"teacher_disagreement_score":0.004267529,"about_ca_system_score_codex":0.0020756489,"about_ca_system_score_gemma":0.0008528141,"threshold_uncertainty_score":0.015059888},"labels":[],"label_agreement":null},{"id":"W2128354866","doi":"10.1109/wcnc.2007.133","title":"Multidimensional Binary Repetition Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hamming code; Block code; Binary number; Hamming distance; Computer science; Concatenated error correction code; Linear code; Algorithm; Binary code; Transmission (telecommunications); Luby transform code; Hamming space; Hamming bound; Theoretical computer science; Mathematics; Decoding methods; Arithmetic; Telecommunications","score_opus":0.011742987461858695,"score_gpt":0.2530876967250803,"score_spread":0.2413447092632216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128354866","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.08641521,0.0023984485,0.8805173,0.00039596186,0.00028647188,0.00018665487,0.00049961155,0.0008409412,0.028459353],"genre_scores_gemma":[0.5352793,0.0012909784,0.44874847,0.00033609406,0.00016305293,0.00040922058,0.00060719054,0.00011906782,0.01304664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935085,0.00013838812,0.000052647618,0.0001411434,0.0002378108,0.00007911752],"domain_scores_gemma":[0.99887913,0.0002853645,0.00021014987,0.00027305476,0.00028631644,0.00006602917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000342856,0.00035465945,0.00048328395,0.00071796175,0.0005298829,0.00077603303,0.0007450304,0.00067900633,0.0030146067],"category_scores_gemma":[0.0018023376,0.00023301163,0.00036133075,0.00089789747,0.00061747956,0.0007879636,0.001017742,0.00065669254,0.0012384375],"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.00032611995,0.00005827469,0.0008115651,0.00036890077,0.00004113696,0.00039725276,0.0002723478,0.05008022,0.13003448,0.60609627,0.004582455,0.20693098],"study_design_scores_gemma":[0.00016380766,0.0006502488,0.0013891382,0.00019775603,0.00006718462,0.0029789289,0.00012510245,0.5098076,0.17262815,0.20693669,0.104814686,0.00024073369],"about_ca_topic_score_codex":0.0003352239,"about_ca_topic_score_gemma":0.00051878515,"teacher_disagreement_score":0.0030146067,"about_ca_system_score_codex":0.00044665777,"about_ca_system_score_gemma":0.0004795847,"threshold_uncertainty_score":0.010084808},"labels":[],"label_agreement":null},{"id":"W2129458925","doi":"10.1088/1742-5468/2004/07/p07005","title":"Critical behaviour of number-conserving cellular automata with nonlinear fundamental diagrams","year":2004,"lang":"en","type":"article","venue":"Journal of Statistical Mechanics Theory and Experiment","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Gravitational singularity; Cellular automaton; Diagram; Conjecture; Mathematics; Nonlinear system; Class (philosophy); Piecewise linear function; Phase diagram; Critical exponent; Flow (mathematics); Exponent; Pure mathematics; Statistical physics; Computer science; Mathematical analysis; Physics; Phase (matter); Geometry; Algorithm; Quantum mechanics","score_opus":0.009333079388323137,"score_gpt":0.279026578543306,"score_spread":0.26969349915498286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129458925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96987975,0.00023474658,0.025874237,0.00013330008,0.000016819266,0.000025112882,0.000029243713,0.000080536454,0.0037263322],"genre_scores_gemma":[0.9974833,0.000044842924,0.0021446066,0.000010134265,0.000006729426,0.000010838895,0.000015145353,0.0000068859417,0.00027748244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984396,0.000040240382,0.000009870871,0.000030659903,0.000037858445,0.000037268623],"domain_scores_gemma":[0.9976792,0.001144955,0.0004930379,0.00017685337,0.00025325417,0.00025277882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047927783,0.0003184519,0.00034905586,0.0008355938,0.0006102645,0.0011145518,0.00052970136,0.00062446523,0.0009080535],"category_scores_gemma":[0.0049274387,0.00018251152,0.00031485825,0.00024040366,0.0015192508,0.0011273511,0.00047078804,0.00056021794,0.00007232093],"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.00023359703,0.00012630888,0.0072551286,0.00012871696,0.000056151413,0.00058212265,0.00080377783,0.23690338,0.06918589,0.6764711,0.0007569663,0.007496769],"study_design_scores_gemma":[0.00003435327,0.00006889765,0.0014235709,0.00001426835,0.00001263561,0.00014305252,0.00006308515,0.83992547,0.006781895,0.15093301,0.0005761008,0.000023624083],"about_ca_topic_score_codex":0.0013638592,"about_ca_topic_score_gemma":0.000770237,"teacher_disagreement_score":0.0013638592,"about_ca_system_score_codex":0.0009147444,"about_ca_system_score_gemma":0.00042202044,"threshold_uncertainty_score":0.0066369176},"labels":[],"label_agreement":null},{"id":"W2129577914","doi":"10.1002/cplx.10028","title":"Fuzzy automata and life","year":2002,"lang":"en","type":"article","venue":"Complexity","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Automaton; Continuous spatial automaton; Automata theory; Computer science; Fuzzy logic; Theoretical computer science; Mobile automaton; Mathematics; Quantum finite automata; Artificial intelligence","score_opus":0.08559055733109319,"score_gpt":0.2555777888714224,"score_spread":0.16998723154032921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129577914","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.17462276,0.045296337,0.3935012,0.017035095,0.0021363723,0.00019941381,0.00080061867,0.00064979785,0.36575854],"genre_scores_gemma":[0.9179947,0.0063243806,0.056697685,0.0010675935,0.0005175381,0.00016255982,0.00028554033,0.000037325302,0.01691275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945253,0.00018380725,0.000035946843,0.00011596581,0.00016370513,0.00004800989],"domain_scores_gemma":[0.99912673,0.0004301292,0.00010769404,0.0001385209,0.00014545872,0.00005149325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267356,0.00040645723,0.0004762128,0.0010412728,0.0006968895,0.0018924249,0.00042896593,0.0010133529,0.004184902],"category_scores_gemma":[0.002213933,0.00013630824,0.000513379,0.000845568,0.0029503172,0.002041526,0.00081304845,0.001106204,0.0004191767],"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.000004106337,0.0000034407342,0.00009521683,0.000032635096,0.000005580497,0.00004051677,0.000088469,0.004714645,0.0003246779,0.98720306,0.0009689066,0.0065188147],"study_design_scores_gemma":[0.0000034178242,0.0000056270756,0.00011282888,0.000017567021,0.000002120027,0.000044994136,0.000030124207,0.00832313,0.00011848883,0.9784364,0.012900858,0.0000044798144],"about_ca_topic_score_codex":0.002746141,"about_ca_topic_score_gemma":0.0019212562,"teacher_disagreement_score":0.004184902,"about_ca_system_score_codex":0.0018473637,"about_ca_system_score_gemma":0.00063306565,"threshold_uncertainty_score":0.013999879},"labels":[],"label_agreement":null},{"id":"W2130729091","doi":"10.1016/j.tcs.2011.05.012","title":"Polyominoes simulating arbitrary-neighborhood zippers and tilings","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"Western University","funders":"","keywords":"Polyomino; Mathematics; Combinatorics; Discrete mathematics; Geometry","score_opus":0.014175814350595672,"score_gpt":0.22785787668915014,"score_spread":0.21368206233855447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130729091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9015251,0.00017202272,0.06785238,0.00036923357,0.000351922,0.000067579844,0.0001994043,0.00045211686,0.029010167],"genre_scores_gemma":[0.9849421,0.00006437943,0.010752683,0.00008025961,0.00002051426,0.000056455585,0.00009777151,0.00008542369,0.0039004018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997404,0.000060525745,0.000014452707,0.00005085088,0.00006411849,0.00006964338],"domain_scores_gemma":[0.9988084,0.00060188613,0.00009193575,0.0002250426,0.000093783536,0.00017897885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033568757,0.00025324305,0.00084017694,0.000543407,0.0010653493,0.0014092837,0.0010133532,0.0012202923,0.009516281],"category_scores_gemma":[0.0029378082,0.0003891432,0.0006188313,0.0005508673,0.0014369532,0.001609656,0.0013939363,0.00094366336,0.00050350523],"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.00041036174,0.0001973333,0.0019561856,0.00012534982,0.00005531613,0.00045842244,0.0003589331,0.5324955,0.009645305,0.4422825,0.002510384,0.009504397],"study_design_scores_gemma":[0.00008776044,0.000064608124,0.0002828676,0.0000120867135,0.00001413638,0.000053118896,0.0001585618,0.8856778,0.0024681669,0.10967966,0.0014790781,0.000022100505],"about_ca_topic_score_codex":0.0022797012,"about_ca_topic_score_gemma":0.0028096975,"teacher_disagreement_score":0.009516281,"about_ca_system_score_codex":0.0009146154,"about_ca_system_score_gemma":0.0005868191,"threshold_uncertainty_score":0.03183508},"labels":[],"label_agreement":null},{"id":"W2131213031","doi":"10.1177/1094342007074873","title":"Regular Paper: Parallel Implementation of a Cellular Automaton Modeling the Growth of Three-Dimensional Tissues","year":2007,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Rice University; Simon Fraser University; University of Houston; National Science Foundation","keywords":"Computer science; Correctness; Cellular automaton; Process (computing); Domain (mathematical analysis); Parallel computing; Distributed computing; Population; Algorithm; Programming language","score_opus":0.013739784442991395,"score_gpt":0.2743899145485825,"score_spread":0.2606501301055911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131213031","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.06943727,0.00017438132,0.9065441,0.00043581636,0.00038770813,0.00014215145,0.00034520953,0.0049010785,0.017632348],"genre_scores_gemma":[0.5734753,0.0003389425,0.40928352,0.0001165505,0.00008439103,0.0002159265,0.00066368934,0.00062488334,0.015196827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998172,0.000043013977,0.000014411727,0.000040685376,0.00006920657,0.000015498757],"domain_scores_gemma":[0.99940526,0.00022255965,0.000032439464,0.00016187945,0.00013768187,0.00004022764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036190078,0.0003998825,0.00044944737,0.00025568006,0.0005083525,0.00084018137,0.0011320977,0.00061082427,0.0060148146],"category_scores_gemma":[0.0012751664,0.00018796958,0.00056224933,0.00031150164,0.00043114668,0.000539212,0.0004236911,0.00048246302,0.0010355272],"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.00022079554,0.00010414445,0.0020844587,0.00012693364,0.00006815657,0.0003999013,0.00014261654,0.8836165,0.016540863,0.023266442,0.00532372,0.068105526],"study_design_scores_gemma":[0.000017882789,0.000022097947,0.00008101623,0.0000041235,0.000009449441,0.00003922942,0.0000076117467,0.9873777,0.005616545,0.0023585525,0.0044600065,0.000005817824],"about_ca_topic_score_codex":0.0037659502,"about_ca_topic_score_gemma":0.002906847,"teacher_disagreement_score":0.0060148146,"about_ca_system_score_codex":0.00048483242,"about_ca_system_score_gemma":0.0007682816,"threshold_uncertainty_score":0.020121574},"labels":[],"label_agreement":null},{"id":"W2132947734","doi":"10.1109/26.891208","title":"Frame synchronization in guided scrambling line codes","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Dalhousie University","keywords":"Scrambling; Synchronizing; Computer science; Line code; Algorithm; Code word; Synchronization (alternating current); Decoding methods; Theoretical computer science; Telecommunications; Baseband","score_opus":0.04064479655014228,"score_gpt":0.29999418819685075,"score_spread":0.25934939164670845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132947734","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.28816292,0.000376322,0.7068738,0.00006386376,0.000031209656,0.000034310036,0.000027381882,0.0003614886,0.0040686945],"genre_scores_gemma":[0.9595165,0.00013897795,0.039241575,0.00002187165,0.000012788037,0.00003057757,0.000020582343,0.000029026256,0.0009880794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997695,0.00006211137,0.000009597542,0.000036275364,0.000081488055,0.00004093032],"domain_scores_gemma":[0.99937505,0.00023723078,0.00016460069,0.00007932304,0.00012086291,0.000022868773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025173606,0.00018675531,0.00019709273,0.00031883558,0.00021199144,0.00035581717,0.00030182852,0.00041802134,0.00046421526],"category_scores_gemma":[0.0016001497,0.00014587397,0.00016413255,0.00024369432,0.0005052634,0.0003803096,0.00025487418,0.00025201007,0.00016913911],"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.00036118197,0.00005719308,0.0016826558,0.00013300567,0.000028345426,0.0005864021,0.000630807,0.5056899,0.18714271,0.22566862,0.0011777745,0.07684144],"study_design_scores_gemma":[0.00002597262,0.00014055778,0.0005371968,0.00001591297,0.000009052267,0.00015182418,0.000052846375,0.9383496,0.038627494,0.020237649,0.0018233433,0.000028558603],"about_ca_topic_score_codex":0.0010051558,"about_ca_topic_score_gemma":0.0006129453,"teacher_disagreement_score":0.0010051558,"about_ca_system_score_codex":0.00036741752,"about_ca_system_score_gemma":0.0002771005,"threshold_uncertainty_score":0.0026658177},"labels":[],"label_agreement":null},{"id":"W2133589379","doi":"10.1109/tmag.2005.854461","title":"Reduced complexity signal detection and turbo decoding for multitrack magnetic recording channels","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Detector; Decoding methods; Computer science; SIGNAL (programming language); Interference (communication); Channel (broadcasting); Turbo; Turbo code; Signal-to-noise ratio (imaging); Turbo equalizer; Detection theory; Noise (video); Physics; Electronic engineering; Telecommunications; Concatenated error correction code; Artificial intelligence","score_opus":0.03638782485229283,"score_gpt":0.2607000371099797,"score_spread":0.22431221225768685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133589379","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.05830408,0.0005576898,0.9364566,0.00018936633,0.00009932562,0.00006286244,0.000053642787,0.00089804485,0.0033782772],"genre_scores_gemma":[0.57813704,0.00032857587,0.41593027,0.00018096188,0.000094409275,0.000077741344,0.000108280816,0.00007576187,0.0050669587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901533,0.0002623964,0.000044780925,0.00010885528,0.0004532087,0.00011537742],"domain_scores_gemma":[0.99791104,0.0009010822,0.00018568088,0.00029059162,0.00063661335,0.000075049335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057038065,0.0005715518,0.0005855416,0.0004761286,0.0005264806,0.0007346485,0.0010886011,0.00095096184,0.002151556],"category_scores_gemma":[0.0024229714,0.00029767366,0.00031881037,0.00049446226,0.0006763838,0.001278319,0.0007337141,0.00079073315,0.0009329804],"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.0022591762,0.00018384118,0.0023274447,0.0006334418,0.00014547473,0.0007006187,0.00049055275,0.10483698,0.3974685,0.06709469,0.00358706,0.4202723],"study_design_scores_gemma":[0.00007390621,0.00045821516,0.000486208,0.000027976403,0.000047908674,0.0006815614,0.000033981993,0.7601861,0.22625025,0.005865862,0.0058090785,0.00007895085],"about_ca_topic_score_codex":0.001151235,"about_ca_topic_score_gemma":0.0023785504,"teacher_disagreement_score":0.002151556,"about_ca_system_score_codex":0.0004916565,"about_ca_system_score_gemma":0.00073745527,"threshold_uncertainty_score":0.0071976185},"labels":[],"label_agreement":null},{"id":"W2134053054","doi":"10.48550/arxiv.0707.1408","title":"Module Shifts and Measure Rigidity in Linear Cellular Automata","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Measure (data warehouse); Coset; Rigidity (electromagnetism); Bernoulli's principle; Invariant measure; Commutative property; Mathematics; Prime (order theory); Pure mathematics; Cellular automaton; Discrete mathematics; Combinatorics; Physics; Algorithm; Computer science; Quantum mechanics","score_opus":0.04815597551734015,"score_gpt":0.27568614181333856,"score_spread":0.22753016629599843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134053054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8603862,0.000454935,0.119200684,0.00044259048,0.00007534337,0.000033452496,0.00009254684,0.00032813818,0.01898609],"genre_scores_gemma":[0.98751694,0.00012406308,0.008988134,0.000052761516,0.000047722868,0.000033437493,0.00004357803,0.000018447367,0.0031749762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990386,0.00021938563,0.00007385805,0.0002868049,0.00019009036,0.0001913344],"domain_scores_gemma":[0.9979291,0.0008221262,0.0004163656,0.00030364096,0.00017661482,0.00035212893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068078336,0.00041097196,0.00044668632,0.0008866011,0.0014186173,0.0017670846,0.0007306081,0.0010829726,0.0033070305],"category_scores_gemma":[0.0028545083,0.0005025884,0.0007432208,0.0004774869,0.003361027,0.002146129,0.0023374287,0.0011779616,0.00047763277],"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.00008134206,0.00002508358,0.000963109,0.0000315173,0.000012780481,0.000224204,0.0006996164,0.009574662,0.0061923023,0.9764737,0.00022361848,0.0054981406],"study_design_scores_gemma":[0.000043056567,0.00019045467,0.0013095282,0.00002614678,0.000025207128,0.0004108665,0.00034304094,0.06875775,0.008266565,0.9169089,0.0036516625,0.00006678864],"about_ca_topic_score_codex":0.0007724337,"about_ca_topic_score_gemma":0.0006353808,"teacher_disagreement_score":0.0033070305,"about_ca_system_score_codex":0.0010650707,"about_ca_system_score_gemma":0.00046442263,"threshold_uncertainty_score":0.0110631585},"labels":[],"label_agreement":null},{"id":"W2134122221","doi":"10.1016/j.dam.2008.05.026","title":"On the tiling by translation problem","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Mathematics; Square (algebra); Constant (computer programming); Combinatorics; Square tiling; Translation (biology); Time complexity; Quadratic equation; Tile; Plane (geometry); Discrete mathematics; Hexagonal crystal system; Algorithm; Computer science; Geometry","score_opus":0.02565413947899917,"score_gpt":0.2280014864183632,"score_spread":0.20234734693936404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134122221","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.1991555,0.0041485997,0.56382555,0.018375719,0.0023403806,0.00016060604,0.00059756584,0.0005637176,0.21083234],"genre_scores_gemma":[0.80455405,0.0036984903,0.10706252,0.0028435357,0.0021363434,0.00030112677,0.0012869394,0.00071828335,0.07739869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994018,0.00020016884,0.000036053334,0.00014804721,0.00010358679,0.00011036908],"domain_scores_gemma":[0.9971944,0.0019354892,0.00016422664,0.0003460179,0.00018160454,0.00017818919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010278274,0.00056925206,0.0013178951,0.0007520868,0.0017262824,0.0024249433,0.0013331668,0.0028369413,0.022078937],"category_scores_gemma":[0.0073966887,0.0004365316,0.0011686728,0.0013850769,0.002911994,0.0056679193,0.0026429787,0.0028755192,0.0018443756],"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.000045721787,0.000017834034,0.000119952565,0.00006227967,0.000008646927,0.000086963526,0.00010419682,0.0072489786,0.00029817194,0.97369194,0.0060852137,0.012230093],"study_design_scores_gemma":[0.000015434749,0.000006734261,0.000035118293,0.000009297349,0.000003417708,0.000028566003,0.000038757393,0.015749482,0.00013472929,0.9815377,0.0024360833,0.0000045423158],"about_ca_topic_score_codex":0.001453932,"about_ca_topic_score_gemma":0.0008124123,"teacher_disagreement_score":0.022078937,"about_ca_system_score_codex":0.0009799886,"about_ca_system_score_gemma":0.00086822547,"threshold_uncertainty_score":0.07386136},"labels":[],"label_agreement":null},{"id":"W2135042599","doi":"","title":"Remarks on the Critical Behavior of Second Order Additive Invariants in Elementary Cellular Automata","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Gravitational singularity; Exponent; Mathematics; Singularity; Conjecture; Invariant (physics); Cellular automaton; Order (exchange); Pure mathematics; Discrete mathematics; Mathematical analysis; Mathematical physics; Algorithm","score_opus":0.01574680835851277,"score_gpt":0.27103190234987784,"score_spread":0.25528509399136506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135042599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81060225,0.0023169264,0.13415119,0.0013559659,0.00022740835,0.000047510763,0.00015916047,0.00075387384,0.050385702],"genre_scores_gemma":[0.9939885,0.00019505122,0.0044300114,0.000072479546,0.000046534366,0.000011649234,0.00003043239,0.000031776683,0.0011935427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997346,0.000039253493,0.000011409352,0.000049646344,0.00011508441,0.000049926],"domain_scores_gemma":[0.99772936,0.0014548536,0.00022043992,0.00024473254,0.00021874488,0.00013191935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054463075,0.00033992392,0.00042032351,0.00093469897,0.0005610393,0.0011875338,0.000680448,0.0006166835,0.0037245704],"category_scores_gemma":[0.0049925726,0.00011400372,0.00050549366,0.00039320864,0.0014858957,0.0010926328,0.0004932398,0.0007624581,0.00021124267],"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.0001952101,0.00012371383,0.007704807,0.0003932885,0.00004935256,0.0013179893,0.0010066625,0.12669045,0.03174778,0.81025666,0.0025658,0.017948383],"study_design_scores_gemma":[0.000038486018,0.00018862556,0.0054128426,0.000073344294,0.000027446256,0.00063845114,0.0002741097,0.35825798,0.017685369,0.6119585,0.005385486,0.000059321468],"about_ca_topic_score_codex":0.0007799381,"about_ca_topic_score_gemma":0.00041467114,"teacher_disagreement_score":0.0037245704,"about_ca_system_score_codex":0.0003559505,"about_ca_system_score_gemma":0.00020838418,"threshold_uncertainty_score":0.012459934},"labels":[],"label_agreement":null},{"id":"W2136786922","doi":"10.46298/dmtcs.2968","title":"Conservation Laws and Invariant Measures in Surjective Cellular Automata","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Academy of Finland","keywords":"Surjective function; Mathematics; Corollary; Conservation law; Invariant (physics); Cellular automaton; Bernoulli's principle; Discrete mathematics; Markov chain; Probability measure; Invariant measure; Transitive relation; Generalization; Pure mathematics; Bernoulli process; Combinatorics; Mathematical analysis; Algorithm; Mathematical physics; Statistics","score_opus":0.026033746646894236,"score_gpt":0.24102390805502244,"score_spread":0.2149901614081282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136786922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6397184,0.00061439525,0.3255294,0.00040805343,0.00010572801,0.000050100516,0.00011903962,0.00030352196,0.033151377],"genre_scores_gemma":[0.9885105,0.00018384508,0.008898811,0.00004543356,0.000042530788,0.0000345637,0.000033013675,0.000021858592,0.0022294861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932647,0.00011633298,0.000049050257,0.00016010346,0.00023711249,0.00011096305],"domain_scores_gemma":[0.9977913,0.000907769,0.00035801518,0.00044685198,0.0002789818,0.00021707884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052462256,0.0003058926,0.00039334997,0.00089538353,0.0008246012,0.002016241,0.0006701972,0.0004859234,0.002338729],"category_scores_gemma":[0.003080857,0.00020443517,0.0006198638,0.00039354496,0.0028617175,0.0019595425,0.0012518341,0.00077796995,0.0002450917],"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.000009707143,0.000018937291,0.0005279163,0.000024983523,0.000008821983,0.00012311355,0.0002543764,0.0060890964,0.0026345793,0.985838,0.00013592863,0.0043344945],"study_design_scores_gemma":[0.000009868158,0.000048640362,0.00072998786,0.000012755253,0.000015573758,0.00018893345,0.00016050487,0.06798418,0.0034315456,0.9254613,0.0019353253,0.000021294964],"about_ca_topic_score_codex":0.00090914516,"about_ca_topic_score_gemma":0.0005361563,"teacher_disagreement_score":0.002338729,"about_ca_system_score_codex":0.0006939394,"about_ca_system_score_gemma":0.00039604324,"threshold_uncertainty_score":0.0078238845},"labels":[],"label_agreement":null},{"id":"W2136963288","doi":"10.1109/isit.2009.5206056","title":"Improved lower bounds on capacities of symmetric 2-dimensional constraints ising Rayleigh quotients","year":2009,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Generalization; Upper and lower bounds; Mathematics; Quotient; Ising model; Type (biology); Constraint (computer-aided design); Combinatorics; Applied mathematics; Mathematical optimization; Discrete mathematics; Mathematical analysis; Geometry; Physics; Statistical physics","score_opus":0.012066370658843554,"score_gpt":0.23051789962727756,"score_spread":0.218451528968434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136963288","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.10703255,0.0032785316,0.82796746,0.0010706374,0.00036206483,0.000138969,0.0013687257,0.0014683687,0.057312623],"genre_scores_gemma":[0.7395379,0.0020854867,0.24294929,0.00035986945,0.00047512102,0.00048137858,0.0015599803,0.0010354267,0.011515564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979742,0.00049703696,0.00015081164,0.0002215866,0.00076622143,0.00039006345],"domain_scores_gemma":[0.99280965,0.004095402,0.00032678194,0.001261875,0.0011788065,0.00032752074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026510656,0.0017933003,0.0015029085,0.0039407546,0.00096711674,0.0031406332,0.0025402785,0.0011378662,0.011733238],"category_scores_gemma":[0.015626308,0.0006669841,0.0013742246,0.0025313846,0.002301244,0.005501708,0.0028998305,0.0039573614,0.002117213],"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.00018540709,0.000088535766,0.0006471216,0.00034114622,0.000059125592,0.00013473057,0.00020839844,0.3216388,0.007914663,0.602464,0.007304842,0.05901325],"study_design_scores_gemma":[0.00002083931,0.000038234946,0.0003158667,0.00007729315,0.000018468028,0.00005036233,0.00003271606,0.64943033,0.0076507498,0.33825818,0.00404737,0.00005957506],"about_ca_topic_score_codex":0.0027269556,"about_ca_topic_score_gemma":0.0038707734,"teacher_disagreement_score":0.011733238,"about_ca_system_score_codex":0.0024401555,"about_ca_system_score_gemma":0.0012608604,"threshold_uncertainty_score":0.039251566},"labels":[],"label_agreement":null},{"id":"W2137353910","doi":"10.1109/ccece.1998.685604","title":"FPGA implementation of the guided scrambling line coding technique","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Scrambling; Computer science; Field-programmable gate array; Line code; Coding (social sciences); Code word; Algorithm; Binary number; Word (group theory); Code (set theory); Binary code; Theoretical computer science; Arithmetic; Computer hardware; Decoding methods; Mathematics; Baseband; Telecommunications","score_opus":0.05548969942972145,"score_gpt":0.3178407262425047,"score_spread":0.2623510268127833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137353910","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.35677046,0.0007328795,0.5864634,0.00029597856,0.00036140863,0.000325303,0.00042821196,0.00914411,0.045478348],"genre_scores_gemma":[0.8493751,0.00016331553,0.14424439,0.00010044226,0.000025119642,0.00009133082,0.0001667811,0.00004111102,0.005792375],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999895,0.000017624481,0.000005062271,0.000015251163,0.00004072942,0.00002641903],"domain_scores_gemma":[0.99982953,0.00004299638,0.000017921147,0.000034435077,0.00006400134,0.000011163091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009425773,0.00021947533,0.00015743882,0.00029084994,0.0001592488,0.0003006407,0.00040072144,0.0001848339,0.0028785644],"category_scores_gemma":[0.00036687413,0.00008750575,0.00008019064,0.00016799054,0.00011234631,0.00016739604,0.000093613955,0.00020480195,0.0006988025],"study_design_candidate":"bench_or_experimental","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.0006763887,0.00017359157,0.0025295792,0.00036354517,0.000073632116,0.0008210383,0.00021547853,0.06944136,0.38102087,0.025388034,0.009792459,0.50950396],"study_design_scores_gemma":[0.0002381849,0.0015434822,0.003412959,0.000076657234,0.000071976414,0.0014849852,0.00005367356,0.45240036,0.486846,0.0021012246,0.051699813,0.000070661314],"about_ca_topic_score_codex":0.0015020759,"about_ca_topic_score_gemma":0.001756375,"teacher_disagreement_score":0.0028785644,"about_ca_system_score_codex":0.00023368442,"about_ca_system_score_gemma":0.00030595798,"threshold_uncertainty_score":0.009629786},"labels":[],"label_agreement":null},{"id":"W2137447276","doi":"10.1109/dsd.2007.10","title":"A New Class of Cellular Automata","year":2007,"lang":"en","type":"article","venue":"Digital Systems Design","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia","funders":"","keywords":"Cellular automaton; Mobile automaton; Benchmark (surveying); Shift register; Computer science; Neighbourhood (mathematics); Automaton; Continuous spatial automaton; Electronic circuit; Asynchronous cellular automaton; Algorithm; Finite-state machine; Theoretical computer science; Built-in self-test; Time complexity; Quantum finite automata; Mathematics; Automata theory; Telecommunications","score_opus":0.021091145057323922,"score_gpt":0.22586388836565596,"score_spread":0.20477274330833203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137447276","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.033683576,0.0029563846,0.92587835,0.0005842312,0.0006559717,0.00010842259,0.00043694218,0.0010616658,0.034634393],"genre_scores_gemma":[0.6085296,0.0038375158,0.35239762,0.0007460212,0.0004923689,0.0005518036,0.0008590358,0.00019030418,0.032395773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935395,0.000101746,0.00006123959,0.00021108495,0.00021163582,0.000060450155],"domain_scores_gemma":[0.9992161,0.00029449386,0.000076527394,0.00020965438,0.0001573271,0.000045921668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024267737,0.00045711387,0.0005476413,0.0007419261,0.00067907816,0.0018943723,0.00071017444,0.0009326848,0.003886876],"category_scores_gemma":[0.0016689578,0.0002325646,0.0009240157,0.0005925391,0.00093389105,0.0014696723,0.001014683,0.0010954984,0.0010307448],"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.00006423392,0.000037614387,0.0010296813,0.0002048671,0.000044979988,0.00027753325,0.00020581529,0.06443131,0.02161228,0.79470205,0.00453358,0.11285605],"study_design_scores_gemma":[0.0000530042,0.00014140412,0.00067538925,0.00007099649,0.000056351695,0.001224216,0.00010033042,0.44142595,0.012542865,0.3629831,0.18063383,0.00009249176],"about_ca_topic_score_codex":0.0014572123,"about_ca_topic_score_gemma":0.0008885683,"teacher_disagreement_score":0.003886876,"about_ca_system_score_codex":0.00073668786,"about_ca_system_score_gemma":0.0005771919,"threshold_uncertainty_score":0.013002932},"labels":[],"label_agreement":null},{"id":"W2137667031","doi":"10.1109/pacrim.1997.620313","title":"Efficient realization for a class of clock-controlled sequence generators","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Iran Telecommunication Research Center","keywords":"Realization (probability); Shift register; Generator (circuit theory); Computer science; Scheme (mathematics); Sequence (biology); Very-large-scale integration; Linear feedback shift register; Self-shrinking generator; Throughput; Class (philosophy); Clock generator; Constant (computer programming); Power consumption; Computer hardware; Power (physics); Arithmetic; Embedded system; Computer architecture; Electrical engineering; Engineering; Clock signal; Mathematics; Voltage; Telecommunications; Induction generator; Artificial intelligence","score_opus":0.03075043316360057,"score_gpt":0.2519423461780809,"score_spread":0.22119191301448035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137667031","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.19544758,0.0015299337,0.782672,0.00023182237,0.0003137397,0.0002589695,0.00020944246,0.0013691635,0.017967261],"genre_scores_gemma":[0.7623982,0.00055176025,0.22899224,0.00010952649,0.000124517,0.0002088392,0.00030885177,0.000054988825,0.0072510466],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998796,0.000023034694,0.000006789214,0.000028078959,0.000040102404,0.000022432061],"domain_scores_gemma":[0.9998919,0.000038996077,0.000018487724,0.000020632395,0.00002033869,0.000009596932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015188131,0.00030073532,0.00021144096,0.0003356468,0.00024021877,0.00031870397,0.0003288074,0.00035130393,0.0025472606],"category_scores_gemma":[0.00038139717,0.00013965844,0.00016631102,0.00023210386,0.0001930467,0.00047434398,0.00027109103,0.0003275587,0.00062361173],"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.0003264867,0.00012864156,0.0006631623,0.000356257,0.000037131005,0.00071166136,0.00021366992,0.035609566,0.43441492,0.22316423,0.0032064447,0.30116773],"study_design_scores_gemma":[0.0003020609,0.0014142544,0.0021411981,0.00007539562,0.00005104087,0.0024928865,0.00006828324,0.39506352,0.39141625,0.09508241,0.11178756,0.00010511221],"about_ca_topic_score_codex":0.000091271264,"about_ca_topic_score_gemma":0.00024030352,"teacher_disagreement_score":0.0025472606,"about_ca_system_score_codex":0.00018624228,"about_ca_system_score_gemma":0.000253694,"threshold_uncertainty_score":0.008521438},"labels":[],"label_agreement":null},{"id":"W2139752178","doi":"10.1109/tce.2005.1510500","title":"An integrated error control and DC-free code based on multimode coding","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Consumer Electronics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Encoder; Decoding methods; Computer science; Coding (social sciences); Error detection and correction; Algorithm; Concatenated error correction code; Variable-length code; Electronic engineering; Block code; Mathematics; Engineering","score_opus":0.0123473549348886,"score_gpt":0.2540100132054168,"score_spread":0.24166265827052819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139752178","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.18660484,0.0006411974,0.8032006,0.00040585335,0.00022095483,0.00012028341,0.00013644123,0.00097280863,0.0076969047],"genre_scores_gemma":[0.6276487,0.00018902136,0.36479414,0.00017686185,0.00007898452,0.00009964564,0.0000991217,0.00004654947,0.0068668933],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956065,0.00006453721,0.000021274767,0.00007462212,0.00024248273,0.00003636216],"domain_scores_gemma":[0.9991793,0.0002257798,0.00009843555,0.0001864803,0.0002637296,0.000046324025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028430726,0.00033916967,0.00027459627,0.0005595544,0.00029078283,0.00046181798,0.0005947089,0.0006128813,0.0008900774],"category_scores_gemma":[0.0011924608,0.00014658272,0.0001707241,0.00057318516,0.0004934248,0.00063557696,0.00059323106,0.0005063325,0.0002817226],"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.00082304794,0.00020745245,0.0019762414,0.0001884873,0.000069926115,0.00051541755,0.00028133986,0.068924256,0.49460512,0.12600195,0.0021728994,0.30423382],"study_design_scores_gemma":[0.00007973041,0.00052241853,0.0009864881,0.000041792187,0.00004882257,0.0009233877,0.000024799572,0.62394905,0.35262206,0.007847459,0.012874321,0.0000797676],"about_ca_topic_score_codex":0.0010771536,"about_ca_topic_score_gemma":0.0018557577,"teacher_disagreement_score":0.0010771536,"about_ca_system_score_codex":0.0004430683,"about_ca_system_score_gemma":0.0005179341,"threshold_uncertainty_score":0.003214717},"labels":[],"label_agreement":null},{"id":"W2139894977","doi":"10.1109/ccece.1999.807191","title":"Simulation of the model of computer mirroring based on difference queues","year":2003,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mirroring; Computer science; Backup; Queue; Queue management system; Fork–join queue; Parallel computing; Real-time computing; Computer network; Operating system","score_opus":0.03648262385391518,"score_gpt":0.254410225676521,"score_spread":0.21792760182260582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139894977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.778478,0.00024127497,0.20501073,0.00040730744,0.00009949688,0.00015992047,0.00037401094,0.0005447637,0.014684573],"genre_scores_gemma":[0.9848328,0.000098363584,0.011987836,0.000032464628,0.0000074108766,0.00008966798,0.000112686466,0.000018901845,0.002819913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961406,0.00011172958,0.000023698844,0.0000634523,0.000088445755,0.00009860177],"domain_scores_gemma":[0.99864036,0.00082296453,0.00010626192,0.00012882265,0.00017699217,0.0001244741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054684666,0.0003976452,0.00066465343,0.00045511263,0.0005805693,0.00096882426,0.0013831622,0.0012984711,0.0028165933],"category_scores_gemma":[0.002103491,0.0003697697,0.00072593556,0.00050201005,0.0010159706,0.0012342222,0.00078374194,0.00082733977,0.0002293374],"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.00011573043,0.000042209536,0.0009199816,0.000023633796,0.000013733376,0.000101720856,0.00008824447,0.9831709,0.002444145,0.011779555,0.00015106895,0.0011489296],"study_design_scores_gemma":[0.000013225252,0.000021631044,0.00012198189,0.0000019262595,0.0000036265571,0.000010712924,0.000009893059,0.99766314,0.00055786135,0.0014102019,0.0001813878,0.0000045405736],"about_ca_topic_score_codex":0.0148862805,"about_ca_topic_score_gemma":0.004759153,"teacher_disagreement_score":0.0148862805,"about_ca_system_score_codex":0.0017639297,"about_ca_system_score_gemma":0.0012058825,"threshold_uncertainty_score":0.029599309},"labels":[],"label_agreement":null},{"id":"W2143477233","doi":"10.1109/pacrim.1995.519530","title":"A secure video on demand system","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Encryption; Cryptosystem; Cryptography; Simple (philosophy); Computer security; Video on demand; On demand; Computer network; Service provider; Bitstream; Hybrid cryptosystem; Embedded system; Computer hardware; Service (business); Multimedia; Telecommunications; Decoding methods; Business","score_opus":0.01355148604738984,"score_gpt":0.19800728320049463,"score_spread":0.18445579715310478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143477233","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.26484135,0.00093591155,0.66245586,0.002399702,0.00076155056,0.00069921004,0.00086794904,0.009894779,0.05714373],"genre_scores_gemma":[0.9516542,0.00035369245,0.032018777,0.0002793484,0.00014546474,0.00013271332,0.00034555915,0.00007624952,0.014994026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956816,0.00006513854,0.000028618444,0.00007485733,0.00019783972,0.000065386936],"domain_scores_gemma":[0.99965835,0.00006271674,0.000032624514,0.0001161903,0.00008509189,0.000044984874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026894963,0.0003376577,0.00030457962,0.000363966,0.0005374741,0.0011090038,0.0006402096,0.0007186572,0.0045422637],"category_scores_gemma":[0.0006051496,0.00015250417,0.00018891649,0.00029698428,0.00038026753,0.0014014536,0.0013421235,0.00060091424,0.0019709913],"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.0019483875,0.0007751429,0.0032253917,0.00032390808,0.00009257488,0.0023394837,0.00046718752,0.053666163,0.32223612,0.20205821,0.038641933,0.37422553],"study_design_scores_gemma":[0.00038998842,0.0008683355,0.001764693,0.000042072777,0.00007268581,0.0016517777,0.00014122167,0.75971395,0.12254862,0.03768227,0.075018495,0.00010577942],"about_ca_topic_score_codex":0.0007698506,"about_ca_topic_score_gemma":0.00046930896,"teacher_disagreement_score":0.0045422637,"about_ca_system_score_codex":0.0005012825,"about_ca_system_score_gemma":0.00046502572,"threshold_uncertainty_score":0.01519537},"labels":[],"label_agreement":null},{"id":"W2146356284","doi":"10.1109/isit.2008.4595228","title":"On the Period of a Periodic-Finite-Type Shift","year":2008,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Period (music); Type (biology); Class (philosophy); Mathematics; Period length; Pure mathematics; Discrete mathematics; Physics; Computer science; Artificial intelligence; Geology","score_opus":0.02611277561153893,"score_gpt":0.23102552351502403,"score_spread":0.2049127479034851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146356284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7612131,0.0008841083,0.17504811,0.00059173774,0.00033139266,0.000064156455,0.00022023781,0.00018714633,0.06146003],"genre_scores_gemma":[0.98209184,0.0003450971,0.0141390795,0.000103873586,0.00017499314,0.0000496224,0.000061565726,0.00006551256,0.0029684557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994438,0.00011129553,0.000044255485,0.00013865173,0.00015767691,0.00010433145],"domain_scores_gemma":[0.99801314,0.0010937658,0.00025136146,0.0002662302,0.00019900396,0.0001764689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008650116,0.00021570783,0.00036070336,0.00079683505,0.00070883293,0.0014294451,0.0003417618,0.0004970737,0.0027351934],"category_scores_gemma":[0.0034641312,0.00019902461,0.00034406586,0.00046170907,0.002395486,0.0022248365,0.0010273595,0.0007532617,0.00029383833],"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.00023415317,0.000024755205,0.0021159435,0.000071764625,0.0000120728155,0.00036243015,0.0005786516,0.006937038,0.01857574,0.9484377,0.00046984272,0.02217988],"study_design_scores_gemma":[0.0000570908,0.0002324878,0.0033893522,0.000073471136,0.000027354978,0.000914986,0.0006147942,0.042292234,0.010162067,0.9328591,0.009313598,0.00006340999],"about_ca_topic_score_codex":0.00021456936,"about_ca_topic_score_gemma":0.00018169318,"teacher_disagreement_score":0.0027351934,"about_ca_system_score_codex":0.00057335506,"about_ca_system_score_gemma":0.00032812223,"threshold_uncertainty_score":0.009150147},"labels":[],"label_agreement":null},{"id":"W2146806334","doi":"10.1109/simsym.2001.922141","title":"Models of complex physical systems using Cell-DEVS","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Formalism (music); Computer science; Distributed computing; Complex system; Theoretical computer science; Extension (predicate logic); Modeling and simulation; Programming language; Simulation; Artificial intelligence","score_opus":0.106162117386747,"score_gpt":0.2594392455828755,"score_spread":0.15327712819612851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146806334","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.005035596,0.0004904805,0.98259497,0.00044918925,0.000105238934,0.00007325502,0.0003910045,0.0005225007,0.0103377635],"genre_scores_gemma":[0.20094074,0.0021028619,0.78368336,0.00040930774,0.00013377373,0.0010989963,0.001501196,0.00048014935,0.009649577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950945,0.00014013673,0.000047825713,0.00006183627,0.00019248102,0.000048359758],"domain_scores_gemma":[0.99892265,0.00055195653,0.000101500744,0.00020229483,0.00014691739,0.000074725416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010040771,0.000746757,0.00087641994,0.0006485018,0.00070823776,0.0016756696,0.001662492,0.001043221,0.0037463442],"category_scores_gemma":[0.0022307998,0.0004497135,0.0016483433,0.00088460674,0.0015653633,0.0015935692,0.0017173354,0.0021495423,0.0008765904],"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.00001119821,0.000016927104,0.00023788447,0.00008804077,0.000020868403,0.00014871858,0.00013853465,0.18995719,0.0020542617,0.7969676,0.0014203491,0.00893844],"study_design_scores_gemma":[0.000024501962,0.000024804662,0.00009702984,0.00003737792,0.000020356025,0.00017769501,0.000033600576,0.6443371,0.0040882775,0.2810103,0.07012038,0.00002861454],"about_ca_topic_score_codex":0.0021944707,"about_ca_topic_score_gemma":0.002324906,"teacher_disagreement_score":0.0037463442,"about_ca_system_score_codex":0.0009834025,"about_ca_system_score_gemma":0.00091387285,"threshold_uncertainty_score":0.012532711},"labels":[],"label_agreement":null},{"id":"W2147307058","doi":"10.1109/ismvl.1990.122655","title":"The analysis of one dimensional multiple-valued linear cellular automata","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cellular automaton; Automaton; Alphabet; Computer science; Pseudorandom number generator; Theoretical computer science; Finite-state machine; Graph; Similarity (geometry); Algorithm; Mobile automaton; Discrete mathematics; Mathematics; Automata theory; Artificial intelligence","score_opus":0.027991593114903648,"score_gpt":0.23544574619187436,"score_spread":0.2074541530769707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147307058","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.2223991,0.0009899286,0.75049794,0.00048176476,0.00006383524,0.00006319005,0.00021771676,0.00039969693,0.024886815],"genre_scores_gemma":[0.95939815,0.00039722238,0.034202684,0.000054465232,0.00003465529,0.000064206826,0.00010185639,0.000041148367,0.005705516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970216,0.000048802307,0.000016384809,0.000063804335,0.00011802453,0.000050902738],"domain_scores_gemma":[0.9989166,0.0006091582,0.00014921474,0.000087061424,0.0002001585,0.00003780223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002123309,0.00028239837,0.0003833276,0.0006140513,0.0003557013,0.0010442631,0.00040385732,0.00039954224,0.002932221],"category_scores_gemma":[0.002348147,0.00016657318,0.00054694567,0.00051262544,0.0006424969,0.0007553804,0.00045424944,0.0005723128,0.00038152662],"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.0000517026,0.000029296,0.0016035326,0.00012080746,0.000030074509,0.00029387686,0.00023014745,0.42318916,0.012555798,0.5247305,0.00090490363,0.036260255],"study_design_scores_gemma":[0.0000050437784,0.000022939103,0.00026835094,0.000011217593,0.000007737988,0.000116993826,0.00003405348,0.89624745,0.0030303162,0.09835528,0.0018873774,0.000013202487],"about_ca_topic_score_codex":0.0019468978,"about_ca_topic_score_gemma":0.0010702815,"teacher_disagreement_score":0.002932221,"about_ca_system_score_codex":0.0010409718,"about_ca_system_score_gemma":0.0004970462,"threshold_uncertainty_score":0.009809256},"labels":[],"label_agreement":null},{"id":"W2147599029","doi":"10.1162/artl_a_00169","title":"<i>You Pretty Little Flocker</i>: Exploring the Aesthetic State Space of Creative Ecosystems","year":2015,"lang":"en","type":"article","venue":"Artificial Life","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Egg Farmers of Canada","keywords":"Generative grammar; Computer science; Artificial life; Compendium; Generative Design; Generative model; Flocking (texture); Space (punctuation); Artificial intelligence; Human–computer interaction; State space; Cognitive science; Mathematics; Visual arts; Engineering","score_opus":0.07093066261239785,"score_gpt":0.2529608973343604,"score_spread":0.18203023472196256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147599029","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.024991462,0.021914043,0.5315956,0.20074724,0.013120811,0.00020575547,0.00026868505,0.004321027,0.20283538],"genre_scores_gemma":[0.35905415,0.01455474,0.35308602,0.048919506,0.004540614,0.0004335695,0.00034015148,0.0023659973,0.21670528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996412,0.00011937649,0.000008371336,0.000056961628,0.00014467275,0.000029480536],"domain_scores_gemma":[0.999134,0.00036120118,0.00003184136,0.00013738379,0.0002190094,0.00011664826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000873069,0.00047901453,0.00033563914,0.00060631835,0.0016928769,0.003827204,0.0010852059,0.0021558446,0.012819681],"category_scores_gemma":[0.0035811395,0.00033379742,0.0005616254,0.00036506532,0.004411307,0.0068317964,0.002047173,0.0038635929,0.0039238506],"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.00008670473,0.000046422534,0.00070235424,0.0003158262,0.00004136394,0.00029689222,0.0022617902,0.0037609914,0.009767492,0.4750992,0.3484888,0.15913218],"study_design_scores_gemma":[0.000027495997,0.000106746935,0.0005262889,0.0003634744,0.000024730462,0.0011926593,0.001252875,0.013506286,0.013761721,0.33376673,0.635336,0.00013502457],"about_ca_topic_score_codex":0.0019307348,"about_ca_topic_score_gemma":0.0022687872,"teacher_disagreement_score":0.012819681,"about_ca_system_score_codex":0.001030786,"about_ca_system_score_gemma":0.00053460954,"threshold_uncertainty_score":0.04288608},"labels":[],"label_agreement":null},{"id":"W2148004487","doi":"10.1007/3-540-45105-6_46","title":"Coevolving Communication and Cooperation for Lattice Formation Tasks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","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":"University of Toronto","funders":"","keywords":"Computer science; Cellular automaton; Automaton; Lattice (music); Distributed computing; Theoretical computer science; Human–computer interaction; Artificial intelligence","score_opus":0.019347911653475276,"score_gpt":0.25159275266616454,"score_spread":0.23224484101268927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148004487","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.17205052,0.00032587931,0.80485266,0.000509797,0.000117460804,0.00011658051,0.000070622715,0.00035735537,0.021599188],"genre_scores_gemma":[0.92664045,0.00022349384,0.06276465,0.00007424576,0.000052240714,0.00020540736,0.00009298918,0.00009893145,0.009847685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991085,0.0003166366,0.000055413984,0.00015408255,0.00019048496,0.00017489737],"domain_scores_gemma":[0.99080527,0.007125186,0.0003865469,0.00063871604,0.0004094286,0.00063485856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001554185,0.00071044796,0.0010840642,0.00060299627,0.0011230359,0.0016257826,0.0019191115,0.0016526568,0.005543978],"category_scores_gemma":[0.010742568,0.00049566134,0.0005423514,0.00081965985,0.0018076254,0.0026944114,0.0032668188,0.0019671032,0.0006977189],"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.0007167113,0.00031137318,0.0005656602,0.00021580009,0.000039520393,0.00023110233,0.0005620963,0.5069848,0.010106576,0.36279866,0.0037553061,0.11371235],"study_design_scores_gemma":[0.000041308045,0.00006312863,0.00006577128,0.000007657473,0.000008298374,0.000043867305,0.00005201126,0.8576182,0.0013493977,0.14021637,0.0005222885,0.000011642517],"about_ca_topic_score_codex":0.0013420153,"about_ca_topic_score_gemma":0.0016067221,"teacher_disagreement_score":0.005543978,"about_ca_system_score_codex":0.00071023335,"about_ca_system_score_gemma":0.000985348,"threshold_uncertainty_score":0.018546462},"labels":[],"label_agreement":null},{"id":"W2149177153","doi":"10.1109/cefc.2010.5481389","title":"A creative design system for electromagnetic device optimization","year":2010,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Reuse; Design process; Process (computing); Curse of dimensionality; Engineering design process; Systems engineering; Artificial intelligence; Engineering; Work in process; Mechanical engineering","score_opus":0.014526089208718862,"score_gpt":0.23775829762859133,"score_spread":0.22323220841987246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149177153","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.0025152126,0.000073692056,0.9855899,0.00011419529,0.000058436486,0.00016524564,0.00012230844,0.0055043334,0.0058567566],"genre_scores_gemma":[0.060942743,0.00018575702,0.9272662,0.0001167052,0.000037549704,0.0006584927,0.00049811124,0.00072915014,0.009565296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928206,0.0001606117,0.000064672924,0.00015601618,0.0002933811,0.00004328184],"domain_scores_gemma":[0.99930143,0.00028517656,0.000050293376,0.00016243526,0.00016341024,0.00003717338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013516762,0.0011921092,0.000674037,0.0010961754,0.00073795544,0.0019311209,0.0016156482,0.00140493,0.02041691],"category_scores_gemma":[0.0032597603,0.00059543684,0.0012018684,0.00056251336,0.000845639,0.0012248935,0.0018388648,0.0009914945,0.003764403],"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.00035072726,0.00032262228,0.0013404301,0.0009828864,0.00017911773,0.00092014234,0.00092925545,0.22474429,0.06456866,0.165559,0.029915135,0.51018775],"study_design_scores_gemma":[0.00022269454,0.00021094152,0.00030129138,0.00009968563,0.000098915996,0.0006468713,0.000082874176,0.79833364,0.025409535,0.03602362,0.13849653,0.000073464464],"about_ca_topic_score_codex":0.0006131217,"about_ca_topic_score_gemma":0.000669303,"teacher_disagreement_score":0.02041691,"about_ca_system_score_codex":0.0005922957,"about_ca_system_score_gemma":0.0007786838,"threshold_uncertainty_score":0.06830138},"labels":[],"label_agreement":null},{"id":"W2151593094","doi":"10.1109/dcc.2009.21","title":"Bits in Asymptotically Optimal Lossy Source Codes Are Asymptotically Bernoulli","year":2009,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kingston Health Sciences Centre","funders":"","keywords":"Asymptotically optimal algorithm; Bernoulli's principle; Encoder; Source code; Lossy compression; Binary number; Ergodic theory; Computer science; Block code; Algorithm; Mathematics; Discrete mathematics; Decoding methods; Arithmetic; Physics; Mathematical analysis","score_opus":0.00783272922155744,"score_gpt":0.2309657267373023,"score_spread":0.22313299751574486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151593094","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.2803298,0.0008854154,0.7088328,0.000931396,0.00008393844,0.00006338012,0.00030508428,0.00047364403,0.00809459],"genre_scores_gemma":[0.9587306,0.000802618,0.03577236,0.00022201492,0.00007143273,0.00012072927,0.00021848454,0.00013656956,0.003925192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998667,0.00037928965,0.00007548101,0.00021044436,0.00049702916,0.00017078308],"domain_scores_gemma":[0.9890497,0.007817497,0.0014656897,0.00055877806,0.00088472216,0.00022363414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017616091,0.00059602334,0.000857671,0.0012100753,0.0005862321,0.0015974741,0.0009591756,0.0012041602,0.0018868031],"category_scores_gemma":[0.01857325,0.0007345218,0.00040324236,0.0011275187,0.002864628,0.0032542464,0.0017034231,0.0013268422,0.0005017983],"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.00041655288,0.000041578507,0.0018444123,0.00021644137,0.000039096285,0.00024274892,0.00043995865,0.31003496,0.010669795,0.6530722,0.0010676936,0.021914681],"study_design_scores_gemma":[0.00004757927,0.000088948625,0.0008100275,0.000039937622,0.000016358183,0.00017473273,0.00006261703,0.5865611,0.004704216,0.40649566,0.0009620232,0.000036775215],"about_ca_topic_score_codex":0.0010767919,"about_ca_topic_score_gemma":0.0008229367,"teacher_disagreement_score":0.0018868031,"about_ca_system_score_codex":0.0015522831,"about_ca_system_score_gemma":0.0010837585,"threshold_uncertainty_score":0.011262655},"labels":[],"label_agreement":null},{"id":"W2151891161","doi":"10.1109/access.2015.2498288","title":"Cybermatics: A Holistic Field for Systematic Study of Cyber-Enabled New Worlds","year":2015,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities; Japan Society for the Promotion of Science; National Natural Science Foundation of China","keywords":"Cyberspace; Informatization; Field (mathematics); Computer science; Cyber-physical system; Data science; World Wide Web; The Internet; Mathematics","score_opus":0.10225925424950585,"score_gpt":0.3613943902709545,"score_spread":0.25913513602144866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151891161","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.025397688,0.075952776,0.6500659,0.07015797,0.0033824611,0.00071453286,0.0005850637,0.0003819501,0.17336158],"genre_scores_gemma":[0.62065405,0.058319457,0.29904675,0.006749022,0.0032538895,0.0020507772,0.00037993272,0.00015572585,0.009390391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99489164,0.0034798156,0.0002966104,0.00047474029,0.0006712447,0.00018586381],"domain_scores_gemma":[0.9887749,0.0070636347,0.0008219113,0.0018477535,0.0009448231,0.000546914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010057348,0.0008578774,0.0011976789,0.007812732,0.0032801102,0.012306052,0.0013828592,0.0027751932,0.0047777044],"category_scores_gemma":[0.008035046,0.000399515,0.0008834974,0.0056408704,0.028549783,0.019846614,0.0071041305,0.004933435,0.00062451017],"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.0000034946963,0.0000116747115,0.00028832056,0.00018777023,0.0000061720393,0.00003880897,0.001070105,0.0001999267,0.00011444018,0.9877073,0.00089561247,0.0094763115],"study_design_scores_gemma":[0.000006098297,0.00003517617,0.00072307105,0.0007893643,0.0000112097905,0.00020011638,0.004596483,0.001160266,0.0001876321,0.9163422,0.07592743,0.000021012485],"about_ca_topic_score_codex":0.0010951473,"about_ca_topic_score_gemma":0.0012651061,"teacher_disagreement_score":0.012306052,"about_ca_system_score_codex":0.004196792,"about_ca_system_score_gemma":0.009764027,"threshold_uncertainty_score":0.05318898},"labels":[],"label_agreement":null},{"id":"W2153907020","doi":"10.1109/tcomm.2009.09.070005","title":"Some comments on the use of markov models in communications","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Markov chain; Markov process; Stochastic differential equation; Channel (broadcasting); Field (mathematics); Markov model; Electronic engineering; Telecommunications; Mathematics; Engineering; Applied mathematics; Machine learning; Statistics","score_opus":0.12481479231560719,"score_gpt":0.2983842211223395,"score_spread":0.1735694288067323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153907020","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013374267,0.011669766,0.020047754,0.9135371,0.02905476,0.000032548378,0.00048069225,0.00015414384,0.023685886],"genre_scores_gemma":[0.111781485,0.04373815,0.021909725,0.6466676,0.1036999,0.00022602394,0.00043590818,0.00045309193,0.071088076],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963632,0.0012396817,0.00031260788,0.0004379927,0.0013218233,0.00032468277],"domain_scores_gemma":[0.9734476,0.020435205,0.0010264533,0.00083338644,0.0037171724,0.00054024096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052532046,0.0010556902,0.00077541464,0.0010977058,0.0023479816,0.002157922,0.0032614665,0.0073048384,0.020007176],"category_scores_gemma":[0.025665924,0.0005756722,0.0011716104,0.0018474049,0.003753835,0.008434868,0.0017994324,0.009531665,0.004491844],"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.0000884488,0.000031427415,0.0005465002,0.00055543886,0.000035171972,0.0007691377,0.00062774797,0.002632698,0.0005075195,0.45316702,0.52375615,0.017282793],"study_design_scores_gemma":[0.000032828008,0.000078002915,0.0008909296,0.00046072644,0.000019792564,0.0007899717,0.00038144947,0.0046090023,0.0009114636,0.30741063,0.68431205,0.00010319241],"about_ca_topic_score_codex":0.010561705,"about_ca_topic_score_gemma":0.0064250547,"teacher_disagreement_score":0.020007176,"about_ca_system_score_codex":0.0026516067,"about_ca_system_score_gemma":0.0014327978,"threshold_uncertainty_score":0.06693065},"labels":[],"label_agreement":null},{"id":"W2155937922","doi":"10.1142/s0129183105007182","title":"AGING IN HOSTILE ENVIRONMENT MODELED BY CELLULAR AUTOMATA WITH GENETIC DYNAMICS","year":2005,"lang":"en","type":"article","venue":"International Journal of Modern Physics C","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"AGE-WELL","keywords":"Cellular automaton; Population; Demography; Adaptation (eye); Mathematics; Biology; Sociology; Algorithm","score_opus":0.004925213056099928,"score_gpt":0.20495737458807042,"score_spread":0.2000321615319705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155937922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73355395,0.0010070723,0.24998839,0.0009242626,0.00020133628,0.00006479859,0.000476765,0.0005600088,0.013223483],"genre_scores_gemma":[0.98588955,0.00035636756,0.009606214,0.000055666056,0.000029745184,0.00007080855,0.00008590768,0.000025507466,0.0038802195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971765,0.000085902204,0.000018625855,0.00007304072,0.00004384728,0.000060941442],"domain_scores_gemma":[0.9992086,0.00029137378,0.00018958136,0.000073038915,0.00013128763,0.000106115425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003494989,0.00056511216,0.0007880702,0.0007096873,0.00064010953,0.0013352031,0.001182935,0.0012869469,0.0015041507],"category_scores_gemma":[0.0019915332,0.0003283397,0.0005893183,0.00061688485,0.0011938125,0.0011363465,0.0009769459,0.00083389797,0.00030786896],"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.00006259473,0.000034980574,0.0037142464,0.000034835757,0.000038549595,0.00037301224,0.00019948075,0.95577294,0.0028930374,0.03291286,0.0005097843,0.0034536559],"study_design_scores_gemma":[0.000011216919,0.000014679472,0.00030039038,0.0000032877665,0.000011302103,0.00003579934,0.00002115542,0.9917282,0.00016642803,0.007315711,0.00038290606,0.000008974168],"about_ca_topic_score_codex":0.014823569,"about_ca_topic_score_gemma":0.00761431,"teacher_disagreement_score":0.014823569,"about_ca_system_score_codex":0.00096716697,"about_ca_system_score_gemma":0.00067258545,"threshold_uncertainty_score":0.029474556},"labels":[],"label_agreement":null},{"id":"W2156088178","doi":"10.1002/cpe.885","title":"Concurrent urban legends","year":2005,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concurrency; Mutual exclusion; Computer science; Spurious relationship; Construct (python library); Inheritance (genetic algorithm); Concurrent object-oriented programming; Field (mathematics); Programming language; Mathematics; Programming paradigm","score_opus":0.021903332450199632,"score_gpt":0.32136893135190914,"score_spread":0.2994655989017095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156088178","genre_codex":"other","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.01950744,0.003398141,0.074548125,0.026406156,0.006539905,0.00007664068,0.00029526645,0.001303751,0.86792463],"genre_scores_gemma":[0.6301583,0.00440599,0.024365136,0.007201538,0.0027534456,0.0002276305,0.0004722868,0.0013255671,0.32909015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986802,0.0003914346,0.000048180667,0.00026101578,0.00037311343,0.00024599984],"domain_scores_gemma":[0.99790907,0.00076447526,0.0002122452,0.00041626752,0.000498428,0.00019955295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001327086,0.00063738984,0.0003486498,0.0009872463,0.0055638296,0.006940639,0.0016092461,0.0014024276,0.033016473],"category_scores_gemma":[0.0062403954,0.0003730939,0.00048420613,0.0014602551,0.007177775,0.0072400947,0.0043475204,0.0034285367,0.0036884327],"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.000018053746,0.0000042506167,0.000084843385,0.000024625577,0.0000015520961,0.00007811169,0.0013239933,0.00032807217,0.00011909145,0.97358364,0.018461965,0.0059717274],"study_design_scores_gemma":[0.000010268331,0.000015559997,0.00014330982,0.000059854814,0.00000592998,0.0003595612,0.0018875693,0.001350871,0.0005117748,0.13841219,0.85722226,0.000020873807],"about_ca_topic_score_codex":0.008197542,"about_ca_topic_score_gemma":0.010711959,"teacher_disagreement_score":0.033016473,"about_ca_system_score_codex":0.003791688,"about_ca_system_score_gemma":0.0016101818,"threshold_uncertainty_score":0.1104511},"labels":[],"label_agreement":null},{"id":"W2156120624","doi":"10.1109/aps.1995.530871","title":"The lattice gas automata for computational electromagnetics","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Manitoba","funders":"","keywords":"Lattice gas automaton; Electromagnetics; Cellular automaton; Computer science; Lattice (music); Finite-difference time-domain method; Maxwell's equations; Computational electromagnetics; Electromagnetism; Electromagnetic field; Observable; Partial differential equation; Statistical physics; Theoretical computer science; Mathematics; Stochastic cellular automaton; Algorithm; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.018333364708057225,"score_gpt":0.23501414346498767,"score_spread":0.21668077875693045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156120624","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.0042705163,0.014672805,0.95319057,0.0026690178,0.00074203295,0.00009284921,0.00035560815,0.001448231,0.022558331],"genre_scores_gemma":[0.20678842,0.016661232,0.75071466,0.0008684492,0.0012172088,0.0009277981,0.0007656258,0.00052991137,0.02152677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926025,0.00027576645,0.000058133603,0.00012751609,0.00024105386,0.00003728158],"domain_scores_gemma":[0.9987583,0.0007037217,0.00006324068,0.00022948302,0.00017595259,0.000069329966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009884617,0.00095956767,0.0010968032,0.0012609703,0.000851697,0.0025670365,0.0016390192,0.0018365328,0.0062263478],"category_scores_gemma":[0.003803959,0.00044734124,0.0010477558,0.0016383078,0.0026745829,0.0024048141,0.0017281545,0.0037449829,0.0020547456],"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.000022320291,0.000012228154,0.0001745876,0.00015207063,0.000019546236,0.00006864847,0.000119123484,0.06535769,0.0011560085,0.8924347,0.0051696054,0.035313524],"study_design_scores_gemma":[0.000019340316,0.0000152258835,0.00007046618,0.00006462961,0.000009594094,0.00006354115,0.000025512252,0.30425182,0.00057173136,0.64486486,0.05002099,0.000022283166],"about_ca_topic_score_codex":0.0030828787,"about_ca_topic_score_gemma":0.0025448084,"teacher_disagreement_score":0.0062263478,"about_ca_system_score_codex":0.0015884647,"about_ca_system_score_gemma":0.0014659606,"threshold_uncertainty_score":0.02082926},"labels":[],"label_agreement":null},{"id":"W2156875947","doi":"10.1109/isit.1997.613406","title":"A measure for the length of probabilistic dependence","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Probabilistic logic; Markov process; Measure (data warehouse); Markov model; Markov chain; Variable-order Markov model; Computer science; Algorithm; Statistical model; Markov renewal process; Markov property; Mathematics; Statistical physics; Artificial intelligence; Statistics; Machine learning; Data mining; Physics","score_opus":0.04228345963609337,"score_gpt":0.23489248233867943,"score_spread":0.19260902270258606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156875947","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.0735024,0.0014559784,0.91056746,0.0013059754,0.0001601009,0.000117354386,0.00097036024,0.00044695058,0.011473485],"genre_scores_gemma":[0.8766217,0.0015287494,0.113891535,0.0005568786,0.00074878376,0.00054404384,0.0010136649,0.0002579123,0.004836704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945628,0.00119054,0.00051817234,0.0011090159,0.002215513,0.00040387642],"domain_scores_gemma":[0.9508013,0.032531183,0.0066645243,0.0050868164,0.0036730242,0.0012430723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004131827,0.0011335576,0.0012865799,0.004204148,0.0014280798,0.0031107778,0.0021033748,0.0029348303,0.005126929],"category_scores_gemma":[0.036828965,0.0008322214,0.0010695211,0.0025661294,0.0045950916,0.011021116,0.0034390828,0.004344215,0.0010736729],"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.00022847146,0.00017939617,0.0055898745,0.00036432245,0.00015860399,0.00040405968,0.0007255356,0.056783576,0.009825264,0.8810226,0.0019167115,0.042801615],"study_design_scores_gemma":[0.000027099286,0.000259207,0.0038724616,0.00013973757,0.00007929408,0.0008028071,0.00013447841,0.19415066,0.0053985165,0.78919756,0.005695962,0.00024229997],"about_ca_topic_score_codex":0.00066379254,"about_ca_topic_score_gemma":0.00041579906,"teacher_disagreement_score":0.005126929,"about_ca_system_score_codex":0.0020588632,"about_ca_system_score_gemma":0.0009872392,"threshold_uncertainty_score":0.02185142},"labels":[],"label_agreement":null},{"id":"W2157722904","doi":"10.1109/pacrim.1989.48299","title":"Guided scrambling: a new line coding technique for optical fiber communication systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alberta Energy","funders":"","keywords":"Scrambling; Synchronizing; Decoding methods; Computer science; Line code; Encoder; Coding (social sciences); Bitstream; Encoding (memory); Binary number; Algorithm; Theoretical computer science; Electronic engineering; Transmission (telecommunications); Telecommunications; Artificial intelligence; Mathematics; Arithmetic; Engineering","score_opus":0.06976125607204757,"score_gpt":0.31869423934571556,"score_spread":0.24893298327366797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157722904","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.044633187,0.004918091,0.9279328,0.00045319655,0.00031322925,0.0000844951,0.00016527696,0.0022438855,0.01925585],"genre_scores_gemma":[0.46139067,0.0050144703,0.51119536,0.00043929464,0.00024448286,0.00014892181,0.00031988302,0.00020292611,0.021043986],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981767,0.000031203203,0.000010232966,0.000023428718,0.00009634527,0.000021188464],"domain_scores_gemma":[0.99981135,0.00004961163,0.000041302592,0.000034055032,0.000051359173,0.000012219739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012055177,0.00033891402,0.00026620794,0.0005272854,0.00020884983,0.0005786405,0.0005226244,0.0004821355,0.0015109018],"category_scores_gemma":[0.00041323277,0.00014794338,0.0002287565,0.0005043751,0.0004968373,0.00062954734,0.00044769485,0.0005143135,0.0010550733],"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.00015188755,0.000048566188,0.0003214862,0.00048047226,0.000039167877,0.0005510016,0.00033645102,0.019704793,0.6102387,0.09881927,0.007702505,0.2616057],"study_design_scores_gemma":[0.000060267572,0.00059459725,0.00091077207,0.00012650291,0.00006210031,0.003422673,0.000102860664,0.26420325,0.5141566,0.025851957,0.19037081,0.00013764173],"about_ca_topic_score_codex":0.00041899495,"about_ca_topic_score_gemma":0.0006260262,"teacher_disagreement_score":0.0015109018,"about_ca_system_score_codex":0.000327544,"about_ca_system_score_gemma":0.00025022135,"threshold_uncertainty_score":0.0050544143},"labels":[],"label_agreement":null},{"id":"W2157952668","doi":"10.1109/ccece.2002.1015285","title":"On effectiveness of phase shifters for pseudo-random test pattern generators","year":2003,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Randomness; Cellular automaton; Computer science; Phase (matter); Randomness tests; Algorithm; Test (biology); Random number generation; Mathematics; Physics; Statistics; Biology","score_opus":0.011473727016072402,"score_gpt":0.2671291004420134,"score_spread":0.25565537342594097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157952668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5033473,0.0100550605,0.4624069,0.00068692374,0.0001583119,0.00023068419,0.00016085157,0.0019442904,0.021009786],"genre_scores_gemma":[0.9324071,0.0009835041,0.064968504,0.00010852614,0.000102059916,0.00006704586,0.000113120965,0.00009389566,0.0011562639],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9954679,0.002023104,0.00020912146,0.0004752878,0.0016436633,0.00018093483],"domain_scores_gemma":[0.9638594,0.03110517,0.0015989305,0.0018402103,0.0013995289,0.00019674205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029538556,0.00076012383,0.000576817,0.0015867996,0.00034715296,0.0009381066,0.000872004,0.00091069407,0.0026663712],"category_scores_gemma":[0.019950813,0.00030842156,0.00041612817,0.0005549893,0.00092671055,0.0026012496,0.0005955912,0.0006341475,0.0005325467],"study_design_candidate":"bench_or_experimental","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.002813128,0.00035870256,0.008347083,0.00091186166,0.00021610211,0.0004039495,0.0001811418,0.19468074,0.12794909,0.056833077,0.0013343148,0.60597086],"study_design_scores_gemma":[0.00024543586,0.0050519034,0.0040285443,0.00015030641,0.0003999331,0.002682594,0.00009138671,0.61180615,0.3488927,0.017194662,0.009364449,0.00009195628],"about_ca_topic_score_codex":0.00025969028,"about_ca_topic_score_gemma":0.00032340165,"teacher_disagreement_score":0.0029538556,"about_ca_system_score_codex":0.00064375094,"about_ca_system_score_gemma":0.00032304114,"threshold_uncertainty_score":0.015621662},"labels":[],"label_agreement":null},{"id":"W2158614474","doi":"10.1109/ccece.1996.548087","title":"Tree-structured linear cellular automata","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Tree (set theory); Cellular automaton; Pseudorandom number generator; Automaton; Finite-state machine; Sequence (biology); Theoretical computer science; Binary tree; Tree structure; State (computer science); Algorithm; Mathematics; Combinatorics","score_opus":0.018647415656210812,"score_gpt":0.21741865517118047,"score_spread":0.19877123951496967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158614474","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.01919408,0.00018385625,0.9672907,0.00026962694,0.000073647745,0.00009105686,0.0003332094,0.0006913049,0.011872397],"genre_scores_gemma":[0.58521545,0.0005309346,0.40204078,0.00031056625,0.00007307766,0.0006654529,0.0007404764,0.00010740337,0.0103157405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937016,0.00017227151,0.00005512564,0.000110319066,0.00019297651,0.0000991068],"domain_scores_gemma":[0.9989656,0.00043900585,0.00013227088,0.00013577666,0.00027609267,0.00005129459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039782852,0.0003584233,0.00036734086,0.0003687181,0.00031384436,0.0014373173,0.00093120546,0.000739549,0.0038970914],"category_scores_gemma":[0.0017794754,0.00020335056,0.00056111417,0.0005838188,0.0010627324,0.0014055069,0.0007142043,0.0010124153,0.0010553423],"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.000051157887,0.000048472004,0.00052599533,0.000088430505,0.00001576672,0.00021549492,0.00020105825,0.09465718,0.011067611,0.8720778,0.001553918,0.019497145],"study_design_scores_gemma":[0.000060036076,0.00010924038,0.00019467222,0.00003845641,0.000030043167,0.00017317577,0.000072969924,0.63195044,0.009117193,0.33245325,0.025769174,0.00003135065],"about_ca_topic_score_codex":0.0014661136,"about_ca_topic_score_gemma":0.001931596,"teacher_disagreement_score":0.0038970914,"about_ca_system_score_codex":0.0007669433,"about_ca_system_score_gemma":0.0009746036,"threshold_uncertainty_score":0.0130370855},"labels":[],"label_agreement":null},{"id":"W2162258772","doi":"10.1109/ccece.1998.685550","title":"A novel way to generate pseudo-random sequences longer than maximal length sequences","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Shift register; Sequence (biology); Binary number; Linear feedback shift register; Computer science; Pseudorandom binary sequence; Algorithm; Mathematics; Combinatorics; Arithmetic; Telecommunications","score_opus":0.03615331688207309,"score_gpt":0.24327201132537282,"score_spread":0.20711869444329972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162258772","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.058332883,0.0006767204,0.93131775,0.00038845834,0.00023816072,0.00008536939,0.000104178056,0.00097418844,0.007882359],"genre_scores_gemma":[0.50500774,0.00054251566,0.48652807,0.00032203787,0.000114244765,0.0002725411,0.00016675275,0.00012716757,0.006918945],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997515,0.00006267086,0.00001960578,0.00006447079,0.000072174524,0.000029439454],"domain_scores_gemma":[0.9993913,0.00023074057,0.0001232009,0.00013724787,0.00007248169,0.000045079178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020814787,0.00033625565,0.00031275384,0.00025241647,0.00030874842,0.00036705096,0.0005095872,0.00041774506,0.0020302963],"category_scores_gemma":[0.00092003436,0.00020091527,0.0003329415,0.0002964739,0.00052860053,0.0007215617,0.0004685589,0.00068947097,0.00070356403],"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.0003732111,0.00016363618,0.0006362746,0.00048271162,0.000064454915,0.00061234145,0.00022653515,0.024834346,0.6337122,0.1702432,0.0032227316,0.16542841],"study_design_scores_gemma":[0.00021429372,0.0014305001,0.000715235,0.00007211816,0.000095026626,0.0035795788,0.000053735792,0.23614186,0.63210785,0.06334861,0.06212657,0.000114625196],"about_ca_topic_score_codex":0.00008444981,"about_ca_topic_score_gemma":0.0001491994,"teacher_disagreement_score":0.0020302963,"about_ca_system_score_codex":0.00015258025,"about_ca_system_score_gemma":0.0002087933,"threshold_uncertainty_score":0.0067919493},"labels":[],"label_agreement":null},{"id":"W2163627674","doi":"10.14430/arctic4471","title":"Re: Eigil Knuth Manuscript","year":2015,"lang":"en","type":"article","venue":"ARCTIC","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geography","score_opus":0.04935420989125103,"score_gpt":0.2533824031562457,"score_spread":0.2040281932649947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163627674","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021976582,0.010733994,0.0057299547,0.047820024,0.103761435,0.00019511595,0.003688025,0.0032605156,0.8226132],"genre_scores_gemma":[0.0034229045,0.001374746,0.0006049644,0.00096239353,0.0030184044,0.000031409152,0.00037411618,0.00040328727,0.9898078],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934703,0.000084209474,0.000042183372,0.0001773994,0.00029741012,0.000051862637],"domain_scores_gemma":[0.9974396,0.00023764047,0.0001443229,0.00027280507,0.0014377194,0.00046790505],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00078285515,0.00094299234,0.00084919826,0.001758115,0.0012421826,0.0024380728,0.0010344874,0.001430502,0.5495473],"category_scores_gemma":[0.00652177,0.00026597962,0.00029829782,0.0009134419,0.0006009979,0.0014742503,0.0018367217,0.0012592011,0.50644094],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000041716525,0.000009453788,0.00009532793,0.00010312746,0.0000053511335,0.00014253701,0.00004435313,0.000076989665,0.00043614415,0.003769669,0.9097905,0.085484825],"study_design_scores_gemma":[0.0000031243942,0.0000051841125,0.00009749125,0.000052010855,0.0000027789283,0.00014706764,0.000030108207,0.0000550045,0.00030016823,0.00091639644,0.99838626,0.000004347156],"about_ca_topic_score_codex":0.0016956773,"about_ca_topic_score_gemma":0.0023144202,"teacher_disagreement_score":0.5495473,"about_ca_system_score_codex":0.0009876969,"about_ca_system_score_gemma":0.0015476629,"threshold_uncertainty_score":0.6425161},"labels":[],"label_agreement":null},{"id":"W2164271181","doi":"10.1109/isit.1991.695086","title":"Demodulation For Intersymbol Interference Channels In The Presence Of Colored Gaussian Noise","year":2005,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Intersymbol interference; Colored; Demodulation; Colors of noise; Interference (communication); Gaussian noise; Computer science; Noise (video); Nyquist ISI criterion; Electronic engineering; Algorithm; Decoding methods; Telecommunications; Channel (broadcasting); Artificial intelligence; White noise; Materials science; Engineering","score_opus":0.02297287791478957,"score_gpt":0.27099758049109235,"score_spread":0.24802470257630277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164271181","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.14073654,0.0009338051,0.8483688,0.00046609403,0.00012807651,0.0000460944,0.00005963175,0.00026894818,0.008991984],"genre_scores_gemma":[0.89839,0.000825417,0.09110579,0.00018320091,0.00009861886,0.000059295682,0.00008398099,0.0000481537,0.009205597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997398,0.00007514587,0.000009540787,0.000035898996,0.00010299649,0.000036631907],"domain_scores_gemma":[0.9993351,0.00042318922,0.000059783517,0.00005103081,0.000111509806,0.000019322066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072343316,0.00036385082,0.00041178547,0.00036163797,0.00035317842,0.00052470586,0.0004538796,0.000772895,0.0011725745],"category_scores_gemma":[0.0027377023,0.0001689349,0.00021527369,0.00040527462,0.00046490497,0.0008962998,0.0004504139,0.00029571852,0.0004618332],"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.00062435603,0.000097631164,0.0020009303,0.00021616362,0.00008094302,0.00095811504,0.00039931433,0.6091591,0.058198623,0.19148098,0.0014674279,0.13531643],"study_design_scores_gemma":[0.000018836816,0.0000334309,0.00031726283,0.000013918952,0.000012866397,0.00020117873,0.000033540276,0.9760803,0.007819025,0.01414035,0.0013159123,0.000013259359],"about_ca_topic_score_codex":0.0010149906,"about_ca_topic_score_gemma":0.0014330804,"teacher_disagreement_score":0.0011725745,"about_ca_system_score_codex":0.00063096016,"about_ca_system_score_gemma":0.00043628865,"threshold_uncertainty_score":0.0045779347},"labels":[],"label_agreement":null},{"id":"W2164670619","doi":"10.3389/neuro.10.020.2009","title":"Geometrical tile design for complex neighborhoods","year":2009,"lang":"en","type":"article","venue":"Frontiers in Computational Neuroscience","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Tile; Rectangle; Square (algebra); Simple (philosophy); Cuboid; Computer science; Geometric shape; Geometry; Von Neumann architecture; Mathematics; Algorithm; Pure mathematics; Geography","score_opus":0.04911912229643655,"score_gpt":0.2919502913458633,"score_spread":0.24283116904942675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164670619","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.11735562,0.00025852135,0.87063676,0.0001262497,0.000060476155,0.000052005293,0.00008053224,0.0002484237,0.011181349],"genre_scores_gemma":[0.72858113,0.00025741785,0.26661098,0.000060042763,0.00002303118,0.00023726637,0.00014292647,0.00010482004,0.0039823945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971384,0.00009858585,0.000020149473,0.000061142804,0.00007151707,0.000034729277],"domain_scores_gemma":[0.9995778,0.00016159457,0.000061795865,0.00009058308,0.0000710523,0.000037153462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034314246,0.0002885341,0.00046135602,0.0003835742,0.0004384732,0.00076379435,0.0005498902,0.0005267589,0.0020270003],"category_scores_gemma":[0.001580937,0.00027401882,0.00054657285,0.00028071075,0.0011123832,0.00071186165,0.0008335619,0.00031056342,0.00035939127],"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.00010414863,0.000017253964,0.0008190065,0.0001166089,0.000018802355,0.00015763348,0.00019866021,0.56988263,0.012876064,0.39137998,0.0010355425,0.023393666],"study_design_scores_gemma":[0.000032395936,0.00008215614,0.00025566912,0.000016201637,0.000011940165,0.00014932232,0.000055610148,0.86778754,0.004121884,0.119285524,0.008182777,0.000018884868],"about_ca_topic_score_codex":0.0006857272,"about_ca_topic_score_gemma":0.00067123625,"teacher_disagreement_score":0.0020270003,"about_ca_system_score_codex":0.00052320707,"about_ca_system_score_gemma":0.0003592469,"threshold_uncertainty_score":0.006780982},"labels":[],"label_agreement":null},{"id":"W2165572529","doi":"10.1515/integ.2011.001","title":"Symmetries in Steinhaus Triangles and in Generalized Pascal Triangles","year":2011,"lang":"en","type":"article","venue":"Integers","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Manitoba","keywords":"Homogeneous space; Pascal (unit); Mathematics; Dihedral group; Binary number; Dihedral angle; Combinatorics; Pure mathematics; Algebra over a field; Geometry; Computer science; Physics; Arithmetic; Group (periodic table)","score_opus":0.03611765041715627,"score_gpt":0.23430391391035202,"score_spread":0.19818626349319574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165572529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54918087,0.0003265212,0.29507765,0.0005812582,0.00038063742,0.00021519644,0.00033217756,0.00057947676,0.15332611],"genre_scores_gemma":[0.91371715,0.00020840007,0.06799333,0.00015785686,0.00005398148,0.000100104044,0.00017807359,0.0001391393,0.017451813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995865,0.000074398435,0.000028080314,0.000051010753,0.00015924474,0.00010070083],"domain_scores_gemma":[0.9996474,0.00009866451,0.00004717696,0.00007316323,0.00008669776,0.000046807323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034061406,0.00024599116,0.00029134535,0.0006946662,0.0009362649,0.0012145627,0.0005154381,0.0005689877,0.010939655],"category_scores_gemma":[0.0016752628,0.00019931517,0.0003842571,0.0006724105,0.0012529924,0.00159548,0.00090026134,0.00067493337,0.0012511951],"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.000023538205,0.000010857452,0.0001405412,0.00002908502,0.0000014501475,0.000095176765,0.00012605434,0.0022589727,0.003216664,0.97890866,0.0006214668,0.014567483],"study_design_scores_gemma":[0.000033522883,0.000054692806,0.0002723405,0.000020378313,0.0000056936447,0.00026857352,0.0002502538,0.023567466,0.011307987,0.94913745,0.015058556,0.000023008935],"about_ca_topic_score_codex":0.0006923335,"about_ca_topic_score_gemma":0.0011190573,"teacher_disagreement_score":0.010939655,"about_ca_system_score_codex":0.0005128662,"about_ca_system_score_gemma":0.00036191818,"threshold_uncertainty_score":0.036596775},"labels":[],"label_agreement":null},{"id":"W2167740932","doi":"10.1109/isit.1991.695254","title":"On The Rate Of Growth Of The Incorrect Paths Of Convolutional Codes","year":2005,"lang":"en","type":"article","venue":"","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":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Computer science; Algorithm; Decoding methods","score_opus":0.009970770383484491,"score_gpt":0.21008910341762535,"score_spread":0.20011833303414087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167740932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6973751,0.0036650104,0.2705112,0.0066984277,0.0004565156,0.00013191614,0.0017974452,0.0013115428,0.018052889],"genre_scores_gemma":[0.97222084,0.0020048257,0.018028893,0.00030242835,0.00020687922,0.00017554245,0.00066678465,0.0005736143,0.0058201156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979977,0.00070691895,0.00011096747,0.00030266293,0.0005192969,0.00036240253],"domain_scores_gemma":[0.85343415,0.12437469,0.0060373824,0.0051617674,0.008504355,0.0024877295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055943904,0.0014047045,0.0014534717,0.0036110447,0.0015603475,0.00315311,0.0029099914,0.0033469733,0.0049390723],"category_scores_gemma":[0.11327715,0.001368007,0.0008752976,0.0018299574,0.003858172,0.006354113,0.0033401707,0.004271681,0.00060176227],"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.0006808219,0.00007903552,0.009173036,0.0005225721,0.00010195439,0.0006139607,0.00092107244,0.4080896,0.011745446,0.52982765,0.0056057842,0.032638993],"study_design_scores_gemma":[0.00003872074,0.000054091463,0.0012866679,0.00009201672,0.00004700606,0.0003924315,0.000104565355,0.8361202,0.004757333,0.15613255,0.0009010462,0.00007343577],"about_ca_topic_score_codex":0.0048048683,"about_ca_topic_score_gemma":0.0037617183,"teacher_disagreement_score":0.0055943904,"about_ca_system_score_codex":0.003000997,"about_ca_system_score_gemma":0.0017846591,"threshold_uncertainty_score":0.029586315},"labels":[],"label_agreement":null},{"id":"W2167957330","doi":"10.5555/1516744.1516892","title":"Vesicle-synapsin interactions modeled with Cell-DEVS","year":2008,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Synapsin; Vesicle; Synapsin I; Synaptic vesicle; Cellular automaton; Vesicle fusion; Computer science; Biophysics; Chemistry; Cell biology; Biological system; Biology; Artificial intelligence; Biochemistry; Membrane","score_opus":0.041349015096629194,"score_gpt":0.2569032669288688,"score_spread":0.21555425183223959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167957330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.659153,0.00042337566,0.29881212,0.00073445786,0.00026648687,0.00015724344,0.0016815556,0.00074385636,0.038027965],"genre_scores_gemma":[0.96657026,0.00019075951,0.025104636,0.000059051607,0.00002073739,0.00016498425,0.00030835287,0.000053295953,0.007527896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997985,0.000039853134,0.00001323797,0.000036370326,0.000060944276,0.000051126728],"domain_scores_gemma":[0.9995578,0.00020106704,0.00006981324,0.000045471952,0.000072959854,0.000052920102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040079822,0.00042446237,0.0009833135,0.0005231717,0.0006929556,0.00079947314,0.0014728913,0.0012220728,0.0030488202],"category_scores_gemma":[0.0009561749,0.00043406265,0.0009536262,0.0006350254,0.0008808064,0.00080850604,0.0008327501,0.0009460669,0.0003515718],"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.000030709536,0.000031447744,0.00058989413,0.000021036303,0.000014370638,0.00015256213,0.00006569586,0.96395177,0.00236718,0.030850723,0.00025786375,0.0016667817],"study_design_scores_gemma":[0.000012677933,0.000008965814,0.00007898654,0.0000018022561,0.0000031817065,0.000010030172,0.000008128011,0.9963082,0.00045248217,0.0026475273,0.00046385324,0.000004252854],"about_ca_topic_score_codex":0.017307539,"about_ca_topic_score_gemma":0.012916514,"teacher_disagreement_score":0.017307539,"about_ca_system_score_codex":0.001487067,"about_ca_system_score_gemma":0.0010698452,"threshold_uncertainty_score":0.034413636},"labels":[],"label_agreement":null},{"id":"W2168766289","doi":"10.25088/complexsystems.15.1.41","title":"Point Mutations and Transitions Between Cellular Automata Attractor Basins","year":2004,"lang":"en","type":"article","venue":"Complex Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"Santa Fe Institute; Natural Sciences and Engineering Research Council of Canada; Athabasca University","keywords":"Attractor; Cellular automaton; Automaton; Computer science; Point mutation; Point (geometry); Statistical physics; Theoretical computer science; Mutation; Mathematics; Biology; Artificial intelligence; Physics; Genetics; Mathematical analysis; Geometry; Gene","score_opus":0.041193061659002696,"score_gpt":0.25560014082285565,"score_spread":0.21440707916385296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168766289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8388824,0.00035550212,0.1460281,0.00028118136,0.000042082524,0.00006329981,0.00008378668,0.00035475215,0.013908965],"genre_scores_gemma":[0.9903716,0.00009190693,0.008121266,0.000020017875,0.000009950439,0.000043329383,0.000031744625,0.000025433652,0.0012849022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996214,0.000117545365,0.000023176448,0.00006984446,0.00011287099,0.000055226334],"domain_scores_gemma":[0.9989593,0.00054602436,0.00017978177,0.00008496373,0.00012496674,0.000104978346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030339195,0.00023255529,0.0003483071,0.0010125996,0.0008277242,0.0012658922,0.0003986531,0.0004918058,0.0026249292],"category_scores_gemma":[0.0035286509,0.00025741622,0.00035565282,0.00046216586,0.0013989926,0.001147928,0.0009760304,0.0005493708,0.00023673184],"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.00013734239,0.00005706161,0.002127005,0.000059896964,0.00004380217,0.00059671275,0.0008509431,0.1208873,0.03407766,0.81565374,0.0008541486,0.024654295],"study_design_scores_gemma":[0.000047355432,0.0000847144,0.0015825505,0.000018623485,0.000017686321,0.00027325546,0.00022161509,0.35269672,0.0072523463,0.6350119,0.002758389,0.000034756373],"about_ca_topic_score_codex":0.00089656847,"about_ca_topic_score_gemma":0.0006179614,"teacher_disagreement_score":0.0026249292,"about_ca_system_score_codex":0.0006341466,"about_ca_system_score_gemma":0.00037978368,"threshold_uncertainty_score":0.008781254},"labels":[],"label_agreement":null},{"id":"W2168786663","doi":"10.1109/arith.1991.145539","title":"Small moduli replications in the MRRNS","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Residue number system; Adder; Moduli; Scaling; Very-large-scale integration; Superposition principle; Embedding; Multiplier (economics); Computer science; Pipeline (software); Parallel computing; Fast Fourier transform; Algorithm; Coprime integers; Binary number; Waveform; Modulo; Arithmetic; Mathematics; Discrete mathematics; Embedded system; Artificial intelligence; Physics","score_opus":0.06581051593567541,"score_gpt":0.22892254975283435,"score_spread":0.16311203381715894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168786663","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.20013487,0.0009130863,0.7555163,0.00055208284,0.0003552447,0.00021613692,0.00009442718,0.0028471674,0.039370753],"genre_scores_gemma":[0.5869288,0.0003455801,0.3960836,0.00015848404,0.00007385791,0.00010339766,0.00009750259,0.00023623445,0.015972596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999726,0.00005659796,0.00002036897,0.00006929622,0.000104048864,0.00002371669],"domain_scores_gemma":[0.99955434,0.00013664435,0.000054301712,0.0001829201,0.00005311377,0.000018627288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032128644,0.0002732927,0.00024718573,0.0003291982,0.00037078245,0.0007060879,0.0007170823,0.00025100124,0.005520297],"category_scores_gemma":[0.0011052302,0.00020698593,0.000238246,0.00025991545,0.00073815096,0.0016157827,0.00059439725,0.0004282366,0.0014414232],"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.00029338116,0.000101312486,0.00081227697,0.00016242672,0.00001952029,0.00049754884,0.00040678564,0.0332275,0.15610006,0.58477926,0.0030261197,0.2205738],"study_design_scores_gemma":[0.00012575126,0.00071418175,0.0006896136,0.00006284215,0.000038199567,0.001325281,0.0001612413,0.38540912,0.30954596,0.19228007,0.10954788,0.00009995195],"about_ca_topic_score_codex":0.00025078192,"about_ca_topic_score_gemma":0.00045767266,"teacher_disagreement_score":0.005520297,"about_ca_system_score_codex":0.00030927753,"about_ca_system_score_gemma":0.0003134311,"threshold_uncertainty_score":0.018467188},"labels":[],"label_agreement":null},{"id":"W2170239970","doi":"10.1109/cwit.2009.5069528","title":"Capacity of constrained sequence codes modelled by two-dimensional finite state machines with nearest-neighbour connections","year":2009,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sequence (biology); Constraint (computer-aided design); Dimension (graph theory); Eigenvalues and eigenvectors; Computer science; Code (set theory); Set (abstract data type); Finite-state machine; State (computer science); Connection (principal bundle); Theoretical computer science; Algorithm; Matrix (chemical analysis); Mathematics","score_opus":0.01968770177402834,"score_gpt":0.24522740506883586,"score_spread":0.22553970329480752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170239970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6144558,0.0004952539,0.37091216,0.00032688546,0.000058655427,0.00008095275,0.0004144071,0.00046370694,0.0127920965],"genre_scores_gemma":[0.9843987,0.0001250924,0.014179442,0.00002917479,0.000012922872,0.00011267654,0.00014173338,0.000039652405,0.0009604626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987692,0.00040273817,0.000082941384,0.00016068871,0.0003932373,0.00019112398],"domain_scores_gemma":[0.99211276,0.0056009823,0.0006546516,0.0008394089,0.00061501085,0.0001772546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009447217,0.00068768207,0.000813243,0.0008894671,0.0005507953,0.0012074916,0.0009948963,0.0012374541,0.002760799],"category_scores_gemma":[0.008877479,0.00040543405,0.00049856317,0.00084274635,0.0016794357,0.003061949,0.0011180792,0.00083555514,0.00031922976],"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.00010270413,0.00003085323,0.00029192577,0.00005625436,0.000016796186,0.00008892414,0.00006496981,0.92680496,0.004875379,0.0646001,0.0001766408,0.0028905696],"study_design_scores_gemma":[0.000008193747,0.000029083814,0.00008936976,0.0000094704765,0.000003508661,0.000023962031,0.000018094426,0.96797884,0.002518015,0.029071262,0.00023337353,0.000016833592],"about_ca_topic_score_codex":0.0037196286,"about_ca_topic_score_gemma":0.002777164,"teacher_disagreement_score":0.0037196286,"about_ca_system_score_codex":0.0013330652,"about_ca_system_score_gemma":0.0010777946,"threshold_uncertainty_score":0.009672046},"labels":[],"label_agreement":null},{"id":"W2170727983","doi":"10.1109/aps.1994.407735","title":"Cellular automata as a new computational approach to modelling electromagnetic phenomena","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cellular automaton; Automaton; Binary number; Continuous spatial automaton; Stochastic cellular automaton; Mobile automaton; Computer science; Quantum finite automata; Lattice gas automaton; Quantum cellular automaton; Theoretical computer science; Algorithm; Lattice (music); Discrete mathematics; Mathematics; Automata theory; Physics; Arithmetic","score_opus":0.027646160566268764,"score_gpt":0.21428957132367885,"score_spread":0.1866434107574101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170727983","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.004341848,0.011865482,0.95107585,0.0013582361,0.0008541794,0.00008397441,0.00032950006,0.00080710085,0.029283889],"genre_scores_gemma":[0.21424131,0.030754514,0.7258964,0.0011594839,0.0018953029,0.00050956855,0.0008737246,0.0004650087,0.024204586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998985,0.00028984094,0.00008133315,0.00020381912,0.0003566383,0.000083298924],"domain_scores_gemma":[0.99920696,0.00039229845,0.00007994889,0.00014459461,0.00013236594,0.000043944325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072422065,0.0015217738,0.0018664455,0.001812475,0.0010189645,0.0040052817,0.0024830136,0.0024644907,0.0030893367],"category_scores_gemma":[0.0021149092,0.00073351205,0.0021680158,0.0023241309,0.0029455074,0.004717769,0.0021571203,0.0027679142,0.0013263557],"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.000012687651,0.000016580547,0.00028715373,0.00017299173,0.000060077775,0.00018369078,0.00016867653,0.06677312,0.0017659937,0.9083006,0.0025315743,0.019726925],"study_design_scores_gemma":[0.000017503366,0.000042344924,0.00013781861,0.00010453359,0.00005619836,0.00028423968,0.00009128683,0.1903872,0.0014336008,0.69386995,0.113527656,0.00004770421],"about_ca_topic_score_codex":0.0050248033,"about_ca_topic_score_gemma":0.0049403193,"teacher_disagreement_score":0.0050248033,"about_ca_system_score_codex":0.0016815453,"about_ca_system_score_gemma":0.001742331,"threshold_uncertainty_score":0.012200594},"labels":[],"label_agreement":null},{"id":"W2172098253","doi":"10.1007/s00024-014-0843-6","title":"Spatial Heterogeneity in Earthquake Fault-Like Systems","year":2014,"lang":"en","type":"article","venue":"Pure and Applied Geophysics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Asperity (geotechnical engineering); Cellular automaton; Fault (geology); San andreas fault; Stress (linguistics); Spatial variability","score_opus":0.007877395013855377,"score_gpt":0.20484725014083954,"score_spread":0.19696985512698417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172098253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90685743,0.0007767736,0.08688942,0.0008239075,0.000038402195,0.000020241669,0.00025019702,0.00015103286,0.004192534],"genre_scores_gemma":[0.99880826,0.00010349555,0.0005870198,0.00001283423,0.000015155046,0.000006334836,0.00003854503,0.000006150553,0.00042217423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997874,0.00006374676,0.000014990094,0.00005125783,0.00003684622,0.000045730918],"domain_scores_gemma":[0.99618405,0.0024838124,0.0006195054,0.00021167897,0.00026324508,0.00023760903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053861795,0.00024496554,0.0006562155,0.0010300959,0.000476265,0.0013221313,0.0007520312,0.0008829907,0.0012389366],"category_scores_gemma":[0.0049798544,0.0003962581,0.0003743386,0.00065630995,0.0011973844,0.0014632905,0.00078457623,0.0004970133,0.000115635165],"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.000113278504,0.00005529311,0.017327314,0.00010272504,0.000089872476,0.00048040424,0.00028669444,0.77284694,0.004603806,0.19585893,0.0011284555,0.0071063945],"study_design_scores_gemma":[0.000011909843,0.000015855616,0.003773341,0.0000066277325,0.000014401638,0.000066980894,0.00008249271,0.9294599,0.00021927991,0.06613366,0.00020180063,0.00001377845],"about_ca_topic_score_codex":0.005131844,"about_ca_topic_score_gemma":0.0037113342,"teacher_disagreement_score":0.005131844,"about_ca_system_score_codex":0.00084403576,"about_ca_system_score_gemma":0.0003712727,"threshold_uncertainty_score":0.010203958},"labels":[],"label_agreement":null},{"id":"W2183250258","doi":"10.1007/s11047-015-9521-6","title":"Local structure approximation as a predictor of second-order phase transitions in asynchronous cellular automata","year":2015,"lang":"en","type":"article","venue":"Natural Computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Directed percolation; Statistical physics; Cellular automaton; Phase transition; Theory of computation; Mathematics; Percolation (cognitive psychology); Critical exponent; Computer science; Physics; Algorithm; Quantum mechanics","score_opus":0.011551925867727379,"score_gpt":0.2612157051740527,"score_spread":0.2496637793063253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183250258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6370847,0.00043834504,0.35798997,0.0005722126,0.00010872557,0.00003009294,0.000113430375,0.0006463237,0.003016115],"genre_scores_gemma":[0.9921685,0.00007061594,0.006697587,0.00003409622,0.000016552862,0.000017100505,0.000050270668,0.000042202108,0.000903094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998412,0.00005890792,0.0000055703135,0.00003187539,0.000029220917,0.000033180866],"domain_scores_gemma":[0.9956375,0.0033419875,0.00031365425,0.00017437454,0.00030945538,0.00022307906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009492872,0.00030796614,0.00077097793,0.0007100195,0.0005633219,0.0009724786,0.00090622116,0.0010245709,0.0018398646],"category_scores_gemma":[0.0068425043,0.00037419779,0.00035740787,0.00033582348,0.0011350055,0.0011851591,0.0007625816,0.001376958,0.00020110693],"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.00018458541,0.00008942156,0.004578273,0.00007438583,0.000033687393,0.000109172135,0.00017660663,0.90643203,0.004480063,0.07411906,0.00076424965,0.008958435],"study_design_scores_gemma":[0.0000021583571,0.00000459399,0.00009732302,0.0000017589842,0.0000013883986,0.000002788597,0.000003357005,0.9957295,0.00015337745,0.003981298,0.000020586323,0.0000018163892],"about_ca_topic_score_codex":0.0038210538,"about_ca_topic_score_gemma":0.004272738,"teacher_disagreement_score":0.0038210538,"about_ca_system_score_codex":0.0008042391,"about_ca_system_score_gemma":0.0007110199,"threshold_uncertainty_score":0.0075976253},"labels":[],"label_agreement":null},{"id":"W2197677717","doi":"10.1007/s00233-017-9858-5","title":"Inverse semigroup shifts over countable alphabets","year":2017,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"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 Ottawa","funders":"","keywords":"Inverse semigroup; Semigroup; Inverse; Countable set; Inverse element; Bicyclic semigroup; Cancellative semigroup; Special classes of semigroups; Second-countable space","score_opus":0.012814797278585954,"score_gpt":0.25825539402575964,"score_spread":0.2454405967471737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2197677717","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.2733715,0.001390894,0.61522365,0.0020477911,0.0015823047,0.00012035662,0.00044443982,0.0015844044,0.104234695],"genre_scores_gemma":[0.87840766,0.000719835,0.06412359,0.0004254855,0.00069526694,0.00016398921,0.0002713158,0.0003387078,0.05485405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869776,0.00025903282,0.00009390927,0.00041277643,0.00029027095,0.00024622527],"domain_scores_gemma":[0.99715316,0.0013563944,0.00016329734,0.00051513547,0.00046535325,0.00034662551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010249106,0.000506791,0.0006500788,0.0017321883,0.0019676688,0.002846796,0.00079098705,0.0012843601,0.013068614],"category_scores_gemma":[0.004366255,0.00043298115,0.0010508858,0.00082642416,0.0023982807,0.0056773196,0.0024097736,0.0017074262,0.0025548805],"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.00008368029,0.000030414525,0.00013986039,0.00003788226,0.0000050624303,0.0002024168,0.00062057,0.0004875713,0.0043515065,0.9794627,0.0009818422,0.013596545],"study_design_scores_gemma":[0.000025700941,0.000045893365,0.00016594338,0.000018986411,0.0000124603,0.00037884965,0.00022796226,0.0048115836,0.0065919897,0.97329324,0.014400447,0.000026976899],"about_ca_topic_score_codex":0.00045013963,"about_ca_topic_score_gemma":0.00035668066,"teacher_disagreement_score":0.013068614,"about_ca_system_score_codex":0.0007942856,"about_ca_system_score_gemma":0.0006595502,"threshold_uncertainty_score":0.043718874},"labels":[],"label_agreement":null},{"id":"W2198861419","doi":"","title":"Emergence and induction of cellular automata rules via probabilistic reinforcement paradigms: Research Articles","year":2006,"lang":"en","type":"article","venue":"Complexity","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Computer science; Probabilistic logic; Simple (philosophy); Process (computing); Cellular automaton; Automaton; Class (philosophy); Noise (video); Selection (genetic algorithm); Binary number; Algorithm; Theoretical computer science; Stochastic process; Artificial intelligence; Mathematics; Statistics; Arithmetic","score_opus":0.10517616540378266,"score_gpt":0.3149025345211712,"score_spread":0.2097263691173885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198861419","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.05675052,0.0040669073,0.90915936,0.0038263581,0.00022601226,0.00008328159,0.00009617005,0.00036866238,0.025422815],"genre_scores_gemma":[0.81705916,0.0042794603,0.16964433,0.00046618748,0.00043914083,0.0001994735,0.00017706011,0.00012923838,0.0076059704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888915,0.00042748035,0.000060394155,0.00023219748,0.00032326492,0.00006755405],"domain_scores_gemma":[0.9943463,0.004134118,0.0003963246,0.0005783534,0.00041374014,0.00013117534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015927447,0.0003873941,0.00044332683,0.000664145,0.0005015277,0.0016738431,0.0009997698,0.0011441839,0.0021803],"category_scores_gemma":[0.0091077695,0.0003518952,0.0008106997,0.00068540283,0.0028446973,0.0028104847,0.0010717037,0.0017639098,0.00045892035],"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.00003886997,0.000063895466,0.0018576832,0.0002132841,0.000043420107,0.00013724665,0.00041490773,0.07931466,0.0024506126,0.8320725,0.0019748982,0.08141797],"study_design_scores_gemma":[0.00001871983,0.000037235503,0.00065188477,0.000048449892,0.000013255246,0.00012596103,0.000064600565,0.26586413,0.0017816108,0.7200478,0.011321924,0.000024456904],"about_ca_topic_score_codex":0.0012042101,"about_ca_topic_score_gemma":0.0008624648,"teacher_disagreement_score":0.0021803,"about_ca_system_score_codex":0.0013159098,"about_ca_system_score_gemma":0.00079578,"threshold_uncertainty_score":0.009547591},"labels":[],"label_agreement":null},{"id":"W2229065737","doi":"10.5555/2874916.2874943","title":"CAEDISI: a cellular automata editor and simulator for network decontamination","year":2015,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Human decontamination; Automaton; Set (abstract data type); Usability; Cellular automaton; Software; Component (thermodynamics); Distributed computing; On the fly; The Internet; Node (physics); Theoretical computer science; Operating system; Programming language; Algorithm; Engineering","score_opus":0.018550086263293086,"score_gpt":0.24976100838336446,"score_spread":0.23121092212007138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2229065737","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010189893,0.0002325402,0.9573414,0.00020623405,0.00023768518,0.00024362358,0.0017633465,0.021638267,0.008147048],"genre_scores_gemma":[0.22061996,0.0008227175,0.7520768,0.00030205172,0.00009069077,0.0014184746,0.0040668594,0.0031144288,0.017488107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996823,0.00007577423,0.00003370102,0.00006295921,0.00011444219,0.000030827385],"domain_scores_gemma":[0.9990509,0.0005450615,0.000052095485,0.00013708197,0.00015326632,0.00006157098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005385656,0.00095588894,0.0008057649,0.0006302807,0.00040945347,0.0011442864,0.0022371174,0.0012414113,0.011131115],"category_scores_gemma":[0.0022881092,0.00042845897,0.0008696959,0.0003686146,0.00039845592,0.0008042986,0.00089392293,0.0014412475,0.00207756],"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.00045768535,0.0003099021,0.003954537,0.0010085541,0.00017701097,0.0010736018,0.00053506135,0.7635391,0.027133252,0.05916673,0.03497275,0.107671924],"study_design_scores_gemma":[0.00006951016,0.00004452317,0.00013567442,0.000031913518,0.00003153753,0.0001515597,0.000017897848,0.9367257,0.00917873,0.0059416285,0.047649533,0.000021763291],"about_ca_topic_score_codex":0.0025661942,"about_ca_topic_score_gemma":0.0025308742,"teacher_disagreement_score":0.011131115,"about_ca_system_score_codex":0.00048644596,"about_ca_system_score_gemma":0.0010892749,"threshold_uncertainty_score":0.037237287},"labels":[],"label_agreement":null},{"id":"W2276790057","doi":"10.1049/iet-com.2015.0009","title":"Generation of balanced quadrature phase shift keyed sequences through guided scrambling","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scrambling; Phase-shift keying; Algorithm; Computer science; Mathematics; Decoding methods; Bit error rate","score_opus":0.2672783527815267,"score_gpt":0.4054042682871345,"score_spread":0.13812591550560782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276790057","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.34697947,0.0004721067,0.6369243,0.00024003159,0.00010052968,0.00011711042,0.000085787746,0.0006057029,0.0144749805],"genre_scores_gemma":[0.89193535,0.00020860322,0.10532846,0.000042441832,0.000009328515,0.000045893976,0.000066448185,0.000030093124,0.0023333705],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983346,0.00003856186,0.000011126115,0.00002476194,0.00006287201,0.000029291252],"domain_scores_gemma":[0.99963,0.00013172481,0.000081141,0.000054071148,0.000080472324,0.000022669232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019516768,0.00030325574,0.00022263617,0.00031907883,0.0001875469,0.0003815879,0.00031359223,0.0002238855,0.00068875507],"category_scores_gemma":[0.00087680796,0.00012690912,0.00016352207,0.00017086252,0.00039379194,0.00032440588,0.00044263218,0.00017239853,0.00035316983],"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.0003140817,0.00007928454,0.001069976,0.00022974332,0.000022865219,0.00048296273,0.0004256071,0.08272183,0.6356632,0.16176915,0.0011887216,0.11603258],"study_design_scores_gemma":[0.000086375,0.0005035356,0.0006261811,0.00003685203,0.000024035895,0.00043314093,0.00008946171,0.52089685,0.43228325,0.027620899,0.017344702,0.00005473881],"about_ca_topic_score_codex":0.00029994588,"about_ca_topic_score_gemma":0.00038943547,"teacher_disagreement_score":0.00068875507,"about_ca_system_score_codex":0.0002671115,"about_ca_system_score_gemma":0.0002513056,"threshold_uncertainty_score":0.0023041368},"labels":[],"label_agreement":null},{"id":"W2284354567","doi":"10.46298/dmtcs.2972","title":"Orbits of the Bernoulli measure in single-transition asynchronous cellular automata","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Bernoulli's principle; Measure (data warehouse); Mathematics; Cellular automaton; Bernoulli scheme; Binary number; Asynchronous communication; Stochastic cellular automaton; Orbit (dynamics); Automaton; Statistical physics; Combinatorics; Algorithm; Physics; Computer science; Theoretical computer science","score_opus":0.01841264001235938,"score_gpt":0.22390970690966802,"score_spread":0.20549706689730865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284354567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81176716,0.00029491083,0.18013346,0.00015703787,0.000045335033,0.00003910637,0.000060862116,0.00017068455,0.007331484],"genre_scores_gemma":[0.9846646,0.00011446057,0.013514086,0.000019201516,0.000022203778,0.000041421754,0.0000387628,0.000032248037,0.0015530293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996131,0.00010291197,0.000023500495,0.000055234676,0.00012128005,0.00008396746],"domain_scores_gemma":[0.9980685,0.0010829265,0.00029641725,0.00015205696,0.00016847487,0.00023163088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007280209,0.00031625625,0.00063645595,0.0008539618,0.0008805002,0.0013547171,0.0009867427,0.0007492726,0.0015688272],"category_scores_gemma":[0.0039400007,0.00029046476,0.000659093,0.00040336963,0.002113902,0.0014008358,0.00084058533,0.0007981467,0.00019847883],"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.00012696777,0.00005154777,0.0021206713,0.000051291452,0.00002428349,0.00026923371,0.00039753184,0.35178065,0.006998633,0.6327818,0.00031957895,0.005077784],"study_design_scores_gemma":[0.00001231062,0.000024025798,0.00033501623,0.000008973342,0.0000056194567,0.000038105492,0.000032085594,0.8820239,0.0012319623,0.11601725,0.0002537658,0.000017046576],"about_ca_topic_score_codex":0.0036827773,"about_ca_topic_score_gemma":0.002046572,"teacher_disagreement_score":0.0036827773,"about_ca_system_score_codex":0.0012365475,"about_ca_system_score_gemma":0.0006476031,"threshold_uncertainty_score":0.00897181},"labels":[],"label_agreement":null},{"id":"W2322369905","doi":"10.1177/171516350714000229","title":"Keep Travel Times in Mind When Dispensing Twinrix","year":2007,"lang":"en","type":"article","venue":"Canadian Pharmacists Journal / Revue des Pharmaciens du Canada","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Business; Psychology","score_opus":0.02366381452419377,"score_gpt":0.2545138460138346,"score_spread":0.2308500314896408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322369905","genre_codex":"empirical","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6707206,0.011955637,0.078590505,0.062838964,0.0076480214,0.0006697377,0.0026615707,0.0038484805,0.16106655],"genre_scores_gemma":[0.9244174,0.0031940576,0.03205886,0.0044056643,0.0007980995,0.00012423424,0.0006433234,0.0004363189,0.033922188],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99697137,0.00091867143,0.00027578548,0.0002540003,0.0012278444,0.00035241927],"domain_scores_gemma":[0.99252725,0.002916259,0.0009972089,0.00033914653,0.0021224725,0.0010976266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017479113,0.00051869714,0.0006437574,0.0010481317,0.0018796265,0.0026445817,0.0011136667,0.0015434074,0.013075152],"category_scores_gemma":[0.022629127,0.00040692787,0.00060846144,0.00093401567,0.00050445466,0.0017943197,0.00095901656,0.0020448635,0.003450571],"study_design_candidate":"not_applicable","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.005716249,0.0005443754,0.08931229,0.0009963408,0.00036675602,0.0025794802,0.0035076179,0.00471737,0.010006602,0.0030890184,0.08489995,0.794264],"study_design_scores_gemma":[0.00067859166,0.003549532,0.29870155,0.0018261253,0.0016152774,0.013304153,0.037796,0.058475032,0.051703468,0.02118388,0.51011884,0.001047517],"about_ca_topic_score_codex":0.03970212,"about_ca_topic_score_gemma":0.06736255,"teacher_disagreement_score":0.03970212,"about_ca_system_score_codex":0.0017070255,"about_ca_system_score_gemma":0.0031684043,"threshold_uncertainty_score":0.07894206},"labels":[],"label_agreement":null},{"id":"W2329992705","doi":"","title":"Evaluation of dissipation within an ILGA for computational electromagnetics: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Numerical Modelling Electronic Networks Devices and Fields","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Communications Research Centre Canada; University of Manitoba; Defence Research and Development Canada","funders":"","keywords":"Dissipation; Massively parallel; Dispersion relation; Computer science; Isotropy; Electromagnetics; Computer simulation; Computational science; Statistical physics; Applied mathematics; Physics; Mathematics; Parallel computing; Simulation; Optics; Quantum mechanics","score_opus":0.06908437685457729,"score_gpt":0.36330066771910247,"score_spread":0.29421629086452517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329992705","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.13108769,0.000611924,0.8581274,0.00061499665,0.00009413204,0.000087444,0.000057334593,0.00040679023,0.0089124],"genre_scores_gemma":[0.7599922,0.0003283211,0.23586234,0.00010046313,0.000026113294,0.00011831525,0.000072627474,0.00016001474,0.003339661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994355,0.00025114662,0.000023392398,0.000052207964,0.00018800057,0.000049816903],"domain_scores_gemma":[0.997221,0.0020004648,0.00017604906,0.00023192778,0.00029143383,0.00007911419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427625,0.0005945298,0.0005952002,0.0005768352,0.0005170023,0.0015235186,0.0006611355,0.0008012628,0.0021286388],"category_scores_gemma":[0.006534165,0.00022309835,0.00032090224,0.00040145466,0.0010809349,0.0014015003,0.0007505314,0.0010214102,0.00021961056],"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.00006201552,0.00005689013,0.0013072732,0.000068817564,0.00002009547,0.000044289645,0.00007102889,0.9489719,0.0028840594,0.027618714,0.00030963196,0.018585237],"study_design_scores_gemma":[0.0000023380044,0.00001293812,0.000047130652,0.000004131306,0.0000020638324,0.0000052891282,0.0000053416084,0.99563074,0.0005937552,0.0034582033,0.00023633723,0.0000018078932],"about_ca_topic_score_codex":0.0017201564,"about_ca_topic_score_gemma":0.0015234019,"teacher_disagreement_score":0.0021286388,"about_ca_system_score_codex":0.0011693136,"about_ca_system_score_gemma":0.0007298242,"threshold_uncertainty_score":0.008483946},"labels":[],"label_agreement":null},{"id":"W2342581660","doi":"10.4169/math.mag.89.1.16","title":"Transposition as a Permutation: A Tale of Group Actions and Modular Arithmetic","year":2016,"lang":"en","type":"article","venue":"Mathematics Magazine","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Permutation matrix; Combinatorics; Multiplicative group; Permutation group; Group (periodic table); Multiplicative function; Arithmetic; Chinese remainder theorem; Modulo; Permutation (music); Transposition (logic); Symmetric group; Cyclic permutation; Matrix (chemical analysis); Prime (order theory); Discrete mathematics","score_opus":0.012848896943254808,"score_gpt":0.23930493096129696,"score_spread":0.22645603401804215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342581660","genre_codex":"other","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.08146266,0.017323773,0.217662,0.10716234,0.005173287,0.000083062834,0.00018864285,0.0008538053,0.5700905],"genre_scores_gemma":[0.84205633,0.007532977,0.069430776,0.0056790276,0.002636676,0.00012506389,0.00009411911,0.00033369652,0.07211129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994715,0.00025337833,0.000022445049,0.000072675364,0.00012235844,0.00005767574],"domain_scores_gemma":[0.9992969,0.00034420184,0.000038036353,0.00015746307,0.000091076414,0.00007227406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013880307,0.00030737917,0.0002600706,0.0008974556,0.001895956,0.00350246,0.0005626158,0.0009958622,0.0058874176],"category_scores_gemma":[0.002652348,0.000212389,0.00047102998,0.0006280402,0.008759747,0.0071868026,0.001662246,0.0024216718,0.00096136535],"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.000006680914,0.0000041009343,0.00003397566,0.0000069307393,0.000001903659,0.000028564406,0.00029459404,0.0004133599,0.0001480603,0.9915759,0.0025633557,0.004922464],"study_design_scores_gemma":[0.0000038143946,0.000005719721,0.000035452136,0.000008695953,0.0000012061919,0.000022431166,0.00009396906,0.0010116441,0.00011537984,0.98141414,0.01728288,0.0000046856594],"about_ca_topic_score_codex":0.0014945292,"about_ca_topic_score_gemma":0.0015683583,"teacher_disagreement_score":0.0058874176,"about_ca_system_score_codex":0.0015158368,"about_ca_system_score_gemma":0.0007249242,"threshold_uncertainty_score":0.019695401},"labels":[],"label_agreement":null},{"id":"W2343780273","doi":"10.5506/aphyspolbsupp.9.13","title":"Rescalable, Replayable Maps Generated with Evolved Cellular Automata","year":2016,"lang":"en","type":"article","venue":"Acta Physica Polonica B Proceedings Supplement","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Cellular automaton; Computer science; Biology; Computational biology; Evolutionary biology; Artificial intelligence","score_opus":0.01073902230694768,"score_gpt":0.21960315420277857,"score_spread":0.2088641318958309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343780273","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.3963713,0.00014781859,0.5860141,0.00024387718,0.00011570204,0.00007664347,0.00022367094,0.0011790042,0.015627837],"genre_scores_gemma":[0.90018743,0.00009604017,0.093943335,0.00003912176,0.000009439428,0.000077749595,0.00018494438,0.00013071392,0.005331285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998857,0.000027404883,0.0000074645063,0.00003113998,0.000032286473,0.000015983876],"domain_scores_gemma":[0.9995901,0.00016070518,0.000036436653,0.00011246979,0.000075277625,0.000024971807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021078115,0.00031982776,0.00034223846,0.0004394276,0.0002601135,0.00083393045,0.00061221083,0.00048944686,0.0020258192],"category_scores_gemma":[0.0019404007,0.00020630698,0.0005548066,0.0002899761,0.0005381702,0.00058900163,0.0006530729,0.00045218243,0.00028747504],"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.00007553674,0.000036609097,0.0011038983,0.00006130671,0.00003551437,0.00046231918,0.000271568,0.8762809,0.024186766,0.06947345,0.000866282,0.027145972],"study_design_scores_gemma":[0.0000090226395,0.000018958845,0.00021968465,0.000005152086,0.0000084869125,0.00005548843,0.000026896707,0.98290306,0.0032346523,0.012327788,0.0011809646,0.000009809947],"about_ca_topic_score_codex":0.0014463245,"about_ca_topic_score_gemma":0.0010043193,"teacher_disagreement_score":0.0020258192,"about_ca_system_score_codex":0.0005930668,"about_ca_system_score_gemma":0.00023335357,"threshold_uncertainty_score":0.006777048},"labels":[],"label_agreement":null},{"id":"W2346417716","doi":"10.1177/0037549715611485","title":"Modelling and simulation of complex cellular models using Cell-DEVS","year":2015,"lang":"en","type":"article","venue":"SIMULATION","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cellular automaton; Executable; DEVS; Computer science; Formalism (music); Complex system; Discrete event simulation; Theoretical computer science; Automaton; Distributed computing; Modeling and simulation; Algorithm; Programming language; Simulation; Artificial intelligence","score_opus":0.15826523513738183,"score_gpt":0.3090324594004291,"score_spread":0.15076722426304728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346417716","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.047264013,0.00025911097,0.9371358,0.00025115503,0.0001078474,0.00014973755,0.0011079735,0.0022217853,0.011502576],"genre_scores_gemma":[0.41158387,0.0008262758,0.5783395,0.00013539367,0.00004228422,0.00097148865,0.0015538948,0.00056543754,0.005981881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972945,0.000073758245,0.000026660577,0.00004588571,0.00009356204,0.00003066323],"domain_scores_gemma":[0.99902236,0.0006288622,0.00008443232,0.000100977995,0.00011288687,0.000050508672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054817065,0.0005462041,0.00076200993,0.000650672,0.00063610874,0.0012722985,0.0012494463,0.0011330708,0.0040059495],"category_scores_gemma":[0.0018206335,0.00042357296,0.0011024567,0.00066954346,0.0008581116,0.0007364872,0.0009196856,0.0010298147,0.0005685965],"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.000019683072,0.000027738577,0.0007485664,0.000101970356,0.000021267419,0.00014082581,0.000121113466,0.92583627,0.0031089387,0.064015485,0.00069870916,0.0051595154],"study_design_scores_gemma":[0.00000916256,0.000007590184,0.00007115412,0.000008963754,0.000005582275,0.00003303642,0.0000114160675,0.98466057,0.002009754,0.008192055,0.004982545,0.000008153726],"about_ca_topic_score_codex":0.0065068826,"about_ca_topic_score_gemma":0.0049504773,"teacher_disagreement_score":0.0065068826,"about_ca_system_score_codex":0.00088770856,"about_ca_system_score_gemma":0.0010435833,"threshold_uncertainty_score":0.01340121},"labels":[],"label_agreement":null},{"id":"W2361580118","doi":"","title":"A Model of Function Fault Propagation in Complex Circuit","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fault (geology); Computer science; Stuck-at fault; Function (biology); Cellular automaton; Propagation delay; Fault model; Process (computing); Coupling (piping); Algorithm; Electronic circuit; Fault detection and isolation; Electrical engineering; Artificial intelligence; Engineering; Geology; Actuator","score_opus":0.04907820173892563,"score_gpt":0.23907233037608708,"score_spread":0.18999412863716145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2361580118","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.063023955,0.0006852952,0.9167139,0.0005630039,0.00015225797,0.000043609412,0.00030546053,0.00047047102,0.018042043],"genre_scores_gemma":[0.95794016,0.0006238623,0.030077882,0.000083690735,0.000058908554,0.000092628274,0.00016405614,0.00004181447,0.010917053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981064,0.000034715526,0.000008620199,0.000058883878,0.00005727854,0.000029830284],"domain_scores_gemma":[0.9997589,0.00007458135,0.000039371196,0.000029366318,0.00007634016,0.000021472117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016987209,0.0005693281,0.00051511347,0.00070016476,0.00058887445,0.0008795815,0.001062487,0.0013047329,0.003388994],"category_scores_gemma":[0.00085103145,0.00021442497,0.00047032605,0.0007128335,0.00068259204,0.0014908457,0.00040650563,0.0009149362,0.0005127574],"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.00007273748,0.00003625576,0.00070784864,0.000095168856,0.000029424607,0.00052105106,0.00020898158,0.7116782,0.011119578,0.2594569,0.0014944139,0.014579427],"study_design_scores_gemma":[0.000010385694,0.000025269208,0.000099070225,0.000004735747,0.000008535725,0.000081020946,0.000011745212,0.9788617,0.0005671432,0.018933224,0.0013894415,0.000007795933],"about_ca_topic_score_codex":0.0071781524,"about_ca_topic_score_gemma":0.0028350991,"teacher_disagreement_score":0.0071781524,"about_ca_system_score_codex":0.00087256747,"about_ca_system_score_gemma":0.00064038904,"threshold_uncertainty_score":0.014272749},"labels":[],"label_agreement":null},{"id":"W2394816319","doi":"","title":"A class of minimally spectrally arbitrary sign patterns.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sign (mathematics); Mathematics; Class (philosophy); Mathematical analysis; Artificial intelligence; Computer science","score_opus":0.011778897046882205,"score_gpt":0.22998445729959902,"score_spread":0.2182055602527168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394816319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5156971,0.00092208246,0.17893766,0.0015666562,0.0007210526,0.00017197723,0.0016517703,0.0014647926,0.29886693],"genre_scores_gemma":[0.945248,0.00029907707,0.023767782,0.00047829858,0.00014142971,0.0001459072,0.00091702054,0.0001433416,0.028859241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995555,0.000074730204,0.000036090223,0.00011397983,0.000114263246,0.000105372805],"domain_scores_gemma":[0.99908686,0.00022139045,0.00014811322,0.00021773642,0.00018818554,0.00013766479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023560059,0.00040733695,0.00044099282,0.001086691,0.0011665779,0.0026259518,0.0006381852,0.00094472023,0.011132785],"category_scores_gemma":[0.0023581167,0.00026719124,0.00047738833,0.0007593535,0.001316544,0.0014727841,0.0012558588,0.00096000935,0.0021848308],"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.00009035149,0.000041269228,0.00094290334,0.000067090274,0.000010756404,0.00031040458,0.00015592886,0.00088479347,0.0064112293,0.9640458,0.0041932445,0.02284618],"study_design_scores_gemma":[0.00006027008,0.00004981378,0.0011241371,0.00004467928,0.000015667876,0.0013818179,0.00026494593,0.012778368,0.0037981463,0.9568184,0.023628652,0.00003499807],"about_ca_topic_score_codex":0.00047337168,"about_ca_topic_score_gemma":0.0006931921,"teacher_disagreement_score":0.011132785,"about_ca_system_score_codex":0.0004531516,"about_ca_system_score_gemma":0.00048884354,"threshold_uncertainty_score":0.03724283},"labels":[],"label_agreement":null},{"id":"W2395748981","doi":"","title":"Domino Tiling Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Domino; Mathematics; Domino effect; Combinatorics; Political science; Law; Biology","score_opus":0.00912141063806442,"score_gpt":0.2194753404520739,"score_spread":0.21035392981400947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395748981","genre_codex":"other","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.20586589,0.0020457532,0.2042238,0.0013986126,0.0007178927,0.00012335481,0.0018415878,0.0014210996,0.582362],"genre_scores_gemma":[0.8834154,0.0008197428,0.023676762,0.0004709021,0.00016581817,0.00012897697,0.0010883143,0.0001840716,0.09004994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997924,0.000030436564,0.000011411764,0.000054222986,0.000052260537,0.000059297785],"domain_scores_gemma":[0.9995484,0.00015807134,0.00006215896,0.00009030079,0.00006924916,0.000071800845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012615997,0.00027058364,0.00031742678,0.00085344573,0.00087796,0.0012718218,0.00040774336,0.0005401228,0.017483024],"category_scores_gemma":[0.0011032694,0.00017305337,0.00031851718,0.0005819616,0.0008456421,0.0011563943,0.0009761727,0.0006128279,0.00200144],"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.000047774985,0.00001966869,0.00050915533,0.000051148723,0.000009411194,0.00016647381,0.00013055754,0.0030978287,0.004508621,0.9557646,0.007430221,0.028264591],"study_design_scores_gemma":[0.000020806394,0.000018154687,0.000637851,0.000029204228,0.000013780807,0.0003847497,0.0001980497,0.017195793,0.004321818,0.9166286,0.060533866,0.000017386483],"about_ca_topic_score_codex":0.0013552326,"about_ca_topic_score_gemma":0.0028615107,"teacher_disagreement_score":0.017483024,"about_ca_system_score_codex":0.0005854378,"about_ca_system_score_gemma":0.00031740105,"threshold_uncertainty_score":0.05848652},"labels":[],"label_agreement":null},{"id":"W2397737241","doi":"","title":"On a Class of Blockwise-Bursts in Array Codes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Class (philosophy); Mathematics; Arithmetic; Computer science; Artificial intelligence","score_opus":0.00785008549301406,"score_gpt":0.22673678743912568,"score_spread":0.21888670194611162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397737241","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.35843372,0.0029544341,0.5464766,0.0019851823,0.00063726644,0.00019982494,0.0014934024,0.0013124859,0.08650705],"genre_scores_gemma":[0.9184001,0.0015003609,0.04568527,0.00065684924,0.00037322618,0.00030522404,0.0008402484,0.00029042055,0.031948328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992781,0.00016426406,0.000043938406,0.00013217932,0.00018585406,0.0001956952],"domain_scores_gemma":[0.9964149,0.0016781082,0.00052344496,0.000527401,0.0004696021,0.00038652495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049777166,0.0006088699,0.0007456825,0.001487914,0.0014294528,0.002510404,0.0010164798,0.0016145603,0.008695299],"category_scores_gemma":[0.0051915795,0.00041590055,0.0005687759,0.0015679192,0.0015474005,0.0025239415,0.001677515,0.0016154313,0.0016037036],"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.0000697663,0.00003368013,0.00061741646,0.00006031652,0.000011576287,0.00013720391,0.00015961853,0.011275329,0.002376161,0.9699737,0.0035197167,0.0117655145],"study_design_scores_gemma":[0.00003859603,0.000060049882,0.00045053137,0.000055761553,0.000012897609,0.00036451718,0.00012937136,0.11395403,0.0016645984,0.8734559,0.009782963,0.00003085534],"about_ca_topic_score_codex":0.0016325992,"about_ca_topic_score_gemma":0.0016521103,"teacher_disagreement_score":0.008695299,"about_ca_system_score_codex":0.0013293929,"about_ca_system_score_gemma":0.00089820503,"threshold_uncertainty_score":0.029088676},"labels":[],"label_agreement":null},{"id":"W2398019633","doi":"","title":"Enumeration of rooted loopless unicursal planar maps.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Planar; Discrete mathematics; Computer science","score_opus":0.0077845172074696295,"score_gpt":0.21715206829992703,"score_spread":0.20936755109245742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398019633","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.36481553,0.0012059141,0.42033163,0.0007403764,0.00019597377,0.00014149344,0.0018752774,0.001163677,0.20953009],"genre_scores_gemma":[0.8623289,0.0006462354,0.09288479,0.00014645614,0.000040852527,0.00011867348,0.0017206309,0.00016251493,0.041950855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996991,0.00006891719,0.000025130019,0.000050855324,0.00009414779,0.00006180731],"domain_scores_gemma":[0.99930143,0.00033065354,0.000066002045,0.00010505357,0.00013935876,0.0000574753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013163403,0.00032005014,0.0003615678,0.0009989614,0.0007440027,0.0015173199,0.00084302376,0.0006353341,0.010668417],"category_scores_gemma":[0.0020887794,0.0002170029,0.0003413479,0.0011870379,0.000592355,0.001299576,0.0015107882,0.0006805255,0.0020818035],"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.00015536197,0.00006205006,0.0010004273,0.0003502801,0.000023746996,0.0002586973,0.00040233045,0.017188998,0.009911454,0.85403275,0.0067887735,0.10982514],"study_design_scores_gemma":[0.00003218431,0.00005664965,0.00066814414,0.00011554237,0.000035131692,0.0005213791,0.0004054851,0.08979525,0.012696966,0.8568982,0.038746137,0.000028877053],"about_ca_topic_score_codex":0.0011414879,"about_ca_topic_score_gemma":0.0021420727,"teacher_disagreement_score":0.010668417,"about_ca_system_score_codex":0.00064460095,"about_ca_system_score_gemma":0.00036497068,"threshold_uncertainty_score":0.035689414},"labels":[],"label_agreement":null},{"id":"W2398218955","doi":"","title":"Number-conserving cellular automata and communication complexity: a numerical exploration beyond elementary cas","year":2012,"lang":"en","type":"article","venue":"Americanae (AECID Library)","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":"Toronto Metropolitan University","funders":"","keywords":"Cellular automaton; Computer science; Elementary cellular automaton; Theoretical computer science; Automaton; Algorithm; Mobile automaton; Automata theory","score_opus":0.023422345986894005,"score_gpt":0.2498973192499818,"score_spread":0.2264749732630878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398218955","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.23932578,0.004152352,0.6173381,0.006333124,0.00038682367,0.00013015102,0.00044133616,0.00031487434,0.13157742],"genre_scores_gemma":[0.9249407,0.0022620389,0.061212223,0.0003317287,0.0003064085,0.00015490282,0.00014609033,0.00011240353,0.010533522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999608,0.00016898564,0.000014397585,0.00005031763,0.000116340896,0.000042041473],"domain_scores_gemma":[0.9905695,0.00782622,0.0004176502,0.0005203321,0.00042426912,0.00024206712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011781977,0.0006618324,0.0010339223,0.0011294317,0.0009662483,0.0024853626,0.0021731125,0.0018491087,0.0062805684],"category_scores_gemma":[0.015868071,0.0003418421,0.00082652183,0.0013768242,0.0030093961,0.004485579,0.0016427203,0.002205092,0.00030572296],"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.000011693145,0.000019405907,0.0002951073,0.000055194098,0.000007062998,0.000019999434,0.000057785903,0.23480065,0.00011229377,0.76056737,0.0008753295,0.00317806],"study_design_scores_gemma":[0.0000063128105,0.0000045149454,0.000049267128,0.000010195656,0.000003500287,0.000009259579,0.000020624151,0.648733,0.000043719498,0.35062647,0.0004887047,0.000004429443],"about_ca_topic_score_codex":0.006160499,"about_ca_topic_score_gemma":0.004698383,"teacher_disagreement_score":0.0062805684,"about_ca_system_score_codex":0.0017625769,"about_ca_system_score_gemma":0.0016979915,"threshold_uncertainty_score":0.021010578},"labels":[],"label_agreement":null},{"id":"W2399075781","doi":"","title":"Emergence of Cellular Automata Rules Through Fluctuation Enhancement","year":2004,"lang":"en","type":"article","venue":"International journal of unconventional computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Cellular automaton; Branching process; Mathematics; Statistical physics; Entropy (arrow of time); Stochastic process; Selection (genetic algorithm); Automaton; Probability distribution; Computer science; Theoretical computer science; Algorithm; Artificial intelligence; Combinatorics; Statistics; Physics","score_opus":0.018992967216743283,"score_gpt":0.29147137534805484,"score_spread":0.2724784081313116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399075781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52589095,0.00032546432,0.457159,0.00038563804,0.000071684284,0.000067938796,0.000059608064,0.00086448085,0.015175286],"genre_scores_gemma":[0.9736704,0.00007981111,0.024808697,0.00003823347,0.000015646126,0.000029289857,0.000021521078,0.000041837833,0.0012945156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997105,0.00007785521,0.000016389478,0.000052244945,0.000106925116,0.000035970388],"domain_scores_gemma":[0.99920976,0.00031042594,0.00010741075,0.00017429449,0.000114864284,0.000083223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003562195,0.00017580256,0.00032791958,0.00045444196,0.0002893244,0.00090166455,0.00036283402,0.00028848348,0.0009431132],"category_scores_gemma":[0.0026277346,0.00019010075,0.0002857614,0.00021101076,0.00088613713,0.0007314926,0.00068523566,0.00048375706,0.00015286436],"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.00017518029,0.00007724803,0.004345028,0.00009719745,0.000059638256,0.00060831045,0.00054965,0.17292252,0.13089542,0.63039845,0.0014729373,0.05839844],"study_design_scores_gemma":[0.000023915129,0.00006223282,0.0016289194,0.000011377385,0.000018501798,0.00019092232,0.00004640076,0.8254928,0.015472583,0.15414773,0.0028791141,0.00002554008],"about_ca_topic_score_codex":0.00051033136,"about_ca_topic_score_gemma":0.0006190785,"teacher_disagreement_score":0.0009431132,"about_ca_system_score_codex":0.00043772484,"about_ca_system_score_gemma":0.00027854968,"threshold_uncertainty_score":0.0031759143},"labels":[],"label_agreement":null},{"id":"W2400670486","doi":"","title":"Minimal Forbidden Subgraphs For The Klein Bottle With Low Connectivity.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Klein bottle; Bottle; Mathematics; Combinatorics; History; Geometry; Archaeology","score_opus":0.017679052541139856,"score_gpt":0.24172087463160702,"score_spread":0.22404182209046716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400670486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70649564,0.0019141575,0.16502927,0.0033264926,0.00025001093,0.00016293241,0.0019930406,0.0006900463,0.12013835],"genre_scores_gemma":[0.9538947,0.0006123534,0.027321516,0.00035301253,0.00010937497,0.00024054614,0.001047275,0.00010857764,0.016312582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959356,0.00010773726,0.000029185387,0.00007932949,0.0001101174,0.000080101956],"domain_scores_gemma":[0.9985812,0.0008000469,0.0001880338,0.0001329763,0.00012958102,0.00016806702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029649228,0.00039082326,0.0004992699,0.0016221993,0.0012850576,0.0024975487,0.0012520392,0.0013186284,0.007134867],"category_scores_gemma":[0.0025794392,0.0004334019,0.0007501978,0.0009143666,0.0013124701,0.0022290354,0.0014578972,0.0011169013,0.00082228414],"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.000055840694,0.000022934113,0.0005066787,0.000095029805,0.000014853967,0.00014774941,0.00017266063,0.0031752414,0.0024817898,0.98328155,0.003481983,0.0065636886],"study_design_scores_gemma":[0.000022081886,0.000011026774,0.00038073875,0.000022813801,0.00001831269,0.00020227036,0.00009238382,0.014220088,0.0011219017,0.97977006,0.004123933,0.000014440998],"about_ca_topic_score_codex":0.0017644556,"about_ca_topic_score_gemma":0.0025002847,"teacher_disagreement_score":0.007134867,"about_ca_system_score_codex":0.001283369,"about_ca_system_score_gemma":0.00058731314,"threshold_uncertainty_score":0.023868442},"labels":[],"label_agreement":null},{"id":"W2401129216","doi":"10.46298/dmtcs.2971","title":"Product decomposition for surjective 2-block NCCA","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Surjective function; Injective function; Mathematics; Product (mathematics); Block (permutation group theory); Uniqueness; Decomposition; Pure mathematics; Combinatorics; Mathematical analysis; Chemistry; Geometry","score_opus":0.01964220524179911,"score_gpt":0.27471379124091,"score_spread":0.2550715859991109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401129216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48456395,0.0005728895,0.46069965,0.00011470397,0.00012321981,0.0001042307,0.00030157564,0.00057069963,0.052949104],"genre_scores_gemma":[0.9118843,0.00030607235,0.06995147,0.00007644558,0.000056705005,0.00015576213,0.0003794609,0.00014323094,0.017046608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995036,0.000068939524,0.000037572998,0.00013834011,0.00014750967,0.00010408397],"domain_scores_gemma":[0.99931526,0.00013726346,0.00008289844,0.00013437946,0.0002212515,0.000108913715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029406618,0.00034064866,0.0003445834,0.0006146002,0.0006081069,0.0012680696,0.00044126975,0.00031204888,0.006135995],"category_scores_gemma":[0.00074258115,0.00019757326,0.00042109416,0.00032066464,0.00089287205,0.0016880803,0.0010262517,0.0006076802,0.001037679],"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.00007820153,0.00003118118,0.00058169727,0.00007784764,0.000011360218,0.00021235253,0.00044413435,0.0076755015,0.014822264,0.954055,0.00056966254,0.021440819],"study_design_scores_gemma":[0.000026893913,0.00022455296,0.0013590703,0.00004628846,0.0000416154,0.0007079548,0.00034492172,0.11339698,0.030784916,0.8200771,0.032915834,0.00007381372],"about_ca_topic_score_codex":0.00074770086,"about_ca_topic_score_gemma":0.0007237552,"teacher_disagreement_score":0.006135995,"about_ca_system_score_codex":0.00047885402,"about_ca_system_score_gemma":0.00040404446,"threshold_uncertainty_score":0.020526946},"labels":[],"label_agreement":null},{"id":"W2403628685","doi":"","title":"On the Asymptotic Behaviour of Circular Fuzzy Cellular Automata.","year":2011,"lang":"en","type":"article","venue":"Journal of cellular automata","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cellular automaton; Continuous spatial automaton; Fuzzy logic; Stochastic cellular automaton; Computer science; Fuzzy set; Disjunctive normal form; Elementary cellular automaton; Mathematics; Automaton; Theoretical computer science; Discrete mathematics; Mobile automaton; Algorithm; Artificial intelligence; Automata theory; Quantum finite automata","score_opus":0.0258320073892458,"score_gpt":0.2217100104763246,"score_spread":0.1958780030870788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403628685","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.33010992,0.0030337595,0.6171233,0.0008346846,0.00012881814,0.00008269874,0.00020327896,0.0005663708,0.047917258],"genre_scores_gemma":[0.97834057,0.00062925695,0.018449338,0.000091152564,0.000048163158,0.000052996602,0.00010826101,0.000043877106,0.0022362976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927896,0.00021188207,0.000043757875,0.00015313984,0.00021063618,0.00010164749],"domain_scores_gemma":[0.9910732,0.006194771,0.0006578797,0.0006474227,0.0011863497,0.0002405375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013758057,0.00035574168,0.0005638873,0.0012268394,0.00079633034,0.0010749308,0.0007133693,0.00078910915,0.0023703114],"category_scores_gemma":[0.019425275,0.00025006704,0.00065914175,0.0005925648,0.0028622171,0.0016414102,0.0008741765,0.0010195931,0.00035360138],"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.00014305534,0.00005303148,0.0068544904,0.0002255013,0.000054108797,0.0004766329,0.0009964549,0.22060868,0.009481427,0.72867906,0.001713669,0.030713908],"study_design_scores_gemma":[0.000012853959,0.00007321322,0.0015194927,0.000059913233,0.00002848356,0.00040799903,0.00015762696,0.6702706,0.0021824823,0.32304084,0.0022134702,0.00003298638],"about_ca_topic_score_codex":0.0046842853,"about_ca_topic_score_gemma":0.0022594118,"teacher_disagreement_score":0.0046842853,"about_ca_system_score_codex":0.0014508809,"about_ca_system_score_gemma":0.0006443789,"threshold_uncertainty_score":0.010526955},"labels":[],"label_agreement":null},{"id":"W2408589969","doi":"","title":"Structural Form of a Minimal Critical Set for a Latin Square Representing the Elementary Abelian 2-group of Order 8.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Latin square; Abelian group; Set (abstract data type); Order (exchange); Group (periodic table); Square (algebra); Rank of an abelian group; Combinatorics; Elementary abelian group; Generating set of a group; Pure mathematics; Geometry; Computer science; Physics","score_opus":0.034996073666016175,"score_gpt":0.3022947339341963,"score_spread":0.26729866026818017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408589969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66602945,0.00027071216,0.0755824,0.0008900485,0.0003384222,0.00016958418,0.00095296133,0.0006424035,0.255124],"genre_scores_gemma":[0.959179,0.00006436797,0.021450428,0.00016765844,0.0000608375,0.00011740408,0.00071669364,0.00013639442,0.018107302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998392,0.000023082073,0.000010690701,0.000041090243,0.00003569213,0.000050218132],"domain_scores_gemma":[0.9997267,0.00007271438,0.000053982196,0.000032487893,0.000049158753,0.00006495964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010803401,0.00034749156,0.0003293828,0.0010485362,0.0016612398,0.0017271264,0.00057440606,0.0010123801,0.024070308],"category_scores_gemma":[0.000578178,0.00029030195,0.0004563255,0.0003608347,0.0013951847,0.00089351967,0.0009985546,0.0006759301,0.0028319776],"study_design_candidate":"not_applicable","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.000167624,0.00003871988,0.0005602059,0.000073803,0.000012113865,0.00096356776,0.0004578479,0.002058453,0.020009894,0.9658409,0.0035399133,0.006276998],"study_design_scores_gemma":[0.000082603015,0.000118756216,0.0013653613,0.00005743579,0.000023865336,0.0010315225,0.0007551452,0.013319721,0.012782592,0.9441951,0.026221892,0.000046000237],"about_ca_topic_score_codex":0.00077513687,"about_ca_topic_score_gemma":0.0014050584,"teacher_disagreement_score":0.024070308,"about_ca_system_score_codex":0.0007593818,"about_ca_system_score_gemma":0.0004950473,"threshold_uncertainty_score":0.08052313},"labels":[],"label_agreement":null},{"id":"W2440939427","doi":"","title":"Genetic Algorithm for systems with 2D genotype","year":2001,"lang":"en","type":"article","venue":"Genetic and Evolutionary Computation Conference","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cellular automaton; Linkage (software); Genetic algorithm; Algorithm; Computer science; Automaton; Theoretical computer science; Genetics; Biology; Machine learning; Gene","score_opus":0.017822572048227715,"score_gpt":0.22968798863358503,"score_spread":0.21186541658535732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2440939427","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.0052942466,0.0011185891,0.9848192,0.00035161566,0.00012740969,0.00005355318,0.000076193275,0.00023445068,0.007924844],"genre_scores_gemma":[0.33480796,0.0024527998,0.64487725,0.00029616884,0.00014806614,0.0007324994,0.00029368952,0.00014740508,0.01624412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998147,0.000058957223,0.00000882454,0.000030751416,0.00007000088,0.000016806764],"domain_scores_gemma":[0.9998505,0.00008956926,0.0000120832165,0.00001616361,0.000025525631,0.000006182012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003285282,0.0005089226,0.00072265975,0.00039676068,0.0004172581,0.0008622343,0.00071067037,0.0011966161,0.0029772895],"category_scores_gemma":[0.001185692,0.0002740951,0.00055988756,0.00059442694,0.0007834126,0.0006141382,0.00075366296,0.0009551102,0.0006405321],"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.000017152735,0.00001034645,0.00016846988,0.00008038854,0.000027828155,0.00010633736,0.00006965858,0.75069994,0.0015304836,0.2176909,0.0020967335,0.027501808],"study_design_scores_gemma":[0.000017340746,0.000011590369,0.00005295808,0.000012546096,0.000005770502,0.00004146093,0.0000061302726,0.92297065,0.00022959798,0.07186015,0.004783871,0.000007899303],"about_ca_topic_score_codex":0.003283331,"about_ca_topic_score_gemma":0.0022289844,"teacher_disagreement_score":0.003283331,"about_ca_system_score_codex":0.00073583366,"about_ca_system_score_gemma":0.00082474615,"threshold_uncertainty_score":0.009959996},"labels":[],"label_agreement":null},{"id":"W2481293968","doi":"10.1137/1.9780898718256.ch6","title":"Chapter 6: Cellular Automata and Related Models","year":2006,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cellular automaton; Computer science; Automaton; Theoretical computer science; Function (biology); State space; Stochastic cellular automaton; Space (punctuation); Algorithm; Mathematics","score_opus":0.04606273044858324,"score_gpt":0.2144472061882974,"score_spread":0.16838447573971416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481293968","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.004439462,0.14416042,0.17104785,0.008067162,0.0048315115,0.00020490563,0.0010917806,0.0008901026,0.6652669],"genre_scores_gemma":[0.08824835,0.1893657,0.11717756,0.0045114523,0.0048170895,0.00048143868,0.00246875,0.0006615389,0.59226817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997335,0.00003921637,0.000016869888,0.000065638495,0.00012254059,0.000022189179],"domain_scores_gemma":[0.99977845,0.00009316141,0.0000136102735,0.000029573152,0.000071451745,0.000013786226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023700239,0.001031113,0.000590018,0.0009999574,0.00087809976,0.0023231637,0.0010184015,0.0015405517,0.027362702],"category_scores_gemma":[0.0008804883,0.0004681951,0.0008884277,0.0014257026,0.0008062468,0.0025580833,0.0009092911,0.0023107445,0.008638504],"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.0000111959425,0.000041527655,0.0001509548,0.0004904006,0.000017136646,0.0001256416,0.0003325503,0.0070759533,0.0010418802,0.8094908,0.1013045,0.07991759],"study_design_scores_gemma":[0.0000031921538,0.000014369537,0.00015880339,0.00032514465,0.000010048884,0.00024834243,0.00007820607,0.0039953506,0.0005489221,0.31797913,0.67662364,0.000014732989],"about_ca_topic_score_codex":0.0021617159,"about_ca_topic_score_gemma":0.0022633926,"teacher_disagreement_score":0.027362702,"about_ca_system_score_codex":0.0014892103,"about_ca_system_score_gemma":0.0008906013,"threshold_uncertainty_score":0.09153736},"labels":[],"label_agreement":null},{"id":"W2490743963","doi":"10.2316/journal.201.2016.2.201-2725","title":"INVESTIGATIONS OF LIFE-LIKE CELLULAR AUTOMATA FOR IMAGE SCRAMBLING","year":2016,"lang":"en","type":"article","venue":"Control and Intelligent Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scrambling; Cellular automaton; Image (mathematics); Computer science; Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.02226373435498396,"score_gpt":0.23823410682030885,"score_spread":0.21597037246532488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490743963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5634134,0.0062261894,0.3412897,0.0014030592,0.00045906482,0.00016863795,0.00017336865,0.0005125792,0.08635404],"genre_scores_gemma":[0.9722544,0.0013819467,0.02062449,0.00010662208,0.0000478258,0.000041268464,0.000063008614,0.00003929296,0.005441114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998123,0.0000413323,0.0000081433855,0.000034816607,0.000072437164,0.00003094873],"domain_scores_gemma":[0.99934417,0.00031908666,0.000053465985,0.000094758754,0.0001485478,0.00003987771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002163573,0.00033877607,0.00038266837,0.0004984019,0.00047952597,0.0008838089,0.00064381625,0.0006950357,0.0017876126],"category_scores_gemma":[0.0018860049,0.0002239837,0.00045079124,0.00024155338,0.0011281617,0.0007871482,0.00043528684,0.00062555086,0.00035114138],"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.00008857476,0.00009312987,0.0009966544,0.00036915977,0.000043102114,0.00058804266,0.0008588732,0.117730565,0.11425829,0.7431494,0.0013037588,0.020520413],"study_design_scores_gemma":[0.000020840556,0.00010501595,0.00082473847,0.000039119335,0.000019080702,0.00036418068,0.0002494872,0.8164189,0.05094229,0.121750996,0.00920707,0.000058266633],"about_ca_topic_score_codex":0.0016540084,"about_ca_topic_score_gemma":0.0007640641,"teacher_disagreement_score":0.0017876126,"about_ca_system_score_codex":0.0007217481,"about_ca_system_score_gemma":0.00031431118,"threshold_uncertainty_score":0.005980134},"labels":[],"label_agreement":null},{"id":"W2496069863","doi":"10.4018/978-1-60566-661-7.ch014","title":"Cell Processing for Two Scientific Computing Kernels","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; SIMD; Parallel computing; Fast Fourier transform; Synchronization (alternating current); Single-core; Finite-difference time-domain method; Multi-core processor; Xeon; Computational science; Algorithm; Telecommunications","score_opus":0.020412238430232113,"score_gpt":0.26811500206081634,"score_spread":0.24770276363058424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496069863","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.022376457,0.0077927117,0.71372736,0.0017219783,0.0017757793,0.00016679507,0.00017048008,0.0020293926,0.250239],"genre_scores_gemma":[0.18634331,0.00995356,0.54214156,0.0009339565,0.00035857293,0.00027132197,0.0005199262,0.0005887458,0.25888908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998883,0.000007691742,0.0000048607353,0.000025331183,0.00005906219,0.000014640054],"domain_scores_gemma":[0.9999093,0.000029679903,0.0000043084096,0.000018415529,0.000029887704,0.00000838632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100448706,0.00045209235,0.00031447635,0.00033371436,0.0005809286,0.0013006396,0.00058258284,0.0006269938,0.012122134],"category_scores_gemma":[0.0003000946,0.0001860694,0.00044017154,0.00050915283,0.00046031203,0.0010886011,0.00064027304,0.0009917448,0.0049617365],"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.000054899232,0.000042930726,0.00018274684,0.00027924782,0.000009625862,0.00033297928,0.00033716243,0.013042996,0.055843048,0.7270867,0.023938313,0.17884935],"study_design_scores_gemma":[0.000020502843,0.00007563136,0.00025663985,0.00008374678,0.000019862146,0.0009279928,0.00015409738,0.12340537,0.045064144,0.13399853,0.69595724,0.000036258778],"about_ca_topic_score_codex":0.00079092383,"about_ca_topic_score_gemma":0.0010622011,"teacher_disagreement_score":0.012122134,"about_ca_system_score_codex":0.0005971518,"about_ca_system_score_gemma":0.00044519998,"threshold_uncertainty_score":0.040552557},"labels":[],"label_agreement":null},{"id":"W2498775271","doi":"","title":"Synchronization, TIGoRS, and Information Flow in Complex Systems: Dispositional Cellular Automata.","year":2016,"lang":"en","type":"article","venue":"PubMed","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Synchronization (alternating current); Cellular automaton; Context (archaeology); Computer science; Automaton; Salient; Information flow; Complex system; Argument (complex analysis); Phenomenon; Cognitive science; Theoretical computer science; Artificial intelligence; Physics; Biology; Psychology; Linguistics","score_opus":0.009002847387088408,"score_gpt":0.17775244633899165,"score_spread":0.16874959895190325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498775271","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.054761253,0.06646535,0.8016366,0.006823986,0.0017298603,0.00014062424,0.00056338223,0.0006307439,0.06724836],"genre_scores_gemma":[0.88209397,0.020581063,0.086208016,0.00080216845,0.0012579472,0.00024114702,0.0002993822,0.00009087414,0.008425498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959177,0.0001351894,0.00003395546,0.00010629704,0.000098070275,0.00003472233],"domain_scores_gemma":[0.99922264,0.00040214055,0.00013485125,0.000081882725,0.000081525075,0.00007698951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006095463,0.0006028512,0.0005328506,0.0012985243,0.0006664349,0.0018418861,0.00064784725,0.0012834014,0.001964167],"category_scores_gemma":[0.0027989964,0.00024088137,0.000585049,0.0016099311,0.003593512,0.0028137753,0.0015095213,0.0017838062,0.00037643831],"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.000014417568,0.000007706468,0.00040315688,0.00009252237,0.0000147401015,0.000092566595,0.00021099899,0.013915467,0.0010253538,0.96732384,0.0020905393,0.014808636],"study_design_scores_gemma":[0.0000064838123,0.000041081512,0.00062973425,0.00006614529,0.000017385619,0.00026125493,0.00011191527,0.08626455,0.00046565797,0.8877934,0.024308596,0.000033749122],"about_ca_topic_score_codex":0.001328355,"about_ca_topic_score_gemma":0.0012154318,"teacher_disagreement_score":0.001964167,"about_ca_system_score_codex":0.0012580982,"about_ca_system_score_gemma":0.0005679308,"threshold_uncertainty_score":0.009128213},"labels":[],"label_agreement":null},{"id":"W2508470097","doi":"10.7939/r3s05w","title":"State-independent decodable DC-free codes with complex-valued signalling alphabets","year":2011,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Algorithm; Signalling; Mathematics; Theoretical computer science; Phase-shift keying; Keying; Block code; Coding (social sciences); Decoding methods; Binary number; Computer science; Topology (electrical circuits); Telecommunications; Arithmetic; Bit error rate; Combinatorics","score_opus":0.01856101462935433,"score_gpt":0.18002401028802986,"score_spread":0.16146299565867553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508470097","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.051400125,0.00023081785,0.9350466,0.00014728455,0.00005260223,0.00008796816,0.00027086723,0.00032975132,0.012433963],"genre_scores_gemma":[0.5339072,0.00047158246,0.45272338,0.00014828771,0.000027636384,0.000329483,0.000766807,0.00011821625,0.011507514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989747,0.0002119768,0.00008000603,0.00011777578,0.00051595044,0.00009960197],"domain_scores_gemma":[0.9980075,0.0009180419,0.00017738156,0.00036383665,0.00049015327,0.00004309977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007423508,0.00058460113,0.00050057843,0.0008157954,0.0004899496,0.0012459115,0.0007490145,0.0007433001,0.0022588153],"category_scores_gemma":[0.0034306732,0.00031566466,0.0005555933,0.0010573772,0.0008751004,0.00095414335,0.0011003577,0.0008983385,0.0008889024],"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.00021812358,0.000052867043,0.0006032179,0.00017599255,0.000031257725,0.0002451673,0.0002723446,0.29702687,0.03348416,0.5904922,0.0012911267,0.076106705],"study_design_scores_gemma":[0.000028576527,0.00007457082,0.0002530841,0.0000659965,0.000016208405,0.00016459216,0.000040527917,0.8577634,0.039247088,0.095792174,0.0064996784,0.000054085554],"about_ca_topic_score_codex":0.0017743938,"about_ca_topic_score_gemma":0.0021557196,"teacher_disagreement_score":0.0022588153,"about_ca_system_score_codex":0.0011499921,"about_ca_system_score_gemma":0.0013736207,"threshold_uncertainty_score":0.008343875},"labels":[],"label_agreement":null},{"id":"W2537355733","doi":"10.1109/icccas.2002.1179001","title":"Reconfigurable pipelined cellular automata array for cryptography","year":2003,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Cryptosystem; Cryptography; Cellular automaton; Key (lock); Flexibility (engineering); Architecture; Computer architecture; Simple (philosophy); Public-key cryptography; Very-large-scale integration; Field-programmable gate array; Reconfigurable computing; Embedded system; Parallel computing; Encryption; Computer network; Algorithm; Operating system; Mathematics","score_opus":0.015676158437386192,"score_gpt":0.2331955864626888,"score_spread":0.2175194280253026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537355733","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.09355225,0.005012338,0.85935205,0.0007336444,0.000670904,0.00010821885,0.00026883534,0.0035269046,0.036774933],"genre_scores_gemma":[0.78206474,0.0021235084,0.20209073,0.00019445927,0.00008880514,0.00010588642,0.00021178486,0.00006765611,0.013052341],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999249,0.000013010116,0.0000045690103,0.000021036858,0.000023981398,0.000012561586],"domain_scores_gemma":[0.99993825,0.000015611246,0.0000073139627,0.00001581851,0.00001719123,0.000005884926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060595215,0.0002870976,0.0001982186,0.00025279121,0.0002614367,0.00040625964,0.000433635,0.00036539717,0.0023764805],"category_scores_gemma":[0.00020751315,0.00012776892,0.00029323078,0.00039319586,0.0002344584,0.00040162707,0.00020557789,0.00041450319,0.0007794924],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00029464037,0.000061184895,0.00068041275,0.00036712337,0.000052167037,0.00043540643,0.00009093382,0.1761728,0.3522233,0.18650094,0.0073401476,0.275781],"study_design_scores_gemma":[0.00005742571,0.00025989473,0.0005297506,0.00003796668,0.00005735281,0.00036919827,0.000027923978,0.78887737,0.10027866,0.038607445,0.07084236,0.000054601525],"about_ca_topic_score_codex":0.0008195723,"about_ca_topic_score_gemma":0.0010352688,"teacher_disagreement_score":0.0023764805,"about_ca_system_score_codex":0.00047431162,"about_ca_system_score_gemma":0.0003585168,"threshold_uncertainty_score":0.0079500675},"labels":[],"label_agreement":null},{"id":"W2538751572","doi":"10.1109/tencon.1993.327980","title":"Systolizing the covariance analysis of linear predictive coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Covariance; Predictive coding; Coding (social sciences); Computer science; Analysis of covariance; Set (abstract data type); Linear predictive coding; Task (project management); Linear model; Algorithm; Mathematics; Artificial intelligence; Statistics; Machine learning; Engineering; Speech processing","score_opus":0.02818808542659402,"score_gpt":0.2416249978142803,"score_spread":0.21343691238768628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538751572","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.0016126395,0.000028361253,0.9973533,0.000024001713,0.000013109102,0.0000104848705,0.00001659553,0.00022821281,0.00071327016],"genre_scores_gemma":[0.1139446,0.0002356648,0.8808428,0.00012107014,0.00010060143,0.00014405392,0.00021722821,0.00031128663,0.004082577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927586,0.00017750962,0.000045624034,0.00012188091,0.00031599577,0.00006306308],"domain_scores_gemma":[0.9984276,0.00076472043,0.00013115624,0.00020728818,0.00043008858,0.00003913912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010212001,0.0006422642,0.0005683819,0.0005974945,0.0004556248,0.0012527418,0.0007933673,0.0004514298,0.00427264],"category_scores_gemma":[0.004660668,0.000352181,0.0006069688,0.0007519127,0.0008938828,0.0014327358,0.0010791159,0.0012859759,0.00145837],"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.00013292895,0.000058546077,0.0008807846,0.00014752393,0.00006292679,0.00012753476,0.00018827578,0.28128308,0.027608037,0.33002067,0.0042236797,0.35526597],"study_design_scores_gemma":[0.000009456972,0.000038684124,0.00011928931,0.000014324489,0.000012686498,0.000045671066,0.0000124528,0.9302232,0.009922815,0.056283116,0.0033010582,0.000017208118],"about_ca_topic_score_codex":0.0032609657,"about_ca_topic_score_gemma":0.004365796,"teacher_disagreement_score":0.00427264,"about_ca_system_score_codex":0.0008458062,"about_ca_system_score_gemma":0.001846039,"threshold_uncertainty_score":0.014293432},"labels":[],"label_agreement":null},{"id":"W2559072658","doi":"10.1016/j.laa.2016.11.040","title":"Sets of refined inertias of zero–nonzero patterns","year":2016,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; St. Olaf College; Victoria University; University of Victoria","keywords":"Zero (linguistics); Mathematics; Sign (mathematics); Zero set; Set (abstract data type); Combinatorics; Contrast (vision); Pure mathematics; Mathematical analysis; Physics; Computer science","score_opus":0.013777079822712158,"score_gpt":0.24621339131603315,"score_spread":0.232436311493321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559072658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6126875,0.00044939923,0.34597984,0.00038274526,0.00019064047,0.00009962858,0.00086789345,0.0006967647,0.038645636],"genre_scores_gemma":[0.949242,0.00018883796,0.035956845,0.00014146372,0.00019944238,0.00014654048,0.0010246368,0.0002758977,0.012824386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814856,0.00027466431,0.00021057334,0.0005095015,0.00044802343,0.0004087053],"domain_scores_gemma":[0.9929932,0.0026159936,0.0009926659,0.0014764437,0.0010229816,0.0008987098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001281128,0.0008233383,0.0015617923,0.0038212456,0.0020929906,0.0044978736,0.001796067,0.0010610401,0.008219662],"category_scores_gemma":[0.006200081,0.0011567479,0.0019327934,0.0019575898,0.0045132553,0.0049948758,0.0035767576,0.0021689208,0.0009700943],"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.00018225554,0.000037004935,0.001112256,0.00006487536,0.000031347598,0.0001892685,0.00079970114,0.0012822184,0.005403922,0.9838441,0.0006451566,0.0064078434],"study_design_scores_gemma":[0.00005397727,0.000051663093,0.0017383082,0.000032068492,0.000041876086,0.00022189431,0.00031107132,0.011217627,0.003516536,0.97993165,0.0028240846,0.00005924084],"about_ca_topic_score_codex":0.0011724483,"about_ca_topic_score_gemma":0.0010529658,"teacher_disagreement_score":0.008219662,"about_ca_system_score_codex":0.0011608662,"about_ca_system_score_gemma":0.0006340484,"threshold_uncertainty_score":0.02749747},"labels":[],"label_agreement":null},{"id":"W2572305786","doi":"","title":"Automorphisms of the alternating group network.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Automorphism; Mathematics; Alternating group; Group (periodic table); Automorphisms of the symmetric and alternating groups; Combinatorics; Physics","score_opus":0.00943424816887263,"score_gpt":0.2137869660394778,"score_spread":0.20435271787060516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572305786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39851013,0.001344313,0.36389664,0.0017998866,0.000773678,0.00014381952,0.0009481471,0.00078321603,0.23180012],"genre_scores_gemma":[0.93235636,0.0007587343,0.026417017,0.00024096709,0.0002984789,0.00016891838,0.0005432341,0.00012673091,0.039089594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999624,0.00012998395,0.000024262567,0.00008944476,0.00006878627,0.00006343109],"domain_scores_gemma":[0.99890983,0.00044940968,0.00018850673,0.00018156355,0.00012627545,0.00014445625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031871523,0.00031097437,0.00031119265,0.0010109276,0.00072060036,0.0013864653,0.00048873544,0.00070468837,0.009528073],"category_scores_gemma":[0.0021104168,0.00020910529,0.0005587198,0.0004626629,0.0012511415,0.0017859924,0.001043908,0.00072738883,0.0015726637],"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.000031798605,0.000010412039,0.00024084146,0.00002212634,0.000007856564,0.000077249584,0.00009180301,0.0037976378,0.0015715188,0.98567516,0.001253793,0.007219813],"study_design_scores_gemma":[0.000014531441,0.00001557048,0.00022071785,0.000011835133,0.0000064143514,0.00013236183,0.000042874864,0.018656433,0.0007514106,0.9729762,0.007162401,0.000009294438],"about_ca_topic_score_codex":0.00076188135,"about_ca_topic_score_gemma":0.0008289266,"teacher_disagreement_score":0.009528073,"about_ca_system_score_codex":0.000645132,"about_ca_system_score_gemma":0.00035666925,"threshold_uncertainty_score":0.031874597},"labels":[],"label_agreement":null},{"id":"W2575972686","doi":"","title":"Self Vertex Switchings Of Disconnected Unicyclic Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.006945811262195019,"score_gpt":0.21604738241472593,"score_spread":0.20910157115253092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575972686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84199303,0.00079897564,0.053921603,0.0004992072,0.00021969358,0.00006857376,0.000633464,0.0006481795,0.101217374],"genre_scores_gemma":[0.9878128,0.0001909401,0.0042367834,0.000082634935,0.00004210601,0.000031396343,0.00029612976,0.000050286326,0.007256828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973065,0.00006449028,0.000021423872,0.000060310864,0.00005564285,0.00006744635],"domain_scores_gemma":[0.9984907,0.0006697376,0.00025609447,0.00022718354,0.00013729454,0.00021899512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018944862,0.00023390108,0.0003241919,0.0014164384,0.0008450417,0.0014932745,0.00069991825,0.0007175985,0.006308016],"category_scores_gemma":[0.0022468378,0.0002746002,0.00038308228,0.0006529245,0.00086267805,0.0009765588,0.00093342457,0.00070103206,0.00062613125],"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.00024382061,0.00013363441,0.0038547467,0.00016743249,0.000045670415,0.0010741868,0.0007425497,0.024522897,0.0118367,0.9084156,0.0067006154,0.042262156],"study_design_scores_gemma":[0.000061530045,0.00008487398,0.0024684807,0.00005939914,0.000044084896,0.0012122013,0.0005276609,0.12495931,0.006454068,0.85406154,0.010027153,0.000039718376],"about_ca_topic_score_codex":0.0012252942,"about_ca_topic_score_gemma":0.0017046551,"teacher_disagreement_score":0.006308016,"about_ca_system_score_codex":0.0006886005,"about_ca_system_score_gemma":0.00025061675,"threshold_uncertainty_score":0.021102428},"labels":[],"label_agreement":null},{"id":"W2591812587","doi":"10.1007/s00454-012-9479-4","title":"Sporadic Reinhardt Polygons","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Mathematics","score_opus":0.007348079187393582,"score_gpt":0.22793138899979737,"score_spread":0.2205833098124038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591812587","genre_codex":"other","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.32424083,0.0009994532,0.08806485,0.0012768947,0.0005699549,0.00012581603,0.0006883008,0.0005609262,0.583473],"genre_scores_gemma":[0.8835686,0.0004865226,0.012473617,0.00020972214,0.0001999319,0.00008051076,0.0006987605,0.00022048158,0.10206182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944395,0.0000862157,0.00003058451,0.00012411487,0.00017882514,0.00013622346],"domain_scores_gemma":[0.9995615,0.000091492846,0.00007032792,0.00009755697,0.00008032321,0.00009879179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032381102,0.00078903395,0.00082815695,0.0021613098,0.0022110296,0.0025765074,0.0009546143,0.0008161682,0.020882042],"category_scores_gemma":[0.0014779164,0.00048999046,0.0007102882,0.0009448769,0.001981419,0.0021741446,0.002592005,0.0020122363,0.0030502977],"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.000029158035,0.000008062904,0.00013667798,0.000020843932,0.0000060214866,0.00013923993,0.00013475584,0.0006271665,0.0006589767,0.9930629,0.0014013293,0.0037748995],"study_design_scores_gemma":[0.000031086995,0.000025809655,0.00051504374,0.00002318864,0.00001812559,0.0007111213,0.00031711636,0.004900763,0.0019324716,0.96252406,0.028983835,0.000017297469],"about_ca_topic_score_codex":0.00096741173,"about_ca_topic_score_gemma":0.0010259134,"teacher_disagreement_score":0.020882042,"about_ca_system_score_codex":0.00078260305,"about_ca_system_score_gemma":0.0004780917,"threshold_uncertainty_score":0.06985736},"labels":[],"label_agreement":null},{"id":"W2593041518","doi":"10.1090/stml/080/06","title":"Von Neumann’s Minimax Theorem","year":2016,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Minimax; Von Neumann architecture; Minimax theorem; Mathematics; Mathematical economics; Applied mathematics; Pure mathematics","score_opus":0.012786155988507304,"score_gpt":0.2345801823440147,"score_spread":0.2217940263555074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593041518","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.007652903,0.004141541,0.11786593,0.004522045,0.0011357334,0.000025804542,0.000188707,0.00014505681,0.86432225],"genre_scores_gemma":[0.356374,0.011465613,0.04793199,0.0025080494,0.0018960607,0.0002677334,0.00027314172,0.00055155414,0.57873183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973637,0.00004993437,0.00001259991,0.000060868235,0.00011373115,0.000026493783],"domain_scores_gemma":[0.99975723,0.00013153884,0.000012760085,0.000034478067,0.000052356976,0.000011623543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004978639,0.0006832998,0.0006028713,0.0007088472,0.0009015893,0.0017616517,0.00070582854,0.0012649526,0.013483281],"category_scores_gemma":[0.001628624,0.00037367575,0.00044533686,0.00067094434,0.0019962634,0.0035044176,0.0010978873,0.002563525,0.003310084],"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.0000033303475,0.0000034471248,0.000009110278,0.000027765935,0.000002975044,0.00000778909,0.000034092023,0.00051760476,0.0002775917,0.98719525,0.0041739363,0.0077470974],"study_design_scores_gemma":[0.0000027727183,0.000003153579,0.000024268651,0.000019063147,0.0000026974608,0.000030757783,0.000009855335,0.0013157075,0.00042523147,0.96804035,0.030121898,0.000004261595],"about_ca_topic_score_codex":0.0005204565,"about_ca_topic_score_gemma":0.00062563317,"teacher_disagreement_score":0.013483281,"about_ca_system_score_codex":0.0010920672,"about_ca_system_score_gemma":0.0007356422,"threshold_uncertainty_score":0.045106113},"labels":[],"label_agreement":null},{"id":"W2609394453","doi":"10.1090/amsip/038/13","title":"Derived equivalence for stratified Mukai flop on 𝐺(2,4)","year":2006,"lang":"en","type":"book-chapter","venue":"AMS/IP studies in advanced mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"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 Alberta; Queen's University","funders":"","keywords":"Equivalence (formal languages); Mathematics; Computer science; Pure mathematics","score_opus":0.08712019553656503,"score_gpt":0.3430871550669687,"score_spread":0.25596695953040366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609394453","genre_codex":"other","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.331192,0.0012757845,0.13650078,0.0020573502,0.0013652447,0.00016137327,0.0003963145,0.0003484503,0.5267028],"genre_scores_gemma":[0.88620186,0.000851612,0.030242246,0.000786677,0.00083459576,0.000212458,0.00056915707,0.00026693734,0.08003436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993837,0.000114985014,0.00003853988,0.00011950143,0.00022262702,0.00012062674],"domain_scores_gemma":[0.9996203,0.00009570826,0.00003420285,0.00004793166,0.00012390153,0.0000778548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006894936,0.00075753836,0.00095253065,0.002540664,0.0031870052,0.002680152,0.0008898388,0.0013214515,0.012600732],"category_scores_gemma":[0.0013372896,0.0004396767,0.0010493611,0.0010504284,0.0031240836,0.005350344,0.0026080306,0.0033347083,0.0012806394],"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.0000096691665,0.000011156985,0.000038058413,0.000012873958,0.0000032500648,0.00004116305,0.00018576949,0.00011735189,0.00041392434,0.9966407,0.0006270376,0.0018992051],"study_design_scores_gemma":[0.000012762776,0.000014735943,0.00022164128,0.000009043287,0.0000059298895,0.00006534494,0.000081842736,0.0011852673,0.0004783335,0.9927844,0.0051315497,0.000009128123],"about_ca_topic_score_codex":0.0011441512,"about_ca_topic_score_gemma":0.001038586,"teacher_disagreement_score":0.012600732,"about_ca_system_score_codex":0.0020635682,"about_ca_system_score_gemma":0.0006547203,"threshold_uncertainty_score":0.042153597},"labels":[],"label_agreement":null},{"id":"W2610236403","doi":"10.11606/d.100.2017.tde-31102016-122600","title":"Autômatos celulares e o problema da classificação de densidade: o modelo Gács-Kurdyumov-Levin de quatro estados","year":2017,"lang":"pt","type":"dissertation","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada)","funders":"","keywords":"Physics; Humanities; Philosophy","score_opus":0.044586664038423506,"score_gpt":0.3197410006911789,"score_spread":0.2751543366527554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610236403","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067007594,0.0026374548,0.9102302,0.0016944507,0.00013847368,0.000101134974,0.00027589014,0.00037419502,0.01754051],"genre_scores_gemma":[0.79296845,0.0027407415,0.16340882,0.00047704316,0.00015856742,0.00047738102,0.0004318287,0.00028184737,0.039055295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878997,0.0003059767,0.00007171312,0.00037868033,0.00033095927,0.0001227201],"domain_scores_gemma":[0.9971564,0.0013851288,0.0004562909,0.00032416312,0.00053339807,0.00014461983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022741712,0.0011782987,0.0011766937,0.002225388,0.001260059,0.0040998473,0.0024128603,0.0023282275,0.004258538],"category_scores_gemma":[0.007310107,0.00086195086,0.0015973701,0.002408567,0.0033558893,0.0053558936,0.0023303628,0.0020195385,0.0010018559],"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.00008530621,0.000040139155,0.006173574,0.00024185712,0.00008551994,0.00021182677,0.0008195677,0.44204655,0.0029584006,0.5074405,0.0019457327,0.037950933],"study_design_scores_gemma":[0.000012910754,0.000045150584,0.0010845916,0.000057477933,0.000031667463,0.00013649426,0.00019305326,0.8513018,0.0009909348,0.13801198,0.008099109,0.00003483893],"about_ca_topic_score_codex":0.013344265,"about_ca_topic_score_gemma":0.0077742147,"teacher_disagreement_score":0.013344265,"about_ca_system_score_codex":0.00427568,"about_ca_system_score_gemma":0.0021066254,"threshold_uncertainty_score":0.03102237},"labels":[],"label_agreement":null},{"id":"W2611061920","doi":"10.4086/toc.2013.v009a001","title":"","year":2013,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association; National Science Foundation","keywords":"Tile; Combinatorics; Discrete mathematics; Terminal (telecommunication); Mathematics; Computer science; Pure mathematics","score_opus":0.01080034766990897,"score_gpt":0.2211525095681928,"score_spread":0.21035216189828382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611061920","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27914125,0.0006385782,0.69808936,0.0018762792,0.0001459007,0.000084309126,0.00013055203,0.00016999351,0.019723745],"genre_scores_gemma":[0.8657845,0.00042474887,0.12374464,0.00032695153,0.000068414956,0.00014977799,0.000111714544,0.00007492353,0.0093143685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990922,0.00019748187,0.000041311156,0.0003029186,0.00017590722,0.00019020068],"domain_scores_gemma":[0.9954482,0.0024686672,0.00039838353,0.0011491542,0.00025077738,0.00028483625],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001603154,0.00041551376,0.0007154142,0.0004998923,0.0013478087,0.0015597326,0.0018922293,0.001117724,0.0037252074],"category_scores_gemma":[0.00701827,0.00037930033,0.00089136837,0.0005788107,0.0021101958,0.0054856054,0.002181839,0.001802975,0.00047514765],"study_design_candidate":"not_applicable","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.00015306406,0.00010060161,0.0020218384,0.00012775778,0.000025341546,0.00022733233,0.00033114484,0.11029746,0.006762468,0.85258424,0.0016149551,0.025753736],"study_design_scores_gemma":[0.000032950233,0.00018470024,0.00041545826,0.000021056438,0.000036346053,0.00019674086,0.00010872536,0.47011283,0.007075984,0.51344913,0.008341202,0.000024872568],"about_ca_topic_score_codex":0.0019082051,"about_ca_topic_score_gemma":0.002962002,"teacher_disagreement_score":0.99627477,"about_ca_system_score_codex":0.0013482396,"about_ca_system_score_gemma":0.0010225007,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2621019785","doi":"10.25088/complexsystems.16.2.95","title":"Stochastic Self-organization","year":2005,"lang":"en","type":"article","venue":"Complex Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Air Canada","funders":"","keywords":"Self-organization; Computer science; Artificial intelligence","score_opus":0.018106261533671394,"score_gpt":0.22848954338040567,"score_spread":0.21038328184673427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621019785","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.240633,0.002213577,0.67072666,0.0026148288,0.00024998016,0.0002575192,0.0004680062,0.0007784809,0.08205798],"genre_scores_gemma":[0.9650514,0.00088528823,0.02521455,0.00023235155,0.00009948955,0.00019436466,0.00024026871,0.000060114166,0.008022136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966586,0.00008958885,0.00001878094,0.00007978729,0.00009482668,0.000051031053],"domain_scores_gemma":[0.9991097,0.00029661332,0.00014150083,0.00019261462,0.00013147797,0.00012804521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047382925,0.0002148392,0.00045242367,0.00052748545,0.00059788616,0.0013623058,0.0006921468,0.00081300974,0.0026751095],"category_scores_gemma":[0.0023763517,0.00021056963,0.00045019647,0.0002886392,0.0013276391,0.0011531272,0.0009769654,0.00054247415,0.0004959331],"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.000015309348,0.000026181779,0.0021969925,0.00010398112,0.000070314614,0.00028971897,0.0002859845,0.10591093,0.0042329407,0.8721629,0.0027026176,0.012002027],"study_design_scores_gemma":[0.00001491728,0.000039174047,0.0014819676,0.00003794023,0.000018709497,0.00026000733,0.000109538254,0.31603613,0.00083304447,0.6693463,0.011794927,0.000027331804],"about_ca_topic_score_codex":0.00077494775,"about_ca_topic_score_gemma":0.00068248535,"teacher_disagreement_score":0.0026751095,"about_ca_system_score_codex":0.00082728575,"about_ca_system_score_gemma":0.0005831139,"threshold_uncertainty_score":0.008949161},"labels":[],"label_agreement":null},{"id":"W2730815467","doi":"","title":"A note on monochromatic linear recurrence sequences.","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Physics; Optics","score_opus":0.025640256055861232,"score_gpt":0.3353129503080017,"score_spread":0.30967269425214045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730815467","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.035782795,0.05894669,0.5595219,0.010173817,0.026788147,0.000103914295,0.0009831735,0.0007263556,0.30697325],"genre_scores_gemma":[0.49966642,0.036232673,0.30689117,0.007855276,0.011130446,0.00024430052,0.00066936656,0.00051327253,0.13679697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996153,0.000072255454,0.000029772424,0.0001045741,0.00013398506,0.00004404151],"domain_scores_gemma":[0.99919385,0.00044064215,0.00006537803,0.00011789715,0.00013128166,0.000051014642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042326192,0.00037080506,0.00036492702,0.00068043015,0.0006640169,0.001036105,0.0008153812,0.00057528575,0.012057618],"category_scores_gemma":[0.0030119482,0.00020816653,0.00038837275,0.0009632178,0.0007728022,0.0016518122,0.0009550869,0.0014088282,0.0024603102],"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.00007119144,0.000019618597,0.0001683024,0.00023442315,0.000011284701,0.00027591945,0.00019522042,0.0030231846,0.0062903124,0.8584496,0.035736296,0.0955247],"study_design_scores_gemma":[0.000011718846,0.000082614555,0.0003604555,0.000087980916,0.00002069033,0.0007274405,0.000079076075,0.011247812,0.0053612436,0.71813214,0.2638536,0.000035256307],"about_ca_topic_score_codex":0.0009998488,"about_ca_topic_score_gemma":0.0017952729,"teacher_disagreement_score":0.012057618,"about_ca_system_score_codex":0.0005770997,"about_ca_system_score_gemma":0.00041300437,"threshold_uncertainty_score":0.040336788},"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":"W2770335656","doi":"10.1007/978-981-10-5699-4_21","title":"DNA as an Electromagnetic Fractal Cavity Resonator: Its Universal Sensing and Fractal Antenna Behavior","year":2017,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Fractal; Physics; Fractal antenna; Resonator; Electromagnetic radiation; Lattice (music); Antenna (radio); Homogeneous space; Radiation pattern; Optics; Electromagnetic field; Computational physics; Acoustics; Geometry; Quantum mechanics; Telecommunications; Computer science; Mathematics; Mathematical analysis; Antenna efficiency","score_opus":0.015684973936032996,"score_gpt":0.2730012043168712,"score_spread":0.2573162303808382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770335656","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56416506,0.053039413,0.23585229,0.004170225,0.00233253,0.00009412632,0.00034303908,0.000935438,0.13906784],"genre_scores_gemma":[0.8989882,0.007889788,0.050619636,0.0005369918,0.00024069572,0.000060203318,0.00010434839,0.00014621268,0.041413892],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999013,0.000017142807,0.0000031533289,0.000035804947,0.000031326814,0.0000112916105],"domain_scores_gemma":[0.9998572,0.00007215573,0.000017358132,0.000020155958,0.00001849567,0.000014629884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016108558,0.0002224785,0.00030654718,0.00016879,0.00024686966,0.00070238253,0.0005780804,0.00068602955,0.0016487883],"category_scores_gemma":[0.00050157,0.00019110559,0.00014985669,0.00028223958,0.00096633256,0.0009971543,0.0004609782,0.0004679037,0.0006102328],"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.00016119573,0.00005570621,0.00030194395,0.000533146,0.000021752501,0.00036826317,0.0007488556,0.0056076236,0.52447265,0.37518698,0.005003204,0.08753857],"study_design_scores_gemma":[0.000043911303,0.0004152391,0.0009584524,0.00010861894,0.00004111112,0.0019206048,0.00031809657,0.049796674,0.6053783,0.16231835,0.17855893,0.00014171447],"about_ca_topic_score_codex":0.00015116585,"about_ca_topic_score_gemma":0.0001219403,"teacher_disagreement_score":0.0016487883,"about_ca_system_score_codex":0.0003374073,"about_ca_system_score_gemma":0.0001592239,"threshold_uncertainty_score":0.005515754},"labels":[],"label_agreement":null},{"id":"W2794068349","doi":"10.1093/oxfordhb/9780190226992.013.7","title":"Network Music and the Algorithmic Ensemble","year":2018,"lang":"en","type":"book","venue":"Oxford University Press eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Key (lock); Computer security","score_opus":0.016250376033663503,"score_gpt":0.18208972047394853,"score_spread":0.16583934444028503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794068349","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.014281232,0.008184598,0.1779669,0.008636463,0.0013444781,0.00004973061,0.00019900517,0.00036103633,0.78897655],"genre_scores_gemma":[0.6827451,0.010223025,0.086041175,0.0017194279,0.003235365,0.00025914435,0.0005390411,0.0005119372,0.21472567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999173,0.00023894048,0.000033893524,0.0001756485,0.0003003271,0.000078124685],"domain_scores_gemma":[0.9990415,0.0004334852,0.000051339848,0.0002436562,0.00015290207,0.00007707141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010648891,0.00051646325,0.00052301487,0.0010690449,0.0017755596,0.004468452,0.0009071075,0.0009577678,0.010092916],"category_scores_gemma":[0.0038965251,0.00022405676,0.00046629235,0.0010037071,0.005548312,0.007054721,0.0023687298,0.0021000537,0.0018768186],"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.0000022539043,0.0000013184437,0.00002893978,0.000009974745,0.0000017111335,0.000005869703,0.000082031125,0.0013495644,0.000025959593,0.98911834,0.0023536317,0.007020342],"study_design_scores_gemma":[0.0000018847621,0.0000027808398,0.00005591792,0.000014586757,0.0000017122962,0.000014832694,0.000058459143,0.004750506,0.000040991425,0.9533521,0.041702498,0.0000036930016],"about_ca_topic_score_codex":0.0014768619,"about_ca_topic_score_gemma":0.0012815179,"teacher_disagreement_score":0.010092916,"about_ca_system_score_codex":0.0020366441,"about_ca_system_score_gemma":0.00092111324,"threshold_uncertainty_score":0.033764184},"labels":[],"label_agreement":null},{"id":"W2802032711","doi":"10.1177/0037549718761596","title":"Advanced Cell-DEVS modeling applications: a legacy of Norbert Giambiasi","year":2018,"lang":"en","type":"article","venue":"SIMULATION","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"DEVS; Formalism (music); Computer science; Modeling and simulation; Distributed computing; Cellular automaton; Theoretical computer science; Software engineering; Simulation; Artificial intelligence","score_opus":0.01700668369418569,"score_gpt":0.28082787849085905,"score_spread":0.2638211947966734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802032711","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003258493,0.0028941089,0.9560153,0.007558495,0.0008800201,0.00006444382,0.00076002744,0.006114241,0.022454828],"genre_scores_gemma":[0.06589919,0.0126039,0.8765173,0.0023409673,0.00088660105,0.00037457296,0.0019816381,0.006957927,0.032437894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985434,0.00044829724,0.00009908329,0.00026099247,0.000558817,0.00008944193],"domain_scores_gemma":[0.99478334,0.0023466956,0.00015379551,0.0014404242,0.0009193754,0.0003562785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003307062,0.0012888985,0.001067623,0.0011248485,0.0012977868,0.0033911837,0.0037908705,0.0019246029,0.008708725],"category_scores_gemma":[0.0076479907,0.0016865708,0.0018225957,0.001662181,0.0016851921,0.0052628512,0.0044903685,0.0077650025,0.0049265157],"study_design_candidate":"not_applicable","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.000060345672,0.00009179686,0.001696883,0.0003899609,0.00008378862,0.00032291826,0.0013491341,0.15074342,0.004312639,0.6248474,0.09035794,0.12574382],"study_design_scores_gemma":[0.000021140851,0.000029960192,0.00015918532,0.00022085059,0.000025148514,0.0002698388,0.00008850791,0.2646172,0.0044402895,0.1565781,0.57347125,0.00007842818],"about_ca_topic_score_codex":0.009849722,"about_ca_topic_score_gemma":0.0075215334,"teacher_disagreement_score":0.009849722,"about_ca_system_score_codex":0.0021508008,"about_ca_system_score_gemma":0.0020853023,"threshold_uncertainty_score":0.029133558},"labels":[],"label_agreement":null},{"id":"W2803538861","doi":"10.48550/arxiv.1805.10051","title":"Causal dynamics of discrete manifolds","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Compute Canada","funders":"","keywords":"Decidability; Cellular automaton; Manifold (fluid mechanics); Bounded function; Automaton; Discrete time and continuous time; Mathematics; Subject (documents); Pure mathematics; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Mathematical analysis","score_opus":0.041187154612991786,"score_gpt":0.18901876698696093,"score_spread":0.14783161237396913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803538861","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.21149431,0.0005624452,0.74812627,0.0012436621,0.00019575341,0.00006621144,0.00036915828,0.0004977332,0.037444517],"genre_scores_gemma":[0.9510512,0.00030880832,0.044133864,0.00011492297,0.00005538075,0.000070838934,0.00012864025,0.00005622627,0.0040801787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954116,0.000107633954,0.000025955893,0.00015241964,0.000109657456,0.000063262734],"domain_scores_gemma":[0.9986444,0.0005032086,0.00019882964,0.0002997855,0.00020484303,0.00014890601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036639618,0.00032432238,0.00027856373,0.00085309,0.00068926497,0.0013640962,0.00065398007,0.0005893307,0.0039587994],"category_scores_gemma":[0.0028407169,0.00022374188,0.0006230616,0.00047749735,0.0019793145,0.002408049,0.0015698172,0.0008480654,0.0003342652],"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.000006967386,0.0000061586034,0.00034704938,0.0000152021275,0.000006188376,0.00004959814,0.0001430835,0.021335494,0.0012475997,0.9735884,0.00028081314,0.0029735158],"study_design_scores_gemma":[0.00000777845,0.000015310974,0.00027885512,0.000012664357,0.000007417876,0.00004494596,0.00009117894,0.15966718,0.0011077186,0.83225095,0.0065048276,0.00001120022],"about_ca_topic_score_codex":0.0026371866,"about_ca_topic_score_gemma":0.0014674161,"teacher_disagreement_score":0.0039587994,"about_ca_system_score_codex":0.0012502499,"about_ca_system_score_gemma":0.0004696133,"threshold_uncertainty_score":0.013243496},"labels":[],"label_agreement":null},{"id":"W2803561423","doi":"10.1007/978-3-319-92675-9_4","title":"Evaluating the Quality of Local Structure Approximation Using Elementary Rule 14","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Computer science; Popularity; Context (archaeology); Cellular automaton; Theoretical computer science; Space (punctuation); Automaton; Local structure; Algorithm; Applied mathematics; Mathematics; Physics","score_opus":0.06506179910781018,"score_gpt":0.3511881434291986,"score_spread":0.2861263443213884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803561423","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.43999198,0.0016557132,0.5371177,0.0004516357,0.00020744998,0.0001407171,0.0007428815,0.0045219227,0.015170073],"genre_scores_gemma":[0.85168827,0.0003043588,0.1435195,0.00008088838,0.000048989466,0.000049930262,0.0013854236,0.0005966124,0.002326062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941995,0.001242595,0.00033764626,0.0008572418,0.0028950542,0.00046793907],"domain_scores_gemma":[0.97276884,0.017438479,0.0007658222,0.004832254,0.0036017664,0.00059283583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004765748,0.0007115371,0.0017506585,0.0018796275,0.00061983627,0.0027098581,0.0024133609,0.0020084546,0.008055428],"category_scores_gemma":[0.03319966,0.00043593862,0.0010967499,0.001341139,0.001595382,0.003050115,0.0020492969,0.0013142827,0.0012837163],"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.004076645,0.00050972175,0.027660115,0.00091452413,0.0004231121,0.00036298297,0.00039764348,0.39086285,0.024179641,0.04298885,0.006505457,0.5011185],"study_design_scores_gemma":[0.00009046623,0.00039096718,0.0028145462,0.00006644132,0.00009718957,0.00014936386,0.00015866224,0.95507586,0.015829258,0.023992334,0.0013062033,0.00002874146],"about_ca_topic_score_codex":0.0036859943,"about_ca_topic_score_gemma":0.0045320853,"teacher_disagreement_score":0.008055428,"about_ca_system_score_codex":0.0012833244,"about_ca_system_score_gemma":0.0013525982,"threshold_uncertainty_score":0.026948035},"labels":[],"label_agreement":null},{"id":"W2889798411","doi":"10.1007/978-1-4614-4523-4_20","title":"Erratum to: Infinite Dimensional Dynamical Systems","year":2018,"lang":"en","type":"erratum","venue":"Fields Institute communications","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":"York University","funders":"","keywords":"Dynamical systems theory; Physics; Computer science; Statistical physics; Quantum mechanics","score_opus":0.03846859256553198,"score_gpt":0.2958605859215093,"score_spread":0.25739199335597734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889798411","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039368472,0.0016324791,0.0013983243,0.0678845,0.90460545,0.000039280527,0.0009550081,0.00023386514,0.02285743],"genre_scores_gemma":[0.019689668,0.011910088,0.008003054,0.06897236,0.24845581,0.00025205084,0.0037939895,0.0010585467,0.63786453],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976271,0.00035556237,0.00040543734,0.0002796457,0.001182946,0.00014934478],"domain_scores_gemma":[0.9901933,0.0029886747,0.00051137974,0.0005886585,0.005280491,0.00043740292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019108461,0.0018518135,0.0014039401,0.0031750286,0.0037170209,0.003749262,0.0023137499,0.0050496575,0.061434295],"category_scores_gemma":[0.02624126,0.00065478927,0.0007686627,0.0018574463,0.002051328,0.0034139906,0.001588473,0.006575273,0.028775383],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000018815428,0.000006922324,0.000038427126,0.000059663893,0.0000037968737,0.00013056086,0.000025393792,0.00006804661,0.000026001962,0.0043193307,0.990319,0.004984007],"study_design_scores_gemma":[0.000022021299,0.000019923122,0.00027231878,0.0001980906,0.000017445402,0.000289055,0.000101230275,0.0005047612,0.0002106619,0.008176379,0.99016654,0.000021573896],"about_ca_topic_score_codex":0.0070123067,"about_ca_topic_score_gemma":0.00952035,"teacher_disagreement_score":0.061434295,"about_ca_system_score_codex":0.00392138,"about_ca_system_score_gemma":0.0030607078,"threshold_uncertainty_score":0.20551819},"labels":[],"label_agreement":null},{"id":"W2906406427","doi":"10.5539/mas.v13n1p136","title":"One-Dimensional Audio Scrambling based on Cellular Automata","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scrambling; Computer science; Cellular automaton; Encryption; Theoretical computer science; Key (lock); Algorithm; Computer security","score_opus":0.02392497586410199,"score_gpt":0.24905879505962328,"score_spread":0.22513381919552128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906406427","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.14830463,0.0011027526,0.83346957,0.00019298188,0.00015576145,0.00012028807,0.00016938797,0.0021683117,0.014316318],"genre_scores_gemma":[0.9100756,0.0006942859,0.085594654,0.00004668531,0.000012942448,0.000103487415,0.00011270838,0.000042960393,0.00331679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996623,0.00006201658,0.000026684604,0.0000796488,0.00013442767,0.000034902234],"domain_scores_gemma":[0.9992549,0.00029539166,0.00008409145,0.00014382324,0.00019280656,0.000028901972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001550903,0.0004256871,0.0004597181,0.0005361312,0.0004413962,0.00072250783,0.00069340883,0.00044884582,0.0012474165],"category_scores_gemma":[0.0012008145,0.00019840541,0.00058315287,0.00044907865,0.0004732411,0.0005195024,0.000439311,0.0004569934,0.00040907637],"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.00021281751,0.00008549332,0.0013240069,0.00033490793,0.00006256239,0.00043315787,0.00034210898,0.74206316,0.11927279,0.036135048,0.0012688424,0.09846503],"study_design_scores_gemma":[0.000010709925,0.00008960386,0.000319852,0.000016395963,0.000023255627,0.00015620053,0.000021857206,0.9705663,0.02290162,0.0032028668,0.0026656562,0.000025664911],"about_ca_topic_score_codex":0.004169704,"about_ca_topic_score_gemma":0.0026785526,"teacher_disagreement_score":0.004169704,"about_ca_system_score_codex":0.0006445131,"about_ca_system_score_gemma":0.00037867817,"threshold_uncertainty_score":0.008290887},"labels":[],"label_agreement":null},{"id":"W2914783239","doi":"","title":"Dihedral Escherization","year":2004,"lang":"en","type":"article","venue":"Graphics Interface","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Escher; Aperiodic graph; Dihedral angle; Computer science; Penrose tiling; Computer graphics (images); Plane (geometry); Tessellation (computer graphics); Voronoi diagram; Process (computing); Combinatorics; Mathematics; Algorithm; Geometry; Quasicrystal; Physics; Programming language","score_opus":0.013484426185631409,"score_gpt":0.25280010346245246,"score_spread":0.23931567727682104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914783239","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.0047364193,0.00010224364,0.9717539,0.000065717664,0.00007759519,0.00011260324,0.000105039166,0.0020825453,0.020964002],"genre_scores_gemma":[0.09049024,0.000385163,0.8815105,0.00018529208,0.00003734871,0.00016892352,0.0009859956,0.0014775753,0.024758976],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927145,0.00010702167,0.000046151818,0.00017916349,0.00030363942,0.00009264613],"domain_scores_gemma":[0.99954945,0.00009406827,0.00003339279,0.00017235072,0.000113893846,0.00003677592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047250703,0.0009546176,0.0006999316,0.00090484245,0.0009629797,0.0014800449,0.0012188884,0.00079043367,0.016406864],"category_scores_gemma":[0.0015004491,0.00054186286,0.0009793427,0.0010039624,0.0011810361,0.0012497511,0.002535296,0.001066322,0.007964624],"study_design_candidate":"not_applicable","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.0001726587,0.00007781617,0.00092690426,0.0004613867,0.000053807547,0.0005214523,0.0009883089,0.03000297,0.06871188,0.3468141,0.027551495,0.5237172],"study_design_scores_gemma":[0.000079032354,0.00023402515,0.00081385544,0.00014414119,0.000068120724,0.0016587583,0.00039102757,0.19804941,0.1294429,0.14994763,0.5190494,0.000121730176],"about_ca_topic_score_codex":0.00096952746,"about_ca_topic_score_gemma":0.0015931854,"teacher_disagreement_score":0.016406864,"about_ca_system_score_codex":0.00045290455,"about_ca_system_score_gemma":0.000575359,"threshold_uncertainty_score":0.0548864},"labels":[],"label_agreement":null},{"id":"W2919834984","doi":"","title":"An Exponent Bound for Abelian Group that admit a Covering Extended Building Set.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Exponent; Abelian group; Group (periodic table); Set (abstract data type); Pure mathematics; Generating set of a group; Upper and lower bounds; Combinatorics; Mathematical analysis; Geometry; Physics; Computer science; Quantum mechanics","score_opus":0.024062112244045888,"score_gpt":0.2851975572390513,"score_spread":0.26113544499500546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919834984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5657845,0.0025791563,0.1646093,0.0024044586,0.00056541496,0.0000796618,0.0010427544,0.00092118455,0.26201352],"genre_scores_gemma":[0.9597095,0.00048105605,0.017258583,0.0003516244,0.00021515101,0.00007393468,0.00052220136,0.00015419791,0.02123372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994105,0.0000785238,0.00003815727,0.00012784603,0.00015176735,0.00019317748],"domain_scores_gemma":[0.997493,0.0014851002,0.00018748351,0.00033399416,0.00020466288,0.0002957563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005284398,0.00055873895,0.00059291,0.0012789706,0.0013783468,0.0026090515,0.0009011368,0.0009878343,0.018826576],"category_scores_gemma":[0.0033672336,0.0002785802,0.00058826583,0.00091603264,0.0013134562,0.003946775,0.0025290968,0.0016555262,0.0024798021],"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.00015028124,0.000057251018,0.0012024323,0.00011856636,0.000017215072,0.0002456089,0.00032605935,0.0034534605,0.0033376876,0.97164637,0.0057779285,0.0136672165],"study_design_scores_gemma":[0.000035108096,0.000074383046,0.0009874181,0.00006406963,0.000045246758,0.0005196303,0.0002107613,0.025559887,0.0030922687,0.950719,0.018662173,0.0000300541],"about_ca_topic_score_codex":0.0006035949,"about_ca_topic_score_gemma":0.00078964815,"teacher_disagreement_score":0.018826576,"about_ca_system_score_codex":0.0009392702,"about_ca_system_score_gemma":0.00037623383,"threshold_uncertainty_score":0.06298119},"labels":[],"label_agreement":null},{"id":"W2932223404","doi":"10.1007/978-3-030-14687-0_2","title":"Evolving Diverse Cellular Automata Based Level Maps","year":2019,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"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 Guelph","funders":"","keywords":"Cellular automaton; Terrain; Computer science; Generalization; Automaton; Representation (politics); Space (punctuation); Pixel; Artificial intelligence; Theoretical computer science; Mathematics; Cartography","score_opus":0.03114773659126295,"score_gpt":0.2572247124088036,"score_spread":0.22607697581754066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932223404","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.29053503,0.00069339783,0.667988,0.00039468662,0.00021396863,0.00007531799,0.00026903025,0.000807493,0.03902309],"genre_scores_gemma":[0.8605138,0.00043160687,0.1250444,0.00010895624,0.00003256329,0.00009714531,0.000291287,0.00014850798,0.013331788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998565,0.000034584635,0.0000070188876,0.000030906005,0.000049703376,0.000021314476],"domain_scores_gemma":[0.9995933,0.00018891206,0.000022257298,0.000061527084,0.000090339054,0.000043634853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021477693,0.00031810658,0.0005311197,0.0005432172,0.00051982934,0.0012745532,0.00091193576,0.0007438117,0.0031965964],"category_scores_gemma":[0.0014686763,0.0003042183,0.00057187985,0.0006638747,0.00058622425,0.0010365745,0.0014268096,0.00061447575,0.0006687486],"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.00008789578,0.00005558324,0.0011624045,0.00010440103,0.00006228353,0.0002746556,0.0003746661,0.65806746,0.030266104,0.23881117,0.0024470673,0.06828631],"study_design_scores_gemma":[0.0000055287387,0.00001597001,0.00016444466,0.000005027804,0.00000948048,0.000043576823,0.00003513223,0.9630361,0.0016765135,0.032963693,0.0020349717,0.000009582623],"about_ca_topic_score_codex":0.0017998077,"about_ca_topic_score_gemma":0.0020082272,"teacher_disagreement_score":0.0031965964,"about_ca_system_score_codex":0.00077735895,"about_ca_system_score_gemma":0.0002906908,"threshold_uncertainty_score":0.010693669},"labels":[],"label_agreement":null},{"id":"W2932277743","doi":"10.4230/lipics.stacs.2019.40","title":"A Characterization of Subshifts with Computable Language","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Characterization (materials science); Computer science; Theoretical computer science","score_opus":0.00934227030477084,"score_gpt":0.23227065996252594,"score_spread":0.2229283896577551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932277743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7846301,0.0007052853,0.19800474,0.00039400614,0.00011344342,0.00006293577,0.00048767612,0.00058750296,0.015014135],"genre_scores_gemma":[0.9701255,0.00014693185,0.025107088,0.00008763817,0.0000601043,0.000066674394,0.00034783824,0.0000961738,0.003962054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992818,0.000091629474,0.000063249936,0.00028540552,0.00014929946,0.00012868638],"domain_scores_gemma":[0.99800915,0.0009166389,0.00029498938,0.00028405423,0.00026938558,0.00022595392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045954372,0.00040276005,0.000428115,0.0012806864,0.00082056643,0.0018494759,0.0007311305,0.0006309141,0.0031927228],"category_scores_gemma":[0.0021088647,0.00031341318,0.0007020051,0.00083242526,0.0029565305,0.0020549812,0.0011438221,0.0008470656,0.00038609136],"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.00016334234,0.000051823547,0.002606892,0.0001437196,0.00002422924,0.0005618608,0.0013957594,0.0040777135,0.03807459,0.93959624,0.0006941327,0.01260966],"study_design_scores_gemma":[0.00006726778,0.0002011745,0.003170319,0.00007202731,0.0000697704,0.0012121435,0.0013998145,0.035132978,0.038473174,0.9005014,0.019613666,0.00008622728],"about_ca_topic_score_codex":0.0012072283,"about_ca_topic_score_gemma":0.0007951486,"teacher_disagreement_score":0.0031927228,"about_ca_system_score_codex":0.0011474136,"about_ca_system_score_gemma":0.0005169755,"threshold_uncertainty_score":0.010680735},"labels":[],"label_agreement":null},{"id":"W29332038","doi":"10.3233/jad-170425","title":"Long Baseline (Y+) Array Configuration: Specifications and Requirements","year":2003,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute on Aging; Canadian Institutes of Health Research","keywords":"Baseline (sea); Computer science; Reliability engineering; Engineering; Geology","score_opus":0.053479764145856645,"score_gpt":0.2672240039537548,"score_spread":0.21374423980789814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29332038","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.09455036,0.0022855736,0.82038397,0.00075252185,0.00035849298,0.0017950326,0.009269798,0.029495973,0.04110823],"genre_scores_gemma":[0.45997098,0.0012056046,0.49174395,0.00052283145,0.000320428,0.002834974,0.010494067,0.0041369707,0.028770203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975077,0.00059342623,0.0004262403,0.00044637723,0.00077907945,0.00024718186],"domain_scores_gemma":[0.98899394,0.0031543227,0.001317958,0.002901574,0.0033169093,0.0003153187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026768413,0.001732712,0.0011243155,0.0012960938,0.00076442125,0.002462056,0.003408356,0.0016357967,0.042917635],"category_scores_gemma":[0.012445321,0.00093758747,0.000783347,0.0016315248,0.0005356304,0.0026706909,0.0016061638,0.0006074657,0.020830115],"study_design_candidate":"not_applicable","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.007650479,0.00041192834,0.030005751,0.0026970538,0.00022385626,0.003056075,0.00091985933,0.05148046,0.2235243,0.03314805,0.051893156,0.594989],"study_design_scores_gemma":[0.0010957283,0.005588561,0.024901431,0.0005611718,0.0005314418,0.014526505,0.00086532603,0.1933928,0.33784422,0.030604957,0.38953623,0.00055153377],"about_ca_topic_score_codex":0.002188488,"about_ca_topic_score_gemma":0.0027673577,"teacher_disagreement_score":0.042917635,"about_ca_system_score_codex":0.0005507011,"about_ca_system_score_gemma":0.00078077544,"threshold_uncertainty_score":0.14357382},"labels":[],"label_agreement":null},{"id":"W2946244420","doi":"10.1007/s11047-019-09739-5","title":"A class of discrete dynamical systems with properties of both cellular automata and L-systems","year":2019,"lang":"en","type":"article","venue":"Natural Computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Statistics Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cellular automaton; Sublinear function; Dynamical systems theory; Mathematics; Ergodic theory; Algebraic number; Theory of computation; Quadratic equation; Entropy (arrow of time); Complex system; Discrete mathematics; Computer science; Pure mathematics; Algorithm","score_opus":0.008713007467321114,"score_gpt":0.2073030927396991,"score_spread":0.19859008527237798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946244420","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.3178045,0.001716475,0.588518,0.0018550389,0.00020871178,0.0002325774,0.0014312392,0.0010420096,0.08719139],"genre_scores_gemma":[0.9379882,0.00061941764,0.04877149,0.00035178056,0.00022142388,0.00023191329,0.00057759415,0.000061706356,0.011176387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968505,0.000055138808,0.000021026297,0.00010711498,0.000080254955,0.000051539224],"domain_scores_gemma":[0.9987256,0.00054157147,0.00022953459,0.00016632579,0.00021040131,0.00012652445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026898374,0.00038613463,0.00072209386,0.0008057038,0.001128123,0.0023147836,0.00056358316,0.0007946543,0.0036446238],"category_scores_gemma":[0.0020022257,0.0001867838,0.00067077484,0.0007783314,0.0011883678,0.001471374,0.0010202918,0.0008654374,0.00060815475],"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.000040937535,0.00005631462,0.0013701881,0.0001032452,0.000026296746,0.0003721667,0.00031278605,0.007883839,0.005742999,0.9630224,0.002117724,0.018950991],"study_design_scores_gemma":[0.000060450267,0.000054219057,0.0015336905,0.000031991964,0.00002186772,0.000631549,0.00017347402,0.13537769,0.0018218167,0.83955485,0.020702906,0.000035506022],"about_ca_topic_score_codex":0.0023912988,"about_ca_topic_score_gemma":0.0014137452,"teacher_disagreement_score":0.0036446238,"about_ca_system_score_codex":0.00081880967,"about_ca_system_score_gemma":0.0007986295,"threshold_uncertainty_score":0.012192428},"labels":[],"label_agreement":null},{"id":"W2949341009","doi":"10.48550/arxiv.1001.5323","title":"Class Degree and Relative Maximal Entropy","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Ergodic theory; Mathematics; Degree (music); Upper and lower bounds; Entropy (arrow of time); Combinatorics; Invariant (physics); Kullback–Leibler divergence; Discrete mathematics; Pure mathematics; Mathematical analysis; Physics; Statistics; Mathematical physics; Quantum mechanics","score_opus":0.06698661794029821,"score_gpt":0.18414281508228925,"score_spread":0.11715619714199103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949341009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8500389,0.00048380633,0.1208226,0.0007022005,0.00008171266,0.000039662904,0.0005298741,0.00020297385,0.027098216],"genre_scores_gemma":[0.9921842,0.00017385496,0.0050636074,0.00005262007,0.00012776957,0.00004623303,0.00022063784,0.000044475993,0.00208651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810636,0.0002398613,0.00009526776,0.00052506436,0.0005006806,0.0005326871],"domain_scores_gemma":[0.99371547,0.0033631176,0.0005807062,0.0008522993,0.0004456176,0.0010428411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011618447,0.0004507904,0.0010654452,0.0023671011,0.001581491,0.0023244317,0.0011570207,0.00075940386,0.004107022],"category_scores_gemma":[0.0074089733,0.00037934515,0.0009617497,0.00093951804,0.005228839,0.004932049,0.0031108859,0.0012694733,0.00037284024],"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.00012937289,0.000032432705,0.0037266286,0.00008343276,0.000026537731,0.000078102195,0.000465873,0.008897921,0.007110795,0.9710305,0.0007306052,0.0076877847],"study_design_scores_gemma":[0.000027484142,0.000075476266,0.0056687943,0.000035741283,0.000031459498,0.0004323848,0.00018747,0.063238055,0.010371422,0.9161304,0.0037298724,0.00007150681],"about_ca_topic_score_codex":0.000807047,"about_ca_topic_score_gemma":0.0005879015,"teacher_disagreement_score":0.004107022,"about_ca_system_score_codex":0.0018123647,"about_ca_system_score_gemma":0.0005285688,"threshold_uncertainty_score":0.013739407},"labels":[],"label_agreement":null},{"id":"W2949710238","doi":"10.48550/arxiv.0801.1060","title":"On the Period of a Periodic-Finite-Type Shift","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Period (music); Type (biology); Class (philosophy); Mathematics; Pure mathematics; Physics; Computer science; Biology","score_opus":0.049606795785689745,"score_gpt":0.2604856063545668,"score_spread":0.21087881056887706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949710238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7846848,0.0008314612,0.15123092,0.0006627262,0.00030208568,0.000049298756,0.00023030503,0.00016807523,0.061840393],"genre_scores_gemma":[0.98485374,0.0003157747,0.011726228,0.00010498379,0.00014620244,0.000037334616,0.00006453076,0.000060740946,0.0026904917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946517,0.0001178272,0.000036269474,0.00012611439,0.00016070531,0.00009397193],"domain_scores_gemma":[0.9981553,0.0010183211,0.00021606647,0.00024342845,0.00021216155,0.00015474833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083829,0.00019148717,0.00033474996,0.0006870506,0.00073216244,0.001455438,0.00033956877,0.0005890802,0.0025199135],"category_scores_gemma":[0.0036748494,0.00019660922,0.00030593434,0.00044551666,0.0025593513,0.0021978542,0.000994892,0.00074167765,0.0002886177],"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.0001663916,0.0000170954,0.0019408212,0.000055285658,0.000010660294,0.0002562026,0.00055007,0.005613074,0.012338918,0.96236646,0.00052821735,0.016156754],"study_design_scores_gemma":[0.00003823825,0.00012616125,0.0024673901,0.00004755524,0.000023518796,0.0005737666,0.0005133006,0.029671505,0.006905835,0.951973,0.007615968,0.00004370386],"about_ca_topic_score_codex":0.00025569517,"about_ca_topic_score_gemma":0.00019310469,"teacher_disagreement_score":0.0025199135,"about_ca_system_score_codex":0.00057633483,"about_ca_system_score_gemma":0.00032825864,"threshold_uncertainty_score":0.0084299445},"labels":[],"label_agreement":null},{"id":"W2949923012","doi":"10.48550/arxiv.0907.2935","title":"Positive expansiveness versus network dimension in symbolic dynamical systems","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Dynamical systems theory; Counterexample; Symbolic dynamics; Countable set; Topological entropy; Dynamical system (definition); Digraph; Invariant (physics); Discrete mathematics; Dimension (graph theory); Topological conjugacy; Exponent; Function (biology); Cellular automaton; Pure mathematics; Combinatorics; Algorithm; Physics","score_opus":0.02761659447878399,"score_gpt":0.26875459627990916,"score_spread":0.24113800180112518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949923012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85964036,0.00096134614,0.10546144,0.0019248786,0.00006588878,0.000034353765,0.00016640437,0.000112378766,0.031632904],"genre_scores_gemma":[0.9965413,0.0002149134,0.0024683808,0.000026674126,0.00005378018,0.000021192529,0.000026036969,0.0000060586826,0.00064158754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993117,0.00023816597,0.000041340652,0.0001465645,0.00017432107,0.00008800039],"domain_scores_gemma":[0.9943269,0.0036772147,0.00073541736,0.00058598764,0.00023711698,0.00043750482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008010974,0.0003510612,0.00038797862,0.0010638392,0.00074622134,0.0018710153,0.00037409845,0.0005007746,0.0022180693],"category_scores_gemma":[0.0045127817,0.00025516306,0.00035950006,0.0005353614,0.00491839,0.0033904538,0.0021845212,0.0009486497,0.00011339429],"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.00003864326,0.000013507459,0.001560362,0.000043130476,0.000013431504,0.00011264802,0.00033172022,0.009478595,0.0021557075,0.9821786,0.00021191375,0.0038618117],"study_design_scores_gemma":[0.000024817246,0.000055180582,0.0017329197,0.000024481284,0.000016592345,0.00021296856,0.00016194319,0.06593954,0.0017937686,0.9277409,0.0022760427,0.0000208254],"about_ca_topic_score_codex":0.000395604,"about_ca_topic_score_gemma":0.00025501737,"teacher_disagreement_score":0.0022180693,"about_ca_system_score_codex":0.00074433384,"about_ca_system_score_gemma":0.00020944548,"threshold_uncertainty_score":0.007420182},"labels":[],"label_agreement":null},{"id":"W2949951424","doi":"10.48550/arxiv.math/0108083","title":"Limit Measures for Affine Cellular Automata, II","year":2001,"lang":"en","type":"preprint","venue":"Open Research Online (The Open University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Abelian group; Mathematics; Endomorphism; Combinatorics; Haar measure; Prime (order theory); Markov chain; Discrete mathematics; Measure (data warehouse); Cellular automaton; Monoid; Pure mathematics; Algorithm; Statistics; Computer science","score_opus":0.21098695890707414,"score_gpt":0.39305980696082254,"score_spread":0.1820728480537484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949951424","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.22949018,0.009927095,0.6463228,0.0035711308,0.00057322613,0.00017078394,0.0010460616,0.0006627553,0.108235955],"genre_scores_gemma":[0.9015472,0.0030454197,0.061017845,0.0004507907,0.00063015276,0.00060405536,0.0007364106,0.00016594262,0.031802133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989479,0.0002801939,0.000089483285,0.00027741908,0.00025972357,0.00014539331],"domain_scores_gemma":[0.9958626,0.0021726144,0.00052230223,0.00029490085,0.00068459567,0.0004628433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015187646,0.00091952394,0.0009604169,0.002384373,0.0020669322,0.0047199796,0.0012146223,0.001548029,0.006104067],"category_scores_gemma":[0.007912882,0.00061313255,0.0014078075,0.0011099925,0.002815585,0.0045608133,0.0022171345,0.0022824511,0.00088519615],"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.000005618236,0.000007178518,0.00026455455,0.000022034432,0.000007667458,0.00003870975,0.00010844786,0.002263315,0.00033453119,0.995002,0.00037967463,0.0015662902],"study_design_scores_gemma":[0.0000098318,0.000021212601,0.00031095,0.000029258987,0.000009728568,0.00010435932,0.000090737885,0.05894606,0.0003979459,0.93685585,0.003209597,0.000014494337],"about_ca_topic_score_codex":0.0025973557,"about_ca_topic_score_gemma":0.0017953183,"teacher_disagreement_score":0.006104067,"about_ca_system_score_codex":0.0031384244,"about_ca_system_score_gemma":0.0010561097,"threshold_uncertainty_score":0.022770941},"labels":[],"label_agreement":null},{"id":"W2950454963","doi":"10.48550/arxiv.math/0108084","title":"Multiplicative Cellular Automata on Nilpotent Groups: Structure, Entropy, and Asymptotics","year":2001,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Multiplicative function; Mathematics; Endomorphism; Nilpotent; Discrete mathematics; Multiplicative group; Combinatorics; Group (periodic table); Pure mathematics; Physics; Mathematical analysis","score_opus":0.027264652036640028,"score_gpt":0.2511042662291438,"score_spread":0.22383961419250376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950454963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79684174,0.00084098213,0.19223453,0.00052270835,0.000066902576,0.00002860925,0.00014232127,0.00020063971,0.00912157],"genre_scores_gemma":[0.98737305,0.0001930555,0.0103984615,0.00003205646,0.00007344274,0.000039495233,0.00008373286,0.000017458873,0.0017892752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967,0.00008335335,0.000020637755,0.00007806313,0.000094162555,0.000053790587],"domain_scores_gemma":[0.99703777,0.0016966109,0.0003899229,0.00025949904,0.0003337179,0.00028247686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006444747,0.00031844672,0.0005104863,0.001455738,0.00070609024,0.0022515955,0.00076423044,0.000797164,0.0014741684],"category_scores_gemma":[0.0054587387,0.00026415373,0.00038171798,0.0006644802,0.0023606757,0.0020443683,0.0010125837,0.00068910304,0.00015721604],"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.00003905722,0.000025573247,0.0024896367,0.00003600859,0.000016502954,0.000078626224,0.00033721246,0.026053412,0.0031404214,0.96165156,0.00032351253,0.0058084116],"study_design_scores_gemma":[0.000008500754,0.00002898671,0.001086036,0.000013633638,0.000008134367,0.00007870798,0.000087566936,0.20996915,0.0013780608,0.7866342,0.00068816164,0.000018820432],"about_ca_topic_score_codex":0.0008491161,"about_ca_topic_score_gemma":0.0010164352,"teacher_disagreement_score":0.0022515955,"about_ca_system_score_codex":0.0013157505,"about_ca_system_score_gemma":0.0003896241,"threshold_uncertainty_score":0.009546518},"labels":[],"label_agreement":null},{"id":"W2950772840","doi":"10.48550/arxiv.0904.2375","title":"The Zeta Function of a Periodic-Finite-Type Shift","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Type (biology); Riemann zeta function; Class (philosophy); Function (biology); Pure mathematics; Mathematical analysis; Computer science","score_opus":0.03554948539930445,"score_gpt":0.25718776578758284,"score_spread":0.2216382803882784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950772840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75148994,0.00056460506,0.2048393,0.0006472359,0.00023298802,0.00003442711,0.00029791694,0.0002373274,0.04165623],"genre_scores_gemma":[0.98183846,0.00036707832,0.010958496,0.000070630995,0.00015243715,0.000031366,0.00018965466,0.00006419977,0.0063277395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997842,0.000024414736,0.000011995628,0.000043766307,0.00008079582,0.000054800155],"domain_scores_gemma":[0.9994318,0.00021504975,0.0000548994,0.000054577158,0.00015777144,0.00008584472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040409822,0.00037981392,0.0004657393,0.001607518,0.00063216157,0.0017273369,0.0004578775,0.0005154521,0.0030322876],"category_scores_gemma":[0.0024466387,0.00017488135,0.000406391,0.00066214596,0.0014233271,0.002261807,0.0009337363,0.00081553304,0.0007443208],"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.00007230801,0.000016858667,0.0019389853,0.000049761107,0.000009228489,0.00020415288,0.00024887364,0.0065650446,0.0072501143,0.9560893,0.001441792,0.026113559],"study_design_scores_gemma":[0.000017677074,0.000036153167,0.0011403239,0.00003551671,0.0000131641145,0.00027958688,0.00015380366,0.054391228,0.0057020057,0.93376017,0.004440515,0.000029816794],"about_ca_topic_score_codex":0.0004981618,"about_ca_topic_score_gemma":0.00021036694,"teacher_disagreement_score":0.0030322876,"about_ca_system_score_codex":0.0007986885,"about_ca_system_score_gemma":0.00039732142,"threshold_uncertainty_score":0.010144055},"labels":[],"label_agreement":null},{"id":"W2950968451","doi":"10.48550/arxiv.1202.5788","title":"The filling problem in the cube","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Isoperimetric inequality; Cube (algebra); Exponent; Inequality; Mathematics; Combinatorics; Mathematical analysis","score_opus":0.07159900893230291,"score_gpt":0.18547465726437407,"score_spread":0.11387564833207116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950968451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4840566,0.0024686775,0.39821583,0.0055553853,0.0003872727,0.000110561494,0.0009864874,0.00050891086,0.10771031],"genre_scores_gemma":[0.90719736,0.001221795,0.07028006,0.00072702265,0.00023231555,0.0001800351,0.00049989816,0.00023151535,0.019430056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990589,0.0002191768,0.00004725736,0.00018189155,0.00024047562,0.00025225125],"domain_scores_gemma":[0.9969303,0.0018100142,0.00023390767,0.0003710421,0.0003513852,0.00030336194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081293494,0.000632402,0.0009368748,0.0008611533,0.0016721459,0.0032376416,0.001212126,0.0017184525,0.009941617],"category_scores_gemma":[0.0068958267,0.00060344103,0.00075377076,0.001258339,0.0022256116,0.004692732,0.0034124237,0.0025001932,0.0009955851],"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.00012776729,0.000023299328,0.0005328955,0.00014238594,0.000014271254,0.00018137255,0.0002209434,0.031111993,0.0033364706,0.94185543,0.004423726,0.018029429],"study_design_scores_gemma":[0.000026179781,0.000052187497,0.00040844886,0.00005036458,0.000014190043,0.00023513587,0.00022455017,0.14528032,0.003858446,0.83912045,0.010698779,0.000030913878],"about_ca_topic_score_codex":0.0029746706,"about_ca_topic_score_gemma":0.002326735,"teacher_disagreement_score":0.009941617,"about_ca_system_score_codex":0.0016223289,"about_ca_system_score_gemma":0.00077417534,"threshold_uncertainty_score":0.03325796},"labels":[],"label_agreement":null},{"id":"W2951012470","doi":"10.48550/arxiv.1304.6100","title":"Fault-Tolerant Renormalization Group Decoder for Abelian Topological Codes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity; Compute Canada","keywords":"Abelian group; Generalization; Decoding methods; Fault tolerance; Computer science; Logarithm; Code (set theory); Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Combinatorics; Set (abstract data type)","score_opus":0.06997492243038628,"score_gpt":0.202539798894542,"score_spread":0.1325648764641557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951012470","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.33106184,0.00015456197,0.6591325,0.0005590568,0.00012529397,0.00007982206,0.00012078004,0.0011827401,0.0075833844],"genre_scores_gemma":[0.8055831,0.000058345246,0.19183421,0.00013963273,0.000020338433,0.00007585845,0.000078023724,0.00008241302,0.0021279666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996737,0.00008200215,0.000023854656,0.00004623243,0.00012563277,0.00004858559],"domain_scores_gemma":[0.9990976,0.00032359583,0.00009449896,0.00029175426,0.00014593746,0.000046733778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038812883,0.00023932446,0.00041822914,0.0003649611,0.00045510914,0.0005975426,0.00076259684,0.0008798631,0.0012134376],"category_scores_gemma":[0.0023166654,0.0001327401,0.00030127453,0.00029918674,0.0008222437,0.00073370396,0.00089851103,0.00061018043,0.00037450666],"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.00041380624,0.00012677193,0.0020135038,0.00014426015,0.000056184363,0.0004346293,0.00039710835,0.26281697,0.11817831,0.513179,0.0024657277,0.09977369],"study_design_scores_gemma":[0.00003822452,0.00006893589,0.00025494306,0.000008535464,0.0000064772344,0.000120225646,0.000019810283,0.8821108,0.038885996,0.07639051,0.0020622965,0.000033173925],"about_ca_topic_score_codex":0.00076247554,"about_ca_topic_score_gemma":0.00087463734,"teacher_disagreement_score":0.0012134376,"about_ca_system_score_codex":0.0007579358,"about_ca_system_score_gemma":0.000821892,"threshold_uncertainty_score":0.005499184},"labels":[],"label_agreement":null},{"id":"W2951209655","doi":"10.48550/arxiv.1107.2636","title":"The Phase Transition for Dyadic Tilings","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Rectangle; Tile; Combinatorics; Square (algebra); Unit square; Disjoint sets; Infinity; Order (exchange); Unit (ring theory); Set (abstract data type); Unit cube; Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.09498437442748384,"score_gpt":0.20526079435209912,"score_spread":0.11027641992461529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951209655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6855669,0.0022655271,0.24812916,0.0033093377,0.00027230475,0.000118462885,0.0005732335,0.0006850734,0.059079997],"genre_scores_gemma":[0.9813658,0.0003861822,0.01385028,0.000267546,0.000071107694,0.00014696624,0.00017192485,0.000099368575,0.003640762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918586,0.00021049104,0.000037772486,0.00019771616,0.00019157735,0.00017665014],"domain_scores_gemma":[0.99213326,0.005460559,0.00056864705,0.000795444,0.00036863342,0.0006734439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015613165,0.0003250194,0.0007960773,0.0011249718,0.001553267,0.0030763026,0.001113017,0.0014766629,0.0077350875],"category_scores_gemma":[0.013777886,0.0007418279,0.00067943224,0.0005158534,0.0032368936,0.0036702694,0.00276973,0.0020701154,0.0007459611],"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.00038005304,0.00006999671,0.0016173441,0.00018974926,0.00003778662,0.00026348245,0.0005321967,0.026248856,0.009318408,0.94890535,0.003990495,0.0084463],"study_design_scores_gemma":[0.00013156669,0.00009837064,0.0010859305,0.00007659411,0.0000280448,0.0002581858,0.0002476573,0.22869101,0.0034372997,0.7611615,0.0047393357,0.000044614957],"about_ca_topic_score_codex":0.0011332473,"about_ca_topic_score_gemma":0.0008244429,"teacher_disagreement_score":0.0077350875,"about_ca_system_score_codex":0.0014529943,"about_ca_system_score_gemma":0.00062968384,"threshold_uncertainty_score":0.025876403},"labels":[],"label_agreement":null},{"id":"W2951734819","doi":"10.48550/arxiv.1312.5244","title":"Local structure approximation as a predictor of second order phase transitions in asynchronous cellular automata","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Cellular automaton; Asynchronous communication; Order (exchange); Stochastic cellular automaton; Automaton; Phase (matter); Phase transition; Computer science; Theoretical computer science; Statistical physics; Mathematics; Algorithm; Physics; Telecommunications; Economics; Quantum mechanics","score_opus":0.022729715268894096,"score_gpt":0.18676926282913545,"score_spread":0.16403954756024136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951734819","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83621526,0.0003515068,0.15893015,0.00042062794,0.000047188827,0.000024063158,0.0001569456,0.00055709196,0.0032971858],"genre_scores_gemma":[0.99630356,0.000044124514,0.0031114996,0.000018705636,0.000013593322,0.000009496784,0.000046066027,0.000018674855,0.0004343117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983287,0.000044139328,0.000006198728,0.00003886198,0.00004081986,0.000037150538],"domain_scores_gemma":[0.9961356,0.002380108,0.0005968957,0.00028319022,0.00028895692,0.00031524047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000547124,0.0003527872,0.0006006466,0.00087246357,0.0004939031,0.0008994562,0.0006362652,0.00076088513,0.0013963451],"category_scores_gemma":[0.00580519,0.0002778121,0.000364535,0.00037990464,0.000925418,0.0009720154,0.00065503985,0.0012515598,0.0002315166],"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.00033014704,0.00018061312,0.033697553,0.00012648909,0.000075685406,0.00037210042,0.00025618525,0.7956037,0.0178363,0.13496155,0.0018217869,0.014737882],"study_design_scores_gemma":[0.0000040351747,0.000016112954,0.00087254506,0.000002825966,0.0000032211956,0.000015478277,0.0000064629853,0.9853792,0.00076717505,0.012859086,0.00006920323,0.00000465514],"about_ca_topic_score_codex":0.0025070296,"about_ca_topic_score_gemma":0.0028087425,"teacher_disagreement_score":0.0025070296,"about_ca_system_score_codex":0.00068360724,"about_ca_system_score_gemma":0.0004007232,"threshold_uncertainty_score":0.0049848557},"labels":[],"label_agreement":null},{"id":"W2951776502","doi":"10.48550/arxiv.1203.0586","title":"An Undecidable Nested Recurrence Relation","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Undecidable problem; Relation (database); Recurrence relation; Turing; Mathematics; Combinatorics; Discrete mathematics; Computer science; Decidability","score_opus":0.08915350838469657,"score_gpt":0.2040125256352398,"score_spread":0.11485901725054323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951776502","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.27104732,0.0006688517,0.690249,0.0024913277,0.00028526597,0.00035488352,0.0016004451,0.0054914528,0.027811466],"genre_scores_gemma":[0.7584028,0.00042705762,0.21337529,0.00097366393,0.00017841689,0.00047673675,0.0028033673,0.0008018098,0.022560855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697495,0.0006253112,0.00027647114,0.00085711724,0.0007699195,0.00049626036],"domain_scores_gemma":[0.98615426,0.0096301,0.000634636,0.0014582219,0.0018306831,0.0002921736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021015853,0.0008018436,0.00066431274,0.00085385604,0.0018860642,0.0024463278,0.001962485,0.00167426,0.004617466],"category_scores_gemma":[0.012133095,0.0007742344,0.0017724439,0.0006108202,0.0031940935,0.0047871615,0.0021813428,0.0033029579,0.0008471532],"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.00017647301,0.00019871694,0.0018302683,0.0003124626,0.000056648696,0.00090298406,0.00094782125,0.035575945,0.016441002,0.9109873,0.0049064155,0.027663836],"study_design_scores_gemma":[0.000087471904,0.000068600806,0.0003686317,0.00004953629,0.00008773474,0.00036542548,0.00019321947,0.13432395,0.02225063,0.8278722,0.0142697655,0.000062773885],"about_ca_topic_score_codex":0.0060733645,"about_ca_topic_score_gemma":0.005875287,"teacher_disagreement_score":0.0060733645,"about_ca_system_score_codex":0.0021465742,"about_ca_system_score_gemma":0.0032032186,"threshold_uncertainty_score":0.015574515},"labels":[],"label_agreement":null},{"id":"W2952340381","doi":"10.48550/arxiv.0810.2144","title":"Asymptotics of Entropy Rate in Special Families of Hidden Markov Chains","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov chain; Statistical physics; Entropy (arrow of time); Mathematics; Econometrics; Mathematical economics; Statistics; Physics; Thermodynamics","score_opus":0.025805730062378525,"score_gpt":0.2452253360940297,"score_spread":0.21941960603165117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952340381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5494506,0.0012123031,0.42406723,0.001514353,0.00018651958,0.00008127696,0.00022637442,0.00062714843,0.022634163],"genre_scores_gemma":[0.9840793,0.00043279538,0.012776187,0.000118769516,0.00013174726,0.000104190556,0.00009915098,0.00012323992,0.002134602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990658,0.00034414994,0.00004974209,0.00015060141,0.00021744362,0.00017216304],"domain_scores_gemma":[0.99009585,0.006022618,0.0011928036,0.00086806616,0.0009072546,0.00091339234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029634263,0.00066186645,0.0010708383,0.0021490476,0.0014452415,0.001762404,0.0017635202,0.0016050647,0.0045311884],"category_scores_gemma":[0.021105086,0.0006890601,0.0012878414,0.0005429307,0.003736453,0.004539399,0.0024707667,0.0020928723,0.0003893586],"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.00006610614,0.0000342345,0.0017656124,0.000103537204,0.000036897265,0.00030889726,0.0003580021,0.0402056,0.004058324,0.9490678,0.0010179819,0.0029769575],"study_design_scores_gemma":[0.000018153169,0.000026793945,0.0007701225,0.0000495473,0.000017021215,0.00022386978,0.00008661359,0.50596005,0.0010953987,0.49120584,0.00051241764,0.000034237833],"about_ca_topic_score_codex":0.0011971496,"about_ca_topic_score_gemma":0.0007522732,"teacher_disagreement_score":0.0045311884,"about_ca_system_score_codex":0.0018362157,"about_ca_system_score_gemma":0.00071005564,"threshold_uncertainty_score":0.015672266},"labels":[],"label_agreement":null},{"id":"W2952598317","doi":"10.48550/arxiv.1002.3769","title":"Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Tile; Polyomino; Substitution tiling; Simple (philosophy); Plane (geometry); Mathematics; Combinatorics; Sequence (biology); Relation (database); Set (abstract data type); Enhanced Data Rates for GSM Evolution; Path (computing); Position (finance); Geometry; Computer science; Regular polygon","score_opus":0.040629447907060925,"score_gpt":0.18180049693962566,"score_spread":0.14117104903256472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952598317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81372505,0.000094935596,0.1733391,0.00011181582,0.0001082913,0.000061769875,0.00009998521,0.00053888897,0.011920135],"genre_scores_gemma":[0.96756816,0.000050687966,0.030058641,0.00003266422,0.0000068793347,0.00006977058,0.00005847579,0.00005629174,0.0020982695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980956,0.000044341057,0.00001316728,0.000043431457,0.000055354012,0.00003428147],"domain_scores_gemma":[0.9995303,0.00016885652,0.000056693672,0.0001610377,0.00003572946,0.000047338894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018779795,0.00017734172,0.00037091895,0.00018813077,0.000482164,0.0005227597,0.0006849581,0.00048812066,0.002573109],"category_scores_gemma":[0.0014606494,0.00020246545,0.00033993428,0.00017440543,0.001060103,0.00071047636,0.000805007,0.00040261954,0.00024475102],"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.00022531934,0.000094338764,0.0029237722,0.000123663,0.000038646387,0.00048536368,0.00046763607,0.75666404,0.037559744,0.18892504,0.00068911357,0.011803402],"study_design_scores_gemma":[0.000035355395,0.000088295266,0.0005575656,0.000011506164,0.000010084324,0.000079793994,0.00007789222,0.9473696,0.012898509,0.036334906,0.0025215223,0.000014962012],"about_ca_topic_score_codex":0.0012778497,"about_ca_topic_score_gemma":0.0017153927,"teacher_disagreement_score":0.002573109,"about_ca_system_score_codex":0.00050447055,"about_ca_system_score_gemma":0.00032825395,"threshold_uncertainty_score":0.008607864},"labels":[],"label_agreement":null},{"id":"W2952744308","doi":"","title":"Drohan – Experimental cybertribunal at the University of Montreal","year":2018,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Political science","score_opus":0.007800346862826437,"score_gpt":0.20761546745654602,"score_spread":0.1998151205937196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952744308","genre_codex":"other","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.08908727,0.015673272,0.1008011,0.057435557,0.008307221,0.0005227255,0.009683168,0.0049825427,0.7135072],"genre_scores_gemma":[0.36526638,0.0036680973,0.03317819,0.00070352654,0.0011620766,0.00024106273,0.0017198209,0.00064466713,0.5934161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976157,0.000581053,0.000029360654,0.00060690317,0.0006720237,0.00049500813],"domain_scores_gemma":[0.9974686,0.0006217422,0.00009476229,0.0003370833,0.00077092316,0.0007069836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020334146,0.0013294144,0.00108504,0.0015088171,0.003893528,0.0031459928,0.002209399,0.001433307,0.080921836],"category_scores_gemma":[0.0028999504,0.00046347373,0.0007528117,0.0007868839,0.0030950708,0.0017081016,0.002435078,0.0019827746,0.008931279],"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.00030418087,0.00015887638,0.0034094285,0.0002510379,0.00009549775,0.00079790154,0.0010590001,0.008378272,0.00553687,0.7315033,0.16736062,0.08114494],"study_design_scores_gemma":[0.000119536475,0.00018119992,0.007193589,0.00017680977,0.000031607568,0.0002673519,0.00045623438,0.013389285,0.009867001,0.040378526,0.92779064,0.00014815843],"about_ca_topic_score_codex":0.26712757,"about_ca_topic_score_gemma":0.30419138,"teacher_disagreement_score":0.26712757,"about_ca_system_score_codex":0.015056687,"about_ca_system_score_gemma":0.013282954,"threshold_uncertainty_score":0.53114545},"labels":[],"label_agreement":null},{"id":"W2952984793","doi":"10.48550/arxiv.math/0002019","title":"Lattice Substitution Systems and Model Sets","year":2000,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Lattice (music); Substitution (logic); Mathematics; Discrete mathematics; Combinatorics; Pure mathematics; Computer science; Physics","score_opus":0.05189958380949813,"score_gpt":0.27249169243907817,"score_spread":0.22059210862958004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952984793","genre_codex":"empirical","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.470602,0.0020034655,0.3757328,0.0028683671,0.00022788259,0.000086467495,0.0002205508,0.0005471662,0.14771132],"genre_scores_gemma":[0.95646876,0.00038639683,0.034420524,0.00018225898,0.000065405125,0.00011271695,0.00013424434,0.00007034031,0.008159251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984946,0.00057955016,0.000071083414,0.00022384962,0.00045706844,0.00017382627],"domain_scores_gemma":[0.9983082,0.0009856208,0.00012581534,0.00029411918,0.0001475723,0.0001386775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009121352,0.00038772827,0.00054339453,0.00085298467,0.0017463464,0.0034473145,0.0008954304,0.0013448783,0.0051327767],"category_scores_gemma":[0.0033219194,0.00041570433,0.00067053933,0.00081229664,0.0042351875,0.0032180564,0.0025337527,0.0015586644,0.00071606727],"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.000007636044,0.0000060025177,0.00007717481,0.000012820987,0.0000025016395,0.000035155193,0.00019546045,0.0032033417,0.00064524496,0.99421763,0.00019303465,0.0014038221],"study_design_scores_gemma":[0.000010872142,0.000012810075,0.00005092806,0.000009653786,0.000002820206,0.00007498445,0.00016845696,0.019559406,0.00079667935,0.97620106,0.003104315,0.000008044446],"about_ca_topic_score_codex":0.0011008139,"about_ca_topic_score_gemma":0.00096521823,"teacher_disagreement_score":0.0051327767,"about_ca_system_score_codex":0.0016220261,"about_ca_system_score_gemma":0.0006494958,"threshold_uncertainty_score":0.017170787},"labels":[],"label_agreement":null},{"id":"W2952993873","doi":"10.48550/arxiv.1205.3960","title":"A family of sand automata","year":2012,"lang":"en","type":"preprint","venue":"Open Research Online (The Open University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Surjective function; Equicontinuity; Automaton; Deterministic automaton; Mathematics; Two-way deterministic finite automaton; Cellular automaton; Stochastic cellular automaton; Continuous automaton; Simple (philosophy); Discrete mathematics; Pure mathematics; Computer science; Theoretical computer science; Algorithm; Mobile automaton; Automata theory; Quantum finite automata","score_opus":0.22906652377864925,"score_gpt":0.4087119972485586,"score_spread":0.17964547346990936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952993873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7035628,0.0007958208,0.22901858,0.00059030927,0.00015702056,0.000089717796,0.0003451237,0.00073899754,0.06470164],"genre_scores_gemma":[0.9716395,0.00022474969,0.01783127,0.00008277002,0.000033337474,0.00007766468,0.00019236459,0.000046952886,0.009871325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996319,0.000052329397,0.000025177504,0.00012846767,0.00009427891,0.00006784856],"domain_scores_gemma":[0.99906343,0.00028205375,0.00013487294,0.00016513164,0.00020233897,0.00015228172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025942302,0.0003302925,0.00039858054,0.00072225835,0.0015774567,0.0013654233,0.00050754315,0.0007904766,0.0045517925],"category_scores_gemma":[0.002186295,0.00025039772,0.0006703585,0.00039604775,0.0012870878,0.0013666813,0.00082006765,0.0005889923,0.00046134106],"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.00005848074,0.00002860138,0.0032470713,0.000059178663,0.000028441336,0.00065423246,0.0007263515,0.020970412,0.010578275,0.94971615,0.00150841,0.01242436],"study_design_scores_gemma":[0.00004453173,0.000073312374,0.0025784236,0.000047078724,0.000032871354,0.0013802836,0.00048673232,0.2654674,0.0052728215,0.6981149,0.026448078,0.000053603144],"about_ca_topic_score_codex":0.002542193,"about_ca_topic_score_gemma":0.0014699531,"teacher_disagreement_score":0.0045517925,"about_ca_system_score_codex":0.0008553756,"about_ca_system_score_gemma":0.00050203444,"threshold_uncertainty_score":0.015227258},"labels":[],"label_agreement":null},{"id":"W2953111785","doi":"10.48550/arxiv.0807.5028","title":"Counting Abelian Squares","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abelian group; Mathematics; Permutation (music); String (physics); Square (algebra); Combinatorics; Discrete mathematics; Physics; Mathematical physics; Geometry","score_opus":0.044474206606547585,"score_gpt":0.26584264931980356,"score_spread":0.22136844271325598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953111785","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.3900856,0.006393043,0.43392774,0.0035298686,0.0016443789,0.00016180646,0.0015686889,0.00228568,0.16040316],"genre_scores_gemma":[0.86933136,0.0021125413,0.09394223,0.0009270328,0.001201552,0.00039337168,0.0015559562,0.00075965584,0.029776411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650383,0.0007164946,0.00017746819,0.0009709822,0.0012400878,0.00039114707],"domain_scores_gemma":[0.9869826,0.007223404,0.0008131501,0.002112345,0.0021829947,0.00068547146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012361528,0.0007592649,0.0013120995,0.0035153432,0.0019112191,0.0037194549,0.0024360663,0.0019585663,0.013412712],"category_scores_gemma":[0.020739013,0.00072379346,0.0008198801,0.002290236,0.0027475373,0.008798059,0.0029739393,0.0020279903,0.0022000251],"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.00028988495,0.00009099757,0.0048786057,0.0005338972,0.000052691328,0.00036534,0.00040803113,0.012682212,0.016345952,0.8874107,0.013128468,0.06381327],"study_design_scores_gemma":[0.00002835641,0.0000744851,0.0019637418,0.00014051243,0.00004200008,0.0016202802,0.00017424546,0.10478167,0.012309884,0.86029965,0.018496228,0.00006899548],"about_ca_topic_score_codex":0.000811941,"about_ca_topic_score_gemma":0.00079477736,"teacher_disagreement_score":0.013412712,"about_ca_system_score_codex":0.0012496522,"about_ca_system_score_gemma":0.0006976826,"threshold_uncertainty_score":0.04487002},"labels":[],"label_agreement":null},{"id":"W2953178111","doi":"10.48550/arxiv.0908.0477","title":"Embedding odometers in cellular automata","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Odometer; Cellular automaton; Embedding; Mathematics; Automaton; Finitary; Computer science; Algorithm; Theoretical computer science; Discrete mathematics; Artificial intelligence","score_opus":0.039992859216306076,"score_gpt":0.2864453743557399,"score_spread":0.24645251513943384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953178111","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.32311803,0.00045308,0.661362,0.0005812881,0.00023153579,0.000066916735,0.00024399305,0.0006910829,0.013252137],"genre_scores_gemma":[0.88824445,0.00041852242,0.103447124,0.00011973968,0.000052147614,0.00011872709,0.0002482401,0.000091109134,0.007260072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917406,0.00017856609,0.000082949045,0.00025939246,0.00015111179,0.00015391347],"domain_scores_gemma":[0.9982157,0.00077798765,0.00022833564,0.00041102298,0.00019303321,0.00017397985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051823404,0.00069613114,0.00058532314,0.00041798345,0.0007256323,0.0016561507,0.00093830907,0.0009704641,0.0022327707],"category_scores_gemma":[0.0032996552,0.0004621368,0.0007708872,0.00047995948,0.0023440265,0.003059678,0.0040369406,0.0013416244,0.00056228956],"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.0002369013,0.000059317,0.0018004865,0.0002021786,0.000032635853,0.0003517753,0.00071572664,0.10698716,0.012006776,0.85010177,0.0006325675,0.026872788],"study_design_scores_gemma":[0.000055838944,0.00016996631,0.00038272413,0.00007716128,0.00003430123,0.00016687353,0.00048799603,0.24258128,0.014658805,0.7304482,0.0108829755,0.00005399249],"about_ca_topic_score_codex":0.0012131793,"about_ca_topic_score_gemma":0.0008450099,"teacher_disagreement_score":0.0022327707,"about_ca_system_score_codex":0.00078972563,"about_ca_system_score_gemma":0.00042665115,"threshold_uncertainty_score":0.007469356},"labels":[],"label_agreement":null},{"id":"W2953389333","doi":"10.48550/arxiv.math/0306136","title":"Asymptotic Randomization of Sofic Shifts by Linear Cellular Automata","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Randomization; Cellular automaton; Mathematics; Automaton; Combinatorics; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Medicine; Randomized controlled trial; Internal medicine","score_opus":0.021382318064634215,"score_gpt":0.24464773981906163,"score_spread":0.2232654217544274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953389333","genre_codex":"empirical","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.760012,0.00019939228,0.2289268,0.0006402099,0.00006617117,0.00006936299,0.00015571396,0.00082823966,0.009102139],"genre_scores_gemma":[0.9876446,0.000048188045,0.010290799,0.000068197885,0.000025165567,0.00005997786,0.00006433494,0.000033943317,0.0017647246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852544,0.0005062363,0.00009331934,0.00029567696,0.00027823471,0.00030118853],"domain_scores_gemma":[0.994975,0.0026344277,0.0007113786,0.0008702271,0.00040541173,0.00040359053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012866019,0.0003361704,0.0006515585,0.00070742186,0.00095110096,0.0014814071,0.00084009767,0.0009437249,0.0022749016],"category_scores_gemma":[0.009399047,0.0003933181,0.00078778266,0.0003435313,0.0024646383,0.0014482505,0.0014039135,0.0008915942,0.00029337674],"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.0005179007,0.00009053999,0.0057951226,0.00008106963,0.000070567374,0.00032989038,0.0005289942,0.16646971,0.02256168,0.7853524,0.0013618111,0.016840296],"study_design_scores_gemma":[0.0000783926,0.00011422101,0.0009572742,0.000016393085,0.000022755943,0.00011768797,0.00008900531,0.64395636,0.007535087,0.34579882,0.0012661424,0.000047891695],"about_ca_topic_score_codex":0.001623267,"about_ca_topic_score_gemma":0.001723065,"teacher_disagreement_score":0.0022749016,"about_ca_system_score_codex":0.0015750403,"about_ca_system_score_gemma":0.0007672993,"threshold_uncertainty_score":0.01142776},"labels":[],"label_agreement":null},{"id":"W2960311575","doi":"10.5194/ica-proc-2-66-2019","title":"LevelFilesSet: An efficient Data Structure for Scalable Web Tiled Map Management Systems","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ICA","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Tile; Scalability; Database; Context (archaeology); Data structure; Usability; Cloud computing; Benchmark (surveying); Web application; Data mining; Operating system","score_opus":0.01813176490824707,"score_gpt":0.24015836930463386,"score_spread":0.22202660439638677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960311575","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.027353136,0.00069069455,0.4859076,0.0007728207,0.0004449461,0.0011448843,0.04173312,0.42933103,0.012621735],"genre_scores_gemma":[0.320194,0.000522929,0.44433907,0.00083771197,0.00020227741,0.0033332212,0.17156507,0.045247227,0.01375853],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963838,0.0005103389,0.00047719895,0.0005627573,0.0017444195,0.00032150373],"domain_scores_gemma":[0.9912361,0.002046605,0.0005682819,0.0038332827,0.00170315,0.000612641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031530976,0.0019789378,0.0011093128,0.003288014,0.0011672437,0.0048788013,0.004731518,0.001423006,0.016420027],"category_scores_gemma":[0.014140662,0.0012718156,0.0013174841,0.0034361866,0.0012381651,0.0066738264,0.0059151305,0.002303619,0.010464083],"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.0045703873,0.0008246897,0.017149372,0.0017124272,0.000526417,0.0010531659,0.0017360061,0.060500503,0.030771876,0.03964248,0.4538122,0.38770032],"study_design_scores_gemma":[0.00089586,0.0005749325,0.006694313,0.00033701156,0.00010977043,0.0005243166,0.00067648536,0.4081246,0.101665236,0.03880789,0.44102004,0.0005695019],"about_ca_topic_score_codex":0.0058979755,"about_ca_topic_score_gemma":0.004838363,"teacher_disagreement_score":0.016420027,"about_ca_system_score_codex":0.0019851218,"about_ca_system_score_gemma":0.0026246258,"threshold_uncertainty_score":0.054930508},"labels":[],"label_agreement":null},{"id":"W2963279845","doi":"10.1017/s0143385708000096","title":"Module shifts and measure rigidity in linear cellular automata","year":2008,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Rigidity (electromagnetism); Cellular automaton; Measure (data warehouse); Pure mathematics; Algorithm; Computer science; Physics; Data mining","score_opus":0.01120029955708536,"score_gpt":0.2148972020198777,"score_spread":0.20369690246279232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963279845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8835147,0.00024200299,0.101794034,0.0002933262,0.00006123289,0.000029457633,0.00005771123,0.00027703107,0.013730594],"genre_scores_gemma":[0.99258786,0.000056058587,0.0054618884,0.00003164128,0.000024406943,0.000019337593,0.00002229614,0.000010154688,0.0017865233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991554,0.00018707737,0.00006723562,0.00023882011,0.00019371751,0.00015784505],"domain_scores_gemma":[0.9980096,0.00071503606,0.00040550463,0.00029907795,0.00020986026,0.00036094783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006931862,0.00030331212,0.00039370524,0.0008380229,0.001208849,0.0014412209,0.0006114469,0.0008298054,0.0029824786],"category_scores_gemma":[0.0026256095,0.00041231656,0.00056967844,0.0003815208,0.0030642748,0.0018367586,0.0019299826,0.0009095004,0.00041792387],"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.00011136314,0.000033381835,0.0015744512,0.00003643437,0.00001700948,0.00041760883,0.0007789863,0.013511306,0.010279751,0.9665669,0.00023169952,0.006441192],"study_design_scores_gemma":[0.000046262507,0.00021714493,0.001915317,0.000027659875,0.000029877809,0.00061458687,0.00044021005,0.08533627,0.01506097,0.8915973,0.004639391,0.000075059885],"about_ca_topic_score_codex":0.00059997744,"about_ca_topic_score_gemma":0.00052325,"teacher_disagreement_score":0.0029824786,"about_ca_system_score_codex":0.00088085386,"about_ca_system_score_gemma":0.000418937,"threshold_uncertainty_score":0.009977341},"labels":[],"label_agreement":null},{"id":"W2963381224","doi":"10.25088/complexsystems.16.2.123","title":"Dynamics of the Cellular Automaton Rule 142","year":2005,"lang":"en","type":"article","venue":"Complex Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cellular automaton; Computer science; Stochastic cellular automaton; Block cellular automaton; Elementary cellular automaton; Continuous automaton; Asynchronous cellular automaton; Deterministic automaton; Lattice gas automaton; Automaton; Dynamics (music); Theoretical computer science; Mobile automaton; Artificial intelligence; Physics; Automata theory","score_opus":0.01802567573994708,"score_gpt":0.22995662511108594,"score_spread":0.21193094937113888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963381224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8487325,0.0003089332,0.096167944,0.00082025415,0.000162849,0.00010337137,0.00031325343,0.0004106854,0.052980226],"genre_scores_gemma":[0.98530376,0.00009772798,0.009283267,0.00007011452,0.00001793856,0.00006254399,0.00016691351,0.00003248678,0.004965323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961096,0.00007146417,0.000014897615,0.00009712705,0.0001122378,0.000093358794],"domain_scores_gemma":[0.99933416,0.00021879062,0.000075583324,0.00009421705,0.000164878,0.00011234807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033010205,0.00023939545,0.00047928744,0.00037666678,0.0007532089,0.0017060335,0.00057892187,0.00072758185,0.004431505],"category_scores_gemma":[0.002374635,0.00015398732,0.00038310292,0.00030175343,0.0010757636,0.0010034034,0.00085990544,0.0006564389,0.0005187253],"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.00026532338,0.00015017929,0.006434305,0.00009416802,0.000052393905,0.000978478,0.000687787,0.20341265,0.035195146,0.7190306,0.0043235305,0.029375384],"study_design_scores_gemma":[0.000061696584,0.00014808471,0.0017069918,0.000019459529,0.000017833616,0.00030367397,0.0002229167,0.81145906,0.0060823997,0.1712944,0.008631184,0.000052378135],"about_ca_topic_score_codex":0.0033307723,"about_ca_topic_score_gemma":0.0011739938,"teacher_disagreement_score":0.004431505,"about_ca_system_score_codex":0.0006342754,"about_ca_system_score_gemma":0.00077779836,"threshold_uncertainty_score":0.014824927},"labels":[],"label_agreement":null},{"id":"W2963544297","doi":"","title":"Causal dynamics of discrete manifolds","year":2018,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Compute Canada","funders":"","keywords":"Decidability; Cellular automaton; Bounded function; Manifold (fluid mechanics); Mathematics; Automaton; Discrete time and continuous time; Subject (documents); Discrete mathematics; Pure mathematics; Theoretical computer science; Computer science; Algorithm; Mathematical analysis","score_opus":0.008602729393347082,"score_gpt":0.22188981261295337,"score_spread":0.2132870832196063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963544297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46869874,0.0024594264,0.3425805,0.0087382,0.00089415006,0.000081630315,0.00063283555,0.0007202734,0.1751942],"genre_scores_gemma":[0.96903616,0.00095870084,0.008509417,0.00018593596,0.00030403753,0.000040850242,0.00013502061,0.00004989806,0.020779988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998349,0.00004019721,0.0000054572797,0.000042376138,0.000052422347,0.000024596775],"domain_scores_gemma":[0.9993405,0.0002266445,0.000100206395,0.00005100053,0.0001301459,0.00015157447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028697745,0.00034533287,0.00043818547,0.0011803146,0.0007048062,0.0015779164,0.0004544851,0.0005809496,0.009865443],"category_scores_gemma":[0.0018030636,0.00017629979,0.0004108194,0.0004843403,0.001419176,0.0014059211,0.00089161046,0.00085642486,0.000389026],"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.000007747336,0.0000069876032,0.00014477734,0.000021226455,0.000005800932,0.000026007496,0.000088829875,0.007873712,0.0006818573,0.9882416,0.0008519881,0.0020494186],"study_design_scores_gemma":[0.000010910929,0.00001274193,0.00035295996,0.000009800549,0.000004397006,0.00002993199,0.00007144158,0.0554713,0.00025825453,0.9400354,0.0037353097,0.000007578515],"about_ca_topic_score_codex":0.002209244,"about_ca_topic_score_gemma":0.0012092423,"teacher_disagreement_score":0.009865443,"about_ca_system_score_codex":0.0013070076,"about_ca_system_score_gemma":0.00049808394,"threshold_uncertainty_score":0.03300315},"labels":[],"label_agreement":null},{"id":"W2963577935","doi":"10.25088/complexsystems.23.1.1","title":"Exponential Convergence to Equilibrium in Cellular Automata Asymptotically Emulating Identity","year":2014,"lang":"en","type":"article","venue":"Complex Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Conjecture; Mathematics; Class (philosophy); Generality; Cellular automaton; Identity (music); Convergence (economics); Simple (philosophy); Applied mathematics; Equilibrium point; Exponential function; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis; Algorithm; Differential equation; Physics; Artificial intelligence","score_opus":0.02941557110384363,"score_gpt":0.2716649678221423,"score_spread":0.24224939671829865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963577935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6717129,0.0003235976,0.3153281,0.0005154175,0.000036532023,0.000070890324,0.00007327006,0.0005436397,0.011395803],"genre_scores_gemma":[0.97309744,0.00012838442,0.0243807,0.00007861406,0.000014660122,0.0000933193,0.00006805479,0.000065548214,0.0020732856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990476,0.00032683733,0.0000454908,0.00016117342,0.00025341442,0.00016544554],"domain_scores_gemma":[0.9915006,0.0061076297,0.00061467744,0.0006713887,0.00080659596,0.00029911497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016230651,0.00041386767,0.0010113699,0.0010665857,0.0009132465,0.0014036449,0.0014079564,0.0009039483,0.0018619434],"category_scores_gemma":[0.019246375,0.00046173017,0.00069944083,0.00039219673,0.0025370833,0.0021474436,0.0015599375,0.0011872178,0.00027901639],"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.00020483775,0.00008730004,0.00603153,0.00014618892,0.000070661474,0.00040548123,0.00090210943,0.36473367,0.011628193,0.59901375,0.0008289415,0.015947398],"study_design_scores_gemma":[0.000022386015,0.0000630864,0.00065886736,0.000021954558,0.0000109157645,0.000087700726,0.000097897435,0.80959773,0.0030974373,0.18579574,0.0005237886,0.000022580445],"about_ca_topic_score_codex":0.0036451484,"about_ca_topic_score_gemma":0.0024657464,"teacher_disagreement_score":0.0036451484,"about_ca_system_score_codex":0.0016379537,"about_ca_system_score_gemma":0.0007476927,"threshold_uncertainty_score":0.0118842125},"labels":[],"label_agreement":null},{"id":"W2963809654","doi":"10.19086/da.611","title":"Computing automorphism groups of shifts using atypical equivalence classes","year":2016,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Automorphism; Mathematics; Sigma; Combinatorics; Bijection; Discrete mathematics; Invariant (physics); Dynamical systems theory; Type (biology); Alphabet; Physics","score_opus":0.024675517939264393,"score_gpt":0.2872768801559658,"score_spread":0.26260136221670144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963809654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56776255,0.00083429535,0.41534513,0.00065305544,0.00015082139,0.00012876297,0.0016222245,0.0017164664,0.011786746],"genre_scores_gemma":[0.929145,0.00027311064,0.06377114,0.00015054623,0.0001897338,0.0000997522,0.002423752,0.00032803888,0.0036189738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853814,0.00028722358,0.0001230835,0.0005156857,0.0003241112,0.000211788],"domain_scores_gemma":[0.9946195,0.0027835343,0.0006234675,0.0010738262,0.0004722045,0.0004274593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009804023,0.0008369919,0.000930641,0.0030638436,0.0012818597,0.0037968971,0.0011315893,0.00093539164,0.0060231076],"category_scores_gemma":[0.010990332,0.0005773016,0.0015259411,0.0018006251,0.002215888,0.008105843,0.0033021788,0.001561333,0.0011491528],"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.000683695,0.0003018634,0.024302475,0.000331296,0.0001658297,0.0004339465,0.002486569,0.054831967,0.010044766,0.74150205,0.0065533496,0.15836225],"study_design_scores_gemma":[0.000025226034,0.00005063748,0.00090374827,0.000028897584,0.000023319035,0.0000779793,0.00021501964,0.07665528,0.0016213331,0.91735864,0.0030173075,0.000022697424],"about_ca_topic_score_codex":0.002059255,"about_ca_topic_score_gemma":0.0025567901,"teacher_disagreement_score":0.0060231076,"about_ca_system_score_codex":0.0016260094,"about_ca_system_score_gemma":0.0007360805,"threshold_uncertainty_score":0.02014929},"labels":[],"label_agreement":null},{"id":"W2964019617","doi":"10.1007/s00224-018-9849-2","title":"The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC0","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","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":"Champlain Regional College","funders":"","keywords":"Conjugacy problem; Mathematics; Wreath product; Abelian group; Iterated function; Conjugacy class; Combinatorics; Group (periodic table); Discrete mathematics; Product (mathematics); Mathematical analysis","score_opus":0.011805493781271256,"score_gpt":0.22795040116212653,"score_spread":0.2161449073808553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964019617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62527126,0.0015394305,0.23904757,0.011164037,0.0013880882,0.00017302694,0.0003824554,0.0005476522,0.1204864],"genre_scores_gemma":[0.94479555,0.0007063434,0.018783445,0.0007065364,0.0010262255,0.00014712855,0.0004223104,0.0001997764,0.033212617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981263,0.00036954347,0.00014069781,0.0005221808,0.0004033502,0.00043796177],"domain_scores_gemma":[0.99498934,0.0030592952,0.00037665447,0.0007490497,0.00044080286,0.00038481914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017102234,0.0007700004,0.0016076152,0.0018377501,0.0052068257,0.0082992045,0.0019315254,0.0034532596,0.008171503],"category_scores_gemma":[0.008023341,0.0007151514,0.002295791,0.0023515867,0.0076612076,0.014411809,0.004141861,0.0054412205,0.0010461705],"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.000055987177,0.000025154088,0.00026608416,0.0000345629,0.000008635453,0.000085200096,0.0003893078,0.0005344602,0.00027276826,0.9928998,0.00088312547,0.0045448462],"study_design_scores_gemma":[0.00001589605,0.000014209298,0.00006717373,0.0000068375944,0.000007065611,0.000060373593,0.00011994523,0.0021148636,0.00052146724,0.99542856,0.0016347645,0.000008829159],"about_ca_topic_score_codex":0.0022352685,"about_ca_topic_score_gemma":0.0013023807,"teacher_disagreement_score":0.0082992045,"about_ca_system_score_codex":0.002752979,"about_ca_system_score_gemma":0.0022431638,"threshold_uncertainty_score":0.027336359},"labels":[],"label_agreement":null},{"id":"W2964065410","doi":"10.1017/s0143385709000601","title":"Embedding Bratteli–Vershik systems in cellular automata","year":2009,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Embedding; Cellular automaton; Diagram; Pure mathematics; Symbolic dynamics; Automaton; Type (biology); Path (computing); Space (punctuation); Constant (computer programming); Discrete mathematics; Combinatorics; Algorithm; Theoretical computer science; Computer science","score_opus":0.006515294413561903,"score_gpt":0.23206267460468294,"score_spread":0.22554738019112103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964065410","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.47908917,0.00049244106,0.48899892,0.00033377032,0.00017847984,0.00006824533,0.00013441397,0.0005507221,0.030153932],"genre_scores_gemma":[0.9484555,0.00017729704,0.042170975,0.000050680952,0.000029542378,0.000060505092,0.00007549093,0.000054746208,0.00892518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996024,0.00011537731,0.000028315902,0.00009913144,0.000080397316,0.000074298725],"domain_scores_gemma":[0.9995167,0.0001547398,0.000080081205,0.00010985983,0.000078247016,0.000060344788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031785681,0.00034636736,0.0003159603,0.0006334278,0.00059106975,0.0014428406,0.0005516475,0.000575101,0.0037287145],"category_scores_gemma":[0.0012337992,0.0002531728,0.00034356964,0.00037524986,0.001593039,0.0012666223,0.0012047,0.00071582635,0.00075935177],"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.00004439237,0.000020643798,0.0005864584,0.000034760396,0.00000922183,0.00014655736,0.00053533306,0.035506178,0.009572283,0.942189,0.00026492873,0.011090221],"study_design_scores_gemma":[0.00002559479,0.00010342843,0.00040793643,0.000035481713,0.000012508593,0.00015089604,0.0002718797,0.28306273,0.008722036,0.693575,0.013589448,0.00004308114],"about_ca_topic_score_codex":0.0016543919,"about_ca_topic_score_gemma":0.0014264603,"teacher_disagreement_score":0.0037287145,"about_ca_system_score_codex":0.0009990861,"about_ca_system_score_gemma":0.00040066932,"threshold_uncertainty_score":0.012473822},"labels":[],"label_agreement":null},{"id":"W2964183982","doi":"10.48550/arxiv.1709.00464","title":"Any shape can ultimately cross information on two-dimensional abelian\\n sandpile models","year":2017,"lang":"en","type":"book-chapter","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Compute Canada","funders":"","keywords":"Abelian sandpile model; Abelian group; Cellular automaton; Grid; Mathematics; Computer science; Pure mathematics; Statistical physics; Physics; Geometry; Algorithm","score_opus":0.0712074100768886,"score_gpt":0.2004572531335343,"score_spread":0.1292498430566457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964183982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74589187,0.0007220029,0.0842335,0.0012914545,0.00024466318,0.000058394762,0.0001434903,0.00033466986,0.16707991],"genre_scores_gemma":[0.9766802,0.00034486566,0.0070276414,0.00016069948,0.000054143387,0.000041802872,0.00009126468,0.000085594234,0.015513724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973184,0.00005324671,0.0000092532255,0.000049142225,0.000078443496,0.00007806751],"domain_scores_gemma":[0.9995116,0.000157259,0.000056640947,0.00011325732,0.000053314896,0.00010801297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035819825,0.00041151588,0.00051710755,0.00054573856,0.0018230443,0.0020484468,0.00095991883,0.0015160165,0.0045616836],"category_scores_gemma":[0.0013591175,0.00034490335,0.000854186,0.00034865143,0.0021327762,0.0024598727,0.0016810489,0.0012385218,0.0006028929],"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.000028275623,0.000016493734,0.00018042556,0.000027391827,0.0000065453114,0.0001320504,0.0001554052,0.0104159145,0.0017068606,0.98429966,0.0008023029,0.002228667],"study_design_scores_gemma":[0.000024698074,0.000059275968,0.00034313774,0.000023926781,0.000011314365,0.00028145476,0.00022793403,0.09262585,0.0021803002,0.9004558,0.0037404785,0.000025922956],"about_ca_topic_score_codex":0.0016751265,"about_ca_topic_score_gemma":0.0012912177,"teacher_disagreement_score":0.0045616836,"about_ca_system_score_codex":0.00085682597,"about_ca_system_score_gemma":0.00040911717,"threshold_uncertainty_score":0.015260398},"labels":[],"label_agreement":null},{"id":"W2974956530","doi":"10.1109/isit.2019.8849433","title":"A Deterministic Algorithm for the Capacity of Finite-State Channels","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Finite state; Polynomial; Gradient descent; Algorithm; State (computer science); Finite-state machine; Exponential function; Computer science; Time complexity; Mathematical optimization; Mathematics; Applied mathematics; Markov chain; Artificial intelligence; Artificial neural network; Mathematical analysis","score_opus":0.043175715006249206,"score_gpt":0.2687141391959147,"score_spread":0.2255384241896655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974956530","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.003319832,0.000072045514,0.99409086,0.00015131828,0.000047614278,0.00005876338,0.000073817784,0.0009920166,0.0011936906],"genre_scores_gemma":[0.20662145,0.00013530442,0.7877058,0.00017887852,0.00011678218,0.0004709218,0.0004756792,0.00046082697,0.0038343568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875784,0.00024900585,0.00006393816,0.0004103794,0.00035792735,0.00016098414],"domain_scores_gemma":[0.99678826,0.0019075793,0.00015514331,0.00046722594,0.00056397775,0.000117847965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012407433,0.0011233852,0.00092276506,0.0009899739,0.0008270946,0.0013685295,0.002655531,0.0017392857,0.006482711],"category_scores_gemma":[0.009032644,0.00062639866,0.0007947229,0.0009259008,0.0012334343,0.0022130695,0.0018303834,0.002805663,0.0015355897],"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.00020757609,0.00019034054,0.0008561702,0.00021739291,0.00009558498,0.00011167028,0.00014354454,0.593348,0.008213576,0.16541766,0.009118553,0.22207986],"study_design_scores_gemma":[0.000019967301,0.0000095199675,0.000046211568,0.0000068641266,0.0000037806078,0.000016468446,0.0000048170323,0.9735878,0.00130598,0.024301104,0.0006881759,0.000009296947],"about_ca_topic_score_codex":0.0056508454,"about_ca_topic_score_gemma":0.006183878,"teacher_disagreement_score":0.006482711,"about_ca_system_score_codex":0.0020529053,"about_ca_system_score_gemma":0.0033527028,"threshold_uncertainty_score":0.021686852},"labels":[],"label_agreement":null},{"id":"W2976677836","doi":"10.1109/cig.2019.8847947","title":"Automatic Generation of Diverse Cavern Maps with Morphing Cellular Automata","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Cellular automaton; Computer science; Automaton; Morphing; Mobile automaton; Function (biology); Theoretical computer science; Fitness function; Stochastic cellular automaton; Automata theory; Algorithm; Artificial intelligence; Machine learning; Genetic algorithm","score_opus":0.03616004166228312,"score_gpt":0.23779619693657664,"score_spread":0.20163615527429352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976677836","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.18308638,0.00011755465,0.7999227,0.00011936055,0.00009174673,0.00015994583,0.00013469098,0.0022385775,0.014129056],"genre_scores_gemma":[0.71222544,0.00009320324,0.28213474,0.0000642353,0.000009257045,0.00014463533,0.00019560053,0.0002842914,0.0048486777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984574,0.00002736874,0.000009799884,0.00004166172,0.000052709063,0.000022750954],"domain_scores_gemma":[0.9996063,0.00017603902,0.00002353151,0.00008665204,0.000074838266,0.00003276896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031656242,0.0003911052,0.00042610854,0.00052712887,0.0003928199,0.0006274694,0.0007494657,0.00040893446,0.0022506712],"category_scores_gemma":[0.0012164066,0.000273119,0.0006153367,0.0003438806,0.0005113924,0.0004739451,0.0010398077,0.00043257454,0.00035738538],"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.00014485772,0.00009516478,0.0041622636,0.00017169632,0.00008745712,0.0007120033,0.00065812276,0.625254,0.08288357,0.06742703,0.003944608,0.21445926],"study_design_scores_gemma":[0.00001396275,0.000035025972,0.0005296025,0.000008789416,0.000014174857,0.000116850264,0.00005027163,0.9785281,0.0070864223,0.010127411,0.0034722625,0.00001712902],"about_ca_topic_score_codex":0.0015896116,"about_ca_topic_score_gemma":0.0021373578,"teacher_disagreement_score":0.0022506712,"about_ca_system_score_codex":0.0004013075,"about_ca_system_score_gemma":0.00026841197,"threshold_uncertainty_score":0.0075292587},"labels":[],"label_agreement":null},{"id":"W2976780282","doi":"10.3390/e22111224","title":"Toy Models of Top Down Causation","year":2020,"lang":"en","type":"article","venue":"Entropy","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Foundational Questions Institute","keywords":"Causation; Property (philosophy); Probabilistic logic; Quantum cellular automaton; Top-down and bottom-up design; Consciousness; Cellular automaton; Automaton","score_opus":0.021859635299733008,"score_gpt":0.2303464100247634,"score_spread":0.20848677472503038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976780282","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.31480098,0.0019182069,0.46940473,0.011314549,0.00039157405,0.00013926462,0.0008273617,0.0012858817,0.19991747],"genre_scores_gemma":[0.9726792,0.00045953356,0.016445452,0.00029323745,0.00006271015,0.000108826265,0.00015921802,0.000054098615,0.009737854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952793,0.00018793854,0.000024799243,0.00006547053,0.000116210715,0.00007769533],"domain_scores_gemma":[0.99871755,0.00069260097,0.0001292313,0.00016568959,0.00011383107,0.00018117837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075226097,0.0006004628,0.0006292076,0.00080648775,0.0008481652,0.0021334419,0.0010989357,0.002065706,0.006899034],"category_scores_gemma":[0.0028916385,0.00043844414,0.0009682757,0.0005284731,0.0016683453,0.0025010637,0.001605758,0.0013130453,0.00051157596],"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.000016028947,0.000013387631,0.00030927075,0.000031260748,0.000014599021,0.00013421514,0.00009092959,0.04072946,0.0006848005,0.95604,0.00088969077,0.0010463751],"study_design_scores_gemma":[0.000023703873,0.000016721173,0.00023491189,0.000013841532,0.000013268446,0.00009214213,0.0000681921,0.32487538,0.00017663834,0.672682,0.0017900544,0.000013195433],"about_ca_topic_score_codex":0.0026212514,"about_ca_topic_score_gemma":0.0022154008,"teacher_disagreement_score":0.006899034,"about_ca_system_score_codex":0.0010110437,"about_ca_system_score_gemma":0.0006923925,"threshold_uncertainty_score":0.023079574},"labels":[],"label_agreement":null},{"id":"W2979654374","doi":"10.1017/etds.2019.69","title":"Support stability of maximizing measures for shifts of finite type","year":2019,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Victoria","funders":"","keywords":"Mathematics; Subshift of finite type; Ergodic theory; Invariant (physics); Type (biology); Finite set; Combinatorics; Context (archaeology); Probability measure; Function (biology); Property (philosophy); Discrete mathematics; Pure mathematics; Mathematical analysis; Mathematical physics","score_opus":0.015010123308197709,"score_gpt":0.23655735765615607,"score_spread":0.22154723434795837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979654374","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80101794,0.00038098087,0.18828325,0.00033909158,0.00007521336,0.00002484518,0.00009995768,0.00019890051,0.009579781],"genre_scores_gemma":[0.98565567,0.0001177288,0.011662174,0.000058824975,0.00005484131,0.000046809724,0.000074386706,0.000053053594,0.002276562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999446,0.00010091364,0.000027921975,0.00015380463,0.00017791477,0.000093529714],"domain_scores_gemma":[0.99838483,0.00061008584,0.00034532696,0.00019727112,0.00019967835,0.00026286603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070692046,0.00051800715,0.0006482071,0.00090149656,0.00078841206,0.0014347448,0.0006469233,0.00067903317,0.0023267805],"category_scores_gemma":[0.0046077305,0.00029955493,0.00053693313,0.00030023025,0.0023741652,0.0014406808,0.0015337915,0.0008197567,0.0003021585],"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.00014059822,0.0000323469,0.0017633731,0.0000703889,0.000033625,0.00024600048,0.00034150496,0.03622039,0.02327186,0.9286252,0.00045211217,0.008802575],"study_design_scores_gemma":[0.000040695944,0.00022536516,0.0022735933,0.00003033703,0.000021661575,0.00027961555,0.00031938276,0.30745137,0.011991745,0.6746645,0.0026405728,0.00006126064],"about_ca_topic_score_codex":0.0008310542,"about_ca_topic_score_gemma":0.0005489481,"teacher_disagreement_score":0.0023267805,"about_ca_system_score_codex":0.0010570765,"about_ca_system_score_gemma":0.00042448987,"threshold_uncertainty_score":0.00778389},"labels":[],"label_agreement":null},{"id":"W2989572253","doi":"","title":"Les automates cellulaires jouent le jeu","year":2019,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Computer science","score_opus":0.021952366194319714,"score_gpt":0.23534280394720794,"score_spread":0.21339043775288824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989572253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6003842,0.0025837556,0.28757316,0.0014901207,0.0020106053,0.00013761538,0.0012496185,0.00394576,0.100625195],"genre_scores_gemma":[0.7981757,0.001147901,0.06510212,0.00020345324,0.00025864068,0.00016552072,0.001205562,0.0019279926,0.13181308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853575,0.00016795876,0.000056192966,0.0004138955,0.0005929845,0.00023320744],"domain_scores_gemma":[0.99767727,0.0007068901,0.00016765711,0.0004603407,0.00076851936,0.00021927083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000731404,0.0012674344,0.0008705815,0.0020957282,0.0032609922,0.0047393977,0.001042817,0.0020919591,0.021146117],"category_scores_gemma":[0.0043590222,0.00074334047,0.0017731703,0.0013165446,0.0022501252,0.0027268685,0.0017342633,0.002449536,0.008718606],"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.0015006913,0.00027154214,0.017772932,0.00059362146,0.00026683253,0.003912913,0.0054018367,0.12472554,0.17910784,0.3590892,0.016688772,0.29066834],"study_design_scores_gemma":[0.00012388373,0.0004922159,0.0507567,0.00026833662,0.00020839085,0.0048937546,0.005018816,0.3550443,0.17743678,0.12561722,0.27961692,0.0005226565],"about_ca_topic_score_codex":0.014452748,"about_ca_topic_score_gemma":0.009353787,"teacher_disagreement_score":0.021146117,"about_ca_system_score_codex":0.0020347522,"about_ca_system_score_gemma":0.0010823826,"threshold_uncertainty_score":0.07074082},"labels":[],"label_agreement":null},{"id":"W2997069722","doi":"","title":"Traffic modeling and simulation: a devs library","year":2019,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Computer science; Visualization; Modeling and simulation; Theoretical computer science; Data mining; Simulation","score_opus":0.012922053873836402,"score_gpt":0.22261792460820848,"score_spread":0.20969587073437207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997069722","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029818118,0.0001663665,0.8859404,0.00014415185,0.000079089106,0.00016737785,0.0076183253,0.08943122,0.013471216],"genre_scores_gemma":[0.08285583,0.0018327079,0.80327386,0.0005301439,0.00012392653,0.002161685,0.039496727,0.03986207,0.029863127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995152,0.000066595196,0.00005551786,0.00008493928,0.00021865356,0.000059112204],"domain_scores_gemma":[0.9991246,0.00039000134,0.000045885026,0.00015622162,0.00022497264,0.000058393678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204346,0.0015566642,0.0010746445,0.0015581584,0.0007489973,0.0017643363,0.003072938,0.001120531,0.028184015],"category_scores_gemma":[0.0029073667,0.0013749995,0.002366464,0.0010073397,0.0005880469,0.0017732286,0.0017228986,0.0022129347,0.010976119],"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.00028799297,0.000461783,0.0040352726,0.0017301535,0.00037783393,0.0011176959,0.00064667175,0.39234865,0.020030463,0.19088309,0.18499376,0.20308656],"study_design_scores_gemma":[0.00015970481,0.000040804865,0.00046079478,0.00016972041,0.00007092984,0.00033874507,0.00003524964,0.6694211,0.02044302,0.03243001,0.27634963,0.00008025777],"about_ca_topic_score_codex":0.0045778174,"about_ca_topic_score_gemma":0.004691024,"teacher_disagreement_score":0.028184015,"about_ca_system_score_codex":0.0012511017,"about_ca_system_score_gemma":0.0017108422,"threshold_uncertainty_score":0.09428495},"labels":[],"label_agreement":null},{"id":"W3000423532","doi":"10.1016/j.jcta.2019.105189","title":"3D positive lattice walks and spherical triangles","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Horizon 2020; European Research Council","keywords":"Mathematics; Eigenvalues and eigenvectors; Exponent; Lattice (music); Combinatorics; Dirichlet distribution; Mathematical analysis; Pure mathematics; Boundary value problem","score_opus":0.010130364783296758,"score_gpt":0.22477403037329377,"score_spread":0.214643665589997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000423532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6390624,0.001204984,0.19929837,0.0016306278,0.0009498686,0.000119496435,0.00079331273,0.00053367345,0.15640733],"genre_scores_gemma":[0.9319116,0.0005690885,0.03092246,0.00035984605,0.00019275854,0.000093591036,0.00041047845,0.00020235126,0.03533778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966884,0.000090099966,0.00001711607,0.0000613333,0.00009702454,0.0000655273],"domain_scores_gemma":[0.9990036,0.00038271453,0.00014767311,0.00009392074,0.00014189523,0.00023026817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021188415,0.00051477994,0.00067572435,0.0014253217,0.0013242863,0.0028895524,0.0010749036,0.001873043,0.0113399895],"category_scores_gemma":[0.002035864,0.00054175156,0.000614111,0.0012662611,0.001559091,0.0016901884,0.0016853678,0.0013186272,0.0016355133],"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.00005979273,0.00003203131,0.0003218909,0.000037912414,0.00000693214,0.00017672294,0.00015972047,0.008620757,0.0020873682,0.9797301,0.0017816924,0.0069851507],"study_design_scores_gemma":[0.00002854776,0.000019310559,0.00024954655,0.00001739981,0.0000052639048,0.00021219639,0.00016358313,0.04966868,0.00062049227,0.94396085,0.0050361617,0.000017879185],"about_ca_topic_score_codex":0.0022229818,"about_ca_topic_score_gemma":0.0031862343,"teacher_disagreement_score":0.0113399895,"about_ca_system_score_codex":0.00072643807,"about_ca_system_score_gemma":0.000354471,"threshold_uncertainty_score":0.03793603},"labels":[],"label_agreement":null},{"id":"W3038021689","doi":"10.37236/444","title":"Honeycomb Arrays","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Honeycomb; Golomb coding; Honeycomb structure; Combinatorics; Mathematics; Grid; Hexagonal crystal system; Discrete mathematics; Computer science; Geometry; Materials science; Crystallography; Composite material; Artificial intelligence","score_opus":0.003704780689912189,"score_gpt":0.20950913473386448,"score_spread":0.20580435404395228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038021689","genre_codex":"other","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.12158562,0.010027428,0.3228449,0.0014981795,0.0011370364,0.00026615374,0.0015377076,0.0015326339,0.53957033],"genre_scores_gemma":[0.7412559,0.004868356,0.16224578,0.000930983,0.00030677058,0.00024423315,0.0012253737,0.00026166035,0.088661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960345,0.00007506414,0.000022185151,0.00010844693,0.000119610035,0.00007126599],"domain_scores_gemma":[0.99960166,0.00012708332,0.000041529664,0.000103127415,0.00007981497,0.00004674193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013642696,0.00029987152,0.00048521688,0.000855811,0.0010578664,0.00181745,0.0005721434,0.0008308273,0.01901156],"category_scores_gemma":[0.0011271863,0.00026279473,0.00045756774,0.00093245826,0.0012425801,0.0017045919,0.0012938189,0.00078544323,0.0036445963],"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.000071646245,0.000021876975,0.00042720424,0.00027152657,0.000019881028,0.0003710185,0.00023839642,0.0038707296,0.012455703,0.9020215,0.013781994,0.06644863],"study_design_scores_gemma":[0.00004065788,0.000110838555,0.00086236116,0.00012238699,0.000023660297,0.0019280629,0.00030687344,0.018213833,0.013034392,0.58561766,0.37968782,0.000051457],"about_ca_topic_score_codex":0.00046551094,"about_ca_topic_score_gemma":0.0006554861,"teacher_disagreement_score":0.01901156,"about_ca_system_score_codex":0.00034535132,"about_ca_system_score_gemma":0.00021827786,"threshold_uncertainty_score":0.0636},"labels":[],"label_agreement":null},{"id":"W3042993452","doi":"10.5194/agile-giss-1-6-2020","title":"Integrating cellular automata and discrete global grid systems: a case study into wildfire modelling","year":2020,"lang":"en","type":"article","venue":"AGILE GIScience Series","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Global Water Futures","keywords":"Computer science; Raster data; Spatial analysis; Cellular automaton; Raster graphics; Grid; Data mining; Data model (GIS); Spatial data infrastructure; Spatial database; Geographic information system; Distributed computing; Remote sensing; Algorithm; Artificial intelligence; Geography","score_opus":0.02080407555336356,"score_gpt":0.2511358208580585,"score_spread":0.23033174530469497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042993452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76097804,0.0018535479,0.21276315,0.0015677704,0.00013683697,0.00018203279,0.00034828976,0.00025187858,0.02191853],"genre_scores_gemma":[0.9460952,0.0006152851,0.050675765,0.000056974804,0.000020632035,0.000046683705,0.000100358084,0.000026868678,0.0023622971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992567,0.00045472322,0.000033765213,0.000074092124,0.00012895674,0.00005180709],"domain_scores_gemma":[0.9976986,0.0017479078,0.00008219517,0.00014990273,0.00023108817,0.00009027734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012166133,0.00042380698,0.00049821235,0.00063270074,0.0007196533,0.0015615827,0.00096964336,0.001404086,0.0012357497],"category_scores_gemma":[0.0024814361,0.00024649664,0.0006899057,0.0014815673,0.001002692,0.0011165438,0.0010468239,0.0010387701,0.00013235865],"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.000048069058,0.00011563577,0.0090598725,0.00009407946,0.0000496547,0.001344115,0.00048783794,0.93380654,0.0008630283,0.03572077,0.00091918354,0.017491188],"study_design_scores_gemma":[0.00000721456,0.00003271455,0.0007343488,0.000015473714,0.000013638181,0.000091080685,0.00031047198,0.9878385,0.00055703224,0.007616389,0.002773886,0.000009246061],"about_ca_topic_score_codex":0.030760363,"about_ca_topic_score_gemma":0.031522956,"teacher_disagreement_score":0.030760363,"about_ca_system_score_codex":0.0013118003,"about_ca_system_score_gemma":0.0006246974,"threshold_uncertainty_score":0.06116259},"labels":[],"label_agreement":null},{"id":"W3082726039","doi":"10.1142/s0129183120501727","title":"Approximating dynamics of a number-conserving cellular automaton by a finite-dimensional dynamical system","year":2020,"lang":"en","type":"article","venue":"International Journal of Modern Physics C","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Cellular automaton; Conjecture; Property (philosophy); Mathematics; Blocking (statistics); Dynamical systems theory; Word (group theory); Automaton; Statistical physics; Discrete mathematics; Computer science; Algorithm; Physics; Theoretical computer science; Geometry; Quantum mechanics","score_opus":0.010873882212506174,"score_gpt":0.23200056776650607,"score_spread":0.2211266855539999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082726039","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.45918816,0.00029123083,0.5270104,0.00052752247,0.00010040518,0.00004164941,0.00013374515,0.00040741617,0.012299457],"genre_scores_gemma":[0.95833784,0.0001308595,0.039504252,0.00005555019,0.000017521534,0.000050333903,0.00006173853,0.000026662525,0.0018151806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997547,0.00007831598,0.000015228415,0.000050783317,0.00006918133,0.0000318516],"domain_scores_gemma":[0.99939907,0.00028395656,0.000078723555,0.000112030735,0.0000827632,0.000043360415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046273018,0.0002664893,0.0005980765,0.0004047428,0.00051832816,0.0009816403,0.0009954661,0.0008269141,0.0015512842],"category_scores_gemma":[0.0017711958,0.00023043551,0.0005858716,0.0003416955,0.0015996196,0.0010336033,0.0005382077,0.0008020614,0.00022693082],"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.000042069518,0.00002558041,0.0011101043,0.00003159883,0.000018523735,0.0001040759,0.00011833463,0.8953947,0.005192535,0.09568829,0.00017906463,0.0020950795],"study_design_scores_gemma":[0.0000028652732,0.0000061573055,0.00006584324,0.0000020980208,0.0000017952254,0.000008450373,0.00000658628,0.99390864,0.00022404673,0.0056397934,0.0001304231,0.0000033554102],"about_ca_topic_score_codex":0.008415011,"about_ca_topic_score_gemma":0.003981708,"teacher_disagreement_score":0.008415011,"about_ca_system_score_codex":0.001306093,"about_ca_system_score_gemma":0.00080662227,"threshold_uncertainty_score":0.016732037},"labels":[],"label_agreement":null},{"id":"W3092960989","doi":"10.71781/15565","title":"Axiomatic approach to cellular algebras","year":2020,"lang":"en","type":"dissertation","venue":"Open MIND","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Axiom; Axiomatic system; Axiomatic design; Computer science; Mathematics; Algebra over a field; Pure mathematics; Engineering; Manufacturing engineering; Geometry","score_opus":0.03579606980954694,"score_gpt":0.2883995770603907,"score_spread":0.2526035072508438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092960989","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012350856,0.004369871,0.85849315,0.0035149688,0.00043816413,0.000059127116,0.00035030404,0.00024657545,0.12017703],"genre_scores_gemma":[0.5158839,0.007233964,0.41213807,0.0015573343,0.0011710619,0.00038075907,0.00082486443,0.00013890977,0.060671218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859947,0.0005351138,0.0001154793,0.00025263923,0.00037737456,0.000119908844],"domain_scores_gemma":[0.998585,0.00055385876,0.0000895696,0.0002480023,0.0004224592,0.00010118214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013821793,0.00058599806,0.0005252533,0.0021746163,0.0020438938,0.0037121822,0.0014517398,0.0011286293,0.008429454],"category_scores_gemma":[0.0022946869,0.00046200646,0.0015011908,0.0017723419,0.004235465,0.0043885284,0.002534476,0.0030649842,0.0015380643],"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.0000010287265,0.0000015544672,0.000021961647,0.000009780309,0.0000017817636,0.000011850493,0.000054527245,0.00044678492,0.00007797702,0.99792755,0.00025896216,0.0011861252],"study_design_scores_gemma":[0.0000025144216,0.0000048076004,0.000051961564,0.000012045834,0.0000039982374,0.000043842654,0.000050957213,0.003598917,0.00016985218,0.9804499,0.015606223,0.000005059667],"about_ca_topic_score_codex":0.003600247,"about_ca_topic_score_gemma":0.004595815,"teacher_disagreement_score":0.008429454,"about_ca_system_score_codex":0.0036820828,"about_ca_system_score_gemma":0.0015450742,"threshold_uncertainty_score":0.028199375},"labels":[],"label_agreement":null},{"id":"W3093799740","doi":"10.1017/s0963548320000395","title":"Mixing properties of colourings of the ℤ<i><sup>d</sup></i> lattice","year":2020,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Lattice (music); Mixing (physics); Mathematics; Physics; Space (punctuation); Discrete mathematics; Quantum mechanics; Computer science","score_opus":0.033059731071304485,"score_gpt":0.21504371675848513,"score_spread":0.18198398568718066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093799740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9479194,0.00024218712,0.045269895,0.00018113911,0.000025001022,0.00004041228,0.00018131247,0.00012192586,0.0060188146],"genre_scores_gemma":[0.9886938,0.000081659025,0.009612023,0.000043190066,0.000013402453,0.000036357713,0.00016637894,0.000033201868,0.0013200758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874,0.0002549124,0.000149716,0.00030450273,0.00027186234,0.00027908705],"domain_scores_gemma":[0.9958617,0.0015804344,0.0008284617,0.0006644299,0.00033390013,0.0007309868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075699,0.0003624102,0.00045311856,0.0012604605,0.0011013153,0.0031699257,0.0007179316,0.0007882884,0.002487567],"category_scores_gemma":[0.0037784367,0.00054289657,0.00067531265,0.00088636763,0.003507143,0.002611162,0.0012993972,0.00086122437,0.00026137664],"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.0019392252,0.0002846377,0.042478565,0.0002967379,0.00011913148,0.0010614444,0.0026002936,0.04857284,0.11403103,0.7467028,0.0020509546,0.03986235],"study_design_scores_gemma":[0.0001523727,0.0005818703,0.013978686,0.0001037995,0.00008465723,0.0012649157,0.0013726105,0.21989663,0.053420905,0.69942516,0.009561621,0.00015683037],"about_ca_topic_score_codex":0.0012064541,"about_ca_topic_score_gemma":0.0013282602,"teacher_disagreement_score":0.0031699257,"about_ca_system_score_codex":0.0012130338,"about_ca_system_score_gemma":0.00047975202,"threshold_uncertainty_score":0.008801162},"labels":[],"label_agreement":null},{"id":"W3096671525","doi":"10.1209/0295-5075/133/30002","title":"Erasing a majority-logic bit","year":2021,"lang":"en","type":"article","venue":"Europhysics Letters (EPL)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bit (key); Erasure; Bit field; Context (archaeology); 4-bit; Unit (ring theory); 32-bit; Control unit","score_opus":0.010446736144711323,"score_gpt":0.21397028576973023,"score_spread":0.20352354962501892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096671525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87041825,0.00078799075,0.111977436,0.0006224182,0.00026713524,0.000032361226,0.00007226411,0.00013033829,0.01569172],"genre_scores_gemma":[0.9915489,0.00016655591,0.00646158,0.0000542924,0.000017115399,0.000012246578,0.0000151898885,0.000015769985,0.0017083202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997725,0.000043463904,0.000012531603,0.00003829718,0.00007448208,0.000058723494],"domain_scores_gemma":[0.99897695,0.000645954,0.00009492315,0.0001406415,0.000089721994,0.00005192389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005158377,0.00026215732,0.00051127817,0.00031944684,0.00046882496,0.0008097131,0.00061423425,0.00073580875,0.0038282732],"category_scores_gemma":[0.0025504576,0.00014793323,0.00024036196,0.00020235716,0.0010169308,0.0012989597,0.00082566065,0.0004982437,0.0003433977],"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.0005305296,0.00013623867,0.0012850026,0.00038401634,0.0000803484,0.00041914792,0.00024700077,0.38206586,0.15109877,0.42868266,0.000876174,0.03419416],"study_design_scores_gemma":[0.000046483743,0.00028688935,0.00051875185,0.000059642152,0.000030029827,0.00015442581,0.00012835576,0.8088893,0.075918555,0.11105431,0.0028714295,0.00004177212],"about_ca_topic_score_codex":0.00026693838,"about_ca_topic_score_gemma":0.00029402133,"teacher_disagreement_score":0.0038282732,"about_ca_system_score_codex":0.00039649164,"about_ca_system_score_gemma":0.00039835012,"threshold_uncertainty_score":0.012806892},"labels":[],"label_agreement":null},{"id":"W3098921453","doi":"","title":"Density of periodic points, invariant measures and almost equicontinuous points of Cellular Automata","year":2006,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Trent University","keywords":"Equicontinuity; Ergodic theory; Invariant measure; Mathematics; Measure (data warehouse); Invariant (physics); Cellular automaton; Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis; Algorithm; Mathematical physics","score_opus":0.010389009847342407,"score_gpt":0.20576950581144693,"score_spread":0.19538049596410453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098921453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74781615,0.0011984939,0.22582127,0.00042333076,0.00003608292,0.00004460085,0.00012880722,0.00016076246,0.024370559],"genre_scores_gemma":[0.9880327,0.0002785185,0.009704398,0.00003127151,0.000031103464,0.000047684036,0.00006185267,0.000016989221,0.001795503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992493,0.00014373797,0.000054907858,0.00017467463,0.00028966615,0.00008761942],"domain_scores_gemma":[0.9975024,0.0011912693,0.00038232168,0.00019337267,0.00045762496,0.00027307708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008833825,0.00030228528,0.0006989191,0.0020456754,0.0009680317,0.001865774,0.0010222041,0.0006682427,0.0020923603],"category_scores_gemma":[0.005561406,0.00046746794,0.0005073971,0.0010345471,0.0028371585,0.0019793974,0.0014254047,0.0008914949,0.00019149465],"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.000060916183,0.000038710787,0.0037593348,0.00005200806,0.000022332579,0.00023071274,0.00053843105,0.019868422,0.004091135,0.96332186,0.00031939172,0.0076966803],"study_design_scores_gemma":[0.000029035642,0.0001039269,0.0038979133,0.000040143004,0.000023326254,0.0005539035,0.00037852483,0.22443157,0.0045196516,0.763256,0.0027248217,0.000041143165],"about_ca_topic_score_codex":0.0011185666,"about_ca_topic_score_gemma":0.0006445343,"teacher_disagreement_score":0.0020923603,"about_ca_system_score_codex":0.0014492646,"about_ca_system_score_gemma":0.00033547854,"threshold_uncertainty_score":0.010515273},"labels":[],"label_agreement":null},{"id":"W3134762287","doi":"10.1109/access.2021.3065067","title":"Synchronization of Variable-Length Constrained Sequence Codes","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Synchronization (alternating current); Sequence (biology); Computer science; Constraint (computer-aided design); Algorithm; Construct (python library); Variable (mathematics); Code word; Theoretical computer science; Mathematics; Decoding methods; Telecommunications","score_opus":0.03426689097728984,"score_gpt":0.30087552308067034,"score_spread":0.2666086321033805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134762287","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.3187564,0.00021420479,0.6763074,0.00011465973,0.000028893415,0.000049845134,0.00006707383,0.00015366082,0.0043079117],"genre_scores_gemma":[0.92924505,0.00013536094,0.068638384,0.00004387308,0.00001409614,0.00007663014,0.000089458226,0.000034188462,0.0017231042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995129,0.00017603968,0.000029037725,0.00007132004,0.00015201178,0.0000586345],"domain_scores_gemma":[0.9963245,0.0022262603,0.00051933725,0.00036857463,0.00047719554,0.00008403544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008089041,0.00028842434,0.00027339303,0.0003762082,0.00026322,0.00038481705,0.0005763689,0.00047086077,0.00094975217],"category_scores_gemma":[0.0052254274,0.00017779175,0.00018626501,0.00047010867,0.00086186716,0.0007755824,0.0005253364,0.0005197986,0.0001698065],"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.00017864691,0.000040821007,0.0013222564,0.00008198442,0.000023148288,0.00017018798,0.00015256293,0.7930034,0.03572439,0.1473073,0.0003466022,0.021648688],"study_design_scores_gemma":[0.000016561067,0.000069763664,0.00015896492,0.000010160776,0.000003949634,0.000049851235,0.000012694299,0.97260666,0.013682531,0.012731853,0.000645338,0.000011748213],"about_ca_topic_score_codex":0.0010938685,"about_ca_topic_score_gemma":0.0009128798,"teacher_disagreement_score":0.0010938685,"about_ca_system_score_codex":0.0006284081,"about_ca_system_score_gemma":0.0005982669,"threshold_uncertainty_score":0.0045594573},"labels":[],"label_agreement":null},{"id":"W3147304480","doi":"10.1007/978-981-15-8097-0_11","title":"Fuzzy Cellular Automata Model for Discrete Dynamical System Representing Spread of MERS and COVID-19 Virus","year":2020,"lang":"en","type":"book-chapter","venue":"Studies in big data","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Heritage College","funders":"","keywords":"Cellular automaton; Stochastic cellular automaton; Mathematics; Fuzzy logic; Dynamical systems theory; Applied mathematics; Continuous spatial automaton; Vagueness; Computer science; Automaton; Theoretical computer science; Automata theory; Algorithm; Quantum finite automata; Artificial intelligence; Physics","score_opus":0.2212649877803965,"score_gpt":0.3593921152581615,"score_spread":0.138127127477765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147304480","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.13269785,0.0034636077,0.8025744,0.0017938046,0.0008423931,0.00010983289,0.0016307642,0.0007807233,0.056106623],"genre_scores_gemma":[0.92633224,0.0013577817,0.040642716,0.00016986537,0.00014386745,0.00014981076,0.0007014071,0.00007034002,0.030431962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982053,0.000032974283,0.000010937227,0.000066258195,0.000038268867,0.00003103437],"domain_scores_gemma":[0.99974483,0.00012382174,0.000029314475,0.000018356202,0.000069677044,0.000013887792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001971824,0.0005563606,0.00086711266,0.0006229265,0.00066247897,0.0013222949,0.0012726597,0.0014623773,0.004677658],"category_scores_gemma":[0.0008952837,0.00022502315,0.00088600704,0.0005152593,0.00060797797,0.00094739924,0.00043038165,0.0008121023,0.00063740957],"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.000084974214,0.000036923,0.0014312499,0.00016063203,0.00006810409,0.0004954121,0.0002688349,0.830492,0.0075112134,0.13893689,0.0033923704,0.017121326],"study_design_scores_gemma":[0.0000053285376,0.000015526884,0.00020657784,0.000007798746,0.0000129795335,0.00005481358,0.000026230533,0.97838414,0.0003341038,0.019576121,0.0013655055,0.000010896943],"about_ca_topic_score_codex":0.021239817,"about_ca_topic_score_gemma":0.012975992,"teacher_disagreement_score":0.021239817,"about_ca_system_score_codex":0.0011668985,"about_ca_system_score_gemma":0.00079258217,"threshold_uncertainty_score":0.042232394},"labels":[],"label_agreement":null},{"id":"W3164823035","doi":"10.1007/s11047-020-09802-6","title":"Correction to: A class of discrete dynamical systems with properties of both cellular automata and L-systems","year":2020,"lang":"en","type":"article","venue":"Natural Computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Theory of computation; Class (philosophy); Dynamical systems theory; Automaton; Computer science; Cellular automaton; Theoretical computer science; Discrete mathematics; Mathematics; Algebra over a field; Applied mathematics; Calculus (dental); Pure mathematics; Algorithm; Artificial intelligence; Medicine; Physics","score_opus":0.013848029631338328,"score_gpt":0.217348694863998,"score_spread":0.20350066523265967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164823035","genre_codex":"editorial","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.0003406119,0.0009960316,0.0018852742,0.053277317,0.93832314,0.000029218863,0.0009284607,0.00041943172,0.0038003933],"genre_scores_gemma":[0.045682438,0.0075867036,0.009314805,0.08703251,0.65484214,0.00024961907,0.0020287898,0.0010586933,0.19220436],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972907,0.0004173322,0.0005412786,0.0005500509,0.0008976967,0.0003028754],"domain_scores_gemma":[0.97197556,0.007397721,0.0013678771,0.0021801654,0.01568766,0.0013910708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021278872,0.0018101833,0.0018388901,0.003269001,0.0026263352,0.0037616235,0.0043088333,0.007291579,0.0594236],"category_scores_gemma":[0.057967477,0.0008202716,0.0014792088,0.0023963193,0.0029037364,0.0029215184,0.00158314,0.009011686,0.025840597],"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.000073080795,0.0000104677765,0.00015754622,0.00030370086,0.00003296722,0.0005745572,0.00006020028,0.00015673084,0.0001119211,0.0052876864,0.9816024,0.011628851],"study_design_scores_gemma":[0.000075479664,0.000026516507,0.0008969012,0.00017506821,0.000046462712,0.0016679514,0.000092943366,0.0009639903,0.0005173838,0.009091242,0.98639256,0.00005347499],"about_ca_topic_score_codex":0.008607781,"about_ca_topic_score_gemma":0.010481492,"teacher_disagreement_score":0.0594236,"about_ca_system_score_codex":0.0034423315,"about_ca_system_score_gemma":0.0035328835,"threshold_uncertainty_score":0.19879174},"labels":[],"label_agreement":null},{"id":"W3165834393","doi":"","title":"Sobre els orígens del microscopi electrònic i la microscòpia electrònica.","year":2021,"lang":"ca","type":"article","venue":"Gimbernat: Revista d’Història de la Medicina i de les Ciències de la Salut","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy; Art","score_opus":0.006055651896391475,"score_gpt":0.2729347621151225,"score_spread":0.26687911021873106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165834393","genre_codex":"review","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.0025651369,0.628679,0.010363082,0.076602496,0.020432139,0.000057191657,0.00035899098,0.00042132198,0.2605206],"genre_scores_gemma":[0.062415365,0.48678198,0.011024424,0.027204186,0.015091696,0.00018052701,0.0003375475,0.00045638654,0.39650792],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99703884,0.0007118912,0.0001312346,0.0005938464,0.0013421773,0.00018211383],"domain_scores_gemma":[0.9968622,0.0015540996,0.00021743482,0.000267937,0.00092451356,0.000173821],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003470938,0.00084519107,0.0004361851,0.0029317834,0.0028266637,0.0045378003,0.001037565,0.0045263493,0.021066848],"category_scores_gemma":[0.004192615,0.000797724,0.0004885929,0.0022726452,0.008428915,0.006119326,0.002758762,0.006834492,0.008528898],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000089500136,0.000045039047,0.0007711525,0.0014274467,0.000024811752,0.00039505961,0.0026361784,0.00029933697,0.0038500214,0.3541406,0.37965336,0.25666744],"study_design_scores_gemma":[0.0000023150399,0.000010393076,0.00031692255,0.00026659574,0.0000028269783,0.00019661436,0.00018955578,0.000046418718,0.00070644007,0.014468513,0.9837816,0.000011837049],"about_ca_topic_score_codex":0.00725199,"about_ca_topic_score_gemma":0.010222945,"teacher_disagreement_score":0.9971733,"about_ca_system_score_codex":0.0047863573,"about_ca_system_score_gemma":0.0025775307,"threshold_uncertainty_score":0.07047564},"labels":[],"label_agreement":null},{"id":"W3173897895","doi":"10.24265/campus.2021.v26n31.07","title":"Modelado e implementación computacional de la propagación de las enfermedades de transmisión sexual por autómatas celulares (Cell-DEVS)","year":2021,"lang":"es","type":"article","venue":"Campus","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Humanities; Physics; Mathematics; Combinatorics; Philosophy","score_opus":0.011255078785409432,"score_gpt":0.28660372368946857,"score_spread":0.27534864490405914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173897895","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.06977022,0.0004111013,0.9049485,0.00088415004,0.00017528264,0.00008721547,0.00035272175,0.0007949412,0.02257586],"genre_scores_gemma":[0.81314254,0.0008640215,0.15751915,0.00020566823,0.0000759976,0.0003691452,0.00033004236,0.00011616577,0.02737724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958247,0.00014179478,0.000026481292,0.00010683855,0.00009375693,0.00004867776],"domain_scores_gemma":[0.9988856,0.00060482643,0.00008879442,0.00014549325,0.00021693156,0.000058324396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064574,0.00042072218,0.0005337964,0.0005075354,0.0005772829,0.0017963313,0.0010947613,0.0009143814,0.0053327386],"category_scores_gemma":[0.0023149455,0.00028228585,0.00091233547,0.00039178153,0.0010402199,0.0011365148,0.0009155758,0.00094799476,0.0007808692],"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.000103816514,0.000061366816,0.0032481377,0.00012735184,0.000043500982,0.00018668966,0.0003197213,0.7325306,0.0067578605,0.23155373,0.0012423297,0.02382491],"study_design_scores_gemma":[0.000020425741,0.000046877143,0.00042202143,0.000022218626,0.000024515635,0.000069026544,0.000067413595,0.96065396,0.0021573885,0.030842796,0.005657964,0.000015465916],"about_ca_topic_score_codex":0.010742046,"about_ca_topic_score_gemma":0.0059438385,"teacher_disagreement_score":0.010742046,"about_ca_system_score_codex":0.001304913,"about_ca_system_score_gemma":0.0015980867,"threshold_uncertainty_score":0.021359026},"labels":[],"label_agreement":null},{"id":"W3179990565","doi":"10.3390/math10030482","title":"Relationship between the Mandelbrot Algorithm and the Platonic Solids","year":2022,"lang":"en","type":"article","venue":"Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Université du Québec à Trois-Rivières","keywords":"Mandelbrot set; Tetrahedron; Dual polyhedron; Linear subspace; Mathematics; Cube (algebra); Codimension; Pure mathematics; Set (abstract data type); Algorithm; Combinatorics; Geometry; Computer science; Mathematical analysis; Fractal","score_opus":0.02878836117840774,"score_gpt":0.25076820104426817,"score_spread":0.22197983986586042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179990565","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.051089205,0.000614477,0.9258108,0.0005038124,0.000107855325,0.000060912633,0.0001080598,0.00027317042,0.021431712],"genre_scores_gemma":[0.48079225,0.0007341688,0.509623,0.00025866154,0.00013037762,0.00019165722,0.0003438385,0.00022380232,0.007702246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952734,0.000094452815,0.000027956088,0.00013205328,0.00016821775,0.000049981005],"domain_scores_gemma":[0.999094,0.00043664413,0.00008831202,0.00013993468,0.00016317608,0.00007800907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005769303,0.00034653052,0.00053649925,0.0011566079,0.00096612674,0.0015409361,0.0009687805,0.00085512217,0.004361071],"category_scores_gemma":[0.0042790556,0.0002896117,0.0005298435,0.0010905707,0.0019783229,0.0020623803,0.0015054173,0.0013497408,0.0007084622],"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.000051232375,0.00001550313,0.0007941162,0.000047028087,0.000012666544,0.000054889617,0.00011659985,0.045030545,0.0016068405,0.9083336,0.0009235686,0.043013517],"study_design_scores_gemma":[0.000016123795,0.00004576224,0.00028658358,0.000031424224,0.00000782837,0.00011213713,0.000057170135,0.5151807,0.0019667612,0.4746852,0.0075864606,0.000023765015],"about_ca_topic_score_codex":0.003073103,"about_ca_topic_score_gemma":0.0029466613,"teacher_disagreement_score":0.004361071,"about_ca_system_score_codex":0.000989461,"about_ca_system_score_gemma":0.0010258871,"threshold_uncertainty_score":0.0145891905},"labels":[],"label_agreement":null},{"id":"W3193514958","doi":"10.1137/1.9781611977585.ch26","title":"Derandomization of Cell Sampling","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Upper and lower bounds; Sampling (signal processing); Combinatorics; Mathematics; Space (punctuation); Data structure; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.08570688289768974,"score_gpt":0.2505991959414971,"score_spread":0.16489231304380736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193514958","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.096937515,0.002706169,0.7874906,0.012463373,0.0007877973,0.00048136193,0.0025071031,0.0035862587,0.0930398],"genre_scores_gemma":[0.78325814,0.0022882537,0.1601576,0.00684958,0.0011600497,0.0021201388,0.0038596,0.0022397335,0.038066875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98987854,0.0034678662,0.0005242617,0.0021566818,0.002594471,0.0013780333],"domain_scores_gemma":[0.9459394,0.037435718,0.0009731453,0.012436611,0.002209965,0.0010051025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005883347,0.0010499726,0.0019013335,0.0010166682,0.0020688195,0.0041229916,0.0041431733,0.0025099767,0.013299543],"category_scores_gemma":[0.040825114,0.00085114577,0.0020115057,0.0023016986,0.0049977726,0.009045368,0.007479413,0.007808633,0.0038327056],"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.00083482853,0.00015739055,0.0026136704,0.00048228263,0.00013279068,0.00022778516,0.0005732002,0.05958755,0.008824197,0.8135499,0.03636392,0.07665252],"study_design_scores_gemma":[0.00017731247,0.00010219692,0.00040063108,0.00009074451,0.00006203074,0.00019356573,0.00007993616,0.22153468,0.008454726,0.7471421,0.021717312,0.000044800287],"about_ca_topic_score_codex":0.0023015495,"about_ca_topic_score_gemma":0.0024200524,"teacher_disagreement_score":0.013299543,"about_ca_system_score_codex":0.003818602,"about_ca_system_score_gemma":0.0039027226,"threshold_uncertainty_score":0.04449147},"labels":[],"label_agreement":null},{"id":"W3194024262","doi":"10.1142/s0129183122501480","title":"Deterministic cellular automata resembling diffusion","year":2022,"lang":"en","type":"article","venue":"International Journal of Modern Physics C","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Cellular automaton; Diffusion; Computer science; Automaton; Statistical physics; Phase transition; Order (exchange); Mathematics; Theoretical computer science; Algorithm; Physics; Thermodynamics","score_opus":0.020934310814064605,"score_gpt":0.27041578187123294,"score_spread":0.24948147105716834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194024262","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.3976422,0.0011904996,0.563509,0.0008555713,0.00019867941,0.00010100109,0.00031495234,0.00055555266,0.035632674],"genre_scores_gemma":[0.94126695,0.00040463792,0.052300308,0.00011094483,0.000038935454,0.00006623838,0.00010615029,0.000040927705,0.0056648757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996141,0.00010347242,0.000028001077,0.000115944305,0.000087685774,0.00005068155],"domain_scores_gemma":[0.99900705,0.00048044772,0.00014788221,0.00016288481,0.00013498346,0.00006676956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039299275,0.0003578632,0.00058724097,0.0005172658,0.00052934047,0.0012377794,0.00072146824,0.0009859768,0.0020096123],"category_scores_gemma":[0.0026173475,0.00024206753,0.0007251246,0.0003925558,0.0013939476,0.0012871174,0.0006733544,0.0006349948,0.00026010734],"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.00005304697,0.000030305606,0.0012902393,0.00008886136,0.000033771128,0.00020097688,0.00022811681,0.35783616,0.016532859,0.61538976,0.0004764787,0.00783945],"study_design_scores_gemma":[0.000027362199,0.00003306731,0.00039955793,0.000012982334,0.00001612445,0.00012273874,0.0000390582,0.8474998,0.0023860843,0.14585863,0.0035816568,0.000022882785],"about_ca_topic_score_codex":0.0034709827,"about_ca_topic_score_gemma":0.0014939002,"teacher_disagreement_score":0.0034709827,"about_ca_system_score_codex":0.0011110626,"about_ca_system_score_gemma":0.00054923753,"threshold_uncertainty_score":0.008061349},"labels":[],"label_agreement":null},{"id":"W3197050076","doi":"","title":"Computational Discovery with Newton Fractals, Bohemian Matrices, & Mandelbrot Polynomials","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mandelbrot set; Fractal; Algebraic number; Computational complexity theory; Mathematics; Computer science; Mathematics education; Algebra over a field; Pure mathematics; Algorithm; Mathematical analysis","score_opus":0.03340695656864227,"score_gpt":0.17915823558501906,"score_spread":0.1457512790163768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197050076","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.14847597,0.0071563455,0.6961135,0.015024346,0.0011693932,0.00009963741,0.0003401769,0.0006190921,0.13100159],"genre_scores_gemma":[0.7741168,0.0027034779,0.20529704,0.0006764724,0.001018566,0.00011676045,0.00015267813,0.00014321611,0.015774844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990721,0.00034312866,0.00004607678,0.00013815727,0.00031280797,0.00008775824],"domain_scores_gemma":[0.9969126,0.0020619966,0.00023347339,0.00037314525,0.00024460707,0.00017416051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017810041,0.0004844213,0.00061194453,0.0022263986,0.0018707098,0.0028130477,0.00075227924,0.0011810631,0.004220423],"category_scores_gemma":[0.008092379,0.00047554733,0.00095008744,0.0015522003,0.0045901993,0.0061501497,0.002678153,0.002443675,0.00058679533],"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.00000629868,0.0000032828175,0.00007995275,0.00001565601,0.0000023944149,0.0000124554235,0.00006774691,0.0014625881,0.000108152955,0.9942713,0.00081673684,0.003153393],"study_design_scores_gemma":[0.000006068092,0.000005409171,0.0001006601,0.000013411469,0.0000030791357,0.000036031906,0.000031597323,0.01849259,0.000358303,0.975476,0.0054644407,0.000012311985],"about_ca_topic_score_codex":0.0025587985,"about_ca_topic_score_gemma":0.0023886806,"teacher_disagreement_score":0.004220423,"about_ca_system_score_codex":0.0017358565,"about_ca_system_score_gemma":0.0010617939,"threshold_uncertainty_score":0.014118731},"labels":[],"label_agreement":null},{"id":"W3203113362","doi":"10.24018/ejece.2021.5.5.360","title":"Signal Propagation in Transmission Lines with Losses Using Fibonacci Wave Functions","year":2021,"lang":"en","type":"article","venue":"European Journal of Electrical Engineering and Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Resistor; Heaviside step function; Electric power transmission; Lossless compression; Fibonacci number; Transmission line; Capacitor; Inductor; Topology (electrical circuits); Electrical impedance; Transfer function; Computer science; Physics; Electronic engineering; Electrical engineering; Voltage; Telecommunications; Mathematics; Engineering; Mathematical analysis; Algorithm","score_opus":0.011731227980297604,"score_gpt":0.19577578014840874,"score_spread":0.18404455216811114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203113362","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.024576444,0.000523118,0.9648081,0.00015078692,0.00008200675,0.000050207324,0.00007379499,0.00019413543,0.00954137],"genre_scores_gemma":[0.69195074,0.0026801797,0.2802388,0.00031308518,0.000088160574,0.00031472716,0.0002739158,0.0001876341,0.023952711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997832,0.00004975759,0.000012251507,0.000037825648,0.0000916793,0.000025232926],"domain_scores_gemma":[0.9997378,0.0001205348,0.000038701994,0.000035737285,0.000057304693,0.000009822151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042941372,0.00085112633,0.0004682124,0.0008709967,0.0005010408,0.0011115278,0.00086792064,0.0010580452,0.001958942],"category_scores_gemma":[0.0012255732,0.00037444205,0.0005736218,0.0008364458,0.0009345218,0.0023552713,0.00032909997,0.0008656374,0.0006152901],"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.000068213936,0.000050406226,0.00043192494,0.00022247207,0.000026817079,0.00059201266,0.0004301335,0.27557388,0.036960702,0.65395457,0.0019456957,0.029743137],"study_design_scores_gemma":[0.00001796903,0.000053805838,0.00023360357,0.00003397766,0.000012662497,0.00030401445,0.000060125236,0.87794304,0.0048727673,0.11081187,0.0056177303,0.00003848742],"about_ca_topic_score_codex":0.0026337926,"about_ca_topic_score_gemma":0.0017429828,"teacher_disagreement_score":0.0026337926,"about_ca_system_score_codex":0.0012246128,"about_ca_system_score_gemma":0.0003930514,"threshold_uncertainty_score":0.008885205},"labels":[],"label_agreement":null},{"id":"W3205806476","doi":"10.1007/s10867-021-09592-7","title":"Predictive landscapes hidden beneath biological cellular automata","year":2021,"lang":"en","type":"preprint","venue":"Journal of Biological Physics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Cellular automaton; Dynamical systems theory; Living systems; Computer science; Stochastic cellular automaton; Nonlinear system; Complex system; Automaton; Theoretical computer science; Measure (data warehouse); Statistical physics; Artificial intelligence; Physics; Data mining","score_opus":0.040944105526100644,"score_gpt":0.2624568567713256,"score_spread":0.22151275124522493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205806476","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.40868014,0.0071692285,0.51319724,0.008540525,0.00052940805,0.0000635823,0.0007495034,0.0014605293,0.059609815],"genre_scores_gemma":[0.98187596,0.0010179835,0.01227888,0.00032087092,0.00013667977,0.000049709524,0.00019785014,0.00009203975,0.0040300903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960345,0.00011999335,0.000019603327,0.00009831827,0.00009647595,0.00006210218],"domain_scores_gemma":[0.99663466,0.002314986,0.0003217519,0.00030287603,0.0002548648,0.00017097472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007327924,0.0004918531,0.0008230331,0.0011659364,0.0008919473,0.0024747257,0.0010447811,0.0015335572,0.003218734],"category_scores_gemma":[0.007185752,0.0004702998,0.0008005259,0.00050014205,0.0026212777,0.0026745002,0.0015310388,0.0017940422,0.00031054774],"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.00004320661,0.0000194112,0.0015193709,0.00008770378,0.000038183156,0.00020023074,0.00022968787,0.28082174,0.0016808779,0.7044397,0.0021851456,0.0087347785],"study_design_scores_gemma":[0.000007534992,0.000008866443,0.00027870745,0.000018026136,0.000009002909,0.000030876443,0.000026803798,0.61367273,0.00023608732,0.38441056,0.0012863805,0.000014440436],"about_ca_topic_score_codex":0.003925246,"about_ca_topic_score_gemma":0.0022267438,"teacher_disagreement_score":0.003925246,"about_ca_system_score_codex":0.0016189372,"about_ca_system_score_gemma":0.0005622204,"threshold_uncertainty_score":0.011746287},"labels":[],"label_agreement":null},{"id":"W3211579232","doi":"10.1090/proc/16333","title":"A geometric generalization of Kaplansky’s direct finiteness conjecture","year":2022,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Dawson College","funders":"","keywords":"Generalization; Conjecture; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.009833542175696791,"score_gpt":0.226345796022665,"score_spread":0.2165122538469682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211579232","genre_codex":"other","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.3257919,0.0028168163,0.18507788,0.015275441,0.0009102542,0.00009043832,0.0011984085,0.0015103703,0.46732843],"genre_scores_gemma":[0.9533326,0.0007575323,0.013671501,0.0013672336,0.000712992,0.00007589503,0.0010037017,0.00015880216,0.028919723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861205,0.00025760298,0.000059233316,0.0005854041,0.00028496896,0.00020067365],"domain_scores_gemma":[0.99733573,0.0012631639,0.00024041024,0.00056234386,0.00037460178,0.00022369348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013286384,0.00068589684,0.00080986816,0.001312509,0.0016531685,0.0027190412,0.0011708557,0.0011698512,0.020160846],"category_scores_gemma":[0.0049734935,0.0003686608,0.0010043278,0.0012012395,0.0047196164,0.009593953,0.003409916,0.0027349282,0.0024574483],"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.000035817822,0.000019443934,0.0005016417,0.00005223225,0.000008886424,0.00008874673,0.00027308328,0.00073599874,0.00028847382,0.9866954,0.0040260367,0.007274383],"study_design_scores_gemma":[0.000016159214,0.000014593316,0.00026294676,0.000012289717,0.000007592249,0.000085714324,0.00009789442,0.0015053536,0.0002826565,0.99115866,0.0065470887,0.000009008413],"about_ca_topic_score_codex":0.0019971726,"about_ca_topic_score_gemma":0.0015431385,"teacher_disagreement_score":0.020160846,"about_ca_system_score_codex":0.0021450296,"about_ca_system_score_gemma":0.0008912287,"threshold_uncertainty_score":0.0674448},"labels":[],"label_agreement":null},{"id":"W3211913805","doi":"","title":"PLUGIn: A simple algorithm for inverting generative models with recovery guarantees","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Simple (philosophy); Computer science; Plug-in; Algorithm; Generative model; Generative grammar; Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.024443581683610983,"score_gpt":0.24393023563814464,"score_spread":0.21948665395453365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211913805","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.002652313,0.000051616338,0.9772314,0.00012431586,0.00008709032,0.000071605486,0.00023734187,0.017909534,0.0016348806],"genre_scores_gemma":[0.16918668,0.00010796707,0.81051695,0.00030011198,0.00011418743,0.00038840596,0.001333761,0.0075203283,0.010531586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999134,0.00019959564,0.000049983162,0.00023878676,0.00025864053,0.000118863216],"domain_scores_gemma":[0.99784434,0.0012704756,0.00005333099,0.00056023145,0.0001852115,0.0000864993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013585525,0.0023796933,0.0012417377,0.0011249117,0.0006404729,0.0021823372,0.0025480762,0.0019964115,0.03703327],"category_scores_gemma":[0.009441149,0.0013062478,0.0013234717,0.000783363,0.0011817755,0.0031944579,0.004501584,0.003370666,0.009926216],"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.0011034483,0.00034430597,0.0015156971,0.000367686,0.00017376177,0.0008367062,0.0003133692,0.08899886,0.015373408,0.08581553,0.039646246,0.765511],"study_design_scores_gemma":[0.00018910877,0.00006101826,0.00018132139,0.00003984462,0.00003357597,0.00025130252,0.00006096056,0.8219508,0.016894616,0.14737098,0.012915866,0.00005058263],"about_ca_topic_score_codex":0.0023020522,"about_ca_topic_score_gemma":0.0051414836,"teacher_disagreement_score":0.03703327,"about_ca_system_score_codex":0.0006356948,"about_ca_system_score_gemma":0.0014025492,"threshold_uncertainty_score":0.12388861},"labels":[],"label_agreement":null},{"id":"W334093148","doi":"10.1007/s10440-013-9819-2","title":"Independence entropy of $\\mathbb{Z}^{d}$ -shift spaces","year":2013,"lang":"en","type":"article","venue":"Acta Applicandae Mathematicae","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":31,"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 British Columbia","funders":"","keywords":"Mathematics; Topological entropy; Entropy (arrow of time); Limiting; Joint quantum entropy; Differential entropy; Topological entropy in physics; Discrete mathematics; Pure mathematics; Principle of maximum entropy; Physics; Topological quantum number; Quantum mechanics","score_opus":0.008565788645505834,"score_gpt":0.22597319743617922,"score_spread":0.21740740879067338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W334093148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81862384,0.0007724079,0.12679915,0.0018913624,0.00014783237,0.000044918175,0.00066303177,0.00016940502,0.050888095],"genre_scores_gemma":[0.9800853,0.00031634638,0.0057276264,0.0001925948,0.00022088623,0.00006467967,0.00048380735,0.00006671653,0.012841895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989502,0.00024977527,0.000053352174,0.00018748238,0.00033728845,0.00022200773],"domain_scores_gemma":[0.99634886,0.0018406761,0.0004034077,0.00029932382,0.000454046,0.00065374275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013607278,0.00060564553,0.0009460196,0.0025172457,0.0018910212,0.0029679295,0.001259134,0.0012546609,0.0066203084],"category_scores_gemma":[0.0048086573,0.00049764256,0.00081637426,0.0013312757,0.003358466,0.0037394683,0.0026006424,0.001819407,0.0004991172],"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.00006314179,0.0000197734,0.0004208479,0.000018320781,0.000010746697,0.000031058895,0.00009669527,0.002165818,0.00074121344,0.9942603,0.00044033036,0.0017316754],"study_design_scores_gemma":[0.00001526103,0.00001723417,0.0009920107,0.0000075719677,0.00000855392,0.000046524365,0.000049633632,0.022983007,0.00080099003,0.974245,0.0008136422,0.000020525486],"about_ca_topic_score_codex":0.0015990547,"about_ca_topic_score_gemma":0.0012561064,"teacher_disagreement_score":0.0066203084,"about_ca_system_score_codex":0.0016901465,"about_ca_system_score_gemma":0.0011927974,"threshold_uncertainty_score":0.022147179},"labels":[],"label_agreement":null},{"id":"W34531100","doi":"","title":"The spatial structure of odometers in certain cellular automata","year":2008,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Cellular automaton; Odometer; Computer science; Automaton; Artificial intelligence; Theoretical computer science","score_opus":0.010348924461216567,"score_gpt":0.21256326238556994,"score_spread":0.20221433792435337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34531100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85733527,0.00032101336,0.12297181,0.00031597354,0.000057026904,0.00004695363,0.00026050585,0.00023365606,0.01845783],"genre_scores_gemma":[0.98676014,0.000069599984,0.011216807,0.000038700786,0.000012530526,0.000033776032,0.00008322056,0.00001757489,0.0017676883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995585,0.00011124229,0.00003060669,0.00010982608,0.000121517005,0.00006824513],"domain_scores_gemma":[0.9984515,0.00048680656,0.00037949395,0.0001485281,0.00030616546,0.0002276192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027749178,0.0002200507,0.00032752528,0.00096241565,0.0010056994,0.0015269353,0.00052927993,0.0005999134,0.0027402735],"category_scores_gemma":[0.00223643,0.00028223824,0.00041788723,0.0005773352,0.0020023345,0.0011742478,0.0010068129,0.00052208174,0.0002381059],"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.00006592677,0.000015279984,0.0016603953,0.000041299732,0.000012098407,0.00016517956,0.00033985553,0.018849147,0.0058153635,0.968745,0.00026493394,0.004025621],"study_design_scores_gemma":[0.00008344429,0.00010055699,0.0020590173,0.000042422704,0.000030709765,0.00032737502,0.00032929055,0.17204536,0.0075985664,0.810692,0.00663474,0.000056388424],"about_ca_topic_score_codex":0.0019126612,"about_ca_topic_score_gemma":0.0013515423,"teacher_disagreement_score":0.0027402735,"about_ca_system_score_codex":0.0009877096,"about_ca_system_score_gemma":0.0004933719,"threshold_uncertainty_score":0.009167075},"labels":[],"label_agreement":null},{"id":"W35411814","doi":"10.1152/ajpregu.00225.2021","title":"Cellular Automata modeling of shallow landslides","year":2010,"lang":"en","type":"article","venue":"American Journal of Physiology-Regulatory, Integrative and Comparative Physiology","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Cystic Fibrosis Canada","keywords":"Landslide; Geology; Computer science; Seismology","score_opus":0.019448030603429124,"score_gpt":0.26889555543029353,"score_spread":0.24944752482686441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35411814","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.24502216,0.0023576918,0.6419068,0.0022313003,0.0006436584,0.0001451264,0.0033510067,0.0015055044,0.102836825],"genre_scores_gemma":[0.94584507,0.0007079401,0.035094544,0.00020686928,0.00006502098,0.00018894441,0.0010324859,0.00021215327,0.016646918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998603,0.00003751006,0.000008620972,0.000033104436,0.00002986117,0.000030611896],"domain_scores_gemma":[0.99951994,0.00025448672,0.000048260245,0.000035105386,0.00009358375,0.000048728267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021352568,0.00065333495,0.00064107537,0.00062283484,0.00058059173,0.0013541088,0.0011182075,0.0020184107,0.00575359],"category_scores_gemma":[0.0012615144,0.0004912672,0.0008531802,0.00045616567,0.00083750364,0.00058832415,0.0010647714,0.0006075108,0.00068931817],"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.000016333706,0.0000085458905,0.00076535274,0.0000265692,0.000011632756,0.00008098077,0.000032704622,0.9889966,0.0005013558,0.0072749816,0.00064357254,0.0016414636],"study_design_scores_gemma":[0.000003855402,0.000003156161,0.0000929091,0.000005971592,0.0000024051462,0.000011000253,0.000014516042,0.99677306,0.000068086316,0.0022467487,0.000774666,0.000003644566],"about_ca_topic_score_codex":0.019294702,"about_ca_topic_score_gemma":0.010616775,"teacher_disagreement_score":0.019294702,"about_ca_system_score_codex":0.00092741987,"about_ca_system_score_gemma":0.0008536616,"threshold_uncertainty_score":0.038364828},"labels":[],"label_agreement":null},{"id":"W4206405967","doi":"10.1017/cbo9781139195768","title":"Codes and Automata","year":2009,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Automaton; Ideal (ethics); Computer science; Cryptography; Relation (database); Focus (optics); Connection (principal bundle); Field (mathematics); Theoretical computer science; Automata theory; Subject (documents); Mathematics; Algorithm; Pure mathematics; Epistemology","score_opus":0.013952704914093174,"score_gpt":0.1948340756669944,"score_spread":0.18088137075290123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206405967","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.005423816,0.07620595,0.098058455,0.013435017,0.011370124,0.000076054974,0.0006566214,0.0006311788,0.7941428],"genre_scores_gemma":[0.21145,0.07431146,0.05818677,0.009098405,0.0075290436,0.00037218546,0.0011892018,0.000711654,0.63715136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990206,0.00022406603,0.000055525114,0.00020807439,0.00039850638,0.00009326344],"domain_scores_gemma":[0.99910516,0.0004215736,0.000043863733,0.0001489051,0.00023356907,0.000046901925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048047534,0.000899269,0.0005971481,0.001850093,0.0017817162,0.003691878,0.00078742846,0.0014284246,0.014582345],"category_scores_gemma":[0.002340717,0.00028476733,0.00058516645,0.00223206,0.0047796457,0.0052840402,0.0016314689,0.002902167,0.0059440495],"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.0000038785083,0.0000027247577,0.000025878124,0.000063231644,0.0000022154297,0.000020124382,0.00020415959,0.00025167826,0.00017097489,0.9595261,0.018590553,0.021138465],"study_design_scores_gemma":[0.0000028348938,0.000013251822,0.00007037121,0.000106765234,0.0000030005622,0.00015832164,0.0000909384,0.0006544771,0.00025444772,0.5192437,0.47939208,0.000009720116],"about_ca_topic_score_codex":0.0023533728,"about_ca_topic_score_gemma":0.0020391936,"teacher_disagreement_score":0.014582345,"about_ca_system_score_codex":0.0029361465,"about_ca_system_score_gemma":0.0015252982,"threshold_uncertainty_score":0.048782766},"labels":[],"label_agreement":null},{"id":"W4211210162","doi":"10.1017/9781108899727.015","title":"Guide to Advanced Topics","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Content (measure theory); Computer science; Information retrieval; World Wide Web; Mathematics","score_opus":0.017031006148242683,"score_gpt":0.2105838050114729,"score_spread":0.1935527988632302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211210162","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.00053224486,0.021883339,0.00834722,0.0038219583,0.0036785568,0.0002797315,0.0055165514,0.0034743745,0.952466],"genre_scores_gemma":[0.00061364507,0.008292291,0.0035283633,0.0010813862,0.0003686206,0.000094540985,0.0022013716,0.0005387323,0.98328096],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970585,0.000029695097,0.000017898012,0.000045296543,0.00017309132,0.000028159564],"domain_scores_gemma":[0.99935764,0.00014060187,0.000023111608,0.000055004384,0.0002784767,0.00014507835],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038734797,0.0010125007,0.0008975321,0.00287958,0.0008276319,0.0033390056,0.0012304543,0.0010984626,0.63041615],"category_scores_gemma":[0.0016758778,0.00053650263,0.0006134526,0.0024980998,0.00033332294,0.0030489697,0.001792062,0.0021078736,0.57821435],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000008753217,0.000028540066,0.000044601467,0.0001850057,0.000001258122,0.000044887325,0.00008105404,0.00007935648,0.0003486832,0.0051658647,0.8724355,0.12157647],"study_design_scores_gemma":[0.0000011602342,0.0000035590253,0.000048394133,0.000059271457,4.693845e-7,0.0000659764,0.000018133718,0.000018664045,0.000028322185,0.0011260192,0.99862826,0.0000017112777],"about_ca_topic_score_codex":0.0016675433,"about_ca_topic_score_gemma":0.0061958404,"teacher_disagreement_score":0.63041615,"about_ca_system_score_codex":0.00079421065,"about_ca_system_score_gemma":0.001451565,"threshold_uncertainty_score":0.5271665},"labels":[],"label_agreement":null},{"id":"W4212792388","doi":"10.3390/a15020065","title":"A New Algorithm Based on Colouring Arguments for Identifying Impossible Polyomino Tiling Problems","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Diophantine equation; Polyomino; Parity (physics); Mathematics; MATLAB; Algorithm; Computer science; Discrete mathematics; Combinatorics; Geometry","score_opus":0.03184907674239302,"score_gpt":0.2825712594889295,"score_spread":0.2507221827465365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212792388","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.009134514,0.000079150246,0.9814346,0.00025946723,0.00013733456,0.00013644852,0.00012818837,0.0017355806,0.0069546984],"genre_scores_gemma":[0.06428889,0.000065790366,0.93110645,0.00018218844,0.0000467779,0.00032900096,0.00040504275,0.0004751589,0.003100704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992035,0.00013730572,0.000071793605,0.00023819401,0.000237193,0.000112020345],"domain_scores_gemma":[0.99810886,0.0010703875,0.00011969904,0.00030694166,0.00029671233,0.000097338205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009958488,0.0012073899,0.0011330502,0.0020154428,0.0012671755,0.0023207918,0.002103423,0.0018132413,0.013520945],"category_scores_gemma":[0.007359713,0.00067516847,0.0014758798,0.0012617325,0.0013509607,0.0023395927,0.0033985113,0.001994388,0.0026819725],"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.00038694954,0.00023002086,0.0023943365,0.00053059123,0.00012743351,0.00045705464,0.00046041323,0.16750616,0.018084902,0.29050082,0.018515173,0.50080615],"study_design_scores_gemma":[0.00014061599,0.00008339044,0.0002697808,0.00007025408,0.00003986366,0.0002214425,0.00009697069,0.7704814,0.006793789,0.20890617,0.012852915,0.00004336351],"about_ca_topic_score_codex":0.0015917129,"about_ca_topic_score_gemma":0.002392292,"teacher_disagreement_score":0.013520945,"about_ca_system_score_codex":0.001153058,"about_ca_system_score_gemma":0.001813325,"threshold_uncertainty_score":0.045232117},"labels":[],"label_agreement":null},{"id":"W4214581107","doi":"10.1007/978-0-387-30440-3_4","title":"Additive Cellular Automata","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Complexity and Systems Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"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":"Cellular automaton; Computer science; Algorithm","score_opus":0.029344638326814217,"score_gpt":0.24362662397461726,"score_spread":0.21428198564780304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214581107","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.0072432486,0.0116717415,0.23403715,0.0007227189,0.0014155575,0.00008645288,0.0007470591,0.0015028848,0.74257326],"genre_scores_gemma":[0.26457632,0.018157376,0.10998123,0.0009101187,0.00092087936,0.00027810628,0.001741541,0.00048600807,0.60294837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980026,0.000024070376,0.000009916568,0.00005135048,0.000092721675,0.000021660187],"domain_scores_gemma":[0.99986327,0.000027661537,0.0000064535666,0.000033467015,0.000056831777,0.000012299868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098439275,0.00086824695,0.00067946524,0.0010947827,0.00062670617,0.0018854341,0.0006847493,0.0007015607,0.021557555],"category_scores_gemma":[0.0005054857,0.0002775127,0.00048814205,0.0010931419,0.00081249786,0.0010512803,0.000945793,0.0011005313,0.009623098],"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.000012652782,0.000020827614,0.00009413853,0.00014209656,0.000013912659,0.00010000221,0.0001147824,0.0054229354,0.0032416247,0.82743466,0.027457435,0.13594499],"study_design_scores_gemma":[0.00000737516,0.000024914938,0.0002738155,0.00008171943,0.000027598846,0.00044901174,0.000059286882,0.014808455,0.004087792,0.5135523,0.46660197,0.000025688178],"about_ca_topic_score_codex":0.0012678257,"about_ca_topic_score_gemma":0.0016637151,"teacher_disagreement_score":0.021557555,"about_ca_system_score_codex":0.00086513895,"about_ca_system_score_gemma":0.0006567536,"threshold_uncertainty_score":0.07211715},"labels":[],"label_agreement":null},{"id":"W4220692292","doi":"10.18280/ria.360103","title":"A Novel Edge Detection Algorithm Based on Outer Totalistic Cellular Automata","year":2022,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sobel operator; Enhanced Data Rates for GSM Evolution; Cellular automaton; Edge detection; Computer science; Canny edge detector; Image (mathematics); Algorithm; Image gradient; Detector; Key (lock); Image quality; Artificial intelligence; Image processing; Pattern recognition (psychology)","score_opus":0.029735500983877824,"score_gpt":0.2484590009846891,"score_spread":0.21872350000081126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220692292","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.018573916,0.00022467597,0.97776514,0.000086984954,0.00007174202,0.000053950367,0.00006247558,0.001208444,0.0019527328],"genre_scores_gemma":[0.33956763,0.000268777,0.65469605,0.00018552024,0.000035567104,0.00018874752,0.00023917094,0.00020236641,0.004616234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965894,0.00003235851,0.000029198292,0.000101512705,0.00013446133,0.00004351155],"domain_scores_gemma":[0.99931455,0.00022115115,0.00007282032,0.00008184138,0.00026789264,0.000041716103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037278284,0.0006392959,0.0010473442,0.0012610566,0.0006118457,0.001206396,0.0015729832,0.001055904,0.0017654148],"category_scores_gemma":[0.0016545163,0.00037705354,0.0009779996,0.000863807,0.00052926654,0.0008989846,0.0009009882,0.0007356114,0.00055204256],"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.00018333258,0.00009161023,0.0032008688,0.0001767154,0.00013123172,0.00027384303,0.00019213895,0.44206855,0.04265532,0.017636003,0.0038443517,0.48954597],"study_design_scores_gemma":[0.000007924749,0.000025979938,0.00021273938,0.0000067960414,0.000013261082,0.00007155731,0.000010725539,0.99170685,0.0037033048,0.0026782095,0.0015512243,0.000011567437],"about_ca_topic_score_codex":0.008056944,"about_ca_topic_score_gemma":0.0066762134,"teacher_disagreement_score":0.008056944,"about_ca_system_score_codex":0.0007668005,"about_ca_system_score_gemma":0.0010372136,"threshold_uncertainty_score":0.01602006},"labels":[],"label_agreement":null},{"id":"W4231921638","doi":"10.1017/s0143385706000216","title":"Asymptotic randomization of subgroup shifts by linear cellular automata","year":2006,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Combinatorics; Abelian group; Orthant; Lattice (music); Discrete mathematics; Physics","score_opus":0.0025247225024111948,"score_gpt":0.1874909784539282,"score_spread":0.184966255951517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231921638","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80901134,0.0005113886,0.17619868,0.00071623485,0.00010683369,0.00006044911,0.00022588366,0.0008188341,0.012350279],"genre_scores_gemma":[0.9904799,0.000117139454,0.0067713154,0.00008073135,0.000059985,0.000062279905,0.00010801564,0.000043695407,0.0022770043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903464,0.00032532087,0.00005240587,0.00021184684,0.00017886651,0.00019690352],"domain_scores_gemma":[0.9954678,0.0022628666,0.00065729563,0.0007076322,0.0004687729,0.0004356578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013727328,0.00033465135,0.00080826075,0.0011001392,0.0008147078,0.0016972376,0.0009512858,0.0008567603,0.0031200277],"category_scores_gemma":[0.00882613,0.00039653946,0.00070021715,0.000405748,0.0021018132,0.0015461515,0.001346779,0.0007899013,0.00040891732],"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.00030937244,0.00006791178,0.0035891992,0.000075593045,0.00005906566,0.00019959848,0.00028668458,0.10496245,0.012881272,0.86504376,0.0016246095,0.010900322],"study_design_scores_gemma":[0.000046798203,0.00007993507,0.0009712163,0.000016483424,0.00001889214,0.00007664646,0.00005537268,0.6664727,0.0025923946,0.32858047,0.0010564338,0.000032710504],"about_ca_topic_score_codex":0.0020886182,"about_ca_topic_score_gemma":0.0019555748,"teacher_disagreement_score":0.0031200277,"about_ca_system_score_codex":0.0016311031,"about_ca_system_score_gemma":0.0006745488,"threshold_uncertainty_score":0.011834502},"labels":[],"label_agreement":null},{"id":"W4233755645","doi":"10.22360/springsim.2017.cns.010","title":"Formal Modeling and Simulation To Analyze the Dynamics of Malware Propagation in Networks using Cell-DEVS","year":2017,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Malware; Computer science; DEVS; Computer network; Wireless network; Distributed computing; Wireless; Channel (broadcasting); Theoretical computer science; Modeling and simulation; Computer security; Simulation; Telecommunications","score_opus":0.02265159677761829,"score_gpt":0.27817588480364247,"score_spread":0.25552428802602417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233755645","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.03073675,0.0002822145,0.9606821,0.00057443144,0.000095832285,0.000093818795,0.00020227226,0.00054182415,0.006790778],"genre_scores_gemma":[0.70599985,0.0009444703,0.2846963,0.0002692934,0.00011492393,0.000623623,0.0004049765,0.00028758578,0.00665899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995034,0.00017677859,0.000038481325,0.00005566437,0.00015118135,0.00007444711],"domain_scores_gemma":[0.99701357,0.0020149983,0.00025476314,0.00033376866,0.00027152337,0.00011125734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013406773,0.00068176474,0.00069647055,0.0010150385,0.0008338022,0.0012429624,0.0012476471,0.0010336841,0.002544478],"category_scores_gemma":[0.0041901073,0.00043413133,0.0013829258,0.000624826,0.0015726441,0.0018129634,0.0010677737,0.0015119791,0.0002895957],"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.000012362098,0.000033035492,0.00065740757,0.000041760693,0.000024643254,0.00007726488,0.00010975104,0.75760055,0.0013677516,0.2365175,0.00041734756,0.0031406018],"study_design_scores_gemma":[0.0000049758914,0.0000056802132,0.000041949443,0.0000059472063,0.000005329526,0.00001251378,0.000010209545,0.9738177,0.0004308917,0.024547227,0.0011135306,0.0000040017812],"about_ca_topic_score_codex":0.007835793,"about_ca_topic_score_gemma":0.0067006573,"teacher_disagreement_score":0.007835793,"about_ca_system_score_codex":0.0019523156,"about_ca_system_score_gemma":0.0014627554,"threshold_uncertainty_score":0.015580416},"labels":[],"label_agreement":null},{"id":"W4233813833","doi":"10.1007/978-3-319-61431-1","title":"Cable-Driven Parallel Robots","year":2017,"lang":"en","type":"book","venue":"Mechanisms and machine science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Robot; Computer science; Artificial intelligence","score_opus":0.018751953984520692,"score_gpt":0.2462010460510475,"score_spread":0.2274490920665268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233813833","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.022831611,0.01563077,0.33671242,0.001262854,0.0032253116,0.00009968436,0.0004428952,0.0017396755,0.61805487],"genre_scores_gemma":[0.27150434,0.023859119,0.092443965,0.000610464,0.0009573231,0.00030786046,0.0009674183,0.00063200324,0.6087175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999068,0.000007648012,0.0000022987554,0.000020424399,0.000053847572,0.000008973227],"domain_scores_gemma":[0.9999292,0.000017767507,0.000007922345,0.000015940152,0.0000173154,0.0000119377355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008729972,0.0006874864,0.00041440854,0.00048852887,0.00036656443,0.00056311686,0.0007450109,0.0005599692,0.01458225],"category_scores_gemma":[0.00026463115,0.0003647578,0.00033317934,0.00075156096,0.0007226325,0.0008999852,0.0009801539,0.00083277107,0.005055415],"study_design_candidate":"not_applicable","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.00012506543,0.00006817409,0.0001502882,0.00055186136,0.000044278167,0.00013530305,0.00010834727,0.072589256,0.032352664,0.4536176,0.07699138,0.36326575],"study_design_scores_gemma":[0.000056493867,0.00017192947,0.0004733608,0.00014497795,0.000029358931,0.00035677856,0.000057659774,0.10905075,0.013725556,0.34944123,0.5264332,0.0000586721],"about_ca_topic_score_codex":0.0004511044,"about_ca_topic_score_gemma":0.0006629245,"teacher_disagreement_score":0.01458225,"about_ca_system_score_codex":0.00054435414,"about_ca_system_score_gemma":0.00042325165,"threshold_uncertainty_score":0.048782468},"labels":[],"label_agreement":null},{"id":"W4237647431","doi":"10.1017/9781108989817.014","title":"Theoretical Foundations for Future Machine Type Communications","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Content (measure theory); Telecommunications; Computer security; Computer network; Internet privacy; Mathematics","score_opus":0.02630968098170826,"score_gpt":0.23525470770366894,"score_spread":0.2089450267219607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237647431","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.012714152,0.005731324,0.23190363,0.009921135,0.0013396471,0.00006045537,0.00050858856,0.00039775134,0.7374233],"genre_scores_gemma":[0.61847866,0.014171883,0.09753162,0.0033087821,0.0036958314,0.0006450739,0.00081416534,0.0004939038,0.26086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921083,0.00023865644,0.000027321092,0.00013411885,0.00022149923,0.00016748269],"domain_scores_gemma":[0.9977398,0.0012724716,0.00013595358,0.00038801643,0.00032110544,0.00014266331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010528148,0.0005914758,0.0005152652,0.0013686579,0.0021047927,0.004178641,0.0011553927,0.0025951467,0.028451165],"category_scores_gemma":[0.004010194,0.00048752542,0.00083316,0.0015377112,0.0035058798,0.0067513534,0.0016145755,0.0035968565,0.0055924356],"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.0000013628625,0.0000014962634,0.000009382206,0.000007997561,6.380496e-7,0.000008293811,0.000020314581,0.0002362215,0.000025613239,0.99657923,0.0018174411,0.001291827],"study_design_scores_gemma":[0.0000021588937,0.0000023790221,0.000020973832,0.000013712711,0.000001149056,0.000040643485,0.00002079724,0.0019566924,0.00006490767,0.985967,0.011906796,0.0000028327936],"about_ca_topic_score_codex":0.0010501277,"about_ca_topic_score_gemma":0.0009369887,"teacher_disagreement_score":0.028451165,"about_ca_system_score_codex":0.002663755,"about_ca_system_score_gemma":0.0010153841,"threshold_uncertainty_score":0.095178664},"labels":[],"label_agreement":null},{"id":"W4238000496","doi":"10.1109/iwsoc.2004.1319848","title":"A framework for implementing reusable digital signal processing modules","year":2004,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Digital signal processing; Signal processing; Digital signal; SIGNAL (programming language); Estimator; Architecture; Embedded system; Computer architecture; Computer hardware; Programming language","score_opus":0.026833979893864768,"score_gpt":0.2874648368524282,"score_spread":0.2606308569585634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238000496","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.0013613093,0.00014382703,0.99308115,0.00005337249,0.000029130972,0.000117620264,0.00005542921,0.0024470105,0.0027111936],"genre_scores_gemma":[0.043088138,0.00050078036,0.9504707,0.00012068714,0.000044906425,0.00062635884,0.00038609796,0.00039949498,0.0043627536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988349,0.00018518243,0.00014383589,0.00022134685,0.0004443342,0.00017032542],"domain_scores_gemma":[0.9993148,0.00017935025,0.000053685493,0.00021130044,0.00017083994,0.00007000813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014640201,0.0012290424,0.00082189945,0.0011937158,0.0009431267,0.0030221243,0.0033354326,0.001790755,0.006344739],"category_scores_gemma":[0.002066224,0.00079547294,0.0016821816,0.00079403096,0.0015152437,0.002501353,0.001717401,0.0022793522,0.0031517656],"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.000106700325,0.00015075368,0.00045287737,0.00070322625,0.00009648271,0.0006814424,0.00042064104,0.061670758,0.044671554,0.71122915,0.005924487,0.17389198],"study_design_scores_gemma":[0.00014913602,0.00036784628,0.00036260294,0.00041241798,0.00023498262,0.0014412068,0.00012936813,0.344473,0.067415014,0.25246054,0.33239007,0.00016374928],"about_ca_topic_score_codex":0.0019581665,"about_ca_topic_score_gemma":0.0014623083,"teacher_disagreement_score":0.006344739,"about_ca_system_score_codex":0.00085005723,"about_ca_system_score_gemma":0.0015651105,"threshold_uncertainty_score":0.021225274},"labels":[],"label_agreement":null},{"id":"W4238453642","doi":"10.1007/978-1-84996-217-9_12","title":"RealLife","year":2010,"lang":"en","type":"book-chapter","venue":"","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":"Trent University","funders":"","keywords":"Mathematics","score_opus":0.0133828081598691,"score_gpt":0.2129718494148558,"score_spread":0.19958904125498672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238453642","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.0005447496,0.003528118,0.009492035,0.0012574836,0.0012181808,0.000036313744,0.0011923473,0.0025211954,0.9802096],"genre_scores_gemma":[0.0029716385,0.0019025623,0.0037596624,0.0004935721,0.00017936926,0.000036844656,0.0014446474,0.00065340643,0.9885584],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997503,0.00002232272,0.000010614871,0.00006678789,0.00012495898,0.000025114055],"domain_scores_gemma":[0.9997029,0.00005033431,0.000013508219,0.00007541677,0.0001035761,0.00005434309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029971518,0.0009505611,0.00041730347,0.0014647124,0.00087143085,0.0031679976,0.0010376855,0.0010291389,0.34591976],"category_scores_gemma":[0.0010017506,0.0003502205,0.00034935898,0.0013235675,0.0005603899,0.0036796622,0.0014244547,0.0013042464,0.24935395],"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.000028210188,0.00002232359,0.00006755048,0.00023402632,0.0000031731893,0.000063064086,0.00015480915,0.00025457446,0.0016900218,0.07725376,0.6599575,0.2602709],"study_design_scores_gemma":[0.0000013615288,0.0000039470556,0.00003058526,0.000031887277,9.686456e-7,0.00006390426,0.00001688645,0.000087817854,0.00029377267,0.004886001,0.9945793,0.0000036790884],"about_ca_topic_score_codex":0.0015436346,"about_ca_topic_score_gemma":0.0035548273,"teacher_disagreement_score":0.34591976,"about_ca_system_score_codex":0.0006841638,"about_ca_system_score_gemma":0.0005873935,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4242987795","doi":"10.1007/978-94-007-0753-5_100963","title":"Digital Exclusion","year":2014,"lang":"en","type":"book-chapter","venue":"","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":"Brandon University; University of Northern British Columbia","funders":"","keywords":"Computer science","score_opus":0.012018555935732339,"score_gpt":0.2058030716153345,"score_spread":0.19378451567960217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242987795","genre_codex":"other","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.0029190006,0.0020161658,0.023551572,0.0013827882,0.00088590354,0.000023598974,0.00011462738,0.00016597565,0.9689404],"genre_scores_gemma":[0.13035916,0.0049139587,0.007819183,0.0010171419,0.0006542011,0.00013465992,0.00033189752,0.00021715098,0.8545527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997944,0.000025321948,0.000008727145,0.000050230927,0.00008464937,0.000036734313],"domain_scores_gemma":[0.99977165,0.00006654879,0.000014076002,0.00005616688,0.00006040406,0.000031132928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002018569,0.00052844064,0.0003705072,0.00091760844,0.0012412582,0.0021837074,0.0007530772,0.0006921982,0.05631878],"category_scores_gemma":[0.0009762364,0.000193923,0.00030847214,0.00075420114,0.0021996903,0.0031779122,0.0019428539,0.0014787933,0.010868535],"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.000009694244,0.0000065823583,0.000019739497,0.000037401907,0.0000013963833,0.000020233194,0.000058288584,0.00025426966,0.00030631517,0.9547088,0.0175029,0.027074357],"study_design_scores_gemma":[0.00000817104,0.000008908141,0.000051413514,0.000046949524,0.000003978883,0.0001235524,0.00006251677,0.0009563223,0.0010660511,0.57820225,0.4194623,0.000007583638],"about_ca_topic_score_codex":0.0010472004,"about_ca_topic_score_gemma":0.0013715319,"teacher_disagreement_score":0.05631878,"about_ca_system_score_codex":0.0013616516,"about_ca_system_score_gemma":0.0009806242,"threshold_uncertainty_score":0.1884051},"labels":[],"label_agreement":null},{"id":"W4243687418","doi":"10.1007/978-3-642-27737-5_676-1","title":"Orbits of Bernoulli Measures in Cellular Automata","year":2017,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Complexity and Systems Science","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":"Bernoulli's principle; Cellular automaton; Computer science; Automaton; Theoretical computer science; Algorithm; Engineering; Aerospace engineering","score_opus":0.0521571883006043,"score_gpt":0.2650701613588861,"score_spread":0.21291297305828183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243687418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36447683,0.010188252,0.351684,0.0023803832,0.0014723827,0.000109782246,0.0005763624,0.00048690653,0.26862508],"genre_scores_gemma":[0.9392741,0.0035746447,0.022558784,0.00020804527,0.00074114394,0.0001292252,0.00024465492,0.00014232947,0.03312716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952614,0.00012500939,0.000025252602,0.000070562644,0.0001725062,0.00008050802],"domain_scores_gemma":[0.9990694,0.00053511624,0.00009812808,0.000081975246,0.000105811756,0.000109648456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040104706,0.00054729823,0.00076849025,0.0013473916,0.0011117831,0.002518659,0.00067446555,0.0010727948,0.0043318393],"category_scores_gemma":[0.0026267974,0.00046537272,0.00070391374,0.00096494786,0.0029067323,0.0017960644,0.0014537105,0.0013922235,0.00062339014],"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.000009810692,0.0000030283932,0.00006114911,0.000018160119,0.0000021665892,0.000021987373,0.000079665006,0.0025293534,0.0002839093,0.9939057,0.00050255377,0.0025824008],"study_design_scores_gemma":[0.0000051738843,0.0000057439133,0.00005747105,0.000012091025,0.0000023468194,0.000031978765,0.000022438157,0.0117939925,0.00015211715,0.986086,0.0018251264,0.000005538648],"about_ca_topic_score_codex":0.0018455444,"about_ca_topic_score_gemma":0.0010361202,"teacher_disagreement_score":0.0043318393,"about_ca_system_score_codex":0.0015760837,"about_ca_system_score_gemma":0.00085107196,"threshold_uncertainty_score":0.014491379},"labels":[],"label_agreement":null},{"id":"W4244971422","doi":"10.3410/f.1025958.341147","title":"Faculty Opinions recommendation of A synthetic multicellular system for programmed pattern formation.","year":2005,"lang":"en","type":"dataset","venue":"Faculty Opinions – Post-Publication Peer Review of the Biomedical Literature","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":"University of British Columbia","funders":"","keywords":"Multicellular organism; Programmed instruction; Computer science; World Wide Web; Data science; Psychology; Biology; Mathematics education; Genetics; Cell","score_opus":0.0288526490996717,"score_gpt":0.3255910065329973,"score_spread":0.29673835743332555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244971422","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020281484,0.00023633623,0.000522144,0.00023739817,0.00011654524,0.00007701004,0.9930501,0.0017898097,0.0019425782],"genre_scores_gemma":[0.0025051562,0.00008788702,0.0012072453,0.00006700064,0.000014630204,0.00011589376,0.99440914,0.000067206056,0.0015258944],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914753,0.0001414433,0.000088186294,0.00025201007,0.0002608313,0.00011005231],"domain_scores_gemma":[0.9979311,0.00057840947,0.00020020394,0.0005423129,0.0004976813,0.00025019192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011805968,0.0028066426,0.001214595,0.002866837,0.00076773786,0.0019017634,0.0034459927,0.0028783989,0.027773531],"category_scores_gemma":[0.004707012,0.00066529296,0.0017588239,0.0027012443,0.0003649571,0.0008295141,0.0011412883,0.0015865194,0.03641277],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0002226796,0.0001495602,0.0021892947,0.0012066786,0.00009855693,0.000066793684,0.000021946147,0.0025416808,0.00069309474,0.00043262215,0.9828531,0.009524017],"study_design_scores_gemma":[0.0010619782,0.00020816598,0.01669537,0.00039032128,0.00023865073,0.00029325273,0.00014815391,0.022690648,0.005877886,0.0029704017,0.94932705,0.0000981008],"about_ca_topic_score_codex":0.02706338,"about_ca_topic_score_gemma":0.054316442,"teacher_disagreement_score":0.027773531,"about_ca_system_score_codex":0.0015610704,"about_ca_system_score_gemma":0.0020051931,"threshold_uncertainty_score":0.09291172},"labels":[],"label_agreement":null},{"id":"W4245795945","doi":"10.1109/intmag.2005.1463917","title":"Reduced complexity signal detection and turbo decoding for multitrack magnetic recording channels","year":2005,"lang":"en","type":"article","venue":"INTERMAG Asia 2005. Digests of the IEEE International Magnetics Conference, 2005.","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Detector; Turbo; Computer science; Interference (communication); Turbo code; Turbo equalizer; Channel (broadcasting); Detection theory; SIGNAL (programming language); Algorithm; Speech recognition; Electronic engineering; Real-time computing; Telecommunications; Concatenated error correction code; Engineering","score_opus":0.03862414297990192,"score_gpt":0.2793660084113029,"score_spread":0.24074186543140097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245795945","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.028661406,0.00051767577,0.9667701,0.0001898234,0.000062624465,0.000054881908,0.000034227913,0.0005815417,0.0031277153],"genre_scores_gemma":[0.3977962,0.00056784716,0.5906474,0.00029844927,0.00010080341,0.00011003156,0.00010869262,0.00014184507,0.010228689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863476,0.00036828304,0.00007004715,0.00015462289,0.00067461183,0.000097684926],"domain_scores_gemma":[0.99485695,0.002728234,0.00047632318,0.0007730276,0.0010375062,0.00012800969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089154416,0.0005773478,0.0006466786,0.0006144919,0.00042794747,0.0010402526,0.001247842,0.0012914853,0.0029078545],"category_scores_gemma":[0.0060125687,0.0003313377,0.0003570191,0.00054287736,0.0009765206,0.001674546,0.0009826982,0.0011633708,0.0014501874],"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.0014287749,0.00024520108,0.0019480045,0.0007998735,0.00011568238,0.0006291495,0.0009579858,0.08313939,0.3054608,0.12048876,0.0030201536,0.48176622],"study_design_scores_gemma":[0.00010003912,0.00059928355,0.00080309174,0.00006922109,0.000051191553,0.0013846504,0.00008695561,0.595459,0.36973193,0.019297479,0.012259613,0.00015758637],"about_ca_topic_score_codex":0.00061204954,"about_ca_topic_score_gemma":0.0016623314,"teacher_disagreement_score":0.0029078545,"about_ca_system_score_codex":0.00053350977,"about_ca_system_score_gemma":0.0006776248,"threshold_uncertainty_score":0.009727716},"labels":[],"label_agreement":null},{"id":"W4246476113","doi":"10.1007/978-1-4614-6170-8_100651","title":"Dynamical Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"","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":"University of Calgary","funders":"","keywords":"Computer science; Mathematics","score_opus":0.010530692020555076,"score_gpt":0.21071897619651644,"score_spread":0.20018828417596138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246476113","genre_codex":"other","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.004477139,0.0054255445,0.08008825,0.0015126739,0.0013363904,0.00004863069,0.00043876868,0.00041781782,0.9062548],"genre_scores_gemma":[0.1324374,0.012785397,0.030699978,0.00084441865,0.0011197136,0.00020517553,0.0015042218,0.00059755513,0.8198062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99990404,0.000017330576,0.0000035282544,0.000025936806,0.000039403134,0.000009652682],"domain_scores_gemma":[0.99992573,0.000019150566,0.00000439781,0.000018628185,0.000023384573,0.0000087376175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008129179,0.00068274816,0.00029963374,0.001068321,0.0005567786,0.001203086,0.00044910755,0.00044892606,0.030380625],"category_scores_gemma":[0.00037493464,0.00023794,0.0002638343,0.0008880206,0.0008847193,0.001520292,0.00072524586,0.00086397736,0.008675039],"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.0000029618145,0.000006620583,0.000025631329,0.000052235973,0.0000035710802,0.000020708758,0.000066966604,0.0015962255,0.0005957167,0.9118749,0.036169954,0.049584474],"study_design_scores_gemma":[0.0000030354447,0.000004809488,0.00006477169,0.000035229998,0.000003664855,0.00006546199,0.0000346762,0.002569013,0.0004448911,0.6866459,0.3101222,0.00000630082],"about_ca_topic_score_codex":0.0012751494,"about_ca_topic_score_gemma":0.001563109,"teacher_disagreement_score":0.030380625,"about_ca_system_score_codex":0.0008862781,"about_ca_system_score_gemma":0.00044133517,"threshold_uncertainty_score":0.10163337},"labels":[],"label_agreement":null},{"id":"W4246895267","doi":"10.4018/978-1-4666-1574-8.ch016","title":"Response Curves for Cellular Automata in One and Two Dimensions","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Cellular automaton; Mathematics; Binary number; Automaton; Statistical physics; Discrete mathematics; Combinatorics; Pure mathematics; Algorithm; Computer science; Theoretical computer science; Arithmetic; Physics","score_opus":0.03120347609171375,"score_gpt":0.2650418807693775,"score_spread":0.23383840467766376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246895267","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.16265447,0.0050806003,0.76092744,0.0013090911,0.00032900643,0.00014931602,0.00034554568,0.0015688583,0.06763569],"genre_scores_gemma":[0.8499845,0.0023834629,0.12604247,0.0002920395,0.000114179755,0.0002691776,0.00035826946,0.000336013,0.020219835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994912,0.00014383573,0.000032032232,0.000091679096,0.00018443579,0.00005671833],"domain_scores_gemma":[0.9979438,0.0013546468,0.0001326868,0.00014934519,0.00031250928,0.00010703656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000666211,0.0006307236,0.0006431619,0.0014799661,0.00065040664,0.0024606124,0.0009847146,0.0015564841,0.005243349],"category_scores_gemma":[0.006125335,0.0002819319,0.00066577276,0.001017612,0.001675188,0.001760066,0.0009905056,0.0012886727,0.0010004449],"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.00007537037,0.00003859769,0.00047567996,0.00021805253,0.00001916992,0.000120687,0.00034886057,0.16240661,0.0071628764,0.79504573,0.0014287945,0.0326596],"study_design_scores_gemma":[0.000012645075,0.000028587137,0.00019124117,0.000038015096,0.00000565554,0.000067650035,0.000078506855,0.58024853,0.0022420143,0.4107137,0.006340184,0.000033225224],"about_ca_topic_score_codex":0.0018603206,"about_ca_topic_score_gemma":0.0006195643,"teacher_disagreement_score":0.005243349,"about_ca_system_score_codex":0.0021805302,"about_ca_system_score_gemma":0.00051583303,"threshold_uncertainty_score":0.017540812},"labels":[],"label_agreement":null},{"id":"W4246995854","doi":"10.1007/978-1-4939-7131-2_100303","title":"Dynamical Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"","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":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.01360464788748311,"score_gpt":0.22391691153984572,"score_spread":0.2103122636523626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246995854","genre_codex":"other","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.004568421,0.0052486183,0.07363353,0.0017191488,0.0016047581,0.00004992572,0.0005084198,0.00044210293,0.91222507],"genre_scores_gemma":[0.13292858,0.012411287,0.028546285,0.0009419268,0.0013241451,0.00021142824,0.0017684842,0.0006421919,0.8212257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99989593,0.000018262845,0.000003690785,0.000029497163,0.00004206313,0.000010530083],"domain_scores_gemma":[0.9999131,0.000022458886,0.0000049882246,0.00002177529,0.000026950842,0.00001075706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008948116,0.0007006874,0.00029801612,0.0010692119,0.0005789362,0.001362849,0.00046080948,0.0004835535,0.033037547],"category_scores_gemma":[0.00043809778,0.00023372944,0.0002741662,0.0008873512,0.0008972257,0.0016312134,0.0007732652,0.00090401777,0.010428913],"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.0000031707698,0.00000647135,0.000024781542,0.00005512726,0.0000034540076,0.00001924493,0.00006594045,0.001341697,0.0005415285,0.91911435,0.035925746,0.042898424],"study_design_scores_gemma":[0.0000031291172,0.0000049073233,0.00006176759,0.000036032012,0.0000037500874,0.000060237737,0.000034196342,0.0021063227,0.00039633492,0.6809239,0.31636363,0.000005886425],"about_ca_topic_score_codex":0.0011503285,"about_ca_topic_score_gemma":0.0013086712,"teacher_disagreement_score":0.033037547,"about_ca_system_score_codex":0.00089943915,"about_ca_system_score_gemma":0.00046350624,"threshold_uncertainty_score":0.110521615},"labels":[],"label_agreement":null},{"id":"W4247539913","doi":"10.4018/978-1-4666-1574-8.ch011","title":"Simulation of Multiple Cell Population Dynamics Using a 3-D Cellular Automata Model for Tissue Growth","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cellular automaton; Multicellular organism; Dynamics (music); Population; Computer science; Biological system; Automaton; Division (mathematics); Statistical physics; Algorithm; Mathematics; Theoretical computer science; Cell; Biology; Physics","score_opus":0.030971396288719005,"score_gpt":0.2671845427604224,"score_spread":0.2362131464717034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247539913","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.098994076,0.0009629507,0.8777339,0.0006659141,0.0002139158,0.00007834941,0.0004984798,0.00089611183,0.019956378],"genre_scores_gemma":[0.75577694,0.0012972669,0.22788303,0.00018162158,0.000057279463,0.00036672267,0.00042452425,0.00015157231,0.013861036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987245,0.000029446106,0.0000100060715,0.000030517713,0.00004469906,0.000012863462],"domain_scores_gemma":[0.9997172,0.00017054594,0.00002435817,0.000031966283,0.000034882716,0.000021117467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014984397,0.0004845989,0.00059389404,0.0003340575,0.0005192029,0.001114624,0.0011534854,0.0014572463,0.002525195],"category_scores_gemma":[0.0006338004,0.00035492616,0.0009806677,0.00041364445,0.0006370161,0.0008789,0.0006447131,0.00080276985,0.0004910832],"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.00001606536,0.0000201809,0.0004065678,0.0000417085,0.000016648695,0.000105453844,0.00008660559,0.9706364,0.005281716,0.017727965,0.00044514955,0.0052154325],"study_design_scores_gemma":[0.000003975174,0.000005038032,0.000054656954,0.000004152876,0.000003864466,0.00002462797,0.0000065265035,0.99512815,0.00064414437,0.0028099674,0.0013099455,0.0000050211293],"about_ca_topic_score_codex":0.0066632703,"about_ca_topic_score_gemma":0.0045946897,"teacher_disagreement_score":0.0066632703,"about_ca_system_score_codex":0.0008878337,"about_ca_system_score_gemma":0.0006663561,"threshold_uncertainty_score":0.01324898},"labels":[],"label_agreement":null},{"id":"W4248147343","doi":"10.1007/978-1-4939-7131-2_100298","title":"Dynamic Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"","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":"University of Calgary","funders":"","keywords":"Computer science; Mathematics","score_opus":0.011253471341549933,"score_gpt":0.22472536324398307,"score_spread":0.21347189190243313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248147343","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.0032637035,0.0037278424,0.089248866,0.0016401154,0.0011661613,0.00005875826,0.0007258241,0.0006479004,0.8995208],"genre_scores_gemma":[0.09513652,0.011291494,0.03996896,0.0010854036,0.00086958404,0.00020935062,0.0026962839,0.00091214763,0.84783024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984455,0.000021132788,0.0000049530427,0.000052505762,0.000059711856,0.00001704936],"domain_scores_gemma":[0.9998523,0.00003551502,0.000007816061,0.000040346662,0.000046072808,0.000017812014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011427004,0.0008196918,0.0003388633,0.0012069966,0.0008059768,0.001734539,0.00068969466,0.0006047301,0.05018394],"category_scores_gemma":[0.00059543544,0.0003403899,0.0003281804,0.0014234383,0.00088999094,0.0025297801,0.0010047422,0.0011824651,0.018151335],"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.000006803307,0.000011975916,0.00003556773,0.00007661805,0.0000049110827,0.000029078132,0.000081113554,0.0019544014,0.0007880869,0.85275376,0.06313575,0.0811219],"study_design_scores_gemma":[0.0000032236555,0.0000054185844,0.000060810315,0.00004924245,0.00000585878,0.00008098533,0.000046559257,0.002054569,0.0006579014,0.5224545,0.47457397,0.0000069460307],"about_ca_topic_score_codex":0.0016378921,"about_ca_topic_score_gemma":0.001888113,"teacher_disagreement_score":0.05018394,"about_ca_system_score_codex":0.00114554,"about_ca_system_score_gemma":0.00064541976,"threshold_uncertainty_score":0.16788197},"labels":[],"label_agreement":null},{"id":"W4248395803","doi":"10.1214/lnms/1196285812","title":"Attractiveness of the Haar measure for linear cellular automata on Markov subgroups","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes-monograph series","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Markov chain; Measure (data warehouse); Haar measure; Markov model; Discrete mathematics; Combinatorics; Computer science; Statistics; Data mining","score_opus":0.014957658632701815,"score_gpt":0.2185847693907892,"score_spread":0.20362711075808737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248395803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52647185,0.0014473198,0.24211784,0.0022271976,0.0004211551,0.00012269212,0.00020712728,0.00031974685,0.22666496],"genre_scores_gemma":[0.96555007,0.0006165324,0.0094856545,0.00016907282,0.00025771532,0.00010158411,0.0000874634,0.000081248225,0.023650698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992581,0.0001871587,0.00003731629,0.00011690566,0.0002876838,0.00011285483],"domain_scores_gemma":[0.99751186,0.0012853089,0.00022551892,0.00022857213,0.00036122603,0.00038736124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011384696,0.0003222116,0.00061122986,0.001415132,0.0013027199,0.003692307,0.0006946209,0.00093822106,0.007964677],"category_scores_gemma":[0.0053590215,0.00029107824,0.0008776924,0.0006149565,0.0021731374,0.0027687172,0.0015748327,0.001629346,0.00092191395],"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.000010433277,0.000005360694,0.00012382529,0.000011124621,0.00000258641,0.000025332067,0.00007980958,0.0011669087,0.00066570303,0.9960543,0.00024290264,0.0016117067],"study_design_scores_gemma":[0.000010951201,0.000034190518,0.00036811072,0.000010396182,0.000007704156,0.00013410882,0.000080283964,0.03175607,0.0011049462,0.9638351,0.0026400704,0.00001804121],"about_ca_topic_score_codex":0.0007885818,"about_ca_topic_score_gemma":0.00051986176,"teacher_disagreement_score":0.007964677,"about_ca_system_score_codex":0.0017312552,"about_ca_system_score_gemma":0.00071553787,"threshold_uncertainty_score":0.026644468},"labels":[],"label_agreement":null},{"id":"W4249110821","doi":"10.1007/978-1-4939-7131-2_100354","title":"Evolution of Communities","year":2018,"lang":"en","type":"book-chapter","venue":"","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":"University of Calgary","funders":"","keywords":"Geography","score_opus":0.02491429610399566,"score_gpt":0.22605255415602726,"score_spread":0.20113825805203162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249110821","genre_codex":"other","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.23504749,0.007284203,0.3298561,0.007458903,0.0008859613,0.000113945614,0.0007008313,0.00069781684,0.4179547],"genre_scores_gemma":[0.85922724,0.0025528453,0.04412133,0.0003928703,0.00024276337,0.00010800879,0.00056162354,0.00021781804,0.092575505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965155,0.00010158817,0.000009218889,0.00010676557,0.00008287954,0.000048105252],"domain_scores_gemma":[0.9992132,0.00027944625,0.00006154317,0.0001331101,0.000155578,0.00015703929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043069315,0.00024488778,0.00034104005,0.0009793964,0.0012024845,0.0024101369,0.00086123217,0.00112753,0.009923677],"category_scores_gemma":[0.0038494929,0.00032285514,0.00041587974,0.0007541742,0.0014289172,0.0024886653,0.0017639778,0.0009885979,0.0015459704],"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.000020282254,0.000012907292,0.00064649846,0.0000676992,0.000018199562,0.000077863355,0.00037714883,0.008583041,0.002502829,0.9455638,0.0072029354,0.034926742],"study_design_scores_gemma":[0.000010895659,0.000014165181,0.00085872924,0.000042103147,0.00001048191,0.00024282445,0.00027614774,0.034154773,0.0011056986,0.9225909,0.040677227,0.000015991467],"about_ca_topic_score_codex":0.0023856303,"about_ca_topic_score_gemma":0.0023344106,"teacher_disagreement_score":0.009923677,"about_ca_system_score_codex":0.0012635045,"about_ca_system_score_gemma":0.0005894658,"threshold_uncertainty_score":0.033198},"labels":[],"label_agreement":null},{"id":"W4250511211","doi":"10.4018/978-1-4666-2476-4.ch017","title":"A Modular Dynamical Cryptosystem Based on Continuous-Interval Cellular Automata","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cryptosystem; Encryption; Cellular automaton; Theoretical computer science; Interval (graph theory); Chaotic; Attractor; Computer science; Cryptography; Measure (data warehouse); Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Data mining; Artificial intelligence; Mathematical analysis; Combinatorics","score_opus":0.012975461330932216,"score_gpt":0.2249959179210317,"score_spread":0.2120204565900995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250511211","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.07539397,0.0019468039,0.87416744,0.0006314825,0.0006549262,0.00015319408,0.0001773762,0.0011041925,0.04577054],"genre_scores_gemma":[0.759491,0.0016479761,0.22077604,0.00015289497,0.00014939545,0.0001528298,0.000150242,0.000072271934,0.017407387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998647,0.00002346099,0.0000100058505,0.000033597214,0.000053608488,0.000014597215],"domain_scores_gemma":[0.99989164,0.000031698863,0.0000135034525,0.000030668787,0.000020084522,0.0000124630715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012721444,0.00029332165,0.00026455775,0.00037405925,0.00030011838,0.0006497366,0.00035959794,0.0004355089,0.002476135],"category_scores_gemma":[0.00041186617,0.000099617864,0.00042211355,0.00031389704,0.0005702344,0.00068972196,0.0004838786,0.0005386352,0.00061869866],"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.00014737307,0.000089592555,0.0005422651,0.00026661204,0.000053325537,0.00047274792,0.00017757574,0.06990411,0.11086798,0.6651564,0.0032674714,0.14905453],"study_design_scores_gemma":[0.000093512135,0.00046204735,0.00097020454,0.00008530299,0.00006223165,0.0013637537,0.000052839398,0.7115394,0.064734265,0.12469841,0.09585954,0.00007856981],"about_ca_topic_score_codex":0.00042840603,"about_ca_topic_score_gemma":0.00032459892,"teacher_disagreement_score":0.002476135,"about_ca_system_score_codex":0.00040171706,"about_ca_system_score_gemma":0.00033066113,"threshold_uncertainty_score":0.008283496},"labels":[],"label_agreement":null},{"id":"W4251021534","doi":"10.22215/etd/2007-06653","title":"Gray codes, universal cycles and confguration orderings for block designs","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Gray (unit); Computer science; Mathematics; Arithmetic; Humanities; Art; Medicine","score_opus":0.019719345011558306,"score_gpt":0.2896737514484112,"score_spread":0.26995440643685287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251021534","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.22905445,0.0031895097,0.6172287,0.0010731892,0.0003868381,0.00021242388,0.00088585535,0.0010371802,0.146932],"genre_scores_gemma":[0.8153985,0.0015386377,0.12942307,0.00036653597,0.0001550919,0.00020760698,0.00070982246,0.00026143758,0.05193928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996855,0.00006777589,0.000024539777,0.000052210118,0.00010885832,0.00006109998],"domain_scores_gemma":[0.9993104,0.00026729566,0.00009194898,0.00014785561,0.00011778671,0.00006468494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002998338,0.00037607603,0.00028762224,0.0009069636,0.00049665663,0.0010841629,0.0003083716,0.00040451196,0.0065613333],"category_scores_gemma":[0.0016885616,0.00021407976,0.0002699572,0.0008949959,0.0009964316,0.0011432082,0.00054880267,0.0006518445,0.0007644107],"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.00009822817,0.000020616328,0.00025189397,0.00006980762,0.000004776471,0.000061587154,0.00012150968,0.010568639,0.0031225737,0.9046142,0.003426124,0.07764002],"study_design_scores_gemma":[0.000024342264,0.00007153737,0.0002202424,0.000037684928,0.000006215105,0.00010373694,0.000047385198,0.028562445,0.0033322042,0.95069635,0.016881976,0.000015927504],"about_ca_topic_score_codex":0.0020138705,"about_ca_topic_score_gemma":0.004095209,"teacher_disagreement_score":0.0065613333,"about_ca_system_score_codex":0.0010026962,"about_ca_system_score_gemma":0.0008240423,"threshold_uncertainty_score":0.021949887},"labels":[],"label_agreement":null},{"id":"W4251067302","doi":"10.1017/9781108989817.029","title":"New Coding","year":2021,"lang":"ro","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Coding (social sciences); Mathematics; Statistics","score_opus":0.028851540171122687,"score_gpt":0.2051857476860043,"score_spread":0.17633420751488163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251067302","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.0008703104,0.0055597257,0.030983984,0.006572616,0.010910732,0.00026231783,0.00819949,0.0027349216,0.933906],"genre_scores_gemma":[0.00422092,0.004927913,0.011031393,0.0013432465,0.00083468365,0.00018885928,0.005798872,0.0013634916,0.97029066],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883336,0.00016426502,0.000065487526,0.00016509583,0.00063922454,0.00013260508],"domain_scores_gemma":[0.9970074,0.0006173836,0.00007631704,0.0007482312,0.0012809337,0.00026965034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014037524,0.00090540375,0.00074151583,0.0036654773,0.0015029395,0.00452563,0.0019844584,0.0012971145,0.5248829],"category_scores_gemma":[0.0067622946,0.00047351993,0.00088037725,0.0041042618,0.0013896934,0.005303414,0.0027483355,0.0029812623,0.31769538],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00003722925,0.000017278704,0.00008391742,0.00025249404,0.000003332627,0.000087375134,0.00021854007,0.00016753332,0.0005442308,0.0647315,0.69810325,0.23575345],"study_design_scores_gemma":[0.000002579852,0.0000050524063,0.00010323046,0.00009256246,0.0000017342339,0.00013877923,0.000060057402,0.000093896364,0.00015897996,0.007750718,0.99158454,0.000007907066],"about_ca_topic_score_codex":0.0046956684,"about_ca_topic_score_gemma":0.007515025,"teacher_disagreement_score":0.5248829,"about_ca_system_score_codex":0.0023152758,"about_ca_system_score_gemma":0.0024695871,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4251567909","doi":"10.1017/s0143385702000548","title":"Limit measures for affine cellular automata","year":2002,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Abelian group; Mathematics; Combinatorics; Haar measure; Measure (data warehouse); Endomorphism; Semigroup; Discrete mathematics","score_opus":0.014816823175532562,"score_gpt":0.21320491503988162,"score_spread":0.19838809186434905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251567909","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.39831546,0.0034383393,0.52021265,0.0020545698,0.0003150226,0.00013322826,0.0006371508,0.0009491527,0.07394448],"genre_scores_gemma":[0.9485763,0.0010160314,0.029379629,0.0003018104,0.00020488891,0.00026985694,0.00039641594,0.00014751192,0.019707631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888355,0.00026677156,0.00008019443,0.00027343456,0.000303332,0.0001928158],"domain_scores_gemma":[0.99566,0.0022336799,0.00045775875,0.00024135872,0.000846754,0.0005604228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013433754,0.0007922835,0.00086411193,0.0024050223,0.0020691385,0.004258348,0.0014177151,0.0014052084,0.006645267],"category_scores_gemma":[0.00802656,0.0005023877,0.0013134741,0.00093975087,0.002662153,0.0030427405,0.0019671866,0.0018058298,0.0008292648],"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.000008361909,0.000010941551,0.00033052807,0.000023607825,0.0000094121515,0.000049674265,0.00014658745,0.0050825668,0.00063080125,0.99174327,0.0003136141,0.0016506092],"study_design_scores_gemma":[0.000014639888,0.00002995351,0.00031430656,0.000029036313,0.00001386439,0.000089130575,0.00012812253,0.17335127,0.00087427447,0.8225109,0.0026203722,0.000024109971],"about_ca_topic_score_codex":0.004053102,"about_ca_topic_score_gemma":0.0030586277,"teacher_disagreement_score":0.006645267,"about_ca_system_score_codex":0.0037496968,"about_ca_system_score_gemma":0.0010815787,"threshold_uncertainty_score":0.027206123},"labels":[],"label_agreement":null},{"id":"W4251845359","doi":"10.24908/iqurcp.7917","title":"TrueLife – Evolving the Game of Life","year":2017,"lang":"en","type":"article","venue":"Inquiry Queen s Undergraduate Research Conference Proceedings","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cellular automaton; Computer science; Artificial life; Key (lock); Process (computing); Darwinism; Game theory; State (computer science); Artificial intelligence; Automaton; Simulations and games in economics education; Theoretical computer science; Mathematical economics; Sequential game; Epistemology; Mathematics; Algorithm","score_opus":0.12925638912199006,"score_gpt":0.3783751516552198,"score_spread":0.24911876253322973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251845359","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.040848736,0.0020584026,0.8426391,0.008381344,0.0012447448,0.00031932892,0.00052841444,0.0010453406,0.10293457],"genre_scores_gemma":[0.6117495,0.0021149358,0.33509907,0.0033522123,0.00030476123,0.00081160764,0.0006934369,0.00061606744,0.045258418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987895,0.0005443724,0.000061852035,0.00027059048,0.00023773979,0.0000960257],"domain_scores_gemma":[0.99777055,0.001337987,0.00015850221,0.00032007278,0.00019290354,0.00021995594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001221596,0.00069960946,0.0006055711,0.0004520152,0.0015049163,0.0027527264,0.0015255618,0.0013784217,0.0070406524],"category_scores_gemma":[0.0074913125,0.00039270383,0.0010688966,0.00039597662,0.004507453,0.0046656122,0.0024782429,0.0022864768,0.0010737005],"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.000051274874,0.00003363009,0.0005127717,0.000092442766,0.000029241522,0.000117020994,0.0003982618,0.02609772,0.0010118253,0.9479552,0.0066446573,0.017055837],"study_design_scores_gemma":[0.000036187786,0.00007282072,0.00020596375,0.00006245543,0.000017359862,0.00016163997,0.00013742823,0.13599478,0.0014247893,0.7734949,0.088339984,0.00005168329],"about_ca_topic_score_codex":0.0051362645,"about_ca_topic_score_gemma":0.00413767,"teacher_disagreement_score":0.0070406524,"about_ca_system_score_codex":0.0016502355,"about_ca_system_score_gemma":0.0012853557,"threshold_uncertainty_score":0.023553312},"labels":[],"label_agreement":null},{"id":"W4285286145","doi":"10.1007/978-3-031-08751-6_35","title":"Consistency Fences for Partial Order Delivery to Reduce Latency","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Alberta","funders":"","keywords":"Latency (audio); Consistency (knowledge bases); Computer science; Order (exchange); Business; Telecommunications; Artificial intelligence","score_opus":0.02446658024418878,"score_gpt":0.26178568520003503,"score_spread":0.23731910495584627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285286145","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.0311815,0.0016992083,0.9408542,0.0014173588,0.0012297496,0.00050484476,0.00058003736,0.0064560063,0.016077062],"genre_scores_gemma":[0.4840726,0.0012260521,0.47842076,0.0012869358,0.00068084226,0.000756495,0.0010525243,0.002245171,0.030258775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977985,0.00043002382,0.00018870113,0.00033549077,0.00077838154,0.0004688852],"domain_scores_gemma":[0.9891199,0.003887196,0.00057468074,0.004372837,0.0016438178,0.00040155774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003527067,0.0011944262,0.0019626503,0.0015037361,0.0023539583,0.0026325614,0.0036347103,0.0012699553,0.018597122],"category_scores_gemma":[0.012307323,0.0009518235,0.0012628477,0.002465397,0.0016583683,0.0049733985,0.0037835287,0.003937522,0.0025934451],"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.0023001374,0.0004395652,0.0011976451,0.000829814,0.0001326233,0.00031746228,0.0006008688,0.07673539,0.014925809,0.41203547,0.052973114,0.43751222],"study_design_scores_gemma":[0.00055774325,0.0006321439,0.00051149,0.00023194788,0.000224629,0.00038068424,0.0003470135,0.48069686,0.03415217,0.42412153,0.0580199,0.00012386135],"about_ca_topic_score_codex":0.004066411,"about_ca_topic_score_gemma":0.0054477453,"teacher_disagreement_score":0.018597122,"about_ca_system_score_codex":0.0022821887,"about_ca_system_score_gemma":0.0050516175,"threshold_uncertainty_score":0.0622136},"labels":[],"label_agreement":null},{"id":"W4288796553","doi":"10.26443/msurj.v15i1.12","title":"Comparison of Complexity and Predictability of a Cellular Automaton Model in Excitable Media Cardiac Wave Propagation Compared with a FitzHugh-Nagumo Model","year":2020,"lang":"en","type":"article","venue":"McGill Science Undergraduate Research Journal","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University; National Science Foundation","keywords":"Cellular automaton; Excitable medium; Physics; Predictability; Planar; Spiral wave; Statistical physics; Algorithm; Mechanics; Mathematics; Computer science; Mathematical analysis; Spiral (railway)","score_opus":0.18187041035807183,"score_gpt":0.3637626353307239,"score_spread":0.18189222497265206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288796553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9562056,0.00017956556,0.03967847,0.00036367174,0.00002652204,0.000033718912,0.00018090333,0.00016258421,0.003168866],"genre_scores_gemma":[0.99576724,0.00006252519,0.0037126278,0.00001794355,0.000005752841,0.000021266369,0.000118953445,0.00001649252,0.00027730424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974734,0.00006573406,0.000019821071,0.000059408998,0.00005933154,0.000048335067],"domain_scores_gemma":[0.99507517,0.003646144,0.0004137448,0.00025348412,0.00042313137,0.00018837089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396322,0.0005327224,0.00055946986,0.0009905287,0.00050222996,0.0009814024,0.0005787756,0.0009474782,0.0008868259],"category_scores_gemma":[0.005323323,0.0002681145,0.0005775933,0.00038793348,0.00075875066,0.0009257425,0.00052534364,0.0007157261,0.00010498024],"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.000045493383,0.00002021365,0.0035073438,0.000016734133,0.000015580132,0.000040459683,0.000050293762,0.9921747,0.00071392086,0.002055115,0.00007294135,0.0012871893],"study_design_scores_gemma":[0.0000022932604,0.000008399019,0.00032010023,0.0000016860054,0.0000027539418,0.00000430668,0.0000064438495,0.99902356,0.00014189495,0.00046089356,0.000024769266,0.0000028637282],"about_ca_topic_score_codex":0.018167542,"about_ca_topic_score_gemma":0.007736966,"teacher_disagreement_score":0.018167542,"about_ca_system_score_codex":0.0015468517,"about_ca_system_score_gemma":0.00083693163,"threshold_uncertainty_score":0.036123633},"labels":[],"label_agreement":null},{"id":"W4289345254","doi":"10.1017/etds.2022.48","title":"On images of subshifts under embeddings of symbolic varieties","year":2022,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Injective function; Homomorphism; Morphism; Countable set; Monoid; Image (mathematics); Pure mathematics; Subshift of finite type; Algebraic number; Type (biology); Equivariant map; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.0045303388287984475,"score_gpt":0.2122617545281443,"score_spread":0.20773141569934586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289345254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96164143,0.00029606794,0.023168318,0.00010362352,0.000071366805,0.000022725324,0.000078077755,0.00018796678,0.014430371],"genre_scores_gemma":[0.9939989,0.000109791676,0.0028094435,0.000021577553,0.000039164195,0.000018216671,0.000073926414,0.000033220378,0.0028957305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992211,0.000072866096,0.00005688016,0.00023302522,0.00019569168,0.00022032108],"domain_scores_gemma":[0.99899143,0.00025658138,0.0001852828,0.00009225564,0.0002021801,0.0002721669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046349605,0.00037108906,0.00036640142,0.0013965068,0.0009943277,0.002451824,0.00046117837,0.00043941548,0.0037555208],"category_scores_gemma":[0.001485271,0.0002996095,0.0005292804,0.0004979999,0.00217409,0.0020501073,0.0020491935,0.0007143489,0.00034115484],"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.00042151354,0.00013233093,0.006877769,0.000119036806,0.000039571252,0.0025874793,0.0051218313,0.002468944,0.03708944,0.921178,0.00049626443,0.023467816],"study_design_scores_gemma":[0.00013471085,0.00072518224,0.01814028,0.00014373919,0.0001571795,0.003931789,0.0076212124,0.029438835,0.088860154,0.8267524,0.023953434,0.00014102693],"about_ca_topic_score_codex":0.001092903,"about_ca_topic_score_gemma":0.00059028185,"teacher_disagreement_score":0.0037555208,"about_ca_system_score_codex":0.0010278632,"about_ca_system_score_gemma":0.00034313183,"threshold_uncertainty_score":0.012563407},"labels":[],"label_agreement":null},{"id":"W4291337009","doi":"","title":"DADAO: Decoupled Accelerated Decentralized Asynchronous Optimization for Time-Varying Gossips","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Concordia University","funders":"","keywords":"Asynchronous communication; Computer science; Control theory (sociology); Telecommunications; Control (management); Artificial intelligence","score_opus":0.018711843164709228,"score_gpt":0.248899229917305,"score_spread":0.23018738675259579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291337009","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.016485203,0.00022619903,0.97603446,0.0002493156,0.00022334383,0.00007354267,0.00011833511,0.0018836111,0.004705986],"genre_scores_gemma":[0.62188965,0.0002044799,0.36761898,0.00024627402,0.00019637337,0.0004617072,0.00029616532,0.0006756823,0.0084107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933964,0.00019743173,0.000026347561,0.00012322227,0.00021323959,0.00010008063],"domain_scores_gemma":[0.9985991,0.0008183014,0.000075818854,0.00019223163,0.00017814196,0.00013639612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012176986,0.0010184306,0.001464462,0.00043869496,0.0007170581,0.0011106731,0.001731763,0.0010720254,0.005738095],"category_scores_gemma":[0.004246643,0.00054648507,0.0005680364,0.0005429056,0.00070984184,0.00091154396,0.0018562408,0.0017147951,0.00093771704],"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.00047680677,0.00013478966,0.00036546262,0.0001543514,0.000077183824,0.000072651535,0.00008210708,0.884664,0.0057972623,0.030528836,0.006162993,0.071483575],"study_design_scores_gemma":[0.0000492269,0.000018107821,0.000024823688,0.0000019475913,0.000004265691,0.0000042713004,0.0000037137565,0.995169,0.00042791085,0.0038001242,0.00049363024,0.0000030529043],"about_ca_topic_score_codex":0.0040652584,"about_ca_topic_score_gemma":0.0076534213,"teacher_disagreement_score":0.005738095,"about_ca_system_score_codex":0.0007695426,"about_ca_system_score_gemma":0.0019927097,"threshold_uncertainty_score":0.019195914},"labels":[],"label_agreement":null},{"id":"W4291889490","doi":"10.3390/jrfm15080360","title":"Multiple Neighborhood Cellular Automata as a Mechanism for Creating an AGI on a Blockchain","year":2022,"lang":"en","type":"article","venue":"Journal of risk and financial management","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Cellular automaton; Construct (python library); Cognitive science; Context (archaeology); Mechanism (biology); Implementation; Incentive; Artificial general intelligence; Artificial intelligence; Phenomenon; Cognition; Automaton; Theoretical computer science; Epistemology; Psychology; Programming language; Neuroscience","score_opus":0.008240855651611985,"score_gpt":0.22007842966314806,"score_spread":0.21183757401153608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291889490","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.2844956,0.00042267147,0.64330035,0.0024856012,0.0003365824,0.0002275545,0.00024595688,0.0007697809,0.067715876],"genre_scores_gemma":[0.94860876,0.00020454919,0.040814403,0.000110906956,0.000030397086,0.00019453568,0.000045548084,0.00004785313,0.009943076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946076,0.00022983285,0.00003225386,0.00009018006,0.00011113821,0.00007576062],"domain_scores_gemma":[0.99876165,0.0005830218,0.00010831161,0.00024603962,0.00013017413,0.00017076441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073970476,0.0003019647,0.00057110743,0.0005308391,0.0013031729,0.0016911373,0.0013007983,0.0013530131,0.008445084],"category_scores_gemma":[0.0030005632,0.00026771676,0.00066603837,0.00042573438,0.0019121452,0.0022424562,0.0019650494,0.0010749169,0.00080641516],"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.000077639685,0.00005109636,0.000674253,0.00004710401,0.000027422908,0.0003547753,0.00030339693,0.13242738,0.004145782,0.8534717,0.0010582436,0.007361227],"study_design_scores_gemma":[0.00005541786,0.00005983015,0.00019676646,0.000024793668,0.000019910287,0.00009809893,0.00007986378,0.63213253,0.001320853,0.36057055,0.005413948,0.00002743917],"about_ca_topic_score_codex":0.002701599,"about_ca_topic_score_gemma":0.0028188438,"teacher_disagreement_score":0.008445084,"about_ca_system_score_codex":0.001154902,"about_ca_system_score_gemma":0.0009271305,"threshold_uncertainty_score":0.028251648},"labels":[],"label_agreement":null},{"id":"W4295763127","doi":"10.1016/j.tcs.2022.09.011","title":"On invertible and stably reversible non-uniform cellular automata","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Injective function; Cellular automaton; Invertible matrix; Mathematics; Equivalence (formal languages); Abelian group; Pure mathematics; Stochastic cellular automaton; Discrete mathematics; Algorithm","score_opus":0.0075284133935657705,"score_gpt":0.21716065134038054,"score_spread":0.20963223794681476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295763127","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.34988704,0.0023668273,0.5102312,0.001170637,0.00046742227,0.000103451006,0.00044252706,0.0007685536,0.13456231],"genre_scores_gemma":[0.94970053,0.0011216045,0.01965965,0.00017971994,0.00020964454,0.00008109965,0.00018771243,0.0001375154,0.028722502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934,0.00012584655,0.00004391138,0.00016594566,0.00018856689,0.00013566208],"domain_scores_gemma":[0.9977314,0.0013791372,0.00017972644,0.00029163915,0.00029939032,0.000118782875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164219,0.0006750038,0.00072052004,0.00084838516,0.0009559318,0.001818241,0.0010864902,0.00095794076,0.0071059666],"category_scores_gemma":[0.00391429,0.00039850187,0.00086685235,0.00064095686,0.0025351064,0.0022865748,0.0017473924,0.0015994878,0.00065640506],"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.000040620635,0.00001814887,0.00014018496,0.00004329714,0.0000064352257,0.00014057869,0.00022954764,0.010799646,0.0029139158,0.9779222,0.00035329553,0.0073920703],"study_design_scores_gemma":[0.000016948945,0.000031769694,0.00019865892,0.000016510565,0.000010183221,0.00010806575,0.00006889803,0.058650613,0.0020790678,0.93610495,0.0026937728,0.000020528967],"about_ca_topic_score_codex":0.0022247063,"about_ca_topic_score_gemma":0.0019661272,"teacher_disagreement_score":0.0071059666,"about_ca_system_score_codex":0.0011271031,"about_ca_system_score_gemma":0.0006420081,"threshold_uncertainty_score":0.023771882},"labels":[],"label_agreement":null},{"id":"W4308825006","doi":"10.1109/cas56377.2022.9934500","title":"Encryption Algorithm using Linear Hybrid Cellular Automaton","year":2022,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ontario Ministry of Research, Innovation and Science","keywords":"Computer science; Encryption; VHDL; Correctness; Hardware description language; Algorithm; Key (lock); Stream cipher; Field-programmable gate array; Block cipher; Symmetric-key algorithm; Cryptography; Theoretical computer science; Embedded system; Public-key cryptography; Computer network; Operating system","score_opus":0.01687637262773136,"score_gpt":0.24100344157896883,"score_spread":0.22412706895123746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308825006","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.11092755,0.0003370049,0.86740124,0.00026077768,0.0001381683,0.0001405437,0.00018914332,0.0025308896,0.018074691],"genre_scores_gemma":[0.8790735,0.00019803649,0.1154332,0.000069675116,0.000013362703,0.00014748942,0.00013725937,0.00004588134,0.0048814774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997707,0.00003886683,0.000020793681,0.00006349512,0.00007300776,0.000033095064],"domain_scores_gemma":[0.99984765,0.00004593089,0.000016220683,0.000029235794,0.000051081483,0.000009765457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014001058,0.00026420385,0.0003677806,0.00027645877,0.00045519415,0.00063981704,0.00051888626,0.0004005822,0.0018582119],"category_scores_gemma":[0.00032837663,0.000118725904,0.0005189961,0.00021918652,0.00034992248,0.00038568984,0.00035916557,0.00032074962,0.00044965866],"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.00028154577,0.00011906502,0.0023899619,0.0002529369,0.0001217026,0.00063997164,0.0002594499,0.6891436,0.12081135,0.07645862,0.0023404201,0.10718132],"study_design_scores_gemma":[0.000027051681,0.00008138613,0.00024936788,0.000009918142,0.00002353552,0.00014835269,0.000020449086,0.973656,0.017056039,0.005197855,0.0035120538,0.00001805395],"about_ca_topic_score_codex":0.003317374,"about_ca_topic_score_gemma":0.0022290228,"teacher_disagreement_score":0.003317374,"about_ca_system_score_codex":0.0005025106,"about_ca_system_score_gemma":0.00047907935,"threshold_uncertainty_score":0.006596148},"labels":[],"label_agreement":null},{"id":"W4311881968","doi":"10.21203/rs.3.rs-2348688/v1","title":"A New Self-Shrinking Generator","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Mitacs","keywords":"Self-shrinking generator; Generator (circuit theory); NIST; Randomness; Computer science; Resizing; Generalization; Mathematics; Electrical engineering; Physics; Engineering; Induction generator; Mathematical analysis; Power (physics); Speech recognition; Voltage; Statistics","score_opus":0.06771155426041596,"score_gpt":0.38497278650381594,"score_spread":0.31726123224339997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311881968","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.14312458,0.0008594368,0.77306414,0.0012064332,0.0014968034,0.0001988651,0.00035058398,0.0016178007,0.07808133],"genre_scores_gemma":[0.72702885,0.0007220031,0.1966772,0.0006684649,0.00075815263,0.0004017384,0.00043590285,0.0008221515,0.07248552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998062,0.000051556188,0.000009245199,0.000062146304,0.00004634288,0.000024493122],"domain_scores_gemma":[0.999463,0.00020112295,0.000037408612,0.0001239281,0.00009551085,0.0000789114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025298094,0.00038402822,0.00047319598,0.0006639738,0.0005616621,0.0006759385,0.00079281064,0.0007939485,0.010567666],"category_scores_gemma":[0.0013237478,0.0002677099,0.00047891907,0.0003756808,0.00062216853,0.0009462098,0.0011158235,0.0007901449,0.0019447865],"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.00014165464,0.00008430479,0.0004307989,0.00018384522,0.000021293768,0.00040285633,0.0002849674,0.017868865,0.06570066,0.79201573,0.009679171,0.11318579],"study_design_scores_gemma":[0.0001425801,0.0002281213,0.00047185275,0.000038501454,0.000037374088,0.0010836924,0.000072389885,0.33907926,0.027704552,0.58000296,0.051079113,0.000059740254],"about_ca_topic_score_codex":0.00013529611,"about_ca_topic_score_gemma":0.00016213668,"teacher_disagreement_score":0.010567666,"about_ca_system_score_codex":0.00025493593,"about_ca_system_score_gemma":0.00030506146,"threshold_uncertainty_score":0.03535235},"labels":[],"label_agreement":null},{"id":"W4360998556","doi":"10.2139/ssrn.4401561","title":"On Decidable and Pointwise Properties of Non-Uniform Cellular Automata","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","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":"Université de Montréal","funders":"","keywords":"Pointwise; Decidability; Cellular automaton; Mathematics; Discrete mathematics; Computer science; Pure mathematics; Theoretical computer science; Algorithm; Mathematical analysis","score_opus":0.009589644181091744,"score_gpt":0.21693914090480054,"score_spread":0.2073494967237088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360998556","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.19982953,0.0013968399,0.7562236,0.004145895,0.00028311455,0.000283295,0.0014354904,0.0014122955,0.034989804],"genre_scores_gemma":[0.8867411,0.00083124277,0.098485276,0.0009217394,0.00040279966,0.00054545485,0.0019945137,0.0004907432,0.009587104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99222285,0.0025749013,0.0006015286,0.0019376652,0.0014429631,0.0012200607],"domain_scores_gemma":[0.9045682,0.08605534,0.00172979,0.0042348388,0.0025234004,0.0008884848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006787029,0.0010434894,0.0016114947,0.0014944545,0.0023172738,0.0062042964,0.0047459067,0.0026665856,0.006968298],"category_scores_gemma":[0.037010178,0.001356896,0.0043633827,0.0020275475,0.0062159407,0.014521931,0.004647646,0.00957667,0.00064003357],"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.00023346343,0.000115140436,0.0012287773,0.00030987308,0.00007263977,0.0003268369,0.0009350916,0.02379373,0.0027443508,0.95707834,0.0017994246,0.0113623],"study_design_scores_gemma":[0.000054816886,0.000029804534,0.00020165843,0.000032789867,0.000043395125,0.00010005281,0.0001502058,0.0565156,0.0033782867,0.938028,0.0014435503,0.000021712498],"about_ca_topic_score_codex":0.0030045027,"about_ca_topic_score_gemma":0.0029949013,"teacher_disagreement_score":0.006968298,"about_ca_system_score_codex":0.0036123577,"about_ca_system_score_gemma":0.002436494,"threshold_uncertainty_score":0.03589368},"labels":[],"label_agreement":null},{"id":"W4361865554","doi":"10.48550/arxiv.2303.16997","title":"Hyperbolicity Theorems for Correspondence Colouring","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Planar graph; Vertex (graph theory); Generalization; Girth (graph theory); Discrete mathematics; Graph","score_opus":0.1326372901446779,"score_gpt":0.20961817052804416,"score_spread":0.07698088038336626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361865554","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.12993301,0.0006994361,0.76979786,0.001698796,0.0002073089,0.00017699462,0.00067866454,0.00088186725,0.09592598],"genre_scores_gemma":[0.8702129,0.00071635935,0.098949775,0.001111571,0.00028232535,0.00033072117,0.000884404,0.00042190944,0.027090024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983473,0.00026859116,0.00009233183,0.00058598607,0.00042513877,0.00028067027],"domain_scores_gemma":[0.9932848,0.0040801093,0.0005721284,0.0010777536,0.0007065007,0.00027865218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012557588,0.0005208344,0.0004582192,0.0012390936,0.0014042137,0.0020608471,0.0015690849,0.0009360669,0.011864626],"category_scores_gemma":[0.0062221587,0.0005452202,0.0016487106,0.0012078655,0.003066841,0.005803924,0.0025516113,0.0029000274,0.0011916631],"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.000031479045,0.000021786751,0.0007824068,0.00009021457,0.000011703476,0.00012160391,0.00050226075,0.0054271715,0.0020346148,0.97659063,0.0018148227,0.012571227],"study_design_scores_gemma":[0.0000242488,0.000037934708,0.00068286224,0.000026412676,0.000025548241,0.00025917462,0.00022017208,0.025175264,0.005398298,0.9507364,0.017385079,0.000028569482],"about_ca_topic_score_codex":0.0019462318,"about_ca_topic_score_gemma":0.0012342522,"teacher_disagreement_score":0.011864626,"about_ca_system_score_codex":0.002593835,"about_ca_system_score_gemma":0.000738941,"threshold_uncertainty_score":0.03969115},"labels":[],"label_agreement":null},{"id":"W4376527350","doi":"10.1007/978-981-99-0688-8_8","title":"Representation of Evolution of One-Dimensional Homogeneous Cellular Automata Using Monoid Action","year":2023,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","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":"Heritage College","funders":"","keywords":"Monoid; Cellular automaton; Homogeneous; Action (physics); Automaton; Syntactic monoid; Representation (politics); Block cellular automaton; Stochastic cellular automaton; Set (abstract data type); Function (biology); Mathematics; Free monoid; Computer science; Pure mathematics; Algorithm; Combinatorics; Mobile automaton; Theoretical computer science; Automata theory; Physics; Biology","score_opus":0.05532736972304332,"score_gpt":0.3035373115836042,"score_spread":0.2482099418605609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376527350","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.053127773,0.00088847417,0.9032997,0.00025825735,0.00027195385,0.00005640092,0.00027366003,0.0006103348,0.041213524],"genre_scores_gemma":[0.74402726,0.0009626273,0.22863415,0.0001179821,0.00009058199,0.00017818282,0.0004959074,0.00021678054,0.025276633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989164,0.000026696833,0.000008580591,0.00002649499,0.000030415818,0.000016199894],"domain_scores_gemma":[0.99985826,0.000048638052,0.000015539888,0.000024913534,0.000037833142,0.000014892663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017667405,0.00038052516,0.0005673873,0.00063459855,0.00048276992,0.0014788659,0.0008489892,0.00065344456,0.0039829644],"category_scores_gemma":[0.0004917706,0.00020529445,0.0008037672,0.00050384563,0.0007005262,0.00072560186,0.00060132134,0.0005920062,0.00064915296],"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.00003839086,0.000032681946,0.00027247623,0.00007912672,0.000019865412,0.00015234426,0.00020210071,0.17342827,0.0069919094,0.79241073,0.0012363764,0.025135744],"study_design_scores_gemma":[0.000009933241,0.000020681575,0.00011480712,0.0000122885585,0.000012427391,0.000069601374,0.00003635515,0.810289,0.001608023,0.18246451,0.0053465655,0.000015726364],"about_ca_topic_score_codex":0.0032224904,"about_ca_topic_score_gemma":0.0027314278,"teacher_disagreement_score":0.0039829644,"about_ca_system_score_codex":0.0009009797,"about_ca_system_score_gemma":0.00057821046,"threshold_uncertainty_score":0.01332432},"labels":[],"label_agreement":null},{"id":"W4377241521","doi":"10.4153/s0008414x23000329","title":"Stable finiteness of twisted group rings and noisy linear cellular automata","year":2023,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Surjective function; Group (periodic table); Group ring; Injective function; Combinatorics; Ring (chemistry); Finite group; Discrete mathematics; Pure mathematics","score_opus":0.02329982199029418,"score_gpt":0.22716680302826536,"score_spread":0.20386698103797118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377241521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8200946,0.0003652157,0.16996622,0.00019691174,0.000051378913,0.000029545565,0.0001597104,0.00023767997,0.008898786],"genre_scores_gemma":[0.99452955,0.000055419445,0.004243754,0.000013857901,0.00001591318,0.000017535694,0.00003689559,0.000011144857,0.0010760044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915266,0.00020360443,0.00006441915,0.0002713244,0.00016961616,0.0001383162],"domain_scores_gemma":[0.99611264,0.0017015929,0.0006803325,0.0006856207,0.00047215677,0.00034773114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007646617,0.00029801612,0.00044545974,0.00075273245,0.0006104739,0.0017232349,0.00067002414,0.0004220216,0.0019973628],"category_scores_gemma":[0.0043605706,0.000222863,0.0005344717,0.000348202,0.0025274963,0.0020430672,0.0011048781,0.00065271667,0.00020884107],"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.00021793263,0.00003563003,0.0032221456,0.00007162133,0.00003304589,0.0004403141,0.00082462816,0.047260806,0.018267585,0.92143947,0.00023456734,0.007952198],"study_design_scores_gemma":[0.000038498747,0.0002338743,0.0020881211,0.00004931118,0.000052679192,0.000514778,0.00042717578,0.36707708,0.028856024,0.59710777,0.0034748313,0.00007983861],"about_ca_topic_score_codex":0.0007796379,"about_ca_topic_score_gemma":0.000450048,"teacher_disagreement_score":0.0019973628,"about_ca_system_score_codex":0.000978255,"about_ca_system_score_gemma":0.00035188632,"threshold_uncertainty_score":0.0070978403},"labels":[],"label_agreement":null},{"id":"W4378837733","doi":"10.1142/s0129054123470019","title":"Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Hamiltonian path; Control reconfiguration; Hamiltonian (control theory); Transpose; Vertex (graph theory); Mathematics; Combinatorics; Grid; Lattice graph; Cycle basis; Graph; Discrete mathematics; Line graph; Computer science; Geometry; Voltage graph; Physics; Graph power; Quantum mechanics; Mathematical optimization","score_opus":0.017912321683965504,"score_gpt":0.302799428054932,"score_spread":0.2848871063709665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378837733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9081779,0.0004469888,0.077033885,0.00015001018,0.00006803779,0.0000458002,0.000107030915,0.000334669,0.013635652],"genre_scores_gemma":[0.9882465,0.0001743694,0.009698693,0.0000338639,0.000013480899,0.000035013305,0.00008980057,0.000035956127,0.0016723952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998698,0.000029335424,0.0000072800462,0.00003701289,0.00001840813,0.000038233837],"domain_scores_gemma":[0.9995881,0.00016411298,0.00009569038,0.00006961989,0.000024890633,0.000057561465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094054645,0.00024495434,0.00030127398,0.0003335086,0.00033478343,0.00041709005,0.00046811358,0.00036276862,0.0022439726],"category_scores_gemma":[0.0010085875,0.00021520123,0.00026334828,0.00046402615,0.0007105363,0.0008096,0.0005839552,0.00028080522,0.00018909057],"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.00043781643,0.00012891262,0.0043832464,0.00036451695,0.00008652036,0.0030157834,0.0008286116,0.63146573,0.07753293,0.21426396,0.003537819,0.06395421],"study_design_scores_gemma":[0.000100396464,0.00022065779,0.0036651934,0.000031759315,0.00004122971,0.00084360805,0.00059870107,0.78797746,0.016257094,0.18080781,0.009408826,0.000047270045],"about_ca_topic_score_codex":0.0014623641,"about_ca_topic_score_gemma":0.0010748641,"teacher_disagreement_score":0.0022439726,"about_ca_system_score_codex":0.00040357158,"about_ca_system_score_gemma":0.00015613757,"threshold_uncertainty_score":0.007506788},"labels":[],"label_agreement":null},{"id":"W4383960635","doi":"10.1109/tvt.2023.3294237","title":"Asynchronous Denoise and Forward Two-Way Relay Using ECPM","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Relay; Asynchronous communication; Decoding methods; Computer science; Synchronization (alternating current); Relay channel; Bit error rate; Signal-to-noise ratio (imaging); Ergodic theory; Chaotic; Noise (video); Algorithm; Control theory (sociology); Electronic engineering; Real-time computing; Channel (broadcasting); Mathematics; Telecommunications; Engineering; Artificial intelligence","score_opus":0.01322672300944301,"score_gpt":0.25174717292248333,"score_spread":0.23852044991304033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383960635","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.026696375,0.0004286173,0.968527,0.0001147762,0.000059568796,0.00006129436,0.000043200595,0.00039773382,0.003671452],"genre_scores_gemma":[0.7702701,0.00047085455,0.22554007,0.000086116874,0.000049183163,0.00010017828,0.000059335045,0.000025469015,0.00339867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994968,0.00017139704,0.0000296183,0.000119698605,0.00014030398,0.000042077187],"domain_scores_gemma":[0.9996258,0.00015009106,0.000055084976,0.00007511874,0.00007682485,0.000017057533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005228718,0.00090731616,0.0006796427,0.00040971857,0.00048278095,0.0006763354,0.0007494247,0.00064737175,0.00091789797],"category_scores_gemma":[0.0011918367,0.00018821385,0.00044959626,0.0005107158,0.0005239145,0.0010015058,0.0006965877,0.00052250933,0.0003583116],"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.0008097708,0.00016541292,0.0016096315,0.00043769347,0.00017950882,0.001200109,0.0008485953,0.40792292,0.18458422,0.082794994,0.003003867,0.3164432],"study_design_scores_gemma":[0.000056685356,0.00027707542,0.00024615365,0.000022693988,0.00006579775,0.00073903584,0.000051714986,0.9417296,0.044364117,0.0080699595,0.0043289447,0.00004817136],"about_ca_topic_score_codex":0.0011767257,"about_ca_topic_score_gemma":0.0012890022,"teacher_disagreement_score":0.0011767257,"about_ca_system_score_codex":0.00045449528,"about_ca_system_score_gemma":0.0004360055,"threshold_uncertainty_score":0.003297627},"labels":[],"label_agreement":null},{"id":"W4385198156","doi":"10.1103/physreve.108.014126","title":"Cellular automata can classify data by inducing trajectory phase coexistence","year":2023,"lang":"en","type":"article","venue":"Physical review. E","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Ottawa","funders":"Basic Energy Sciences; Natural Sciences and Engineering Research Council of Canada; Office of Science; U.S. Department of Energy","keywords":"Cellular automaton; Automaton; Computer science; Trajectory; Binary number; Basis (linear algebra); Statistical physics; Population; Stochastic cellular automaton; Algorithm; Nonlinear system; Monte Carlo method; Theoretical computer science; Artificial intelligence; Mathematics; Physics; Statistics; Geometry","score_opus":0.07983699079238436,"score_gpt":0.3849885873329732,"score_spread":0.3051515965405888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385198156","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.2776815,0.00082813203,0.7112079,0.0010343173,0.000120285185,0.000093381714,0.00019999305,0.00058144104,0.008253],"genre_scores_gemma":[0.90374243,0.00036284392,0.09364904,0.00019129159,0.000051186005,0.00011397244,0.00019379673,0.00006532745,0.001630089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995888,0.000098560726,0.000038950733,0.00010830003,0.000110792724,0.00005457568],"domain_scores_gemma":[0.9967751,0.0019423697,0.0004073139,0.00042168066,0.00032349018,0.00013010057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007770894,0.000341331,0.00052333256,0.0013350333,0.0007829249,0.0016009964,0.00056539476,0.0011931998,0.0012929554],"category_scores_gemma":[0.0060483906,0.00029292706,0.0008014441,0.00066953833,0.002191838,0.0022928144,0.000984399,0.0010508697,0.00029856642],"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.00013949552,0.00007362572,0.007182984,0.00022541793,0.000083755236,0.0003027511,0.00053441216,0.30985206,0.037118718,0.5846546,0.0016536469,0.05817851],"study_design_scores_gemma":[0.00002063088,0.000052204912,0.00074893166,0.000028722467,0.000018160214,0.00012562267,0.00007247209,0.686156,0.008412916,0.30103475,0.003299232,0.000030379355],"about_ca_topic_score_codex":0.0015272567,"about_ca_topic_score_gemma":0.0011050076,"teacher_disagreement_score":0.0016009964,"about_ca_system_score_codex":0.00074717554,"about_ca_system_score_gemma":0.0004272753,"threshold_uncertainty_score":0.0054211617},"labels":[],"label_agreement":null},{"id":"W4385413810","doi":"10.1007/978-1-0716-2388-6_531","title":"Symbolic Dynamics","year":2023,"lang":"en","type":"book-chapter","venue":"Encyclopedia of complexity and systems science series","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":"University of British Columbia","funders":"","keywords":"Dynamics (music); Computer science; Sociology","score_opus":0.033959399879224354,"score_gpt":0.24523170587430834,"score_spread":0.21127230599508398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385413810","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.002463546,0.005302203,0.0968425,0.0022780495,0.0008321652,0.00003234844,0.00082634075,0.0008205093,0.8906023],"genre_scores_gemma":[0.18112978,0.010116644,0.044609085,0.0009773272,0.0009453434,0.00020614208,0.0020280983,0.00072274747,0.7592649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998704,0.000023913497,0.0000050723047,0.000027618822,0.00006229995,0.0000105098],"domain_scores_gemma":[0.9998565,0.00003856804,0.000008137651,0.00003675909,0.00004654324,0.000013575323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013557624,0.00057041546,0.00044511273,0.0007684764,0.0005093213,0.00178761,0.00050119555,0.00054939935,0.06653158],"category_scores_gemma":[0.00079413725,0.00020935942,0.0002811433,0.0006614074,0.00095385115,0.0014717004,0.00089233235,0.0010595775,0.02030154],"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.0000056438985,0.00000791977,0.00006400534,0.000056350917,0.000005138495,0.000025951385,0.000076343335,0.0018576086,0.00053944084,0.9077539,0.041668955,0.047938712],"study_design_scores_gemma":[0.000005901121,0.000006505512,0.000114941184,0.00004291198,0.0000039627507,0.00008418882,0.000035287627,0.0052954596,0.0004886932,0.7091237,0.28479165,0.0000069143307],"about_ca_topic_score_codex":0.0013121982,"about_ca_topic_score_gemma":0.0014774132,"teacher_disagreement_score":0.06653158,"about_ca_system_score_codex":0.0008473457,"about_ca_system_score_gemma":0.00062192604,"threshold_uncertainty_score":0.2225703},"labels":[],"label_agreement":null},{"id":"W4385552219","doi":"10.1017/etds.2023.56","title":"Encoding subshifts through sliding block codes","year":2023,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Injective function; Subshift of finite type; Surjective function; Embedding; Mixing (physics); Topological entropy; Generalization; Block (permutation group theory); Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.014910477280342987,"score_gpt":0.2507245799704079,"score_spread":0.23581410269006495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385552219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.659091,0.00023016645,0.33034778,0.00024702676,0.00010768576,0.00005063754,0.00018766012,0.0006118993,0.009126107],"genre_scores_gemma":[0.97683525,0.000079105004,0.020482564,0.00004240858,0.00003425993,0.000034868743,0.00010828026,0.0000426288,0.0023405962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994105,0.00009544447,0.000046126952,0.00013393933,0.00017927337,0.00013470704],"domain_scores_gemma":[0.9986131,0.0005924838,0.00016747639,0.00030804944,0.00018937264,0.00012942524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050616387,0.00030514578,0.00039061095,0.00058562367,0.0004060587,0.00093326496,0.00042336303,0.0004936871,0.0027415245],"category_scores_gemma":[0.0024824394,0.00025451602,0.0002794714,0.00038440034,0.0010381226,0.0016405929,0.0014253597,0.00064362056,0.000463109],"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.000635144,0.000076908116,0.0020184633,0.00010130092,0.000026039012,0.0005039875,0.0006491586,0.05811298,0.08565034,0.79806626,0.0010045782,0.053154908],"study_design_scores_gemma":[0.00006300615,0.00027656558,0.0009242524,0.000042407042,0.000034067412,0.00024399797,0.00027539476,0.42856908,0.07766835,0.48278657,0.0090586515,0.000057677753],"about_ca_topic_score_codex":0.0008867347,"about_ca_topic_score_gemma":0.0008319233,"teacher_disagreement_score":0.0027415245,"about_ca_system_score_codex":0.0006153909,"about_ca_system_score_gemma":0.0004226757,"threshold_uncertainty_score":0.009171307},"labels":[],"label_agreement":null},{"id":"W4387465740","doi":"10.1007/978-3-031-38700-5_10","title":"Applications","year":2023,"lang":"en","type":"book-chapter","venue":"Understanding complex systems","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":"Jamming; Emulation; Probabilistic logic; Simple (philosophy); Statistical physics; Mathematics; Applied mathematics; Computer science; Discrete mathematics; Physics; Statistics; Economics; Condensed matter physics","score_opus":0.16570925021440688,"score_gpt":0.276373339233673,"score_spread":0.11066408901926614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387465740","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.0020840936,0.0028801223,0.02073702,0.002308009,0.0036006372,0.0002224626,0.0021692896,0.0025830918,0.96341527],"genre_scores_gemma":[0.015366411,0.0026665232,0.0121040065,0.002305865,0.0007597032,0.0002092471,0.003627023,0.00070753903,0.9622537],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925405,0.00007794556,0.00002330786,0.00013615862,0.00040359437,0.00010494595],"domain_scores_gemma":[0.99923205,0.000087715474,0.000023169367,0.0001236602,0.00039581754,0.00013755394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067522156,0.0009484663,0.00047877053,0.0013202922,0.0013847096,0.0027320255,0.0015039394,0.0013310056,0.2790916],"category_scores_gemma":[0.0019433072,0.0002329552,0.0005238331,0.0012672987,0.00040311436,0.0014411213,0.0023952127,0.0011778701,0.19042808],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00010585965,0.00009285803,0.000360026,0.00039392785,0.00001189052,0.00018286303,0.0001432098,0.00063231133,0.0044127656,0.04214136,0.6039727,0.34755027],"study_design_scores_gemma":[0.0000060377756,0.000013963877,0.000111317364,0.000044027944,0.0000042614065,0.000094451025,0.00003995168,0.0002588816,0.0010095801,0.0042506433,0.9941619,0.0000049794103],"about_ca_topic_score_codex":0.0018729157,"about_ca_topic_score_gemma":0.0026670003,"teacher_disagreement_score":0.2790916,"about_ca_system_score_codex":0.0007918401,"about_ca_system_score_gemma":0.001315436,"threshold_uncertainty_score":0.9336544},"labels":[],"label_agreement":null},{"id":"W4387465743","doi":"10.1007/978-3-031-38700-5_5","title":"Exploiting Rule Identities ","year":2023,"lang":"en","type":"book-chapter","venue":"Understanding complex systems","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":"Emulation; Generalization; Decomposition; Cellular automaton; Computer science; Product (mathematics); Theoretical computer science; Automaton; Mathematics; Artificial intelligence; Psychology; Social psychology; Chemistry","score_opus":0.2216484556914019,"score_gpt":0.27383873545898535,"score_spread":0.05219027976758345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387465743","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083478885,0.00083752116,0.5825177,0.0013490062,0.00057923567,0.00008484549,0.0003147865,0.0010177047,0.4049513],"genre_scores_gemma":[0.32977116,0.0028848695,0.37971887,0.001102939,0.0005533859,0.00030960268,0.0018291863,0.0013416931,0.28248832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909484,0.00021686715,0.00005435279,0.00022957262,0.0003266303,0.00007788173],"domain_scores_gemma":[0.9988261,0.00050303765,0.000039126226,0.00045575135,0.00014367505,0.000032248812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007744905,0.0007696717,0.0006642754,0.0009512831,0.0012154661,0.003955488,0.0014626649,0.0009634009,0.020663455],"category_scores_gemma":[0.004153344,0.00054607814,0.0009735071,0.00083738397,0.002249758,0.0072658383,0.0027728581,0.00248095,0.010002851],"study_design_candidate":"not_applicable","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.000011611636,0.000019153758,0.00008557145,0.00004244262,0.000008319817,0.00008080121,0.00021552273,0.0014271039,0.00083379366,0.92305017,0.0063710865,0.06785442],"study_design_scores_gemma":[0.0000026935493,0.000005560274,0.000041520307,0.000024053292,0.000008495054,0.00008626722,0.000059895396,0.009763617,0.0013633026,0.94842845,0.0402088,0.000007283021],"about_ca_topic_score_codex":0.0014524707,"about_ca_topic_score_gemma":0.0013442533,"teacher_disagreement_score":0.020663455,"about_ca_system_score_codex":0.0008390705,"about_ca_system_score_gemma":0.0008917774,"threshold_uncertainty_score":0.06912619},"labels":[],"label_agreement":null},{"id":"W4387465871","doi":"10.1007/978-3-031-38700-5_9","title":"Probabilistic Cellular Automata","year":2023,"lang":"en","type":"book-chapter","venue":"Understanding complex systems","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":"Probabilistic logic; Probabilistic automaton; Stochastic cellular automaton; Markov chain; Computer science; Probabilistic CTL; Markov process; Cellular automaton; Quantum finite automata; Mathematics; Theoretical computer science; Automaton; Algorithm; Probabilistic analysis of algorithms; Automata theory; Artificial intelligence; Statistics; Machine learning","score_opus":0.1694986793005417,"score_gpt":0.26284302130906645,"score_spread":0.09334434200852476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387465871","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.0020413366,0.010484708,0.26086035,0.0015551685,0.001504436,0.00005878404,0.0004980402,0.00080024864,0.7221969],"genre_scores_gemma":[0.107331894,0.01769421,0.07295885,0.0010049774,0.0011203102,0.00023567403,0.00093569193,0.0006830857,0.7980354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997781,0.00003525959,0.0000073867595,0.00005187348,0.00011265123,0.000014746414],"domain_scores_gemma":[0.9997744,0.0000916112,0.000009325378,0.00004852579,0.000064145686,0.00001207937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019848168,0.0010104174,0.0006798449,0.0009445817,0.00074454676,0.001988426,0.000804181,0.0010024179,0.031704538],"category_scores_gemma":[0.0011195558,0.0005341883,0.00051499024,0.0012170781,0.0010249956,0.0019293845,0.0010137275,0.0014605819,0.012745609],"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.000006255243,0.000013288094,0.00006512179,0.00011639035,0.000010218188,0.00004201797,0.0000905085,0.009895062,0.0009418497,0.8525109,0.05172847,0.08457991],"study_design_scores_gemma":[0.0000030925846,0.0000092834935,0.00012957201,0.000059104408,0.000009479983,0.00014533964,0.000034820758,0.018476138,0.00089293614,0.58282286,0.39740327,0.000014063533],"about_ca_topic_score_codex":0.0020310509,"about_ca_topic_score_gemma":0.0024514836,"teacher_disagreement_score":0.031704538,"about_ca_system_score_codex":0.0011917533,"about_ca_system_score_gemma":0.00074879365,"threshold_uncertainty_score":0.10606229},"labels":[],"label_agreement":null},{"id":"W4387465949","doi":"10.1007/978-3-031-38700-5","title":"Solvable Cellular Automata","year":2023,"lang":"en","type":"book","venue":"Understanding complex systems","topic":"Cellular Automata and Applications","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":"Brock University","funders":"","keywords":"Cellular automaton; Computer science; Algorithm","score_opus":0.1472341075124248,"score_gpt":0.2676570217044205,"score_spread":0.12042291419199572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387465949","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.005289912,0.004090344,0.099455796,0.001172115,0.001080304,0.000060384722,0.00056255265,0.00065228384,0.8876363],"genre_scores_gemma":[0.10242099,0.00530065,0.03077268,0.0005930881,0.0004881944,0.0001767368,0.001296644,0.0004944086,0.85845655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998443,0.000025567766,0.000006728514,0.000030197529,0.00007523031,0.000018038236],"domain_scores_gemma":[0.9998741,0.000042822372,0.000005734468,0.000029619536,0.000038090533,0.000009592277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121478864,0.000966705,0.00065003824,0.0007378303,0.0008168911,0.0020212065,0.000747063,0.0007589402,0.03761881],"category_scores_gemma":[0.0006883922,0.0003745838,0.00066706905,0.0009013888,0.00079763966,0.0015539171,0.00089845277,0.0012930066,0.012743778],"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.000007691886,0.00001637993,0.00003740296,0.00009826674,0.000008996499,0.000047957838,0.00012352438,0.0056160893,0.0012812098,0.89659965,0.050645266,0.04551759],"study_design_scores_gemma":[0.0000077193445,0.000010214539,0.00006893194,0.0000374119,0.00000782075,0.00008713456,0.00006572208,0.014598752,0.0011066777,0.7395911,0.24440944,0.000009077776],"about_ca_topic_score_codex":0.0024937168,"about_ca_topic_score_gemma":0.0028650884,"teacher_disagreement_score":0.03761881,"about_ca_system_score_codex":0.0012620703,"about_ca_system_score_gemma":0.0007362692,"threshold_uncertainty_score":0.12584746},"labels":[],"label_agreement":null},{"id":"W4387466011","doi":"10.1007/978-3-031-38700-5_12","title":"Beyond Solvable Elementary Rules","year":2023,"lang":"en","type":"book-chapter","venue":"Understanding complex systems","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":"Mathematics; RADIUS; Elementary proof; Chaotic; Pure mathematics; Equicontinuity; Discrete mathematics; Calculus (dental); Computer science; Artificial intelligence","score_opus":0.1285416062151632,"score_gpt":0.2664811707524924,"score_spread":0.1379395645373292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387466011","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.005709298,0.0022235676,0.111825705,0.0022574358,0.00058491394,0.00006388213,0.00021754864,0.00027899694,0.8768387],"genre_scores_gemma":[0.2584339,0.0053843837,0.06887627,0.001610457,0.0007472273,0.00033299645,0.0010913578,0.000802119,0.6627212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995461,0.00011559582,0.000025004261,0.00010143902,0.00016467189,0.00004708085],"domain_scores_gemma":[0.999326,0.000328172,0.000022936012,0.00019710283,0.00009889048,0.000026855581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050790183,0.0007101846,0.00075370865,0.00070341217,0.0012889304,0.0035121895,0.0013557135,0.0011623795,0.027309973],"category_scores_gemma":[0.002732284,0.00050299935,0.00079505536,0.0007814037,0.00367376,0.0067921383,0.0017064599,0.0034682457,0.007224537],"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.0000019270756,0.000005168673,0.00001182124,0.000021881919,0.000002039832,0.000011564814,0.00010221941,0.000409373,0.00008298864,0.98774,0.0044130436,0.0071979356],"study_design_scores_gemma":[0.0000013897775,0.0000014723405,0.0000098785085,0.000013341437,0.000001335495,0.000012603311,0.000024209401,0.0008106308,0.00010604771,0.97108036,0.027936788,0.0000019294725],"about_ca_topic_score_codex":0.0017685461,"about_ca_topic_score_gemma":0.0017141472,"teacher_disagreement_score":0.027309973,"about_ca_system_score_codex":0.0012412363,"about_ca_system_score_gemma":0.0008874544,"threshold_uncertainty_score":0.091360986},"labels":[],"label_agreement":null},{"id":"W4387466018","doi":"10.1007/978-3-031-38700-5_1","title":"Deterministic Cellular Automata ","year":2023,"lang":"en","type":"book-chapter","venue":"Understanding complex systems","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; Computer science; Theoretical computer science; Algorithm","score_opus":0.18582916879164693,"score_gpt":0.27030241166929114,"score_spread":0.08447324287764421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387466018","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.0022526707,0.010048596,0.15466069,0.0012309906,0.0014499173,0.000054459473,0.0004475034,0.0006042403,0.82925093],"genre_scores_gemma":[0.086138725,0.014035647,0.050909515,0.00082566607,0.00060161506,0.0001910495,0.00069661095,0.00044023493,0.84616095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983895,0.000023906725,0.0000064432998,0.000040415634,0.00007576805,0.000014489739],"domain_scores_gemma":[0.9998584,0.000050653824,0.0000057422576,0.000034612745,0.000042842083,0.000007799705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012105148,0.0008988943,0.0005702344,0.00074445026,0.0007283134,0.0016910374,0.0006626829,0.00080874225,0.029360054],"category_scores_gemma":[0.00068427663,0.0004294526,0.00042089063,0.00088120054,0.00093483564,0.0012992059,0.00084106403,0.0011218308,0.012134515],"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.0000066963016,0.000011800287,0.000058353824,0.00012572025,0.000008436631,0.000042610285,0.00010609498,0.007779309,0.001292536,0.85345393,0.051800825,0.085313745],"study_design_scores_gemma":[0.000003764079,0.000010036357,0.00010769878,0.000066538676,0.000008384362,0.00011346212,0.000042561725,0.0120835705,0.0013398493,0.3986232,0.58758837,0.000012429514],"about_ca_topic_score_codex":0.0026193063,"about_ca_topic_score_gemma":0.0034363954,"teacher_disagreement_score":0.029360054,"about_ca_system_score_codex":0.0014595427,"about_ca_system_score_gemma":0.000781785,"threshold_uncertainty_score":0.098219156},"labels":[],"label_agreement":null},{"id":"W4387466025","doi":"10.1007/978-3-031-38700-5_11","title":"Approximate Methods","year":2023,"lang":"en","type":"book-chapter","venue":"Understanding complex systems","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":"Markov chain; Convergence (economics); Mathematics; Probabilistic logic; Extension (predicate logic); Applied mathematics; Entropy (arrow of time); Computer science; Statistics; Physics","score_opus":0.2738703334531478,"score_gpt":0.344142137356076,"score_spread":0.0702718039029282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387466025","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.0020357952,0.0057920706,0.83183247,0.00097461673,0.00110794,0.00006459272,0.00043186118,0.00074765703,0.15701297],"genre_scores_gemma":[0.12803558,0.009138105,0.5177134,0.0014698651,0.0017677804,0.0005442844,0.0022219038,0.002134511,0.33697456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896836,0.0002651326,0.000038687922,0.00015486064,0.00051179883,0.00006105679],"domain_scores_gemma":[0.99900836,0.0003696364,0.000035239802,0.00034343707,0.0002027164,0.000040597213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010273869,0.001168557,0.0013878946,0.0013035721,0.0008716837,0.0023862852,0.0017012731,0.0014030915,0.039841786],"category_scores_gemma":[0.0049922434,0.00061314803,0.0009354415,0.0016224347,0.0012695707,0.0028990859,0.0023945007,0.0026760243,0.013637752],"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.000065697895,0.000050554096,0.00022266661,0.00027574407,0.000048761434,0.00003569028,0.00008634582,0.02280158,0.0011678278,0.6839748,0.05051467,0.2407556],"study_design_scores_gemma":[0.00001950384,0.00003060494,0.00024448428,0.000113510694,0.000030309771,0.00013390131,0.00004536189,0.14414875,0.0016141757,0.6597222,0.19387653,0.000020567868],"about_ca_topic_score_codex":0.0018597391,"about_ca_topic_score_gemma":0.0020857342,"teacher_disagreement_score":0.039841786,"about_ca_system_score_codex":0.0011676897,"about_ca_system_score_gemma":0.0007882201,"threshold_uncertainty_score":0.13328409},"labels":[],"label_agreement":null},{"id":"W4387466187","doi":"10.1007/978-3-031-38700-5_8","title":"Probabilistic Solutions","year":2023,"lang":"en","type":"book-chapter","venue":"Understanding complex systems","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":"Probabilistic logic; Surjective function; Probabilistic automaton; Mathematics; Order (exchange); Discrete mathematics; Statistics","score_opus":0.26969302572219894,"score_gpt":0.27323917959038974,"score_spread":0.0035461538681907934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387466187","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.004742163,0.0013258454,0.403883,0.0055417004,0.0010200021,0.00009147016,0.0004921509,0.00043219185,0.5824715],"genre_scores_gemma":[0.28134844,0.005262197,0.13764867,0.0034682094,0.0022214751,0.0006477574,0.0017196492,0.0008308142,0.56685287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919087,0.0001837919,0.000031077117,0.00019304552,0.0003033747,0.00009788073],"domain_scores_gemma":[0.99909985,0.00037529587,0.00006874646,0.00018231267,0.00020491944,0.00006883588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008401662,0.0010556802,0.00083752524,0.0012425896,0.0013773679,0.0029508616,0.0015151326,0.002426846,0.06451212],"category_scores_gemma":[0.005923663,0.00055672927,0.0010199322,0.0010184951,0.0017630928,0.0038216037,0.0031829705,0.0032527866,0.012787231],"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.000002907948,0.0000065694758,0.000030137824,0.000029219133,0.000004714897,0.000012270284,0.000029932333,0.0020729408,0.00012806784,0.9808775,0.007539031,0.009266651],"study_design_scores_gemma":[0.000003926051,0.0000036018466,0.00003609331,0.00001711672,0.0000037370507,0.000041778192,0.000029902549,0.008744879,0.00013323747,0.96545047,0.025530517,0.0000048343645],"about_ca_topic_score_codex":0.0010801109,"about_ca_topic_score_gemma":0.0009782722,"teacher_disagreement_score":0.06451212,"about_ca_system_score_codex":0.0011675901,"about_ca_system_score_gemma":0.0010516815,"threshold_uncertainty_score":0.21581453},"labels":[],"label_agreement":null},{"id":"W4387466380","doi":"10.1007/978-3-031-38700-5_2","title":"Deterministic Initial Value Problem","year":2023,"lang":"en","type":"book-chapter","venue":"Understanding complex systems","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":"Emulation; Initial value problem; Cellular automaton; Mathematics; Automaton; Representation (politics); Value (mathematics); Polynomial; Computer science; Algorithm; Applied mathematics; Discrete mathematics; Theoretical computer science; Mathematical analysis; Statistics","score_opus":0.193256664192143,"score_gpt":0.29825535514108176,"score_spread":0.10499869094893877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387466380","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.018843293,0.0037525753,0.31648085,0.010016124,0.0011687977,0.00010146496,0.0007733272,0.0002483945,0.6486152],"genre_scores_gemma":[0.4721675,0.0053395974,0.08407236,0.002254591,0.0012998747,0.00047985485,0.0015334908,0.0004994518,0.4323533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957544,0.00011406213,0.000018959698,0.00009763744,0.00014730825,0.00004664136],"domain_scores_gemma":[0.99937135,0.00040490786,0.000027377415,0.000066562054,0.000092042676,0.00003769191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006908104,0.00074140483,0.00087064365,0.00053550943,0.000971261,0.0022575636,0.0013105308,0.0018472967,0.018828904],"category_scores_gemma":[0.003593775,0.00040461743,0.000528247,0.0008570542,0.001856581,0.0032542804,0.0014548309,0.0028982442,0.0026540374],"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.000008615627,0.000009013494,0.00001939685,0.000032932814,0.0000039660104,0.000013811552,0.000027770373,0.0027606683,0.000103789454,0.98401976,0.0061606686,0.0068395524],"study_design_scores_gemma":[0.0000053532744,0.000002301499,0.000021172165,0.000011090602,0.0000018629419,0.00000970497,0.0000104479295,0.0064990055,0.00010822139,0.9855768,0.0077511887,0.000002704321],"about_ca_topic_score_codex":0.00125963,"about_ca_topic_score_gemma":0.0008374227,"teacher_disagreement_score":0.018828904,"about_ca_system_score_codex":0.0019421681,"about_ca_system_score_gemma":0.0012179421,"threshold_uncertainty_score":0.06298894},"labels":[],"label_agreement":null},{"id":"W4388462005","doi":"10.1017/etds.2023.103","title":"Markov capacity for factor codes with an unambiguous symbol","year":2023,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Markov chain; Conjecture; Subshift of finite type; Factor graph; Code (set theory); Type (biology); Property (philosophy); Graph; Combinatorics; Discrete mathematics; Decoding methods; Algorithm; Statistics; Computer science","score_opus":0.014464889077696993,"score_gpt":0.23906993841969879,"score_spread":0.2246050493420018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388462005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75705546,0.00027054874,0.22520508,0.00056694256,0.00008133505,0.00006608307,0.00052928913,0.0003828178,0.015842525],"genre_scores_gemma":[0.99116886,0.00008126358,0.0074605155,0.00004060202,0.00004297234,0.00004658664,0.000113419555,0.000027811362,0.0010179544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868923,0.00023015773,0.00008245768,0.00030007897,0.00029794173,0.00040008788],"domain_scores_gemma":[0.9923314,0.004526957,0.00076342444,0.00071711006,0.0010753234,0.0005856991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011287045,0.0004035804,0.0006889921,0.00086918933,0.0008783022,0.0012708083,0.00055846374,0.00066141307,0.0036151973],"category_scores_gemma":[0.008050811,0.00026721926,0.0004996736,0.00045365834,0.0023856426,0.0023154446,0.0013501825,0.00070040167,0.000328325],"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.00038560582,0.00006742147,0.0015811886,0.00010979336,0.000025782032,0.0003864625,0.00043623953,0.06888496,0.018329425,0.90034425,0.0010420516,0.008406805],"study_design_scores_gemma":[0.00006495113,0.00015334784,0.00078846916,0.000052597476,0.000026002326,0.00026424916,0.00021586423,0.31202045,0.016086115,0.66725117,0.0029766986,0.00010016663],"about_ca_topic_score_codex":0.0024691594,"about_ca_topic_score_gemma":0.0018449023,"teacher_disagreement_score":0.0036151973,"about_ca_system_score_codex":0.0012815759,"about_ca_system_score_gemma":0.0016578434,"threshold_uncertainty_score":0.012094021},"labels":[],"label_agreement":null},{"id":"W4390022937","doi":"10.18280/mmep.100623","title":"A Novel Approach of 1-D Cellular Automata in Cryptosystem","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cryptosystem; Cellular automaton; Computer science; Theoretical computer science; Cryptography; Artificial intelligence; Computer security","score_opus":0.03210953782122241,"score_gpt":0.20723870603219277,"score_spread":0.17512916821097035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390022937","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.02108301,0.0013494027,0.95055014,0.0006337964,0.0002735539,0.00009202613,0.00020189941,0.0003601028,0.02545601],"genre_scores_gemma":[0.7850261,0.002185412,0.19835831,0.00024869727,0.0001372913,0.00028887202,0.0001679557,0.000064977175,0.013522482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995541,0.00012704406,0.000029333796,0.00013519102,0.000103795704,0.000050607894],"domain_scores_gemma":[0.99960834,0.00017110063,0.000041688425,0.00008422202,0.000066729575,0.000027946651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031359162,0.00052258733,0.0005223662,0.00064858276,0.00078645954,0.0015322443,0.0010776238,0.001228807,0.0028018008],"category_scores_gemma":[0.0011738284,0.00031482702,0.00101183,0.00058178155,0.0013390183,0.0011756691,0.0011641613,0.0012081462,0.0007626972],"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.00006357262,0.000031056064,0.0011471765,0.0001878851,0.00003841911,0.0003149463,0.00021082758,0.45086023,0.012761111,0.5043966,0.001426203,0.028561939],"study_design_scores_gemma":[0.000010902294,0.00006962834,0.00022274035,0.000033027613,0.000019854657,0.00023289846,0.000036897814,0.89644915,0.0024013247,0.08923465,0.01126066,0.000028257993],"about_ca_topic_score_codex":0.0034254408,"about_ca_topic_score_gemma":0.0023196605,"teacher_disagreement_score":0.0034254408,"about_ca_system_score_codex":0.0012005606,"about_ca_system_score_gemma":0.0009219873,"threshold_uncertainty_score":0.00937295},"labels":[],"label_agreement":null},{"id":"W4390538460","doi":"10.1007/978-3-031-49226-6","title":"Bernard Shaw, Automata, Robots, and Artificial Intelligence","year":2024,"lang":"en","type":"book","venue":"Bernard Shaw and his contemporaries","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada); University of Toronto","funders":"King's College London; Social Sciences and Humanities Research Council of Canada; University of Cambridge; York University","keywords":"Automaton; Robot; Artificial intelligence; Computer science; Cognitive science; Psychology","score_opus":0.03059536261695837,"score_gpt":0.24672091874499594,"score_spread":0.21612555612803758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390538460","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001930261,0.7005734,0.02020826,0.06540239,0.01242858,0.00003238499,0.00021989766,0.00020991587,0.19899502],"genre_scores_gemma":[0.070267156,0.40328768,0.016231546,0.011834854,0.009467756,0.00012335194,0.0002598911,0.00019876778,0.48832893],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996424,0.00008080855,0.000017592543,0.00007174893,0.00016803075,0.000019443554],"domain_scores_gemma":[0.9993569,0.00040450043,0.00002515023,0.00002187836,0.00014536685,0.000046274105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005993679,0.0008844964,0.00073713344,0.0013778015,0.0014122758,0.0025734752,0.00063409767,0.0018379767,0.0070047206],"category_scores_gemma":[0.002240494,0.0005782854,0.0002376448,0.0018311389,0.0028512,0.00411284,0.00079053466,0.0027937933,0.003948663],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000043413806,0.000026381873,0.00020078724,0.000259701,0.000009645878,0.000057353624,0.00039906474,0.0013523998,0.0003400805,0.43438122,0.48231936,0.0806106],"study_design_scores_gemma":[0.00000908624,0.000009666121,0.00012843915,0.00013804724,0.000004201589,0.000117847776,0.00014687768,0.0009386639,0.00023616166,0.21645077,0.7818073,0.00001291877],"about_ca_topic_score_codex":0.007429533,"about_ca_topic_score_gemma":0.00995873,"teacher_disagreement_score":0.007429533,"about_ca_system_score_codex":0.0016247836,"about_ca_system_score_gemma":0.0011600787,"threshold_uncertainty_score":0.02343309},"labels":[],"label_agreement":null},{"id":"W4390668661","doi":"10.1515/spma-2023-0107","title":"Refined inertias of positive and hollow positive patterns","year":2024,"lang":"en","type":"article","venue":"Special Matrices","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Physics; Mathematics; Crystallography; Chemistry","score_opus":0.006289512490943663,"score_gpt":0.23359241545729714,"score_spread":0.22730290296635347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390668661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47528565,0.0005318965,0.43920198,0.0007784178,0.00037433658,0.00023726665,0.00078100996,0.0013581481,0.08145134],"genre_scores_gemma":[0.92719656,0.00019383273,0.052203245,0.00031987924,0.00024182879,0.00013870037,0.00082624983,0.0004133452,0.018466312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700385,0.0003594329,0.00023710799,0.00072902744,0.0009889285,0.0006815623],"domain_scores_gemma":[0.99249494,0.0020957852,0.0012143294,0.0016297991,0.0016014418,0.00096374075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014642321,0.0008827611,0.00081593095,0.0022487585,0.0015281484,0.002940076,0.0012640643,0.0010598212,0.015410952],"category_scores_gemma":[0.011037088,0.00081168837,0.0016490472,0.0011393364,0.004102512,0.0051189596,0.0029417565,0.002002708,0.0019323585],"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.00034278943,0.00009082985,0.004030407,0.0002051927,0.000057078665,0.0008679292,0.0011819111,0.004560444,0.013524392,0.94299805,0.004097761,0.02804316],"study_design_scores_gemma":[0.00009891156,0.0002032363,0.005517888,0.00012066481,0.00008469895,0.001153012,0.00083090604,0.04458876,0.008523213,0.9202285,0.018540593,0.0001094804],"about_ca_topic_score_codex":0.0022517487,"about_ca_topic_score_gemma":0.0015391199,"teacher_disagreement_score":0.015410952,"about_ca_system_score_codex":0.001085085,"about_ca_system_score_gemma":0.00062603067,"threshold_uncertainty_score":0.0515548},"labels":[],"label_agreement":null},{"id":"W4391528179","doi":"10.1109/jsait.2023.3338326","title":"Dimensions of Channel Coding: From Theory to Algorithms to Applications","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; University of California, San Diego; University of Illinois at Urbana-Champaign; Centre National de la Recherche Scientifique; Nanyang Technological University; National University of Singapore","keywords":"Algorithm; Computer science; Coding (social sciences); Channel (broadcasting); Coding theory; Theoretical computer science; Mathematics; Telecommunications; Statistics","score_opus":0.013560731427355685,"score_gpt":0.2555760877282448,"score_spread":0.2420153563008891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391528179","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.018416913,0.16524792,0.65441847,0.047198717,0.01287095,0.00012863049,0.00095106364,0.0005009901,0.10026638],"genre_scores_gemma":[0.5426667,0.2131823,0.16744547,0.008116232,0.038050406,0.0006904978,0.0010066833,0.0006682859,0.028173383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981158,0.0007012531,0.00010716574,0.00025418302,0.000675173,0.00014648518],"domain_scores_gemma":[0.9932586,0.004634763,0.00031038927,0.00067208154,0.0007922085,0.00033197808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013084942,0.0009157211,0.0012488122,0.0019480212,0.0009021819,0.006045344,0.0011194076,0.0012595268,0.0055321604],"category_scores_gemma":[0.00896313,0.00061362685,0.00071482395,0.0028724927,0.0051926607,0.008369745,0.002913853,0.0061105452,0.0009860661],"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.00002437246,0.000011702827,0.0002389808,0.00013954299,0.000019419786,0.0000248919,0.00010326059,0.004827594,0.00022483424,0.94682467,0.01824797,0.029312694],"study_design_scores_gemma":[0.000007049447,0.000018206418,0.00014521327,0.00009352509,0.0000065133777,0.000068033805,0.000051812454,0.01454679,0.00014652732,0.945929,0.038969208,0.000018219915],"about_ca_topic_score_codex":0.0009802898,"about_ca_topic_score_gemma":0.0005427025,"teacher_disagreement_score":0.006045344,"about_ca_system_score_codex":0.0024420342,"about_ca_system_score_gemma":0.0015489241,"threshold_uncertainty_score":0.018506944},"labels":[],"label_agreement":null},{"id":"W4391848326","doi":"10.1016/j.laa.2024.02.011","title":"On linear non-uniform cellular automata: Duality and dynamics","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Cellular automaton; Dynamics (music); Duality (order theory); Pure mathematics; Algorithm","score_opus":0.009659591907423656,"score_gpt":0.2535639686087036,"score_spread":0.24390437670127996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391848326","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.06332513,0.005556298,0.88119274,0.0020987806,0.00062001863,0.00004950128,0.00027574808,0.00018169919,0.046700142],"genre_scores_gemma":[0.8877087,0.0053769127,0.07775366,0.0008682598,0.0010025321,0.00023790775,0.0004009572,0.00018507436,0.026465913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876475,0.0005004693,0.000080348094,0.00030937287,0.00018232872,0.00016276877],"domain_scores_gemma":[0.99568176,0.0027249537,0.00043179118,0.0003432411,0.00055489555,0.00026338024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016183747,0.001075658,0.0014516189,0.0017382056,0.0016366224,0.003910232,0.001505193,0.0018670957,0.0052605504],"category_scores_gemma":[0.007209583,0.0006905523,0.0015372934,0.002552818,0.0046884464,0.0065549957,0.0027126793,0.0029228565,0.0006679161],"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.000011198995,0.0000108570775,0.00006482436,0.000026357286,0.0000046655064,0.000017797636,0.000089024,0.0055706766,0.00027558906,0.99148613,0.00031667695,0.0021261212],"study_design_scores_gemma":[0.0000051556644,0.000014306643,0.000061874016,0.00001494702,0.00000523331,0.000026642869,0.00004208912,0.041910585,0.00018139661,0.95638096,0.0013459845,0.000010779383],"about_ca_topic_score_codex":0.0024101692,"about_ca_topic_score_gemma":0.0018274428,"teacher_disagreement_score":0.0052605504,"about_ca_system_score_codex":0.002674598,"about_ca_system_score_gemma":0.0012676085,"threshold_uncertainty_score":0.019405603},"labels":[],"label_agreement":null},{"id":"W4392188705","doi":"10.36227/techrxiv.21779510.v4","title":"The Cyber Centre and Related Technologies — An Analysis","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"Government of Canada; Innovation, Science and Economic Development Canada","keywords":"Computer science; Business","score_opus":0.007806679205728781,"score_gpt":0.23929269510790532,"score_spread":0.23148601590217655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392188705","genre_codex":"other","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.060500674,0.013168413,0.017159969,0.004865564,0.00019240788,0.000092146955,0.00040322347,0.00006558909,0.9035522],"genre_scores_gemma":[0.83726573,0.016021179,0.0072892797,0.0007583523,0.00022255482,0.00009540185,0.00035490672,0.000084066916,0.13790858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995054,0.000079569494,0.000010838869,0.00006300543,0.00018522139,0.00015590215],"domain_scores_gemma":[0.99953246,0.0001274098,0.00003895965,0.000040523526,0.00016732249,0.000093331175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028786997,0.00040031367,0.00028755973,0.0038660876,0.0018828148,0.005724813,0.00069395424,0.001060805,0.023850897],"category_scores_gemma":[0.0009925611,0.00016471546,0.0005969546,0.0040042773,0.0035683927,0.003842697,0.0022033143,0.0012875691,0.0021839412],"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.000009029583,0.000012952995,0.0008976746,0.000048131587,0.0000037756352,0.00009588857,0.00033901754,0.0009006489,0.00012445584,0.9846029,0.0031473353,0.009818217],"study_design_scores_gemma":[0.000016124766,0.00006151305,0.014820535,0.00034493455,0.00003243028,0.0005979738,0.004286145,0.013424287,0.0009796824,0.5291164,0.43628642,0.000033631393],"about_ca_topic_score_codex":0.072433636,"about_ca_topic_score_gemma":0.056723427,"teacher_disagreement_score":0.072433636,"about_ca_system_score_codex":0.0081494395,"about_ca_system_score_gemma":0.0040566702,"threshold_uncertainty_score":0.14402407},"labels":[],"label_agreement":null},{"id":"W4393141209","doi":"10.1109/icnf57520.2023.10472767","title":"Probability Currents in Out-of-Equilibrium Microwave Circuits","year":2023,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Canada First Research Excellence Fund; Canada Foundation for Innovation","keywords":"Microwave; Electronic circuit; Electrical engineering; Electronic engineering; Computer science; Physics; Telecommunications; Engineering","score_opus":0.06358478042669445,"score_gpt":0.2845731566336897,"score_spread":0.22098837620699524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393141209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7779794,0.00014572011,0.21911609,0.000079424324,0.000022218,0.000018259687,0.00008023152,0.00027740616,0.002281152],"genre_scores_gemma":[0.99224675,0.000044156404,0.0069784643,0.000011091188,0.000007725143,0.000013221112,0.000046556957,0.00003162404,0.00062037446],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997855,0.00005023536,0.000008106903,0.00005048183,0.00006510481,0.000040625386],"domain_scores_gemma":[0.99930775,0.00031286504,0.00012262352,0.00008920259,0.0001113994,0.00005622376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033362434,0.00022965774,0.00028804896,0.0006735583,0.0002834728,0.00083119154,0.00063831115,0.00023958726,0.001308572],"category_scores_gemma":[0.0027233518,0.0001936355,0.00018499029,0.00033470304,0.0008836165,0.0012278417,0.00040878516,0.0005238139,0.00017980688],"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.0008396264,0.00024755285,0.012922258,0.00018399216,0.00007943004,0.00077014253,0.0007514583,0.20981021,0.43689474,0.28689927,0.0006364426,0.04996482],"study_design_scores_gemma":[0.00002081893,0.0001454421,0.005419817,0.000009891166,0.000017261475,0.00022791137,0.00008477893,0.8680366,0.069596104,0.055087402,0.001320377,0.00003344237],"about_ca_topic_score_codex":0.00050344976,"about_ca_topic_score_gemma":0.0003542754,"teacher_disagreement_score":0.001308572,"about_ca_system_score_codex":0.00045739484,"about_ca_system_score_gemma":0.0002177532,"threshold_uncertainty_score":0.004377544},"labels":[],"label_agreement":null},{"id":"W4393179152","doi":"10.1017/9781009283403.015","title":"Sequence Sets with Low Correlation","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Sequence (biology); Correlation; Content (measure theory); Information retrieval; Computer science; Mathematics; Chemistry; Geometry","score_opus":0.01776070440184666,"score_gpt":0.19815286162396964,"score_spread":0.18039215722212298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393179152","genre_codex":"other","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.014634289,0.017696964,0.43834978,0.005259651,0.0032626756,0.00021439586,0.011202835,0.003916122,0.5054633],"genre_scores_gemma":[0.18041787,0.019526256,0.1813572,0.0028197658,0.0038130423,0.0006182592,0.03350794,0.0022433063,0.5756963],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937785,0.000086768334,0.000044248893,0.00013069107,0.00032694417,0.000033573047],"domain_scores_gemma":[0.9983047,0.0009128058,0.00005059962,0.00025117103,0.0004218793,0.00005886701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050127844,0.0007409182,0.0008766522,0.0020859672,0.0005690532,0.0016241921,0.00073104555,0.00056638423,0.08253215],"category_scores_gemma":[0.0034314787,0.00034816834,0.000429347,0.0025001466,0.0006264986,0.0021746515,0.00082920276,0.0010957625,0.031096788],"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.000096144766,0.000033829034,0.00029055943,0.001094236,0.000026231102,0.00031020876,0.00019502589,0.011638695,0.004850023,0.3063793,0.2277228,0.44736302],"study_design_scores_gemma":[0.0000135216615,0.00008953981,0.0011286659,0.00030803317,0.000026031192,0.0009413184,0.000080947415,0.026255395,0.0052615004,0.40285045,0.5629945,0.00005014381],"about_ca_topic_score_codex":0.00077435205,"about_ca_topic_score_gemma":0.001069191,"teacher_disagreement_score":0.08253215,"about_ca_system_score_codex":0.000874189,"about_ca_system_score_gemma":0.00058675115,"threshold_uncertainty_score":0.27609754},"labels":[],"label_agreement":null},{"id":"W4393179319","doi":"10.1017/9781009283403.012","title":"Expander Codes","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Content (measure theory); Mathematics","score_opus":0.021313095408757234,"score_gpt":0.2032906118864483,"score_spread":0.1819775164776911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393179319","genre_codex":"other","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.00109033,0.0029523522,0.033489402,0.0023726663,0.004073442,0.00046514216,0.019495526,0.00797955,0.92808163],"genre_scores_gemma":[0.0072418684,0.0029398527,0.013324516,0.0010035342,0.000884667,0.00036541096,0.015752263,0.004001676,0.9544861],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992798,0.00007708311,0.00003795772,0.000092338516,0.00043169764,0.00008104074],"domain_scores_gemma":[0.9984864,0.00032452866,0.00004392378,0.00027068538,0.00077729305,0.000097189564],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006182536,0.0010088297,0.00094975624,0.0030961935,0.00079042313,0.0022415973,0.0017601942,0.0010396641,0.6550667],"category_scores_gemma":[0.0037943586,0.0004270322,0.0006609071,0.002870674,0.0005387312,0.0030563415,0.001639226,0.001648079,0.48214015],"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.000059922077,0.000025791196,0.000050008224,0.00033038147,0.0000036547758,0.00009399444,0.000057041125,0.0005104537,0.00091796543,0.043270025,0.81307966,0.14160112],"study_design_scores_gemma":[0.000007436629,0.000012043266,0.00008554869,0.000080233454,0.0000025921838,0.00012284811,0.000019697898,0.00028140654,0.0006067424,0.011382373,0.9873893,0.00000974598],"about_ca_topic_score_codex":0.0021008842,"about_ca_topic_score_gemma":0.0025204206,"teacher_disagreement_score":0.6550667,"about_ca_system_score_codex":0.0012253223,"about_ca_system_score_gemma":0.0010157746,"threshold_uncertainty_score":0.4920054},"labels":[],"label_agreement":null},{"id":"W4393179509","doi":"10.1017/9781009283403.011","title":"Batch Codes","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Content (measure theory); Database; Information retrieval; Mathematics","score_opus":0.01851371529835912,"score_gpt":0.19786790235068558,"score_spread":0.17935418705232645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393179509","genre_codex":"other","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.0044594957,0.0043385006,0.343853,0.0035735345,0.003760848,0.0010961761,0.047220584,0.024239695,0.56745815],"genre_scores_gemma":[0.060257934,0.0050213546,0.113618046,0.0015366934,0.0017944643,0.0011496894,0.060836736,0.009105909,0.74667925],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988199,0.00014830995,0.00007668865,0.00021505667,0.00059887074,0.00014118389],"domain_scores_gemma":[0.99742365,0.00053596165,0.00008441708,0.00068835774,0.0010993103,0.00016829956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009621625,0.0010895998,0.00093848567,0.0015441586,0.00077140535,0.002344826,0.0017397295,0.00082567835,0.2964891],"category_scores_gemma":[0.0051588276,0.00045616867,0.0006808372,0.00182706,0.00055065175,0.0024916346,0.0015030411,0.0014846475,0.20481804],"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.00029941095,0.000049901108,0.00022959412,0.00046769754,0.000019270414,0.00008914552,0.000053582455,0.008438285,0.0028671774,0.12634355,0.5890677,0.27207467],"study_design_scores_gemma":[0.00005896948,0.00011111683,0.000427233,0.00016834655,0.000019908874,0.00019487631,0.000033678814,0.015228612,0.006474237,0.104072176,0.8731524,0.000058311598],"about_ca_topic_score_codex":0.0038164624,"about_ca_topic_score_gemma":0.0042903647,"teacher_disagreement_score":0.2964891,"about_ca_system_score_codex":0.0016295206,"about_ca_system_score_gemma":0.001992723,"threshold_uncertainty_score":0.9918548},"labels":[],"label_agreement":null},{"id":"W4394207126","doi":"10.6084/m9.figshare.14468196.v2","title":"Tabula Microcebus","year":2021,"lang":"en","type":"dataset","venue":"Figshare","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Geography","score_opus":0.02415077997799225,"score_gpt":0.25027688218120653,"score_spread":0.22612610220321427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394207126","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024958522,0.00009514155,0.00040654727,0.00008489142,0.000028995953,0.000022753717,0.99427396,0.004060037,0.00077809725],"genre_scores_gemma":[0.0006882545,0.00010270558,0.0010806177,0.000074678006,0.0000070460014,0.00020061617,0.99659,0.00068598293,0.0005701035],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909675,0.00016247589,0.00008333867,0.00032631523,0.0001936899,0.00013749322],"domain_scores_gemma":[0.99823546,0.0005759346,0.00016687142,0.00058970775,0.0002668111,0.00016523761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001443813,0.0022909248,0.0016798226,0.0044858074,0.0011577597,0.0024586678,0.0038076218,0.0014212676,0.09040925],"category_scores_gemma":[0.0061440635,0.001125319,0.0014515733,0.0065892194,0.0005807038,0.0017515837,0.0023239153,0.0021217533,0.13044804],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00023161463,0.000026702939,0.0008935954,0.0011789836,0.000052169406,0.00004103823,0.000058966696,0.00055710017,0.0009199284,0.0016216825,0.98812264,0.0062955455],"study_design_scores_gemma":[0.00024049851,0.000025401427,0.0033032855,0.0002801114,0.000046023466,0.000091131595,0.000038217142,0.00094964606,0.0017077547,0.0038364378,0.9894394,0.000042024825],"about_ca_topic_score_codex":0.014878269,"about_ca_topic_score_gemma":0.015994791,"teacher_disagreement_score":0.09040925,"about_ca_system_score_codex":0.0014038995,"about_ca_system_score_gemma":0.0025679094,"threshold_uncertainty_score":0.30244905},"labels":[],"label_agreement":null},{"id":"W4394238005","doi":"10.6084/m9.figshare.14468196.v3","title":"Tabula Microcebus","year":2021,"lang":"en","type":"dataset","venue":"Figshare","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Environmental science","score_opus":0.02415077997799225,"score_gpt":0.25027688218120653,"score_spread":0.22612610220321427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394238005","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024958522,0.00009514155,0.00040654727,0.00008489142,0.000028995953,0.000022753717,0.99427396,0.004060037,0.00077809725],"genre_scores_gemma":[0.0006882545,0.00010270558,0.0010806177,0.000074678006,0.0000070460014,0.00020061617,0.99659,0.00068598293,0.0005701035],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909675,0.00016247589,0.00008333867,0.00032631523,0.0001936899,0.00013749322],"domain_scores_gemma":[0.99823546,0.0005759346,0.00016687142,0.00058970775,0.0002668111,0.00016523761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001443813,0.0022909248,0.0016798226,0.0044858074,0.0011577597,0.0024586678,0.0038076218,0.0014212676,0.09040925],"category_scores_gemma":[0.0061440635,0.001125319,0.0014515733,0.0065892194,0.0005807038,0.0017515837,0.0023239153,0.0021217533,0.13044804],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00023161463,0.000026702939,0.0008935954,0.0011789836,0.000052169406,0.00004103823,0.000058966696,0.00055710017,0.0009199284,0.0016216825,0.98812264,0.0062955455],"study_design_scores_gemma":[0.00024049851,0.000025401427,0.0033032855,0.0002801114,0.000046023466,0.000091131595,0.000038217142,0.00094964606,0.0017077547,0.0038364378,0.9894394,0.000042024825],"about_ca_topic_score_codex":0.014878269,"about_ca_topic_score_gemma":0.015994791,"teacher_disagreement_score":0.09040925,"about_ca_system_score_codex":0.0014038995,"about_ca_system_score_gemma":0.0025679094,"threshold_uncertainty_score":0.30244905},"labels":[],"label_agreement":null},{"id":"W4396530773","doi":"10.1088/1361-6544/ad3ffa","title":"On the Garden of Eden theorem for non-uniform cellular automata","year":2024,"lang":"en","type":"article","venue":"Nonlinearity","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Mathematics; Cellular automaton; Garden of Eden; Automaton; Discrete mathematics; Pure mathematics; Theoretical computer science; Algorithm; Computer science","score_opus":0.0192433316505791,"score_gpt":0.26997318126457437,"score_spread":0.25072984961399525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396530773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5916472,0.0012397813,0.32950684,0.0009093785,0.0001717379,0.00008863837,0.00036607592,0.00042861144,0.075641796],"genre_scores_gemma":[0.98018277,0.00032479854,0.01386492,0.00010984121,0.00006588333,0.00006205609,0.000086696375,0.000037403537,0.0052656373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992835,0.0001396712,0.000045061377,0.00019693193,0.00018750576,0.00014737243],"domain_scores_gemma":[0.9953282,0.003067967,0.00033411072,0.0005897812,0.00040061487,0.00027937753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015097766,0.0002896749,0.0007683215,0.0010436524,0.000877304,0.0015721807,0.00078835717,0.00055800984,0.005681412],"category_scores_gemma":[0.004331584,0.0002552122,0.0008294122,0.00053215143,0.0030363437,0.004544783,0.0024381345,0.0014544852,0.00031523098],"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.00006590015,0.000017225053,0.00077510154,0.00007104911,0.000008214036,0.000106935295,0.00017638688,0.006614581,0.003199838,0.9827565,0.00035884173,0.0058494788],"study_design_scores_gemma":[0.000022507835,0.000068931135,0.0009936478,0.000025216523,0.000015132648,0.00023092882,0.00017596057,0.053481773,0.0055140518,0.9353507,0.0040955744,0.000025551291],"about_ca_topic_score_codex":0.0011660574,"about_ca_topic_score_gemma":0.0009742257,"teacher_disagreement_score":0.005681412,"about_ca_system_score_codex":0.0011977815,"about_ca_system_score_gemma":0.00045097672,"threshold_uncertainty_score":0.019006252},"labels":[],"label_agreement":null},{"id":"W4396571137","doi":"10.1007/978-981-97-2340-9_12","title":"Source-Oblivious Broadcast","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Computer science","score_opus":0.012301778475517689,"score_gpt":0.23433099984004296,"score_spread":0.22202922136452527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396571137","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0225395,0.0015466135,0.6185069,0.002707979,0.00060459727,0.0002072682,0.0015449654,0.0045389296,0.3478033],"genre_scores_gemma":[0.5686543,0.00279418,0.07452094,0.0010606968,0.0005646991,0.00048462488,0.0017523526,0.0018820477,0.34828618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934024,0.00011479867,0.00002434945,0.00009906671,0.0002931677,0.00012843398],"domain_scores_gemma":[0.9986731,0.00061679294,0.000049744736,0.00049429195,0.00012749562,0.000038558635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049761246,0.00066249695,0.00076621247,0.0007480825,0.0008148615,0.0015619186,0.0009963608,0.0008333002,0.016501218],"category_scores_gemma":[0.0020746782,0.0005998159,0.00046438279,0.0013473756,0.0012510236,0.0030627977,0.001935916,0.002257714,0.005402571],"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.00022053365,0.00006395733,0.000081762046,0.0003131399,0.000026059652,0.00006023836,0.0002529931,0.01790079,0.0062273587,0.8504375,0.03757128,0.08684429],"study_design_scores_gemma":[0.000056625297,0.000035174842,0.00011026392,0.00006647511,0.000028141647,0.00015256437,0.00003545309,0.04999336,0.009565021,0.8861639,0.053773224,0.000019841233],"about_ca_topic_score_codex":0.0005867497,"about_ca_topic_score_gemma":0.00069538853,"teacher_disagreement_score":0.016501218,"about_ca_system_score_codex":0.0015265399,"about_ca_system_score_gemma":0.0010917548,"threshold_uncertainty_score":0.055202067},"labels":[],"label_agreement":null},{"id":"W4400451275","doi":"10.1016/j.physd.2024.134278","title":"Modular construction of Boolean networks","year":2024,"lang":"en","type":"article","venue":"Physica D Nonlinear Phenomena","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defense Advanced Research Projects Agency; Banff International Research Station for Mathematical Innovation and Discovery; Advanced Research Projects Agency; National Institutes of Health; University of California Institute for Mexico and the United States; American Association of Immunologists; Simons Foundation","keywords":"Modular design; Mathematics; Computer science; Algebra over a field; Theoretical computer science; Arithmetic; Discrete mathematics; Pure mathematics; Programming language","score_opus":0.008107113023557952,"score_gpt":0.22691917161280298,"score_spread":0.21881205858924502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400451275","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.39937028,0.00059871917,0.47615823,0.0012780412,0.00024704277,0.00011027173,0.0002958108,0.00067500625,0.12126671],"genre_scores_gemma":[0.94021744,0.00031083485,0.04512035,0.00021777452,0.00014748084,0.000115197814,0.00020909384,0.00012713534,0.013534681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967575,0.000097315635,0.000013988742,0.00006686907,0.00008312234,0.00006294631],"domain_scores_gemma":[0.99926156,0.0003032625,0.00010675812,0.000111762645,0.00009752462,0.00011913148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043430476,0.00037589378,0.00039078042,0.0010822337,0.00053622294,0.0011086382,0.00055207516,0.0005260487,0.0054154536],"category_scores_gemma":[0.0016933478,0.00032066612,0.00066270214,0.00038934228,0.00086684333,0.0011629154,0.0013500886,0.0008944963,0.00060192513],"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.000026321053,0.000017154933,0.00015046273,0.000029120361,0.000007288698,0.000048673202,0.00006064044,0.0034041745,0.0045163836,0.9821613,0.00072269334,0.008855727],"study_design_scores_gemma":[0.000022024566,0.000028661936,0.00031252435,0.0000167069,0.00001395766,0.0000894044,0.000027713866,0.04683269,0.0036418424,0.94539636,0.0036069856,0.000011196347],"about_ca_topic_score_codex":0.0002399544,"about_ca_topic_score_gemma":0.0004184206,"teacher_disagreement_score":0.0054154536,"about_ca_system_score_codex":0.0006629374,"about_ca_system_score_gemma":0.00027302757,"threshold_uncertainty_score":0.018116474},"labels":[],"label_agreement":null},{"id":"W4400596849","doi":"10.55016/ojs/cdm.v15i2.62866","title":"A new mathematical model for tiling finite regions of the plane with polyominoes","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Underdetermined system; MATLAB; Mathematics; Polyomino; Backtracking; Binary number; Linear programming; Computer science; Algorithm; Combinatorics; Discrete mathematics; Geometry","score_opus":0.026359110865044805,"score_gpt":0.2696174514845941,"score_spread":0.2432583406195493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596849","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.010420261,0.00065979693,0.96980596,0.0013218609,0.00029714964,0.000064195185,0.0003098339,0.00015556831,0.0169654],"genre_scores_gemma":[0.3484024,0.0023287055,0.57753986,0.0013069669,0.0007071497,0.0011692125,0.00093625707,0.0005320028,0.06707736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941814,0.0001278175,0.00003333435,0.00015133752,0.00020219799,0.00006712706],"domain_scores_gemma":[0.9993703,0.00027793497,0.00011551201,0.00008373175,0.00008750243,0.00006506238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007111304,0.0007102766,0.0009720581,0.00095832336,0.00087269803,0.0018652341,0.0018355926,0.0017637074,0.009152806],"category_scores_gemma":[0.0020752698,0.00062733155,0.0015943896,0.0010678748,0.002551393,0.0027918746,0.0017195825,0.0020953044,0.0015953827],"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.00001932237,0.000021840473,0.00026877914,0.0001332561,0.000011051949,0.000121946214,0.00013084966,0.26163706,0.002644398,0.7235274,0.004561095,0.0069230692],"study_design_scores_gemma":[0.000016679116,0.00003197189,0.000117477815,0.000035214856,0.00000903806,0.00014126733,0.000048714595,0.6824373,0.00083322974,0.29907805,0.017226078,0.000025019035],"about_ca_topic_score_codex":0.0030916475,"about_ca_topic_score_gemma":0.0036614619,"teacher_disagreement_score":0.009152806,"about_ca_system_score_codex":0.001718122,"about_ca_system_score_gemma":0.0010501401,"threshold_uncertainty_score":0.030619144},"labels":[],"label_agreement":null},{"id":"W4401198955","doi":"10.1142/s1793830924500708","title":"LCD codes over finite fields","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Finite field; Mathematics; Liquid-crystal display; Discrete mathematics; Combinatorics; Computer science; Operating system","score_opus":0.012987680429652744,"score_gpt":0.2692800756832095,"score_spread":0.25629239525355674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401198955","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.37816232,0.002264739,0.54866576,0.0012932195,0.00031266513,0.00015781172,0.0005559334,0.00091420993,0.067673326],"genre_scores_gemma":[0.91663486,0.0008837947,0.07273462,0.00030414536,0.00016958777,0.0001333014,0.00029118868,0.0000899854,0.008758392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932265,0.000111883266,0.000043085343,0.00014486919,0.00025039178,0.00012703087],"domain_scores_gemma":[0.99830914,0.00057764445,0.0002230282,0.000458633,0.00029441633,0.00013709388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038428913,0.00032629515,0.00034533237,0.0011062109,0.00082709815,0.00093397393,0.0004746228,0.0005515211,0.0033238083],"category_scores_gemma":[0.0025729856,0.00020243725,0.00035610117,0.001039477,0.0014258159,0.001267554,0.0015766646,0.0010397547,0.0006666092],"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.00009024884,0.000029081426,0.0009805406,0.0001469893,0.000011171404,0.0002600871,0.00031510906,0.008569929,0.01336979,0.93055964,0.0013489006,0.04431843],"study_design_scores_gemma":[0.00004931804,0.000086463464,0.0006955692,0.00009697505,0.000019965875,0.0012856581,0.00015213194,0.0793724,0.025292207,0.8599499,0.032944784,0.00005473789],"about_ca_topic_score_codex":0.0006704221,"about_ca_topic_score_gemma":0.000596573,"teacher_disagreement_score":0.0033238083,"about_ca_system_score_codex":0.0011703616,"about_ca_system_score_gemma":0.00081990595,"threshold_uncertainty_score":0.011119306},"labels":[],"label_agreement":null},{"id":"W4401559557","doi":"10.1088/1361-6528/ad6f18","title":"Improved time complexity for spintronic oscillator ising machines compared to a popular classical optimization algorithm for the Max-Cut problem","year":2024,"lang":"en","type":"article","venue":"Nanotechnology","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Science and Engineering Research Board","keywords":"Spintronics; Ising model; Time complexity; Algorithm; Maximum cut; Combinatorial optimization; Computational complexity theory; Graph; Bottleneck; Random graph; Computer science; Mathematics; Discrete mathematics; Statistical physics; Physics; Quantum mechanics","score_opus":0.0185477878557703,"score_gpt":0.27343284749873403,"score_spread":0.2548850596429637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401559557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52214026,0.0012012155,0.42250466,0.0035714877,0.00034420277,0.00025614933,0.0009121062,0.004969759,0.04410021],"genre_scores_gemma":[0.8145678,0.00018703002,0.17803654,0.00027744297,0.000056414625,0.00020029316,0.00085468555,0.00038792752,0.0054319324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990995,0.00028110953,0.00003821356,0.00022724902,0.00018887746,0.00016501387],"domain_scores_gemma":[0.9959616,0.002937816,0.00019434553,0.00041622136,0.00030070124,0.0001892728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010921733,0.00066864246,0.0005983143,0.00051395845,0.0006384903,0.0016384785,0.0014100765,0.0012251461,0.010709629],"category_scores_gemma":[0.0053053163,0.00029018297,0.00065899413,0.0007746654,0.00063255726,0.0019979768,0.00075479713,0.0012557158,0.0007187849],"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.0016732661,0.0005420526,0.003431026,0.00066132296,0.00011562923,0.00022721599,0.00020328583,0.69310063,0.019351764,0.1292576,0.019249437,0.13218683],"study_design_scores_gemma":[0.000050243758,0.00003994219,0.00020968387,0.00000781104,0.000009518114,0.000028177234,0.0000168112,0.9808914,0.0020085587,0.016166534,0.0005664778,0.00000483104],"about_ca_topic_score_codex":0.0023662613,"about_ca_topic_score_gemma":0.0033100196,"teacher_disagreement_score":0.010709629,"about_ca_system_score_codex":0.0015663861,"about_ca_system_score_gemma":0.0020059815,"threshold_uncertainty_score":0.03582734},"labels":[],"label_agreement":null},{"id":"W4401693126","doi":"10.1109/isit57864.2024.10619492","title":"Repairing Schemes for Tamo-Barg Codes","year":2024,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Key Research and Development Program of China","keywords":"Computer science","score_opus":0.016725974169198115,"score_gpt":0.28143883085632954,"score_spread":0.2647128566871314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401693126","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.2202919,0.0011265232,0.7691507,0.00063787965,0.00008573868,0.00008605382,0.0002158741,0.00058935874,0.007816102],"genre_scores_gemma":[0.93216014,0.000454828,0.063162975,0.000116377065,0.000036381607,0.00013652923,0.000121304176,0.00010792609,0.0037035402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983327,0.00034530298,0.000091619644,0.00036516492,0.00056013634,0.0003050906],"domain_scores_gemma":[0.9905663,0.0049846405,0.0010309712,0.0021701287,0.000818985,0.0004289045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014248312,0.0006999839,0.0011007944,0.0008960416,0.0010941665,0.0015747704,0.0021054777,0.001456235,0.00384972],"category_scores_gemma":[0.011146473,0.00040379938,0.0006639374,0.0010531197,0.0018363371,0.0037310005,0.0028337433,0.0022212213,0.0005664053],"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.0002815504,0.000095767304,0.0008792457,0.00026546806,0.00004295971,0.0001853468,0.00054181693,0.4641775,0.014400348,0.47205424,0.0021941673,0.04488153],"study_design_scores_gemma":[0.000021605667,0.00010725268,0.00024956054,0.00004171339,0.000024822762,0.00019457623,0.00024371927,0.73508793,0.010386578,0.25090602,0.0027018576,0.000034432866],"about_ca_topic_score_codex":0.0011005527,"about_ca_topic_score_gemma":0.0010118927,"teacher_disagreement_score":0.00384972,"about_ca_system_score_codex":0.0016192788,"about_ca_system_score_gemma":0.00088715384,"threshold_uncertainty_score":0.012878597},"labels":[],"label_agreement":null},{"id":"W4401817680","doi":"10.1162/artl_e_00450","title":"Editorial: Special Issue “The Distributed Ghost”—Cellular Automata, Distributed Dynamical Systems, and Their Applications to Intelligence","year":2024,"lang":"en","type":"editorial","venue":"Artificial Life","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cellular automaton; Computer science; Distributed computing; Automaton; Theoretical computer science; Dynamical systems theory; Artificial intelligence; Physics","score_opus":0.012134385126673294,"score_gpt":0.2641222444443328,"score_spread":0.2519878593176595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401817680","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004762318,0.003918065,0.00017725978,0.03228253,0.9572733,0.000027949483,0.00010069479,0.00009520381,0.0060773026],"genre_scores_gemma":[0.00070054666,0.004191518,0.00013910003,0.014375649,0.9469693,0.00004224237,0.00009577333,0.00009944624,0.03338642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963741,0.0005224356,0.0003503081,0.0005288796,0.0019061249,0.00031812524],"domain_scores_gemma":[0.9898929,0.0026326557,0.0007969315,0.00039985386,0.0045108227,0.0017667895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033631057,0.00350246,0.0029415174,0.0034461957,0.002735935,0.009866016,0.0031476603,0.009533092,0.06303887],"category_scores_gemma":[0.015995128,0.0010394007,0.0028461504,0.0016771412,0.0025885578,0.0054915524,0.0018129055,0.011693881,0.04947533],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000012781623,0.0000044824305,0.000012850864,0.000057429035,0.0000042093843,0.000024462986,0.000004871455,0.000014156793,0.00001851587,0.00024989754,0.9976841,0.0019121218],"study_design_scores_gemma":[0.000021928985,0.000017125463,0.00011811365,0.00020126384,0.000014098136,0.00009684671,0.000035119334,0.00010550073,0.00005506977,0.00090917485,0.99841535,0.000010490193],"about_ca_topic_score_codex":0.0015091649,"about_ca_topic_score_gemma":0.0032715034,"teacher_disagreement_score":0.06303887,"about_ca_system_score_codex":0.002983761,"about_ca_system_score_gemma":0.002736808,"threshold_uncertainty_score":0.210886},"labels":[],"label_agreement":null},{"id":"W4402508383","doi":"10.1162/artl_a_00451","title":"Self-Reproduction and Evolution in Cellular Automata: 25 Years After Evoloops","year":2024,"lang":"en","type":"review","venue":"Artificial Life","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cellular automaton; Computer science; Darwinism; Artificial life; Natural selection; Reproduction; Selection (genetic algorithm); Variation (astronomy); Automaton; Cognitive science; Artificial intelligence; Data science; Biology; Evolutionary biology; Ecology","score_opus":0.023618867741910236,"score_gpt":0.2793689518984342,"score_spread":0.25575008415652395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402508383","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017928651,0.99650097,0.0006417087,0.0008417174,0.00049894414,0.000003047228,0.0000072579883,0.000010264749,0.0013168026],"genre_scores_gemma":[0.0027299686,0.99309385,0.00073423155,0.00091075187,0.00079324807,0.000009652064,0.0000291758,0.000012470085,0.0016867021],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957484,0.00009854864,0.000049518974,0.00007695225,0.00015947952,0.00004061218],"domain_scores_gemma":[0.99873585,0.0007712584,0.00007472776,0.000042477932,0.0003080356,0.00006761754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012325088,0.0008068736,0.0011347877,0.0016451088,0.00047802855,0.0019037775,0.00092061755,0.0018618414,0.0021406992],"category_scores_gemma":[0.0024080686,0.00043908448,0.00055756565,0.0031355096,0.0012376787,0.0033165293,0.0011505745,0.0029171782,0.0019484801],"study_design_candidate":"not_applicable","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.00007147893,0.000056494573,0.00027838387,0.0064649843,0.0000638872,0.00021539487,0.00031702255,0.0012484147,0.0011093644,0.06083113,0.028024942,0.9013185],"study_design_scores_gemma":[0.000006208125,0.00006842743,0.00032462785,0.0023404297,0.000036331345,0.0003798637,0.00008958643,0.00034780352,0.0007486108,0.015123271,0.9805088,0.000026007665],"about_ca_topic_score_codex":0.0016836174,"about_ca_topic_score_gemma":0.0015888014,"teacher_disagreement_score":0.0021406992,"about_ca_system_score_codex":0.0013322821,"about_ca_system_score_gemma":0.0014527218,"threshold_uncertainty_score":0.009666443},"labels":[],"label_agreement":null},{"id":"W4402515811","doi":"10.7554/elife.100652.1.sa4","title":"eLife Assessment: Robust variability of grid cell properties within individual grid modules enhances encoding of local space","year":2024,"lang":"en","type":"peer-review","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Grid; Grid cell; Encoding (memory); Space (punctuation); Computer science; Distributed computing; Mathematics; Artificial intelligence; Operating system; Geometry","score_opus":0.04203575263376578,"score_gpt":0.28437372849211495,"score_spread":0.24233797585834918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402515811","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41957578,0.0019668662,0.51912576,0.0055675413,0.0009516578,0.0003260644,0.0048618834,0.017087819,0.030536518],"genre_scores_gemma":[0.80953336,0.0007424859,0.16733353,0.00069105596,0.00011201674,0.00029224937,0.0029432208,0.0024877945,0.015864242],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99840826,0.000200322,0.000090545975,0.00033637357,0.0008076481,0.0001568145],"domain_scores_gemma":[0.9950046,0.001402317,0.00052728323,0.0006800564,0.0019428706,0.00044290093],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0026595716,0.00041329776,0.00097012345,0.00082700595,0.0006456037,0.0018134709,0.0015919344,0.0014127292,0.0123172905],"category_scores_gemma":[0.015224159,0.00038022458,0.00037516328,0.00077721226,0.001049941,0.0013967901,0.0017689604,0.0012313079,0.004193127],"study_design_candidate":"not_applicable","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.0015780313,0.0001789173,0.03142315,0.0013890662,0.00040895684,0.0010667884,0.0009997776,0.04431513,0.3328738,0.021292094,0.07400656,0.4904678],"study_design_scores_gemma":[0.00034495536,0.0003674595,0.04277293,0.00019455623,0.00024026711,0.0012091999,0.0008292053,0.32148218,0.4911348,0.032459956,0.10877648,0.00018791913],"about_ca_topic_score_codex":0.002225346,"about_ca_topic_score_gemma":0.0044854796,"teacher_disagreement_score":0.99734044,"about_ca_system_score_codex":0.00096430595,"about_ca_system_score_gemma":0.0016463975,"threshold_uncertainty_score":0.041205466},"labels":[],"label_agreement":null},{"id":"W4402835293","doi":"10.1109/isvlsi61997.2024.00153","title":"A Variation-Aware and Energy-Efficient Spintronic True Random Number Generator","year":2024,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Spintronics; Random number generation; Variation (astronomy); Computer science; Generator (circuit theory); Power (physics); Algorithm; Physics; Condensed matter physics; Ferromagnetism","score_opus":0.005121716893541622,"score_gpt":0.21976635666097522,"score_spread":0.2146446397674336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402835293","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.06683564,0.00030382414,0.9261097,0.00027730645,0.000118293836,0.00006655247,0.00014940785,0.0010170455,0.0051222946],"genre_scores_gemma":[0.810228,0.00012835012,0.1863159,0.00013964344,0.000036771908,0.00007775821,0.0001736693,0.000116939475,0.0027829825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996774,0.000105429885,0.000013108485,0.00005069298,0.00012080266,0.000032559798],"domain_scores_gemma":[0.9996424,0.00014233046,0.000042485965,0.00007891623,0.00007629117,0.000017590966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033380566,0.0002284069,0.0002566345,0.00021772308,0.00017152689,0.0003578267,0.00065618893,0.00029725538,0.0009897646],"category_scores_gemma":[0.0009064599,0.000120620425,0.00016807963,0.00022550728,0.0002769777,0.00043927855,0.0002911865,0.0003946971,0.00025302632],"study_design_candidate":"bench_or_experimental","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.00041656682,0.00010547989,0.002008945,0.00020281062,0.00008708247,0.0005367818,0.000083729145,0.49143928,0.19515839,0.104719765,0.0066947555,0.19854638],"study_design_scores_gemma":[0.00002651273,0.00012350695,0.0002646631,0.0000055947744,0.000014910679,0.00017741192,0.000005173605,0.9649456,0.024303643,0.0065610628,0.0035545803,0.000017262479],"about_ca_topic_score_codex":0.00016864922,"about_ca_topic_score_gemma":0.0004808325,"teacher_disagreement_score":0.0009897646,"about_ca_system_score_codex":0.00024713363,"about_ca_system_score_gemma":0.00026764124,"threshold_uncertainty_score":0.0033110976},"labels":[],"label_agreement":null},{"id":"W4402928694","doi":"10.3847/2041-8213/ad7399","title":"Exotic Stable Branches with Efficient TOV Sequences","year":2024,"lang":"en","type":"article","venue":"The Astrophysical Journal Letters","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Biology; Evolutionary biology; Computer science","score_opus":0.011661096222704321,"score_gpt":0.21044472052032098,"score_spread":0.19878362429761667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402928694","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.39684117,0.000103841565,0.5935892,0.00029971058,0.000058376914,0.000080371436,0.00020855972,0.0009888746,0.0078298785],"genre_scores_gemma":[0.9203859,0.00003802287,0.07724128,0.00005026655,0.000014001339,0.00007757804,0.00033877348,0.0001183689,0.001735728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946123,0.00013211998,0.00004447873,0.000102035425,0.00017472001,0.000085503925],"domain_scores_gemma":[0.9965403,0.0013523115,0.00034839235,0.0009350702,0.00056192646,0.0002619676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010422767,0.00037104273,0.0006804091,0.00089107075,0.00086302956,0.001342851,0.0011803573,0.0007910659,0.003004626],"category_scores_gemma":[0.0073013576,0.00036480266,0.00063039124,0.00040275542,0.0011531585,0.0015901286,0.0023020841,0.0010586351,0.00062451046],"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.00040972081,0.000121075354,0.010024049,0.000110239635,0.000031754105,0.00036200706,0.00053256046,0.50843966,0.015874092,0.41639763,0.0017577695,0.045939364],"study_design_scores_gemma":[0.000011967565,0.0000219579,0.00015459504,0.000009676401,0.0000030019257,0.000027687853,0.00002501711,0.91346633,0.002181686,0.0834906,0.0006018657,0.000005541908],"about_ca_topic_score_codex":0.0012718333,"about_ca_topic_score_gemma":0.001655985,"teacher_disagreement_score":0.003004626,"about_ca_system_score_codex":0.0007418964,"about_ca_system_score_gemma":0.0006671889,"threshold_uncertainty_score":0.0100515485},"labels":[],"label_agreement":null},{"id":"W4403465826","doi":"10.1080/17445760.2024.2413509","title":"Cellular automaton model of self-healing","year":2024,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Cellular automaton; Asynchronous cellular automaton; Self-healing; Automaton; Theoretical computer science; Distributed computing; Mobile automaton; Artificial intelligence; Automata theory","score_opus":0.018959819001611374,"score_gpt":0.26924856286004084,"score_spread":0.2502887438584295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403465826","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.28355533,0.0015412276,0.6627575,0.0014623065,0.00032279632,0.00017428158,0.00058409956,0.0009185619,0.048683904],"genre_scores_gemma":[0.96147513,0.00048920617,0.026826775,0.000098819015,0.000033640466,0.00017116,0.00016798079,0.000034885,0.01070238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997656,0.000046560854,0.000015107045,0.000068198104,0.000059259735,0.000045330187],"domain_scores_gemma":[0.99965763,0.00009600528,0.00005354936,0.000058545196,0.000094263545,0.00004006067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001441225,0.00039949387,0.00061196496,0.00041325207,0.0007200093,0.0011038512,0.0012405467,0.001105633,0.003230589],"category_scores_gemma":[0.00078236486,0.00021140507,0.00072013255,0.00044562752,0.0008931077,0.000917459,0.00061675993,0.00057348266,0.00049566186],"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.00008147772,0.000073412695,0.0014610381,0.00011801943,0.00005446876,0.0005628682,0.00026843773,0.7261862,0.013478382,0.24806857,0.0015567539,0.0080903405],"study_design_scores_gemma":[0.000024280127,0.000035427416,0.00017823665,0.000007664493,0.000014831745,0.000085571424,0.000030376887,0.95912546,0.0008796297,0.037122644,0.0024837032,0.00001215571],"about_ca_topic_score_codex":0.0053308653,"about_ca_topic_score_gemma":0.0022058443,"teacher_disagreement_score":0.0053308653,"about_ca_system_score_codex":0.00084197137,"about_ca_system_score_gemma":0.00080014457,"threshold_uncertainty_score":0.010807455},"labels":[],"label_agreement":null},{"id":"W4403780034","doi":"10.48550/arxiv.2409.13669","title":"A Spatiotemporal Perspective on Dynamical Computation in Neural Information Processing Systems","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; National Science Foundation; National Institutes of Health; Canada First Research Excellence Fund; Office of Naval Research; Harvard University","keywords":"Perspective (graphical); Spacetime; Computation; Computer science; Neural system; Dynamical systems theory; Information processing; Theoretical computer science; Artificial intelligence; Algorithm; Physics; Psychology; Cognitive psychology; Quantum mechanics; Neuroscience","score_opus":0.0404449465130405,"score_gpt":0.2088055907996594,"score_spread":0.1683606442866189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403780034","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.017654316,0.013835459,0.90704715,0.0149919335,0.0005581462,0.00004288478,0.0003309838,0.0002079757,0.045331165],"genre_scores_gemma":[0.7870932,0.01611389,0.18216616,0.0018022369,0.0024401315,0.0002386557,0.00032401658,0.00016108692,0.009660617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993104,0.00023658825,0.00004999799,0.00017361392,0.0001778823,0.000051569605],"domain_scores_gemma":[0.99894315,0.00068475545,0.000078629804,0.00012901763,0.00011637178,0.000048183432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009182588,0.00069053256,0.00055007444,0.0010951677,0.0006069471,0.0026895609,0.0009093939,0.0013852799,0.003478968],"category_scores_gemma":[0.0024691008,0.00030190742,0.0008717481,0.0008913772,0.003699851,0.005464271,0.0012191782,0.0024558965,0.0004904834],"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.0000043586624,0.0000042635606,0.00007324555,0.000031415064,0.00000809588,0.00002713551,0.00006089917,0.008613308,0.0005252501,0.98754907,0.0004146496,0.0026884263],"study_design_scores_gemma":[0.000005099099,0.000014061042,0.00011716144,0.000021191587,0.0000065919307,0.000033176435,0.00003119632,0.064891204,0.00021938627,0.9277379,0.006914273,0.0000087489125],"about_ca_topic_score_codex":0.0016893455,"about_ca_topic_score_gemma":0.0009867455,"teacher_disagreement_score":0.003478968,"about_ca_system_score_codex":0.001636796,"about_ca_system_score_gemma":0.0006213576,"threshold_uncertainty_score":0.011875868},"labels":[],"label_agreement":null},{"id":"W4404371577","doi":"10.1109/tit.2024.3498033","title":"Repairing Schemes for Tamo-Barg Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Mathematics; Algorithm","score_opus":0.010232256204397735,"score_gpt":0.24582375622435343,"score_spread":0.23559150001995569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404371577","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.06746039,0.0014754002,0.92068505,0.00050732604,0.00012587306,0.000118504875,0.000262795,0.00090756186,0.00845722],"genre_scores_gemma":[0.8466765,0.0007553011,0.14382166,0.00026476875,0.000076692726,0.00018336916,0.0003607516,0.00020901473,0.0076519544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691904,0.00050144555,0.00019906163,0.00066945003,0.0012003671,0.0005105702],"domain_scores_gemma":[0.9891167,0.0046173334,0.0011732804,0.0034188987,0.0013622493,0.00031162915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015663004,0.0008851135,0.0010938221,0.0009800032,0.001308217,0.0016880778,0.0021157358,0.0015407718,0.0060552973],"category_scores_gemma":[0.012443364,0.00041414236,0.0007053804,0.0011995953,0.0016334443,0.004488212,0.0034473962,0.0024029477,0.0011003918],"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.000564257,0.00011117153,0.0013475415,0.0006613674,0.00007906998,0.00034229827,0.0008058341,0.35295692,0.02118888,0.45983082,0.0063265576,0.1557853],"study_design_scores_gemma":[0.000030421079,0.00025943454,0.0003726428,0.00010873842,0.000045357756,0.0005394827,0.00042160816,0.7154197,0.019498367,0.25479272,0.008436161,0.000075284566],"about_ca_topic_score_codex":0.0012729386,"about_ca_topic_score_gemma":0.0014722393,"teacher_disagreement_score":0.0060552973,"about_ca_system_score_codex":0.0016653539,"about_ca_system_score_gemma":0.0014994836,"threshold_uncertainty_score":0.020256996},"labels":[],"label_agreement":null},{"id":"W4404822264","doi":"10.37236/13002","title":"Keller Properties for Integer Tilings","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer (computer science); Substitution tiling; Combinatorics; Mathematics; Integer programming; Computer science; Mathematical optimization","score_opus":0.013055691021755671,"score_gpt":0.23885556236758132,"score_spread":0.22579987134582566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404822264","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67069256,0.00048516112,0.1865728,0.0015343381,0.00035123393,0.00009885532,0.00048332193,0.000905497,0.1388763],"genre_scores_gemma":[0.97802496,0.00025046626,0.016027818,0.0002917126,0.000075938944,0.00009026431,0.0002054785,0.00004670331,0.0049868226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991103,0.00008241333,0.000069788715,0.00021075593,0.00033158995,0.00019518058],"domain_scores_gemma":[0.9975563,0.0013126767,0.00030926007,0.00040336038,0.0001815056,0.00023677782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005637895,0.0003382315,0.000411531,0.0004645758,0.0012634866,0.0017089718,0.00065207377,0.0006462532,0.0056610303],"category_scores_gemma":[0.005181153,0.00027001512,0.0006289839,0.0004910937,0.0028033974,0.0030005435,0.0026317178,0.001428809,0.00048218857],"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.00012721334,0.000029697816,0.0018647081,0.00015036458,0.000013003498,0.00034300174,0.0006785327,0.009883001,0.01129114,0.95798486,0.0021577424,0.015476794],"study_design_scores_gemma":[0.000057279605,0.00008417557,0.0011159695,0.000041088028,0.000034605033,0.0004775483,0.00051672384,0.028224625,0.018152941,0.937334,0.013913363,0.000047660084],"about_ca_topic_score_codex":0.0012762158,"about_ca_topic_score_gemma":0.0010634267,"teacher_disagreement_score":0.0056610303,"about_ca_system_score_codex":0.0007148011,"about_ca_system_score_gemma":0.0005465134,"threshold_uncertainty_score":0.018938065},"labels":[],"label_agreement":null},{"id":"W4404989063","doi":"10.1017/9781009562942.021","title":"Conclusions","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Psychology","score_opus":0.018311245331793673,"score_gpt":0.20018042961386026,"score_spread":0.18186918428206658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404989063","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.004266341,0.0036457987,0.009399312,0.023839392,0.011539304,0.00031117458,0.005656128,0.0017845138,0.939558],"genre_scores_gemma":[0.05123542,0.0041046743,0.009052512,0.019825073,0.0024480417,0.0003763955,0.010282705,0.0014184341,0.9012567],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99768364,0.0002856118,0.00011760226,0.0005790911,0.0009164627,0.00041749168],"domain_scores_gemma":[0.9972149,0.0003033534,0.00011770472,0.0004475764,0.0014264906,0.0004898834],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020709813,0.0008983664,0.0005806994,0.0015442667,0.002755508,0.006763246,0.0019225688,0.0030392408,0.35276008],"category_scores_gemma":[0.0070114303,0.00030743165,0.0011477154,0.0014422347,0.00087692874,0.003953527,0.0035167583,0.002544282,0.20502739],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0002211777,0.00008215402,0.0018241438,0.0005162609,0.000033891734,0.00029872777,0.00059939193,0.0005055793,0.00080356345,0.0756063,0.7229555,0.19655325],"study_design_scores_gemma":[0.00001457588,0.000017426539,0.0007779387,0.00017801141,0.000008844749,0.00012448266,0.00031269368,0.00012519496,0.00037133828,0.00995907,0.98810124,0.000009261089],"about_ca_topic_score_codex":0.0054845675,"about_ca_topic_score_gemma":0.004854523,"teacher_disagreement_score":0.35276008,"about_ca_system_score_codex":0.0033086846,"about_ca_system_score_gemma":0.0039765434,"threshold_uncertainty_score":0.9232092},"labels":[],"label_agreement":null},{"id":"W4405191201","doi":"10.1007/s00453-024-01285-6","title":"Galloping in Fast-Growth Natural Merge Sorts","year":2024,"lang":"en","type":"article","venue":"Algorithmica","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":"University of Waterloo","funders":"","keywords":"Theory of computation; Merge (version control); Computer science; Parallel computing; Algorithm","score_opus":0.0051749355612094846,"score_gpt":0.230550752158833,"score_spread":0.2253758165976235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405191201","genre_codex":"empirical","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.5087892,0.0014061636,0.38434374,0.0025346573,0.0002787029,0.00023356357,0.0013920269,0.0025860358,0.09843594],"genre_scores_gemma":[0.91349936,0.0005478947,0.05450242,0.00033241982,0.00006624346,0.00014123517,0.00085762254,0.0005163193,0.029536536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987859,0.00021393005,0.000102161255,0.00027202215,0.00031414957,0.00031192668],"domain_scores_gemma":[0.99415094,0.003538534,0.00032807083,0.0009702701,0.0006786379,0.00033362184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013454708,0.00049804145,0.0009914686,0.0022953968,0.0039462238,0.0054525705,0.0014914839,0.0016431357,0.012011469],"category_scores_gemma":[0.010587148,0.00072951167,0.0014870875,0.0030635144,0.0042641205,0.01371952,0.004866482,0.0024638553,0.0012647315],"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.00010307281,0.000018247714,0.00061398244,0.00007672076,0.000009721197,0.0001721586,0.0007024968,0.0039897272,0.0007856101,0.9810229,0.0015545173,0.010950802],"study_design_scores_gemma":[0.000020072031,0.000012434007,0.00016830166,0.00001927678,0.000017638493,0.00014317561,0.00035089356,0.010390195,0.0014079629,0.9817063,0.0057458035,0.000018031242],"about_ca_topic_score_codex":0.0048549334,"about_ca_topic_score_gemma":0.0063452353,"teacher_disagreement_score":0.012011469,"about_ca_system_score_codex":0.0024406873,"about_ca_system_score_gemma":0.0016693654,"threshold_uncertainty_score":0.040182352},"labels":[],"label_agreement":null},{"id":"W4405360852","doi":"10.1109/msec.2024.3463915","title":"Threshold Signatures","year":2024,"lang":"en","type":"article","venue":"IEEE Security & Privacy","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.014106886003259577,"score_gpt":0.26683894781526857,"score_spread":0.25273206181200897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405360852","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.0134934755,0.0077888845,0.8858383,0.0028962921,0.0019827741,0.0004718281,0.0013633517,0.002968511,0.08319649],"genre_scores_gemma":[0.5153627,0.017209237,0.35836267,0.0040157996,0.0023708497,0.0009259671,0.0037209722,0.0008599064,0.097171865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99326706,0.0011768657,0.0005978193,0.0010852681,0.003153853,0.0007191579],"domain_scores_gemma":[0.99347854,0.001787706,0.0007570339,0.0024020083,0.0012910707,0.00028373612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022049502,0.0009497427,0.0013432947,0.002081764,0.0018337152,0.005919781,0.0019648522,0.0024745374,0.014890212],"category_scores_gemma":[0.00940674,0.00057125447,0.0010444212,0.0033945048,0.0032906078,0.010516585,0.0042043533,0.0034837935,0.009281714],"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.00021201812,0.00007246989,0.00050847605,0.0005691114,0.00004497364,0.0002447511,0.0003350178,0.004246826,0.009336254,0.8145198,0.021823116,0.1480871],"study_design_scores_gemma":[0.00006427953,0.00022517773,0.0002808533,0.0003334074,0.000051109106,0.0019740674,0.00023086253,0.021915391,0.02981904,0.58977,0.3552178,0.00011802087],"about_ca_topic_score_codex":0.0004272348,"about_ca_topic_score_gemma":0.00039872323,"teacher_disagreement_score":0.014890212,"about_ca_system_score_codex":0.0017824221,"about_ca_system_score_gemma":0.001808375,"threshold_uncertainty_score":0.049812734},"labels":[],"label_agreement":null},{"id":"W4405627340","doi":"10.1103/dcxb-ql1r","title":"Generation of the complete Bell basis via Hong-Ou-Mandel interference of vector modes","year":2025,"lang":"en","type":"preprint","venue":"Physical review. A/Physical review, A","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Ottawa","funders":"Ministero dell'Università e della Ricerca; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; Canada Research Chairs; University of Ottawa","keywords":"Basis (linear algebra); Interference (communication); Computer science; Mathematics; Telecommunications","score_opus":0.06975315579660323,"score_gpt":0.37017856700922513,"score_spread":0.3004254112126219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405627340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5990325,0.0010697249,0.3580803,0.00056084926,0.00012542836,0.0000965487,0.00013698355,0.0001816895,0.040715978],"genre_scores_gemma":[0.9549045,0.00030971077,0.04184313,0.00014933206,0.000015442756,0.000095751966,0.00005473533,0.000019017554,0.0026082227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996846,0.0001060407,0.000011604988,0.000053298703,0.00009088967,0.00005364741],"domain_scores_gemma":[0.99966276,0.00015584106,0.000045826673,0.000063054424,0.00004381206,0.000028617877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000541851,0.00017438448,0.00032645694,0.00022598164,0.0004620897,0.0006688062,0.00049665075,0.0005203848,0.0014878298],"category_scores_gemma":[0.00097473635,0.00026032812,0.0002640203,0.00020949125,0.0010842165,0.00073228666,0.0008260034,0.0005795755,0.00024986066],"study_design_candidate":"bench_or_experimental","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.00013795224,0.000051107898,0.00094633107,0.00014841981,0.000032398075,0.00026540042,0.00042803754,0.01924627,0.11660996,0.83676356,0.0011376108,0.024232946],"study_design_scores_gemma":[0.00013021273,0.00041710478,0.0020272713,0.000060626484,0.000030883522,0.00050406787,0.0002636305,0.5823836,0.1286479,0.2700249,0.015396178,0.00011367955],"about_ca_topic_score_codex":0.0003306917,"about_ca_topic_score_gemma":0.00054809276,"teacher_disagreement_score":0.0014878298,"about_ca_system_score_codex":0.00037126668,"about_ca_system_score_gemma":0.00034120312,"threshold_uncertainty_score":0.004977286},"labels":[],"label_agreement":null},{"id":"W4405783345","doi":"10.48550/arxiv.2412.17930","title":"Runs in Paperfolding Sequences","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.06660251697708025,"score_gpt":0.19072739146792986,"score_spread":0.12412487449084961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405783345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8069561,0.0010799968,0.16734438,0.00042491828,0.00010236039,0.00007483506,0.0006841147,0.0010124638,0.022320874],"genre_scores_gemma":[0.9662094,0.00037165644,0.023334373,0.00010961226,0.00008663983,0.00012918364,0.00059526734,0.00019779622,0.008966014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909854,0.00014257069,0.000085826905,0.000370663,0.00016734589,0.00013508636],"domain_scores_gemma":[0.9962302,0.0019597316,0.0006169187,0.0004862408,0.00037841935,0.00032854514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042986625,0.00043161958,0.0005316153,0.0013024178,0.0010426,0.0022216707,0.0005487875,0.00076423405,0.0046875807],"category_scores_gemma":[0.0045881914,0.00039179053,0.0006482667,0.0009390151,0.0016544493,0.0039007433,0.0011638076,0.000899467,0.000849022],"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.00035108888,0.0000782143,0.008130884,0.00026989068,0.000036975678,0.001002582,0.0027927614,0.026879799,0.027877472,0.895483,0.0018428876,0.035254344],"study_design_scores_gemma":[0.000029509618,0.000122042824,0.0031781623,0.000079467274,0.000028284445,0.00050336064,0.0004476803,0.05431442,0.0139252655,0.91524583,0.012070314,0.000055593937],"about_ca_topic_score_codex":0.0008294042,"about_ca_topic_score_gemma":0.0006351065,"teacher_disagreement_score":0.0046875807,"about_ca_system_score_codex":0.00083034916,"about_ca_system_score_gemma":0.0004448258,"threshold_uncertainty_score":0.015681505},"labels":[],"label_agreement":null},{"id":"W4406038669","doi":"10.1007/978-3-031-68915-4_10","title":"Toeplitz Systems","year":2024,"lang":"en","type":"book-chapter","venue":"","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":"McMaster University","funders":"","keywords":"Toeplitz matrix; Computer science; Mathematics; Pure mathematics","score_opus":0.01829624351377298,"score_gpt":0.22460162991800914,"score_spread":0.20630538640423615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406038669","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.008967486,0.0027994504,0.060360767,0.00062851096,0.00049110927,0.000022526374,0.00017566369,0.00024742496,0.92630714],"genre_scores_gemma":[0.16741487,0.0044760294,0.014059456,0.00034345197,0.00049304974,0.000057465506,0.0003004568,0.000189112,0.81266606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998994,0.000015574176,0.0000034434381,0.000018691258,0.000049220354,0.000013700232],"domain_scores_gemma":[0.99991345,0.000028084356,0.0000053262856,0.000020425588,0.000024246134,0.000008470543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106317704,0.0007186038,0.0002967321,0.0006439556,0.0006141622,0.0017859516,0.0002893964,0.00045935583,0.031544264],"category_scores_gemma":[0.0004536992,0.00021870367,0.0001687784,0.00077869865,0.0006778512,0.00149557,0.0006665889,0.00104789,0.0071416125],"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.0000050196168,0.000010211172,0.00002031319,0.000027916043,0.0000022390125,0.000025689546,0.0000889013,0.0011623686,0.00082356774,0.95267105,0.013809677,0.031352986],"study_design_scores_gemma":[0.0000030542549,0.0000138734995,0.000093145434,0.000022902477,0.0000030375784,0.000095967094,0.00005584445,0.004793466,0.0008893697,0.8489916,0.14503077,0.000007021769],"about_ca_topic_score_codex":0.0007109714,"about_ca_topic_score_gemma":0.00088749756,"teacher_disagreement_score":0.031544264,"about_ca_system_score_codex":0.0006489794,"about_ca_system_score_gemma":0.000321295,"threshold_uncertainty_score":0.10552609},"labels":[],"label_agreement":null},{"id":"W4406235729","doi":"10.1016/j.endend.2011.08.123","title":"10.1016/j.endend.2011.08.123","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Factorization; Computer science; Algorithm; Pfaffian; Algebra over a field; Mathematics; Artificial intelligence; Combinatorics; Pure mathematics","score_opus":0.006056696518407481,"score_gpt":0.17368734340856523,"score_spread":0.16763064689015775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406235729","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.0020584182,0.003814593,0.007212272,0.0024895747,0.0012226002,0.000059521586,0.0014194812,0.0022688175,0.97945476],"genre_scores_gemma":[0.007966274,0.0017891491,0.0028397748,0.0007534617,0.0002263131,0.000051776933,0.0011301248,0.00034560764,0.9848973],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965966,0.000026973035,0.000023623832,0.00012345372,0.00009763505,0.000068764384],"domain_scores_gemma":[0.99896526,0.00028209813,0.00009853505,0.00014214822,0.00021777514,0.00029415952],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007191614,0.0014609089,0.00072086893,0.0020045768,0.0011510443,0.005317244,0.0014449086,0.004828074,0.92939264],"category_scores_gemma":[0.0017480537,0.00047049666,0.0006776197,0.0012659072,0.0012822383,0.0035676025,0.001665418,0.0012792783,0.9144862],"study_design_candidate":"not_applicable","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.00010936849,0.00022968331,0.002201811,0.00043387583,0.000033139673,0.0002628096,0.00013410808,0.00067731354,0.0011115236,0.013809325,0.29035157,0.69064546],"study_design_scores_gemma":[0.00004294677,0.00007652775,0.0016679147,0.0006974087,0.00004331899,0.0013415273,0.00029793062,0.0009523687,0.0006712068,0.011605844,0.98257035,0.000032548647],"about_ca_topic_score_codex":0.0017334403,"about_ca_topic_score_gemma":0.0018768079,"teacher_disagreement_score":0.070607364,"about_ca_system_score_codex":0.00079654885,"about_ca_system_score_gemma":0.0011603086,"threshold_uncertainty_score":0.100712836},"labels":[],"label_agreement":null},{"id":"W4406495100","doi":"10.1016/0967-0653(95)91394-7","title":"10.1016/0967-0653(95)91394-7","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Teleconnection; Forcing (mathematics); Climatology; Environmental science; Geology; El Niño Southern Oscillation","score_opus":0.0063654923441033955,"score_gpt":0.1750282541707602,"score_spread":0.16866276182665682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406495100","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.00059198897,0.0005604117,0.0007082482,0.00046568448,0.0003973903,0.0001386467,0.0008408927,0.0008984114,0.99539834],"genre_scores_gemma":[0.0008270083,0.00035977585,0.00041970416,0.00033216501,0.00008117619,0.000076567245,0.00051704486,0.00020679743,0.99717975],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999114,0.00006453575,0.00008983251,0.00033873093,0.0002004332,0.00019253648],"domain_scores_gemma":[0.9972554,0.000770027,0.0001582813,0.0003516364,0.00069418974,0.000770571],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013323323,0.0035720565,0.0023818554,0.0032212653,0.003282167,0.0050949743,0.0040487503,0.00678584,0.98902845],"category_scores_gemma":[0.0018722658,0.0012425102,0.0016762591,0.0030877523,0.0033233485,0.0068546664,0.0037201669,0.0034240235,0.99303365],"study_design_candidate":"not_applicable","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.0005149999,0.00027736943,0.0011844877,0.00091789523,0.00006366138,0.00038221295,0.0001554304,0.0006612622,0.0031192845,0.007226008,0.40850225,0.57699513],"study_design_scores_gemma":[0.00007788752,0.00017495235,0.0009391208,0.00052410754,0.000023688543,0.00049743504,0.00021002031,0.00028160165,0.00055541395,0.0011284344,0.9955499,0.000037431186],"about_ca_topic_score_codex":0.0048138625,"about_ca_topic_score_gemma":0.003934107,"teacher_disagreement_score":0.010971546,"about_ca_system_score_codex":0.0014617543,"about_ca_system_score_gemma":0.0011980878,"threshold_uncertainty_score":0.015649498},"labels":[],"label_agreement":null},{"id":"W4406670671","doi":"10.1016/b978-0-08-057160-7.50013-1","title":"10.1016/b978-0-08-057160-7.50013-1","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.008839128059959072,"score_gpt":0.1754953332994868,"score_spread":0.16665620523952773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406670671","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.0002409136,0.00050923356,0.0015476824,0.00037638162,0.00019102379,0.000041306987,0.0007097821,0.0010783292,0.9953054],"genre_scores_gemma":[0.00064529234,0.0003025555,0.00048642448,0.00011368762,0.00003639626,0.000031722597,0.00044086398,0.00026333902,0.99767965],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953985,0.000028744,0.000030027026,0.00015529763,0.00015992596,0.000086253676],"domain_scores_gemma":[0.9984333,0.0004912225,0.00011816466,0.00023183732,0.00031911003,0.0004063656],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00085088465,0.0019464049,0.0013257053,0.0018487216,0.0012569868,0.0048735114,0.002685592,0.0040830215,0.97521067],"category_scores_gemma":[0.0015652603,0.0007343345,0.00080892566,0.0021538916,0.0011571099,0.0048653437,0.0026753664,0.0020944541,0.98806316],"study_design_candidate":"not_applicable","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.00012326679,0.00009964472,0.0003745811,0.00041012414,0.000016918362,0.0001233171,0.000090194066,0.00041478226,0.0025495684,0.008755725,0.33608294,0.65095896],"study_design_scores_gemma":[0.000013980227,0.00003739152,0.00039501544,0.0002263415,0.000007856074,0.00019958305,0.00007580797,0.0001564276,0.0003917841,0.0014277841,0.99705696,0.000011151644],"about_ca_topic_score_codex":0.002432884,"about_ca_topic_score_gemma":0.002404287,"teacher_disagreement_score":0.024789333,"about_ca_system_score_codex":0.0009858138,"about_ca_system_score_gemma":0.00083991,"threshold_uncertainty_score":0.035358906},"labels":[],"label_agreement":null},{"id":"W4406755404","doi":"10.4230/lipics.icalp.2025.10","title":"On the Complexity of Telephone Broadcasting from Cacti to Bounded Pathwidth Graphs","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Broadcasting (networking); Pathwidth; Chordal graph; Computer science; Mathematics; Discrete mathematics; Combinatorics; Computer network; Theoretical computer science; Graph","score_opus":0.10038620919948693,"score_gpt":0.2844509807874642,"score_spread":0.1840647715879773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406755404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7252734,0.006223626,0.18375818,0.020547131,0.0003840328,0.0005974857,0.007878377,0.0027122684,0.052625574],"genre_scores_gemma":[0.91733897,0.0033883294,0.059355017,0.0021986705,0.0006004628,0.00050247926,0.0066342605,0.0008210332,0.009160826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974445,0.0006888006,0.00009934685,0.0006161386,0.0005195607,0.000631487],"domain_scores_gemma":[0.9603639,0.03388836,0.0016563849,0.0018120146,0.0011501746,0.0011291385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001774942,0.0015430194,0.0021678065,0.0012504522,0.0023719324,0.004602939,0.0036608814,0.0030578848,0.011803278],"category_scores_gemma":[0.022632191,0.0009013295,0.001776761,0.00281847,0.0028499353,0.009166483,0.0030594158,0.005065972,0.001148284],"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.0022556158,0.0006129069,0.008052481,0.0018869414,0.00027396335,0.00086922763,0.0027805786,0.6122133,0.008171722,0.22425365,0.065456875,0.07317282],"study_design_scores_gemma":[0.00026778443,0.000093130235,0.0020305146,0.0001028148,0.00010833805,0.0004152301,0.00051571603,0.64178514,0.0016972363,0.3474812,0.0054458138,0.000057194553],"about_ca_topic_score_codex":0.01916095,"about_ca_topic_score_gemma":0.013452787,"teacher_disagreement_score":0.01916095,"about_ca_system_score_codex":0.006277361,"about_ca_system_score_gemma":0.0032510816,"threshold_uncertainty_score":0.045545697},"labels":[],"label_agreement":null},{"id":"W4406780500","doi":"10.48550/arxiv.2501.13044","title":"Uniform temporal trees","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada; Banco Bilbao Vizcaya Argentaria; Ministerio de Economía y Competitividad; Fundación BBVA","keywords":"Computer science; Mathematics","score_opus":0.03910676890355345,"score_gpt":0.27835639501662907,"score_spread":0.23924962611307563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406780500","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.104803346,0.0015359343,0.8529231,0.0011453512,0.00019520285,0.00013772208,0.0013808262,0.00070797076,0.03717052],"genre_scores_gemma":[0.84560406,0.0015606823,0.13086332,0.00077728776,0.0003455538,0.0005480284,0.0014683312,0.0003278437,0.018504819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990386,0.00025480991,0.00004637098,0.00028195206,0.00020555138,0.00017281748],"domain_scores_gemma":[0.9957481,0.0020492,0.00063148676,0.0006913034,0.0005449766,0.00033499394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090044,0.00038050034,0.0005843438,0.0012083725,0.001375086,0.0017527938,0.0013077373,0.0011998374,0.0063405256],"category_scores_gemma":[0.008709499,0.0003636017,0.00082042324,0.0013966849,0.0018292841,0.0036666044,0.0012494606,0.0014088899,0.00082601246],"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.000019832183,0.0000102297845,0.0004196406,0.00003442022,0.000007780992,0.00007041917,0.000075521224,0.009985386,0.00086546625,0.98178184,0.0014626139,0.005266874],"study_design_scores_gemma":[0.000023585828,0.00004231217,0.0006635969,0.00003582067,0.000019410407,0.00031675442,0.00006832991,0.1791978,0.0010562621,0.80138195,0.0171727,0.000021376978],"about_ca_topic_score_codex":0.002736047,"about_ca_topic_score_gemma":0.0031356167,"teacher_disagreement_score":0.0063405256,"about_ca_system_score_codex":0.0016850822,"about_ca_system_score_gemma":0.0007808138,"threshold_uncertainty_score":0.021211207},"labels":[],"label_agreement":null},{"id":"W4407141475","doi":"10.7554/elife.100652.2.sa4","title":"eLife Assessment: Robust variability of grid cell properties within individual grid modules enhances encoding of local space","year":2025,"lang":"en","type":"peer-review","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Grid; Encoding (memory); Grid cell; Space (punctuation); Computer science; Mathematics; Artificial intelligence; Geometry; Operating system","score_opus":0.03676787363824868,"score_gpt":0.2821685181880018,"score_spread":0.24540064454975313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407141475","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4574752,0.0014810561,0.4902621,0.0037707065,0.00066063413,0.0002700229,0.0042146323,0.016162826,0.025702804],"genre_scores_gemma":[0.84193456,0.00053399935,0.13951842,0.0005057352,0.000078316545,0.00024244578,0.0025283433,0.0021739819,0.012484241],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864835,0.00016453527,0.00007490871,0.00029281667,0.00067752757,0.00014194165],"domain_scores_gemma":[0.9959655,0.0011822328,0.00044500735,0.00058243785,0.001479151,0.0003457471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020929927,0.00039697214,0.0009063239,0.0007310009,0.00056966324,0.0016727559,0.0014781288,0.0012510855,0.011057592],"category_scores_gemma":[0.013133236,0.00034689394,0.0003510748,0.00069106126,0.00097353535,0.0012831356,0.0016051976,0.0011203341,0.003765997],"study_design_candidate":"not_applicable","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.0015248695,0.00018629536,0.033081297,0.0012300597,0.0003520475,0.0010558439,0.0008821544,0.052216627,0.3719899,0.019217614,0.056889836,0.46137345],"study_design_scores_gemma":[0.00026470984,0.00035004973,0.039302938,0.00015159293,0.0001898667,0.0010538332,0.0006880848,0.35775244,0.49894887,0.028159844,0.072972365,0.00016545234],"about_ca_topic_score_codex":0.0019752288,"about_ca_topic_score_gemma":0.003660843,"teacher_disagreement_score":0.011057592,"about_ca_system_score_codex":0.00086630497,"about_ca_system_score_gemma":0.0013167227,"threshold_uncertainty_score":0.0369913},"labels":[],"label_agreement":null},{"id":"W4407389620","doi":"10.1016/j.aim.2025.110148","title":"Constructions of Turán systems that are tight up to a multiplicative constant","year":2025,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"H2020 European Research Council; European Research Council","keywords":"Mathematics; Multiplicative function; Constant (computer programming); Mathematical analysis","score_opus":0.013988335548160384,"score_gpt":0.29052208387719314,"score_spread":0.27653374832903277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407389620","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.2794544,0.0029289012,0.61438125,0.003832538,0.0004660472,0.0002483803,0.00088235585,0.0030042843,0.09480191],"genre_scores_gemma":[0.8605275,0.0010356137,0.1167206,0.0012686171,0.0002789848,0.00052368955,0.0006959388,0.00057782384,0.01837119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973775,0.0007361451,0.00016486715,0.0006856891,0.00054285733,0.00049291877],"domain_scores_gemma":[0.9883762,0.0055242316,0.0013480984,0.002816447,0.0008245706,0.0011104681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021603731,0.0010268879,0.0012075267,0.0023216212,0.0030438371,0.0043866015,0.0020699855,0.0019172882,0.010951946],"category_scores_gemma":[0.017675899,0.0017833734,0.0013358326,0.002037435,0.0036219244,0.007897676,0.006123849,0.0037699884,0.0023407026],"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.00006357898,0.000023179733,0.000523595,0.00011080686,0.000015292811,0.00005800493,0.00045162355,0.0070038405,0.0018029634,0.9788134,0.0027106085,0.008423093],"study_design_scores_gemma":[0.000047657966,0.00008217003,0.0006891179,0.0000829476,0.000051532028,0.00023765236,0.00019066424,0.051024217,0.0033221056,0.920066,0.02413513,0.00007079339],"about_ca_topic_score_codex":0.0013556553,"about_ca_topic_score_gemma":0.0017903075,"teacher_disagreement_score":0.010951946,"about_ca_system_score_codex":0.0028767788,"about_ca_system_score_gemma":0.0010450882,"threshold_uncertainty_score":0.036637902},"labels":[],"label_agreement":null},{"id":"W4407565428","doi":"10.1007/s10955-025-03414-z","title":"Near-Critical and Finite-Size Scaling for High-Dimensional Lattice Trees and Animals","year":2025,"lang":"en","type":"article","venue":"Journal of Statistical Physics","topic":"Cellular Automata and Applications","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":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Clay Mathematics Institute","keywords":"Scaling; Statistical physics; Lattice (music); Critical phenomena; Scaling law; Critical exponent; Condensed matter physics; Mathematics; Physics; Geometry; Phase transition","score_opus":0.013507941108501403,"score_gpt":0.29649340008499003,"score_spread":0.28298545897648864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407565428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8991213,0.0036863508,0.06351355,0.0031184386,0.00025942898,0.000044911085,0.00018061473,0.00035723747,0.02971828],"genre_scores_gemma":[0.9936195,0.0006507673,0.0035974002,0.00015569503,0.0002538685,0.00003347961,0.00007581597,0.000049392766,0.0015641197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997079,0.00008186414,0.0000149015605,0.000051752635,0.000082195285,0.000061323764],"domain_scores_gemma":[0.9938877,0.0032169267,0.0007444211,0.0003614393,0.0005437686,0.0012456767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009160575,0.00034074934,0.0009708637,0.0021672517,0.0014785413,0.0026076846,0.001310252,0.0015287967,0.0029697348],"category_scores_gemma":[0.009782231,0.0004957247,0.0005879253,0.00066050596,0.0037546447,0.0037047141,0.0014862693,0.0015808617,0.00021760956],"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.000050158196,0.000069076465,0.0017716405,0.00010294445,0.000025036,0.00018514895,0.0003194886,0.019654423,0.0034341596,0.9695412,0.0016559169,0.0031907768],"study_design_scores_gemma":[0.000015694352,0.000017114826,0.0018532083,0.00001998803,0.000009340662,0.00015526211,0.00010609404,0.08743156,0.00037202312,0.9092526,0.0007481746,0.00001903753],"about_ca_topic_score_codex":0.001591654,"about_ca_topic_score_gemma":0.0013891363,"teacher_disagreement_score":0.0029697348,"about_ca_system_score_codex":0.0013564541,"about_ca_system_score_gemma":0.0006032159,"threshold_uncertainty_score":0.009934783},"labels":[],"label_agreement":null},{"id":"W4407665681","doi":"10.1142/s0218127425300101","title":"Modeling and Analysis of Cellular Neural Networks Based on Memcapacitor","year":2025,"lang":"en","type":"article","venue":"International Journal of Bifurcation and Chaos","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Department of Education of Liaoning Province; National Natural Science Foundation of China","keywords":"Artificial neural network; Computer science; Mathematics; Biological system; Artificial intelligence; Biology","score_opus":0.009889304397255631,"score_gpt":0.25560184791537954,"score_spread":0.2457125435181239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407665681","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.30873114,0.004156528,0.64983124,0.00091152894,0.00019748365,0.00007613397,0.00027926094,0.00033139173,0.035485245],"genre_scores_gemma":[0.9837684,0.0009427428,0.010281564,0.000058913643,0.000034750832,0.000072841176,0.0000633529,0.000017874143,0.0047596064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999281,0.000015013866,0.0000035931498,0.000017830189,0.000021325823,0.000014163624],"domain_scores_gemma":[0.99989617,0.000028380357,0.000025778729,0.0000080189075,0.00003229451,0.000009399619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014193618,0.00037896994,0.00033661214,0.00043797813,0.00034403062,0.00045309178,0.00075450627,0.00067256624,0.0008627565],"category_scores_gemma":[0.00045812465,0.0002124757,0.00039467926,0.00030117028,0.00054107653,0.00067238614,0.00039516547,0.0003528242,0.00011667899],"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.00001667372,0.0000090440335,0.0009278934,0.00005681429,0.00002408832,0.00021789657,0.000055101023,0.9477837,0.006687044,0.039875273,0.0003503846,0.0039960146],"study_design_scores_gemma":[0.0000010121222,0.0000058241944,0.00012521342,0.0000028351772,0.0000029760386,0.000023724999,0.000004733439,0.9962685,0.00027387677,0.0030624296,0.00022605664,0.000002731698],"about_ca_topic_score_codex":0.007043356,"about_ca_topic_score_gemma":0.0039206496,"teacher_disagreement_score":0.007043356,"about_ca_system_score_codex":0.0006721808,"about_ca_system_score_gemma":0.0005134756,"threshold_uncertainty_score":0.014004707},"labels":[],"label_agreement":null},{"id":"W4407777571","doi":"10.7554/elife.100652.3.sa0","title":"eLife Assessment: Robust variability of grid cell properties within individual grid modules enhances encoding of local space","year":2025,"lang":"en","type":"peer-review","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Grid; Grid cell; Encoding (memory); Space (punctuation); Computer science; Data mining; Distributed computing; Mathematics; Artificial intelligence; Geometry; Operating system","score_opus":0.03676787363824868,"score_gpt":0.2821685181880018,"score_spread":0.24540064454975313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407777571","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2255898,0.0020354947,0.6800735,0.0065374393,0.0014671155,0.00073277147,0.005893183,0.031492148,0.046178486],"genre_scores_gemma":[0.6227061,0.0008955164,0.3167032,0.0011847559,0.000237349,0.00092532975,0.0062406748,0.008530811,0.042576265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99675226,0.00050863234,0.00017758319,0.00062238926,0.0016499596,0.00028908812],"domain_scores_gemma":[0.9902734,0.0021984268,0.0006902276,0.0011969423,0.005023424,0.00061766896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005028736,0.0005083561,0.0013248437,0.0010905738,0.00095467985,0.0022697558,0.0019381202,0.0016154058,0.015138532],"category_scores_gemma":[0.022511153,0.00055102713,0.0004900262,0.0010999884,0.0010709756,0.0016046743,0.0021347,0.0016111763,0.0066522327],"study_design_candidate":"not_applicable","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.00104485,0.00016330912,0.017683467,0.0009842576,0.00030961278,0.0005407029,0.0008190187,0.014972661,0.1657172,0.012228553,0.13368598,0.6518504],"study_design_scores_gemma":[0.0005749476,0.00043552712,0.05075692,0.00024291982,0.00035626118,0.0012710579,0.00085060246,0.1809774,0.4527991,0.03367331,0.27773395,0.00032791347],"about_ca_topic_score_codex":0.0038466875,"about_ca_topic_score_gemma":0.009637115,"teacher_disagreement_score":0.015138532,"about_ca_system_score_codex":0.0010893507,"about_ca_system_score_gemma":0.0032148382,"threshold_uncertainty_score":0.050643444},"labels":[],"label_agreement":null},{"id":"W4407783209","doi":"10.1109/tit.2025.3544168","title":"Higher-Order Staircase Codes","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Order (exchange); Algorithm; Theoretical computer science; Mathematics","score_opus":0.0068898875733434655,"score_gpt":0.2343245736785783,"score_spread":0.22743468610523485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407783209","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.20302713,0.0002743448,0.77113485,0.00020598233,0.00008426984,0.000101285565,0.00034365422,0.000601332,0.02422721],"genre_scores_gemma":[0.83951324,0.00025588166,0.15080345,0.00019234687,0.000032760443,0.00014695294,0.0003739621,0.00008744803,0.008593941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964845,0.00004653365,0.000025972298,0.00007122246,0.00012987683,0.000077882316],"domain_scores_gemma":[0.99902844,0.00020781068,0.00011924212,0.00033508328,0.0002392719,0.00007018953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021307194,0.00029550373,0.00029969434,0.00062994286,0.00038187177,0.0008676366,0.00078018266,0.00046050057,0.0029647958],"category_scores_gemma":[0.0015326542,0.0001486918,0.000341555,0.0008149403,0.00074202125,0.0008943088,0.0007065396,0.000847918,0.0006952122],"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.00018182339,0.00005384761,0.0012207959,0.000114927374,0.000019457686,0.0003465408,0.00023474536,0.075212784,0.048666008,0.80115116,0.0016714977,0.07112626],"study_design_scores_gemma":[0.000050535677,0.00024164643,0.0007382081,0.000038185568,0.000020277186,0.000755501,0.00009449396,0.5868698,0.06965597,0.31517804,0.026290815,0.000066578716],"about_ca_topic_score_codex":0.0012407564,"about_ca_topic_score_gemma":0.0018763677,"teacher_disagreement_score":0.0029647958,"about_ca_system_score_codex":0.0007349447,"about_ca_system_score_gemma":0.00062288914,"threshold_uncertainty_score":0.009918213},"labels":[],"label_agreement":null},{"id":"W4409248689","doi":"10.1109/hpca61900.2025.00116","title":"PIMnet: A Domain-Specific Network for Efficient Collective Communication in Scalable PIM","year":2025,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Samsung","keywords":"Computer science; Scalability; Domain (mathematical analysis); Computer network; Distributed computing; Operating system","score_opus":0.012415903217293757,"score_gpt":0.24897109491001618,"score_spread":0.23655519169272243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409248689","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.28468147,0.0016703305,0.64928776,0.0007292062,0.00055341027,0.00046284313,0.0009980355,0.018045833,0.04357111],"genre_scores_gemma":[0.81573105,0.000496456,0.16997313,0.0003009431,0.00007439792,0.0003601675,0.0019257778,0.00033977735,0.010798201],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998018,0.000047784804,0.00000870955,0.000038015198,0.00006395953,0.00003966198],"domain_scores_gemma":[0.9996823,0.00007058733,0.00004908527,0.00007643208,0.00008259299,0.000039031504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039831272,0.00043504857,0.000226843,0.00038922095,0.0004597183,0.00054439146,0.0009602189,0.00027616185,0.0034466756],"category_scores_gemma":[0.00070738676,0.00014362848,0.00020137899,0.00036097804,0.0002735409,0.0008997469,0.00081892445,0.00045724466,0.0007123458],"study_design_candidate":"bench_or_experimental","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.0013336341,0.00054946926,0.0064134174,0.00076867413,0.00018073525,0.00082729396,0.00034991768,0.30219623,0.15372266,0.062105905,0.10209021,0.36946186],"study_design_scores_gemma":[0.00006994209,0.00047215074,0.0015316955,0.000035037996,0.000041335075,0.0002229049,0.000101315825,0.9037484,0.041403927,0.007958698,0.044374064,0.000040557585],"about_ca_topic_score_codex":0.0015735481,"about_ca_topic_score_gemma":0.003794735,"teacher_disagreement_score":0.0034466756,"about_ca_system_score_codex":0.0007614804,"about_ca_system_score_gemma":0.00067856093,"threshold_uncertainty_score":0.01153028},"labels":[],"label_agreement":null},{"id":"W4409347567","doi":"10.1609/aaai.v39i18.34159","title":"Constrained Generative Modeling with Manually Bridged Diffusion Models","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Alliance de recherche numérique du Canada; Compute Canada; Lawrence Berkeley National Laboratory; Canadian Institute for Advanced Research; U.S. Department of Energy","keywords":"Generative grammar; Computer science; Diffusion; Generative model; Artificial intelligence; Physics","score_opus":0.058810530888649175,"score_gpt":0.2801701110198855,"score_spread":0.2213595801312363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347567","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.0060050995,0.00006589633,0.99166965,0.00016070493,0.000017379569,0.000025490534,0.00005347212,0.00021802992,0.0017842621],"genre_scores_gemma":[0.57481414,0.00030429504,0.413573,0.0003714203,0.00009133789,0.00049140246,0.00046458235,0.00052537874,0.009364388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985776,0.0005550317,0.00006421037,0.00036715207,0.00033011922,0.00010602162],"domain_scores_gemma":[0.9961415,0.0026192782,0.00031915426,0.0005263234,0.00022358654,0.00017017065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022547932,0.001084199,0.001167345,0.0011070584,0.0008513741,0.001977664,0.0025686582,0.0027436046,0.0059698],"category_scores_gemma":[0.010591834,0.0011960572,0.0018087942,0.0010273731,0.002354253,0.0036615457,0.0037436949,0.00309112,0.0009540847],"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.000032079886,0.000023945588,0.0004160143,0.00004284567,0.000030504705,0.00010854555,0.00017844362,0.8008261,0.0015464902,0.18245071,0.00075811456,0.01358622],"study_design_scores_gemma":[0.0000053116974,0.000008733214,0.000033171338,0.000005987945,0.0000035515109,0.00002149521,0.000008573499,0.95411146,0.00023860732,0.044802412,0.00075296714,0.000007821477],"about_ca_topic_score_codex":0.0047896975,"about_ca_topic_score_gemma":0.0053331614,"teacher_disagreement_score":0.0059698,"about_ca_system_score_codex":0.0014114939,"about_ca_system_score_gemma":0.0011493241,"threshold_uncertainty_score":0.019970953},"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":"W4410486453","doi":"10.61091/jcmcc126-12","title":"A note on Beckett-Gray codes and the relationship of Gray codes to data structures","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Gray (unit); Gray code; Computer science; Artificial intelligence; Algorithm; Medicine","score_opus":0.026872960999859204,"score_gpt":0.3001297741647188,"score_spread":0.2732568131648596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410486453","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.11408193,0.007360273,0.669562,0.011035098,0.0021962558,0.00018169776,0.0005039124,0.0004486076,0.19463032],"genre_scores_gemma":[0.6790842,0.005867868,0.265159,0.0055323225,0.0015729751,0.00039816028,0.00032547917,0.0003842873,0.04167574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867094,0.00028037996,0.00010924304,0.00023393381,0.0004628591,0.00024264216],"domain_scores_gemma":[0.9974559,0.0015796565,0.00016038623,0.0002611387,0.00033847577,0.00020433306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013110377,0.0007291645,0.00070148613,0.0022411186,0.0027019766,0.0025008698,0.0010481656,0.0018217994,0.0063774157],"category_scores_gemma":[0.005451645,0.0006052877,0.0008996924,0.0032175346,0.0074064806,0.009250175,0.0033048103,0.0043916292,0.001015478],"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.000009399316,0.0000046173436,0.000079440826,0.00001608959,0.000001071923,0.000028766623,0.00011909875,0.00032447005,0.00021891537,0.9949576,0.00069839356,0.0035420402],"study_design_scores_gemma":[0.00000735198,0.000029888864,0.00008828996,0.000027821914,0.000004662697,0.000102096325,0.00006045236,0.0028401408,0.00078206067,0.97636616,0.019669574,0.000021421012],"about_ca_topic_score_codex":0.0043021855,"about_ca_topic_score_gemma":0.0029640729,"teacher_disagreement_score":0.0063774157,"about_ca_system_score_codex":0.0022964748,"about_ca_system_score_gemma":0.0014324465,"threshold_uncertainty_score":0.021334648},"labels":[],"label_agreement":null},{"id":"W4411346613","doi":"10.1155/atr/5528500","title":"A Distributed Magnetic Sensor Network: Vehicle Trajectory Tracking Based on Cellular Automaton","year":2025,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Trajectory; Tracking (education); Cellular automaton; Computer science; Automaton; Vehicle tracking system; Real-time computing; Artificial intelligence; Physics; Kalman filter","score_opus":0.0068592824292787995,"score_gpt":0.23242451784999218,"score_spread":0.22556523542071338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411346613","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.032144774,0.00038864987,0.9634313,0.00018377982,0.0001045643,0.000039696988,0.00011424553,0.0008538551,0.0027391745],"genre_scores_gemma":[0.8935962,0.00041561126,0.10246906,0.000076681696,0.000047786292,0.000112849986,0.00019116103,0.000025792837,0.0030648352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996903,0.000072676994,0.000014048144,0.0001176745,0.00008341658,0.00002187124],"domain_scores_gemma":[0.9996234,0.00013200614,0.00005940843,0.000048261092,0.0001127102,0.000024089379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021730001,0.0004983394,0.0004743693,0.0005004835,0.00041192974,0.0005611409,0.00093127164,0.0004784477,0.000803289],"category_scores_gemma":[0.0010166464,0.00017836313,0.0003295904,0.000628562,0.0003557371,0.00064721046,0.0005174695,0.00040894013,0.0003009427],"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.0002418896,0.0000881993,0.004195298,0.00014502121,0.00008424307,0.00021593513,0.00013135956,0.7863725,0.022930084,0.019687349,0.0023792246,0.16352886],"study_design_scores_gemma":[0.0000048001607,0.00003045849,0.00024233758,0.0000037238406,0.0000073409155,0.000036568596,0.000008560493,0.9957703,0.001303988,0.0014925878,0.0010932692,0.000005986786],"about_ca_topic_score_codex":0.0067840978,"about_ca_topic_score_gemma":0.0056900196,"teacher_disagreement_score":0.0067840978,"about_ca_system_score_codex":0.0007655388,"about_ca_system_score_gemma":0.0005486013,"threshold_uncertainty_score":0.013489246},"labels":[],"label_agreement":null},{"id":"W4411668149","doi":"10.28924/2291-8639-23-2025-155","title":"Fractal Attractor via Controlled Strong b-Kannan Iterated Function System","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Iterated function system; Mathematics; Attractor; Fractal; Pure mathematics; Function (biology); Iterated function; Mathematical analysis","score_opus":0.005079912816100531,"score_gpt":0.2566665527666608,"score_spread":0.25158663995056024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411668149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62206197,0.0016842129,0.3369265,0.0007101998,0.00018139365,0.00007004402,0.00013675347,0.00034038216,0.037888546],"genre_scores_gemma":[0.9803357,0.0004012248,0.015548061,0.000040869036,0.000041349365,0.000054695804,0.00004248378,0.000014572234,0.003521059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998134,0.000048366343,0.000010436768,0.00003932377,0.00006437904,0.00002414905],"domain_scores_gemma":[0.9998192,0.000050540475,0.000051869236,0.000016598779,0.000034369405,0.000027501685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020814192,0.00021067947,0.0003581306,0.00059218,0.00045419167,0.0006591019,0.0004237171,0.0004668888,0.0012158679],"category_scores_gemma":[0.00069051614,0.00012802052,0.0004509769,0.0002064646,0.0007986032,0.00068158703,0.0005791111,0.0003480802,0.00011805477],"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.000059934344,0.000032347016,0.002044489,0.00011689974,0.00006713423,0.0009779376,0.00041920616,0.07060018,0.036651466,0.8756448,0.0012352179,0.012150272],"study_design_scores_gemma":[0.000045438126,0.00010447364,0.0014978304,0.00002875668,0.00002816011,0.0006863344,0.00010873886,0.77733296,0.0041482802,0.21060304,0.0053657354,0.000050304912],"about_ca_topic_score_codex":0.0012989622,"about_ca_topic_score_gemma":0.0005355597,"teacher_disagreement_score":0.0012989622,"about_ca_system_score_codex":0.00044600386,"about_ca_system_score_gemma":0.0003094973,"threshold_uncertainty_score":0.0040674806},"labels":[],"label_agreement":null},{"id":"W4412030314","doi":"10.1109/twc.2025.3584017","title":"Achievable Splitting and Decoding in the Multiple Access Channel: A Hierarchical Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Computer science; Computer network; Channel (broadcasting); Telecommunications; Algorithm","score_opus":0.04159920531674648,"score_gpt":0.30281832475133147,"score_spread":0.261219119434585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412030314","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.009989012,0.00015959374,0.98667604,0.00009448982,0.000014447816,0.000046026245,0.00004249504,0.00018663773,0.0027913495],"genre_scores_gemma":[0.56136394,0.0004191072,0.43456239,0.00012068031,0.000067855166,0.00016434761,0.000160531,0.00011090491,0.0030302475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886453,0.0003361799,0.00006633381,0.00017343638,0.00036670075,0.00019279227],"domain_scores_gemma":[0.9981077,0.00092688465,0.00015067968,0.00036308475,0.0003568704,0.0000949334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013878524,0.000939051,0.0009275294,0.0008801105,0.00091436703,0.0012441558,0.0016955878,0.0009613393,0.0019446968],"category_scores_gemma":[0.003573109,0.0005227163,0.00074355723,0.0010748795,0.0012137601,0.0016529574,0.0022404992,0.0012386256,0.00069037004],"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.00013382648,0.000110747744,0.00050054037,0.0001362644,0.0000334467,0.00016373699,0.00032020244,0.75965637,0.024478875,0.119223155,0.0015428379,0.093699954],"study_design_scores_gemma":[0.000007052204,0.000024346942,0.00005454812,0.00000802469,0.0000068428485,0.000041160747,0.000020055822,0.97138464,0.0031939107,0.024646247,0.00060105766,0.000011955841],"about_ca_topic_score_codex":0.0022906568,"about_ca_topic_score_gemma":0.003148542,"teacher_disagreement_score":0.0022906568,"about_ca_system_score_codex":0.0011807982,"about_ca_system_score_gemma":0.0018979306,"threshold_uncertainty_score":0.008567333},"labels":[],"label_agreement":null},{"id":"W4412030533","doi":"10.1109/tcsii.2025.3585913","title":"Chaotic Nature of Integer Sequences From Primitive Linear Feedback Shift Registers","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"Korea Research Institute for Defense Technology Planning and Advancement","keywords":"Shift register; Integer (computer science); Chaotic; Computer science; Mathematics; Arithmetic; Telecommunications; Artificial intelligence; Programming language","score_opus":0.013879162474007688,"score_gpt":0.2488373868178416,"score_spread":0.2349582243438339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412030533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9394475,0.0002397435,0.05398368,0.000067540524,0.000026968417,0.000023164816,0.000064596774,0.00007774845,0.006069032],"genre_scores_gemma":[0.99277836,0.000097282245,0.006177653,0.000011815955,0.00001113262,0.0000133872145,0.00004533728,0.000008333646,0.0008566992],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999018,0.000018640996,0.000007115179,0.000015597967,0.0000437236,0.000013124875],"domain_scores_gemma":[0.9996667,0.0001453982,0.00010175843,0.00003249648,0.000037961952,0.000015666565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012819532,0.00016550673,0.00012227015,0.0003631879,0.00017901226,0.0003232503,0.00014515358,0.00018771739,0.0012353013],"category_scores_gemma":[0.0010174327,0.00009390775,0.00008279854,0.0001969415,0.00042876907,0.0005402999,0.00020656778,0.00022471698,0.00011569484],"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.00051254546,0.000060950802,0.005496378,0.00030638126,0.000019456704,0.0013602764,0.0010684021,0.08832569,0.47125286,0.38071904,0.00035797397,0.05051997],"study_design_scores_gemma":[0.000087709894,0.00075871777,0.01066946,0.00007905496,0.000024312945,0.0021514304,0.00033406864,0.63189,0.18998498,0.1558283,0.008086362,0.00010558384],"about_ca_topic_score_codex":0.00013754705,"about_ca_topic_score_gemma":0.00011305453,"teacher_disagreement_score":0.0012353013,"about_ca_system_score_codex":0.00019111816,"about_ca_system_score_gemma":0.00015605317,"threshold_uncertainty_score":0.004132509},"labels":[],"label_agreement":null},{"id":"W44128177","doi":"10.1007/978-3-642-29599-7_5","title":"Emergence and Cellular Automata","year":2012,"lang":"en","type":"book-chapter","venue":"˜The œfrontiers collection","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Cellular automaton; Computer science; Artificial intelligence","score_opus":0.01201106884874264,"score_gpt":0.2001399157764273,"score_spread":0.18812884692768467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44128177","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.0021878423,0.17795394,0.04974701,0.0043353913,0.004046926,0.000046232373,0.00021453894,0.00031599277,0.7611521],"genre_scores_gemma":[0.07416966,0.12798236,0.02151262,0.0017977485,0.005105066,0.00022926515,0.00048146964,0.0004623581,0.76825947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998323,0.00004129424,0.00000765777,0.000034273395,0.00006824638,0.000016255666],"domain_scores_gemma":[0.9998404,0.00008225104,0.00000799961,0.000023676916,0.000033881348,0.000011822973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020438779,0.0011038817,0.00083972875,0.0015527273,0.00084334356,0.0026530481,0.0006618813,0.00094109395,0.018440472],"category_scores_gemma":[0.0007188582,0.00037760063,0.00042527544,0.00207715,0.001649867,0.0030148048,0.00097497,0.0019441212,0.006677055],"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.000007786253,0.000018995092,0.00007077618,0.00021476639,0.00000841515,0.000052723404,0.0002499859,0.0015543004,0.0003681036,0.7720517,0.12062904,0.10477343],"study_design_scores_gemma":[0.0000032518324,0.000008510028,0.00013161641,0.00013085797,0.0000056675335,0.00012827801,0.00008233455,0.0017682597,0.00027503134,0.4755378,0.5219189,0.000009504158],"about_ca_topic_score_codex":0.001593579,"about_ca_topic_score_gemma":0.002845252,"teacher_disagreement_score":0.018440472,"about_ca_system_score_codex":0.0014638397,"about_ca_system_score_gemma":0.0008096228,"threshold_uncertainty_score":0.061689556},"labels":[],"label_agreement":null},{"id":"W4413186452","doi":"10.55016/ojs/cdm.v7i1.62107","title":"Monochromatic even cycles","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Biology; Botany","score_opus":0.01470262452217187,"score_gpt":0.29740589687461466,"score_spread":0.2827032723524428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6716528,0.0024692633,0.17101598,0.0010432889,0.00043138722,0.0001840954,0.0013024207,0.0007843864,0.15111639],"genre_scores_gemma":[0.9291778,0.0010365419,0.047607433,0.0006698794,0.00009950213,0.00012638139,0.00056286703,0.0001463661,0.020573253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993131,0.0001039575,0.000032184696,0.00019533008,0.00011264029,0.00024269424],"domain_scores_gemma":[0.99900997,0.00028255823,0.00018340934,0.00025730996,0.00015653236,0.0001102669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028515013,0.00065377535,0.000492624,0.00046792402,0.00095534953,0.0008781533,0.00076876936,0.00046020214,0.008511866],"category_scores_gemma":[0.0012206092,0.00039572662,0.00048379716,0.0004887911,0.00068127335,0.001341144,0.0013521372,0.0007172651,0.0014059928],"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.000837139,0.00017238985,0.004539034,0.0009986596,0.00009440924,0.0016166026,0.0009889877,0.013497589,0.104738116,0.75692177,0.017018342,0.09857698],"study_design_scores_gemma":[0.00024029831,0.00051331,0.006739014,0.00028023502,0.00015109863,0.002477181,0.0008351222,0.051583767,0.13282798,0.6769438,0.12727714,0.00013106686],"about_ca_topic_score_codex":0.0018648942,"about_ca_topic_score_gemma":0.0023519124,"teacher_disagreement_score":0.008511866,"about_ca_system_score_codex":0.0006175484,"about_ca_system_score_gemma":0.00051947986,"threshold_uncertainty_score":0.028475046},"labels":[],"label_agreement":null},{"id":"W4414112189","doi":"10.1007/s00233-025-10571-w","title":"Thin MC left regular bands","year":2025,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universidad de Sevilla","keywords":"Adjacency list; Adjacency matrix; Partially ordered set; Regular semigroup; Regular graph; Two-graph; Graph energy; Graph","score_opus":0.003934989868878947,"score_gpt":0.2245916907316437,"score_spread":0.22065670086276476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414112189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79508483,0.00033856306,0.16710728,0.0002590457,0.000070717775,0.000047199752,0.00021363537,0.00044263428,0.03643606],"genre_scores_gemma":[0.97198343,0.00007067937,0.02303354,0.000060070215,0.000030426894,0.000046555655,0.00010079324,0.00006382147,0.0046106065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997414,0.000048927115,0.000011127394,0.000062590494,0.00006864093,0.00006740329],"domain_scores_gemma":[0.9993206,0.00019900582,0.0001454413,0.00013426566,0.000091370806,0.000109313165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021351752,0.00019605157,0.00027688555,0.00075975014,0.0007292663,0.001023098,0.00042296445,0.0003735582,0.005669153],"category_scores_gemma":[0.0007828921,0.00024232731,0.00032936898,0.00029338067,0.0013092584,0.001112698,0.0006162267,0.00058639806,0.0005111887],"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.00014368688,0.000027028105,0.0021394414,0.0000817048,0.000013719506,0.00053839793,0.0006095442,0.0075636324,0.035296746,0.9375583,0.0015034056,0.014524342],"study_design_scores_gemma":[0.000046950263,0.000120314806,0.004603435,0.00007547764,0.000032551936,0.0013237488,0.0010034585,0.103743225,0.030896232,0.83679074,0.021307372,0.000056565732],"about_ca_topic_score_codex":0.0011127875,"about_ca_topic_score_gemma":0.0010598435,"teacher_disagreement_score":0.005669153,"about_ca_system_score_codex":0.00041811995,"about_ca_system_score_gemma":0.0002049862,"threshold_uncertainty_score":0.018965185},"labels":[],"label_agreement":null},{"id":"W4414117511","doi":"10.1017/9781108950855.005","title":"Memetic Grids","year":2025,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Formality; Variety (cybernetics); Narrative; Structuring; Sequence (biology); Presentation (obstetrics); Hierarchy; Politics","score_opus":0.015455591703459315,"score_gpt":0.19189622353272565,"score_spread":0.17644063182926634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414117511","genre_codex":"other","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.0027687815,0.0035020073,0.026019474,0.0025560148,0.0012700837,0.00005623031,0.0001697398,0.0005994966,0.96305823],"genre_scores_gemma":[0.12633209,0.0063298354,0.023951635,0.0014460824,0.00075119594,0.00023429416,0.00036004727,0.0006466735,0.8399481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997125,0.00010192111,0.000011980318,0.000040924944,0.00010192578,0.000030674935],"domain_scores_gemma":[0.99964094,0.00016624136,0.000016320257,0.000079172874,0.000057337787,0.00003993534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045719102,0.0006040757,0.00024590464,0.0010950029,0.0018633512,0.0038242275,0.0009000946,0.00089341286,0.05866972],"category_scores_gemma":[0.0017054538,0.00025144726,0.00033071346,0.0011424446,0.0020875183,0.0042507104,0.0025302363,0.0013647206,0.010355722],"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.000018364064,0.000010358216,0.00007248154,0.00017388511,0.0000042958122,0.00008578942,0.002032076,0.0006388758,0.00040680316,0.8739143,0.065999694,0.056643173],"study_design_scores_gemma":[0.0000049560376,0.000009877344,0.00007388908,0.00009097835,0.0000021114543,0.00018059555,0.00078308734,0.00061842037,0.00040047907,0.07423301,0.92359793,0.0000046895257],"about_ca_topic_score_codex":0.0008930256,"about_ca_topic_score_gemma":0.001296405,"teacher_disagreement_score":0.05866972,"about_ca_system_score_codex":0.0014706287,"about_ca_system_score_gemma":0.00056139176,"threshold_uncertainty_score":0.19626975},"labels":[],"label_agreement":null},{"id":"W4414297522","doi":"10.21203/rs.3.rs-7547924/v1","title":"A 2D-CFT Factory: Critical Lattice Models from Competing Anyon Condensation in SymTO","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; High Energy Physics; Science and Technology Commission of Shanghai Municipality; Kavli Institute for Theoretical Physics, University of California, Santa Barbara; National Natural Science Foundation of China; Division of Mathematical Sciences; Government of Canada; National Science Foundation","keywords":"Central charge; Renormalization group; Critical phenomena; Lattice (music); Unitary state; Homogeneous space; Phase transition; Quantum; Critical line; Conformal field theory","score_opus":0.1271469241619265,"score_gpt":0.422075356763766,"score_spread":0.29492843260183954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414297522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6682165,0.0014991323,0.12790278,0.0050662737,0.0015545188,0.00020057459,0.00074297964,0.0013589188,0.19345823],"genre_scores_gemma":[0.9770726,0.00018280369,0.010064546,0.00049125956,0.00017647889,0.00010130185,0.00020785947,0.00024190178,0.011461239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958473,0.00011680711,0.00001810113,0.00006916456,0.000090736656,0.00012056003],"domain_scores_gemma":[0.9988802,0.00033063965,0.00010642944,0.000214316,0.00011781553,0.00035055794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008787911,0.0008368731,0.001673965,0.0013963006,0.0027144742,0.005741987,0.0018491283,0.0032161814,0.0101018865],"category_scores_gemma":[0.0023771147,0.0006988871,0.0012167351,0.00074421865,0.0032034698,0.0032451877,0.0022093293,0.0019452225,0.0011434115],"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.0001429222,0.00006119073,0.00037038195,0.0000542708,0.0000125169845,0.00028503008,0.00015684319,0.010774002,0.002512004,0.9810002,0.002873629,0.0017571369],"study_design_scores_gemma":[0.00010742812,0.000030716623,0.00020358978,0.000019716748,0.000010558457,0.00020067173,0.0001570941,0.12598531,0.0011839418,0.8706544,0.0014041667,0.000042436182],"about_ca_topic_score_codex":0.0017999645,"about_ca_topic_score_gemma":0.001975117,"teacher_disagreement_score":0.0101018865,"about_ca_system_score_codex":0.0017182244,"about_ca_system_score_gemma":0.0010746722,"threshold_uncertainty_score":0.033794165},"labels":[],"label_agreement":null},{"id":"W4414342577","doi":"10.7554/elife.108142.1.sa3","title":"eLife Assessment: Intrinsic and circuit mechanisms of predictive coding in a grid cell network model","year":2025,"lang":"en","type":"peer-review","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Grid; Grid cell; Topology (electrical circuits); Population; Corollary; Network topology; Coding (social sciences); Asymmetry; Hexagonal tiling","score_opus":0.02276419070275602,"score_gpt":0.28092517652609666,"score_spread":0.2581609858233406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414342577","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10566146,0.00055269717,0.824894,0.0030055025,0.00022463284,0.00012726177,0.00069233903,0.0011308533,0.06371117],"genre_scores_gemma":[0.8542333,0.0008310363,0.10922267,0.00022358497,0.00009269218,0.0002713704,0.00061678304,0.00025964648,0.03424898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974436,0.00006300481,0.000009587292,0.000044714307,0.00010210512,0.000036231093],"domain_scores_gemma":[0.9987639,0.00048086222,0.000093547926,0.00017700664,0.00036244874,0.00012224838],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0007659047,0.00020847817,0.0005174342,0.0006105827,0.00047384237,0.0010437707,0.0016240599,0.0009462165,0.01021038],"category_scores_gemma":[0.0057325345,0.0002767248,0.00034977455,0.0005034467,0.0007313692,0.0017954534,0.00094426225,0.0006904178,0.0018331732],"study_design_candidate":"not_applicable","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.00008882377,0.000024663825,0.0020673291,0.00009194598,0.000028438206,0.00034540019,0.00020680745,0.6063487,0.0033902286,0.32915375,0.008819371,0.049434472],"study_design_scores_gemma":[0.00001713345,0.0000114069835,0.00023557182,0.000010265761,0.000006557142,0.000057772093,0.000031317304,0.9277888,0.0007026312,0.06409899,0.0070317793,0.000007756426],"about_ca_topic_score_codex":0.0054629706,"about_ca_topic_score_gemma":0.0060025146,"teacher_disagreement_score":0.9992341,"about_ca_system_score_codex":0.0011405499,"about_ca_system_score_gemma":0.0015428975,"threshold_uncertainty_score":0.034157097},"labels":[],"label_agreement":null},{"id":"W4414565683","doi":"10.48550/arxiv.2504.20881","title":"Freezing Phase Transitions for Lattice Systems and Higher-Dimensional Subshifts","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Centre National de la Recherche Scientifique","keywords":"Phase transition; Subshift of finite type; Quasicrystal; Entropy (arrow of time); Inverse; Lattice (music); Context (archaeology); Inverse temperature","score_opus":0.06080394582397756,"score_gpt":0.3110325338820384,"score_spread":0.2502285880580608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414565683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8873023,0.0009413287,0.08097477,0.0006071027,0.0001406149,0.000041891723,0.00014539664,0.0002441665,0.029602481],"genre_scores_gemma":[0.97943556,0.00030276988,0.015934516,0.00009640171,0.000053235235,0.00005255224,0.00014766342,0.00006479108,0.0039124805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973243,0.00006306796,0.000016950959,0.00003831026,0.000079131794,0.00007017519],"domain_scores_gemma":[0.999676,0.000112079084,0.000055839624,0.000038108636,0.000033933655,0.00008394368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048147622,0.00046816672,0.00040601884,0.0009293619,0.00089077407,0.0014552161,0.00080706325,0.0005704614,0.003300447],"category_scores_gemma":[0.0010833116,0.00021407423,0.0006870548,0.00038907977,0.0023059906,0.0013076918,0.001027266,0.00095970527,0.00024258324],"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.000025388134,0.000022324262,0.00026238305,0.000031672065,0.0000070883225,0.00008033405,0.00022245725,0.008670425,0.003036169,0.98541945,0.00026831625,0.0019539976],"study_design_scores_gemma":[0.000030588475,0.00004156277,0.00036456663,0.000018102757,0.00000676914,0.000100904384,0.0001856723,0.072822206,0.0017596385,0.922714,0.0019286639,0.00002733878],"about_ca_topic_score_codex":0.003365192,"about_ca_topic_score_gemma":0.002430286,"teacher_disagreement_score":0.003365192,"about_ca_system_score_codex":0.0014161647,"about_ca_system_score_gemma":0.0006137786,"threshold_uncertainty_score":0.011041105},"labels":[],"label_agreement":null},{"id":"W4414772389","doi":"10.1007/978-3-032-01570-9_6","title":"On Gottschalk’s Surjunctivity Conjecture for Non-uniform Cellular Automata","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université de Montréal","funders":"","keywords":"Conjecture; Cellular automaton; Alphabet; Group (periodic table); Invertible matrix; Class (philosophy); Automata theory","score_opus":0.012309646755847278,"score_gpt":0.24145194286283944,"score_spread":0.22914229610699216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414772389","genre_codex":"other","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.30498344,0.005229974,0.20381752,0.007886199,0.0013211011,0.00012640796,0.00068822014,0.000611331,0.47533596],"genre_scores_gemma":[0.92415863,0.0017649281,0.015504795,0.0013450036,0.00045586645,0.00016605337,0.0005528023,0.00029286568,0.05575901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857473,0.00028497167,0.00008375035,0.00047830617,0.0002948603,0.00028335216],"domain_scores_gemma":[0.9963431,0.0023536172,0.00012715717,0.00062524044,0.00041195346,0.00013891667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014032585,0.0007179843,0.0013341493,0.0012893492,0.0035486124,0.004911888,0.0016762281,0.0022048852,0.008870751],"category_scores_gemma":[0.005892923,0.0010448064,0.002120437,0.0017511578,0.0061519016,0.01080574,0.0037496646,0.005380925,0.0013357456],"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.000028142063,0.000008916146,0.00012086616,0.000040973337,0.000007211905,0.000062137115,0.00021808445,0.0013208841,0.00024869543,0.99453485,0.0010762031,0.0023331346],"study_design_scores_gemma":[0.000008008251,0.0000052319483,0.000085462496,0.000013153379,0.0000072762714,0.000035493773,0.000055872573,0.001980609,0.0002950145,0.99504626,0.0024605712,0.0000070849774],"about_ca_topic_score_codex":0.0038800086,"about_ca_topic_score_gemma":0.0029176956,"teacher_disagreement_score":0.008870751,"about_ca_system_score_codex":0.0025115926,"about_ca_system_score_gemma":0.00095437566,"threshold_uncertainty_score":0.029675603},"labels":[],"label_agreement":null},{"id":"W4414772453","doi":"10.1007/978-3-032-01570-9_7","title":"Ternary Cellular Automata Induced by Semigroups of Order 3 are Solvable","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Commutative property; Cellular automaton; Order (exchange); Set (abstract data type); Function (biology); Automaton; State (computer science); Semigroup; Binary number; Ternary operation","score_opus":0.011213787947624647,"score_gpt":0.22940814145490554,"score_spread":0.2181943535072809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414772453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5056438,0.0007360697,0.2814867,0.0010303161,0.0006316461,0.00031108074,0.0018082886,0.0019572338,0.20639494],"genre_scores_gemma":[0.91589266,0.0004300526,0.025899839,0.00026116517,0.00018252117,0.0003959209,0.0011352528,0.00030606682,0.055496424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999398,0.000091941874,0.00005473032,0.000117477866,0.00016289807,0.00017502514],"domain_scores_gemma":[0.99820983,0.0009302221,0.0002755228,0.00015961722,0.00027507226,0.00014968262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034892693,0.0007339127,0.001071001,0.0009106224,0.0017629747,0.0038402337,0.0006704668,0.0012144077,0.01509636],"category_scores_gemma":[0.0020957792,0.0005216646,0.0015719628,0.00095736556,0.0015973145,0.0021954544,0.0014021551,0.0017864022,0.0024875351],"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.00012510818,0.00006841471,0.00022729216,0.0001238176,0.00001825582,0.00023968267,0.00068919675,0.0035166,0.00817547,0.9724472,0.002813159,0.011555641],"study_design_scores_gemma":[0.00008231466,0.00004859753,0.00022864334,0.000023008053,0.000017589698,0.00021968542,0.00029667196,0.018563664,0.008832515,0.9639047,0.0077510206,0.000031586456],"about_ca_topic_score_codex":0.0015874926,"about_ca_topic_score_gemma":0.00171886,"teacher_disagreement_score":0.01509636,"about_ca_system_score_codex":0.0012528122,"about_ca_system_score_gemma":0.0014433998,"threshold_uncertainty_score":0.05050236},"labels":[],"label_agreement":null},{"id":"W4415022614","doi":"10.3934/dcds.2025152","title":"Shifts of finite type obtained by forbidding a single pattern","year":2025,"lang":"en","type":"article","venue":"Discrete and Continuous Dynamical Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Representation (politics); Isomorphism (crystallography); Finite set; Sequence (biology); Type (biology); Class (philosophy); Space (punctuation); Set (abstract data type)","score_opus":0.006290616030153158,"score_gpt":0.22400127054258903,"score_spread":0.21771065451243587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415022614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7634362,0.0002618343,0.21213831,0.00037463993,0.00026792596,0.00006068021,0.00033657404,0.0007118508,0.022412013],"genre_scores_gemma":[0.9400785,0.00016609114,0.049204174,0.0002242304,0.00007200287,0.00016774761,0.00036676403,0.00019396588,0.009526394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996594,0.00003788746,0.000025671781,0.000118129836,0.00006462606,0.000094336116],"domain_scores_gemma":[0.9993304,0.00020276319,0.00013778794,0.00019248069,0.00006455946,0.00007192786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028241967,0.00035026693,0.00045167434,0.00068001007,0.0010224087,0.0009171431,0.00083290326,0.000901035,0.004178816],"category_scores_gemma":[0.0016428345,0.0003374149,0.00073190255,0.000546732,0.0014587707,0.0019212936,0.0012123816,0.00096041185,0.00076764275],"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.00044987915,0.00009312017,0.002210885,0.00014182701,0.00003298821,0.0007646789,0.00075441046,0.0097297495,0.07465645,0.86668366,0.0014529125,0.04302954],"study_design_scores_gemma":[0.000067673835,0.0001814133,0.0011534895,0.0000446487,0.000061470004,0.0005233518,0.00038471658,0.05342079,0.05314555,0.8815062,0.009437161,0.0000735647],"about_ca_topic_score_codex":0.0007299185,"about_ca_topic_score_gemma":0.0015212297,"teacher_disagreement_score":0.004178816,"about_ca_system_score_codex":0.0007166407,"about_ca_system_score_gemma":0.0004840456,"threshold_uncertainty_score":0.013979554},"labels":[],"label_agreement":null},{"id":"W4415515862","doi":"10.1007/978-3-032-07373-0_35","title":"AI-Driven Evolution: Bridging 5G and 6G for a Hyper-connected Future","year":2025,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","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":"Université de Moncton","funders":"","keywords":"Bridging (networking); Key (lock); Transformative learning; Implementation; Automation; Wireless","score_opus":0.016934256962361838,"score_gpt":0.269169888135471,"score_spread":0.25223563117310915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415515862","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.018079547,0.006801434,0.44313878,0.013594575,0.0017350778,0.0000964821,0.00024676556,0.0009193358,0.515388],"genre_scores_gemma":[0.5635994,0.010663313,0.25918657,0.0036278726,0.0009912284,0.0002588485,0.00054051715,0.0005630666,0.16056927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999668,0.00011337793,0.0000150508695,0.000056119883,0.0000953815,0.000052212796],"domain_scores_gemma":[0.9993736,0.00025264465,0.000029237655,0.00012400947,0.00011888402,0.00010165227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074893347,0.0003643932,0.0003026945,0.00061710563,0.0010192537,0.0031373403,0.0010894476,0.001511132,0.015823284],"category_scores_gemma":[0.0017841621,0.00024435393,0.00037986733,0.0010695512,0.00195669,0.0042404854,0.0021348433,0.0018291841,0.0032825947],"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.00002247538,0.0000119162705,0.00012564761,0.00006683718,0.000009320073,0.00007438832,0.000259369,0.0049165497,0.0010768174,0.92303604,0.01018808,0.06021254],"study_design_scores_gemma":[0.00000842994,0.000025693058,0.00011992043,0.00009440341,0.000011451898,0.00015113041,0.00020286127,0.027504217,0.0010033511,0.7721719,0.19869292,0.000013667153],"about_ca_topic_score_codex":0.0020304932,"about_ca_topic_score_gemma":0.0023635982,"teacher_disagreement_score":0.015823284,"about_ca_system_score_codex":0.0014785215,"about_ca_system_score_gemma":0.0011938761,"threshold_uncertainty_score":0.05293411},"labels":[],"label_agreement":null},{"id":"W572185325","doi":"10.1017/cbo9780511819407","title":"Entropy of Hidden Markov Processes and Connections to Dynamical Systems","year":2011,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov chain; Statistical physics; Computer science; Entropy (arrow of time); Information theory; Markov process; Markov model; Theoretical computer science; Entropy rate; Markov kernel; Dynamical systems theory; Hidden Markov model; Variable-order Markov model; Maximum-entropy Markov model; Mathematics; Principle of maximum entropy; Artificial intelligence; Machine learning; Physics; Statistics; Binary entropy function; Quantum mechanics","score_opus":0.014593131419462526,"score_gpt":0.19179967568495376,"score_spread":0.17720654426549123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W572185325","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.117362775,0.110701166,0.49084282,0.010642766,0.001659556,0.00009405006,0.0012222104,0.0004720521,0.26700255],"genre_scores_gemma":[0.88777786,0.036074825,0.036083885,0.00057062757,0.001989162,0.00013899773,0.00046817746,0.00013405093,0.036762312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999652,0.00009090309,0.000016023543,0.000061002218,0.00015799384,0.000022037648],"domain_scores_gemma":[0.9983955,0.0013006995,0.00007690436,0.0000983708,0.000088970686,0.000039533854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056206825,0.00041623335,0.0004180759,0.001087777,0.0003214718,0.0011943216,0.00046270833,0.00058375596,0.0027662907],"category_scores_gemma":[0.003379258,0.00029659295,0.00036505438,0.0011062936,0.0020682043,0.0022575809,0.00087437226,0.001391454,0.0003163401],"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.000009088253,0.000007793933,0.00025735368,0.00011781847,0.000014965758,0.00006619204,0.00013642413,0.0216968,0.00037513973,0.9585667,0.002234152,0.016517662],"study_design_scores_gemma":[0.0000020904465,0.0000053902495,0.000256882,0.000022973245,0.0000032082396,0.00003964718,0.000009335589,0.02636779,0.0000816091,0.9683036,0.004902469,0.000004986003],"about_ca_topic_score_codex":0.000706165,"about_ca_topic_score_gemma":0.00052675366,"teacher_disagreement_score":0.0027662907,"about_ca_system_score_codex":0.0010959223,"about_ca_system_score_gemma":0.00057696935,"threshold_uncertainty_score":0.009254158},"labels":[],"label_agreement":null},{"id":"W589855758","doi":"10.1007/978-3-662-47221-7_6","title":"A Cellular Automaton for Blocking Queen Games","year":2015,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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":"Dalhousie University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Blocking (statistics); Cellular automaton; Computer science; Automaton; Chaotic; Combinatorial game theory; Value (mathematics); Type (biology); Combinatorics; Mathematics; Mathematical economics; Sequential game; Game theory; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.02142304767723925,"score_gpt":0.2766106330834699,"score_spread":0.25518758540623065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W589855758","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.21744864,0.0004568606,0.709886,0.0013247473,0.00031066049,0.00020335575,0.0011382034,0.0007604486,0.068471074],"genre_scores_gemma":[0.8724956,0.00042597932,0.09188421,0.00026615584,0.000057888392,0.00038815517,0.0005583715,0.0001644446,0.033759158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994999,0.00012328316,0.000033201788,0.000101103076,0.000108835506,0.00013364048],"domain_scores_gemma":[0.99882454,0.00055958,0.00007333819,0.00015999543,0.00020951826,0.00017299465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039465952,0.00054414244,0.0011825592,0.0005209059,0.0017386747,0.002478913,0.0017840381,0.0015033573,0.009107447],"category_scores_gemma":[0.0019615858,0.00051583844,0.0011292509,0.000659773,0.0016758961,0.0011663751,0.0018904301,0.001466059,0.0011648302],"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.00014846052,0.000042152355,0.00044925732,0.000076797616,0.000026677784,0.00018021617,0.00031700704,0.100994274,0.0046611223,0.88346344,0.0024482477,0.007192417],"study_design_scores_gemma":[0.000071659095,0.000037761547,0.00012361867,0.000020512121,0.000024536548,0.000058317026,0.00009515804,0.57371426,0.0010463063,0.42039868,0.004380291,0.000028920193],"about_ca_topic_score_codex":0.013722907,"about_ca_topic_score_gemma":0.012263752,"teacher_disagreement_score":0.013722907,"about_ca_system_score_codex":0.0021954745,"about_ca_system_score_gemma":0.0026241615,"threshold_uncertainty_score":0.03046745},"labels":[],"label_agreement":null},{"id":"W6884563285","doi":"10.1051/ita:2004004/pdf","title":"On the equivalence of linear conjunctive grammars and trellis automata","year":2004,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Equivalence (formal languages); Rule-based machine translation; Deterministic context-free grammar; Logical equivalence; Turing machine; Embedded pushdown automaton; Trellis (graph); Automaton; Class (philosophy)","score_opus":0.015616629582193588,"score_gpt":0.23689209664966832,"score_spread":0.22127546706747472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6884563285","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.119828865,0.002532427,0.7049638,0.0030559194,0.00068744586,0.00017279314,0.00049043924,0.0009239592,0.16734445],"genre_scores_gemma":[0.89595157,0.0020906695,0.08398818,0.0011050706,0.0007773978,0.00023366394,0.00066337694,0.00041887444,0.0147710955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971029,0.0006702973,0.00019232712,0.00065577694,0.00096171914,0.00041698213],"domain_scores_gemma":[0.99145305,0.006246566,0.0004532428,0.0007057401,0.0009017928,0.00023953641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002054158,0.00043855785,0.00070422504,0.0010324253,0.0017707876,0.0028439425,0.0013299526,0.0012029009,0.0063496833],"category_scores_gemma":[0.0118084615,0.0004337801,0.0012208888,0.0012045663,0.0057236566,0.006786971,0.002614584,0.0031615007,0.00087026495],"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.00002766158,0.00002198773,0.00012547857,0.00002338714,0.0000054560637,0.00013044449,0.0003893972,0.0034778414,0.0008739061,0.98615324,0.0005169786,0.008254125],"study_design_scores_gemma":[0.00001113692,0.000020333307,0.00012842493,0.000014398768,0.000006215293,0.00010119892,0.00005642671,0.012483452,0.0011190376,0.98230666,0.0037392115,0.000013473875],"about_ca_topic_score_codex":0.0033164143,"about_ca_topic_score_gemma":0.0014845647,"teacher_disagreement_score":0.0063496833,"about_ca_system_score_codex":0.0016764252,"about_ca_system_score_gemma":0.0009921101,"threshold_uncertainty_score":0.021241784},"labels":[],"label_agreement":null},{"id":"W6929251499","doi":"10.48550/arxiv.1208.2758","title":"On the Parity Problem in One-Dimensional Cellular Automata","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Parity (physics); Cellular automaton; Existential quantification; RADIUS; Lattice (music)","score_opus":0.0828053779651888,"score_gpt":0.18518234633307196,"score_spread":0.10237696836788315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929251499","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.32801372,0.0005595695,0.6451214,0.0016502343,0.0001981977,0.0001107156,0.000111451016,0.00063667115,0.023597991],"genre_scores_gemma":[0.8688591,0.0003786878,0.12465565,0.00034187848,0.00007579392,0.00019484555,0.00015818593,0.00020199572,0.005133844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870944,0.00048517465,0.00012633023,0.000235157,0.0002859663,0.00015794681],"domain_scores_gemma":[0.99329656,0.00460265,0.00039886864,0.00080551556,0.00057859975,0.0003178221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021152594,0.00043690024,0.00092972897,0.0005706675,0.0013919789,0.0017691415,0.0015087445,0.0019558559,0.0022740902],"category_scores_gemma":[0.017067406,0.00040280208,0.00096360565,0.00044189757,0.0043896013,0.0033662303,0.0027417946,0.0018698535,0.000471339],"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.00016783284,0.0000577883,0.0019941109,0.0001658951,0.00002722644,0.00041449023,0.00055786024,0.20751312,0.006111499,0.76061344,0.0010625409,0.021314232],"study_design_scores_gemma":[0.00003872433,0.00006105897,0.000118745564,0.000024783008,0.000011119271,0.00010965582,0.000088774555,0.3829316,0.0033032808,0.61229134,0.000997219,0.000023748864],"about_ca_topic_score_codex":0.001590536,"about_ca_topic_score_gemma":0.00088732416,"teacher_disagreement_score":0.0022740902,"about_ca_system_score_codex":0.0009857763,"about_ca_system_score_gemma":0.0008063564,"threshold_uncertainty_score":0.011186719},"labels":[],"label_agreement":null},{"id":"W6931020151","doi":"10.5281/zenodo.16876450","title":"Malirekus iroquois Stark & Szczytko 1988","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nova scotia; West virginia; Period (music); STREAMS; State (computer science)","score_opus":0.020360138060078914,"score_gpt":0.24176783229125134,"score_spread":0.22140769423117243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931020151","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61785734,0.012587055,0.015387129,0.001261425,0.0003129579,0.00036070152,0.0032405404,0.0006416962,0.3483511],"genre_scores_gemma":[0.9762064,0.0017440997,0.003966062,0.00030326124,0.00005938679,0.000079511665,0.00075573154,0.000018616018,0.01686702],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99990094,0.000006194127,0.000007213834,0.000043888245,0.00002504651,0.000016610127],"domain_scores_gemma":[0.99993885,0.000009672601,0.000024821982,0.0000068259733,0.000011201467,0.000008687306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069307105,0.0003529916,0.0001721725,0.00096793537,0.0008039488,0.000400558,0.00037988203,0.00031382253,0.008381016],"category_scores_gemma":[0.00017376256,0.00016562309,0.00013862252,0.0003421569,0.00040366754,0.00062940305,0.0007641048,0.000448633,0.0016446069],"study_design_candidate":"not_applicable","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.00062777504,0.00017061074,0.088350065,0.0013360354,0.00010442023,0.0025674105,0.002569882,0.0023480433,0.07543128,0.014410845,0.022754375,0.7893293],"study_design_scores_gemma":[0.000053985867,0.00021459223,0.5658665,0.0005077129,0.000112077236,0.0060636015,0.0015027192,0.0016602214,0.010043142,0.0028971308,0.4110303,0.000048078942],"about_ca_topic_score_codex":0.0041141137,"about_ca_topic_score_gemma":0.013978702,"teacher_disagreement_score":0.008381016,"about_ca_system_score_codex":0.0005437005,"about_ca_system_score_gemma":0.00019135392,"threshold_uncertainty_score":0.02803725},"labels":[],"label_agreement":null},{"id":"W6931405252","doi":"10.5281/zenodo.6350809","title":"li-lab-mcgill/covid-npi: EpiTopic release","year":2022,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Action (physics); Context (archaeology); Identification (biology); Perspective (graphical)","score_opus":0.02864921633525481,"score_gpt":0.24064347478113615,"score_spread":0.21199425844588135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931405252","genre_codex":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035297743,0.0012449332,0.04596764,0.0018174563,0.0015611864,0.0004196234,0.1588778,0.09374742,0.6928342],"genre_scores_gemma":[0.024758544,0.0011404838,0.02126913,0.00086795964,0.00027754952,0.00086951716,0.17485775,0.07498481,0.70097435],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896455,0.000085008105,0.000031661435,0.00016646842,0.00062306557,0.00012928323],"domain_scores_gemma":[0.99814,0.00019270406,0.000066123175,0.000757162,0.0004869523,0.00035714894],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015273839,0.0014869764,0.0014251942,0.0013688013,0.0012581587,0.0028322765,0.003941369,0.0018083776,0.49575472],"category_scores_gemma":[0.0023019176,0.001035801,0.00071902195,0.0019757855,0.0005241832,0.0024292264,0.0021881224,0.002332054,0.55684763],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00026399636,0.00004181066,0.00015155772,0.00028141987,0.000015845264,0.00006038434,0.00005039828,0.00044809797,0.01419506,0.008582534,0.9458408,0.03006812],"study_design_scores_gemma":[0.000054581706,0.000037130514,0.000221147,0.00002382918,0.00000890304,0.00007713634,0.000016510776,0.0013527995,0.014645257,0.0014903733,0.9820456,0.000026733982],"about_ca_topic_score_codex":0.0067822863,"about_ca_topic_score_gemma":0.008245669,"teacher_disagreement_score":0.49575472,"about_ca_system_score_codex":0.0020523416,"about_ca_system_score_gemma":0.0013322606,"threshold_uncertainty_score":0.7192447},"labels":[],"label_agreement":null},{"id":"W6931486088","doi":"10.5281/zenodo.4679649","title":"Extraordinarily rapid proliferation of cultured muscle satellite cells from migratory birds","year":2021,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Diafiltration; Hyporeflexia; Proteogenomics; Fusible alloy","score_opus":0.023718711895638248,"score_gpt":0.226453815907409,"score_spread":0.20273510401177075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931486088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98090667,0.0020980276,0.011371978,0.000050893705,0.000042898057,0.000034170243,0.0007697343,0.000095819654,0.0046296977],"genre_scores_gemma":[0.971536,0.0013241326,0.016538411,0.0000645406,0.000026358393,0.00008064991,0.0037633963,0.000057317335,0.006609143],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998425,0.000016994538,0.000022093407,0.000057688347,0.000041108335,0.000019587082],"domain_scores_gemma":[0.9998599,0.00005821555,0.000014263519,0.000018955907,0.000030776046,0.00001780084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016836016,0.00016938281,0.00019333535,0.00025360403,0.0001708912,0.0002799853,0.00015897815,0.00013345042,0.0010154059],"category_scores_gemma":[0.00018413962,0.00007700792,0.00011906489,0.00021366538,0.000120118835,0.00012319436,0.0001944038,0.00015954397,0.0005919529],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00008817024,0.000013189053,0.002010216,0.000041243336,0.000007007619,0.00006885551,0.00010275873,0.000113462076,0.9912766,0.000047461053,0.00007127501,0.0061597554],"study_design_scores_gemma":[0.00000961884,0.00027490797,0.034236323,0.000013090769,0.000033653385,0.0004601612,0.00014584108,0.002098319,0.95686907,0.000055615266,0.005793898,0.000009502362],"about_ca_topic_score_codex":0.0016604672,"about_ca_topic_score_gemma":0.0031538892,"teacher_disagreement_score":0.0016604672,"about_ca_system_score_codex":0.00012924697,"about_ca_system_score_gemma":0.00009325062,"threshold_uncertainty_score":0.003396809},"labels":[],"label_agreement":null},{"id":"W6984965493","doi":"","title":"Dayton, Ohio","year":2009,"lang":"en","type":"other","venue":"OhioLink ETD Center (Ohio Library and Information Network)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Woodland; George (robot); Work (physics); Probate","score_opus":0.0068396132643690774,"score_gpt":0.19540416582908804,"score_spread":0.18856455256471896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6984965493","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.0010279355,0.0008768333,0.00026639528,0.00093646423,0.0008987181,0.0000356121,0.0022810847,0.00024182416,0.99343514],"genre_scores_gemma":[0.0023949472,0.00062304357,0.00017726017,0.0002477788,0.00006113026,0.0000206348,0.00064876245,0.00010129835,0.99572504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994081,0.000032626645,0.000021386692,0.0002533671,0.0001992635,0.00008516735],"domain_scores_gemma":[0.9993955,0.000076412776,0.000031790336,0.00006865894,0.00020771203,0.00022001432],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00031878697,0.0012202116,0.0005594472,0.00091438706,0.0041194237,0.0048431545,0.0008799122,0.0018592107,0.83825207],"category_scores_gemma":[0.0009902786,0.0005786573,0.00040685208,0.00148798,0.0006927519,0.002260086,0.002215639,0.0021886046,0.5237564],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00012330676,0.00019626008,0.0012009713,0.00013272911,0.000010164273,0.00046053462,0.00025246912,0.00014028644,0.0009683606,0.012101974,0.8420926,0.14232035],"study_design_scores_gemma":[0.000012923303,0.000014437308,0.00093988917,0.00005748976,0.000002689932,0.00007904699,0.00016542317,0.000055855697,0.00012623786,0.0004949352,0.99804497,0.0000061515757],"about_ca_topic_score_codex":0.01642948,"about_ca_topic_score_gemma":0.06541152,"teacher_disagreement_score":0.16174793,"about_ca_system_score_codex":0.0016269587,"about_ca_system_score_gemma":0.002505244,"threshold_uncertainty_score":0.23071373},"labels":[],"label_agreement":null},{"id":"W6999025431","doi":"","title":"The cell-transmission model : a new look at a dynamic network loading model","year":2000,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Artificial neural network; Control theory (sociology); Component (thermodynamics); Work (physics); Stability (learning theory); Context (archaeology); System dynamics","score_opus":0.0025973294787473133,"score_gpt":0.1399175231288079,"score_spread":0.1373201936500606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999025431","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.046225503,0.0034795846,0.7234788,0.015199793,0.000891065,0.00009514257,0.0014525084,0.0006566797,0.20852087],"genre_scores_gemma":[0.8086162,0.0070434245,0.04395961,0.0018274365,0.000888188,0.00017096361,0.0008011623,0.00076094887,0.13593206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961925,0.00010075236,0.000010718513,0.00006641153,0.0001295833,0.00007328352],"domain_scores_gemma":[0.9992536,0.0002808916,0.000058027807,0.000091654845,0.00020320773,0.000112603724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006616378,0.00090010226,0.0013910169,0.00074575393,0.0011156253,0.003559746,0.0037798295,0.002557149,0.011706308],"category_scores_gemma":[0.00290421,0.00065310556,0.0007662015,0.0017649906,0.0024250308,0.004934966,0.0011650681,0.0027122188,0.0019019091],"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.000023587016,0.000035349058,0.00031265334,0.00004150778,0.000017495833,0.00010086031,0.00013322452,0.43758276,0.0005490034,0.54194117,0.011565396,0.00769697],"study_design_scores_gemma":[0.000012515239,0.000010755936,0.0001251385,0.000019903267,0.000018066066,0.000053821343,0.00007138552,0.8335029,0.00010315202,0.15841989,0.007640311,0.000022085162],"about_ca_topic_score_codex":0.10441011,"about_ca_topic_score_gemma":0.07860675,"teacher_disagreement_score":0.10441011,"about_ca_system_score_codex":0.0039849663,"about_ca_system_score_gemma":0.0037369751,"threshold_uncertainty_score":0.20760477},"labels":[],"label_agreement":null},{"id":"W7017904025","doi":"","title":"Cellular Automata technique for computational electromagnetics","year":2002,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Bibliographical Society of Canada","funders":"","keywords":"Cellular automaton; Partial differential equation; Electromagnetic field; Computational electromagnetics; Lattice gas automaton; Scalar (mathematics); Electromagnetics; Automaton; Simple (philosophy); Differential equation","score_opus":0.011496941966398038,"score_gpt":0.20389958310418513,"score_spread":0.1924026411377871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017904025","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.00192319,0.0059913727,0.962666,0.0008056494,0.000756988,0.00010157058,0.00034913508,0.0010059726,0.026400147],"genre_scores_gemma":[0.18769385,0.011824566,0.753418,0.0007069901,0.0009146204,0.0010370603,0.0010839077,0.00039562676,0.042925432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954,0.00012580765,0.000036659527,0.00008872828,0.00017630689,0.000032514585],"domain_scores_gemma":[0.99959344,0.0001861998,0.000026038326,0.000077486126,0.000097706456,0.000019051535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038761392,0.0007750641,0.001081284,0.0011438968,0.0006489299,0.0016632685,0.0013648187,0.0011960173,0.0066417796],"category_scores_gemma":[0.0015606306,0.0003365876,0.0012725792,0.0013129395,0.0009637985,0.0011930753,0.0012433744,0.0027742682,0.002828328],"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.000021221746,0.000015825744,0.00024052376,0.0002272699,0.000043763008,0.00016050982,0.00014125902,0.11024205,0.0034331004,0.8138155,0.01007109,0.061588034],"study_design_scores_gemma":[0.000016503165,0.000029086053,0.00014100398,0.00008577515,0.000019867393,0.00017469133,0.000043445187,0.59951454,0.0015455304,0.29841012,0.09999031,0.00002909174],"about_ca_topic_score_codex":0.0028774752,"about_ca_topic_score_gemma":0.002534552,"teacher_disagreement_score":0.0066417796,"about_ca_system_score_codex":0.0010117404,"about_ca_system_score_gemma":0.0010207498,"threshold_uncertainty_score":0.022218943},"labels":[],"label_agreement":null},{"id":"W7023468400","doi":"","title":"Oman pääoman määrittely kansallisissa ja kansainvälisissä \\ttilinpäätösstandardeissa sekä standardien soveltaminen Suomen suurimmissa osuustoimintayrityksissä","year":2013,"lang":"fi","type":"other","venue":"Tampere University Institutional Repository (Tampere University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Population; Quarter (Canadian coin)","score_opus":0.00918549413660702,"score_gpt":0.18418071657079843,"score_spread":0.1749952224341914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023468400","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.041770235,0.007038729,0.008279725,0.0277373,0.005557143,0.00018303795,0.0014367765,0.0010262965,0.90697086],"genre_scores_gemma":[0.10231013,0.004738175,0.008101563,0.0044370624,0.000806957,0.0001250298,0.0013810286,0.0009538695,0.87714624],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973859,0.00035028247,0.00014202406,0.00049718394,0.0012036421,0.00042094634],"domain_scores_gemma":[0.99778914,0.0003046489,0.0001799039,0.00020981129,0.0011603506,0.00035623077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018904894,0.00057521503,0.00039269056,0.00099784,0.0033448932,0.0077880975,0.0009287065,0.0017341576,0.08481369],"category_scores_gemma":[0.0038760498,0.00034551942,0.0004572702,0.001371123,0.0014365988,0.0035535155,0.003612074,0.0031001682,0.036638167],"study_design_candidate":"not_applicable","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.00056955696,0.0003552694,0.011863751,0.0012138224,0.000062579275,0.0010938544,0.015026088,0.00039006263,0.019748311,0.17097187,0.31845552,0.46024942],"study_design_scores_gemma":[0.000003885571,0.000021694597,0.0025020328,0.00011756993,0.0000072333155,0.00013411076,0.0016714933,0.00004965062,0.0013620718,0.0013565125,0.99275935,0.000014335124],"about_ca_topic_score_codex":0.011231876,"about_ca_topic_score_gemma":0.022718022,"teacher_disagreement_score":0.08481369,"about_ca_system_score_codex":0.0031091487,"about_ca_system_score_gemma":0.0060577197,"threshold_uncertainty_score":0.28373003},"labels":[],"label_agreement":null},{"id":"W7024402324","doi":"","title":"Ryan Meili Kids’ Press Conference on Covid-19.","year":2020,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Subject (documents); Exposition (narrative)","score_opus":0.01719461848788407,"score_gpt":0.21742377399395993,"score_spread":0.20022915550607587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024402324","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.0002824739,0.0044970037,0.00023828237,0.009322716,0.01331738,0.000083773666,0.0029889029,0.00056461466,0.96870494],"genre_scores_gemma":[0.00043483416,0.0005467523,0.000058221292,0.0006018937,0.00022494813,0.000019463918,0.00046986682,0.00013611357,0.9975078],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899644,0.000097378324,0.000031155938,0.00017399475,0.0004474446,0.00025360522],"domain_scores_gemma":[0.997551,0.00022949521,0.000065024884,0.00010101108,0.0009455085,0.001107948],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011601145,0.001443725,0.00069456454,0.0012400504,0.0027729415,0.005822863,0.0013622949,0.0026448597,0.7671935],"category_scores_gemma":[0.0026977719,0.0004911103,0.0005728121,0.0010342071,0.0006510411,0.0031387617,0.0035317857,0.0036463677,0.59788084],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000008519209,0.0000050848644,0.00001865192,0.000017256229,4.2859196e-7,0.000014314992,0.000011081661,0.0000064180094,0.000020521711,0.00059578294,0.9942121,0.005089775],"study_design_scores_gemma":[0.0000020686412,0.0000046017967,0.0001307608,0.000038267768,4.313292e-7,0.000011342881,0.000053711075,0.000005905996,0.000018931658,0.00007922546,0.9996518,0.0000028837487],"about_ca_topic_score_codex":0.034720693,"about_ca_topic_score_gemma":0.15565856,"teacher_disagreement_score":0.7671935,"about_ca_system_score_codex":0.0024175537,"about_ca_system_score_gemma":0.003270757,"threshold_uncertainty_score":0.33207017},"labels":[],"label_agreement":null},{"id":"W7024766739","doi":"","title":"Strengthening Skills and Education for Innovation","year":2015,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Workforce; Economic shortage; China; Human resources; Aging in the American workforce; Productivity; Workforce development; Quarter (Canadian coin); Knowledge economy","score_opus":0.022409892476626066,"score_gpt":0.2864652690473181,"score_spread":0.26405537657069206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024766739","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.011183609,0.020074705,0.013397253,0.2245335,0.0048200283,0.00024170743,0.00030102587,0.00054628175,0.7249019],"genre_scores_gemma":[0.49319386,0.056287963,0.042025506,0.095064245,0.0039210627,0.0006429353,0.0005946222,0.0003532514,0.30791664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99591714,0.0012317647,0.00015738179,0.0004979304,0.0011203041,0.0010755134],"domain_scores_gemma":[0.99231577,0.0018113311,0.00071305514,0.00078870554,0.0012787252,0.00309236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005121763,0.0006742201,0.00043306657,0.001975744,0.003737456,0.008877822,0.0010791266,0.0044839405,0.049663868],"category_scores_gemma":[0.00916126,0.00022627099,0.00071867876,0.0014456002,0.0071822996,0.0092558665,0.013926868,0.0049284934,0.0115954215],"study_design_candidate":"not_applicable","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.000028280685,0.00018484372,0.0016155402,0.0011875393,0.000038546037,0.00017519806,0.0038437897,0.0002885268,0.0007019223,0.57930285,0.15790856,0.2547244],"study_design_scores_gemma":[0.000016922279,0.00007464587,0.0018214145,0.0015827953,0.000015240404,0.00017081283,0.0014049038,0.00018919035,0.00048811935,0.20030144,0.79391736,0.000017226215],"about_ca_topic_score_codex":0.0023577216,"about_ca_topic_score_gemma":0.0040664338,"teacher_disagreement_score":0.049663868,"about_ca_system_score_codex":0.0041045793,"about_ca_system_score_gemma":0.019411586,"threshold_uncertainty_score":0.16614223},"labels":[],"label_agreement":null},{"id":"W7027273325","doi":"","title":"Comment les enseignants ont-il vécu l’implantation du programme d’HEC et d’HQC de troisième secondaire et dans quelle mesure cela les a-t-il amené à modifier leurs pratiques d’enseignement?","year":2022,"lang":"fr","type":"other","venue":"Constellation (Université du Québec à Chicoutimi)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Secondary education; Curriculum; Wish","score_opus":0.029513165488689038,"score_gpt":0.22124014027640054,"score_spread":0.1917269747877115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027273325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5982477,0.0029476886,0.011049157,0.08509616,0.0012583605,0.00034953596,0.00043475608,0.00015714955,0.30045947],"genre_scores_gemma":[0.85610163,0.0009850623,0.0024657296,0.0036075888,0.00007373225,0.00017845359,0.00016695319,0.000114481816,0.13630635],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9940948,0.0023414353,0.00012384857,0.00053607393,0.0014695948,0.0014343434],"domain_scores_gemma":[0.9895201,0.0018711119,0.0005111344,0.00074067205,0.004483251,0.0028737113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076009184,0.00033299832,0.00038849824,0.0008394495,0.0095987115,0.009076164,0.0011582373,0.0018995174,0.014495144],"category_scores_gemma":[0.015616401,0.0002764466,0.000273646,0.0015032615,0.010302975,0.0046958067,0.0037291576,0.0043644807,0.0016258352],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003068709,0.0002180276,0.033744365,0.00037115184,0.000040152307,0.0007122955,0.47403485,0.0006299534,0.0018889005,0.34297666,0.033962768,0.11111408],"study_design_scores_gemma":[0.000045317778,0.00018887452,0.0619043,0.00073967886,0.000030714586,0.00019468485,0.32219177,0.0008496391,0.0017345253,0.013716359,0.5982821,0.00012200681],"about_ca_topic_score_codex":0.596121,"about_ca_topic_score_gemma":0.7348538,"teacher_disagreement_score":0.596121,"about_ca_system_score_codex":0.034012377,"about_ca_system_score_gemma":0.05494443,"threshold_uncertainty_score":0.812515},"labels":[],"label_agreement":null},{"id":"W7084393918","doi":"10.1007/978-3-032-02750-4_9","title":"Wastewater Recycling by Smart Technologies: Case Studies Around the World","year":2025,"lang":"en","type":"book-chapter","venue":"Springer water","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":"University of Calgary","funders":"","keywords":"Wastewater; Sustainability; Population; Natural resource; Raw water; Sewage treatment; Sanitation; Consumption (sociology); Water quality","score_opus":0.025340447461256268,"score_gpt":0.26052999932819787,"score_spread":0.2351895518669416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084393918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82014203,0.007644052,0.012440117,0.0017883008,0.000093786846,0.00021365329,0.0004948528,0.00014019303,0.15704295],"genre_scores_gemma":[0.925572,0.008418326,0.008348459,0.00023326016,0.000021910726,0.00006898446,0.00024221331,0.0000604123,0.05703444],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99946326,0.00019482899,0.000023973162,0.00005303119,0.00015625729,0.00010874385],"domain_scores_gemma":[0.9994855,0.00030771078,0.000048604248,0.00005184376,0.00007291214,0.000033391927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006201373,0.00046095665,0.00042072337,0.0009718488,0.0016110758,0.0025620235,0.0008411811,0.002263356,0.004643754],"category_scores_gemma":[0.0009778921,0.00016761439,0.000659067,0.00382097,0.001031142,0.0012374393,0.0012585812,0.00044531096,0.00083247514],"study_design_candidate":"observational","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.0008985584,0.001852563,0.027125409,0.0030886934,0.0001735867,0.027323402,0.015120467,0.072078526,0.020569531,0.08535871,0.04083959,0.70557094],"study_design_scores_gemma":[0.00016690699,0.0018723998,0.033848725,0.0009923016,0.00031760524,0.01059574,0.08199604,0.04419924,0.066758245,0.0473673,0.71167964,0.00020581014],"about_ca_topic_score_codex":0.010799004,"about_ca_topic_score_gemma":0.03489271,"teacher_disagreement_score":0.010799004,"about_ca_system_score_codex":0.0018532658,"about_ca_system_score_gemma":0.0008553165,"threshold_uncertainty_score":0.021472275},"labels":[],"label_agreement":null},{"id":"W7096654771","doi":"","title":"Fun With Tilings","year":2013,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Lemma (botany); Substitution tiling; Set (abstract data type); Hexagonal tiling; Square tiling; Section (typography)","score_opus":0.0036849836940343315,"score_gpt":0.16597761580545156,"score_spread":0.16229263211141723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096654771","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.0052035595,0.0029199694,0.62360865,0.002106694,0.0032283578,0.0002784489,0.0020470095,0.009025957,0.35158128],"genre_scores_gemma":[0.18530954,0.0031669782,0.5545683,0.004573083,0.0034444218,0.0013007197,0.0046317927,0.011776519,0.23122868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742126,0.0006645274,0.00020498215,0.00079484,0.00062343455,0.0002909724],"domain_scores_gemma":[0.998353,0.0007529422,0.00008211819,0.00041372326,0.00028321982,0.00011502307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001977969,0.002013286,0.0012522419,0.0020414656,0.0031677734,0.004773815,0.0021003005,0.0014602281,0.08002524],"category_scores_gemma":[0.0050700405,0.0013461078,0.0030581148,0.0015104718,0.00563305,0.011937993,0.0059064366,0.0048222994,0.025657913],"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.00003473185,0.000021115875,0.00013659899,0.000164337,0.0000122709735,0.00011568873,0.00041143323,0.00031470254,0.00046339017,0.9350828,0.021938514,0.041304424],"study_design_scores_gemma":[0.000016314298,0.000026845786,0.00006764275,0.00007445942,0.000014848234,0.0002782726,0.000071179755,0.00080282264,0.0010006337,0.6180562,0.3795691,0.000021652215],"about_ca_topic_score_codex":0.00080343295,"about_ca_topic_score_gemma":0.00090509024,"teacher_disagreement_score":0.08002524,"about_ca_system_score_codex":0.0016019805,"about_ca_system_score_gemma":0.00072650175,"threshold_uncertainty_score":0.2677111},"labels":[],"label_agreement":null},{"id":"W7097422868","doi":"","title":"Computing Entropy Maps of Finite-Automaton-Encoded Binary Images (Extended Abstract)","year":2007,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Entropy (arrow of time); Hausdorff dimension; Hausdorff distance; Pattern recognition (psychology); ENCODE; Image texture; Image (mathematics); Similitude","score_opus":0.0116680975457314,"score_gpt":0.2585281024975511,"score_spread":0.2468600049518197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097422868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6799126,0.00025413174,0.3159517,0.00014967528,0.00007880521,0.000036086953,0.0001815505,0.00073224114,0.0027032057],"genre_scores_gemma":[0.94533515,0.000051777904,0.053504776,0.00001540651,0.000010069878,0.00002093192,0.00012435713,0.000023077806,0.0009144514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990225,0.000017829898,0.000008387764,0.000019607913,0.000037964706,0.000013927423],"domain_scores_gemma":[0.99937063,0.00039819276,0.000052772924,0.000051757877,0.000093633775,0.000032969318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023006123,0.00016848928,0.0002704944,0.00054122123,0.00019988992,0.0005418125,0.00025874324,0.0002563628,0.0018860848],"category_scores_gemma":[0.0024151464,0.000116695686,0.00018296838,0.0003038102,0.0003877063,0.0006394123,0.0004053131,0.000211082,0.00016250351],"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.0016686162,0.00022681884,0.009268451,0.00039023175,0.00011655769,0.00080846564,0.0005421116,0.3635169,0.23097196,0.0785774,0.0017757161,0.31213686],"study_design_scores_gemma":[0.000022569104,0.00011786949,0.0030522882,0.000010690894,0.000014678602,0.000114668284,0.000051619583,0.9219193,0.05454407,0.019522967,0.0006116864,0.00001760534],"about_ca_topic_score_codex":0.00073842466,"about_ca_topic_score_gemma":0.0007229645,"teacher_disagreement_score":0.0018860848,"about_ca_system_score_codex":0.00043514164,"about_ca_system_score_gemma":0.00014409407,"threshold_uncertainty_score":0.0063096285},"labels":[],"label_agreement":null},{"id":"W7097687445","doi":"","title":"Partitionning the Golden Code: A framework to the design of Space-Time coded modulation,” Canadian Workshop on Information Theory","year":2005,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Construct (python library); Set (abstract data type); Information theory; Code (set theory); Lattice (music); Block (permutation group theory)","score_opus":0.017674104441591988,"score_gpt":0.2397521747539441,"score_spread":0.2220780703123521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097687445","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.014317777,0.0005993375,0.9795542,0.00027107447,0.000111095964,0.00003993821,0.000041260017,0.00014693323,0.004918546],"genre_scores_gemma":[0.3805355,0.0010563636,0.6113062,0.00026218418,0.00021435422,0.00022672447,0.00014648466,0.00014961248,0.0061025415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992588,0.00030019396,0.00003320543,0.00008825165,0.00025703438,0.00006242071],"domain_scores_gemma":[0.99934095,0.00027393783,0.00004702224,0.00013252745,0.00016394322,0.000041627507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010918379,0.00041063147,0.00045537538,0.0006054484,0.00054555474,0.0009991855,0.0010142177,0.00049194455,0.0018645879],"category_scores_gemma":[0.0021987536,0.00028220355,0.00045645644,0.0006569019,0.002160446,0.0010008157,0.0009000285,0.0012904985,0.00038807665],"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.00016015649,0.000025441313,0.00014783617,0.00011136465,0.000026322283,0.0000802177,0.00022808438,0.095476024,0.016008731,0.7994949,0.0026106557,0.08563016],"study_design_scores_gemma":[0.000044286986,0.00013232148,0.00009476732,0.00005148662,0.00001646985,0.00011623022,0.00003779991,0.5105206,0.017702924,0.4501879,0.021062708,0.000032497544],"about_ca_topic_score_codex":0.000863099,"about_ca_topic_score_gemma":0.00088796526,"teacher_disagreement_score":0.0018645879,"about_ca_system_score_codex":0.00094678474,"about_ca_system_score_gemma":0.00074159564,"threshold_uncertainty_score":0.006869495},"labels":[],"label_agreement":null},{"id":"W7104577207","doi":"10.1145/3747199.3747579","title":"Some Applications of Chinese Remainder Theorem Codes with Error-Correction","year":2025,"lang":"","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chinese remainder theorem; Remainder; Property (philosophy); Modulo; Bounded function; Computation; Modular design","score_opus":0.006494684625383261,"score_gpt":0.2563054453641975,"score_spread":0.24981076073881425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104577207","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.032709807,0.012090384,0.8827734,0.0024757527,0.001038699,0.00021975672,0.00014151642,0.0006242806,0.06792641],"genre_scores_gemma":[0.5838741,0.011162768,0.372792,0.0011712953,0.0022194765,0.00033436893,0.00021476852,0.00029544331,0.027935678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982387,0.00043997957,0.00012371139,0.00026588992,0.0007267758,0.00020500776],"domain_scores_gemma":[0.9972294,0.001360622,0.00018947289,0.000538051,0.0006089229,0.00007351782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021875894,0.0011817602,0.0007009492,0.0020713867,0.0013172256,0.0017820055,0.0015322297,0.0015626032,0.0030917355],"category_scores_gemma":[0.008536611,0.0004558327,0.0010963101,0.002898642,0.0029162464,0.002309515,0.0018290291,0.0021783952,0.0008520928],"study_design_candidate":"bench_or_experimental","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.0001023444,0.000050220475,0.00041990183,0.00013374207,0.000026474909,0.00019884417,0.00017511693,0.050978124,0.002476527,0.8758116,0.0032458687,0.0663812],"study_design_scores_gemma":[0.00007270224,0.0001689364,0.0003070521,0.00013710537,0.0000385985,0.0004005379,0.00004189237,0.3376654,0.011476347,0.6144447,0.035167675,0.000079121986],"about_ca_topic_score_codex":0.003323919,"about_ca_topic_score_gemma":0.0022261676,"teacher_disagreement_score":0.003323919,"about_ca_system_score_codex":0.0026197287,"about_ca_system_score_gemma":0.0013794433,"threshold_uncertainty_score":0.019007564},"labels":[],"label_agreement":null},{"id":"W7110053102","doi":"10.1162/isal.a.834","title":"Using Dynamical Systems Theory to Quantify Complexity in Asymptotic Lenia","year":2025,"lang":"","type":"article","venue":"ALIFE","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Dynamical systems theory; Attractor; Lyapunov exponent; Covariant transformation; Fractal; Chaotic; Dynamical system (definition); Measure (data warehouse); Fractal dimension","score_opus":0.10016932677256382,"score_gpt":0.35628269138924556,"score_spread":0.25611336461668177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110053102","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.16503464,0.0006886153,0.8124446,0.00075425004,0.00008206834,0.00007347164,0.00018050258,0.00026604068,0.020475825],"genre_scores_gemma":[0.90677696,0.0003156251,0.0907045,0.00008284327,0.000051984778,0.0000921023,0.00009239764,0.0000492167,0.0018343005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958235,0.000121641424,0.000045784724,0.000075049385,0.00013917108,0.000036037673],"domain_scores_gemma":[0.9986802,0.0007370581,0.0002441001,0.00015672951,0.00013205413,0.00004992307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007441956,0.0003317154,0.00040505832,0.0018338094,0.00056140916,0.0016723864,0.00042523045,0.0004975425,0.001344101],"category_scores_gemma":[0.0047275503,0.0001778616,0.0004926045,0.00065100973,0.0024267354,0.0026567818,0.0014578181,0.00083760143,0.00012823041],"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.000009367965,0.00000947991,0.0017315802,0.000039483883,0.0000166704,0.00006344382,0.00018487246,0.05390001,0.0026403747,0.9314982,0.00025477848,0.009651894],"study_design_scores_gemma":[0.000004747458,0.000021754538,0.0009774141,0.000025222185,0.000008951379,0.00006974775,0.00008747019,0.40172547,0.0017626841,0.5927393,0.0025576607,0.000019610094],"about_ca_topic_score_codex":0.0013837841,"about_ca_topic_score_gemma":0.001361632,"teacher_disagreement_score":0.0018338094,"about_ca_system_score_codex":0.0014036295,"about_ca_system_score_gemma":0.00053188065,"threshold_uncertainty_score":0.010184109},"labels":[],"label_agreement":null},{"id":"W7115711999","doi":"10.5281/zenodo.17951258","title":"NON-ABELIAN AFFINE GROUPS WITH SCALAR LINEAR PART ACTING ON R^n","year":2025,"lang":"en","type":"preprint","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Affine transformation; Abelian group; Multiplicative function; Scalar (mathematics); Affine group; Multiplicative group; Orbit (dynamics); General linear group; Closure (psychology)","score_opus":0.030733533146603362,"score_gpt":0.2522380223929616,"score_spread":0.22150448924635824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115711999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8725942,0.00033125826,0.08793341,0.00024369471,0.000060063743,0.00004103471,0.000083337705,0.00012962923,0.03858352],"genre_scores_gemma":[0.9777058,0.00013127514,0.012615859,0.00005332738,0.000049468337,0.000028693437,0.0000825731,0.000030281957,0.009302839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997428,0.000045843106,0.000018479908,0.00006454553,0.00006708038,0.000061258455],"domain_scores_gemma":[0.9997503,0.000053040454,0.00007923818,0.000039863793,0.00002858413,0.000048947855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024569535,0.00038502345,0.00024039591,0.0005156042,0.00054435956,0.0008293146,0.0004046138,0.00033743356,0.0028507402],"category_scores_gemma":[0.00042593252,0.00009597466,0.0004450943,0.00023340808,0.0015482252,0.0010255646,0.0010303628,0.00043703662,0.00048502427],"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.00008564587,0.0000421998,0.0010051129,0.000035442485,0.000011826578,0.0004345205,0.00073431,0.004720381,0.02092148,0.96198994,0.00027313663,0.009746034],"study_design_scores_gemma":[0.000047986825,0.00024569125,0.0022368748,0.000038978054,0.000025540745,0.0006494311,0.0008032332,0.061319605,0.024265908,0.89520156,0.015114659,0.000050500556],"about_ca_topic_score_codex":0.0009333347,"about_ca_topic_score_gemma":0.0010170756,"teacher_disagreement_score":0.0028507402,"about_ca_system_score_codex":0.00045787403,"about_ca_system_score_gemma":0.00030995085,"threshold_uncertainty_score":0.009536684},"labels":[],"label_agreement":null},{"id":"W7115727736","doi":"10.5281/zenodo.17951257","title":"NON-ABELIAN AFFINE GROUPS WITH SCALAR LINEAR PART ACTING ON R^n","year":2025,"lang":"en","type":"preprint","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Affine transformation; Abelian group; Multiplicative function; Scalar (mathematics); Affine group; Multiplicative group; Orbit (dynamics); General linear group; Closure (psychology)","score_opus":0.030733533146603362,"score_gpt":0.2522380223929616,"score_spread":0.22150448924635824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115727736","genre_codex":"empirical","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.8725942,0.00033125826,0.08793341,0.00024369471,0.000060063743,0.00004103471,0.000083337705,0.00012962923,0.03858352],"genre_scores_gemma":[0.9777058,0.00013127514,0.012615859,0.00005332738,0.000049468337,0.000028693437,0.0000825731,0.000030281957,0.009302839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997428,0.000045843106,0.000018479908,0.00006454553,0.00006708038,0.000061258455],"domain_scores_gemma":[0.9997503,0.000053040454,0.00007923818,0.000039863793,0.00002858413,0.000048947855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024569535,0.00038502345,0.00024039591,0.0005156042,0.00054435956,0.0008293146,0.0004046138,0.00033743356,0.0028507402],"category_scores_gemma":[0.00042593252,0.00009597466,0.0004450943,0.00023340808,0.0015482252,0.0010255646,0.0010303628,0.00043703662,0.00048502427],"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.00008564587,0.0000421998,0.0010051129,0.000035442485,0.000011826578,0.0004345205,0.00073431,0.004720381,0.02092148,0.96198994,0.00027313663,0.009746034],"study_design_scores_gemma":[0.000047986825,0.00024569125,0.0022368748,0.000038978054,0.000025540745,0.0006494311,0.0008032332,0.061319605,0.024265908,0.89520156,0.015114659,0.000050500556],"about_ca_topic_score_codex":0.0009333347,"about_ca_topic_score_gemma":0.0010170756,"teacher_disagreement_score":0.0028507402,"about_ca_system_score_codex":0.00045787403,"about_ca_system_score_gemma":0.00030995085,"threshold_uncertainty_score":0.009536684},"labels":[],"label_agreement":null},{"id":"W7117431362","doi":"10.4064/fm250220-10-9","title":"Generalized Oxtoby subshifts and hyperfiniteness","year":2025,"lang":"","type":"article","venue":"Fundamenta Mathematicae","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Class (philosophy); Invariant (physics); Conjugacy class; Topological conjugacy; Relation (database); Existential quantification","score_opus":0.022366301116706826,"score_gpt":0.2794925556587574,"score_spread":0.25712625454205057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117431362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8696492,0.0007046028,0.06927591,0.00044803473,0.00011882386,0.000028731718,0.00011913839,0.00012957312,0.059526097],"genre_scores_gemma":[0.9876128,0.00017773653,0.0048840623,0.000061622886,0.0000362453,0.000021628657,0.00006253638,0.000023561843,0.0071197306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963963,0.000048022448,0.000022523429,0.00009154539,0.00010366036,0.00009458314],"domain_scores_gemma":[0.9994,0.00018266072,0.00008183269,0.00010372133,0.000117010604,0.00011477555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003171687,0.0003319286,0.00038694066,0.0011048102,0.0011777163,0.0020839432,0.00038096166,0.0005107516,0.0053019375],"category_scores_gemma":[0.0011230871,0.00015503069,0.0004954403,0.0004766624,0.00265876,0.0018902933,0.0020251963,0.00070290454,0.0004255364],"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.000021436992,0.00000606394,0.00038056076,0.000013236907,0.000004027177,0.000110098896,0.00023614349,0.00041125182,0.0019512452,0.99419045,0.00011821624,0.0025572728],"study_design_scores_gemma":[0.000015604157,0.00003099146,0.0005390102,0.000013994347,0.000012889295,0.00023614246,0.00036698845,0.0058814213,0.003916668,0.9831913,0.0057785264,0.000016451659],"about_ca_topic_score_codex":0.0012296307,"about_ca_topic_score_gemma":0.001029161,"teacher_disagreement_score":0.0053019375,"about_ca_system_score_codex":0.0009951702,"about_ca_system_score_gemma":0.000366825,"threshold_uncertainty_score":0.017736673},"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},{"id":"W882615793","doi":"10.1007/978-3-319-11520-7_58","title":"Bifurcations of Local Structure Maps as Predictors of Phase Transitions in Asynchronous Cellular Automata","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"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; Asynchronous communication; Computer science; Percolation (cognitive psychology); Directed percolation; Phase transition; Theoretical computer science; Class (philosophy); Automaton; Asynchronous cellular automaton; Order (exchange); Stochastic cellular automaton; Statistical physics; Algorithm; Discrete mathematics; Automata theory; Mathematics; Artificial intelligence; Mobile automaton; Critical exponent; Physics; Telecommunications; Condensed matter physics","score_opus":0.007651816787456101,"score_gpt":0.23224287062564936,"score_spread":0.22459105383819325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W882615793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77804166,0.0015624326,0.21012749,0.0004057025,0.000083176696,0.000047452577,0.00025106745,0.00054661225,0.008934351],"genre_scores_gemma":[0.994865,0.00020410166,0.0036778036,0.000012702611,0.000022485949,0.00001800175,0.00006826795,0.000035775498,0.0010956713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983287,0.000057774392,0.000009140052,0.00004145948,0.000032423923,0.000026227812],"domain_scores_gemma":[0.9960174,0.0029495568,0.00051140547,0.00012659346,0.00022513123,0.00016998724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070782006,0.0003784324,0.000586913,0.0015774199,0.00036260183,0.0012465446,0.00065537024,0.00074158504,0.0022064154],"category_scores_gemma":[0.006806255,0.00042041665,0.00045358785,0.00054148876,0.0009072341,0.00095688726,0.00079598435,0.0008286001,0.00029830777],"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.00043062333,0.00012045237,0.016186073,0.00027006335,0.00013045962,0.00048143498,0.0008374427,0.6493336,0.022378797,0.2469547,0.0028202168,0.060056165],"study_design_scores_gemma":[0.000009573798,0.000023577646,0.0022124322,0.000022131919,0.000013600248,0.00005498376,0.000034044115,0.9509136,0.0010996327,0.045418344,0.00017922025,0.000018758305],"about_ca_topic_score_codex":0.0006714836,"about_ca_topic_score_gemma":0.0006895101,"teacher_disagreement_score":0.0022064154,"about_ca_system_score_codex":0.00070893025,"about_ca_system_score_gemma":0.00022687609,"threshold_uncertainty_score":0.007381201},"labels":[],"label_agreement":null},{"id":"W89427633","doi":"","title":"Color Switching Games.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.007968632647909842,"score_gpt":0.225765497107169,"score_spread":0.21779686445925917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89427633","genre_codex":"other","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.03684707,0.002831552,0.13810113,0.005108855,0.0010911219,0.00013867648,0.0012004592,0.0005635337,0.81411755],"genre_scores_gemma":[0.6667541,0.0022359376,0.0368264,0.002248777,0.0005480645,0.0002472769,0.0010563675,0.00022223925,0.28986087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996106,0.00009806381,0.000013607391,0.00008202341,0.00010565231,0.00009001415],"domain_scores_gemma":[0.99950564,0.00017761801,0.000039369035,0.00008664348,0.00009532482,0.0000954825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032687737,0.000712753,0.0004923621,0.0006784507,0.0011435563,0.0022838167,0.0010217134,0.0011307547,0.030567799],"category_scores_gemma":[0.0012331823,0.0002301854,0.00051715586,0.00079413725,0.0013002661,0.002557548,0.0011305775,0.0020239449,0.0037057158],"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.000026909092,0.000027739725,0.00011230593,0.000029922137,0.000007751696,0.000038885766,0.00006464169,0.0009743018,0.000525661,0.96888787,0.015348133,0.013955875],"study_design_scores_gemma":[0.000018319033,0.0000136166145,0.00015576289,0.000015871912,0.000010534876,0.00010492989,0.00005712714,0.008198841,0.00050516316,0.9513191,0.03959281,0.000007974538],"about_ca_topic_score_codex":0.0025822378,"about_ca_topic_score_gemma":0.0043336865,"teacher_disagreement_score":0.030567799,"about_ca_system_score_codex":0.0018084602,"about_ca_system_score_gemma":0.00072571327,"threshold_uncertainty_score":0.10225946},"labels":[],"label_agreement":null},{"id":"W99930124","doi":"","title":"The dynamics of fuzzy cellular automata: rule 30","year":2004,"lang":"en","type":"article","venue":"International Conference on Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Fuzzy rule; Fuzzy logic; Mathematics; Cellular automaton; Chaotic; Aperiodic graph; Fuzzy set; Defuzzification; Fuzzy number; Type-2 fuzzy sets and systems; Computer science; Theoretical computer science; Discrete mathematics; Artificial intelligence; Algorithm; Combinatorics","score_opus":0.02527784807149594,"score_gpt":0.26690672705299967,"score_spread":0.24162887898150373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99930124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4858646,0.0011483759,0.41854477,0.0015870978,0.00024412671,0.0001456252,0.00027606965,0.00044407314,0.09174526],"genre_scores_gemma":[0.94074416,0.00035251686,0.04823197,0.00009872102,0.00003081821,0.000054446915,0.00011813962,0.000029109557,0.01034006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996055,0.00006946272,0.000016507121,0.00009810295,0.00016685632,0.00004361084],"domain_scores_gemma":[0.9995714,0.00014732538,0.000063382344,0.000052624793,0.00011830793,0.00004699403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042697176,0.00018447737,0.0002735495,0.00033848858,0.00044864026,0.0012756676,0.0006522161,0.00055150926,0.0021939739],"category_scores_gemma":[0.0018596967,0.000102259764,0.00030726404,0.00026496366,0.0012299429,0.0010810096,0.0005058882,0.0005739885,0.00043409737],"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.00011986292,0.00005609168,0.001880148,0.00010163392,0.000028477678,0.00043070028,0.00096532656,0.117020115,0.020270472,0.8058837,0.0021142138,0.051129222],"study_design_scores_gemma":[0.00003833018,0.00012234277,0.0008435897,0.000041071526,0.000022471217,0.00044043,0.00024036219,0.58416355,0.009914095,0.3816958,0.022418236,0.000059761853],"about_ca_topic_score_codex":0.003925685,"about_ca_topic_score_gemma":0.0015744203,"teacher_disagreement_score":0.003925685,"about_ca_system_score_codex":0.0006917699,"about_ca_system_score_gemma":0.00068430044,"threshold_uncertainty_score":0.0078056455},"labels":[],"label_agreement":null}]}