{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00621265,0.00047364508,0.987301,0.0031120665,0.001300933,0.0009798836,0.00004898413,0.0003880964,0.00018274719],"genre_scores_gemma":[0.34580827,0.00002897068,0.65228164,0.0005100072,0.0008379772,0.000112640555,0.000057025125,0.00009013777,0.00027334294],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965294,0.00014552394,0.0011980328,0.0006116403,0.0008179347,0.0006974972],"domain_scores_gemma":[0.99476063,0.00046099437,0.0011028271,0.0026367602,0.00059135596,0.00044745902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025789908,0.00043983993,0.000575376,0.00029089832,0.0006033397,0.0008386646,0.0049170917,0.0002734729,0.00007767451],"category_scores_gemma":[0.000069476126,0.00031820027,0.00053439365,0.0006212404,0.00018756611,0.0012429993,0.00027907995,0.00088164833,0.000048838727],"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.000015710137,0.00071040145,0.000013738189,0.00006181579,0.00011700274,0.00005562643,0.00028374995,0.00009200053,0.7114886,0.0061671673,0.003176366,0.2778178],"study_design_scores_gemma":[0.0014814715,0.00031018164,0.00010423619,0.000023389064,0.00010470468,0.00012753645,0.000032420317,0.78333914,0.13132599,0.0018135984,0.08099727,0.0003400378],"about_ca_topic_score_codex":0.00003172513,"about_ca_topic_score_gemma":0.00001101654,"teacher_disagreement_score":0.7832472,"about_ca_system_score_codex":0.000055519544,"about_ca_system_score_gemma":0.00062315405,"threshold_uncertainty_score":0.999927},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5286565,0.0024088724,0.45837986,0.005402405,0.0012487031,0.0005098751,0.00001836839,0.00043620795,0.0029392499],"genre_scores_gemma":[0.971914,0.00004340936,0.02728436,0.00032205536,0.0001707827,0.0000049903297,0.000033524433,0.000027471635,0.00019941093],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620235,0.00020259467,0.0013806814,0.0005080548,0.0010822783,0.0006240523],"domain_scores_gemma":[0.99729204,0.000115616385,0.0007643374,0.0012606629,0.00022636083,0.00034095705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013808272,0.00038270542,0.000623273,0.0006326073,0.00017271885,0.00022269604,0.0021232688,0.00012701396,0.00006658812],"category_scores_gemma":[0.0000665061,0.00035408043,0.0005258756,0.0011040859,0.00006055827,0.000907759,0.00029133086,0.0005788525,0.00014335777],"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.00012879954,0.00566395,0.0015657956,0.00014748724,0.00039010504,0.005401077,0.0012141383,0.024260186,0.57253563,0.25612164,0.018502796,0.114068404],"study_design_scores_gemma":[0.0025053709,0.00034003676,0.0032061206,0.00013893757,0.00007035526,0.00058227795,0.000037168476,0.9468619,0.028388923,0.011336583,0.00592613,0.0006061512],"about_ca_topic_score_codex":0.000031418564,"about_ca_topic_score_gemma":0.000023160681,"teacher_disagreement_score":0.92260176,"about_ca_system_score_codex":0.00039336836,"about_ca_system_score_gemma":0.0003152945,"threshold_uncertainty_score":0.9998911},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22397082,0.0024077683,0.734269,0.028853698,0.00058980414,0.007867417,0.000066612825,0.0007609244,0.0012139224],"genre_scores_gemma":[0.9897986,0.00020214658,0.0043220767,0.00038237256,0.00008341968,0.0046019168,0.0000074776967,0.000011153046,0.00059085205],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99872553,0.000044653465,0.00020020525,0.00041523506,0.00026266076,0.00035171697],"domain_scores_gemma":[0.99901175,0.00031419742,0.000091377624,0.00044802373,0.0000485298,0.0000861411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041025487,0.00012733064,0.00014109125,0.00013529947,0.00011051696,0.00020732706,0.0005726574,0.00007237361,0.000027794957],"category_scores_gemma":[0.000091134585,0.00011176649,0.00005517661,0.00035189438,0.0000212694,0.0006260228,0.00006628989,0.000081741164,0.000022566273],"study_design_candidate":"design_other","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.00006557866,0.0002321275,0.0063670967,0.00012988466,0.00003132232,0.000008830255,0.0041009365,0.000198704,0.009687066,0.018103054,0.0011573529,0.959918],"study_design_scores_gemma":[0.0032202625,0.00014974659,0.54445606,0.00014823108,0.00006119914,0.000043772634,0.00018255232,0.2244875,0.20186046,0.0065503633,0.017607456,0.0012323837],"about_ca_topic_score_codex":0.000020858817,"about_ca_topic_score_gemma":0.00022008424,"teacher_disagreement_score":0.95868564,"about_ca_system_score_codex":0.000085186475,"about_ca_system_score_gemma":0.000014593486,"threshold_uncertainty_score":0.4557705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43969128,0.0005975551,0.44625017,0.02596411,0.00011267295,0.00068384234,0.0000042308793,0.0009158883,0.085780255],"genre_scores_gemma":[0.97748303,0.000022846973,0.008522521,0.00047076718,0.000020821326,0.00003777814,0.0000026136647,0.0000045251877,0.0134351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993831,0.000019580359,0.0001276025,0.00017956946,0.00012269666,0.00016748189],"domain_scores_gemma":[0.9992806,0.000114362905,0.000015297212,0.00047592496,0.000020095824,0.00009373384],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018704782,0.00006436899,0.000045765206,0.000024683412,0.00046817397,0.00023560357,0.00052629254,0.000026479578,0.000055006374],"category_scores_gemma":[0.000014174674,0.000044472406,0.000019254006,0.00026948826,0.00001377543,0.00027628313,0.000118839685,0.00005363173,0.0008157975],"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":[8.4037424e-7,0.000012883009,0.000070754024,0.0000021696878,0.000002945748,0.0000014041008,0.00035824912,0.00003090701,0.00065358874,0.9186967,0.0037788546,0.076390706],"study_design_scores_gemma":[0.00020946497,0.000028842955,0.013763194,0.000005926139,0.000005659707,0.000024342933,0.000025379544,0.31803328,0.006269204,0.012826809,0.6485804,0.00022751704],"about_ca_topic_score_codex":0.000010200243,"about_ca_topic_score_gemma":0.000010595744,"teacher_disagreement_score":0.9058699,"about_ca_system_score_codex":0.000008338929,"about_ca_system_score_gemma":0.000018229246,"threshold_uncertainty_score":0.9999622},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76621014,0.0000272911,0.20951201,0.011548811,0.0000928291,0.00037452203,0.00004365582,0.00006347312,0.012127236],"genre_scores_gemma":[0.9848792,0.0000025681948,0.013565002,0.001377357,0.000026400752,0.000018124576,0.00003113854,0.000006335677,0.00009388118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900395,0.000045390374,0.00023164968,0.00026451363,0.00026569498,0.00018879962],"domain_scores_gemma":[0.9988299,0.0004970361,0.000109469474,0.00022603906,0.00015849937,0.00017904794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018185347,0.00012226468,0.00013873477,0.000198912,0.00019917492,0.00012821562,0.0003849136,0.000050780513,0.00015056902],"category_scores_gemma":[0.00005379786,0.00010318422,0.00003572964,0.00047024383,0.00010970669,0.000117029915,0.00003912841,0.000118952164,0.00022916918],"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.0000023642422,0.000036694917,0.00013927906,0.000009241912,0.000015786642,0.0000019463605,0.00023686698,0.009613825,0.000049609782,0.9660699,0.0017639959,0.022060482],"study_design_scores_gemma":[0.00028749395,0.000048650447,0.014250758,0.000040690567,0.000005935971,0.000020772386,0.000040997016,0.9260005,0.00018101258,0.057928618,0.0010331615,0.0001614598],"about_ca_topic_score_codex":0.00066323957,"about_ca_topic_score_gemma":0.00076684606,"teacher_disagreement_score":0.9163866,"about_ca_system_score_codex":0.00008445507,"about_ca_system_score_gemma":0.0003923524,"threshold_uncertainty_score":0.42077303},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004860118,0.00028817938,0.994946,0.00075290044,0.0006485301,0.0004860863,0.000009586163,0.0003459321,0.002036768],"genre_scores_gemma":[0.3511681,0.00002065098,0.64652574,0.0009651888,0.00042341498,0.000035040946,0.00009784858,0.000058758225,0.00070526236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676704,0.000035715137,0.00044749,0.0012797313,0.0008315367,0.0006384711],"domain_scores_gemma":[0.9967553,0.00026174483,0.00035897206,0.0022374578,0.00020385152,0.00018267325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084429455,0.00050398015,0.00043449982,0.00031504594,0.00055041973,0.0006781471,0.0038170982,0.00038291462,0.000028180326],"category_scores_gemma":[0.000019992445,0.00044225075,0.000082228384,0.00067766145,0.00067825586,0.0006512534,0.0010589205,0.0011754654,0.000060769442],"study_design_candidate":"design_other","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.000013808963,0.0002311569,0.0003275395,0.00008406497,0.000042260523,0.00015607089,0.00093165267,0.009033169,0.0110537615,0.06627144,0.0006040002,0.91125107],"study_design_scores_gemma":[0.00079324166,0.00037866316,0.00043186024,0.000381889,0.000030558316,0.00013378143,2.3836088e-7,0.7936242,0.01732901,0.1500669,0.03496689,0.0018627287],"about_ca_topic_score_codex":0.00006561776,"about_ca_topic_score_gemma":0.00018810775,"teacher_disagreement_score":0.90938836,"about_ca_system_score_codex":0.0001632676,"about_ca_system_score_gemma":0.0004657235,"threshold_uncertainty_score":0.99980295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19942874,0.00003261407,0.79574686,0.00055685337,0.00030940998,0.00014380987,0.0000018333594,0.00027706177,0.0035028264],"genre_scores_gemma":[0.872839,0.0000011231183,0.12694803,0.00011936426,0.000056124903,0.000007607008,0.0000015790501,0.0000070693495,0.0000201457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976431,0.000050619543,0.0003531745,0.00061806897,0.00086713856,0.00046789998],"domain_scores_gemma":[0.99758077,0.000092743794,0.00011134336,0.0014753841,0.00031283,0.0004269161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014198017,0.00016232274,0.00023564421,0.0001726513,0.00016276448,0.00022824822,0.0035824387,0.000052938773,0.000015949492],"category_scores_gemma":[0.00006696197,0.00014023205,0.00007545628,0.0012491593,0.001888711,0.0005041048,0.001558617,0.00013500023,0.00014049107],"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.000001964079,0.00012898131,0.00016171634,0.0000036991448,0.0000021397889,0.0000104647015,0.00041527787,0.000039243994,0.0026848572,0.9861963,0.00017146458,0.01018394],"study_design_scores_gemma":[0.0004698549,0.00030617265,0.0014540096,0.000022882874,0.000012327303,0.000057345598,0.00001439117,0.75894773,0.074735954,0.16319594,0.0004568256,0.0003265454],"about_ca_topic_score_codex":0.000007875199,"about_ca_topic_score_gemma":2.5673862e-7,"teacher_disagreement_score":0.8230003,"about_ca_system_score_codex":0.00004521465,"about_ca_system_score_gemma":0.00024478073,"threshold_uncertainty_score":0.6959035},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020237146,0.00021068117,0.99022293,0.00055388064,0.00035014757,0.00044212383,0.000007759598,0.00018612093,0.007824006],"genre_scores_gemma":[0.44015357,0.000044291926,0.5585133,0.0009007868,0.00010779332,0.00003070199,0.000016490778,0.000030188354,0.00020290872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968528,0.000014324423,0.00052314356,0.0014272144,0.00058532646,0.00059714995],"domain_scores_gemma":[0.9979699,0.000146547,0.00022153322,0.0014030755,0.00011866061,0.0001402796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004452596,0.00043958134,0.00038694995,0.0007541896,0.00018174098,0.00040977396,0.0027590627,0.00031900252,0.0000122233605],"category_scores_gemma":[0.000020578553,0.00044009087,0.000116482035,0.0006987456,0.00033155273,0.0005514739,0.0009388422,0.0007362481,0.000063502055],"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.0000049189625,0.00016193325,0.000016691316,0.000091489084,0.0000051858474,0.00008077603,0.0015575874,0.38857442,0.0061300653,0.31905434,0.000017332095,0.28430527],"study_design_scores_gemma":[0.0002382861,0.000033546115,0.000025222327,0.00010501893,0.0000026670664,0.000013543966,6.3317465e-8,0.65496397,0.0020866562,0.34210634,0.00007172812,0.0003529477],"about_ca_topic_score_codex":0.00005525178,"about_ca_topic_score_gemma":0.00015332665,"teacher_disagreement_score":0.4399512,"about_ca_system_score_codex":0.00046828194,"about_ca_system_score_gemma":0.0009260213,"threshold_uncertainty_score":0.9998051},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65821964,0.031664904,0.1606189,0.0013653872,0.0015063299,0.0044373777,0.000022789029,0.0011318073,0.1410329],"genre_scores_gemma":[0.8375,0.00081742444,0.15117097,0.000027940221,0.00030537258,0.000102420796,0.000018325485,0.0000698327,0.009987746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983034,0.000037854363,0.0004604881,0.0006897155,0.00025878873,0.0002497621],"domain_scores_gemma":[0.99854344,0.00037300008,0.000432596,0.00050386303,0.000098407705,0.00004867282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031968736,0.00030691488,0.0004356406,0.00017798258,0.00042329595,0.0001800269,0.00031089684,0.00009408475,0.000007480857],"category_scores_gemma":[0.000062454616,0.00027326605,0.000054164706,0.00010852659,0.0002402073,0.00051148754,0.0012358074,0.0003127464,0.000005009876],"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.00010651192,0.0008386806,0.03288954,0.0027525732,0.0018898098,0.00059876667,0.29629016,0.0028537821,0.0039246157,0.42968342,0.00029265878,0.2278795],"study_design_scores_gemma":[0.0028129627,0.00025052964,0.0060913274,0.008443805,0.0004324167,0.00029108167,0.01847968,0.91301805,0.0021294495,0.041376673,0.0033805121,0.0032935329],"about_ca_topic_score_codex":0.00006484458,"about_ca_topic_score_gemma":0.00027473771,"teacher_disagreement_score":0.91016424,"about_ca_system_score_codex":0.00016715594,"about_ca_system_score_gemma":0.000032955377,"threshold_uncertainty_score":0.9999719},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02696995,0.00010186537,0.9699024,0.00048044496,0.00027081792,0.0002919845,0.000011637699,0.00035196482,0.0016189661],"genre_scores_gemma":[0.50318676,9.234653e-7,0.49650633,0.000063674925,0.00007446819,0.000039396768,0.000038722414,0.000007754694,0.00008196808],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987108,0.00024273155,0.00029748658,0.00027862555,0.00015393594,0.00031643125],"domain_scores_gemma":[0.99879414,0.0001684605,0.00012943965,0.00066631625,0.00009634042,0.00014529366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006376874,0.0001232451,0.00015680019,0.000101637335,0.00020222289,0.000091059555,0.000408967,0.000058486057,0.00007540696],"category_scores_gemma":[0.000026768199,0.0001110304,0.000101670244,0.00031157528,0.000047808746,0.00044930124,0.000091174676,0.000080173464,0.00044281682],"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.000002258876,0.00015795506,0.00019522494,0.00003671567,0.000017963283,0.0000025063491,0.00017498489,0.00002075359,0.8408841,0.15299897,0.00014303172,0.005365564],"study_design_scores_gemma":[0.0003911252,0.000021508467,0.0010969271,0.00003185566,0.00005517901,0.000045053377,0.000682408,0.20291859,0.7907664,0.00041228067,0.0032053178,0.0003733406],"about_ca_topic_score_codex":0.000079594196,"about_ca_topic_score_gemma":0.0000025604543,"teacher_disagreement_score":0.47621682,"about_ca_system_score_codex":0.000096025164,"about_ca_system_score_gemma":0.000038372553,"threshold_uncertainty_score":0.5691662},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002328395,0.00029062276,0.9908384,0.00041451686,0.00037990813,0.00032413166,0.000006756857,0.00013840145,0.0073743975],"genre_scores_gemma":[0.21372563,0.00007164896,0.7834462,0.0012825594,0.00024807642,0.00002521811,0.000028888779,0.000048194248,0.0011236089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771833,0.000030263012,0.00041629013,0.0009314644,0.00061190425,0.00029172172],"domain_scores_gemma":[0.9978211,0.0002914519,0.00031712206,0.0012710453,0.00021660878,0.00008265109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034145315,0.00027663657,0.00038909834,0.00046476812,0.00012955988,0.000116031326,0.0015868279,0.00018189421,0.00002269099],"category_scores_gemma":[0.00006608806,0.00025980975,0.000111569956,0.0006658826,0.0004426653,0.00032799173,0.00047670488,0.00032296515,0.000034000943],"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.000005293739,0.0001060042,0.00015865664,0.0000934759,0.00003773735,0.00007689958,0.002325383,0.01885628,0.0047694,0.23193906,0.00017015693,0.74146163],"study_design_scores_gemma":[0.00044869128,0.00016289648,0.00040218432,0.00030630213,0.000021723463,0.00009944905,0.000001299713,0.7736583,0.07868432,0.14190869,0.0034914033,0.0008147882],"about_ca_topic_score_codex":0.000029587047,"about_ca_topic_score_gemma":0.000016461927,"teacher_disagreement_score":0.754802,"about_ca_system_score_codex":0.000100177735,"about_ca_system_score_gemma":0.0002358627,"threshold_uncertainty_score":0.9999854},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48735636,0.00009566253,0.49487317,0.0092767505,0.0000932637,0.0015731172,0.00002616803,0.00036486643,0.0063406485],"genre_scores_gemma":[0.39483708,0.00001496366,0.60306907,0.0009723143,0.000058228525,0.00019193279,0.0000016105473,0.000021324813,0.00083349104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987203,0.000005474104,0.00031322072,0.00031746586,0.00033973335,0.00030381215],"domain_scores_gemma":[0.9990567,0.000115291026,0.0003242918,0.0002672301,0.00014973403,0.000086784334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026400326,0.00014081439,0.0003113233,0.000015605989,0.00024888452,0.00008875561,0.0010243454,0.000036119396,0.000052543284],"category_scores_gemma":[0.000075175885,0.0001034515,0.00029900772,0.00056894094,0.00027124572,0.00021686981,0.00041075645,0.00009884193,0.00002776738],"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.00000805057,0.0009867117,0.0002031431,0.00023093847,0.00013854924,5.2844193e-8,0.0015944227,0.000008730588,0.14427367,0.8030614,0.04621641,0.0032778827],"study_design_scores_gemma":[0.0009357505,0.00015626078,0.0005311451,0.00007313777,0.00007967682,0.000013921064,0.00024963557,0.7450748,0.02106406,0.2278373,0.0035905296,0.00039380832],"about_ca_topic_score_codex":0.000011491689,"about_ca_topic_score_gemma":1.7537556e-7,"teacher_disagreement_score":0.74506605,"about_ca_system_score_codex":0.00003789759,"about_ca_system_score_gemma":0.0000127510975,"threshold_uncertainty_score":0.42186296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1430117,0.005105629,0.8325972,0.008519594,0.00055696804,0.00017996175,3.6268895e-7,0.000066128276,0.009962452],"genre_scores_gemma":[0.99840635,0.0004943022,0.00007733554,0.00012502338,0.0000545347,0.00000204097,1.0861221e-7,0.000006091839,0.0008342173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990533,0.000030672265,0.00023505597,0.00009011397,0.00028163235,0.00030920823],"domain_scores_gemma":[0.99911624,0.000089160574,0.00023199503,0.00035488143,0.00015531453,0.00005243035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047591503,0.000080680584,0.00012448881,0.00005822417,0.00013666238,0.00006737373,0.001189833,0.000028794828,0.000017830642],"category_scores_gemma":[0.000021136726,0.000055066812,0.00009472738,0.00045096027,0.000033234326,0.0002145924,0.00008137635,0.00040999398,0.000060230475],"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.0000010733693,0.000090025016,0.00002648904,0.0000015733715,0.000022735629,0.0000051216343,0.00041490182,0.000013619273,0.00048582355,0.9950328,0.0016471304,0.002258705],"study_design_scores_gemma":[0.0008253382,0.0005030223,0.00044674697,0.000020573127,0.000041406074,0.0006327977,0.000065861845,0.034486175,0.009392148,0.88565505,0.06772346,0.00020742882],"about_ca_topic_score_codex":0.0000018375988,"about_ca_topic_score_gemma":5.1231285e-7,"teacher_disagreement_score":0.85539466,"about_ca_system_score_codex":0.00011575002,"about_ca_system_score_gemma":0.0000923193,"threshold_uncertainty_score":0.22455595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047061704,0.00006527232,0.9422651,0.0017406011,0.000040712934,0.000102901926,3.9220828e-7,0.00021855325,0.008504773],"genre_scores_gemma":[0.96551216,0.00001753492,0.033407573,0.00049936585,0.000023881508,0.000010019257,0.0000037310328,0.0000049186106,0.0005208228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993408,0.000019189647,0.00016358227,0.00021792529,0.000122753,0.00013579504],"domain_scores_gemma":[0.9994878,0.00007029789,0.000032995893,0.00035239046,0.000023077077,0.000033422923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111248875,0.00006639092,0.000072492054,0.00010384176,0.000071725015,0.00011671368,0.0003350773,0.000036335136,0.00012127143],"category_scores_gemma":[0.000046692618,0.00006149789,0.000019885734,0.000493012,0.000010744051,0.00020144254,0.00007750522,0.000077474666,0.00025242666],"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":[8.10704e-7,0.00040688878,0.0013847764,0.000019190515,0.000007426698,0.000011134353,0.0006733223,0.023177814,0.007959539,0.8353971,0.0044108583,0.12655109],"study_design_scores_gemma":[0.0001261242,0.000016558863,0.00061693834,0.000020380696,8.534807e-7,0.0000028469676,0.0000044745993,0.9949365,0.0014232518,0.001996352,0.0007726331,0.00008307653],"about_ca_topic_score_codex":0.000025074562,"about_ca_topic_score_gemma":0.000014880008,"teacher_disagreement_score":0.9717587,"about_ca_system_score_codex":0.000033832683,"about_ca_system_score_gemma":0.0000067544747,"threshold_uncertainty_score":0.32445183},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041010927,0.000093569986,0.9422389,0.00033939848,0.00010118205,0.00009119481,9.605873e-7,0.00027344396,0.015850386],"genre_scores_gemma":[0.9536135,8.492311e-7,0.04560409,0.00002276429,0.00001914708,0.0000068257377,0.0000034013842,0.0000034543207,0.0007259527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993267,0.000020103129,0.00015555337,0.00017378086,0.00020469858,0.00011915323],"domain_scores_gemma":[0.999128,0.000016924061,0.000052357027,0.0006380392,0.00007582699,0.00008888108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018179967,0.000059124635,0.00008225252,0.00005944739,0.00002859128,0.000029168641,0.0005673596,0.000030188869,0.000013728665],"category_scores_gemma":[0.0000162463,0.000052712778,0.000034831828,0.0003412636,0.000027985312,0.00022204575,0.00017047193,0.000033771998,0.00025343793],"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":[8.859269e-7,0.00013285583,0.00022160345,0.000011378239,0.0000064836695,0.0000016732995,0.00027227,0.00019352097,0.030619476,0.957347,0.006409577,0.004783296],"study_design_scores_gemma":[0.0004904674,0.000073133546,0.0016827759,0.0000093238195,0.000010434869,0.000012643788,0.00009813846,0.8585943,0.0936755,0.030120522,0.015029445,0.0002033185],"about_ca_topic_score_codex":0.00007941244,"about_ca_topic_score_gemma":0.0000029242342,"teacher_disagreement_score":0.9272265,"about_ca_system_score_codex":0.000043412976,"about_ca_system_score_gemma":0.00009638791,"threshold_uncertainty_score":0.32575166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052987004,0.00020966928,0.99561214,0.0003707174,0.00019907452,0.00027829246,0.000020737803,0.000040827497,0.0027386874],"genre_scores_gemma":[0.9140024,0.00003854636,0.08513591,0.00046141562,0.00007667259,0.000015658483,0.000021044507,0.000018235223,0.00023009663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976043,0.000032052736,0.0005241187,0.0007306292,0.0008279754,0.00028093424],"domain_scores_gemma":[0.9966499,0.0010508944,0.00043790173,0.0016215459,0.0001929329,0.000046819907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074530835,0.00026646742,0.00058414956,0.0011414299,0.0001403008,0.00010287881,0.0029809491,0.00012879581,0.000017028373],"category_scores_gemma":[0.000033628476,0.0001811598,0.00033023214,0.002092204,0.0008423353,0.00010618414,0.0005344216,0.00029158822,0.0000043921946],"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.000010859868,0.0001383985,0.00027059062,0.000035507837,0.00027378823,0.000014594222,0.00068337464,0.22485779,0.0009464744,0.35422584,0.00013956256,0.4184032],"study_design_scores_gemma":[0.00020436254,0.00007228132,0.0010329626,0.000089048546,0.00010144506,0.000003176567,1.0995199e-7,0.9152091,0.0050593643,0.077627406,0.00035687353,0.00024383307],"about_ca_topic_score_codex":0.00008083771,"about_ca_topic_score_gemma":0.000055889257,"teacher_disagreement_score":0.91347253,"about_ca_system_score_codex":0.000040644867,"about_ca_system_score_gemma":0.00014991546,"threshold_uncertainty_score":0.73874825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007505323,0.000101008045,0.9968786,0.0002466496,0.00026212062,0.00031577598,0.000023694645,0.00010754263,0.0013140753],"genre_scores_gemma":[0.23649456,0.000010115423,0.76295793,0.000300133,0.00008305617,0.000012372243,0.000007838932,0.00002318597,0.000110815876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997039,0.000005683596,0.00058535056,0.0011350821,0.00079323066,0.0004416392],"domain_scores_gemma":[0.99839026,0.00009935267,0.00027137133,0.0009415363,0.00016854277,0.00012894717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035438262,0.00038444196,0.00042518598,0.0006143273,0.00018851769,0.00018729756,0.002811628,0.00021565908,0.000018433195],"category_scores_gemma":[0.0000198384,0.00038159214,0.00013140508,0.00061828265,0.00055411557,0.00030948425,0.0011355784,0.0003174214,0.000036549918],"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.000003428128,0.00012311267,0.000007675984,0.000043103853,0.000015946896,0.000014095946,0.00093282765,0.36885938,0.051841643,0.23727317,0.000004022103,0.3408816],"study_design_scores_gemma":[0.00015091445,0.000030981424,0.000027619197,0.0001186648,0.000007103373,0.00003563988,1.2637895e-7,0.8189138,0.025419658,0.15477346,0.000090142596,0.0004318741],"about_ca_topic_score_codex":0.000025838044,"about_ca_topic_score_gemma":0.000038538663,"teacher_disagreement_score":0.4500544,"about_ca_system_score_codex":0.00035883626,"about_ca_system_score_gemma":0.0015871942,"threshold_uncertainty_score":0.9998636},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4244672,0.00003345303,0.5734272,0.0008295006,0.000013143772,0.00014179088,0.0000017582678,0.00007221473,0.0010137612],"genre_scores_gemma":[0.8520801,0.000004814969,0.1477787,0.00005922404,0.000004788438,0.0000072897496,0.000008109656,0.000003993336,0.000052961983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926573,0.000009763169,0.00026094326,0.00016747229,0.00012621259,0.00016988303],"domain_scores_gemma":[0.99915904,0.00002451415,0.00009412044,0.00065113767,0.00003986431,0.000031343563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022716491,0.00006776397,0.00010140251,0.00009612022,0.00006479795,0.00003448135,0.00065408356,0.000027795226,0.000016637505],"category_scores_gemma":[0.000007042128,0.00006779343,0.00003214173,0.00047825277,0.000023345343,0.0002214459,0.00026044503,0.00006369478,0.000016585866],"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.0000015363618,0.00039057393,0.00045510478,0.00001787311,0.000012933642,7.314913e-7,0.0014623664,0.002594203,0.10331782,0.88694745,0.00003187831,0.004767516],"study_design_scores_gemma":[0.004399736,0.00007904708,0.036491264,0.00012725916,0.000011041463,0.000020063513,0.0005629754,0.58491135,0.3258787,0.045453753,0.0014552705,0.0006095274],"about_ca_topic_score_codex":0.0009798501,"about_ca_topic_score_gemma":0.00020114519,"teacher_disagreement_score":0.8414937,"about_ca_system_score_codex":0.000036506546,"about_ca_system_score_gemma":0.000038226735,"threshold_uncertainty_score":0.27645358},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000765038,0.00044920508,0.9846573,0.0012937249,0.00045141098,0.0002936118,0.0000012672763,0.00017429017,0.012602683],"genre_scores_gemma":[0.22959985,0.00010293213,0.7646182,0.003654982,0.0005562872,0.000023156948,0.00001101281,0.000045126362,0.001388416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697447,0.000018837629,0.00046572552,0.0013306205,0.0006347975,0.00057556044],"domain_scores_gemma":[0.99797094,0.00019805781,0.0001715494,0.0014537958,0.000080287944,0.00012538915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058966136,0.00037484948,0.0003913446,0.0008325684,0.00016669036,0.00049654813,0.0033706469,0.00024057139,0.000014653004],"category_scores_gemma":[0.000031291125,0.0003686083,0.00009704881,0.0008910692,0.00030881542,0.00048652283,0.0008279383,0.00069614756,0.00009648386],"study_design_candidate":"design_other","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":[6.7681094e-7,0.000024391264,0.000021357497,0.000010012874,0.0000016585236,0.00006574658,0.00041361563,0.0068027377,0.0002633963,0.045760676,0.000012527383,0.9466232],"study_design_scores_gemma":[0.00029138837,0.00007907636,0.0008704914,0.00043758604,0.0000037606649,0.0000828562,1.2223175e-7,0.6070163,0.0013612167,0.37549746,0.01350807,0.0008516605],"about_ca_topic_score_codex":0.000030367375,"about_ca_topic_score_gemma":0.00015039292,"teacher_disagreement_score":0.9457715,"about_ca_system_score_codex":0.00027130928,"about_ca_system_score_gemma":0.0003982376,"threshold_uncertainty_score":0.99987656},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29669866,0.00032174843,0.65360343,0.00078590144,0.00040720173,0.00082250073,0.000036536087,0.00065038307,0.0466736],"genre_scores_gemma":[0.96379364,0.000071569426,0.035188936,0.00041372637,0.000034092685,0.00004076862,0.000035496905,0.000008485119,0.00041330018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987138,0.000021563148,0.00054332963,0.00014401434,0.00032657618,0.00025075316],"domain_scores_gemma":[0.99874234,0.000055934637,0.00019377381,0.0008506923,0.000048406997,0.00010882521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001656726,0.00013274606,0.00024686957,0.000093966235,0.00016058644,0.000060647057,0.0009493083,0.000046606285,0.000120569726],"category_scores_gemma":[0.0000149063435,0.00012270822,0.00009507722,0.00034742238,0.00012283056,0.00071102334,0.00028298146,0.00008705287,0.0006217335],"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.000022728795,0.0013389733,0.0030882994,0.0007268337,0.00026513063,0.000085693224,0.023275767,0.00011776663,0.02516149,0.6143495,0.076053225,0.25551462],"study_design_scores_gemma":[0.002297318,0.00031269138,0.0056000375,0.00010122178,0.000035756657,0.0003294597,0.0002607884,0.15051828,0.054487016,0.0019509639,0.7833418,0.00076464965],"about_ca_topic_score_codex":0.00002051855,"about_ca_topic_score_gemma":6.210191e-7,"teacher_disagreement_score":0.7072886,"about_ca_system_score_codex":0.000030100842,"about_ca_system_score_gemma":0.00008645575,"threshold_uncertainty_score":0.79913336},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009233407,0.0011890563,0.99034065,0.0013312169,0.000306284,0.00025410944,0.0000036890685,0.00019005968,0.0062926225],"genre_scores_gemma":[0.2275529,0.00035959348,0.7648344,0.00387293,0.00072228344,0.000020633299,0.000018792487,0.00005340189,0.0025650575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975377,0.000011809404,0.000313425,0.0012040596,0.0005215569,0.00041150086],"domain_scores_gemma":[0.99823964,0.00019608167,0.00015108986,0.0011737775,0.00008535734,0.00015408314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033140022,0.00035726212,0.000339029,0.00043443646,0.00024727205,0.0004908928,0.0021068652,0.00021002677,0.000012735215],"category_scores_gemma":[0.000021827562,0.00033221047,0.000072257964,0.00035576176,0.00043131117,0.00036476259,0.0008657096,0.00045472189,0.00004840837],"study_design_candidate":"design_other","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":[6.188761e-7,0.0000136641,0.000008588389,0.000011398889,0.0000027005126,0.000025246478,0.00021044041,0.0005882759,0.00022135575,0.049584813,0.00005844551,0.9492745],"study_design_scores_gemma":[0.00026968677,0.0001372827,0.00093597494,0.0002492587,0.000010375654,0.00020226349,8.570026e-8,0.50125325,0.001536795,0.4587021,0.035768624,0.00093432434],"about_ca_topic_score_codex":0.000012113208,"about_ca_topic_score_gemma":0.000024353398,"teacher_disagreement_score":0.9483401,"about_ca_system_score_codex":0.00009862894,"about_ca_system_score_gemma":0.0002278141,"threshold_uncertainty_score":0.999913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019773917,0.000057341636,0.97938603,0.00019468709,0.0001334305,0.00010417652,0.00004553514,0.000024766096,0.0002801135],"genre_scores_gemma":[0.8360315,0.000020719272,0.16370197,0.00013544637,0.00008146238,0.0000014301954,0.000004633818,0.0000099079325,0.000012929586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987423,0.000083903156,0.00035964017,0.00021524397,0.00039529323,0.00020365145],"domain_scores_gemma":[0.9987043,0.00034625494,0.00026806284,0.00034303128,0.00014046964,0.00019787072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014631904,0.00015145361,0.00024139583,0.0000415613,0.00010893835,0.00014263205,0.00036601067,0.000043614396,0.000011135576],"category_scores_gemma":[0.00011177769,0.0001221433,0.00005514153,0.00017968209,0.00010299123,0.00020283811,0.000070138456,0.00026984897,0.000015295442],"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.000004905994,0.00019129374,0.00004798505,0.0000117595355,0.000031135078,0.000025713827,0.00013633227,0.00015122493,0.007449715,0.97857445,0.00059271784,0.012782774],"study_design_scores_gemma":[0.001550375,0.0006179066,0.004589486,0.000050489485,0.000085700754,0.00014900629,0.00006016139,0.111494586,0.030325077,0.8435155,0.007144728,0.00041694462],"about_ca_topic_score_codex":0.000001227768,"about_ca_topic_score_gemma":1.3738612e-7,"teacher_disagreement_score":0.8162576,"about_ca_system_score_codex":0.000048274553,"about_ca_system_score_gemma":0.00006425117,"threshold_uncertainty_score":0.49808598},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000379253,0.00002488508,0.8048646,0.000064312255,0.00022987157,0.0009519124,0.0011188778,0.00006498489,0.19264266],"genre_scores_gemma":[0.043938015,0.000008508098,0.7618249,0.00011326349,0.000305936,0.00026022512,0.00033637905,0.00021206096,0.19300073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975849,0.000024950763,0.000882248,0.00046689538,0.000786747,0.0002542691],"domain_scores_gemma":[0.9968225,0.00055331405,0.00073411444,0.0014875929,0.00031699572,0.0000855141],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003640748,0.00039189396,0.0006901736,0.000096019896,0.00016263386,0.000045204164,0.0014873336,0.00028610585,0.000019427129],"category_scores_gemma":[0.00011439656,0.0003000636,0.00028898878,0.000037116828,0.00050275365,0.000059568538,0.00029507765,0.00030276715,0.000029104956],"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.000010793272,0.00012034892,2.5417089e-7,0.00073010783,0.0000706916,0.0000074696177,0.000045024033,0.00005387916,0.0007106165,0.98759055,0.0016062804,0.009053991],"study_design_scores_gemma":[0.0007051416,0.00016242258,0.000019950457,0.001227177,0.00027115364,0.000016902719,0.000001886897,0.037366312,0.014149083,0.83731085,0.108181804,0.0005873446],"about_ca_topic_score_codex":0.000011144138,"about_ca_topic_score_gemma":0.000011612234,"teacher_disagreement_score":0.15027972,"about_ca_system_score_codex":0.00006439587,"about_ca_system_score_gemma":0.00025557968,"threshold_uncertainty_score":0.99994516},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006667325,0.0007248048,0.9955546,0.0014272436,0.00019768611,0.0006621315,0.000006132259,0.000098112636,0.0012625873],"genre_scores_gemma":[0.09912833,0.00018524965,0.898438,0.0017311602,0.0000891026,0.00006701849,0.00006415402,0.00002527571,0.000271701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843585,0.00002710442,0.00035549747,0.0006287496,0.00028686828,0.00026593008],"domain_scores_gemma":[0.99805605,0.00040274658,0.00021305842,0.0009956731,0.0002570533,0.000075417694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007047001,0.00023759868,0.00022660806,0.00029249035,0.00048456175,0.00062200543,0.0011272283,0.0001701783,0.0000042457477],"category_scores_gemma":[0.00006718597,0.00023803794,0.00004519071,0.0002790489,0.0002476157,0.000958488,0.00038707416,0.00026531928,0.000009105072],"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.0000025276747,0.000027114784,0.0000069405432,0.000083085004,0.000006864887,0.0000016196168,0.0011286834,0.005113115,0.00088731013,0.34784842,0.00018191324,0.6447124],"study_design_scores_gemma":[0.00020791373,0.000047058536,0.000020641348,0.000121157056,0.000008371873,0.000035661946,2.1474035e-7,0.8911761,0.0015259284,0.09779057,0.008774473,0.0002918818],"about_ca_topic_score_codex":0.00000722237,"about_ca_topic_score_gemma":0.000049164282,"teacher_disagreement_score":0.88606304,"about_ca_system_score_codex":0.00013972323,"about_ca_system_score_gemma":0.00012427813,"threshold_uncertainty_score":0.97069055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114920296,0.00011983089,0.88033694,0.00007196023,0.00013021905,0.000061991974,2.509644e-7,0.000121782934,0.004236734],"genre_scores_gemma":[0.851958,0.0000011219939,0.14747232,0.00015551512,0.00015294792,0.0000053728363,0.0000039488436,0.000003519382,0.00024725613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995251,0.000013691446,0.000085173764,0.00011868586,0.00009787067,0.00015943161],"domain_scores_gemma":[0.9995474,0.000005855309,0.000022062894,0.0003422526,0.000018914996,0.00006350038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010403364,0.000051288385,0.000042815907,0.000031985386,0.00010092635,0.000066789326,0.00021516452,0.000023770153,0.000042345946],"category_scores_gemma":[0.0000010665227,0.00004660613,0.000025591758,0.00016013948,0.0000075284324,0.0007978321,0.000086302854,0.000027405284,0.000098135584],"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":[4.8829737e-8,0.000044322383,0.00003163659,0.000001452071,0.000002616978,2.6049725e-7,0.00030876484,0.0020709713,0.36518607,0.6265483,0.0007964737,0.0050091003],"study_design_scores_gemma":[0.00003160334,0.000001578527,0.000020446538,5.409969e-7,0.0000023936075,0.0000038927474,0.0000044751264,0.93455285,0.061867606,0.0015219843,0.0019266265,0.000066002096],"about_ca_topic_score_codex":0.000024463408,"about_ca_topic_score_gemma":0.0000015403508,"teacher_disagreement_score":0.9324819,"about_ca_system_score_codex":0.000017082237,"about_ca_system_score_gemma":0.000014376963,"threshold_uncertainty_score":0.19005428},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7884152,0.00018114319,0.20567356,0.0016998447,0.0005225059,0.00032655845,0.00004064888,0.00027613092,0.0028644006],"genre_scores_gemma":[0.99269515,0.00001060026,0.005804559,0.00008629975,0.00007843858,0.000053619766,0.00008880399,0.000023324299,0.0011591964],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998355,0.000065520515,0.00042704828,0.000563471,0.00032618296,0.00026282496],"domain_scores_gemma":[0.9969336,0.000047364854,0.00037640848,0.0025004966,0.000088665576,0.00005349742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001865022,0.00024352568,0.000282726,0.00007011531,0.000148403,0.00008332773,0.0027574324,0.00022741548,0.000014508704],"category_scores_gemma":[0.000014099288,0.00019674581,0.00027350028,0.00033909027,0.000112880756,0.00008705759,0.0025921229,0.00043918932,0.00011139165],"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.000004001879,0.0012337408,0.6156425,0.0009075861,0.00025689087,0.000043016,0.0011753248,0.007218347,0.039286703,0.3060974,0.009756844,0.01837766],"study_design_scores_gemma":[0.00024510504,0.000014078273,0.43185458,0.0001626453,0.000070194765,0.000008851177,0.000012663152,0.4830347,0.05428455,0.025012055,0.004678789,0.00062179373],"about_ca_topic_score_codex":0.000325173,"about_ca_topic_score_gemma":0.000051287992,"teacher_disagreement_score":0.47581637,"about_ca_system_score_codex":0.00009485061,"about_ca_system_score_gemma":0.00018413168,"threshold_uncertainty_score":0.8023062},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011198908,0.000063987885,0.98156714,0.0019434168,0.00008803037,0.00017579601,0.0000023392056,0.00055613386,0.004404253],"genre_scores_gemma":[0.981134,0.0000044918943,0.0126977265,0.00021461559,0.000022694096,0.000039095517,0.00003322258,0.000007191493,0.0058469367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991659,0.00001873786,0.00014816246,0.0002899042,0.00019130003,0.00018602372],"domain_scores_gemma":[0.99922484,0.000037670783,0.00004230266,0.00057179964,0.000038183283,0.000085193824],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011157152,0.00009211546,0.00007632078,0.00005089622,0.00012463091,0.00012156206,0.0005851325,0.000035596964,0.00014918677],"category_scores_gemma":[0.000011406767,0.00008617825,0.000036687336,0.00032706655,0.000019264326,0.00026827102,0.00014156166,0.000051121133,0.0008038034],"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.0000030509902,0.0009326148,0.00013228919,0.000014764317,0.000038467733,0.000030723295,0.00052902615,0.0010812791,0.28285137,0.29862615,0.20713305,0.2086272],"study_design_scores_gemma":[0.00028016645,0.000015912437,0.00021133397,0.000002978207,0.00000445359,0.000014147243,0.0000121723515,0.925898,0.008449776,0.0010077235,0.06394573,0.00015761454],"about_ca_topic_score_codex":0.000041736927,"about_ca_topic_score_gemma":0.0000033506915,"teacher_disagreement_score":0.9699351,"about_ca_system_score_codex":0.000030480822,"about_ca_system_score_gemma":0.000018511879,"threshold_uncertainty_score":0.9999742},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29315624,0.0026547946,0.6707481,0.00016940325,0.0005614973,0.0010950762,0.000031677708,0.0004123374,0.03117087],"genre_scores_gemma":[0.9820824,0.0000064873266,0.01772169,0.000016017444,0.000010900678,0.000046594363,0.0000092665405,0.000005688093,0.00010091152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885106,0.00012906051,0.00036820816,0.00025978865,0.00020571343,0.00018619534],"domain_scores_gemma":[0.9991042,0.00004346376,0.000121530065,0.00065276143,0.000033335877,0.000044705987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031793077,0.000097997145,0.00018943098,0.000096107105,0.00004521385,0.000048303933,0.00069738994,0.000028216098,0.000037472386],"category_scores_gemma":[0.0000079880165,0.00009396602,0.00003871936,0.00035086035,0.000046871563,0.00018542112,0.00008642505,0.00005149169,0.00003822373],"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.000001541095,0.00036262596,0.00796503,0.0002888951,0.000028336148,0.00004473076,0.0013356619,0.00046313147,0.32525584,0.6597506,0.0027940546,0.001709561],"study_design_scores_gemma":[0.0019513529,0.0002462785,0.026364144,0.0003416604,0.000029793047,0.00015775002,0.0017190542,0.60551345,0.25247392,0.010032532,0.100006215,0.0011638349],"about_ca_topic_score_codex":0.00025403366,"about_ca_topic_score_gemma":0.0000114266895,"teacher_disagreement_score":0.6889262,"about_ca_system_score_codex":0.000030238367,"about_ca_system_score_gemma":0.000049727754,"threshold_uncertainty_score":0.3831823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.289049,0.000331605,0.6978375,0.003656747,0.00009656641,0.00034886098,0.000035336627,0.00076903915,0.007875346],"genre_scores_gemma":[0.9737935,0.000016171605,0.025036246,0.00009666504,0.00012670216,0.0000548714,0.0000041232615,0.000023219309,0.00084848015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983699,0.000055891327,0.00034231745,0.00045788698,0.00037944393,0.0003945935],"domain_scores_gemma":[0.9982046,0.00053516944,0.0001879278,0.00088383764,0.00004139569,0.00014710969],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038762874,0.0002244472,0.00030239584,0.00013730681,0.00019032942,0.0002512573,0.0010876885,0.00009620868,0.00007451591],"category_scores_gemma":[0.00007027625,0.00015092218,0.00010566668,0.00045125265,0.000045059016,0.0006059108,0.0004566556,0.0001022438,0.0008466983],"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.0000042234433,0.00028914172,0.02609871,0.00018328935,0.000311938,0.000034197164,0.003575137,0.000008700938,0.07293391,0.78725713,0.017566014,0.09173759],"study_design_scores_gemma":[0.0055871652,0.00037288235,0.21754527,0.0015601974,0.00042223823,0.0001636524,0.00018893718,0.018198365,0.2232884,0.27111757,0.25703284,0.004522467],"about_ca_topic_score_codex":0.00001632623,"about_ca_topic_score_gemma":0.0000045182114,"teacher_disagreement_score":0.68474454,"about_ca_system_score_codex":0.000031700612,"about_ca_system_score_gemma":0.00003972449,"threshold_uncertainty_score":0.9999313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4826235,0.0013228822,0.49999034,0.0028897622,0.000042279404,0.0002034796,0.0000012134827,0.00024628066,0.012680266],"genre_scores_gemma":[0.9844444,0.000047696984,0.014910706,0.00010676564,0.0000055361093,0.000007495723,2.0965668e-7,0.0000020048897,0.00047521183],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956936,0.00001226643,0.00012169201,0.00014255644,0.0000676531,0.00008649938],"domain_scores_gemma":[0.9996577,0.000015764368,0.000034100784,0.00022982503,0.00003356112,0.000029046065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000748671,0.000053941374,0.00007460895,0.00003506564,0.0000641327,0.0000567262,0.00027845963,0.000017301621,0.00002090313],"category_scores_gemma":[0.000008621965,0.000034924324,0.000018611112,0.00015189318,0.00007200282,0.00019126268,0.00008285104,0.000024532852,0.000009859062],"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":[7.594126e-7,0.00009775945,0.00037145763,0.00005367116,0.000025744182,0.0000013214626,0.0071742265,0.00015090161,0.8185576,0.11733052,0.0020232566,0.054212734],"study_design_scores_gemma":[0.00009440263,0.000014579108,0.000056792203,0.000016434686,0.0000016197538,0.000011961481,0.00023633803,0.6636845,0.33300832,0.0016224849,0.0011657652,0.00008681287],"about_ca_topic_score_codex":0.000055094635,"about_ca_topic_score_gemma":0.000006668159,"teacher_disagreement_score":0.66353357,"about_ca_system_score_codex":0.0000037265618,"about_ca_system_score_gemma":0.000008168403,"threshold_uncertainty_score":0.14241727},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101231635,0.0001479827,0.94460624,0.00066055177,0.00004557214,0.0006039025,0.0000034695095,0.0005732288,0.05325783],"genre_scores_gemma":[0.49520513,0.0000011685606,0.49901208,0.0003515758,0.00003165972,0.00033144638,0.000002677076,0.0000148087165,0.00504945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998446,0.000089112145,0.00025238786,0.0005896163,0.00024279198,0.00038008386],"domain_scores_gemma":[0.9986447,0.00011398635,0.0000546987,0.00082929246,0.0001145648,0.00024276284],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030218784,0.00019406406,0.00018748018,0.00018659394,0.00022252176,0.000259224,0.0012589479,0.00006948805,0.00007943758],"category_scores_gemma":[0.000032020256,0.00016569669,0.00006777211,0.0012771003,0.000027666068,0.00023732884,0.0001331147,0.00008566193,0.0012025369],"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.000015865007,0.0063585863,0.000101800906,0.00048555044,0.000099020326,0.000024151464,0.0045725675,0.008146333,0.039835125,0.43929055,0.30625415,0.1948163],"study_design_scores_gemma":[0.00024919625,0.000044322547,0.00016013399,0.000014897504,0.000007393109,0.000013524714,0.000013810742,0.9682455,0.0105163315,0.00021347705,0.020223223,0.00029817357],"about_ca_topic_score_codex":0.000008991256,"about_ca_topic_score_gemma":0.0000026090997,"teacher_disagreement_score":0.96009916,"about_ca_system_score_codex":0.000064014544,"about_ca_system_score_gemma":0.00008554616,"threshold_uncertainty_score":0.99957514},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35647,0.000023630524,0.5790871,0.004370385,0.0016945435,0.00019282375,0.0000019851934,0.0005817776,0.057577793],"genre_scores_gemma":[0.89851266,4.731115e-7,0.100966536,0.00017595044,0.00003535819,0.00000761811,4.4929087e-7,0.0000015830375,0.00029937626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991256,0.000003571426,0.0000714481,0.00028289712,0.00028857848,0.00022791974],"domain_scores_gemma":[0.9990737,0.000019096045,0.000024207382,0.0007041208,0.000062429426,0.000116488394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038784678,0.000044695153,0.000041845597,0.000069914895,0.00032493944,0.00023059966,0.0018458858,0.00001415078,0.00005054471],"category_scores_gemma":[0.000044613997,0.000039550327,0.000015836818,0.0009825947,0.0005730129,0.0006098366,0.00030027912,0.00010447917,0.00046608856],"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":[4.3374246e-8,0.000016133554,0.0002024887,6.298383e-7,1.8724444e-7,6.497345e-7,0.00008002593,0.0000011191553,0.35186014,0.63753194,0.00025810144,0.010048518],"study_design_scores_gemma":[0.00019776214,0.00002695786,0.0566219,0.000004190151,0.0000019145218,0.00006264777,0.000021418346,0.21309169,0.24039517,0.1832651,0.30594203,0.0003691967],"about_ca_topic_score_codex":0.000010615255,"about_ca_topic_score_gemma":0.000025054105,"teacher_disagreement_score":0.5420427,"about_ca_system_score_codex":0.000007808631,"about_ca_system_score_gemma":0.00014886976,"threshold_uncertainty_score":0.5990781},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018410549,0.000007962612,0.9777104,0.002779202,0.00003745724,0.00028816468,0.000012721266,0.00010314056,0.0006503667],"genre_scores_gemma":[0.77798134,0.000012857841,0.22152369,0.00019824193,0.000019668556,0.00007781369,6.020795e-7,0.000010161849,0.00017561612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991542,0.00004638539,0.00022783692,0.0002197297,0.00016358147,0.00018826399],"domain_scores_gemma":[0.99856716,0.0005686802,0.00014888814,0.0005948708,0.000049770864,0.00007063249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003061473,0.00011349488,0.0002275497,0.000016964032,0.00039043813,0.000054422664,0.0005392337,0.000023598397,0.000016129066],"category_scores_gemma":[0.000026102338,0.00008158505,0.00030348942,0.00031077326,0.00043169165,0.00012505919,0.00003894911,0.00011509176,0.000006306682],"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.000004764229,0.0002517835,0.00002715638,0.000116222545,0.00011355522,2.7585168e-8,0.0017006412,0.00021045031,0.016337575,0.9128137,0.0006152891,0.067808814],"study_design_scores_gemma":[0.00059267425,0.00011022298,0.0006455589,0.000047074587,0.00014378842,0.000027498802,0.00082377094,0.8631044,0.008803239,0.120415755,0.0050066914,0.00027929875],"about_ca_topic_score_codex":0.000029576962,"about_ca_topic_score_gemma":0.0000041026155,"teacher_disagreement_score":0.862894,"about_ca_system_score_codex":0.00002470865,"about_ca_system_score_gemma":0.000022920527,"threshold_uncertainty_score":0.33269417},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7801718,0.00006402825,0.13470674,0.00009276172,0.00033792085,0.0014063471,0.000022647197,0.00086236873,0.08233539],"genre_scores_gemma":[0.9925768,0.000054246604,0.0027526733,0.0000023251,0.000050292183,0.000010638989,0.0002684947,0.000027665523,0.004256871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99658597,0.00055556657,0.00057277863,0.00081436575,0.0008833363,0.000588012],"domain_scores_gemma":[0.99700636,0.00028152094,0.0005555625,0.0012170466,0.00067930453,0.000260201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095656404,0.00029423434,0.00051035965,0.0010759352,0.00040734909,0.00011609495,0.0020528934,0.000494407,0.00001582706],"category_scores_gemma":[0.000050192575,0.0002996181,0.00022338139,0.0024960511,0.00025992695,0.0015786255,0.00021867624,0.00055518845,0.00002815397],"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.001206219,0.0021905694,0.005846821,0.0007232322,0.00059126277,0.0007866535,0.00432844,0.00033429102,0.45850503,0.51316357,0.00048768998,0.011836229],"study_design_scores_gemma":[0.001741737,0.0024745506,0.061528612,0.0003565545,0.0001373558,0.000048131325,0.004141489,0.038871907,0.8713384,0.01378868,0.004300245,0.0012723076],"about_ca_topic_score_codex":0.0027373352,"about_ca_topic_score_gemma":0.0014621371,"teacher_disagreement_score":0.49937487,"about_ca_system_score_codex":0.00029512844,"about_ca_system_score_gemma":0.0009874544,"threshold_uncertainty_score":0.9999456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013582842,0.000096931486,0.99030703,0.002774013,0.00030869956,0.0005557748,0.000009524316,0.00016307252,0.005649113],"genre_scores_gemma":[0.7900198,0.000010188368,0.20731847,0.002202415,0.0001767301,0.00001729078,0.00002123026,0.000027769694,0.00020611068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715334,0.00005655941,0.00047695218,0.00095079595,0.0009942931,0.0003680403],"domain_scores_gemma":[0.99655753,0.00054815057,0.00036682285,0.0022659355,0.00017082515,0.0000907025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008332356,0.00036159917,0.000400597,0.00051785435,0.00028598518,0.00026438985,0.0035101483,0.00019533573,0.000019725121],"category_scores_gemma":[0.00002181641,0.0002745495,0.00016466477,0.00072773045,0.00037538784,0.00021448502,0.000435507,0.00046788395,0.000051705363],"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.000015166771,0.00027353532,0.000015366017,0.00017399342,0.00002165157,0.00007224286,0.000591621,0.10319081,0.014650026,0.44431403,0.00034186683,0.4363397],"study_design_scores_gemma":[0.00018891806,0.00015263114,0.00004602386,0.0005396313,0.00000915092,0.000011429808,1.0054239e-7,0.93743014,0.019838057,0.039988294,0.0014773028,0.00031832076],"about_ca_topic_score_codex":0.000010102472,"about_ca_topic_score_gemma":0.0000044932226,"teacher_disagreement_score":0.8342393,"about_ca_system_score_codex":0.00017897347,"about_ca_system_score_gemma":0.00035882814,"threshold_uncertainty_score":0.9999707},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003584746,0.00013166918,0.98913443,0.0026574405,0.000563161,0.0003624796,0.000030009332,0.0001411351,0.006621192],"genre_scores_gemma":[0.8252206,0.00003610281,0.16898918,0.0022947674,0.00073329615,0.000044398428,0.00012558738,0.00007578122,0.0024802724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695647,0.00003019761,0.0004977733,0.0010069956,0.001094081,0.00041449183],"domain_scores_gemma":[0.9967904,0.0006597513,0.0003309521,0.001999337,0.00014225715,0.00007731021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062307116,0.0003853121,0.00035616438,0.00044776674,0.00027424065,0.0002622683,0.00409557,0.00021751905,0.00002886051],"category_scores_gemma":[0.000031535958,0.00029095015,0.00016660805,0.0005113,0.00082723424,0.0002911323,0.0010226514,0.0005674652,0.00008103071],"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.0000011096154,0.000048917922,0.000004189893,0.000015891295,0.000005859557,0.000011791378,0.00006547216,0.019527221,0.00033169106,0.91086125,0.00020851495,0.06891807],"study_design_scores_gemma":[0.0000800566,0.00004544844,0.00006818674,0.00008668022,0.0000041067988,0.0000103645925,4.4035794e-8,0.5493874,0.00092445593,0.44872808,0.0004376204,0.00022755393],"about_ca_topic_score_codex":0.000025203872,"about_ca_topic_score_gemma":0.000029216591,"teacher_disagreement_score":0.8248621,"about_ca_system_score_codex":0.00023304268,"about_ca_system_score_gemma":0.00034859122,"threshold_uncertainty_score":0.9999543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007224922,0.00009589903,0.9904308,0.00062850484,0.000068759655,0.00086044875,0.00012124876,0.00040158562,0.00016784645],"genre_scores_gemma":[0.3656702,0.000014463438,0.63277197,0.000077104,0.00006275554,0.00033214374,0.00039270698,0.00001626832,0.00066238706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988752,0.00001862255,0.00024125988,0.00040991468,0.00012495836,0.0003300269],"domain_scores_gemma":[0.9992172,0.000036903235,0.00008183391,0.00046359404,0.000092119,0.00010832726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000148573,0.00013409033,0.00012202434,0.00004133403,0.00043653802,0.00035949517,0.00031558803,0.00003408777,0.000041819756],"category_scores_gemma":[0.000011642594,0.00012895519,0.0000596734,0.000290637,0.000037248275,0.0004737416,0.00016574249,0.000048877202,0.000010791089],"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.000004292877,0.0006523519,0.00014554072,0.000097049524,0.000090976995,0.00000619892,0.00076248863,0.00007145451,0.16072431,0.31051245,0.0049311765,0.5220017],"study_design_scores_gemma":[0.00075944373,0.000045681267,0.00011221159,0.000004281729,0.000022023265,0.000013998172,0.000047529044,0.96449673,0.014478193,0.0019402495,0.01790559,0.0001740578],"about_ca_topic_score_codex":0.000114750226,"about_ca_topic_score_gemma":0.000013628108,"teacher_disagreement_score":0.96442527,"about_ca_system_score_codex":0.000048875943,"about_ca_system_score_gemma":0.000022485074,"threshold_uncertainty_score":0.525864},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7050877,0.00024760162,0.28537786,0.0010856178,0.0067143436,0.0002659444,0.000027330187,0.0001615909,0.0010319997],"genre_scores_gemma":[0.9601513,0.0000058312003,0.038638894,0.0001164112,0.0010287153,0.0000042627144,0.000021891372,0.000016463144,0.000016196505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791133,0.00018712197,0.00066158775,0.00022952816,0.00075102365,0.00025940093],"domain_scores_gemma":[0.9981716,0.00031820586,0.00055418524,0.00038000845,0.0002643253,0.000311646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007126454,0.00018740905,0.00033031314,0.0002208133,0.00013152564,0.00017872635,0.0008687219,0.00009479672,0.000038595266],"category_scores_gemma":[0.00009481437,0.00016719368,0.0001357151,0.00038605605,0.00005277792,0.000437631,0.000121709716,0.0003381041,0.00006993713],"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.00017440405,0.001207527,0.00515418,0.000018676988,0.00025096055,0.00039949812,0.0014705918,0.00028898183,0.025855616,0.91998655,0.017377853,0.027815156],"study_design_scores_gemma":[0.015747815,0.0034954643,0.0017517683,0.00032970795,0.0002049473,0.00021321833,0.00096002605,0.071982846,0.19794767,0.6633615,0.042710412,0.0012946615],"about_ca_topic_score_codex":0.000049543163,"about_ca_topic_score_gemma":0.0000019688973,"teacher_disagreement_score":0.2566251,"about_ca_system_score_codex":0.0001763523,"about_ca_system_score_gemma":0.00029529864,"threshold_uncertainty_score":0.681796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077183503,0.00010360561,0.98717076,0.00042050812,0.0003298452,0.000460029,0.000008188089,0.0006352464,0.0031534592],"genre_scores_gemma":[0.77959734,4.6949773e-7,0.21595608,0.00021844724,0.00014331694,0.00025247643,0.00005388395,0.00001705822,0.0037609134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988619,0.000031495925,0.00023088115,0.00035528056,0.0002536889,0.0002667446],"domain_scores_gemma":[0.99871856,0.000084501,0.000076612996,0.00079324626,0.00015939253,0.00016769361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004052241,0.00012088237,0.00013921442,0.000056628764,0.00016886719,0.0003527802,0.0007131073,0.000054842563,0.0000061565233],"category_scores_gemma":[0.000034040564,0.00010793416,0.000059137248,0.00023683229,0.000015376478,0.00024486723,0.000106289146,0.000045233086,0.00015532084],"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.00000538404,0.00039377666,0.00049447775,0.00018958682,0.000047494676,0.000016472115,0.00060276827,0.088709675,0.08503187,0.68581474,0.12896411,0.00972966],"study_design_scores_gemma":[0.00041987756,0.000033398235,0.000005477128,0.0000063270018,0.0000051048855,0.0000029414653,0.000052841457,0.9598438,0.0071661104,0.0001841766,0.032128222,0.00015173166],"about_ca_topic_score_codex":0.000114331786,"about_ca_topic_score_gemma":0.00000921346,"teacher_disagreement_score":0.8711341,"about_ca_system_score_codex":0.00006697318,"about_ca_system_score_gemma":0.00021271917,"threshold_uncertainty_score":0.44014272},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070954725,0.000009455342,0.9144449,0.00073118164,0.000026296733,0.00054466195,0.000012209923,0.00006977005,0.013206752],"genre_scores_gemma":[0.80315274,0.000010132309,0.19610623,0.00020338329,0.000033001696,0.00035272294,0.000008824397,0.000017332579,0.000115618364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992589,0.0000068018417,0.00024593473,0.00016645431,0.00017000709,0.00015194528],"domain_scores_gemma":[0.9988701,0.00034212242,0.00010556213,0.0006210042,0.00002595079,0.00003530013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020268236,0.0001086318,0.00015574857,0.000022141645,0.00010766055,0.00004763374,0.0005796739,0.000037256217,0.00003467754],"category_scores_gemma":[0.000015118033,0.00006938716,0.00009441671,0.00021331199,0.00004364204,0.000035535395,0.000037710022,0.000047466518,0.000048080798],"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.0000028649401,0.00006976419,0.0000014260598,0.000023568184,0.000013218646,2.2421538e-7,0.0006344763,0.000020649835,0.0047291997,0.99145424,0.0005948623,0.002455527],"study_design_scores_gemma":[0.0006393726,0.000030316749,0.000021450569,0.00002624777,0.000039113267,0.000011207971,0.000334069,0.056667265,0.08325623,0.85223997,0.0064721033,0.0002626707],"about_ca_topic_score_codex":9.660137e-7,"about_ca_topic_score_gemma":8.1811135e-7,"teacher_disagreement_score":0.73219806,"about_ca_system_score_codex":0.000008586731,"about_ca_system_score_gemma":0.000018673489,"threshold_uncertainty_score":0.28295264},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27814987,0.00007157247,0.72058904,0.00046111445,0.00020641118,0.00003963967,0.0000072338385,0.000022136492,0.00045296687],"genre_scores_gemma":[0.957383,0.0000051208162,0.04217659,0.000030804138,0.00032638735,0.0000019124113,0.000030653908,0.000007429713,0.000038120663],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846655,0.000030285677,0.00048217177,0.00014418231,0.00078658265,0.000090235444],"domain_scores_gemma":[0.99844503,0.00006436757,0.00060458883,0.00021409012,0.00063825573,0.00003365353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014530269,0.00008496763,0.00015266023,0.0001124534,0.00003601806,0.00006859715,0.0006976826,0.000033974924,0.000008798741],"category_scores_gemma":[0.000012019832,0.000084737025,0.0001558343,0.00012889945,0.0000347904,0.0006001806,0.00010994802,0.00009773049,0.000014015374],"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.00001722384,0.0007285367,0.0007538168,0.000008491992,0.000116994575,0.00001995924,0.00019550206,0.030034317,0.52219236,0.36170307,0.00060091534,0.0836288],"study_design_scores_gemma":[0.00044170843,0.000023700186,0.0044646254,0.00003910191,0.000015466012,0.000037267546,0.0000032987737,0.31580007,0.31249472,0.3664466,0.000143237,0.000090195856],"about_ca_topic_score_codex":0.000032717388,"about_ca_topic_score_gemma":0.0000010558148,"teacher_disagreement_score":0.6792331,"about_ca_system_score_codex":0.00005185984,"about_ca_system_score_gemma":0.00006330461,"threshold_uncertainty_score":0.34554756},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011446606,0.000020974981,0.9870794,0.00029258284,0.000012960425,0.00017656015,5.4875693e-7,0.00014337339,0.00082699873],"genre_scores_gemma":[0.9145332,0.0000025253485,0.08500602,0.00030470066,0.000016561999,0.000008140265,0.000012921184,0.0000017274268,0.00011421624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965686,0.000004121508,0.000085811575,0.00013425855,0.00005237338,0.00006657196],"domain_scores_gemma":[0.9997386,0.00003901029,0.000017666576,0.00013803676,0.00004270549,0.000023989633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005857452,0.000038346323,0.000038279493,0.000026031046,0.00007703665,0.00016887127,0.00009569688,0.000021202482,0.0000027616563],"category_scores_gemma":[0.00001759886,0.000035556244,0.000012243804,0.000090572335,0.000002910016,0.0004508161,0.00001630776,0.000010018827,0.0000044288918],"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.0000010890005,0.00002789215,0.000009331813,0.0000032855332,0.0000014715823,6.4818096e-8,0.00015115975,0.14648668,0.0011469877,0.5983879,0.00008154265,0.25370258],"study_design_scores_gemma":[0.00009924236,0.000020349898,0.00011795888,0.0000014537287,0.000001782106,4.958666e-7,0.000003159751,0.98608255,0.00035043663,0.01097927,0.0022924952,0.000050780567],"about_ca_topic_score_codex":0.0000018970702,"about_ca_topic_score_gemma":0.0000010499439,"teacher_disagreement_score":0.9030866,"about_ca_system_score_codex":0.0000057866946,"about_ca_system_score_gemma":0.000008911304,"threshold_uncertainty_score":0.16284294},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06921194,0.0003645221,0.9287691,0.00022540728,0.000019965268,0.00011649,3.4553992e-7,0.00021041733,0.0010818277],"genre_scores_gemma":[0.71946144,0.000008189988,0.2804122,0.000050071983,0.000040202598,0.000010204806,5.0444106e-7,0.0000038656003,0.000013312759],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99903136,0.000039554237,0.00022635178,0.00019128587,0.00030837627,0.00020307396],"domain_scores_gemma":[0.9994867,0.0000528441,0.0000733603,0.00022720797,0.00003674354,0.00012317502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005507142,0.00009537957,0.00015159944,0.000058469872,0.00009590416,0.000056882967,0.00031328772,0.00012176201,0.00005968425],"category_scores_gemma":[0.00004690445,0.00006913892,0.000031671425,0.00020317698,0.00014496522,0.00031868112,0.00018212011,0.00011360475,0.0000087116005],"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":[6.813418e-7,0.00015814065,0.0001024996,0.00005479168,0.000003079387,0.0000033617362,0.00013280114,2.2313945e-7,0.9127373,0.019118665,0.000011757074,0.0676767],"study_design_scores_gemma":[0.00006283836,0.000025749325,0.00017805048,0.000030261312,0.000010780819,0.00026047588,0.00002837103,0.04470617,0.94791967,0.006393083,0.0002598079,0.00012471953],"about_ca_topic_score_codex":0.0000071406585,"about_ca_topic_score_gemma":2.2279357e-7,"teacher_disagreement_score":0.6502495,"about_ca_system_score_codex":0.000013624019,"about_ca_system_score_gemma":0.000023242803,"threshold_uncertainty_score":0.28194034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026928976,0.00001056391,0.9299125,0.0003052717,0.000119287884,0.00026748498,0.00000385806,0.000970428,0.041481633],"genre_scores_gemma":[0.9269779,4.0229733e-7,0.07209321,0.00034766193,0.000020232768,0.000052100586,0.000009844868,0.000013394867,0.00048528175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998631,0.00005855798,0.00024642196,0.00048341719,0.00028988687,0.00029068664],"domain_scores_gemma":[0.998294,0.000044477554,0.00006520735,0.0014047846,0.000047619324,0.00014390342],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001943214,0.00016433615,0.00018242496,0.000101693695,0.000110764464,0.00009694544,0.001104204,0.00007829693,0.00019082753],"category_scores_gemma":[0.000011041789,0.00014041313,0.000103073995,0.00030237623,0.00003535518,0.00016099474,0.00015295185,0.00010347111,0.000808664],"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.000008842219,0.0007639185,0.0002677837,0.000030901952,0.000020746136,0.0000962383,0.00028699925,0.00013588896,0.025869826,0.9597442,0.0008856991,0.011888943],"study_design_scores_gemma":[0.00034157856,0.0000844792,0.001234593,0.000013868406,0.0000059535655,0.0000070037318,0.000012048391,0.97668374,0.016807605,0.001588651,0.0030167806,0.0002037241],"about_ca_topic_score_codex":0.000056468572,"about_ca_topic_score_gemma":0.0000036866268,"teacher_disagreement_score":0.97654784,"about_ca_system_score_codex":0.000034760098,"about_ca_system_score_gemma":0.000047318885,"threshold_uncertainty_score":0.9999693},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18754105,0.0003733243,0.80887413,0.0013367417,0.000093020375,0.00019470246,2.8071696e-7,0.0007696521,0.0008171321],"genre_scores_gemma":[0.6742193,9.461426e-7,0.32526997,0.00037744394,0.000091404065,0.0000018769894,0.000005603031,0.0000070336164,0.00002641235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851894,0.00003270589,0.00023750652,0.00046544962,0.0003134878,0.0004319155],"domain_scores_gemma":[0.9991317,0.000100099955,0.00012869765,0.0004568559,0.000090900954,0.00009177868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020645268,0.00019492522,0.00018175208,0.00008487004,0.00037902576,0.00041186047,0.0007912773,0.0000688356,0.0000017182605],"category_scores_gemma":[0.000016873404,0.00015298203,0.00006611913,0.00066602393,0.000026897373,0.00033317733,0.00013023855,0.0004815267,0.000016849815],"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.000006420667,0.00009783439,0.00045759304,0.000015857162,0.000019601159,0.000027224085,0.0011863424,0.053781837,0.0007494587,0.100845866,0.00008739661,0.84272456],"study_design_scores_gemma":[0.00019805234,0.00005023858,0.0006966392,0.00004493478,0.000005106782,0.00003626037,0.000013541303,0.99403244,0.00044084206,0.003438118,0.0008101008,0.00023373988],"about_ca_topic_score_codex":0.000024762523,"about_ca_topic_score_gemma":0.000001811722,"teacher_disagreement_score":0.9402506,"about_ca_system_score_codex":0.00002767269,"about_ca_system_score_gemma":0.000034767814,"threshold_uncertainty_score":0.6238426},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23066649,0.000639842,0.7676616,0.000112920316,0.00021367865,0.00035124418,0.000069058835,0.000104967476,0.00018026233],"genre_scores_gemma":[0.9983516,0.000041800453,0.001015963,0.000018641587,0.000077511955,0.0000334186,0.00004315294,0.0000102802705,0.0004076481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988135,0.00019823121,0.0002683471,0.00029974547,0.00019346844,0.0002267134],"domain_scores_gemma":[0.99848896,0.0008148256,0.00011813864,0.00039639536,0.00005854951,0.00012314602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046037819,0.00013832918,0.00028430513,0.00006274076,0.00011663958,0.00008065245,0.00041865927,0.00010379508,0.000011181365],"category_scores_gemma":[0.000058119236,0.000108966764,0.00007739309,0.00019426012,0.00008430048,0.00012804437,0.00008428427,0.00008129386,0.000014794728],"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.00010907089,0.00007543492,0.0064369813,0.00009068002,0.00007874527,0.0000043289465,0.00034415632,0.00003054861,0.0025752326,0.9797146,0.00010756066,0.010432713],"study_design_scores_gemma":[0.0051780483,0.00081133255,0.054968495,0.00043399568,0.00024705648,0.00011566277,0.00038460494,0.37977204,0.0040292474,0.44492725,0.10736338,0.0017688815],"about_ca_topic_score_codex":0.000019081792,"about_ca_topic_score_gemma":0.000002352422,"teacher_disagreement_score":0.7676851,"about_ca_system_score_codex":0.000021152262,"about_ca_system_score_gemma":0.000027799802,"threshold_uncertainty_score":0.44435358},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94946975,0.00078145356,0.026594577,0.02214771,0.00073630945,0.00019626907,0.0000036033039,0.00002621231,0.000044133514],"genre_scores_gemma":[0.9581346,0.000045277113,0.041432936,0.00014628167,0.0001707502,0.000002696641,0.0000030650144,0.0000064631486,0.000057921417],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816906,0.00018879003,0.0003816849,0.0002030011,0.00082116923,0.00023630145],"domain_scores_gemma":[0.99645305,0.001992724,0.0001490008,0.00023254514,0.0010775789,0.000095130745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004459322,0.00007644596,0.00014312276,0.000551292,0.00012969789,0.00020960563,0.0013805527,0.00003905559,0.0000040490613],"category_scores_gemma":[0.001239183,0.00006803705,0.000063886946,0.00035122462,0.00009470551,0.00030939074,0.0005340628,0.00083928433,0.0000042841057],"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.00028379672,0.00035023523,0.0009768584,0.000033981887,0.00007136697,0.00014072185,0.0005357215,0.00008743091,0.8837393,0.054713964,0.003007799,0.05605881],"study_design_scores_gemma":[0.005254157,0.0004345569,0.054247223,0.0011935966,0.000012668996,0.0010557454,0.0000878302,0.82226807,0.060579825,0.027181683,0.027223868,0.00046075037],"about_ca_topic_score_codex":0.000022165741,"about_ca_topic_score_gemma":0.000014988648,"teacher_disagreement_score":0.8231595,"about_ca_system_score_codex":0.00005341033,"about_ca_system_score_gemma":0.0001750808,"threshold_uncertainty_score":0.36463195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08217196,0.000012422561,0.9052111,0.0014740076,0.0002051722,0.0001432536,0.0000021132141,0.00017612016,0.010603838],"genre_scores_gemma":[0.90102386,0.0000021652938,0.09823941,0.0006677962,0.000034496283,0.0000065263753,6.0035916e-7,0.0000054430852,0.000019676087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998019,0.000065297456,0.0002971041,0.0005684753,0.0006541974,0.0003959187],"domain_scores_gemma":[0.9979618,0.00042585604,0.00008914169,0.0011946133,0.00012255661,0.000206005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006206962,0.00014917401,0.00018999862,0.00020287187,0.00023099793,0.00016878522,0.002395398,0.000032921467,0.00021119523],"category_scores_gemma":[0.000100209225,0.00012443254,0.000072803254,0.0013550814,0.001729631,0.0003372966,0.0006870849,0.00014525936,0.00043650955],"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.0000014073566,0.00010376925,0.000008934382,0.0000022647703,0.000001953068,0.0000045513975,0.00023341876,0.00015820531,0.0029287608,0.9770909,0.00015002157,0.019315818],"study_design_scores_gemma":[0.00025734966,0.0001375609,0.00034540152,0.000024335905,0.0000025360916,0.000017957587,0.0000010707686,0.75287926,0.019411327,0.2266907,0.00008469907,0.00014781945],"about_ca_topic_score_codex":0.00000246913,"about_ca_topic_score_gemma":1.695381e-7,"teacher_disagreement_score":0.81885195,"about_ca_system_score_codex":0.000026929914,"about_ca_system_score_gemma":0.0000288315,"threshold_uncertainty_score":0.63728976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3923086,0.000109461784,0.59736675,0.003566408,0.000042541407,0.00078941375,0.00005817429,0.00010518961,0.0056534675],"genre_scores_gemma":[0.92001325,0.000008572805,0.079851374,0.00003741501,0.000003993641,0.000060729995,0.000013129788,0.0000050368217,0.0000065057948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984971,0.0004866513,0.00031343175,0.00015202853,0.00044040915,0.000110340916],"domain_scores_gemma":[0.9957745,0.00079440995,0.00029170993,0.00237199,0.0007269518,0.00004040674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271403,0.00008955845,0.00015774506,0.000049044666,0.0003000229,0.000022214059,0.001603859,0.000038945735,0.000008430987],"category_scores_gemma":[0.0003004767,0.00006554235,0.000067542605,0.00045357482,0.00068694836,0.00011307787,0.00030388392,0.00012622167,0.000002971125],"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.0000027820754,0.0004536414,0.0022927774,0.00001958316,0.00010677009,2.939607e-8,0.0019618217,0.005570715,0.2961227,0.685023,0.00008071404,0.008365456],"study_design_scores_gemma":[0.00060476,0.00003390265,0.0048263483,0.00006852249,0.000110056906,0.000006144444,0.00012958255,0.95438474,0.031832166,0.0074057938,0.00048969395,0.00010829064],"about_ca_topic_score_codex":0.000116739364,"about_ca_topic_score_gemma":0.00033149152,"teacher_disagreement_score":0.94881403,"about_ca_system_score_codex":0.000023477649,"about_ca_system_score_gemma":0.0002174631,"threshold_uncertainty_score":0.2980396},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26109785,0.0000048819134,0.7383564,0.00020311476,0.000016413182,0.00014615094,0.000012878945,0.00001603385,0.00014627133],"genre_scores_gemma":[0.8650865,0.000006933261,0.13485329,0.000011868842,0.0000027232695,0.000008781375,0.0000013396195,0.0000054588063,0.000023079518],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990498,0.00006424234,0.00038559508,0.00014235998,0.0002645029,0.00009349774],"domain_scores_gemma":[0.9982182,0.00049013825,0.00048491784,0.0005881622,0.00019134236,0.000027245518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024673186,0.000080459795,0.00027991604,0.000026833715,0.000053506188,0.0000029238809,0.00044852166,0.00003190861,0.000010526366],"category_scores_gemma":[0.00005029025,0.000059456164,0.00026371656,0.0007134427,0.00058506295,0.00006383003,0.000029302728,0.00009083658,0.0000023192013],"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.000042070642,0.0027938324,0.0007871868,0.00081971736,0.00037488312,3.877226e-8,0.009255624,0.005930398,0.48946503,0.46582732,0.00010355626,0.024600342],"study_design_scores_gemma":[0.00020742681,0.00015864665,0.017213764,0.00006343528,0.0000779051,0.0000014719129,0.0004701141,0.933546,0.03273238,0.015392002,0.000032672255,0.00010417059],"about_ca_topic_score_codex":0.000039599916,"about_ca_topic_score_gemma":0.0000020133873,"teacher_disagreement_score":0.92761564,"about_ca_system_score_codex":0.000019051986,"about_ca_system_score_gemma":0.00007073076,"threshold_uncertainty_score":0.2424552},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2579498,0.00004876819,0.7358467,0.00004367164,0.000048856404,0.00035712295,0.00000543108,0.0001182564,0.005581429],"genre_scores_gemma":[0.7607043,0.000063152234,0.23908192,0.000023074896,0.000012929778,0.00006432531,0.000014710328,0.000011112703,0.00002448617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998533,0.00002216968,0.0006779481,0.00025565625,0.00032553053,0.00018566441],"domain_scores_gemma":[0.99834454,0.00024281816,0.00053880323,0.0007823903,0.00004820408,0.000043244632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037988258,0.0001478602,0.00037796283,0.00013538847,0.000045725727,0.000021018597,0.00082096906,0.000063900465,0.000013203466],"category_scores_gemma":[0.000063789696,0.00014392934,0.00004866942,0.0006174438,0.00011631154,0.0002649967,0.00015677785,0.00007737842,0.00003589915],"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.0000011049855,0.00025502424,0.000076330034,0.00066982105,0.000005683913,6.5309075e-7,0.0010586871,0.00019650784,0.3171958,0.6637839,0.000001553568,0.016754922],"study_design_scores_gemma":[0.00040069604,0.00006553074,0.00023897276,0.00018858085,0.0000138233045,0.0000059684908,0.00010464541,0.5255126,0.35719004,0.11455805,0.0014906325,0.00023049142],"about_ca_topic_score_codex":0.0000046246064,"about_ca_topic_score_gemma":0.0000043505224,"teacher_disagreement_score":0.54922587,"about_ca_system_score_codex":0.000018335153,"about_ca_system_score_gemma":0.00004571101,"threshold_uncertainty_score":0.5869268},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039371118,0.000027966757,0.95662796,0.0005407669,0.00007677648,0.0001960209,0.000097217155,0.0001351899,0.0029269555],"genre_scores_gemma":[0.90809816,0.000011693065,0.08866183,0.00054577005,0.000071393995,0.0000027518133,0.0020729473,0.000013808084,0.0005216722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883866,0.0000360827,0.00020081262,0.00027069624,0.00042684964,0.00022687689],"domain_scores_gemma":[0.9986787,0.00015767576,0.00013020032,0.0008587077,0.000072505005,0.00010220416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024685025,0.00013164933,0.00009479401,0.00006778261,0.00057738443,0.00015594179,0.0012339301,0.000056102774,0.00006429289],"category_scores_gemma":[0.000002937561,0.00008660908,0.000022901575,0.00031148444,0.00012335637,0.0022554293,0.00068163074,0.00012653798,0.00003661379],"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.00040741995,0.0014032979,0.0022142036,0.000100588055,0.00031856727,0.000116752184,0.005498186,0.031636406,0.1228251,0.20928569,0.28925,0.3369438],"study_design_scores_gemma":[0.0006506109,0.000021512747,0.0011667822,0.000025076932,0.000014870772,0.00007073671,0.0002847388,0.93806624,0.007414796,0.00011625957,0.051977087,0.00019130936],"about_ca_topic_score_codex":0.00019720494,"about_ca_topic_score_gemma":0.000062311236,"teacher_disagreement_score":0.9064298,"about_ca_system_score_codex":0.00011329309,"about_ca_system_score_gemma":0.000076015705,"threshold_uncertainty_score":0.44408327},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23862597,0.00026145106,0.7350278,0.020275509,0.00031507947,0.0011974995,0.0002265033,0.00077691826,0.0032932924],"genre_scores_gemma":[0.6838674,0.0000069049543,0.31511533,0.0004148787,0.0000126474515,0.00036769224,0.00011627311,0.000007699879,0.00009118976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991352,0.00007325272,0.00021490714,0.00026617027,0.00011327956,0.000197208],"domain_scores_gemma":[0.9959522,0.0007631188,0.00011315169,0.0028618553,0.00022526513,0.00008439162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002837586,0.00011702734,0.0001403128,0.00008513423,0.00060305797,0.000091120775,0.0023193448,0.00006193639,0.000012281761],"category_scores_gemma":[0.00007540986,0.00011720175,0.000093651855,0.0003851615,0.0002950852,0.0002340877,0.0004969863,0.00028408787,0.000042533648],"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.0000039406277,0.0004517528,0.0014504989,0.000006959313,0.000047379315,6.0748323e-7,0.00069828646,0.00032579535,0.16649981,0.8218119,0.0037022398,0.0050007924],"study_design_scores_gemma":[0.0010035222,0.000038095506,0.017537966,0.00001245132,0.000020660522,0.000013604737,0.000035345667,0.90604955,0.0033804015,0.027649453,0.043922767,0.00033616085],"about_ca_topic_score_codex":0.00008143918,"about_ca_topic_score_gemma":0.0004186356,"teacher_disagreement_score":0.90572375,"about_ca_system_score_codex":0.000011187655,"about_ca_system_score_gemma":0.000090180234,"threshold_uncertainty_score":0.47793487},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21376048,0.00011889013,0.7834228,0.0002570953,0.000085744476,0.00023889146,0.000005404669,0.00014290054,0.001967742],"genre_scores_gemma":[0.97919303,0.000005701496,0.020618394,0.000014522948,0.000031734864,0.000022968681,0.000034996803,0.0000042198217,0.000074441836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990965,0.00002670181,0.00027647664,0.00026949184,0.00017830617,0.0001525257],"domain_scores_gemma":[0.9992036,0.000020869646,0.00012087071,0.0005612415,0.00004773048,0.000045669392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001392981,0.00009950763,0.00013221242,0.000048374262,0.00012811947,0.000038387443,0.00038038648,0.00003250755,0.000033474946],"category_scores_gemma":[0.000007493973,0.00009690205,0.000033805074,0.00020750683,0.00015642855,0.00018554446,0.00020069152,0.00005468836,0.000021925734],"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.0000018239916,0.000121535886,0.00027895928,0.0000658559,0.0000070015744,0.0000013885067,0.00013602762,0.00028304075,0.035271235,0.95550483,0.000908415,0.0074199094],"study_design_scores_gemma":[0.00027609797,0.000062478204,0.033357587,0.000018927287,0.0000113798915,0.000017669643,0.0000131097395,0.6583628,0.020852126,0.2824867,0.0042944564,0.00024664527],"about_ca_topic_score_codex":0.00029393373,"about_ca_topic_score_gemma":0.000017460088,"teacher_disagreement_score":0.76543254,"about_ca_system_score_codex":0.000014727188,"about_ca_system_score_gemma":0.00002324168,"threshold_uncertainty_score":0.3951551},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043460205,0.00002143558,0.950114,0.00027161802,0.00001041597,0.000053853433,1.0581787e-7,0.00004111631,0.006027217],"genre_scores_gemma":[0.90431273,0.0000058166,0.09522746,0.000044523,0.00000303864,0.0000041273165,2.9132974e-7,0.0000011279087,0.00040091155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997063,0.000010538085,0.00007195193,0.00008979315,0.0000582544,0.00006310813],"domain_scores_gemma":[0.99972653,0.000020233108,0.000014464009,0.00021153892,0.00000872018,0.000018536204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004413567,0.000026606465,0.00004242269,0.000034860324,0.000021227159,0.0000046490536,0.00027308924,0.000015050065,0.000023878101],"category_scores_gemma":[0.0000022788786,0.000024176587,0.000012461465,0.00019848495,0.0000190409,0.00007968733,0.000041119554,0.000024781657,0.000038039674],"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.0000064093338,0.0010587504,0.019001404,0.00003637994,0.000022149365,0.00015433253,0.011667092,0.006195417,0.24064918,0.6564673,0.012266588,0.052474964],"study_design_scores_gemma":[0.00067068276,0.000085449006,0.08951181,0.00001493232,0.0000028627896,0.0001561689,0.00015672811,0.82045794,0.07993715,0.004707161,0.0039620665,0.00033702393],"about_ca_topic_score_codex":0.00002758896,"about_ca_topic_score_gemma":0.000002131096,"teacher_disagreement_score":0.8608525,"about_ca_system_score_codex":0.0000055665128,"about_ca_system_score_gemma":0.000031908392,"threshold_uncertainty_score":0.09858926},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036946792,0.000807207,0.95832247,0.0014936334,0.00012768486,0.0007298872,0.000053347547,0.0003016377,0.0012173165],"genre_scores_gemma":[0.9928103,0.0000123699765,0.0057428204,0.00008537382,0.00012826601,0.00024823679,0.000046422003,0.000015242774,0.0009109773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986026,0.00006994685,0.00032858207,0.00046695716,0.00021304037,0.0003188673],"domain_scores_gemma":[0.9990876,0.00011909321,0.00010467627,0.00046006826,0.0000772263,0.00015136154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029689603,0.00017785447,0.00028898587,0.000054288812,0.0002066297,0.00036259837,0.00050188013,0.00008717048,0.0000016852827],"category_scores_gemma":[0.000028083661,0.00014602103,0.00009019217,0.00015007249,0.00006399772,0.00027407336,0.00013715577,0.00008503027,0.000016818314],"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.000015599386,0.00014160218,0.0001531527,0.00009166877,0.00011004354,0.000012486528,0.0018274833,0.00021884959,0.029780205,0.886791,0.0009023229,0.07995556],"study_design_scores_gemma":[0.00059025397,0.00007231178,0.0002274123,0.000034271838,0.000023902248,0.000028799408,0.00016909219,0.95978063,0.0006334815,0.0010455844,0.03711548,0.00027874863],"about_ca_topic_score_codex":0.00009963318,"about_ca_topic_score_gemma":0.000022761578,"teacher_disagreement_score":0.9595618,"about_ca_system_score_codex":0.000044493314,"about_ca_system_score_gemma":0.00004059251,"threshold_uncertainty_score":0.5954565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057872955,0.000036368685,0.94120157,0.00022196877,0.000076535376,0.00017635805,0.0000016453633,0.00032123429,0.00009137896],"genre_scores_gemma":[0.5777836,8.931079e-7,0.42206734,0.000053284424,0.000064919965,0.000010380042,0.000005109625,0.000010319633,0.0000041562917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846894,0.000038164675,0.0003812857,0.00046869536,0.00031277383,0.00033015147],"domain_scores_gemma":[0.9990656,0.000115946,0.00008663559,0.00052340067,0.000047549853,0.00016087311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015549784,0.00020796347,0.00025030805,0.00009111655,0.00036717835,0.00083727716,0.00044331286,0.000078355595,0.000008725746],"category_scores_gemma":[0.0000028137133,0.00018855267,0.0000958337,0.0002082176,0.000060340997,0.0007956199,0.00027146918,0.0001395757,0.000015615273],"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":[4.5234194e-7,0.00013001544,2.4118145e-7,0.000028469161,0.0000067794363,0.0000041872067,0.00017353002,0.5338596,0.00070686295,0.4636861,9.394902e-7,0.0014027893],"study_design_scores_gemma":[0.00034426272,0.000013369029,7.2791215e-7,0.00007464076,0.00002105858,0.000009383817,0.0000052938412,0.81708956,0.0014741434,0.18076701,0.000008348045,0.00019220925],"about_ca_topic_score_codex":0.00001209966,"about_ca_topic_score_gemma":1.8427065e-7,"teacher_disagreement_score":0.51991063,"about_ca_system_score_codex":0.000035860612,"about_ca_system_score_gemma":0.00007490488,"threshold_uncertainty_score":0.8073883},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6749277,0.000042940195,0.32433292,0.00005783599,0.000026480471,0.00044966044,6.3337535e-7,0.00005326872,0.00010853478],"genre_scores_gemma":[0.9979375,0.0000020203802,0.0019194618,0.000014492581,0.000077214936,0.000021877006,0.000009689437,0.000005861306,0.000011856574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878216,0.00015390902,0.0003031532,0.00024144954,0.00038059457,0.00013874118],"domain_scores_gemma":[0.9989126,0.00020512046,0.00015259969,0.0003685973,0.00031633183,0.000044769946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013624497,0.00008562486,0.00010440602,0.00007767125,0.00022963472,0.0000678859,0.0001279458,0.000039255614,0.000012004084],"category_scores_gemma":[0.000039375667,0.00008669189,0.000020556925,0.00041768714,0.000019599962,0.0008312691,0.000080536855,0.000052096973,0.000006415546],"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.0000017516014,0.00006203982,0.00572951,0.0000026914886,0.000005025258,6.0768764e-7,0.00057711813,0.65813977,0.000012227162,0.00048353872,8.4520036e-7,0.33498487],"study_design_scores_gemma":[0.00058351277,0.000049804774,0.038197003,0.0000051114675,0.00002406831,0.000009794543,0.00007823928,0.9606665,0.000020263342,0.000113475435,0.00016708771,0.000085184765],"about_ca_topic_score_codex":0.000018812085,"about_ca_topic_score_gemma":0.00006317059,"teacher_disagreement_score":0.3348997,"about_ca_system_score_codex":0.000059971717,"about_ca_system_score_gemma":0.000050352173,"threshold_uncertainty_score":0.3535193},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5031448,0.011808075,0.46744904,0.0038855902,0.0035696756,0.001338512,0.000049195474,0.0004943028,0.008260814],"genre_scores_gemma":[0.98986113,0.00023164894,0.009560213,0.00007345074,0.000052059695,0.00005027846,0.000010372932,0.000013682031,0.00014717116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988646,0.0001174456,0.0003340855,0.00031892842,0.0001580621,0.00020687703],"domain_scores_gemma":[0.99809223,0.00014588599,0.0003438469,0.0012838715,0.000068497866,0.00006568098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023428164,0.00019296081,0.00032019682,0.0000615397,0.00011284859,0.000074052834,0.0013629054,0.00024230822,0.00002081584],"category_scores_gemma":[0.000026481008,0.00015052813,0.00009506131,0.00016162236,0.00012048845,0.00007471242,0.002898147,0.00049490493,0.000015886088],"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":[8.650609e-7,0.0001744193,0.0021168324,0.00042001499,0.000044597065,0.0000013802343,0.0017433817,0.00015825209,0.0025444427,0.98449326,0.003921423,0.004381131],"study_design_scores_gemma":[0.0008258182,0.000071926675,0.06446416,0.0009442716,0.00017411672,0.00023233808,0.00014627013,0.27512893,0.059983347,0.5538002,0.042581584,0.0016470294],"about_ca_topic_score_codex":0.000043321746,"about_ca_topic_score_gemma":0.0000035514547,"teacher_disagreement_score":0.48671633,"about_ca_system_score_codex":0.000036344547,"about_ca_system_score_gemma":0.00008898448,"threshold_uncertainty_score":0.6138359},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034807093,0.000010943768,0.9478652,0.0005016255,0.00016916412,0.00008817919,8.8121305e-7,0.00020937275,0.01634756],"genre_scores_gemma":[0.80759925,0.0000013523091,0.19209248,0.00025764908,0.000036831854,0.000003847635,4.16616e-7,0.0000033533336,0.000004825674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984088,0.000057572324,0.00023496897,0.0004675509,0.0005137162,0.00031740512],"domain_scores_gemma":[0.9983055,0.00018510394,0.000065774846,0.0011610809,0.0001162637,0.00016624866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011068045,0.00010666941,0.00016421059,0.00012236717,0.00019299229,0.00017007501,0.0026598135,0.000029517276,0.000011575404],"category_scores_gemma":[0.0000490394,0.00008713079,0.000051178908,0.001001372,0.0017943407,0.0003322721,0.0009074824,0.000081589926,0.00008044479],"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":[7.1599914e-7,0.000040853007,0.000014594157,0.0000042604893,0.0000010913045,4.99746e-7,0.00008667343,0.000028699476,0.011607385,0.9255566,0.00005926402,0.06259939],"study_design_scores_gemma":[0.00014553519,0.00009099603,0.001971874,0.000012194568,0.0000023015475,0.000011285108,8.1557187e-7,0.8176715,0.021711519,0.15772417,0.00054421823,0.000113633614],"about_ca_topic_score_codex":0.0000035102917,"about_ca_topic_score_gemma":5.8156555e-8,"teacher_disagreement_score":0.81764275,"about_ca_system_score_codex":0.000013908216,"about_ca_system_score_gemma":0.00007200973,"threshold_uncertainty_score":0.66113234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08297465,0.011539165,0.90339583,0.0005494886,0.000014733835,0.0009059585,0.00005938663,0.00013461572,0.00042616858],"genre_scores_gemma":[0.98716855,0.0015291497,0.009367927,0.00012527578,0.000100427205,0.0009490119,0.0000747999,0.000016651225,0.0006682189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893034,0.000039756724,0.00031303603,0.00037468012,0.00012997765,0.00021221147],"domain_scores_gemma":[0.9987605,0.00025658341,0.00017369277,0.00055552414,0.000068220674,0.0001854634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036015213,0.00014279498,0.00016634718,0.00007164554,0.00023094214,0.0000722308,0.0002832008,0.00007854946,0.000010476754],"category_scores_gemma":[0.000020901363,0.00013296209,0.000026452839,0.00035912934,0.00008776045,0.0003818234,0.0002490408,0.00010062896,0.00001163018],"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.0000037536813,0.00029361682,0.004059391,0.00014557553,0.000048051697,4.4024375e-7,0.0009163889,0.0000012873959,0.01021654,0.8897574,0.00059936784,0.09395819],"study_design_scores_gemma":[0.0016188575,0.00011422684,0.03809463,0.00014059326,0.0004645753,0.00084735214,0.0016709373,0.01627207,0.052300278,0.06751791,0.8189067,0.0020518713],"about_ca_topic_score_codex":0.000009089986,"about_ca_topic_score_gemma":0.0000015159059,"teacher_disagreement_score":0.9041939,"about_ca_system_score_codex":0.0000066724747,"about_ca_system_score_gemma":0.00001810322,"threshold_uncertainty_score":0.54220366},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010381937,0.00008921152,0.9858485,0.00035589247,0.00010602134,0.0004778681,0.0000073734113,0.00023493296,0.0024983],"genre_scores_gemma":[0.9728908,8.161086e-7,0.025831979,0.00009658553,0.00015349372,0.000048251615,0.00004628589,0.000006874706,0.00092492875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999354,0.000014591835,0.00018265907,0.00019308849,0.00011419745,0.00014148466],"domain_scores_gemma":[0.9993504,0.00012303166,0.00007910171,0.00032023044,0.000086198976,0.000040980234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011079816,0.00007126602,0.000090907895,0.000041997428,0.0001299946,0.00013404482,0.00025979205,0.000037313108,0.000008496161],"category_scores_gemma":[0.000009565963,0.00007132749,0.000042220203,0.00012994028,0.000009915023,0.00024789287,0.0000370535,0.00002860505,0.0001329342],"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.0000043720147,0.000108020475,0.00014223202,0.00003905547,0.000008312435,4.04268e-7,0.0005089927,0.84176856,0.010843821,0.09729046,0.0064881514,0.04279761],"study_design_scores_gemma":[0.00025351963,0.00001274242,0.00047735026,0.000002611415,0.0000031933027,7.419138e-7,0.000009163455,0.80583745,0.00047857972,0.00024287545,0.19260667,0.00007509732],"about_ca_topic_score_codex":0.000010032996,"about_ca_topic_score_gemma":0.0000018669649,"teacher_disagreement_score":0.96250886,"about_ca_system_score_codex":0.000030562285,"about_ca_system_score_gemma":0.00001722934,"threshold_uncertainty_score":0.2908651},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81476504,0.0009813745,0.16800395,0.0124674,0.00012366314,0.00044875644,0.000003998797,0.00061485387,0.002590983],"genre_scores_gemma":[0.98360693,0.000028230603,0.015859837,0.00024204883,0.000018313884,0.000017935949,0.0000025630432,0.0000061681085,0.00021795428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994567,0.000017323442,0.00013725116,0.00017956448,0.000086862645,0.00012229264],"domain_scores_gemma":[0.9994971,0.000032579494,0.000052925254,0.00031294642,0.000053003918,0.00005144816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000519175,0.00007833366,0.000108634624,0.00003091299,0.00007548379,0.00007838491,0.0002625768,0.00003502692,0.000028976438],"category_scores_gemma":[0.0000062147756,0.00006992862,0.000023454018,0.00022101625,0.00003185947,0.0003404458,0.00015312684,0.000058801546,0.00007330609],"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.0000043451037,0.00040160728,0.014304143,0.00013556593,0.000112289454,0.000015054154,0.009596282,0.00004096055,0.15257767,0.4200898,0.008100483,0.3946218],"study_design_scores_gemma":[0.002906947,0.00048766768,0.1970783,0.00024495972,0.00011701553,0.0009616096,0.0026045723,0.47115555,0.12655656,0.05992741,0.135602,0.002357416],"about_ca_topic_score_codex":0.000094111456,"about_ca_topic_score_gemma":0.000016684051,"teacher_disagreement_score":0.47111458,"about_ca_system_score_codex":0.000005867065,"about_ca_system_score_gemma":0.00001568115,"threshold_uncertainty_score":0.2851606},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006835114,0.0016250474,0.14125071,0.0033915152,0.85283047,0.00031815414,0.000029522378,0.00007105685,0.00041515066],"genre_scores_gemma":[0.006107109,0.00024743486,0.0030445624,0.00013066034,0.9903992,0.000004999712,0.000012063032,0.00002178614,0.000032185504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983031,0.00007511487,0.00044287503,0.00032313657,0.00045769665,0.0003980894],"domain_scores_gemma":[0.997733,0.00077461137,0.0002489153,0.00046031282,0.00028185398,0.0005013364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003513932,0.0003181178,0.0004040883,0.00035792845,0.00034303483,0.0008938658,0.0015147815,0.00029219227,0.0000027633885],"category_scores_gemma":[0.0000522808,0.00025456824,0.00008253887,0.00038101853,0.0000814451,0.00017464312,0.00006232379,0.0015205654,0.00000560411],"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.000003835644,0.00002168284,8.8992476e-7,0.000013163181,0.00002229275,0.000021658941,0.0001290913,0.0002123569,0.000009767285,0.0021789672,0.94434357,0.053042747],"study_design_scores_gemma":[0.00018853703,0.0003333959,0.000030566836,0.0002496623,0.000018591603,0.00003518457,0.00000240069,0.13440426,0.00001732616,0.00020133016,0.8642653,0.00025339823],"about_ca_topic_score_codex":0.00006534312,"about_ca_topic_score_gemma":0.000039135088,"teacher_disagreement_score":0.13820615,"about_ca_system_score_codex":0.0001419956,"about_ca_system_score_gemma":0.00078611646,"threshold_uncertainty_score":0.99999064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083509935,0.000017125749,0.9266638,0.0002025269,0.00005123878,0.00020801327,0.0000028457355,0.00036230657,0.06414116],"genre_scores_gemma":[0.65666664,0.0000053086064,0.34286255,0.00017570249,0.000034290646,0.00007626633,0.000011028793,0.000017861508,0.00015033416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989077,0.000009294204,0.00025452473,0.0003041708,0.00024738582,0.00027693802],"domain_scores_gemma":[0.99865955,0.00011491835,0.000102073005,0.0009914234,0.000021287557,0.000110768626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021680984,0.00015898852,0.00019349453,0.000077482495,0.00013253407,0.00016583121,0.00086873426,0.000053874093,0.00002194448],"category_scores_gemma":[0.000017422457,0.00013847923,0.000084255655,0.00038719087,0.000058022568,0.00011536529,0.00020488865,0.00010144132,0.00041645952],"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":[2.6886661e-7,0.000049170496,0.0000050919975,0.000027769467,0.000007769632,3.602543e-7,0.0004438448,0.0000110994815,0.0059224204,0.9756574,0.000483661,0.017391127],"study_design_scores_gemma":[0.0004686518,0.000035372912,0.00028482612,0.000021801165,0.000029965157,0.000018956838,0.00014442643,0.19151948,0.015807763,0.762137,0.028956631,0.0005751222],"about_ca_topic_score_codex":0.0000024034475,"about_ca_topic_score_gemma":0.0000010084714,"teacher_disagreement_score":0.64831567,"about_ca_system_score_codex":0.000011438397,"about_ca_system_score_gemma":0.000013297438,"threshold_uncertainty_score":0.5647019},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009552311,0.00038968484,0.9887676,0.0007731395,0.00009140231,0.0001063859,0.0000030169706,0.000097959506,0.00021847303],"genre_scores_gemma":[0.9234202,0.000051553245,0.07636056,0.000073784846,0.000022821838,0.00001178867,0.0000016847678,0.0000073209444,0.000050297444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993341,0.000021745736,0.0001554919,0.00021270123,0.00017040786,0.00010554975],"domain_scores_gemma":[0.9995312,0.000017060987,0.000071027964,0.0001832107,0.00012920439,0.00006830228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013744312,0.00008323074,0.000095402065,0.000083961495,0.00014179565,0.00010371165,0.00014276075,0.000028821029,0.000004043618],"category_scores_gemma":[0.0000054815023,0.000082523366,0.0000246811,0.00024111517,0.000057325065,0.0005450373,0.0000021269555,0.000081904866,0.000005677651],"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.000010319434,0.0002971409,0.00001768625,0.00034147006,0.000022108665,0.0000039254087,0.002582816,0.005601306,0.29495597,0.00043796987,0.00037786833,0.6953514],"study_design_scores_gemma":[0.00026159643,0.000038749113,0.000018898852,0.00009286415,0.000017180042,0.000013371756,0.00005514038,0.6919165,0.30702206,0.00022218828,0.00021669263,0.00012472027],"about_ca_topic_score_codex":0.00007548535,"about_ca_topic_score_gemma":0.000022724156,"teacher_disagreement_score":0.9138679,"about_ca_system_score_codex":0.000016578915,"about_ca_system_score_gemma":0.00009672103,"threshold_uncertainty_score":0.3365205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07165871,0.0002578675,0.92685896,0.00024580228,0.00036759028,0.00012631023,0.000013423144,0.000029382973,0.0004419278],"genre_scores_gemma":[0.91840714,0.00007481922,0.08131363,0.00008605027,0.000059770016,0.0000017615926,0.000010609775,0.000008622903,0.00003762019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988539,0.000051002597,0.0004379284,0.00017481463,0.00037449654,0.00010784964],"domain_scores_gemma":[0.9986703,0.0001380807,0.0005025743,0.0002632262,0.00035439554,0.00007144236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003849454,0.00011794438,0.00018354214,0.00018112948,0.00003834141,0.000051806313,0.00088867045,0.00014321339,0.000007407859],"category_scores_gemma":[0.000048848546,0.00010333641,0.00008135579,0.00020825362,0.000037796013,0.00026245363,0.000081474755,0.00028449445,0.0000060434218],"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.0008613416,0.002613662,0.0019873742,0.00009773235,0.0013892767,0.00043746672,0.0040744883,0.016801706,0.28574675,0.54566556,0.001986718,0.13833788],"study_design_scores_gemma":[0.0009833209,0.0002461407,0.0028811758,0.00007222335,0.00005072709,0.0002404152,0.000026102374,0.96257484,0.017851572,0.014010405,0.00086543517,0.00019763716],"about_ca_topic_score_codex":0.000012452091,"about_ca_topic_score_gemma":0.0000017709204,"teacher_disagreement_score":0.9457731,"about_ca_system_score_codex":0.00004852616,"about_ca_system_score_gemma":0.000068373716,"threshold_uncertainty_score":0.42139363},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13230817,0.000009342842,0.8638149,0.0031179457,0.00004978589,0.00008325688,0.00000589967,0.000107663516,0.0005030527],"genre_scores_gemma":[0.9937991,0.000001967334,0.0038370886,0.0022931928,0.000013489701,0.000016963,0.000024169303,0.0000025116349,0.000011534425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993365,0.000009983026,0.00025102525,0.00008218946,0.0002164467,0.000103878294],"domain_scores_gemma":[0.99949265,0.000015242426,0.00017977809,0.00023233422,0.00005245154,0.000027559783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006232429,0.00006934217,0.00006260592,0.00012073398,0.00010115812,0.00015868913,0.0002834412,0.000023203607,0.000021149142],"category_scores_gemma":[0.000012499585,0.00006615743,0.000024688396,0.00022057751,0.000017510854,0.00177008,0.00002771217,0.00006509983,0.00015440365],"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.000004016792,0.00013367298,0.00040284012,0.0002689578,0.000014340449,0.0000019378638,0.0103277,0.01007572,0.018242514,0.027130596,0.011100442,0.92229724],"study_design_scores_gemma":[0.00051656074,0.000052700463,0.0021590714,0.00010728808,0.0000071941927,0.000017949438,0.000051721374,0.96356446,0.02397595,0.0003295425,0.008937902,0.00027968126],"about_ca_topic_score_codex":0.00000599779,"about_ca_topic_score_gemma":2.9196343e-7,"teacher_disagreement_score":0.9534887,"about_ca_system_score_codex":0.000022933853,"about_ca_system_score_gemma":0.000008403581,"threshold_uncertainty_score":0.2697822},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5024728,0.00013857134,0.4955815,0.00036006546,0.0005908713,0.00027640065,0.000011712947,0.00020141406,0.00036666178],"genre_scores_gemma":[0.943895,6.393159e-7,0.055771064,0.0000753784,0.00019114079,0.000009515217,0.000023628243,0.0000083756995,0.000025255422],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987729,0.0000314784,0.0003196071,0.00036404547,0.00030433745,0.00020763444],"domain_scores_gemma":[0.99877876,0.00013989782,0.00015768241,0.0006396229,0.00019576676,0.00008828425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021394526,0.00012605601,0.0001864829,0.000084654996,0.00013905956,0.00011522511,0.00094906305,0.00008186663,0.0000056209797],"category_scores_gemma":[0.00009604484,0.000114091716,0.00006300203,0.0004577625,0.00002217247,0.0001796246,0.00032285345,0.00029092608,0.000053195254],"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.0000070392084,0.0001835817,0.0014589361,0.000060512866,0.000044394237,0.0000048252577,0.003115133,0.0013605059,0.54926956,0.20272289,0.0006124223,0.2411602],"study_design_scores_gemma":[0.0001417303,0.000027120672,0.010513679,0.000029051032,0.0000071641193,0.000009936384,0.000104310646,0.9696793,0.016885173,0.0008223833,0.0016007998,0.00017933702],"about_ca_topic_score_codex":0.00035810182,"about_ca_topic_score_gemma":0.00003029295,"teacher_disagreement_score":0.9683188,"about_ca_system_score_codex":0.000022177943,"about_ca_system_score_gemma":0.000065704255,"threshold_uncertainty_score":0.46525252},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049849313,0.00008028015,0.928842,0.0020230408,0.000024727518,0.0011221856,0.0000028601264,0.0002795116,0.017776046],"genre_scores_gemma":[0.976545,0.000020340001,0.020847106,0.0003776258,0.000011330573,0.0009009123,0.000006905928,0.000006094275,0.0012846997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992714,0.0000134823795,0.00014319005,0.00028867915,0.000118070544,0.00016521332],"domain_scores_gemma":[0.9993118,0.00010216377,0.00003108358,0.0004549772,0.000024130506,0.00007581788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000071765244,0.00008814817,0.000085582535,0.00006657069,0.00008852328,0.00013308217,0.00032368035,0.000032591615,0.000030251638],"category_scores_gemma":[0.0000070933047,0.000071305374,0.000025067846,0.00029054284,0.000026308639,0.00023083264,0.000111401096,0.000076976496,0.00019025615],"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":[8.4718675e-7,0.00008840514,0.005420859,0.0000123164245,0.0000060161183,9.993581e-7,0.00033803566,0.00020191276,0.002194231,0.96709025,0.0014387487,0.023207359],"study_design_scores_gemma":[0.0010218631,0.000089833426,0.24371874,0.00004264307,0.0000074130894,0.00000779422,0.0001656561,0.54058224,0.0016119659,0.16599709,0.046025023,0.0007297225],"about_ca_topic_score_codex":0.00028631202,"about_ca_topic_score_gemma":0.000054993856,"teacher_disagreement_score":0.92669564,"about_ca_system_score_codex":0.000018992256,"about_ca_system_score_gemma":0.000019293557,"threshold_uncertainty_score":0.29077488},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3178257,0.00023193381,0.6797413,0.00047814992,0.000112466565,0.0010199448,0.000032385,0.00034838333,0.00020970259],"genre_scores_gemma":[0.9818838,0.000001532104,0.01763763,0.00015286106,0.000029877607,0.00019674434,0.0000490624,0.0000027793687,0.000045659897],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993309,0.000011558632,0.00022514834,0.00016138467,0.00010646794,0.00016455323],"domain_scores_gemma":[0.99963254,0.000008587256,0.00007197877,0.00020715845,0.000036989935,0.000042751926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008849594,0.00009626012,0.000104897474,0.00006680385,0.0001828546,0.00013643457,0.0002754882,0.00007857036,7.7408663e-7],"category_scores_gemma":[0.0000062903546,0.00008140591,0.00004059263,0.00019442714,0.0000097996635,0.0005487436,0.000050392795,0.000044449193,0.000014003474],"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.000003498452,0.00009529115,0.0000040393174,0.000017958255,0.0000014208805,2.0476567e-7,0.0006358171,0.0008873196,0.97524005,0.021397436,0.0008832299,0.00083370646],"study_design_scores_gemma":[0.0003378173,0.00008636965,0.0006424824,0.00003753165,0.0000017664946,0.000014328002,0.00009399824,0.86357325,0.13310637,0.0013435598,0.00062127714,0.00014124117],"about_ca_topic_score_codex":0.0000030834967,"about_ca_topic_score_gemma":0.0000020678071,"teacher_disagreement_score":0.862686,"about_ca_system_score_codex":0.000087663575,"about_ca_system_score_gemma":0.000034435237,"threshold_uncertainty_score":0.3319637},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08477244,0.000028204195,0.913289,0.00052574056,0.0010854127,0.00014583026,0.0000056824633,0.00007867326,0.00006901827],"genre_scores_gemma":[0.92745733,1.5307366e-7,0.0721279,0.000100928686,0.00018952123,0.000011197125,0.000095128526,0.0000047524477,0.000013087131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928105,0.000048299178,0.00022124778,0.00022095437,0.00010498937,0.00012345646],"domain_scores_gemma":[0.99885535,0.0005024794,0.00016662697,0.00029247202,0.0001514452,0.000031619256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085651474,0.00008738485,0.00010492272,0.00005409765,0.00019309206,0.000033880144,0.0004990507,0.000076237346,0.000032035365],"category_scores_gemma":[0.00007097053,0.00006533888,0.000037551417,0.00030367597,0.00011898113,0.000076746706,0.00011138169,0.0002283963,0.000011341731],"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.0000018965171,0.00005821388,0.0002787309,0.0000053399644,0.000028345048,2.6116874e-7,0.00019962598,0.6933569,0.08023965,0.21302989,0.0003216881,0.012479506],"study_design_scores_gemma":[0.00007349336,0.000019933024,0.001734472,0.000004057767,0.000007272028,0.000016390904,0.0000039545553,0.96612704,0.0015307099,0.03033943,0.00007622666,0.00006701409],"about_ca_topic_score_codex":0.00000933334,"about_ca_topic_score_gemma":0.0000065529357,"teacher_disagreement_score":0.8426849,"about_ca_system_score_codex":0.0000081897015,"about_ca_system_score_gemma":0.000058830403,"threshold_uncertainty_score":0.26644424},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6711665,0.00019684806,0.3273683,0.000027196393,0.00023267149,0.00009854068,0.0000012226415,0.000066458946,0.00084228755],"genre_scores_gemma":[0.99256027,0.0000016853347,0.0073142494,0.000008387967,0.00004409359,0.000001832656,8.9163814e-7,0.000005843448,0.00006274239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991933,0.000076288,0.0003009457,0.00017958017,0.00013050789,0.000119362434],"domain_scores_gemma":[0.99896336,0.00022830101,0.00021042513,0.00048295633,0.00006853751,0.00004644534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011551697,0.00007947396,0.00021721034,0.00007574777,0.000062833125,0.000035574754,0.00049702177,0.00004290809,0.0000016001662],"category_scores_gemma":[0.000023735456,0.000071133974,0.000040536645,0.000186892,0.0001146136,0.00007806355,0.00015920971,0.000095165786,0.0000041963635],"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.0000011953725,0.00002406258,0.00035952684,0.00007162706,0.000013491504,3.451392e-7,0.0010548634,0.000031778774,0.10178609,0.8894638,0.000017827673,0.0071754223],"study_design_scores_gemma":[0.0011302282,0.0001953032,0.026799694,0.00031280535,0.00008162685,0.00024877887,0.00066958985,0.76577395,0.11691478,0.08387728,0.0032736144,0.00072236307],"about_ca_topic_score_codex":0.000031039333,"about_ca_topic_score_gemma":0.000001085608,"teacher_disagreement_score":0.8055865,"about_ca_system_score_codex":0.0000026440061,"about_ca_system_score_gemma":0.000019243233,"threshold_uncertainty_score":0.29007593},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20558678,0.0009318308,0.79026204,0.0014159937,0.00006689037,0.0001088285,2.6155877e-7,0.00002768031,0.0015996847],"genre_scores_gemma":[0.9796258,0.000011410295,0.020149412,0.00006818214,0.00011860045,0.0000019581994,7.420973e-7,0.000005650824,0.000018244338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987328,0.00011397598,0.00043805884,0.000105602645,0.00041287352,0.00019669502],"domain_scores_gemma":[0.99927896,0.00012393636,0.00014008684,0.00025450718,0.00016762661,0.000034887562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016074239,0.00009100832,0.00014192311,0.00012297522,0.00017401905,0.000089437184,0.0008386048,0.000027465503,0.0000020557356],"category_scores_gemma":[0.000032547967,0.000062323896,0.000069623165,0.00039803327,0.000030263629,0.00026385766,0.00010149308,0.0002104087,0.000005746879],"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.000017007069,0.0026882335,0.0106915375,0.00013316261,0.00014955476,0.00006766108,0.026622808,0.42365265,0.13852815,0.22977294,0.00691387,0.16076243],"study_design_scores_gemma":[0.0009887989,0.000076222204,0.08894216,0.00013397458,0.00003940762,0.0007502658,0.00090934616,0.89359933,0.0014748212,0.011273248,0.0015045828,0.00030786413],"about_ca_topic_score_codex":0.0000813793,"about_ca_topic_score_gemma":0.000010772236,"teacher_disagreement_score":0.77403903,"about_ca_system_score_codex":0.000081774604,"about_ca_system_score_gemma":0.000072605144,"threshold_uncertainty_score":0.25414947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021641891,0.00007708557,0.89157784,0.00015892125,0.000053964704,0.0003127247,0.0000023992147,0.0001905691,0.08598462],"genre_scores_gemma":[0.6862865,0.000014363358,0.31327012,0.000059769915,0.0000042750635,0.00010350489,0.000004586191,0.000012946124,0.0002439394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909824,0.000008480037,0.00025033907,0.0002420366,0.00016005385,0.00024087164],"domain_scores_gemma":[0.99912184,0.00006192821,0.00006931623,0.000679775,0.0000115578405,0.0000555678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001654098,0.00012924014,0.00016433648,0.00007607007,0.00006350125,0.000088337874,0.0004914586,0.000048062866,0.000017522496],"category_scores_gemma":[0.000015379843,0.00011954548,0.000038303282,0.0003611273,0.000032011365,0.00010413703,0.00008795029,0.00009025232,0.00017370343],"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":[1.8418653e-7,0.000056503926,0.0000070465353,0.000020306452,0.0000034739037,0.0000014834993,0.00087365933,0.000029983661,0.0036967047,0.9943283,0.00006750287,0.00091485016],"study_design_scores_gemma":[0.00051850325,0.000015055778,0.0002288974,0.000027738999,0.000011496091,0.000018681852,0.0008609894,0.13321733,0.012289211,0.8431763,0.009123189,0.00051258056],"about_ca_topic_score_codex":0.0000030116817,"about_ca_topic_score_gemma":0.000009089452,"teacher_disagreement_score":0.6646446,"about_ca_system_score_codex":0.00004057242,"about_ca_system_score_gemma":0.000030444187,"threshold_uncertainty_score":0.48749235},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06118028,0.0003594364,0.926741,0.0013260428,0.0007276775,0.000056170324,0.0000015927851,0.00008467605,0.009523102],"genre_scores_gemma":[0.9883641,0.0000331603,0.011276174,0.00013550278,0.00008739537,2.2985866e-7,0.0000015838997,0.000015746187,0.00008609919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886423,0.00010166694,0.00039924606,0.0001240808,0.0003360269,0.00017472848],"domain_scores_gemma":[0.99893755,0.00003869899,0.0003639047,0.00033363918,0.00020517428,0.00012100857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007567682,0.00010130842,0.00014634883,0.00011334516,0.00013100218,0.00016325885,0.0011265498,0.000015109212,0.0000025878714],"category_scores_gemma":[0.00003979091,0.000092804985,0.00008044373,0.0004735253,0.000025809606,0.00031503546,0.00010137529,0.00023916188,0.00009772281],"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.0000043144837,0.0002925148,0.00035202788,0.000017382807,0.000034727196,0.00095208443,0.00068284647,0.000484089,0.0028269945,0.98128855,0.0032073178,0.009857161],"study_design_scores_gemma":[0.012084509,0.0014342922,0.03778295,0.0006055554,0.00012948965,0.0045680413,0.00035362915,0.004403158,0.017584234,0.33866102,0.58072317,0.0016699596],"about_ca_topic_score_codex":0.0000012997863,"about_ca_topic_score_gemma":2.2240323e-7,"teacher_disagreement_score":0.9271838,"about_ca_system_score_codex":0.0000630392,"about_ca_system_score_gemma":0.0000964274,"threshold_uncertainty_score":0.37844777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057353205,0.00014803378,0.9925386,0.0010635727,0.00025404434,0.000091616224,0.0000014419899,0.000026978598,0.00014043336],"genre_scores_gemma":[0.46251297,0.0000047880794,0.5371837,0.00009017333,0.0001724344,0.0000029152218,0.0000030322624,0.0000043087875,0.000025649522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925923,0.00004416565,0.0003116588,0.00010569465,0.00017507804,0.00010417573],"domain_scores_gemma":[0.99874425,0.00031469838,0.00031294517,0.00011478479,0.00045879788,0.0000545079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003931217,0.00007230768,0.00013285142,0.000060040504,0.000108603104,0.000089951835,0.00036123765,0.000023242039,0.0000030688366],"category_scores_gemma":[0.00003114912,0.00006899819,0.00012579568,0.00026013117,0.000023482316,0.00053117925,0.000048168913,0.000091293005,0.0000067432816],"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.000011398676,0.00015311324,0.000054680004,0.000011080061,0.000047657304,0.0000014617364,0.0002487774,0.33981118,0.0044687656,0.36342543,0.0014289423,0.29033753],"study_design_scores_gemma":[0.0002762606,0.000042164902,0.0004748472,0.000011206525,0.000009258102,0.00006570916,0.000009261543,0.6207116,0.0021097267,0.36889896,0.0073307776,0.000060182116],"about_ca_topic_score_codex":6.380616e-7,"about_ca_topic_score_gemma":5.299162e-8,"teacher_disagreement_score":0.45677766,"about_ca_system_score_codex":0.000050908508,"about_ca_system_score_gemma":0.000074855394,"threshold_uncertainty_score":0.28136647},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.770395,0.0037572584,0.21391593,0.0046321065,0.00068552064,0.0016166498,0.00007295448,0.00017048913,0.0047540986],"genre_scores_gemma":[0.99769956,0.0003843731,0.0014081073,0.00006224373,0.000080304555,0.000059335372,0.000025833006,0.00001728496,0.0002629637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977385,0.0001605904,0.0008465352,0.00057900324,0.00026164533,0.00041374675],"domain_scores_gemma":[0.9985929,0.00051151705,0.00014675623,0.0004788605,0.00007489057,0.00019505982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027350686,0.00024337156,0.00066465,0.0000616948,0.000065155866,0.00007048344,0.00044882015,0.000054735046,0.000018980989],"category_scores_gemma":[0.00017334316,0.00021715523,0.00009271425,0.00055201794,0.00012960941,0.0004804364,0.00091985235,0.0003742362,0.00010944712],"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.0001088705,0.0020965924,0.005402981,0.0028835628,0.00014294413,0.00031327998,0.007828553,0.003940622,0.04983051,0.879923,0.004278611,0.04325048],"study_design_scores_gemma":[0.0003178593,0.00018135361,0.0027032213,0.002022381,0.00002801888,0.000022069185,0.00006878414,0.96391517,0.0006051346,0.029448071,0.0003845244,0.00030343048],"about_ca_topic_score_codex":0.00003784772,"about_ca_topic_score_gemma":0.0000054829598,"teacher_disagreement_score":0.9599745,"about_ca_system_score_codex":0.0000778275,"about_ca_system_score_gemma":0.00003865411,"threshold_uncertainty_score":0.88553333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066961655,0.00020931281,0.9827738,0.009341409,0.00005047892,0.00041138852,0.0000024004778,0.00032863885,0.00018642718],"genre_scores_gemma":[0.4921736,0.0000018380758,0.50666195,0.0010328579,0.00004246001,0.00006402137,0.000007299583,0.000007124513,0.000008827313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987241,0.000020161238,0.00029351917,0.0003955223,0.00023198519,0.00033472638],"domain_scores_gemma":[0.9991451,0.00005583434,0.00020452819,0.00044425068,0.000079161386,0.00007114072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000209378,0.00015845777,0.00021153326,0.00009154529,0.00017063157,0.00018872731,0.00081912644,0.00006805233,0.0000018882207],"category_scores_gemma":[0.000050579216,0.00015274425,0.000103272156,0.00042377127,0.000067789944,0.0003496649,0.000072108334,0.00012368419,0.0000064854494],"study_design_candidate":"design_other","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.00001316253,0.00023187924,0.000022988488,0.0001690608,0.000020569014,0.00000640083,0.0025848954,0.00023674748,0.047715366,0.13411322,0.00061162806,0.8142741],"study_design_scores_gemma":[0.0023914215,0.00063020753,0.0028893221,0.0009652382,0.00012521599,0.00004302183,0.00028373481,0.6006102,0.100230925,0.2597884,0.030214736,0.0018275862],"about_ca_topic_score_codex":0.000004782333,"about_ca_topic_score_gemma":1.9408773e-7,"teacher_disagreement_score":0.8124465,"about_ca_system_score_codex":0.000028691074,"about_ca_system_score_gemma":0.00007495563,"threshold_uncertainty_score":0.62287295},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25390106,0.000060480827,0.73417693,0.010574906,0.000041751257,0.00019776255,5.886778e-7,0.00014159216,0.0009049154],"genre_scores_gemma":[0.9898148,0.000003504217,0.009288006,0.00081742276,0.000057060286,0.00000840011,0.0000013764617,0.0000051486813,0.0000042651377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978059,0.00013159707,0.00025302736,0.00066084176,0.0004705994,0.00067804166],"domain_scores_gemma":[0.9964415,0.0023166884,0.00005651656,0.0010252107,0.000033049855,0.00012707635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770954,0.00016778556,0.00015114294,0.0001709098,0.0005242882,0.0003956453,0.0020586613,0.000055339726,0.00000613056],"category_scores_gemma":[0.00033719523,0.000120434044,0.00004020416,0.001342818,0.0010050742,0.00032650548,0.0003580879,0.00046695877,0.000048312213],"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.0000012408564,0.000034357774,0.0006320492,0.0000011113075,9.643858e-7,0.000002053787,0.00013470708,0.00003585869,0.00023220392,0.974839,0.000011609237,0.024074873],"study_design_scores_gemma":[0.00012620559,0.00018908228,0.031007895,0.000017433316,0.0000024616365,0.00000777848,0.0000010628107,0.14246207,0.002388806,0.8236105,0.00004299586,0.00014371186],"about_ca_topic_score_codex":0.0000019106756,"about_ca_topic_score_gemma":8.717945e-7,"teacher_disagreement_score":0.73591375,"about_ca_system_score_codex":0.00010149348,"about_ca_system_score_gemma":0.00013788787,"threshold_uncertainty_score":0.49111578},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29636997,0.000019737638,0.70099956,0.0010759179,0.00014471641,0.00015084434,5.0970664e-7,0.0002115957,0.0010271755],"genre_scores_gemma":[0.7729858,7.484303e-7,0.22628519,0.00067797553,0.000033326498,0.000005066115,9.956698e-7,0.000006121086,0.0000047501985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731225,0.000060340924,0.00042044863,0.0006698809,0.0008059995,0.00073107635],"domain_scores_gemma":[0.9980667,0.00037003978,0.00006520252,0.0011006382,0.00009927364,0.00029813772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031229532,0.00016074632,0.00019423943,0.00018515295,0.0002670953,0.00026436758,0.0020263512,0.000046007797,0.000034697867],"category_scores_gemma":[0.00007065726,0.00014554035,0.00007455895,0.001932414,0.0011994328,0.0004801208,0.0010326423,0.00019373221,0.00023392572],"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.0000027462152,0.00019403466,0.00010162689,0.000004926227,0.0000019666682,0.000026154421,0.00017790176,0.00026418242,0.02225475,0.9637921,0.000032302436,0.013147303],"study_design_scores_gemma":[0.00027399702,0.0000684183,0.003490935,0.000025295289,0.0000033290212,0.000024271723,0.0000031419195,0.85259676,0.06432154,0.078866735,0.00011829592,0.0002072547],"about_ca_topic_score_codex":0.00000542948,"about_ca_topic_score_gemma":0.0000025689944,"teacher_disagreement_score":0.88492537,"about_ca_system_score_codex":0.00007134198,"about_ca_system_score_gemma":0.00009987742,"threshold_uncertainty_score":0.5934964},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062851734,0.0011623668,0.26081124,0.034846466,0.0018664772,0.03039925,0.000652831,0.00070723396,0.6067024],"genre_scores_gemma":[0.7292269,0.0017232595,0.08703574,0.0005523928,0.00073364895,0.00020735242,0.0019176686,0.00024211411,0.17836092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99449456,0.001332707,0.00048589116,0.0015754189,0.0011153043,0.000996131],"domain_scores_gemma":[0.9943685,0.00060859707,0.00026907722,0.0039973217,0.00043852752,0.00031795495],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0064494675,0.00035987765,0.0005937033,0.0011873413,0.00094243744,0.005105626,0.035230096,0.0003625041,0.00006981808],"category_scores_gemma":[0.00010201327,0.0003356058,0.00012749009,0.0033188784,0.00026619397,0.0014634171,0.0671377,0.0024643412,0.00031030187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.00023079844,0.0031584706,0.00039657953,0.0005732982,0.00041555328,0.0048888754,0.0033485952,0.026064374,0.0027169562,0.8652648,0.03434903,0.058592696],"study_design_scores_gemma":[0.0010982781,0.00005890307,0.00036885595,0.00054291676,0.000018360657,0.00001498479,0.0020349226,0.4289181,0.00027033675,0.0017407364,0.5643411,0.00059249374],"about_ca_topic_score_codex":0.01782396,"about_ca_topic_score_gemma":0.0016041825,"teacher_disagreement_score":0.863524,"about_ca_system_score_codex":0.0007697006,"about_ca_system_score_gemma":0.0016627889,"threshold_uncertainty_score":0.9999096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1928813,0.00027215888,0.80389917,0.0002094921,0.000028218683,0.00010993999,0.00001196619,0.000076958146,0.002510781],"genre_scores_gemma":[0.9547562,0.00012964207,0.04489062,0.00018123447,0.000008387573,0.000018199125,0.000003132828,0.000004914978,0.00000767861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936116,0.000014835468,0.00012918084,0.00021418191,0.00014683907,0.00013378052],"domain_scores_gemma":[0.99928737,0.00006314803,0.00005024215,0.00051339023,0.000030458908,0.00005542162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008171681,0.00009453684,0.00011980327,0.000145355,0.00011314637,0.00008129502,0.00042345154,0.000034369445,0.000005213482],"category_scores_gemma":[0.000007887735,0.00008352029,0.000075603806,0.00045353288,0.00011721036,0.00011050868,0.00008301681,0.00004916118,0.000007813519],"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.000004241944,0.00010413933,0.000100311845,0.000012007424,0.000016577316,0.0000033683007,0.00029248348,0.00007787808,0.010281641,0.9833262,0.00043501885,0.005346154],"study_design_scores_gemma":[0.0013861856,0.0005088439,0.008509639,0.00006543044,0.000024019319,0.000030381234,0.00010679758,0.0015030266,0.031471428,0.9499112,0.006127618,0.0003554741],"about_ca_topic_score_codex":0.000043996148,"about_ca_topic_score_gemma":0.0000064181604,"teacher_disagreement_score":0.7618749,"about_ca_system_score_codex":0.00000469578,"about_ca_system_score_gemma":0.000024654264,"threshold_uncertainty_score":0.34058586},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33177862,0.00009237148,0.66398567,0.000051621773,0.00015693578,0.00023629927,0.0000029616097,0.00009767739,0.0035978642],"genre_scores_gemma":[0.9936395,5.958349e-7,0.0061996803,0.000021734479,0.000048675676,0.000007993629,0.0000064566625,0.000008522893,0.00006680604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987005,0.00017914451,0.00046865086,0.00021583134,0.00027094057,0.00016495209],"domain_scores_gemma":[0.9985418,0.00040113067,0.0003542669,0.00046527013,0.00018425027,0.00005329892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058832753,0.00010805059,0.00025351447,0.00009202026,0.000063991305,0.000056726032,0.0006914674,0.000041043975,0.00001746807],"category_scores_gemma":[0.000017351485,0.00010131668,0.00007116895,0.00021575225,0.0000615894,0.00013591438,0.00016674669,0.00007034585,0.0000611828],"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":[8.200008e-7,0.00006679925,0.0005464165,0.00011768218,0.000027000426,6.2861426e-7,0.000863071,0.012128198,0.002511106,0.9781485,0.000118622345,0.005471154],"study_design_scores_gemma":[0.00031609103,0.000058788984,0.019632058,0.00022034289,0.0000091916,0.000028540193,0.00020883467,0.89261436,0.0033643472,0.08323378,0.00011978074,0.00019390638],"about_ca_topic_score_codex":0.00012179452,"about_ca_topic_score_gemma":4.009867e-7,"teacher_disagreement_score":0.89491475,"about_ca_system_score_codex":0.000017825623,"about_ca_system_score_gemma":0.000044785716,"threshold_uncertainty_score":0.41315743},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7259883,0.00017092496,0.272789,0.000066622924,0.00030666593,0.00010598985,0.000012754675,0.000037399688,0.00052234787],"genre_scores_gemma":[0.99724156,0.00000388425,0.0024556012,0.000011508703,0.000020917314,0.000006302456,0.000008320509,0.0000033831095,0.00024854718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999357,0.00008270606,0.00021023487,0.00015042731,0.00011696941,0.00008265492],"domain_scores_gemma":[0.99892175,0.0005670185,0.000082108156,0.00030799065,0.00006114096,0.000059995105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003744877,0.00006201195,0.00013184155,0.000042880194,0.000057232315,0.000012857885,0.00020164596,0.00006265366,0.000016131533],"category_scores_gemma":[0.00011101491,0.00004927562,0.00003365488,0.00015158232,0.00012305252,0.000073165196,0.000086090615,0.00009641834,0.000009321744],"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.000006795622,0.000050841056,0.00017059408,0.000020164476,0.0000074984655,4.824253e-7,0.00020454117,0.000097491764,0.045203015,0.953469,0.000012659893,0.000756909],"study_design_scores_gemma":[0.00047657118,0.00011290398,0.018880766,0.00007044437,0.000022363287,0.00003379775,0.00010965208,0.93148357,0.0016970676,0.0437847,0.0030922014,0.00023595126],"about_ca_topic_score_codex":0.000019861713,"about_ca_topic_score_gemma":0.000003830266,"teacher_disagreement_score":0.9313861,"about_ca_system_score_codex":0.0000032589344,"about_ca_system_score_gemma":0.000032755215,"threshold_uncertainty_score":0.20094013},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039611864,0.3054923,0.34864762,0.043280087,0.000767747,0.0031862014,0.00048941467,0.0012382619,0.29293716],"genre_scores_gemma":[0.08348707,0.42686304,0.22941624,0.038360517,0.00027601566,0.00016497128,0.00045078382,0.00021284953,0.2207685],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989101,0.00012218003,0.00022410373,0.0003387435,0.00018466478,0.00022018641],"domain_scores_gemma":[0.998276,0.000164707,0.00014202707,0.0012360067,0.00008522779,0.000096018324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003022227,0.0001265447,0.00021426742,0.00002721934,0.00009416829,0.000023943796,0.0013195246,0.000051114203,0.00018235199],"category_scores_gemma":[0.0001933841,0.00013085474,0.00009548858,0.00030454108,0.000052381576,0.00007707759,0.00024263836,0.0001038959,0.00020512693],"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.0000010774972,0.0000772855,0.000013666094,0.0003447694,0.000008238201,0.0000039436536,0.000008992278,8.1884446e-7,0.00093950186,0.022715308,0.97425526,0.0016311102],"study_design_scores_gemma":[0.00019804029,0.000018132469,0.000033880842,0.00025797784,0.000015405982,0.000012153939,0.0000036829806,0.000042621275,0.0073587187,0.000010928586,0.99190706,0.00014138095],"about_ca_topic_score_codex":0.00009147313,"about_ca_topic_score_gemma":4.311353e-7,"teacher_disagreement_score":0.12137075,"about_ca_system_score_codex":0.000021242811,"about_ca_system_score_gemma":0.000043182594,"threshold_uncertainty_score":0.5336101},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32360536,0.000025313131,0.67019916,0.0010481739,0.00007563383,0.0003066413,0.000004288248,0.0002440819,0.0044913376],"genre_scores_gemma":[0.9660381,0.0000028218012,0.022326969,0.00091248826,0.000026543057,0.000031052245,0.000016863463,0.000011029554,0.010634127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987221,0.000046042776,0.0002220194,0.0004914246,0.00021362127,0.00030482945],"domain_scores_gemma":[0.9988201,0.000078021614,0.00003837936,0.0008904695,0.000015871254,0.00015711856],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020256406,0.00014560271,0.00014951607,0.00009310453,0.000100279874,0.00017871773,0.0006700174,0.00008853463,0.0002008312],"category_scores_gemma":[0.000018209717,0.0001281514,0.0000528878,0.00035531956,0.000029727758,0.00014287325,0.00032570914,0.00014428027,0.0019384063],"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.000068453424,0.0025881028,0.024747908,0.000095376716,0.00012940638,0.00006204223,0.016023539,0.31521794,0.18488885,0.32730708,0.03337067,0.09550062],"study_design_scores_gemma":[0.00061848067,0.000066901026,0.024658928,0.00001411045,0.0000048102074,0.00000928827,0.000019969906,0.2360102,0.0028677972,0.0008381752,0.7344879,0.00040347787],"about_ca_topic_score_codex":0.00025150727,"about_ca_topic_score_gemma":0.00016396123,"teacher_disagreement_score":0.7011172,"about_ca_system_score_codex":0.00006236064,"about_ca_system_score_gemma":0.000019317727,"threshold_uncertainty_score":0.9988387},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029649725,0.00018063163,0.95449865,0.014396122,0.000038574894,0.0010670476,0.000015207029,0.0001331507,0.000020920786],"genre_scores_gemma":[0.6510791,0.0000055664664,0.34016111,0.008322733,0.000030073736,0.00035813547,0.00002158968,0.000010754425,0.00001088426],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985968,0.00008296616,0.00024276777,0.00043507988,0.00010711048,0.000535306],"domain_scores_gemma":[0.998876,0.00053197314,0.00011883619,0.00037103842,0.000052590563,0.00004960068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005865986,0.00016046943,0.00024915635,0.0001666026,0.00014668117,0.000082605045,0.0005444747,0.00006813242,6.823222e-7],"category_scores_gemma":[0.000051456795,0.00016766455,0.00012715768,0.0003811949,0.000029932155,0.0001982833,0.000016680926,0.00018453306,0.0000011777684],"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.00008798409,0.00021833745,0.00017190549,0.000023178938,0.00008090524,0.000005359299,0.0017242989,0.014543878,0.72582114,0.2353412,0.0022478178,0.019733986],"study_design_scores_gemma":[0.0023463545,0.00019003527,0.0008880682,0.0000108414515,0.000016711463,0.0000050364015,0.000020460191,0.9596554,0.01515728,0.017753815,0.0036783833,0.00027762],"about_ca_topic_score_codex":0.000012448005,"about_ca_topic_score_gemma":0.00003706049,"teacher_disagreement_score":0.9451115,"about_ca_system_score_codex":0.00009341243,"about_ca_system_score_gemma":0.00008074139,"threshold_uncertainty_score":0.6837162},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20740247,0.000059105205,0.7747424,0.00018564396,0.00011776477,0.00027270245,0.0000059864024,0.0005208444,0.016693091],"genre_scores_gemma":[0.9498602,2.0762751e-7,0.049885396,0.00010902198,0.000044364868,0.000024287447,0.000005093731,0.000009238286,0.00006219139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998805,0.000063341366,0.00027802784,0.00024969742,0.00029889107,0.00030503247],"domain_scores_gemma":[0.99847794,0.00017825361,0.00013096732,0.0010045872,0.0000805136,0.00012774816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004368214,0.00012999278,0.00019472616,0.000084331004,0.00008630215,0.00005046108,0.00064810755,0.00005509964,0.000023959381],"category_scores_gemma":[0.0000587121,0.000114620365,0.00007009237,0.0004534873,0.000026908529,0.00023977678,0.00014283447,0.00008156858,0.00010278315],"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.000007280995,0.002212048,0.015792154,0.0003419685,0.00004356987,0.000016452725,0.0010683837,0.0015052923,0.28213614,0.67547584,0.002059197,0.01934166],"study_design_scores_gemma":[0.00025730897,0.000049123882,0.0014923803,0.000033130647,0.0000071603595,0.000005169915,0.000019642783,0.8869744,0.10786566,0.0004843817,0.0026561837,0.00015544216],"about_ca_topic_score_codex":0.00004979053,"about_ca_topic_score_gemma":7.593244e-7,"teacher_disagreement_score":0.88546914,"about_ca_system_score_codex":0.000023671606,"about_ca_system_score_gemma":0.000041183364,"threshold_uncertainty_score":0.4674083},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17954701,0.0028953324,0.8124256,0.0045654587,0.000072613315,0.00033319072,0.00000831813,0.00002877666,0.00012366756],"genre_scores_gemma":[0.99802506,0.00016843693,0.00076022826,0.0009895444,0.000030092748,0.000008626443,0.0000037661237,0.000003961644,0.00001028571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901056,0.00007490906,0.0002909296,0.00017913071,0.00027332277,0.00017113697],"domain_scores_gemma":[0.998795,0.00017665478,0.00022784532,0.0007262758,0.000030343253,0.000043929507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033793683,0.00008174601,0.00037120795,0.000028962504,0.000032028584,0.000012740874,0.0006643644,0.00000477066,0.0000010914449],"category_scores_gemma":[0.000013907669,0.000051557574,0.00029869933,0.0017861889,0.00007757742,0.000058639293,0.00015530885,0.00007664702,0.0000048505312],"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.00001285676,0.00067138317,0.007753241,0.0043072305,0.002626177,0.000012917981,0.0012880713,0.18779325,0.17065908,0.5882694,0.012604034,0.024002338],"study_design_scores_gemma":[0.0001116558,0.000021232916,0.037845444,0.00094699714,0.0010716846,0.0000017465022,0.000004461444,0.9518825,0.0009685256,0.00082406565,0.00605556,0.00026611504],"about_ca_topic_score_codex":0.00004130283,"about_ca_topic_score_gemma":0.0000042491174,"teacher_disagreement_score":0.81847805,"about_ca_system_score_codex":0.000016567548,"about_ca_system_score_gemma":0.000009263858,"threshold_uncertainty_score":0.21024568},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07025805,0.000052973108,0.9275605,0.0005861943,0.00034825978,0.00042328582,0.000016181442,0.00040626424,0.00034828662],"genre_scores_gemma":[0.9538402,0.000009800497,0.045740392,0.00004502996,0.00002565112,0.00012359749,0.00003282508,0.000014250972,0.00016823529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852157,0.0000818096,0.00040003174,0.00038781558,0.0003810235,0.00022775173],"domain_scores_gemma":[0.99887836,0.00016706552,0.00014668719,0.00048745665,0.00022435388,0.00009608119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009969883,0.00017926183,0.00019048738,0.00027429638,0.0002548249,0.00006478601,0.00047622854,0.00008702497,0.000101684804],"category_scores_gemma":[0.000003051151,0.0001847059,0.00013233772,0.00069196156,0.000058966045,0.00072669063,0.0000059801628,0.00014300166,0.00043363465],"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.000018613317,0.0019046047,0.000057413603,0.00013948468,0.00013846098,0.00000471509,0.000816108,0.8194709,0.049611945,0.0106153535,0.0039863316,0.11323608],"study_design_scores_gemma":[0.00044804323,0.000095105024,0.0037417405,0.000027402606,0.000018975945,0.000012984619,0.00003043577,0.9751506,0.015616097,0.004502698,0.00015351642,0.00020238965],"about_ca_topic_score_codex":0.000086324115,"about_ca_topic_score_gemma":0.0000033679914,"teacher_disagreement_score":0.8835822,"about_ca_system_score_codex":0.00007506346,"about_ca_system_score_gemma":0.00008945036,"threshold_uncertainty_score":0.7532088},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14062184,0.00011498304,0.85830474,0.0000960225,0.00014428569,0.00030118885,0.0000030021827,0.00014063239,0.00027329993],"genre_scores_gemma":[0.99506,0.0000023086523,0.004654778,0.000031100208,0.00008944909,0.000030422409,0.000021614094,0.000012207594,0.00009808286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886626,0.000051919484,0.0002616565,0.00032179357,0.00024448376,0.00025391404],"domain_scores_gemma":[0.9990857,0.00009304708,0.00011290477,0.0004311259,0.00014518021,0.00013199869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014911694,0.00016255189,0.00015286477,0.00007023943,0.00014075745,0.00022259167,0.00024225564,0.000052815318,0.000013840736],"category_scores_gemma":[0.000014085567,0.00013904607,0.00002898106,0.00013794113,0.00002853384,0.0010071042,0.00012021393,0.00009080243,0.000025747395],"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.000008381505,0.00002775932,0.0007308864,0.000014443137,0.00000833477,5.032817e-7,0.0007269419,0.98322815,0.00086995127,0.0072545544,9.419736e-7,0.00712917],"study_design_scores_gemma":[0.00031148738,0.000034947072,0.0006180591,0.000048684888,0.000011128949,0.0000023599937,0.000057083656,0.9975255,0.0003512205,0.0001821084,0.0006603297,0.00019704911],"about_ca_topic_score_codex":0.000035900015,"about_ca_topic_score_gemma":0.000006165443,"teacher_disagreement_score":0.8544382,"about_ca_system_score_codex":0.00003122657,"about_ca_system_score_gemma":0.000027556445,"threshold_uncertainty_score":0.56701344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07921102,0.00007440507,0.90963405,0.0039569885,0.00027359155,0.00023980437,0.0000041072008,0.00026808374,0.006337973],"genre_scores_gemma":[0.9587747,0.0000037958225,0.040578935,0.00039349566,0.00016828025,0.000013881694,0.0000029767627,0.000008878804,0.00005504474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997454,0.00011600111,0.00043502013,0.00063214806,0.00081632065,0.0005465493],"domain_scores_gemma":[0.99735737,0.00032817977,0.00015225784,0.0017779341,0.00020157639,0.00018267937],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015985554,0.00018706359,0.00023709775,0.000111973255,0.00047164017,0.00037954244,0.0042480393,0.00005596238,0.000029804924],"category_scores_gemma":[0.000058162095,0.00012386461,0.00011418081,0.0013787069,0.0028480936,0.00038278694,0.0012535425,0.00017988814,0.000100278216],"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.000001854288,0.000104556464,0.00010050151,0.0000054581333,0.000003357096,0.0000036174738,0.000109561544,0.000047382142,0.008419303,0.98779464,0.00092275837,0.0024870052],"study_design_scores_gemma":[0.0003421585,0.00010995281,0.011579425,0.00002721226,0.000015586404,0.000025469224,0.000008156682,0.72209626,0.055378806,0.20633887,0.003746398,0.00033168544],"about_ca_topic_score_codex":0.00002932413,"about_ca_topic_score_gemma":0.0000035414516,"teacher_disagreement_score":0.8795637,"about_ca_system_score_codex":0.000023138698,"about_ca_system_score_gemma":0.00017548486,"threshold_uncertainty_score":0.9998656},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041102017,0.0026888733,0.98807406,0.0038907307,0.00010805943,0.0003468397,0.000008379716,0.000089111345,0.0006837426],"genre_scores_gemma":[0.8049459,0.00014196533,0.1942809,0.000463407,0.000084004525,0.000030674884,0.000011340878,0.000012210963,0.000029644401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868524,0.00007879642,0.0004435879,0.00024172722,0.0002789277,0.00027171135],"domain_scores_gemma":[0.99882245,0.00028186085,0.0003300049,0.00034210755,0.0001300393,0.00009352866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035987573,0.00013873425,0.0001522127,0.00020193709,0.0004709155,0.0002941024,0.001004561,0.00003240482,0.00006447804],"category_scores_gemma":[0.000030650634,0.00012924246,0.000059918857,0.0004993377,0.00005690553,0.0012602843,0.000060915838,0.00026731557,0.000020658035],"study_design_candidate":"design_other","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.000008018756,0.00020992814,0.00022470544,0.000021129568,0.0000033823694,0.0000053238923,0.00038620253,0.0012326211,0.002422582,0.0023004701,0.00015376843,0.99303186],"study_design_scores_gemma":[0.0019595227,0.00018159792,0.0009813076,0.00015747307,0.000010795518,0.00004390108,0.00016932609,0.96281934,0.004863732,0.007375944,0.021155842,0.0002812109],"about_ca_topic_score_codex":0.0000017153378,"about_ca_topic_score_gemma":0.0000087830595,"teacher_disagreement_score":0.99275064,"about_ca_system_score_codex":0.00009529896,"about_ca_system_score_gemma":0.00005552912,"threshold_uncertainty_score":0.5270355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052618623,0.00031816118,0.94559336,0.00004283174,0.0000851418,0.00018473982,0.0000010341965,0.00011610267,0.0010400204],"genre_scores_gemma":[0.95420575,0.000021988697,0.045486454,0.0000910171,0.00011755171,0.0000035760902,0.000004781459,0.000011926965,0.000056926223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988761,0.00009761195,0.00026099224,0.00030854132,0.00023970722,0.00021707291],"domain_scores_gemma":[0.9981555,0.0011639795,0.0001275737,0.0003382028,0.00013575311,0.00007903692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013795132,0.00011995345,0.00011334313,0.0000879505,0.00029013323,0.00021309088,0.00017591385,0.00004916502,0.0000011745421],"category_scores_gemma":[0.000038811915,0.000118485994,0.000038132675,0.00019699946,0.000017215178,0.0009506532,0.00008170262,0.00014118146,0.000015775357],"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.000011728692,0.00005745418,0.0000013125069,0.000011920927,0.000007645189,0.0000020599332,0.001026782,0.82977134,0.00030559095,0.16714302,2.5503547e-7,0.001660918],"study_design_scores_gemma":[0.00017523205,0.00001352376,2.5538654e-7,0.000013748218,0.00003261423,0.000004160869,0.0003881892,0.98566383,0.0002055793,0.012600618,0.00075891457,0.0001433401],"about_ca_topic_score_codex":0.000037317142,"about_ca_topic_score_gemma":2.6783067e-7,"teacher_disagreement_score":0.9015871,"about_ca_system_score_codex":0.000030623094,"about_ca_system_score_gemma":0.000031535845,"threshold_uncertainty_score":0.48317188},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077218856,0.00006648785,0.9813899,0.00030172177,0.000037959213,0.00029222862,0.0000040822524,0.00032616523,0.009859586],"genre_scores_gemma":[0.4812915,0.0000024457072,0.51768714,0.00023719775,0.000034774108,0.0000290377,0.000004940457,0.000008421832,0.0007045271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905366,0.0000075579314,0.00016432196,0.00031508048,0.00013999591,0.0003193914],"domain_scores_gemma":[0.9990612,0.00025547453,0.000049447808,0.00045469217,0.00009009077,0.00008905367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035840197,0.000110879206,0.00012033547,0.000057063706,0.00020299938,0.00014414066,0.00046963053,0.000041871368,0.000017243388],"category_scores_gemma":[0.0000127890635,0.00008553167,0.000031522108,0.00031300425,0.00003417988,0.00020452877,0.000084856656,0.00005404936,0.00002284525],"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.000010413238,0.00014054579,0.00034070495,0.000034620618,0.000049588554,0.000005441189,0.0002847144,0.00038413188,0.007553147,0.9737876,0.0023124858,0.015096607],"study_design_scores_gemma":[0.0014127649,0.00023049787,0.0011616647,0.000058062386,0.000050533254,0.00015527698,0.00019259556,0.8027767,0.064512014,0.0100243045,0.11871389,0.0007117057],"about_ca_topic_score_codex":0.000037513913,"about_ca_topic_score_gemma":0.00011269512,"teacher_disagreement_score":0.9637633,"about_ca_system_score_codex":0.00003104123,"about_ca_system_score_gemma":0.0000782738,"threshold_uncertainty_score":0.34878802},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44447982,0.0000035764144,0.5539037,0.00034124407,0.00065080484,0.00024137214,0.0000014189301,0.000326846,0.000051207837],"genre_scores_gemma":[0.7736944,0.000006361703,0.2257396,0.000030390862,0.00023867351,0.00022090753,0.00005022844,0.0000099760755,0.000009441221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858356,0.00007252161,0.00043788145,0.00043409126,0.00023921001,0.00023276517],"domain_scores_gemma":[0.99901605,0.00010388974,0.00020143662,0.00051235926,0.00011447136,0.00005178822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005678193,0.00013889832,0.00015970165,0.00028278894,0.00031424503,0.0002467399,0.0003164573,0.00007705355,0.000006132672],"category_scores_gemma":[0.000096827374,0.00016149948,0.000057227477,0.00043867892,0.000037516016,0.001777026,0.00008886908,0.00008576303,0.000021776113],"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.000002815948,0.000026738391,0.0002397043,0.00002896381,0.00000722067,5.149548e-7,0.00021786739,0.0007170233,0.11122079,0.69410294,0.0001440646,0.19329135],"study_design_scores_gemma":[0.0005627671,0.00002601537,0.006456984,0.000020215259,0.000009282038,0.000018205727,0.000020508865,0.7783034,0.18642473,0.027252106,0.000720595,0.00018519971],"about_ca_topic_score_codex":0.00012867176,"about_ca_topic_score_gemma":0.000056262015,"teacher_disagreement_score":0.77758634,"about_ca_system_score_codex":0.00012433845,"about_ca_system_score_gemma":0.00005054677,"threshold_uncertainty_score":0.6585758},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017380476,0.000039528677,0.97859263,0.0016256098,0.0001885244,0.00060852664,0.000008929591,0.0002011481,0.0013546214],"genre_scores_gemma":[0.9452565,0.000005336512,0.053281717,0.00083373,0.00007645533,0.000029393732,0.000023676132,0.000016041056,0.00047718294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986247,0.00015619092,0.00030498207,0.00042491165,0.00026349377,0.00022574386],"domain_scores_gemma":[0.99721557,0.0016216091,0.0001708975,0.00051051466,0.00030091137,0.0001804755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035843352,0.00016308959,0.00012622125,0.00016932985,0.00044708903,0.00033196816,0.00023519421,0.00007350681,0.00013828735],"category_scores_gemma":[0.00011942974,0.00016724093,0.000057073066,0.00027813757,0.00003356578,0.0013368065,0.00007812934,0.0001690851,0.0006015369],"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.000016865899,0.00008427942,0.0000053782737,0.0000033836022,0.000018241552,9.2570565e-7,0.00062069326,0.927739,0.00034493222,0.057683956,0.000030708627,0.013451629],"study_design_scores_gemma":[0.00026292718,0.000037504597,0.000122618,0.000009651438,0.000036002388,0.0000019469007,0.000168353,0.9717276,0.0002684442,0.021117257,0.006053516,0.00019416084],"about_ca_topic_score_codex":0.00023772064,"about_ca_topic_score_gemma":0.0000070367755,"teacher_disagreement_score":0.927876,"about_ca_system_score_codex":0.000044583223,"about_ca_system_score_gemma":0.000065122695,"threshold_uncertainty_score":0.773174},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2176516,0.00016325184,0.78109384,0.0007910298,0.00009367255,0.000059457176,0.000013133615,0.000011325621,0.00012267892],"genre_scores_gemma":[0.77809453,0.0000011969095,0.22163059,0.00013539255,0.00007765265,0.0000032741457,0.0000031829095,0.000008588347,0.000045592453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911857,0.000015021494,0.00032424758,0.000105584215,0.00024309325,0.00019345921],"domain_scores_gemma":[0.9987494,0.00024955423,0.00022680714,0.00020866659,0.00019992558,0.00036567767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018799363,0.0000905026,0.00014555125,0.00019663543,0.0001348657,0.000112184585,0.0005696815,0.000034163706,0.000093526076],"category_scores_gemma":[0.00013235904,0.00008387176,0.000054697226,0.0002825196,0.000036041667,0.00026245124,0.000018417872,0.00013753069,0.000032769556],"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.00002743656,0.0010424342,0.0023055386,0.00029436604,0.00058130303,0.0046045138,0.027148338,0.20360693,0.005001453,0.6856983,0.01600559,0.05368382],"study_design_scores_gemma":[0.0005824086,0.00007917298,0.001272191,0.0003120837,0.000049869494,0.0014875043,0.0003541326,0.7027827,0.00022346474,0.28878713,0.0037437752,0.00032557547],"about_ca_topic_score_codex":0.00018904876,"about_ca_topic_score_gemma":0.00052253966,"teacher_disagreement_score":0.5604429,"about_ca_system_score_codex":0.00006649985,"about_ca_system_score_gemma":0.000977,"threshold_uncertainty_score":0.3420191},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117067546,0.00010154228,0.87991613,0.00018585991,0.0006669546,0.00013280982,0.000015618585,0.00003906284,0.0018744807],"genre_scores_gemma":[0.97500074,0.000038940743,0.024328688,0.00051872217,0.00006409033,0.0000047461263,0.000009382105,0.000007056534,0.000027636348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818045,0.000045616085,0.000826193,0.00012667778,0.00064222765,0.00017882469],"domain_scores_gemma":[0.9978241,0.0002783367,0.0005785208,0.00018152929,0.0010110288,0.00012650341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040252716,0.00017763773,0.0002377293,0.00031892618,0.00006525639,0.00021740679,0.0011536075,0.000066209905,0.000037607635],"category_scores_gemma":[0.00016947114,0.00014051399,0.00015439841,0.0001680763,0.000100643934,0.0007812933,0.00018787314,0.0003424635,0.000041934727],"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.0007565314,0.0014357131,0.0011672007,0.00012910458,0.0008140902,0.00065317936,0.012189903,0.0006765546,0.0031391466,0.27645257,0.0002254663,0.7023606],"study_design_scores_gemma":[0.00045210347,0.00034898377,0.001233657,0.00047562202,0.000023985393,0.00026786097,0.0005158789,0.97132266,0.021356424,0.003376825,0.00040637318,0.0002196576],"about_ca_topic_score_codex":0.0000068839213,"about_ca_topic_score_gemma":0.0000011028451,"teacher_disagreement_score":0.9706461,"about_ca_system_score_codex":0.00005100091,"about_ca_system_score_gemma":0.00007325036,"threshold_uncertainty_score":0.5729995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9159872,0.000022157996,0.07605375,0.0062036966,0.000051733856,0.00043907177,0.0000057252273,0.000050797713,0.0011858592],"genre_scores_gemma":[0.9381614,0.000005509085,0.060891196,0.0008660564,0.000024813608,0.00001835044,6.4477024e-7,0.00000706539,0.000025004694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882656,0.00007785536,0.0003542481,0.00018604001,0.0003668659,0.00018840587],"domain_scores_gemma":[0.99758834,0.0007520182,0.00049175747,0.0010480812,0.00006996753,0.000049809903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014392709,0.00012887976,0.0002861222,0.000010034682,0.0001247098,0.00006241305,0.0016465529,0.000045110824,0.00007141942],"category_scores_gemma":[0.00010065392,0.000065300665,0.000253891,0.00050634064,0.0005559633,0.000153613,0.0004560246,0.000205849,0.00000978105],"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.000009858472,0.0004773487,0.0031054057,0.00077371276,0.00047919707,5.597878e-7,0.020145932,0.0012693483,0.11502783,0.78208846,0.023268873,0.053353507],"study_design_scores_gemma":[0.0003389055,0.0002378587,0.06268539,0.000102440434,0.00014016872,0.000010772583,0.0027010653,0.518956,0.020189041,0.3937062,0.00052818184,0.000403971],"about_ca_topic_score_codex":0.00024689603,"about_ca_topic_score_gemma":0.000010091802,"teacher_disagreement_score":0.51768667,"about_ca_system_score_codex":0.00001758519,"about_ca_system_score_gemma":0.000038130773,"threshold_uncertainty_score":0.30597326},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8918076,0.0007718662,0.09610461,0.0077808835,0.00042859573,0.0008709482,7.6307845e-7,0.0006690183,0.0015656847],"genre_scores_gemma":[0.93107504,9.067853e-7,0.068371035,0.0003646369,0.00009258995,0.000013275322,0.0000060979464,0.0000071630234,0.00006923264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857575,0.000085027285,0.00029058344,0.00037244457,0.00030849242,0.00036770682],"domain_scores_gemma":[0.9989909,0.00023834081,0.00010168391,0.00053914,0.00007679824,0.00005315507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043314224,0.00013264606,0.0001389406,0.000063604646,0.00034665523,0.0003100884,0.0010629531,0.000056778266,0.000013357419],"category_scores_gemma":[0.000029645926,0.00009821973,0.00005904919,0.000502263,0.000042752927,0.00037477192,0.0007625445,0.0004501937,0.00021161398],"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.000004489995,0.0006828651,0.006375078,0.00013993583,0.00007928471,0.000042210013,0.0040343693,0.007744664,0.19829085,0.24199896,0.012182272,0.52842504],"study_design_scores_gemma":[0.00017386701,0.0000072809407,0.020403417,0.000038102437,0.0000021920303,0.000011881845,0.000014038293,0.9711572,0.0020650115,0.005363146,0.0006096186,0.00015427946],"about_ca_topic_score_codex":0.00026078432,"about_ca_topic_score_gemma":0.000015215181,"teacher_disagreement_score":0.9634125,"about_ca_system_score_codex":0.00005127743,"about_ca_system_score_gemma":0.000045328907,"threshold_uncertainty_score":0.40052843},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6772078,0.00015507852,0.30389723,0.008430673,0.00021508533,0.00089579524,7.6931235e-7,0.00034576285,0.008851771],"genre_scores_gemma":[0.9801466,0.0000042667702,0.018983932,0.0006982898,0.00006858417,0.0000814017,6.4518935e-7,0.00000932862,0.00000695704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966605,0.00004618132,0.0003487767,0.000710223,0.00082728174,0.0014070374],"domain_scores_gemma":[0.99884665,0.00028888954,0.00008452415,0.0005160977,0.00008269232,0.00018112174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039735944,0.0002107997,0.00019747406,0.00025478064,0.00033271656,0.00032036952,0.0028670672,0.000072372946,0.00002656387],"category_scores_gemma":[0.00010624893,0.00015522487,0.000050010312,0.0023572484,0.0009706143,0.00089115114,0.0009927275,0.0006739151,0.0000918019],"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.0000040792015,0.00031832562,0.00027528623,0.0000056386752,0.0000017596969,8.450016e-7,0.0003822583,0.000029639383,0.0024747448,0.99362856,0.00007303066,0.0028058114],"study_design_scores_gemma":[0.00022791974,0.000119578894,0.0021599056,0.00004826712,0.0000020536463,0.000019369978,0.000005370687,0.43059587,0.014430792,0.55192846,0.00023049083,0.00023191684],"about_ca_topic_score_codex":0.0000057721318,"about_ca_topic_score_gemma":0.0000013424777,"teacher_disagreement_score":0.4417001,"about_ca_system_score_codex":0.00032829738,"about_ca_system_score_gemma":0.00022252685,"threshold_uncertainty_score":0.63298863},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05617904,0.00013101651,0.94150835,0.0014470323,0.0005224437,0.000089333254,0.000010183242,0.000013387273,0.00009923432],"genre_scores_gemma":[0.9433116,0.000006310279,0.056116525,0.00044455507,0.00010630522,0.0000045314832,9.2989995e-7,0.0000030686062,0.0000061999863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972571,0.00005825096,0.0004721572,0.00016350661,0.0018780634,0.00017093672],"domain_scores_gemma":[0.99650866,0.00061253324,0.00047029473,0.00018774215,0.0021119255,0.00010881672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024111294,0.00009549606,0.000120133955,0.0002641686,0.00018563219,0.00015945832,0.0017001648,0.000023419774,0.000012448337],"category_scores_gemma":[0.0006576044,0.000066535365,0.00006895558,0.0005568597,0.00032785913,0.0007946421,0.00018631699,0.00014879441,0.0000095137875],"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.000055468943,0.0005495521,0.003220473,0.000028950604,0.00006324482,0.0000069890216,0.004084322,0.166995,0.0022556924,0.4484172,0.00016080923,0.37416232],"study_design_scores_gemma":[0.00015312541,0.0002285078,0.010433678,0.00013228197,0.000009021246,0.00019737268,0.00017771241,0.95048183,0.006614395,0.031137018,0.00030553446,0.00012954314],"about_ca_topic_score_codex":0.000010591511,"about_ca_topic_score_gemma":5.349938e-7,"teacher_disagreement_score":0.8871325,"about_ca_system_score_codex":0.00008329302,"about_ca_system_score_gemma":0.0004866588,"threshold_uncertainty_score":0.31593573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009217424,0.00006219361,0.98948795,0.0002687648,0.000039400627,0.00048508449,0.0000010545402,0.00006412432,0.00037401324],"genre_scores_gemma":[0.8431855,8.0629985e-7,0.15637274,0.00005707464,0.000048098318,0.0002024894,0.00001329044,0.0000040855716,0.000115920084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949473,0.000035459707,0.00012505718,0.00016159151,0.00007860199,0.00010456419],"domain_scores_gemma":[0.99937856,0.00028159207,0.000043856806,0.00027179145,0.0000133297335,0.000010839579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026590738,0.000050456114,0.00004933491,0.000021384214,0.00018979322,0.000041660343,0.00021008533,0.000028142851,0.0000034121326],"category_scores_gemma":[0.0000064027136,0.000039345185,0.000036817593,0.000062410065,0.000008850597,0.000093453724,0.000048864174,0.00003163297,0.000020471376],"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":[4.9990007e-7,0.00001034687,0.000012343879,0.000002215202,9.0382656e-7,3.731507e-8,0.000059849506,0.95467275,0.0055003273,0.027911652,0.000017919912,0.011811152],"study_design_scores_gemma":[0.00010368161,0.0000048654406,0.00005409269,6.346421e-7,0.0000044568055,2.1891464e-7,0.000009159076,0.9597042,0.0020767148,0.02906619,0.008927393,0.000048369075],"about_ca_topic_score_codex":0.000022742535,"about_ca_topic_score_gemma":0.0000014018332,"teacher_disagreement_score":0.83396804,"about_ca_system_score_codex":0.000018968869,"about_ca_system_score_gemma":0.000007279212,"threshold_uncertainty_score":0.160445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.480837,0.0000033512151,0.51839006,0.0005251251,0.000027112723,0.000099431774,0.00000507866,0.000049560174,0.000063262916],"genre_scores_gemma":[0.9122873,0.0000041617586,0.08752919,0.000071069364,0.0000081335,0.000015443082,9.712293e-7,0.0000068193103,0.000076934455],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999301,0.000027279359,0.00018573982,0.00019104283,0.00015997412,0.0001349694],"domain_scores_gemma":[0.9990458,0.00021129206,0.00012502116,0.0005115178,0.000037451668,0.00006890613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013528514,0.000114957904,0.00018482226,0.000014018213,0.00025484056,0.000031462674,0.00036150886,0.000034566645,0.00003132379],"category_scores_gemma":[0.000011502584,0.0000696052,0.00020261592,0.00028630224,0.0004719194,0.00013825936,0.00003597805,0.00020996803,0.000008534148],"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.000008903421,0.001190609,0.002021258,0.0001203395,0.00028024023,1.6407041e-7,0.02003749,0.000314738,0.7852915,0.16013184,0.00040063882,0.030202279],"study_design_scores_gemma":[0.0005909957,0.0001244857,0.052295685,0.00004158167,0.000107583204,0.0000371249,0.0018520727,0.77990717,0.10676663,0.056156006,0.0015029125,0.00061775895],"about_ca_topic_score_codex":0.000028012071,"about_ca_topic_score_gemma":0.0000065616828,"teacher_disagreement_score":0.7795924,"about_ca_system_score_codex":0.00000957597,"about_ca_system_score_gemma":0.000033664197,"threshold_uncertainty_score":0.28384176},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43063334,0.00502476,0.5162236,0.012586452,0.0008891002,0.00070681574,0.000052811665,0.00044478232,0.03343834],"genre_scores_gemma":[0.998757,0.0001315722,0.0007325241,0.00008019078,0.000008165517,0.000004967129,0.000007938747,0.0000041832864,0.0002734348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992882,0.00002531696,0.00023136732,0.00013030074,0.0002104241,0.000114377384],"domain_scores_gemma":[0.9991603,0.00004859197,0.00014592311,0.00044221227,0.00016049472,0.00004251018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117332325,0.000065679786,0.00012959755,0.0000791793,0.00004306697,0.000018033938,0.0004404023,0.000042806332,0.000015255189],"category_scores_gemma":[0.000021759912,0.00006804832,0.00005443069,0.00048636188,0.000024283952,0.00018162242,0.000045263954,0.000051825144,0.000032569336],"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":[7.644409e-7,0.00027411492,0.00028171708,0.000023089837,0.000012824998,0.0000015571437,0.0002844565,0.000020955777,0.004029445,0.9721068,0.016519373,0.006444879],"study_design_scores_gemma":[0.00073299505,0.00035602658,0.005151231,0.000052155294,0.000017023984,0.000011411107,0.000023901674,0.10938247,0.40871602,0.39845216,0.0767006,0.00040398922],"about_ca_topic_score_codex":0.000016591974,"about_ca_topic_score_gemma":7.91475e-7,"teacher_disagreement_score":0.57365465,"about_ca_system_score_codex":0.0000041508106,"about_ca_system_score_gemma":0.000011689545,"threshold_uncertainty_score":0.277493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025727099,0.00022431153,0.97262824,0.0004896713,0.0001684428,0.00015166082,0.000004128808,0.000059531958,0.0005469103],"genre_scores_gemma":[0.6532713,0.000010227643,0.34623456,0.0001367979,0.00032074744,0.000008662864,0.0000055138985,0.000005723546,0.000006471369],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894655,0.000042023927,0.0004898743,0.00014176646,0.00023192992,0.00014785126],"domain_scores_gemma":[0.9976887,0.0001625105,0.00050385715,0.00015698643,0.001415444,0.00007251188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005296098,0.00011155928,0.00012503797,0.00031589624,0.00014474234,0.00015204832,0.0006404529,0.00003540963,0.0000039148463],"category_scores_gemma":[0.00003705081,0.00010484757,0.000045164586,0.000728399,0.00008671141,0.000530605,0.0001695704,0.00016617474,0.000007723803],"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.0000074712934,0.0006386877,0.003536188,0.000020727386,0.000105934094,0.000002432712,0.0012867516,0.0002736995,0.12463833,0.23206085,0.00024300063,0.63718593],"study_design_scores_gemma":[0.00057713507,0.00011275532,0.0061373967,0.00026763786,0.00003268346,0.00048794714,0.00061825785,0.12501185,0.8238416,0.009894352,0.032407526,0.0006108877],"about_ca_topic_score_codex":0.000004346675,"about_ca_topic_score_gemma":1.9130226e-7,"teacher_disagreement_score":0.69920325,"about_ca_system_score_codex":0.00009771071,"about_ca_system_score_gemma":0.00010499502,"threshold_uncertainty_score":0.42755598},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087714374,0.00018191872,0.9060306,0.00016592332,0.000105342944,0.000072040246,0.0000020871723,0.00018217234,0.005545534],"genre_scores_gemma":[0.93244,0.0000056887593,0.067094944,0.000050094906,0.000040446816,0.000008514267,0.000024225079,0.0000042892866,0.00033181495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99942714,0.000019158546,0.00015369066,0.00011288408,0.00013808618,0.00014905125],"domain_scores_gemma":[0.9993862,0.000014569962,0.000055851648,0.0004517998,0.00003142692,0.000060178012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010231832,0.000058921167,0.00007126326,0.000041761516,0.000043194887,0.00003068246,0.0003406694,0.000025174913,0.0000580839],"category_scores_gemma":[0.0000050805133,0.000051431576,0.00003349505,0.00016771704,0.000017102191,0.00030283307,0.00012868774,0.000017954007,0.00012584681],"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":[2.6134305e-7,0.0003471064,0.0016437937,0.000013396426,0.0000072016633,2.2662283e-7,0.00032931735,0.00003180039,0.28328034,0.69549346,0.0023691887,0.016483918],"study_design_scores_gemma":[0.0002181992,0.000032655167,0.008396188,0.000009700656,0.0000125778715,0.0000064713454,0.000023557237,0.16398694,0.7645244,0.0027460223,0.059802484,0.0002407765],"about_ca_topic_score_codex":0.000025144689,"about_ca_topic_score_gemma":0.0000014402332,"teacher_disagreement_score":0.8447256,"about_ca_system_score_codex":0.000012771798,"about_ca_system_score_gemma":0.00001142055,"threshold_uncertainty_score":0.20973189},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037939167,0.00014035293,0.9953837,0.0002568974,0.00017937143,0.00014109121,0.000008155009,0.000021929816,0.000074588046],"genre_scores_gemma":[0.624661,0.000012211008,0.37511533,0.00009249376,0.000076702556,0.000016055836,0.000004025308,0.0000061821206,0.000015979229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990506,0.00012114817,0.00034007634,0.00014981123,0.00018901334,0.00014931352],"domain_scores_gemma":[0.9989107,0.00050852506,0.00018213756,0.00019224403,0.00007761979,0.00012874647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011957308,0.00009390732,0.0001767974,0.0000512807,0.000105496205,0.00009395665,0.00027923513,0.000038704333,0.00001666379],"category_scores_gemma":[0.00015173541,0.00007620415,0.000048982598,0.000051487852,0.000022269434,0.00016006592,0.00007427083,0.00007127109,0.0000045454412],"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.000043046326,0.000097031225,1.4250064e-7,0.000016307304,0.000013845539,0.0000017375532,0.00024776312,0.0000041242038,0.075298995,0.9071517,0.00017828542,0.016947031],"study_design_scores_gemma":[0.00053529587,0.0004351714,0.0000031225002,0.000013328758,0.000019305015,0.000027748656,0.00007121583,0.23486039,0.094867736,0.6641395,0.004938133,0.00008902585],"about_ca_topic_score_codex":2.5916776e-7,"about_ca_topic_score_gemma":2.3218675e-8,"teacher_disagreement_score":0.62086713,"about_ca_system_score_codex":0.000021923472,"about_ca_system_score_gemma":0.000024538978,"threshold_uncertainty_score":0.3107515},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857503,0.00019856797,0.005963906,0.006056124,0.00014653245,0.00061069423,0.000007986924,0.00008909731,0.0011767821],"genre_scores_gemma":[0.91646904,0.000060843857,0.08246327,0.00032937343,0.00029991413,0.0002508254,0.00000785575,0.000029040933,0.00008985762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981384,3.7582858e-8,0.0005200115,0.00037855294,0.0006086387,0.00035435526],"domain_scores_gemma":[0.99900717,0.000179544,0.0002462023,0.00010850446,0.00039255578,0.00006600694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055843085,0.00024046529,0.00024068546,0.000092881215,0.000110025685,0.00023703784,0.001942379,0.0001210558,0.000008624703],"category_scores_gemma":[0.00012515714,0.00017484449,0.00040439266,0.00063861255,0.00012556184,0.0005243295,0.00019125066,0.0003757791,0.0000018099224],"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.000013638868,0.0002100721,0.00027674672,0.00016095459,0.00012782137,3.389952e-7,0.0015202275,0.0039882204,0.34675717,0.6397286,0.003710122,0.0035060744],"study_design_scores_gemma":[0.00065015804,0.00013943744,0.00072291726,0.00007692041,0.00004813359,0.000024098668,0.0006390494,0.962125,0.03127375,0.002000334,0.0020256916,0.00027450288],"about_ca_topic_score_codex":0.000008924585,"about_ca_topic_score_gemma":3.03487e-7,"teacher_disagreement_score":0.9581368,"about_ca_system_score_codex":0.000079269776,"about_ca_system_score_gemma":0.0000088055585,"threshold_uncertainty_score":0.7129952},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48585904,0.00023774547,0.5121595,0.00012439556,0.000029730412,0.00014546089,6.464006e-7,0.000105542415,0.0013379108],"genre_scores_gemma":[0.93467045,0.0000010060537,0.06517319,0.000018888,0.000015196377,0.000008960471,0.0000014337064,0.0000051309485,0.00010575406],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919605,0.00003288953,0.00023926384,0.00020872874,0.0001696993,0.00015335444],"domain_scores_gemma":[0.9993415,0.000035944013,0.00008606528,0.0003248389,0.0001384572,0.000073230636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006824511,0.000082317194,0.00017623072,0.000056917794,0.000088759705,0.000121351215,0.00027589177,0.000042269694,0.000022081935],"category_scores_gemma":[0.000005600869,0.000071817565,0.000024271854,0.00037987684,0.000041744403,0.00023482546,0.00010574975,0.000047290858,0.000020104459],"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":[4.2797282e-7,0.00012325021,0.015814723,0.000017630431,0.000008241554,7.983355e-8,0.0005851278,0.00001836018,0.96549493,0.0017000647,0.00048593216,0.01575123],"study_design_scores_gemma":[0.00012411688,0.000038068363,0.011226549,0.000017769014,0.000007941714,0.000011807507,0.00014010454,0.5995525,0.38762712,0.00026844777,0.0008438113,0.00014173731],"about_ca_topic_score_codex":0.00070387695,"about_ca_topic_score_gemma":0.00008509334,"teacher_disagreement_score":0.59953415,"about_ca_system_score_codex":0.0000145015365,"about_ca_system_score_gemma":0.00002388664,"threshold_uncertainty_score":0.29286355},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41064733,0.0000036509932,0.57988316,0.0054919524,0.00016280822,0.0001432824,0.0000015888311,0.00019773174,0.0034685107],"genre_scores_gemma":[0.967485,3.598439e-7,0.031895716,0.0004740511,0.00011045506,0.000010162641,0.0000012796047,0.0000064835285,0.000016465885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982714,0.00007625537,0.00019719463,0.00058231945,0.0005097264,0.0003631002],"domain_scores_gemma":[0.99636173,0.0018967022,0.000054276057,0.001403894,0.000057115187,0.00022625641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015909754,0.0001445536,0.00011790894,0.00010726649,0.00095101795,0.00063164777,0.002437709,0.000056506557,0.000019540279],"category_scores_gemma":[0.0002609673,0.00009549423,0.00003923612,0.0008144914,0.002537272,0.00033603053,0.000903043,0.0004475868,0.00019506247],"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":[4.8988653e-7,0.000019191371,0.0007676568,0.0000017314096,0.0000010999966,0.0000015876445,0.00013924454,0.0000023705622,0.0012517547,0.9908249,0.00008332564,0.006906698],"study_design_scores_gemma":[0.00010030983,0.000058142883,0.0418924,0.000009395039,0.0000043064238,0.000013809975,0.0000025119712,0.1380771,0.0034615085,0.8159454,0.00027240385,0.00016275317],"about_ca_topic_score_codex":0.0000019654283,"about_ca_topic_score_gemma":5.055819e-7,"teacher_disagreement_score":0.5568377,"about_ca_system_score_codex":0.000012340996,"about_ca_system_score_gemma":0.00006433871,"threshold_uncertainty_score":0.93486845},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053279664,0.000079165344,0.92882305,0.00047922786,0.00009491134,0.0004933496,0.0000150895285,0.00068542315,0.0160501],"genre_scores_gemma":[0.49127847,0.000006713108,0.5074474,0.00028245267,0.000092182534,0.00004381166,0.00005624857,0.000044860823,0.00074784126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99769324,0.000010897722,0.000528682,0.00056246424,0.0006684992,0.000536204],"domain_scores_gemma":[0.9975632,0.00015298159,0.00029131665,0.0017027011,0.00007187873,0.00021791682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007245978,0.00027570355,0.00035632652,0.00014570856,0.00028632098,0.00015532893,0.0012394433,0.00009154169,0.00004925473],"category_scores_gemma":[0.000022101309,0.0002721474,0.00012941317,0.00041480255,0.00009191525,0.00021703615,0.0005514182,0.00019799828,0.0006308688],"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.0000047008466,0.0002785712,0.000010657059,0.00014747612,0.000051226045,0.000038974504,0.00037307997,0.000054435925,0.1005082,0.8915968,0.0047116512,0.0022242104],"study_design_scores_gemma":[0.0015512261,0.000058085876,0.000709326,0.00021364534,0.0001392622,0.00010792317,0.00044244644,0.1264385,0.511513,0.3349252,0.022331996,0.0015693867],"about_ca_topic_score_codex":0.000004202552,"about_ca_topic_score_gemma":0.000002225916,"teacher_disagreement_score":0.5566716,"about_ca_system_score_codex":0.00006481513,"about_ca_system_score_gemma":0.000051567305,"threshold_uncertainty_score":0.99997306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14846608,0.00004427178,0.84679264,0.00012628031,0.0009248215,0.00023830094,0.000001054035,0.00016534784,0.003241224],"genre_scores_gemma":[0.961911,0.0000029586074,0.037873562,0.00009957912,0.00007858199,0.000022067223,0.0000016647156,0.0000073019587,0.0000032829523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977667,0.00013907246,0.00028475773,0.00072485936,0.00045498693,0.0006296261],"domain_scores_gemma":[0.99850774,0.00024145567,0.000058281505,0.00084109633,0.00012258539,0.00022881835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000815303,0.00017154748,0.00022037723,0.00014282808,0.00027681995,0.0002109317,0.001959166,0.00006265702,0.000010886854],"category_scores_gemma":[0.000022813887,0.00014861584,0.00004875039,0.0015441752,0.0012643227,0.00046762364,0.0010081244,0.00018362977,0.00009946854],"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.000015931513,0.00007415829,0.00008720916,0.0000030335925,0.0000024457236,0.000023828912,0.0006165629,0.0005100855,0.00034250226,0.9945861,0.00000756765,0.003730571],"study_design_scores_gemma":[0.0003650789,0.00015658292,0.009801284,0.000055135675,0.0000042823644,0.000031904558,0.000014917372,0.9451089,0.0010697194,0.043132693,0.000016371314,0.00024312439],"about_ca_topic_score_codex":0.000032964548,"about_ca_topic_score_gemma":0.0000021417054,"teacher_disagreement_score":0.9514534,"about_ca_system_score_codex":0.0000925457,"about_ca_system_score_gemma":0.00009749641,"threshold_uncertainty_score":0.60603786},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7504717,0.00072628574,0.24836782,0.000086310894,0.00005131474,0.00017863781,0.000014453018,0.000023236074,0.000080224934],"genre_scores_gemma":[0.99916923,0.000010511448,0.00070091285,0.000013287823,0.00004236105,0.000006062399,0.000017954537,0.0000072952657,0.000032369946],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998871,0.000062794265,0.00046297032,0.0002521547,0.00014733092,0.00020374208],"domain_scores_gemma":[0.9993916,0.000054153064,0.00015578419,0.00029846333,0.00003708809,0.00006289217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010163947,0.00012069967,0.0003268656,0.000047451304,0.00003158168,0.000046960715,0.0003343975,0.000096374926,0.0000014619197],"category_scores_gemma":[0.0000055620985,0.000101374135,0.000062506435,0.00021571491,0.000060316426,0.00011943677,0.000088838366,0.0001234796,2.0033048e-7],"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.00008234483,0.00029771804,0.016227538,0.0004060727,0.00018022217,0.000034066554,0.003810054,0.114815906,0.48300952,0.28294036,0.000041162417,0.098155044],"study_design_scores_gemma":[0.00028352338,0.000039772152,0.0019518915,0.000036879297,0.00000919167,0.000010626404,0.00010680447,0.99622995,0.0010401454,0.000116969124,0.000063139705,0.000111086396],"about_ca_topic_score_codex":0.00023736036,"about_ca_topic_score_gemma":0.00009646507,"teacher_disagreement_score":0.88141406,"about_ca_system_score_codex":0.000013276388,"about_ca_system_score_gemma":0.000009533957,"threshold_uncertainty_score":0.41339174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043011595,0.00010953072,0.9380273,0.016659833,0.000088683846,0.0001681579,0.0000148754,0.00023740511,0.0016826207],"genre_scores_gemma":[0.7443259,5.2798254e-7,0.25150967,0.0031933244,0.00013385843,0.000028129527,0.000029895664,0.0000074415248,0.00077130104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892503,0.000017334714,0.00018894995,0.00033664817,0.00030491568,0.00022713543],"domain_scores_gemma":[0.9992499,0.00009761063,0.000043899123,0.0003547065,0.000075173375,0.0001787129],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000111466106,0.00010709698,0.000104869054,0.0002464568,0.00012677285,0.00014968471,0.00068310945,0.00003299217,0.000085732965],"category_scores_gemma":[0.000019324521,0.000113675604,0.000053635573,0.0007459419,0.00001768088,0.0001784803,0.00024917547,0.00007514434,0.00079300953],"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.000004309565,0.00036311193,0.0011177686,0.000013693698,0.00005116825,0.000010640327,0.0017032735,0.13267912,0.00076888717,0.47085413,0.08031153,0.31212237],"study_design_scores_gemma":[0.0005304171,0.00008260184,0.03603939,0.000016120175,0.000009293984,0.000069651265,0.00002398768,0.6177335,0.0006309271,0.045616228,0.29874834,0.00049953343],"about_ca_topic_score_codex":0.000026855794,"about_ca_topic_score_gemma":0.00001445515,"teacher_disagreement_score":0.7013143,"about_ca_system_score_codex":0.000062780826,"about_ca_system_score_gemma":0.000091519556,"threshold_uncertainty_score":0.999985},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050297335,0.0000172286,0.93477386,0.00038017047,0.00007582159,0.0001540471,0.0000011512275,0.00016685424,0.014133539],"genre_scores_gemma":[0.90944684,0.000007908449,0.090247385,0.00009391244,0.0000142591325,0.000017229635,0.0000069778566,0.0000033734389,0.00016213072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994348,0.000012344976,0.00014907049,0.00017339019,0.00012004086,0.000110333975],"domain_scores_gemma":[0.99948204,0.000039519273,0.000055928933,0.00033147167,0.00004823687,0.000042811473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000727556,0.000059489466,0.00009688653,0.00005227245,0.000048869126,0.00003341277,0.0002829716,0.000028998662,0.00007418272],"category_scores_gemma":[0.000015030554,0.000053177355,0.000048891205,0.0002820173,0.000026461921,0.00022976195,0.000055102602,0.00004153353,0.00020192527],"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.000018442062,0.0010693757,0.00008051952,0.000084386906,0.000061140156,0.00001846479,0.0026061353,0.0074618366,0.4127007,0.45783558,0.0010155645,0.11704785],"study_design_scores_gemma":[0.002470057,0.000104515435,0.000681446,0.00004549616,0.000021493184,0.000055089957,0.0000774809,0.066198684,0.8052658,0.12451133,0.00026754147,0.00030107747],"about_ca_topic_score_codex":0.00007372699,"about_ca_topic_score_gemma":0.000016904445,"teacher_disagreement_score":0.8591495,"about_ca_system_score_codex":0.000017728991,"about_ca_system_score_gemma":0.000053067808,"threshold_uncertainty_score":0.25954083},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31343883,0.00049712876,0.66458225,0.0010681703,0.0002841599,0.00022918828,0.000008626877,0.0003681897,0.019523432],"genre_scores_gemma":[0.95349115,0.0000032701053,0.04478865,0.0007631639,0.00008328022,0.00003064986,0.000008695521,0.000009642201,0.0008215156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908376,0.00001760234,0.00013374229,0.00021819751,0.00022308851,0.00032363602],"domain_scores_gemma":[0.99920756,0.000036473084,0.000044338052,0.0005144117,0.000030481175,0.00016675598],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021646977,0.000101561294,0.00009413464,0.00006648319,0.00012621944,0.00007017275,0.00057978445,0.000061956554,0.000027353644],"category_scores_gemma":[0.000017374601,0.00009846835,0.00006659616,0.000320144,0.000025196501,0.00045191182,0.00022317107,0.000119797965,0.0011430914],"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.0000023360271,0.00039045844,0.0018514335,0.000026648771,0.00003184922,0.000004380952,0.001453573,0.00013741956,0.017006444,0.91301554,0.0075428477,0.05853705],"study_design_scores_gemma":[0.00032988365,0.000024743473,0.0029681602,0.000010493118,0.000017693821,0.00007388893,0.000057961024,0.86848956,0.03818814,0.034496754,0.054866806,0.0004758923],"about_ca_topic_score_codex":0.000016223274,"about_ca_topic_score_gemma":5.431361e-7,"teacher_disagreement_score":0.8785188,"about_ca_system_score_codex":0.000027601043,"about_ca_system_score_gemma":0.00004096591,"threshold_uncertainty_score":0.9996346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12915632,0.000037229976,0.86876595,0.0009932342,0.00007370192,0.00022698478,0.000028447404,0.00013094822,0.00058719923],"genre_scores_gemma":[0.98568773,0.0000057348007,0.013832821,0.00023323286,0.000014306508,0.000035246987,0.0000017530873,0.000012630228,0.00017656172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988172,0.00015705352,0.00028718836,0.00031865697,0.00018378526,0.00023608479],"domain_scores_gemma":[0.99822885,0.0008736477,0.0000691733,0.0007085579,0.00003721306,0.000082559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006700126,0.00014225018,0.00017481139,0.00015381104,0.00019926197,0.00008282115,0.000614967,0.000056852157,0.00001864804],"category_scores_gemma":[0.0000734419,0.00010919084,0.00006530662,0.0006862284,0.00011513398,0.00018792873,0.00003155699,0.00018509555,0.000017230377],"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.000016478825,0.0005049722,0.00041968582,0.00007220102,0.00007164661,0.000004860883,0.011903395,0.0288328,0.025497964,0.26458186,0.00011910073,0.667975],"study_design_scores_gemma":[0.00050152733,0.000062348045,0.0108008925,0.00005634353,0.000025645842,0.0000077938885,0.00036127146,0.97125834,0.008746694,0.0031452444,0.0049328455,0.000101030484],"about_ca_topic_score_codex":0.00017451146,"about_ca_topic_score_gemma":0.00023841331,"teacher_disagreement_score":0.94242555,"about_ca_system_score_codex":0.000027112135,"about_ca_system_score_gemma":0.00004964406,"threshold_uncertainty_score":0.44526735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3203678,0.00012728841,0.6776084,0.00016061052,0.000016317328,0.000069481706,0.0000065403037,0.00013339067,0.0015101803],"genre_scores_gemma":[0.9621659,0.000016867943,0.037546445,0.0000988554,0.000011879138,0.000012583247,0.000011140052,0.000004456117,0.00013188232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990702,0.000019789793,0.00025658184,0.00031249976,0.00017837383,0.00016254734],"domain_scores_gemma":[0.9987377,0.000043334894,0.00009698333,0.0009778495,0.000058324524,0.000085839805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013100379,0.00008358519,0.00020323544,0.00016725612,0.00007038818,0.000063770494,0.0006209406,0.000034138902,0.00041499882],"category_scores_gemma":[0.000009067845,0.00007574133,0.00012385078,0.0015998606,0.0000313992,0.00026609367,0.00006223999,0.00004492073,0.000021758213],"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.0000054687466,0.001290686,0.05178413,0.00004847099,0.0016182185,0.000018747956,0.0035521626,0.006969041,0.39125898,0.4123949,0.002118233,0.12894093],"study_design_scores_gemma":[0.00012581998,0.000017078039,0.011804853,0.0000020650025,0.00010950698,0.0000017581191,0.000019264915,0.9787525,0.0077984305,0.0002870426,0.00095648586,0.0001252207],"about_ca_topic_score_codex":0.0000377703,"about_ca_topic_score_gemma":0.000068019566,"teacher_disagreement_score":0.97178346,"about_ca_system_score_codex":0.000018270886,"about_ca_system_score_gemma":0.00001311483,"threshold_uncertainty_score":0.45439464},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016871661,0.0001921252,0.9551156,0.0051706624,0.00013231917,0.000105472674,3.6168726e-7,0.00015795883,0.022253843],"genre_scores_gemma":[0.99607265,0.000011397731,0.0028287494,0.00027689838,0.000016365668,0.0000021535193,0.0000012753109,0.000001189817,0.0007893282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959385,0.000011771932,0.00010114318,0.00010730368,0.000101031794,0.00008490912],"domain_scores_gemma":[0.9994339,0.00005369618,0.000032878594,0.00042494744,0.000030951844,0.000023650075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010099172,0.00003973599,0.000043503598,0.000018245139,0.0001384621,0.000075787924,0.00038109272,0.000017127573,0.000021167576],"category_scores_gemma":[0.000011437637,0.000025169416,0.000029600917,0.0002661701,0.000021038346,0.00009726806,0.00003905873,0.000035565834,0.00008741839],"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.0000030166584,0.000039689497,0.000056233177,0.0000010406355,0.0000040863065,3.0964947e-7,0.00018434804,0.000027002292,0.0040491517,0.8767406,0.0016099161,0.11728461],"study_design_scores_gemma":[0.0004692468,0.000588369,0.15079834,0.000011004367,0.000023559725,0.000007892107,0.000098881224,0.16470902,0.014187302,0.119729996,0.5490322,0.00034420087],"about_ca_topic_score_codex":0.000007461863,"about_ca_topic_score_gemma":0.0000047225503,"teacher_disagreement_score":0.97920096,"about_ca_system_score_codex":0.0000043488053,"about_ca_system_score_gemma":0.000028053764,"threshold_uncertainty_score":0.11236157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020893065,0.00005335406,0.97977644,0.0017979034,0.00003861596,0.00014294234,0.0000015569361,0.00030609767,0.015793756],"genre_scores_gemma":[0.97001237,0.0000020096513,0.028414214,0.00042873572,0.000016621474,0.0000054329007,0.000005097377,0.0000027872072,0.0011127053],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925894,0.000017469012,0.0001978399,0.00020637948,0.00016850956,0.00015088619],"domain_scores_gemma":[0.9990559,0.000030507455,0.00006216397,0.0007429805,0.00004572279,0.000062702726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011924677,0.000079152385,0.00013291734,0.000050253286,0.00004340746,0.000035911435,0.00064940326,0.000034346125,0.00007457204],"category_scores_gemma":[0.000005551637,0.000069163594,0.00006570976,0.00024060832,0.00002074762,0.00017705048,0.000041832627,0.00004323609,0.00031759805],"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.0000025545864,0.00029234675,0.00006905627,0.00000624902,0.000015000182,0.0000061741393,0.000083584,0.000053152024,0.5645669,0.3746831,0.008895456,0.0513264],"study_design_scores_gemma":[0.0007124448,0.00009584468,0.0032884704,0.0000059434474,0.00001057359,0.00000776971,0.000003516923,0.851628,0.109706156,0.012088003,0.022275778,0.00017751868],"about_ca_topic_score_codex":0.000005766025,"about_ca_topic_score_gemma":8.493572e-7,"teacher_disagreement_score":0.9679231,"about_ca_system_score_codex":0.000008846661,"about_ca_system_score_gemma":0.000024918363,"threshold_uncertainty_score":0.40821862},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17985947,0.0010841802,0.81783545,0.0000667294,0.00015208015,0.0002594787,0.000016370423,0.00017426013,0.0005519707],"genre_scores_gemma":[0.9984635,0.000011553805,0.0007050931,0.000014429579,0.00005623075,0.000027341279,0.00007400375,0.000010450232,0.0006373618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856997,0.00031157318,0.00040281695,0.00031744307,0.00020821064,0.00019000843],"domain_scores_gemma":[0.9989811,0.00032323555,0.00014295745,0.00044413132,0.000033078868,0.00007546989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007763161,0.00013723354,0.00026860257,0.00005973401,0.0001204291,0.00008039813,0.000372279,0.00010018606,0.000007742211],"category_scores_gemma":[0.000030721367,0.00011639211,0.00006400783,0.00022699608,0.00010941687,0.00016361754,0.00010202545,0.000080434125,0.000024354338],"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.000035176523,0.00013825126,0.00009731864,0.00007522049,0.000015648462,0.0000029872,0.00007221371,0.0011668727,0.018155048,0.97882915,0.00032050014,0.0010916059],"study_design_scores_gemma":[0.0018091154,0.000045555294,0.00035170192,0.000054942913,0.000026275555,0.000016468624,0.000023199262,0.97318983,0.0013406253,0.021181697,0.0017342411,0.00022634563],"about_ca_topic_score_codex":0.000065964996,"about_ca_topic_score_gemma":0.0000015589154,"teacher_disagreement_score":0.97202295,"about_ca_system_score_codex":0.000019952582,"about_ca_system_score_gemma":0.000023147351,"threshold_uncertainty_score":0.47463325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014456253,0.00006518817,0.98412806,0.00027597987,0.00019668491,0.00032063475,0.00002064243,0.00042864215,0.00010789809],"genre_scores_gemma":[0.8402081,0.0000026534292,0.15936913,0.000091272974,0.0001110308,0.0001079104,0.000014011941,0.000021286018,0.000074593394],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986728,0.000025394826,0.00030506894,0.00046685094,0.0002153399,0.0003145438],"domain_scores_gemma":[0.99918914,0.000042874683,0.00011835013,0.00043623676,0.00015299326,0.00006039221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014577522,0.00018348517,0.00014016182,0.0001518006,0.00064196734,0.00057903066,0.00040488693,0.00007164141,0.000009731071],"category_scores_gemma":[0.0000024824535,0.00019340363,0.00009108855,0.00039437393,0.000041477044,0.0009827418,0.0000037536656,0.00012629846,0.000026154728],"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.0000012515072,0.00023173676,0.000003862277,0.000060815033,0.000005990673,0.0000025143725,0.00012427993,0.00547984,0.6146119,0.00010994302,0.000070106515,0.37929773],"study_design_scores_gemma":[0.00022684556,0.000018173892,0.000010376546,0.00002443906,0.000017273695,0.0000062767426,0.000005936803,0.658792,0.34007034,0.00047156357,0.00019890166,0.00015785467],"about_ca_topic_score_codex":0.00007795453,"about_ca_topic_score_gemma":0.000028475235,"teacher_disagreement_score":0.82575184,"about_ca_system_score_codex":0.000069665126,"about_ca_system_score_gemma":0.00014215529,"threshold_uncertainty_score":0.7886771},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13306014,0.000004339039,0.857592,0.0010561167,0.000057409277,0.0003366609,0.0000030530764,0.00008949589,0.0078007826],"genre_scores_gemma":[0.7590372,3.9324019e-7,0.24075751,0.0001657723,0.000015496305,0.000010354942,5.3177047e-7,0.0000061968863,0.000006565164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779844,0.00004674609,0.00038861934,0.00048667868,0.00082888594,0.00045061467],"domain_scores_gemma":[0.9963409,0.0015978877,0.0001577473,0.0015612814,0.0001733013,0.00016891026],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024887274,0.00018304487,0.00022926024,0.000109048546,0.00039332313,0.00021870948,0.0026479177,0.00003873564,0.00003550368],"category_scores_gemma":[0.00013395929,0.0000975744,0.00008060868,0.001170872,0.003765116,0.00019460433,0.00059534283,0.00016879587,0.000031366522],"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.000007737374,0.00013322478,0.000013068976,0.000012436004,0.000005735833,0.0000023528257,0.0010034742,0.000029856705,0.00139649,0.9958335,0.000019182586,0.001542954],"study_design_scores_gemma":[0.00018189513,0.00026170473,0.00070752716,0.000055843706,0.000011420282,0.000025259884,0.00009344134,0.42006114,0.022440746,0.55593187,0.000031166597,0.00019796325],"about_ca_topic_score_codex":0.0000021374296,"about_ca_topic_score_gemma":0.00000157678,"teacher_disagreement_score":0.62597704,"about_ca_system_score_codex":0.00002923862,"about_ca_system_score_gemma":0.00009262654,"threshold_uncertainty_score":0.9989461},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97408587,0.00004737271,0.0029013385,0.019979052,0.00015903717,0.000083206796,0.0000026174548,0.0000075859175,0.0027339517],"genre_scores_gemma":[0.995993,0.000010160317,0.0026114034,0.0006550203,0.000061378516,7.778907e-7,5.6441028e-8,0.0000029233308,0.0006652319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934375,0.0000593815,0.00021999868,0.000065550215,0.00022745048,0.00008389324],"domain_scores_gemma":[0.99826896,0.00013017154,0.00017981937,0.0013383742,0.00004918145,0.000033497123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034694176,0.000053536383,0.000094604104,0.00002077731,0.00014855439,0.000060315677,0.0024399844,0.00001685686,0.0002846571],"category_scores_gemma":[0.00007331957,0.000025980627,0.00014733209,0.0001771608,0.00009402216,0.000098355136,0.00023989977,0.00016128249,0.000047498568],"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.00028733074,0.004161117,0.0013855285,0.00007048207,0.0006412735,0.0018039697,0.008577428,0.0068058185,0.041806478,0.3823644,0.3731116,0.17898457],"study_design_scores_gemma":[0.0018828874,0.000737596,0.034299776,0.0002731161,0.0001325879,0.01695202,0.00013144444,0.05493379,0.049120624,0.52644867,0.31453815,0.00054937316],"about_ca_topic_score_codex":0.000010071748,"about_ca_topic_score_gemma":0.000003290299,"teacher_disagreement_score":0.17843519,"about_ca_system_score_codex":0.00001645384,"about_ca_system_score_gemma":0.00004080795,"threshold_uncertainty_score":0.45341384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018840944,0.000071671144,0.9764058,0.00015087276,0.000016571503,0.00013076008,0.0000019818108,0.00016948929,0.021168778],"genre_scores_gemma":[0.911227,4.3350778e-7,0.0863425,0.00010400781,0.000015478106,0.00004013795,0.000003452528,0.000004632773,0.0022624014],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995312,0.0000031666525,0.00008150577,0.00017689147,0.00007116693,0.0001360495],"domain_scores_gemma":[0.99969983,0.000025704458,0.0000205414,0.00017379315,0.000036074183,0.000044038254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044330623,0.00005275443,0.000047358706,0.000021315565,0.00011224874,0.00029858056,0.00025058351,0.000017874205,0.00001848158],"category_scores_gemma":[0.000006162682,0.00004571234,0.000035599925,0.0001398796,0.000012837033,0.0002611721,0.000027523534,0.000019047378,0.000059592305],"study_design_candidate":"design_other","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":[5.558714e-7,0.000101666,0.00006444108,0.0000140716775,0.000004949753,0.0000025248708,0.00012521526,0.00004095837,0.003036284,0.416196,0.0014762889,0.57893705],"study_design_scores_gemma":[0.00044188777,0.00007317164,0.00006900705,0.000008545462,0.000006733232,0.00012650974,0.000044728138,0.40920845,0.051465604,0.050212856,0.4879531,0.0003894244],"about_ca_topic_score_codex":4.536356e-7,"about_ca_topic_score_gemma":4.913819e-7,"teacher_disagreement_score":0.9093429,"about_ca_system_score_codex":0.000007958365,"about_ca_system_score_gemma":0.00005131764,"threshold_uncertainty_score":0.28792194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024800075,0.000065139175,0.99003583,0.0013143457,0.000058699163,0.000075296484,7.073413e-7,0.00006215222,0.005907828],"genre_scores_gemma":[0.97139865,0.0000021629196,0.027414214,0.00038641784,0.0000065427685,0.000006003074,7.207779e-7,0.0000025118518,0.0007827839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999585,0.000017039218,0.00009614698,0.00010981135,0.00012336065,0.000068689194],"domain_scores_gemma":[0.99938846,0.000040213425,0.000040221432,0.00047928828,0.00003412851,0.000017719158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048140446,0.000038116403,0.000042348343,0.00005135221,0.000055827557,0.00002983679,0.0004698061,0.000017448603,0.0002132236],"category_scores_gemma":[0.000013864461,0.000025032034,0.00003566394,0.0009149067,0.000015832717,0.00009295665,0.00007071287,0.000024261979,0.000064488995],"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.000001414499,0.0014665633,0.01885788,0.000119517594,0.000059361926,0.0000030020035,0.0011225912,0.020534728,0.03712989,0.37223828,0.066600285,0.48186648],"study_design_scores_gemma":[0.00007720615,0.0000034356904,0.0025677332,0.0000025506101,0.000002722129,0.0000010528142,0.000001114118,0.9799038,0.014227948,0.00018387672,0.0029915117,0.000037017035],"about_ca_topic_score_codex":0.000010421719,"about_ca_topic_score_gemma":0.0000031093593,"teacher_disagreement_score":0.9689186,"about_ca_system_score_codex":0.00001177876,"about_ca_system_score_gemma":0.000009461298,"threshold_uncertainty_score":0.23346488},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003414968,0.000016767968,0.957211,0.00022733913,0.00003378858,0.00019211748,7.230055e-7,0.00019857992,0.038704675],"genre_scores_gemma":[0.5530681,6.13946e-7,0.44636226,0.00027041897,0.0000070454175,0.000043051743,0.0000087215485,0.0000019276777,0.00023788045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999454,0.000028860535,0.000099714896,0.00018125359,0.00011698323,0.00011916525],"domain_scores_gemma":[0.9994047,0.000007229209,0.000015308564,0.0004438711,0.000029658879,0.00009917873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101601225,0.000051581042,0.000040736537,0.000048221576,0.00011005681,0.00006176295,0.00029939951,0.000019173754,0.000016629385],"category_scores_gemma":[0.0000051934785,0.00004644024,0.000020257401,0.00025333866,0.000005724747,0.00048491656,0.000032831547,0.000026875206,0.0002482996],"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":[3.2994444e-7,0.00027064324,0.000041636453,0.0000042177726,0.0000018273051,2.5449347e-7,0.00053542975,0.0015330558,0.0050753616,0.97863406,0.0057173665,0.008185829],"study_design_scores_gemma":[0.00012194389,0.000028261105,0.0025594118,0.0000012210893,0.0000014948553,0.000026379545,0.00008717666,0.91483694,0.008125951,0.0022820123,0.071785785,0.00014343583],"about_ca_topic_score_codex":0.000009954616,"about_ca_topic_score_gemma":8.6173065e-7,"teacher_disagreement_score":0.97635204,"about_ca_system_score_codex":0.000028567561,"about_ca_system_score_gemma":0.000019435134,"threshold_uncertainty_score":0.31914717},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023949405,0.00009326708,0.95125973,0.00046065904,0.00005198727,0.000042303618,2.1142976e-7,0.00021653992,0.023925917],"genre_scores_gemma":[0.8164892,0.0000049003097,0.18084462,0.00029461854,0.00003281198,0.0000028756272,3.6384753e-7,0.0000037274065,0.0023268636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995654,0.0000066120842,0.00007451542,0.00015140568,0.00008485023,0.000117196265],"domain_scores_gemma":[0.999565,0.000017018769,0.000018158515,0.00034843304,0.000013133831,0.000038261176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003669506,0.0000440815,0.00004244906,0.000024773552,0.000105463456,0.00009573198,0.00032754592,0.000019172336,0.00022249587],"category_scores_gemma":[0.0000034564714,0.00004018126,0.000025059455,0.00020403544,0.000011131064,0.0001914962,0.00010733188,0.000036084344,0.00039378204],"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":[2.0195752e-7,0.00019954154,0.000648098,0.000013515092,0.000018697467,0.00002184655,0.0013063516,0.00044844105,0.078542024,0.6371269,0.01080967,0.27086467],"study_design_scores_gemma":[0.000043383505,0.0000031121413,0.000190547,0.0000022376119,0.0000014311476,0.000011968373,0.0000057550646,0.96501416,0.0038627032,0.0008452192,0.029949766,0.00006970744],"about_ca_topic_score_codex":0.000023442231,"about_ca_topic_score_gemma":0.0000015918705,"teacher_disagreement_score":0.96456575,"about_ca_system_score_codex":0.000011050128,"about_ca_system_score_gemma":0.000004283746,"threshold_uncertainty_score":0.5061403},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5461081,0.0014123096,0.4502305,0.00082920963,0.00023323968,0.000109519504,0.0000042424713,0.000041958134,0.0010308934],"genre_scores_gemma":[0.9426332,0.00012075794,0.056893367,0.00009273251,0.00020736054,0.0000019469662,0.0000013431159,0.000011759907,0.000037499645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880093,0.000041352316,0.00052798854,0.00011791653,0.0002786516,0.0002331703],"domain_scores_gemma":[0.99843794,0.00026141692,0.00048815354,0.0004655657,0.00012701824,0.00021990454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064390246,0.00016046606,0.0002776908,0.00012831371,0.0001249089,0.00014859054,0.00066918635,0.00006370362,0.000014959284],"category_scores_gemma":[0.00007280591,0.00011285753,0.00010020196,0.0002502949,0.000070379945,0.00054353685,0.00015485816,0.00021414744,0.00002611939],"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.0000033111442,0.00095038046,0.0059157754,0.00011645727,0.00011277159,0.000005821322,0.018005284,0.0000066629464,0.00433781,0.93708634,0.0018031627,0.031656228],"study_design_scores_gemma":[0.003358125,0.0006102033,0.26564902,0.00060711557,0.00036410635,0.0025500052,0.019335283,0.016997606,0.06798774,0.5012767,0.11868073,0.002583397],"about_ca_topic_score_codex":0.0000023968405,"about_ca_topic_score_gemma":0.0000015505567,"teacher_disagreement_score":0.43580967,"about_ca_system_score_codex":0.000037844704,"about_ca_system_score_gemma":0.000046118785,"threshold_uncertainty_score":0.46021965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024302255,0.0000130380895,0.980001,0.0025540728,0.00017538996,0.0026067903,0.00045614137,0.0006041577,0.011159192],"genre_scores_gemma":[0.8896493,0.000004861083,0.09914579,0.0002446563,0.0007904959,0.008527682,0.0003856019,0.000071836315,0.0011798278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971867,0.0000174266,0.00070455397,0.00097235094,0.00057367026,0.0005452941],"domain_scores_gemma":[0.9972189,0.0008962921,0.00044615418,0.00092697237,0.00034291137,0.0001687459],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035634945,0.00034605138,0.00030766564,0.0002828322,0.00080367445,0.00090310717,0.0016281841,0.00015010731,0.000014020678],"category_scores_gemma":[0.00004567808,0.0003407284,0.00028707748,0.0005117138,0.00005639273,0.00042267304,0.00010958738,0.00019960548,0.0004241986],"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.000040680377,0.0004169658,0.000013777389,0.00007149206,0.00008117355,0.0000010625002,0.0001673273,0.007159964,0.0015507219,0.9479181,0.0014110262,0.04116769],"study_design_scores_gemma":[0.005532127,0.0007725285,0.0003511208,0.0038635833,0.00014915536,0.0001285113,0.0010907683,0.39831325,0.023017706,0.374245,0.18974335,0.0027929123],"about_ca_topic_score_codex":0.000011753722,"about_ca_topic_score_gemma":0.000002816303,"teacher_disagreement_score":0.887219,"about_ca_system_score_codex":0.00038531751,"about_ca_system_score_gemma":0.00013107885,"threshold_uncertainty_score":0.99990445},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59505594,0.000007377965,0.403472,0.0003925863,0.000021771875,0.00015535628,0.0000012712444,0.000043605185,0.0008500921],"genre_scores_gemma":[0.9079154,0.00000489855,0.0918057,0.0001546377,0.000015446956,0.000019769795,0.0000018374265,0.0000069603043,0.00007532414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871147,0.00019151907,0.00038188556,0.00024636273,0.00030188527,0.00016685488],"domain_scores_gemma":[0.9985263,0.0005896711,0.00035629168,0.00043238726,0.000052349667,0.000043004307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038743566,0.00010118094,0.00023953644,0.000028359802,0.00020788777,0.000019651705,0.0005054092,0.000025580028,0.000016153903],"category_scores_gemma":[0.00011515598,0.000077908124,0.00020966763,0.00069177576,0.0006831796,0.0001717554,0.0003042973,0.00011870643,0.000012140162],"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.00003031273,0.0007328438,0.015974995,0.00010746459,0.000121566925,0.000005658256,0.030712014,0.0013936326,0.02992691,0.88849914,0.0010233443,0.03147214],"study_design_scores_gemma":[0.0009755229,0.000097533986,0.102282986,0.00008411847,0.00003436174,0.00021816828,0.005881806,0.24003612,0.019258486,0.63066363,0.00005162216,0.00041566518],"about_ca_topic_score_codex":0.000011982459,"about_ca_topic_score_gemma":4.025256e-7,"teacher_disagreement_score":0.3128595,"about_ca_system_score_codex":0.000036596815,"about_ca_system_score_gemma":0.000037790775,"threshold_uncertainty_score":0.31770012},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31889355,0.00057847635,0.6795733,0.00051826035,0.000079113575,0.00004773524,7.368942e-7,0.00001878397,0.00029005657],"genre_scores_gemma":[0.984918,0.00010326709,0.014447747,0.00020377137,0.00020336853,6.193529e-7,0.0000017743738,0.000011003523,0.00011043383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985297,0.000027841352,0.0005772805,0.00013100368,0.00033130037,0.00040290516],"domain_scores_gemma":[0.9989045,0.000084441715,0.00037675284,0.00031898476,0.00022304988,0.00009222246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008325288,0.00010479882,0.00020628337,0.00016528594,0.00004799285,0.00002328806,0.000816392,0.000053629432,0.000033051496],"category_scores_gemma":[0.000031441676,0.000089370624,0.00012469028,0.00042410518,0.000021936265,0.00026580848,0.00007924003,0.00038716942,0.000014420903],"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.00009441924,0.0009674614,0.004642663,0.000063983534,0.0003863865,0.00013979439,0.0013595563,0.00022363078,0.12409379,0.764158,0.0007354666,0.10313484],"study_design_scores_gemma":[0.0053386507,0.0033398615,0.034308042,0.00026913916,0.0002011746,0.002846876,0.00023796437,0.025005221,0.74958706,0.07892952,0.09860589,0.0013305767],"about_ca_topic_score_codex":0.000012542231,"about_ca_topic_score_gemma":0.000021858312,"teacher_disagreement_score":0.68522847,"about_ca_system_score_codex":0.000051853407,"about_ca_system_score_gemma":0.0004653403,"threshold_uncertainty_score":0.36444283},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06958644,0.0010140645,0.92693925,0.00064669107,0.0003129818,0.00045763172,0.000017812417,0.0003961842,0.00062894676],"genre_scores_gemma":[0.99581194,0.000015096376,0.0029194797,0.000072952294,0.00012122137,0.00013698453,0.000021687607,0.000013330687,0.0008872852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987378,0.00010159911,0.00027008893,0.00042022212,0.00019017459,0.00028010245],"domain_scores_gemma":[0.99896574,0.00020263882,0.000071915885,0.0005663023,0.000040179188,0.00015324936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082394667,0.00016096256,0.00022216426,0.000057281977,0.00040490125,0.00016026509,0.0005452831,0.00010467319,0.0000040406403],"category_scores_gemma":[0.000062954474,0.00013376735,0.00008423302,0.00016740366,0.00009064701,0.00018011585,0.00020940427,0.000094567455,0.000026436092],"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.000014606967,0.00009710168,0.0000042254046,0.00003916281,0.000018049499,0.0000040856394,0.00021610725,0.00052114064,0.0072004073,0.9866649,0.00008242737,0.0051377835],"study_design_scores_gemma":[0.0037167836,0.00057015347,0.0003848258,0.00022815965,0.00008561428,0.00021939915,0.00020124308,0.45191357,0.0040484904,0.44821173,0.08938532,0.001034711],"about_ca_topic_score_codex":0.000024085475,"about_ca_topic_score_gemma":0.0000048563984,"teacher_disagreement_score":0.92622554,"about_ca_system_score_codex":0.0000458644,"about_ca_system_score_gemma":0.000047852347,"threshold_uncertainty_score":0.5454874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11642735,0.000023811353,0.82731104,0.00034436156,0.000035626083,0.00035210303,0.0000025001168,0.00023228537,0.055270944],"genre_scores_gemma":[0.6456874,0.000019843601,0.35349408,0.00009531773,0.00002723999,0.00011970942,0.000012510243,0.000019179135,0.00052470167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988275,0.0000055269866,0.0002884737,0.00032218662,0.00023084147,0.00032545408],"domain_scores_gemma":[0.9990579,0.000056836765,0.0000880938,0.0006943176,0.000016428728,0.00008645375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017850213,0.00015862791,0.00019684287,0.00010444725,0.000088034234,0.0001215341,0.00081964035,0.000061360886,0.0000460975],"category_scores_gemma":[0.00000808153,0.00015289841,0.000055009772,0.0005721316,0.00003986013,0.00018991092,0.0002819633,0.0001394869,0.0003153439],"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.000004798718,0.00032251718,0.00015596353,0.00008289998,0.000018883078,0.00003297899,0.0028146207,0.0010408371,0.010994204,0.97693825,0.0011071856,0.006486865],"study_design_scores_gemma":[0.0015002735,0.000045803194,0.0014908954,0.00007653825,0.000028823244,0.000107641376,0.0010147671,0.900949,0.0076625217,0.06549572,0.020627366,0.0010006177],"about_ca_topic_score_codex":0.000010008229,"about_ca_topic_score_gemma":0.000006274109,"teacher_disagreement_score":0.9114425,"about_ca_system_score_codex":0.00004563305,"about_ca_system_score_gemma":0.00002906342,"threshold_uncertainty_score":0.62350166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051141135,0.0023375435,0.92160183,0.0070458828,0.0005514258,0.0021791293,0.0001779808,0.0007901311,0.014174938],"genre_scores_gemma":[0.98960924,0.0012542065,0.0074794805,0.00023155703,0.00026123496,0.00014742004,0.00020801682,0.00004672841,0.0007621051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723554,0.00015716953,0.000634648,0.0010150241,0.00047114625,0.00048649998],"domain_scores_gemma":[0.99778616,0.00042059243,0.00022569709,0.001072213,0.0001614347,0.00033390618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013230836,0.0004574261,0.00070870394,0.00004767549,0.00044967854,0.00016784098,0.00068084494,0.000100880294,0.000042777807],"category_scores_gemma":[0.00009906433,0.00035855133,0.0001439306,0.00037723887,0.0005321495,0.00039760114,0.0007391405,0.0005490209,0.00032129925],"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.000018159815,0.0017718137,0.000078904355,0.0013597928,0.00014393489,0.00015378547,0.0013462481,0.000026543628,0.0026896691,0.8987043,0.006087244,0.08761963],"study_design_scores_gemma":[0.00060327194,0.0005008849,0.0015656159,0.0007034195,0.00029209474,0.00009366533,0.000031629563,0.7966174,0.00040209162,0.19686913,0.0016493683,0.0006714295],"about_ca_topic_score_codex":0.000003645303,"about_ca_topic_score_gemma":0.0000020164955,"teacher_disagreement_score":0.9384681,"about_ca_system_score_codex":0.00008650927,"about_ca_system_score_gemma":0.00004230057,"threshold_uncertainty_score":0.99988663},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6276635,0.00016770021,0.3689071,0.00022799862,0.000035059064,0.000099647725,0.0000035239914,0.00017582497,0.0027196328],"genre_scores_gemma":[0.97892493,0.000016934704,0.020712342,0.00006325587,0.00002199001,0.000006227244,0.0000011767117,0.000005598897,0.00024751772],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993285,0.000009995105,0.00016069564,0.00018694918,0.00017989874,0.00013395835],"domain_scores_gemma":[0.99947006,0.0000209153,0.00008054736,0.0003027095,0.00008194097,0.000043837703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000618476,0.00007478424,0.00009796798,0.00006094831,0.00008055561,0.00007129841,0.00039044497,0.000027958746,0.00008432578],"category_scores_gemma":[0.000015403479,0.000066041874,0.00003308005,0.0003077125,0.000017367716,0.0003767536,0.00009055686,0.000046404282,0.000026486785],"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.000002319405,0.0010420625,0.047270376,0.00020157754,0.000044683533,0.000022346905,0.0038821371,0.00006887821,0.8295296,0.037618693,0.0003557506,0.07996157],"study_design_scores_gemma":[0.00045809365,0.00008525283,0.037835844,0.00009748948,0.00003553837,0.00013846558,0.0001248547,0.34492302,0.60406977,0.0007246985,0.010824412,0.00068257406],"about_ca_topic_score_codex":0.000048989,"about_ca_topic_score_gemma":0.0000036286317,"teacher_disagreement_score":0.35126144,"about_ca_system_score_codex":0.000009937123,"about_ca_system_score_gemma":0.000023542141,"threshold_uncertainty_score":0.26931095},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15282053,0.0011431599,0.8057545,0.012450581,0.00009598602,0.00018734341,0.0000019871159,0.00020781385,0.027338136],"genre_scores_gemma":[0.98464257,0.000032857373,0.014741348,0.00003696092,0.00000810246,0.000002121331,1.5054725e-7,8.7086283e-7,0.00053504447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997729,0.0000073001647,0.000056251145,0.000065085966,0.00004738652,0.000051040155],"domain_scores_gemma":[0.99972266,0.000036233338,0.00001712006,0.00020002626,0.000008340237,0.000015601836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000037652568,0.000023902287,0.000029682278,0.000006996248,0.00009922323,0.00003976665,0.00021267569,0.000005208843,0.000021028418],"category_scores_gemma":[0.0000031483144,0.000014168705,0.000011073713,0.00005551081,0.00006161917,0.000047173104,0.00006875358,0.000017836679,0.0000099788385],"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":[8.557575e-8,0.000011087392,0.00032193126,0.0000018013683,0.0000019775339,1.4074985e-7,0.000088520865,0.0000010457071,0.0029370957,0.9649231,0.00060952216,0.031103699],"study_design_scores_gemma":[0.0001180042,0.000011025733,0.018060926,0.0000022370243,0.0000019622205,0.000011192264,0.000010113504,0.9029563,0.010084307,0.04771005,0.02096976,0.00006413016],"about_ca_topic_score_codex":0.000021705431,"about_ca_topic_score_gemma":0.000008776937,"teacher_disagreement_score":0.917213,"about_ca_system_score_codex":0.0000014396401,"about_ca_system_score_gemma":9.2127516e-7,"threshold_uncertainty_score":0.076315485},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15451917,0.0000021057579,0.83983326,0.000032595533,0.0010800353,0.00021775856,0.000056267327,0.00012802203,0.004130776],"genre_scores_gemma":[0.9944452,0.0000032728128,0.0051879054,0.00020770133,0.000015238388,0.00002821475,0.000005869923,0.000006885136,0.00009968794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99893695,0.000041502917,0.00041814006,0.00014005289,0.00027093603,0.00019244316],"domain_scores_gemma":[0.9988232,0.00017699355,0.00020562245,0.0005620649,0.00015316729,0.000078936646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035405686,0.00014782604,0.00014188311,0.0005536646,0.0002775824,0.00011790134,0.0004235181,0.0001061003,0.00016879568],"category_scores_gemma":[0.000014955595,0.00014105711,0.00011562767,0.0006018213,0.00029175502,0.0012645376,0.000003292894,0.00030088608,0.00010518272],"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.000087796936,0.0005777592,0.000004688437,0.00008150105,0.0000989005,8.1848765e-7,0.004970982,0.0047502755,0.044050064,0.69922876,0.00009022531,0.24605823],"study_design_scores_gemma":[0.0022590396,0.00050431746,0.00021786275,0.000098386154,0.000080270765,0.00007618968,0.0012970046,0.35926783,0.61446357,0.017522838,0.0033506167,0.0008620922],"about_ca_topic_score_codex":0.000017657194,"about_ca_topic_score_gemma":0.0000029852022,"teacher_disagreement_score":0.83992606,"about_ca_system_score_codex":0.000044432654,"about_ca_system_score_gemma":0.00010047223,"threshold_uncertainty_score":0.5752142},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002734941,0.000047099707,0.97573537,0.0004182629,0.00000935135,0.00013781774,2.9328933e-7,0.0003367084,0.020580154],"genre_scores_gemma":[0.6871357,0.0000013476331,0.31181303,0.00020409346,0.0000137882,0.000023665289,0.0000017730472,0.0000053082795,0.0008013047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992327,0.000013540904,0.00013416928,0.00024104181,0.00017649405,0.00020205563],"domain_scores_gemma":[0.9995148,0.000012832899,0.000056319477,0.00031703428,0.000036637037,0.00006238035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000064887485,0.00008575889,0.00008241481,0.00004572674,0.00021264408,0.00020048385,0.00044462684,0.000015618321,0.00011163223],"category_scores_gemma":[0.0000019401866,0.000066784305,0.000016426244,0.00034912702,0.000022405682,0.0002858311,0.0000638516,0.000046560555,0.00018360642],"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.0000034849845,0.0007847757,0.0041819876,0.00020526923,0.0000783984,0.00006145456,0.005304845,0.0007559306,0.17134835,0.18453425,0.020978311,0.61176294],"study_design_scores_gemma":[0.0002702036,0.000035298406,0.00068644487,0.000027616046,0.0000063175207,0.000050117374,0.00005848599,0.9822548,0.006569865,0.00020800097,0.009629821,0.0002030145],"about_ca_topic_score_codex":0.000007642871,"about_ca_topic_score_gemma":0.0000039909246,"teacher_disagreement_score":0.9814989,"about_ca_system_score_codex":0.000018644734,"about_ca_system_score_gemma":0.0000121440635,"threshold_uncertainty_score":0.27233848},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32963005,0.00007636706,0.66862,0.0002518126,0.00016088631,0.00027328407,0.000002525037,0.00010080458,0.00088429824],"genre_scores_gemma":[0.68672866,0.000010500296,0.3122905,0.000035124453,0.00032291052,0.00021573117,0.00001738383,0.000013156662,0.00036607432],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9890318,0.0068477816,0.0005880076,0.00047603104,0.002187701,0.00086866296],"domain_scores_gemma":[0.9906176,0.007465809,0.00016933851,0.0008081611,0.00025287343,0.0006862547],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.020478668,0.00014678694,0.00041834902,0.00036711822,0.0003873995,0.00007921389,0.0025592023,0.00024198284,0.0003571717],"category_scores_gemma":[0.010617808,0.0001310103,0.00013573714,0.0009899256,0.00058535766,0.00041630943,0.0018976653,0.0010679527,0.00010487317],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004660103,0.0041371,0.5129366,0.0003910287,0.00017854017,0.000026800604,0.0058854087,0.000011503789,0.014808866,0.4012222,0.007916508,0.052438844],"study_design_scores_gemma":[0.0023759292,0.0002843518,0.89878815,0.00018052562,0.00007611969,0.00011934436,0.0029512509,0.070216075,0.011549032,0.008694746,0.004075529,0.00068892486],"about_ca_topic_score_codex":0.00065848755,"about_ca_topic_score_gemma":0.000051707902,"teacher_disagreement_score":0.39252746,"about_ca_system_score_codex":0.000103414306,"about_ca_system_score_gemma":0.000510877,"threshold_uncertainty_score":0.9977162},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005805973,0.00006111308,0.9374451,0.0014100765,0.000035853725,0.00003443301,1.7584158e-7,0.0002603786,0.054946873],"genre_scores_gemma":[0.95190597,0.000005375326,0.044969887,0.00042879654,0.00002452844,0.000006614624,9.551289e-7,0.0000017445739,0.0026561567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996951,0.000004804832,0.000050452265,0.00011049707,0.00006458805,0.00007455654],"domain_scores_gemma":[0.99968255,0.000012501905,0.000011071615,0.0002579414,0.000009947384,0.000026000846],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000026198099,0.000029144556,0.000025985697,0.000017858267,0.000064263164,0.00006434393,0.00022500918,0.000014590735,0.0004076765],"category_scores_gemma":[0.0000013640381,0.000026275833,0.000017463322,0.00014020728,0.000006237075,0.00017337124,0.000054697288,0.00002176919,0.0012262618],"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":[6.347125e-8,0.00007241631,0.00012365506,0.0000029814867,0.0000035630069,0.000004081966,0.00034944073,0.000016785756,0.009446222,0.7847922,0.016510746,0.18867785],"study_design_scores_gemma":[0.00009845878,0.000011643835,0.0018768167,0.000002801633,0.0000015860303,0.000015220997,0.000009424878,0.9013634,0.00849941,0.0056466237,0.08235804,0.00011661159],"about_ca_topic_score_codex":0.0000044651824,"about_ca_topic_score_gemma":5.210856e-7,"teacher_disagreement_score":0.9461,"about_ca_system_score_codex":0.000006240525,"about_ca_system_score_gemma":0.0000014096803,"threshold_uncertainty_score":0.9995514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90621746,0.0000013715945,0.08347561,0.0061544767,0.00025417394,0.00013274094,0.0000015534804,0.00008964276,0.003672964],"genre_scores_gemma":[0.991347,0.0000010894357,0.007977864,0.00040989835,0.000027633285,0.000010514838,7.5771186e-7,0.0000033205322,0.00022191652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935526,0.000028724859,0.0001125871,0.00019830692,0.00019003356,0.00011508775],"domain_scores_gemma":[0.9988455,0.00021953639,0.0000438802,0.0008118696,0.000037112033,0.000042102278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002476601,0.00007035109,0.00008464986,0.000035997276,0.000113982234,0.00003752911,0.00060732284,0.000036900183,0.00014666436],"category_scores_gemma":[0.000050715786,0.000044163902,0.000043381697,0.00018619123,0.000062814564,0.00004920435,0.00009023667,0.0001822351,0.00012907626],"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.0000011929977,0.000057266574,0.000041993928,0.000002350321,0.0000017143457,8.1031055e-7,0.0000821224,0.0000031785542,0.07411941,0.9193014,0.0016239356,0.004764658],"study_design_scores_gemma":[0.0003424216,0.0002645044,0.03368578,0.000020210828,0.000013178032,0.00001748924,0.000019386483,0.037999816,0.6895623,0.23309605,0.004689967,0.0002889049],"about_ca_topic_score_codex":0.00045034772,"about_ca_topic_score_gemma":0.00015161402,"teacher_disagreement_score":0.6862053,"about_ca_system_score_codex":0.0000056803415,"about_ca_system_score_gemma":0.000015374768,"threshold_uncertainty_score":0.18009518},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06337969,0.000021589649,0.9189336,0.0006323446,0.00005949704,0.000049541475,4.2634466e-7,0.0002451285,0.016678208],"genre_scores_gemma":[0.7938535,0.0000022962631,0.20441693,0.00028519216,0.000023077102,0.0000030443705,0.0000074564487,0.0000020308603,0.0014064502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999551,0.0000055991804,0.00008875003,0.00014791172,0.00010486568,0.00010188868],"domain_scores_gemma":[0.9996039,0.00004826572,0.000018166798,0.0002592773,0.000027222119,0.00004313224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019030388,0.000037593745,0.000033589287,0.000039294773,0.000077554745,0.000018464401,0.0001548168,0.000019637686,0.000064712374],"category_scores_gemma":[0.000004981413,0.000032584278,0.00002211991,0.0001560637,0.000015262793,0.00013172899,0.000079829246,0.00003036529,0.00030981645],"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":[9.815508e-7,0.00006936045,0.00016794921,0.0000015821365,0.0000023003827,0.000011840678,0.0000494672,0.00001538311,0.10372624,0.8765655,0.002805519,0.016583892],"study_design_scores_gemma":[0.0006293215,0.00009615726,0.13669343,0.000019922634,0.0000066156194,0.00012587814,0.000074789226,0.28745285,0.32943064,0.014078675,0.23087524,0.00051648176],"about_ca_topic_score_codex":0.000015414469,"about_ca_topic_score_gemma":0.000008021277,"teacher_disagreement_score":0.86248684,"about_ca_system_score_codex":0.000010373489,"about_ca_system_score_gemma":0.000011813689,"threshold_uncertainty_score":0.3982167},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15269145,0.0001586569,0.84663993,0.00024537605,0.00009749115,0.0000782437,0.000019828203,0.00001758698,0.000051430798],"genre_scores_gemma":[0.76164275,0.000017324082,0.23824063,0.000055268785,0.000026061743,0.0000045170023,0.0000023219663,0.000007870998,0.000003229129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987502,0.00009170592,0.00043288223,0.0001819102,0.0003471827,0.00019610322],"domain_scores_gemma":[0.9989406,0.00032043474,0.00016378166,0.0002499422,0.00011471171,0.00021052384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058588455,0.00013413196,0.00025690332,0.000044342283,0.00010603876,0.000086984546,0.00034872207,0.00004743444,0.000050847113],"category_scores_gemma":[0.000074062234,0.00010340909,0.00005064063,0.000105660125,0.00010213667,0.00022985523,0.00015151012,0.0001650323,0.0000059122235],"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.000060144386,0.0005032008,0.000019602352,0.00002252413,0.000026785741,0.00010956134,0.0005800502,0.000009742063,0.025263852,0.9717319,0.0000088044235,0.0016638124],"study_design_scores_gemma":[0.0019936354,0.0016119027,0.00015935887,0.00023400832,0.00011916198,0.00092735974,0.0012854557,0.009757064,0.31802607,0.66538334,0.00015028512,0.00035239922],"about_ca_topic_score_codex":0.000007142901,"about_ca_topic_score_gemma":6.1099263e-7,"teacher_disagreement_score":0.60895133,"about_ca_system_score_codex":0.000046880526,"about_ca_system_score_gemma":0.000094782394,"threshold_uncertainty_score":0.42169002},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2592085,0.0015482848,0.5448023,0.021383358,0.00033824207,0.00047792456,0.00002251994,0.0023364779,0.16988239],"genre_scores_gemma":[0.97561455,0.00001926128,0.023631759,0.0004461097,0.000032901804,0.000008811556,0.0000024891308,0.0000036260383,0.00024047577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994289,0.00001858681,0.000097241784,0.00022176077,0.00009882059,0.00013463535],"domain_scores_gemma":[0.99931794,0.000028728882,0.000028165177,0.00049286877,0.000016389256,0.00011591141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006315481,0.000065991,0.00008126956,0.000027995384,0.00015091832,0.00010962528,0.000441391,0.000021489597,0.00006790095],"category_scores_gemma":[0.000016306722,0.00006384816,0.000021989717,0.00016481381,0.00008164703,0.00016531086,0.00027927224,0.0000546866,0.00034348163],"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":[2.8677803e-7,0.00009216138,0.0003570051,0.0000105991885,0.0000064401333,0.0000036082404,0.000381129,0.0000015041602,0.00054580375,0.9412946,0.021472767,0.03583408],"study_design_scores_gemma":[0.0005398919,0.000039070987,0.087596476,0.000008931818,0.0000053569265,0.000054077813,0.000019238505,0.62792665,0.00047143616,0.15943544,0.12353997,0.00036345635],"about_ca_topic_score_codex":0.0000138045525,"about_ca_topic_score_gemma":0.000003954424,"teacher_disagreement_score":0.78185916,"about_ca_system_score_codex":0.000007197003,"about_ca_system_score_gemma":0.000006355067,"threshold_uncertainty_score":0.4414876},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13146506,0.000034753444,0.8556878,0.00029312135,0.00012983652,0.00011613756,6.950079e-7,0.00025922342,0.012013356],"genre_scores_gemma":[0.79542875,0.0000024135886,0.20415065,0.00036486995,0.00003823677,0.0000041583953,2.8973244e-7,0.0000054730244,0.0000051787924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829334,0.000035772842,0.00021674791,0.0006603687,0.00034512888,0.00044864826],"domain_scores_gemma":[0.99877876,0.00014007466,0.00005340729,0.0006808781,0.0000718827,0.00027502613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059299235,0.0001535627,0.00014709472,0.0001295592,0.00044613436,0.00028902688,0.0015632537,0.000040646504,0.000037246853],"category_scores_gemma":[0.00003396926,0.00012800124,0.000041828393,0.0007145128,0.0018475499,0.00063693384,0.00094847195,0.00014678533,0.000048902126],"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.000001411441,0.000034325076,0.00024112914,0.0000033256483,0.000002022386,0.0000049049067,0.0012561956,0.000003949831,0.0010633924,0.9618924,0.000003416851,0.035493515],"study_design_scores_gemma":[0.00012701857,0.00008040653,0.0031775315,0.000013042419,0.00000426993,0.000038917522,0.000014225025,0.7583762,0.009215462,0.22871923,0.00003819847,0.00019549143],"about_ca_topic_score_codex":0.0000067824426,"about_ca_topic_score_gemma":2.4242897e-7,"teacher_disagreement_score":0.75837225,"about_ca_system_score_codex":0.000016758848,"about_ca_system_score_gemma":0.00006664458,"threshold_uncertainty_score":0.6807375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45472372,0.00018709563,0.54329586,0.0014922637,0.00009454089,0.0001544286,0.0000029482762,0.000018895733,0.000030227975],"genre_scores_gemma":[0.9612241,0.000038412396,0.038432952,0.000104815364,0.00016484193,0.000009496149,0.00000962514,0.000009377833,0.000006420926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786717,0.00003295696,0.0009655429,0.00015921668,0.00079924235,0.00017586445],"domain_scores_gemma":[0.9973784,0.0002455969,0.00095141947,0.00044340666,0.0009376607,0.00004351707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014542106,0.00012525481,0.0001926953,0.00015918264,0.00024369193,0.00005289019,0.0021486357,0.00003776666,0.00001131321],"category_scores_gemma":[0.000011917823,0.00008324784,0.00012014542,0.00037652956,0.00011146956,0.00030290431,0.00029932486,0.00019742125,0.0000054907628],"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.000066683,0.0004510668,0.0041890726,0.000072426745,0.00051369774,0.0000057601765,0.0022424953,0.16609053,0.07310528,0.61632746,0.00059570203,0.13633981],"study_design_scores_gemma":[0.0006871095,0.00009314104,0.0122329015,0.000100906946,0.000058766913,0.00017134708,0.00019822846,0.8898828,0.07696044,0.018634433,0.0008084941,0.00017141641],"about_ca_topic_score_codex":0.000178738,"about_ca_topic_score_gemma":0.00002150673,"teacher_disagreement_score":0.72379225,"about_ca_system_score_codex":0.000055632103,"about_ca_system_score_gemma":0.000129867,"threshold_uncertainty_score":0.39927354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004834473,0.00015544698,0.9849836,0.0043853815,0.00006768702,0.0002977552,0.000017060736,0.0003892288,0.0048693144],"genre_scores_gemma":[0.9366088,0.00081480556,0.061222877,0.00031693382,0.000012067704,0.00018801742,0.000023533474,0.000015216364,0.00079778145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987903,0.00012738316,0.00039067733,0.00029582062,0.000177434,0.0002183787],"domain_scores_gemma":[0.9969995,0.00021424232,0.000055615325,0.0025812346,0.00007312912,0.00007624681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020799635,0.00014095522,0.00014752433,0.0002402792,0.0004966014,0.00014487472,0.0017231171,0.000090523776,0.00022573929],"category_scores_gemma":[0.0000054009965,0.00015809684,0.000075162636,0.0012754258,0.000095421834,0.0004313931,0.000008857441,0.00034849817,0.00044159548],"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.000010613985,0.0026324568,0.00006659234,0.000022447794,0.00005948139,0.0000037459608,0.0020295728,0.20546912,0.004713276,0.045826916,0.0006140832,0.7385517],"study_design_scores_gemma":[0.00043682934,0.00003862685,0.00028617296,0.0000578953,0.000014651788,0.000015739477,0.000025061609,0.97961473,0.0042830966,0.0035818422,0.011388066,0.00025727527],"about_ca_topic_score_codex":0.00017012202,"about_ca_topic_score_gemma":0.00034739194,"teacher_disagreement_score":0.9317743,"about_ca_system_score_codex":0.0001012991,"about_ca_system_score_gemma":0.00008353285,"threshold_uncertainty_score":0.6447002},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054232564,0.00008339263,0.9435792,0.00092787587,0.0003557014,0.0004654734,0.000016354035,0.00022160205,0.00011785306],"genre_scores_gemma":[0.8563544,0.000044811357,0.14293274,0.00010285768,0.000094899115,0.00011120441,0.0000015849098,0.00001536938,0.000342118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988941,0.000032874643,0.0002542937,0.0004039024,0.00014008478,0.00027477747],"domain_scores_gemma":[0.9992683,0.00015605331,0.00006058514,0.00032724312,0.00006902078,0.00011881052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014350082,0.00016591804,0.00014398764,0.00014643176,0.00043543885,0.0001786628,0.00026078316,0.00008349497,0.00005869683],"category_scores_gemma":[0.0000039975957,0.00018470996,0.00008491108,0.0002583124,0.00006949223,0.00023619553,0.0000039650563,0.00017075775,0.000030991047],"study_design_candidate":"design_other","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.000012988356,0.000120437886,9.2275826e-7,0.000018253451,0.0000075404755,5.402183e-7,0.0002635953,0.0036174927,0.089362934,0.00039359316,0.0000459507,0.90615577],"study_design_scores_gemma":[0.0004980613,0.0002796784,0.00007863236,0.000013621904,0.000027548827,0.000026213906,0.000020596064,0.7840436,0.21169348,0.0009455348,0.0021579517,0.00021504656],"about_ca_topic_score_codex":0.00001966319,"about_ca_topic_score_gemma":0.00007423872,"teacher_disagreement_score":0.9059407,"about_ca_system_score_codex":0.00005174854,"about_ca_system_score_gemma":0.000021459526,"threshold_uncertainty_score":0.7532254},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7975328,0.000712792,0.19885886,0.0007578316,0.000439308,0.0004142356,0.000015866424,0.00040851848,0.00085981423],"genre_scores_gemma":[0.98637146,0.00009432124,0.012842173,0.0001624364,0.00016499724,0.000055851404,0.000058700083,0.000026762618,0.00022327754],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9976006,0.00008377572,0.00045334606,0.001053873,0.00037712496,0.00043125468],"domain_scores_gemma":[0.9975975,0.000074176285,0.00018236041,0.0018876242,0.00007857538,0.00017976624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077824545,0.00033563285,0.0003811393,0.00021651691,0.00012952602,0.00013940109,0.0014589377,0.00038054667,0.000013200563],"category_scores_gemma":[0.00004816746,0.00034850521,0.000106940686,0.000400166,0.00008996923,0.00022277048,0.0020995669,0.0008022024,0.00019773473],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042551474,0.0028784655,0.80430514,0.0015877764,0.00034810216,0.0011267535,0.006170936,0.0035419762,0.045148704,0.040639825,0.00620039,0.08800937],"study_design_scores_gemma":[0.00096376514,0.000042253076,0.63656723,0.00029061886,0.0000434342,0.000018829136,0.000022336859,0.31783107,0.017322749,0.008246756,0.017372802,0.0012781717],"about_ca_topic_score_codex":0.00028322884,"about_ca_topic_score_gemma":0.000093602,"teacher_disagreement_score":0.3142891,"about_ca_system_score_codex":0.00008361619,"about_ca_system_score_gemma":0.0001535907,"threshold_uncertainty_score":0.9998967},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013241841,0.000031256866,0.9361393,0.0011012157,0.0000138565165,0.0004444387,0.0000048103834,0.00020851773,0.048814785],"genre_scores_gemma":[0.83405656,0.000016587472,0.16515265,0.00029592222,0.000018022109,0.00018150965,0.000019270901,0.000017904536,0.00024159548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918026,0.000007726646,0.00019998565,0.00020306194,0.00024543868,0.00016352038],"domain_scores_gemma":[0.999082,0.00020751166,0.000079006364,0.0005783577,0.000013546152,0.00003957303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014420862,0.00011516664,0.000104819956,0.000023750035,0.0002852005,0.0000597487,0.00055270724,0.0000374618,0.000018245582],"category_scores_gemma":[0.0000051173843,0.00007702319,0.000046611345,0.00022052122,0.00004930207,0.000071064154,0.000047090238,0.00010330262,0.00019530098],"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":[6.415901e-7,0.000060192713,4.454723e-7,0.000014682934,0.0000071037366,5.7244364e-7,0.0020067894,0.00004564832,0.014080534,0.9779317,0.0032322595,0.0026194712],"study_design_scores_gemma":[0.0005577916,0.000047867758,0.00002132063,0.000045988887,0.000026324431,0.000036136902,0.00029069936,0.37669915,0.07058777,0.533222,0.017866723,0.0005982124],"about_ca_topic_score_codex":0.0000011524332,"about_ca_topic_score_gemma":3.5392284e-7,"teacher_disagreement_score":0.82081467,"about_ca_system_score_codex":0.000011418621,"about_ca_system_score_gemma":0.000017230523,"threshold_uncertainty_score":0.31409147},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7202002,0.000028789636,0.2169161,0.0032036384,0.00039691455,0.0017870978,0.00023707053,0.00019414809,0.057036094],"genre_scores_gemma":[0.9818419,0.0000033579875,0.015825447,0.0020316278,0.000022440589,0.0000981239,0.0000683549,0.000008774893,0.00009997801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982579,0.000045674133,0.00070607325,0.00019304862,0.00041646295,0.0003808616],"domain_scores_gemma":[0.9983093,0.00056093157,0.00014144214,0.00082515227,0.000066673914,0.00009651032],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008924809,0.00015884617,0.00018444587,0.00017038906,0.00013248129,0.000106561914,0.0009348397,0.00006461412,0.0012103472],"category_scores_gemma":[0.00009095949,0.00012310117,0.000056154404,0.00056353136,0.00014478451,0.0006311471,0.00034788574,0.00023699416,0.00022728139],"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.000042758038,0.0022047067,0.002945823,0.00020965423,0.00009286893,0.000106530024,0.01056607,0.000011995846,0.0126452735,0.88522214,0.027556632,0.058395576],"study_design_scores_gemma":[0.006343775,0.0016369206,0.25686517,0.000830892,0.00016973077,0.0001705768,0.01142078,0.12296463,0.3711293,0.013583259,0.21235949,0.0025254725],"about_ca_topic_score_codex":0.000027056156,"about_ca_topic_score_gemma":0.000050802657,"teacher_disagreement_score":0.87163883,"about_ca_system_score_codex":0.000084477186,"about_ca_system_score_gemma":0.0000729099,"threshold_uncertainty_score":0.9997027},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057768777,0.00002566675,0.9353357,0.0004724661,0.00009063136,0.00033233038,0.000002700003,0.00018269889,0.0057890043],"genre_scores_gemma":[0.70347595,0.000005048634,0.29632354,0.00014755364,0.000012814106,0.000021621481,0.0000013305711,0.000007917809,0.0000042069037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978114,0.000095637915,0.00042104165,0.0006790505,0.000551601,0.0004412621],"domain_scores_gemma":[0.9983697,0.00022544415,0.00011747231,0.00095767516,0.0001325922,0.00019715031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017737998,0.00021141995,0.00026294694,0.00022181615,0.00027201968,0.00037496255,0.0015896912,0.00006289338,0.000018508892],"category_scores_gemma":[0.00011130479,0.00017547476,0.000047321795,0.0010428772,0.0015696314,0.0006951118,0.0009687317,0.00017135046,0.000034063323],"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.0000019715512,0.00013705388,0.000111493566,0.000018293409,0.0000040700243,0.000012746489,0.0044011604,0.0000025760037,0.0018731263,0.9913947,0.000010806529,0.0020319796],"study_design_scores_gemma":[0.00020338618,0.000051550105,0.0015341315,0.00004082764,0.0000057295924,0.000025169773,0.000054678672,0.60807043,0.0058075306,0.38399813,0.00002096314,0.00018747256],"about_ca_topic_score_codex":0.00003426603,"about_ca_topic_score_gemma":0.00000925099,"teacher_disagreement_score":0.6457072,"about_ca_system_score_codex":0.00003748591,"about_ca_system_score_gemma":0.00010735247,"threshold_uncertainty_score":0.7155653},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7895244,0.00006442373,0.16448383,0.00086700235,0.0004011674,0.00026994455,0.000011501615,0.00025308013,0.044124667],"genre_scores_gemma":[0.98488,0.0000012660131,0.01390146,0.0005817863,0.000017752554,0.000002541377,0.0000046749433,0.0000034177606,0.0006071461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990572,0.000017189723,0.00022302676,0.00025714343,0.00025136094,0.00019408154],"domain_scores_gemma":[0.99927825,0.00007779566,0.00008021851,0.00041460892,0.000080746715,0.00006836382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001168283,0.00010697308,0.0001347768,0.00018679339,0.0001033181,0.00006347323,0.00036764785,0.00004387941,0.000068688685],"category_scores_gemma":[0.000020761665,0.00009173916,0.000070372895,0.00048658144,0.00013502185,0.00017633892,0.000051804745,0.00007605182,0.000036884667],"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.000008667567,0.0005573792,0.00006505235,0.000006846215,0.000020849175,0.0000056034905,0.00028083607,0.00005442805,0.0638328,0.8658846,0.001692882,0.06759006],"study_design_scores_gemma":[0.0039620907,0.0023635782,0.029951304,0.00021135314,0.000051765925,0.00013404406,0.00024134324,0.4102052,0.47587317,0.06899478,0.006307912,0.0017034544],"about_ca_topic_score_codex":0.000020009127,"about_ca_topic_score_gemma":0.0000010352741,"teacher_disagreement_score":0.79688984,"about_ca_system_score_codex":0.000031400934,"about_ca_system_score_gemma":0.00006161221,"threshold_uncertainty_score":0.37410143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071162893,0.000015050394,0.9867502,0.0018780208,0.00003153029,0.00023338034,9.987851e-7,0.00010284516,0.0038716805],"genre_scores_gemma":[0.9583608,0.0000060662487,0.04113641,0.00015215618,0.000012069939,0.000029021025,8.025551e-7,0.0000024160515,0.00030024615],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954194,0.000013892049,0.00015688955,0.00010495399,0.00010507794,0.000077221775],"domain_scores_gemma":[0.99951303,0.000018544932,0.00006195011,0.0003570088,0.00003453764,0.000014928541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012129837,0.000038651877,0.000043882887,0.000030700474,0.00008178786,0.000031624044,0.00042349906,0.000015241035,0.00012405396],"category_scores_gemma":[0.000005388955,0.000027102245,0.00003334217,0.00032730264,0.0000135392975,0.0001101578,0.00013741301,0.000033406694,0.0000125658335],"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":[1.5471278e-7,0.00007820442,0.0007919129,0.000018649675,0.00001119394,5.936248e-7,0.0006504534,0.00009879762,0.5068953,0.3361038,0.00955936,0.14579158],"study_design_scores_gemma":[0.0000975508,0.000008469459,0.00085989333,0.00000703754,0.0000028542129,0.000006611571,0.000035376393,0.06783737,0.92668116,0.0015552219,0.0028536182,0.0000548361],"about_ca_topic_score_codex":0.000053229527,"about_ca_topic_score_gemma":0.00001104349,"teacher_disagreement_score":0.95124453,"about_ca_system_score_codex":0.000010934013,"about_ca_system_score_gemma":0.000007953662,"threshold_uncertainty_score":0.13583039},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015352295,0.00024077162,0.98396766,0.000045429577,0.0001870168,0.000307569,0.0000049410746,0.0002825313,0.013428836],"genre_scores_gemma":[0.9848702,9.587054e-7,0.013296212,0.000011659743,0.000062227795,0.0000069400276,0.000006920134,0.00001067247,0.0017342339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988288,0.000019914381,0.00036105694,0.00025817184,0.00028983015,0.00024216874],"domain_scores_gemma":[0.99882287,0.00013563927,0.0001379196,0.0007030295,0.00005077996,0.00014975228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035975195,0.000113803035,0.0001738209,0.00008942903,0.000041764666,0.0002848356,0.0007800154,0.000059408372,0.000002944364],"category_scores_gemma":[0.000017703516,0.00010615607,0.00006752121,0.0004323128,0.000022079419,0.00050924567,0.0001176103,0.0000488118,0.00018836664],"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.000013482504,0.00027369245,0.00034316364,0.00012741209,0.000078310106,0.00009494967,0.00074929395,0.0006995012,0.07354669,0.74983084,0.02564059,0.14860205],"study_design_scores_gemma":[0.0019249116,0.0004903941,0.0018873123,0.00027138734,0.000034177,0.0003006416,0.00026630057,0.509556,0.15872326,0.009035308,0.3160824,0.0014279456],"about_ca_topic_score_codex":0.00004753945,"about_ca_topic_score_gemma":5.347393e-7,"teacher_disagreement_score":0.98333496,"about_ca_system_score_codex":0.000031298816,"about_ca_system_score_gemma":0.00008710616,"threshold_uncertainty_score":0.4328919},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02641587,0.00008021006,0.9700226,0.0004731046,0.000055076005,0.00042721693,0.0000040556633,0.000106605265,0.0024152528],"genre_scores_gemma":[0.95968324,0.0000061343626,0.039494675,0.00012479871,0.0000200507,0.000111419664,0.0000039632155,0.0000041453013,0.0005515474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993586,0.000016138547,0.0002056612,0.00018827808,0.00011784702,0.00011347957],"domain_scores_gemma":[0.999382,0.00005857695,0.00008052056,0.00035239558,0.000089379646,0.00003711646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119600714,0.00006005993,0.00012339064,0.000051019033,0.000066866734,0.000031876287,0.00029624006,0.000028631786,0.000025854124],"category_scores_gemma":[0.000023123954,0.00004926521,0.00006660791,0.00027083379,0.000019139903,0.00003830643,0.00003746692,0.000017420634,0.00001484907],"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.0000034466398,0.00011302946,0.000016657652,0.000011011258,0.000010200969,3.3346413e-7,0.00026386164,0.011308419,0.031061243,0.94664764,0.0022790842,0.008285094],"study_design_scores_gemma":[0.0007686364,0.000022575614,0.000013613915,0.000002618622,0.000005190532,0.0000011980544,0.0000044429144,0.98058426,0.014124733,0.00058152835,0.0038324182,0.000058796428],"about_ca_topic_score_codex":0.000009588256,"about_ca_topic_score_gemma":0.0000026054834,"teacher_disagreement_score":0.96927583,"about_ca_system_score_codex":0.00001647762,"about_ca_system_score_gemma":0.000014038879,"threshold_uncertainty_score":0.20089771},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013688601,0.00014916633,0.9827571,0.0023095196,0.00008955114,0.0003577454,0.00008901877,0.0004448434,0.00011445096],"genre_scores_gemma":[0.9791379,0.00005869961,0.01948525,0.0010698062,0.000015579872,0.00010763733,0.000008466035,0.000024714134,0.00009195091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984251,0.000101011945,0.00025928768,0.00053988834,0.00023869114,0.0004360194],"domain_scores_gemma":[0.9984174,0.00021920523,0.00006995634,0.0010377271,0.00008035163,0.00017538042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019904853,0.00024151061,0.00020910136,0.00019325585,0.00037431918,0.000159912,0.0006566068,0.00010976788,0.00003246804],"category_scores_gemma":[0.000006090493,0.00023761574,0.00008074038,0.00034842905,0.00007941472,0.00031609536,0.0000018659838,0.00046017877,0.000060578135],"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.00025400502,0.0025161125,0.00004581764,0.00002861596,0.00020329632,0.000011428943,0.0005154053,0.19592911,0.103411935,0.0154538695,0.0008526272,0.6807778],"study_design_scores_gemma":[0.0017334879,0.00021248638,0.000052584885,0.00001538458,0.000043081553,0.000011704567,0.000008811295,0.95056266,0.03382702,0.00009655499,0.013176312,0.0002598896],"about_ca_topic_score_codex":0.000039813534,"about_ca_topic_score_gemma":0.0007867491,"teacher_disagreement_score":0.9654493,"about_ca_system_score_codex":0.00015596676,"about_ca_system_score_gemma":0.00022252052,"threshold_uncertainty_score":0.96896887},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097578995,0.0000018924819,0.9007926,0.00008183598,0.000024116103,0.00007127591,7.4550337e-7,0.0000243361,0.0014241972],"genre_scores_gemma":[0.94622546,1.5695551e-7,0.05360401,0.00007835048,0.0000018756863,0.0000026002979,2.7844666e-7,0.0000017748035,0.00008551361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995663,0.000024132347,0.000116801784,0.00010711988,0.00013009294,0.000055552166],"domain_scores_gemma":[0.99935967,0.00010912256,0.000056798177,0.00042207263,0.00003892564,0.000013443056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006163223,0.00004341929,0.000060765877,0.000024122826,0.00003245445,0.000010069276,0.00029711943,0.000016033375,0.0000048247516],"category_scores_gemma":[0.000009482805,0.000028475113,0.000038490958,0.00014348897,0.000019598781,0.00004011736,0.000037449743,0.000027311493,0.000001976755],"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":[2.9666617e-7,0.000042523556,0.0002800972,0.000004923451,9.229326e-7,1.2371288e-8,0.000055200107,0.8692104,0.005909549,0.12302364,0.0000049957457,0.0014674178],"study_design_scores_gemma":[0.000068087706,0.000009325241,0.0019873097,0.000009754194,0.0000012941024,4.0901515e-8,0.000001104933,0.9508661,0.04487024,0.0021366097,0.000018863948,0.00003125137],"about_ca_topic_score_codex":0.000010460299,"about_ca_topic_score_gemma":0.0000025141667,"teacher_disagreement_score":0.84864646,"about_ca_system_score_codex":0.0000060190528,"about_ca_system_score_gemma":0.000025717878,"threshold_uncertainty_score":0.11611814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057571637,0.00009525391,0.8182609,0.0015707578,0.00007561922,0.000116886535,7.994122e-7,0.00058650266,0.1735361],"genre_scores_gemma":[0.99107206,0.0000024777355,0.0056100134,0.00026513732,0.00002588202,0.000016160271,4.490795e-7,0.000002644359,0.003005156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955565,0.000010936653,0.00007162216,0.00016697675,0.00009960793,0.00009523433],"domain_scores_gemma":[0.99949676,0.000023290395,0.000016806649,0.00040742362,0.000011405254,0.00004433075],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004340578,0.00004799458,0.000048948958,0.000026926595,0.00007191346,0.00007407383,0.00032618397,0.000020911246,0.00007130524],"category_scores_gemma":[0.0000019817135,0.000037761085,0.000025845971,0.00015908795,0.000006324032,0.000082763305,0.000050841467,0.000034594414,0.0017069556],"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":[1.2571662e-7,0.000035799676,0.000016139855,0.000009081061,0.0000033418182,0.000006268163,0.00017478204,0.000024826764,0.00042237088,0.9688099,0.02309753,0.007399853],"study_design_scores_gemma":[0.00016856319,0.000031382297,0.0002579047,0.000018681858,0.0000028611512,0.000040004135,0.000027308655,0.903236,0.003588262,0.00053217803,0.09196282,0.00013406719],"about_ca_topic_score_codex":0.0000043054597,"about_ca_topic_score_gemma":0.0000015237821,"teacher_disagreement_score":0.9853149,"about_ca_system_score_codex":0.000014214913,"about_ca_system_score_gemma":0.0000025009838,"threshold_uncertainty_score":0.99907035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6200817,0.00006961974,0.31801713,0.00924707,0.00010929048,0.00021790338,0.0000018717328,0.00021192651,0.05204347],"genre_scores_gemma":[0.9956109,0.000005820674,0.0031714782,0.0004392589,0.000009677356,0.000007931137,8.500801e-7,0.0000026375676,0.00075145817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952644,0.000017069571,0.00009617542,0.00013185659,0.00013869656,0.00008977609],"domain_scores_gemma":[0.9992558,0.00010606523,0.000029227393,0.00055621174,0.000025788531,0.000026960017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066821434,0.000052081123,0.00006174199,0.00002599215,0.00016530044,0.000026232556,0.00055739435,0.000018128008,0.00019634295],"category_scores_gemma":[0.000026776206,0.000031618936,0.000039041763,0.00027764688,0.00006803054,0.000056311575,0.0000899348,0.000052007526,0.0002833734],"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.0000015715849,0.00007358475,0.00019117113,0.0000019582492,0.0000050398107,0.0000044314966,0.0020327033,0.00004365581,0.00106107,0.9928579,0.002800956,0.00092597236],"study_design_scores_gemma":[0.0016520763,0.0012747603,0.12623225,0.00006695735,0.000030495516,0.00028687468,0.000657048,0.36807087,0.109608606,0.0796896,0.31093487,0.001495582],"about_ca_topic_score_codex":0.000016783219,"about_ca_topic_score_gemma":0.000002278357,"teacher_disagreement_score":0.9131683,"about_ca_system_score_codex":0.0000051658244,"about_ca_system_score_gemma":0.00005409961,"threshold_uncertainty_score":0.36422864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05142015,0.000048587037,0.92034316,0.000054704924,0.000028058972,0.000089321715,0.0000018256924,0.000095179465,0.027919004],"genre_scores_gemma":[0.97776586,0.0000016199509,0.021611383,0.000020006271,0.000022692146,0.0000036163706,9.010782e-7,0.000003420289,0.00057051756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948007,0.000013257839,0.00011920471,0.00014602552,0.00013626425,0.00010520392],"domain_scores_gemma":[0.9994784,0.000022956336,0.000045797737,0.0003811512,0.00003348237,0.00003820751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002999296,0.000055310902,0.00010317984,0.000027878645,0.0000478326,0.000044340737,0.00037372005,0.000015450092,0.000016752365],"category_scores_gemma":[5.8857256e-7,0.000047890015,0.00004031263,0.00019150454,0.00002110715,0.00018349706,0.000094788535,0.000028541603,0.000052369942],"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":[2.4031016e-7,0.00037486298,0.000012167205,0.000045334386,0.000008557297,0.0000018067276,0.00097329525,0.051620938,0.16736774,0.7742002,0.002801301,0.0025935306],"study_design_scores_gemma":[0.00006846273,0.0000067833275,0.000011543059,0.000003137704,0.0000026022044,0.000004109337,0.000016995447,0.9941679,0.0042274403,0.00083760754,0.00059423054,0.000059178816],"about_ca_topic_score_codex":0.00007608197,"about_ca_topic_score_gemma":3.2665645e-7,"teacher_disagreement_score":0.94254696,"about_ca_system_score_codex":0.000009909818,"about_ca_system_score_gemma":0.0000056737404,"threshold_uncertainty_score":0.1952898},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11082976,0.00038605448,0.8824022,0.002476517,0.0000905894,0.00023551406,0.000012465203,0.0003673421,0.003199585],"genre_scores_gemma":[0.9510471,0.000016414442,0.04688238,0.00009600658,0.000017089882,0.0000130445715,0.000013509086,0.000004951493,0.0019094835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998906,0.000042097032,0.00027564823,0.00025688342,0.00034450192,0.00017483662],"domain_scores_gemma":[0.99843735,0.0002527395,0.000093206334,0.001075544,0.000078023266,0.00006312251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021904604,0.00008636418,0.00016661888,0.00011425448,0.00021403524,0.000052244635,0.00084868335,0.000034568246,0.00015584822],"category_scores_gemma":[0.0000346782,0.000059581493,0.00016270284,0.0012853132,0.00006879581,0.00010861962,0.0002459136,0.00006213502,0.00014937125],"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.000009577007,0.0023730395,0.0023035845,0.00002662077,0.003195626,0.000015508966,0.0013112233,0.013786249,0.18681924,0.6784529,0.012887382,0.098819055],"study_design_scores_gemma":[0.00014107375,0.0000097406,0.0026902724,0.0000016707485,0.00009815779,6.0440755e-7,0.000005142254,0.98156154,0.011037571,0.00017259915,0.0042032544,0.000078365556],"about_ca_topic_score_codex":0.000053598997,"about_ca_topic_score_gemma":0.000024365916,"teacher_disagreement_score":0.9677753,"about_ca_system_score_codex":0.00001095638,"about_ca_system_score_gemma":0.000010546206,"threshold_uncertainty_score":0.24296628},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85902613,0.00021436877,0.13220787,0.0042307116,0.00045732947,0.0004006701,0.000017897986,0.00018283133,0.0032622172],"genre_scores_gemma":[0.9982523,0.0000062078248,0.0012437043,0.00006803168,0.00007684644,0.00008049814,0.0000032031849,0.00000928057,0.0002599651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989175,0.00010095791,0.00027455707,0.00023411936,0.00027621852,0.0001966313],"domain_scores_gemma":[0.99889606,0.000060808077,0.00012123409,0.000663011,0.00011696165,0.00014192722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004444373,0.000098791614,0.00014374428,0.000038947368,0.000119592216,0.00009877059,0.0005725919,0.000019501647,0.0000051273796],"category_scores_gemma":[0.0000708664,0.000073327436,0.00005504114,0.000375588,0.0000644225,0.0002697666,0.00016499494,0.00007985788,0.0002016906],"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.00006715002,0.0007244069,0.0015306028,0.00007758604,0.000096290154,0.0000203442,0.060980193,0.00558413,0.02604522,0.77572614,0.025027262,0.1041207],"study_design_scores_gemma":[0.0006066226,0.00036228143,0.0016344311,0.000113330156,0.000048695474,0.000036183534,0.003423197,0.2852415,0.3655279,0.045063324,0.29715827,0.0007842363],"about_ca_topic_score_codex":0.00022560637,"about_ca_topic_score_gemma":0.00008873973,"teacher_disagreement_score":0.73066276,"about_ca_system_score_codex":0.00002152172,"about_ca_system_score_gemma":0.00013169339,"threshold_uncertainty_score":0.29902062},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006667325,0.0007248048,0.9955546,0.0014272436,0.00019768611,0.0006621315,0.000006132259,0.000098112636,0.0012625873],"genre_scores_gemma":[0.09912833,0.00018524965,0.898438,0.0017311602,0.0000891026,0.00006701849,0.00006415402,0.00002527571,0.000271701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843585,0.00002710442,0.00035549747,0.0006287496,0.00028686828,0.00026593008],"domain_scores_gemma":[0.99805605,0.00040274658,0.00021305842,0.0009956731,0.0002570533,0.000075417694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007047001,0.00023759868,0.00022660806,0.00029249035,0.00048456175,0.00062200543,0.0011272283,0.0001701783,0.0000042457477],"category_scores_gemma":[0.00006718597,0.00023803794,0.00004519071,0.0002790489,0.0002476157,0.000958488,0.00038707416,0.00026531928,0.000009105072],"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.0000025276747,0.000027114784,0.0000069405432,0.000083085004,0.000006864887,0.0000016196168,0.0011286834,0.005113115,0.00088731013,0.34784842,0.00018191324,0.6447124],"study_design_scores_gemma":[0.00020791373,0.000047058536,0.000020641348,0.000121157056,0.000008371873,0.000035661946,2.1474035e-7,0.8911761,0.0015259284,0.09779057,0.008774473,0.0002918818],"about_ca_topic_score_codex":0.00000722237,"about_ca_topic_score_gemma":0.000049164282,"teacher_disagreement_score":0.88606304,"about_ca_system_score_codex":0.00013972323,"about_ca_system_score_gemma":0.00012427813,"threshold_uncertainty_score":0.97069055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008303209,0.000008430698,0.9927999,0.0002651946,0.00006201374,0.00046198262,8.048912e-7,0.0003226102,0.00524874],"genre_scores_gemma":[0.2709433,4.912128e-7,0.72825044,0.000045035333,0.000021611077,0.00018760846,0.0000038975613,0.0000045245624,0.0005430861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994925,0.000016940518,0.00009878728,0.00019583727,0.00006682326,0.00012907038],"domain_scores_gemma":[0.999435,0.00009387234,0.00003709789,0.0003061074,0.00008446335,0.00004344451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013086286,0.00006098231,0.00006279446,0.00003584843,0.00011350322,0.00010618076,0.00035136016,0.000034068922,0.000020783764],"category_scores_gemma":[0.000012922037,0.000053146327,0.000026335532,0.00020538109,0.000010864255,0.00014971149,0.000030912015,0.000042618285,0.00003053349],"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.0000032908279,0.0000632071,0.0000063974376,0.000027082702,0.0000114808345,7.956619e-7,0.00018947953,0.004825988,0.15629342,0.8296813,0.0011397783,0.007757821],"study_design_scores_gemma":[0.00013899368,0.00005585071,0.000040175975,0.0000024072401,0.000006065242,0.000011998315,0.00001242186,0.9515673,0.04682188,0.00042374842,0.0008441428,0.00007502405],"about_ca_topic_score_codex":0.0000106927555,"about_ca_topic_score_gemma":0.0000045700576,"teacher_disagreement_score":0.9467413,"about_ca_system_score_codex":0.000012747415,"about_ca_system_score_gemma":0.000046500532,"threshold_uncertainty_score":0.21672443},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10162975,0.000055467517,0.8758514,0.00911476,0.0000400005,0.00020430666,0.0000021751548,0.00044578203,0.012656359],"genre_scores_gemma":[0.8902213,0.000009112839,0.10664166,0.001575519,0.000045674667,0.00001173247,0.0000056652234,0.000009409185,0.0014799316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824625,0.000047098278,0.00035331145,0.0005478184,0.00034385035,0.00046166673],"domain_scores_gemma":[0.99880856,0.00012432213,0.000066363944,0.00072760845,0.00007785651,0.00019530964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002470473,0.00019098232,0.00023445238,0.00013068668,0.00010993346,0.00026857405,0.0010706282,0.00011613028,0.000065752676],"category_scores_gemma":[0.00005561514,0.00017367495,0.000081446226,0.0006321458,0.000065370135,0.0003142509,0.00019188796,0.00021989665,0.00042803725],"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.000009331131,0.0011173759,0.0053304355,0.00001563516,0.000020425736,0.00008407512,0.00049373665,0.0054714014,0.0099125905,0.91868496,0.0021580989,0.056701913],"study_design_scores_gemma":[0.001012581,0.00029153464,0.22445138,0.000087705506,0.000015858372,0.000109248394,0.00007189586,0.73682827,0.008309863,0.012892683,0.015013272,0.00091572554],"about_ca_topic_score_codex":0.000015884165,"about_ca_topic_score_gemma":0.000023381277,"teacher_disagreement_score":0.9057923,"about_ca_system_score_codex":0.000044897588,"about_ca_system_score_gemma":0.00007161805,"threshold_uncertainty_score":0.7082259},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12611328,0.00006300964,0.8704861,0.000244232,0.00031537522,0.0018034002,0.0000022569889,0.00011754542,0.00085481297],"genre_scores_gemma":[0.9944958,4.0530205e-7,0.004296437,0.00013626488,0.000070885246,0.00028522246,0.0000015245545,0.000008775405,0.0007046971],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998873,0.000049837738,0.000417887,0.00022457904,0.0002601876,0.0001745081],"domain_scores_gemma":[0.9982984,0.0003414149,0.00021466825,0.0008649928,0.00014740843,0.00013310857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028863485,0.00011205795,0.00030634608,0.00010261649,0.000058325582,0.00024890967,0.0015854532,0.000035620622,0.0000036081174],"category_scores_gemma":[0.00013767266,0.00009422036,0.00005181592,0.00044872361,0.000009552149,0.00045566793,0.00016095508,0.00005449261,0.000023282502],"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.00017374405,0.012146582,0.007763904,0.050554723,0.0015425925,0.00012088927,0.11171162,0.014605981,0.004962621,0.22337766,0.5509214,0.022118311],"study_design_scores_gemma":[0.0140130045,0.0021931143,0.0029923278,0.004767468,0.0008418987,0.00008187403,0.004312667,0.8229513,0.028646477,0.11438558,0.0026254118,0.0021888472],"about_ca_topic_score_codex":0.00030937282,"about_ca_topic_score_gemma":0.00010961976,"teacher_disagreement_score":0.8683825,"about_ca_system_score_codex":0.000025472958,"about_ca_system_score_gemma":0.00011218673,"threshold_uncertainty_score":0.3842195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023701305,0.00023733651,0.9159714,0.07723274,0.00008936528,0.0008681571,0.000087141234,0.00022509314,0.0029186085],"genre_scores_gemma":[0.96104217,0.0014280411,0.03487733,0.002205885,0.0000049507075,0.00022122465,0.000015550546,0.0000112901635,0.00019357199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984205,0.0003726433,0.0004925247,0.0002447705,0.00024934372,0.000220267],"domain_scores_gemma":[0.98999757,0.001314204,0.00014989298,0.008378028,0.000091931935,0.000068392044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002872595,0.00017023056,0.00019124798,0.00027426673,0.00065397413,0.0001131859,0.0047788206,0.000076005985,0.00000929071],"category_scores_gemma":[0.000010097727,0.00014865128,0.00013463406,0.0009482305,0.00023178825,0.0007205345,0.00004052647,0.00054959784,0.00004780977],"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.000012061824,0.0036050729,0.000007491605,0.000004457299,0.00004389407,4.951358e-7,0.0012655413,0.022141283,0.0016835701,0.9029847,0.0016937028,0.06655775],"study_design_scores_gemma":[0.00049610506,0.00013303258,0.0007296706,0.00010598733,0.000026928905,0.000005225894,0.0000783077,0.94093686,0.0031941617,0.040951643,0.013045966,0.00029610808],"about_ca_topic_score_codex":0.00012722067,"about_ca_topic_score_gemma":0.00015990861,"teacher_disagreement_score":0.95867205,"about_ca_system_score_codex":0.00008724268,"about_ca_system_score_gemma":0.00006615344,"threshold_uncertainty_score":0.8880317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18216586,0.00013959149,0.8161543,0.0012927288,0.000045362794,0.000050485443,0.000008878074,0.000016660151,0.00012611637],"genre_scores_gemma":[0.94598705,0.00004811402,0.05364971,0.00010500542,0.00012497528,0.0000046451164,0.000010244974,0.000011500827,0.000058754827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880844,0.000020214899,0.00030818727,0.00017242754,0.0005505194,0.00014018915],"domain_scores_gemma":[0.9993465,0.00002808497,0.0002443099,0.00024260746,0.000077826,0.00006069864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009538605,0.00011013176,0.00012626506,0.00007557592,0.000028328473,0.00010325881,0.0010145998,0.000024772558,0.000006056913],"category_scores_gemma":[0.0000020547227,0.00010050237,0.000056779518,0.00007504971,0.000025834492,0.00046721214,0.00013499765,0.00015499412,0.000016139817],"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.000020463947,0.00095493376,0.0011711108,0.0000058282017,0.00013700654,0.00009872625,0.0007543839,0.5592014,0.031844877,0.015852189,0.00033609156,0.38962296],"study_design_scores_gemma":[0.00059205625,0.000027334256,0.00033548466,0.00002571197,0.000006730383,0.000039426803,0.0000045049014,0.98451066,0.00644476,0.007095545,0.00080573297,0.00011202515],"about_ca_topic_score_codex":0.0000072008065,"about_ca_topic_score_gemma":0.0000035951382,"teacher_disagreement_score":0.7638212,"about_ca_system_score_codex":0.00022390982,"about_ca_system_score_gemma":0.000055940196,"threshold_uncertainty_score":0.4098368},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062795326,0.0054433774,0.9229658,0.0040968433,0.00026851107,0.00016355613,0.0000025026698,0.00018216736,0.004081877],"genre_scores_gemma":[0.9901923,0.0003732339,0.008521632,0.0007186086,0.00007221404,0.000039887967,0.00000592975,0.000003673057,0.0000725306],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904513,0.000051106854,0.00021079343,0.0003726707,0.00015570616,0.00016461614],"domain_scores_gemma":[0.99931085,0.00019577934,0.00011337594,0.00017215368,0.00008701895,0.00012079142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013840855,0.000116980766,0.00010324365,0.00004781148,0.0002708796,0.0002644617,0.00020740872,0.000035038232,0.000011287963],"category_scores_gemma":[0.000054514832,0.00011473604,0.00001916848,0.0002074075,0.00010637573,0.0017719176,0.00014020708,0.00010693656,0.000035222623],"study_design_candidate":"design_other","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.0000013080978,0.00007142915,0.00014400431,0.000007979372,0.000005695151,0.0000026773569,0.010214869,0.000021503301,0.0003515972,0.184419,0.0009860342,0.8037739],"study_design_scores_gemma":[0.00067135267,0.00011719936,0.0020286173,0.000025231817,0.00002048903,0.00024162668,0.0018133661,0.327515,0.0014744026,0.00086039444,0.6647886,0.00044372372],"about_ca_topic_score_codex":0.000008339023,"about_ca_topic_score_gemma":6.407476e-7,"teacher_disagreement_score":0.92739695,"about_ca_system_score_codex":0.000011237635,"about_ca_system_score_gemma":0.000039059654,"threshold_uncertainty_score":0.46787998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009872922,0.00014212832,0.97250366,0.01389615,0.00005728373,0.00020844115,0.000002237766,0.00027636034,0.011926465],"genre_scores_gemma":[0.39428362,0.00006993381,0.5911994,0.0014065087,0.00010896968,0.00019439477,0.000017513192,0.000016274715,0.01270337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940336,0.000012370535,0.00011762553,0.00015832523,0.00013096575,0.00017733836],"domain_scores_gemma":[0.9991516,0.00036296048,0.000031188167,0.00035970623,0.000056244444,0.000038325765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105142324,0.000057040506,0.0000440336,0.00001628277,0.000352881,0.0002064857,0.0006167076,0.000018243105,0.000028199524],"category_scores_gemma":[0.000017475613,0.000040528474,0.000037788617,0.00016964816,0.00002910865,0.00009915392,0.00007102616,0.00003697687,0.00016616589],"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":[3.0277164e-7,0.000038542177,0.0000034700136,0.000001945972,0.0000052067353,2.643987e-7,0.0000445184,0.00013570211,0.00017846773,0.90887034,0.037024777,0.053696454],"study_design_scores_gemma":[0.00012606075,0.000034188,0.00014409338,5.851732e-7,0.0000025836398,0.00001115402,0.0000029253417,0.8291388,0.00020496601,0.03511886,0.13516219,0.000053609347],"about_ca_topic_score_codex":0.0000019777522,"about_ca_topic_score_gemma":0.0000035774096,"teacher_disagreement_score":0.8737515,"about_ca_system_score_codex":0.00001055694,"about_ca_system_score_gemma":0.0000123326,"threshold_uncertainty_score":0.27141112},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066263287,0.00019684141,0.99317855,0.0018521202,0.00002806541,0.0002974959,0.0000013231158,0.000058973506,0.0037240044],"genre_scores_gemma":[0.97869265,0.0000047359927,0.020324973,0.00005913143,0.000010425757,0.00008133017,1.9196479e-7,0.0000019326,0.0008246491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996112,0.00000717805,0.00008385375,0.000115079325,0.00010525346,0.0000774075],"domain_scores_gemma":[0.99930674,0.00018045951,0.000027621281,0.00041644252,0.000051810224,0.000016918808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011564876,0.000035230823,0.000043310505,0.000010279303,0.00006946588,0.0000258163,0.00056699064,0.000013196856,0.00003481703],"category_scores_gemma":[0.000042095326,0.000021058957,0.000034963152,0.0001342165,0.000025890868,0.0000690236,0.000050178962,0.000024033507,0.000022163738],"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":[5.1378146e-7,0.000081764156,0.000036698122,0.00001566523,0.000010456361,1.9480325e-7,0.0003481355,0.00011797561,0.0019624715,0.8912427,0.003941678,0.10224178],"study_design_scores_gemma":[0.00012460438,0.000025491287,0.0004125043,0.00000440398,0.000008656725,0.0000066410507,0.000015279818,0.9753661,0.0035322958,0.008488757,0.011950869,0.00006435187],"about_ca_topic_score_codex":0.0000091858865,"about_ca_topic_score_gemma":0.000016467133,"teacher_disagreement_score":0.97802997,"about_ca_system_score_codex":0.0000045727415,"about_ca_system_score_gemma":0.00000882242,"threshold_uncertainty_score":0.10536191},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012654331,0.00012444696,0.97856015,0.0012206513,0.000037806305,0.0007299011,8.325528e-7,0.00026649298,0.018933201],"genre_scores_gemma":[0.1806776,0.000011551146,0.8118666,0.00013686382,0.000027437838,0.0003066893,0.0000123482805,0.000010036647,0.006950879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925023,0.000028099352,0.00024202577,0.00021202375,0.00010410793,0.00016351961],"domain_scores_gemma":[0.99876404,0.00015181105,0.00005642241,0.00084746286,0.00008949867,0.00009074179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042171744,0.00008258468,0.00010978304,0.000055727534,0.00014914435,0.00019841194,0.0005871692,0.00006335111,0.000018864177],"category_scores_gemma":[0.00008021188,0.000075202835,0.000048831815,0.00027239232,0.000018372442,0.00016944061,0.00009189228,0.00006765248,0.000056327273],"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":[3.716322e-7,0.000029504827,0.0000024453025,0.00000787448,0.000004127325,1.7894322e-7,0.00002652447,0.00013286302,0.011650663,0.978477,0.008411349,0.0012571075],"study_design_scores_gemma":[0.0006234888,0.000057153215,0.000013579352,0.00006559589,0.000016466664,0.00008813921,0.000032328015,0.39761123,0.16237846,0.018503867,0.4202595,0.00035017967],"about_ca_topic_score_codex":0.000036182693,"about_ca_topic_score_gemma":0.0000023300945,"teacher_disagreement_score":0.9599731,"about_ca_system_score_codex":0.000030194888,"about_ca_system_score_gemma":0.000083182116,"threshold_uncertainty_score":0.30666825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26512533,0.000007981501,0.73387355,0.000035761146,0.00006215704,0.00028566478,0.00000822209,0.000047953872,0.00055336836],"genre_scores_gemma":[0.9920979,9.1511646e-7,0.0076054065,0.00011446091,0.0000075934217,0.00012165131,0.000004976215,0.000005984441,0.00004110427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939275,0.000049372462,0.00012633507,0.00022074328,0.00008996735,0.000120841876],"domain_scores_gemma":[0.9988369,0.00068105414,0.000040644747,0.00035905678,0.000035466128,0.000046921847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002731099,0.00007973034,0.000119780954,0.000045932182,0.000055122637,0.0000333589,0.00025167986,0.000024903897,0.00001540186],"category_scores_gemma":[0.000053243086,0.000065501794,0.000068492234,0.00016118927,0.000018744911,0.00007490235,0.000019180632,0.000026497788,0.00001559189],"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.000039116236,0.0026577075,0.0020134775,0.00021039002,0.00006376109,0.000005210539,0.00034696067,0.00030459036,0.3567924,0.53785264,0.0018741098,0.09783967],"study_design_scores_gemma":[0.0054315883,0.00036772492,0.0005486949,0.000025258518,0.0000115703915,0.0000040100726,0.000005798449,0.056581933,0.92975986,0.0051835817,0.0018816416,0.00019832434],"about_ca_topic_score_codex":0.000006531331,"about_ca_topic_score_gemma":0.0000012178953,"teacher_disagreement_score":0.7269726,"about_ca_system_score_codex":0.000012006261,"about_ca_system_score_gemma":0.000025743651,"threshold_uncertainty_score":0.26710856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006434617,0.00013879492,0.92572516,0.002455341,0.00015416494,0.00014691867,0.0000025169736,0.0011414298,0.06380105],"genre_scores_gemma":[0.8421765,0.000013981643,0.14736782,0.0004421624,0.00008785068,0.00001696848,0.0000081766675,0.000010978998,0.009875539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912953,0.000016963726,0.00015593406,0.00030822703,0.00018281584,0.00020654751],"domain_scores_gemma":[0.9989064,0.00002284171,0.000036446458,0.00091503386,0.000024639541,0.00009465648],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005538356,0.00010527125,0.00009728116,0.00005574271,0.00011333135,0.00009459669,0.0008804263,0.00004894287,0.0007156696],"category_scores_gemma":[0.000007129386,0.00008998385,0.000060855687,0.00035336817,0.000026542251,0.0002263874,0.00017683372,0.00007399328,0.0014581815],"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":[7.7023697e-7,0.00027222428,0.00012828593,0.000017128274,0.00003113154,0.000047738908,0.00073038635,0.000062213294,0.08667355,0.45292512,0.08616232,0.37294912],"study_design_scores_gemma":[0.0001942674,0.000014395296,0.00024638785,0.0000017428993,0.0000034917473,0.000015127712,0.0000060497173,0.8650596,0.033175003,0.0016078603,0.099524215,0.00015182106],"about_ca_topic_score_codex":0.000011209903,"about_ca_topic_score_gemma":0.00000568225,"teacher_disagreement_score":0.86499745,"about_ca_system_score_codex":0.000009783544,"about_ca_system_score_gemma":0.000007484467,"threshold_uncertainty_score":0.9993193},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17952718,0.00015242201,0.79946166,0.005817497,0.00019304462,0.00031690527,0.000009447612,0.00043641354,0.014085458],"genre_scores_gemma":[0.83715636,0.00002960868,0.15690376,0.00088001456,0.000102356316,0.00008489543,0.0000032045966,0.000009495536,0.0048303055],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842274,0.000029895922,0.00025767472,0.00057779165,0.0003209037,0.0003909749],"domain_scores_gemma":[0.99894845,0.00006081126,0.000058281792,0.00066644663,0.00006756773,0.00019841903],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002016339,0.0001880554,0.00018450685,0.0001039313,0.000233851,0.0003862803,0.0011594704,0.00005642284,0.00037766874],"category_scores_gemma":[0.0000147065675,0.00014714587,0.00008611952,0.00062450336,0.00006560469,0.00049606204,0.00021781135,0.00009557885,0.0011548469],"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.000014736874,0.00067101856,0.00090384996,0.000031922344,0.00011015533,0.00006896784,0.0054975688,0.0017409215,0.5110028,0.3331895,0.01914706,0.12762153],"study_design_scores_gemma":[0.0011440086,0.0001725862,0.0022814644,0.00002727217,0.000021680255,0.00027159954,0.00013143414,0.8885858,0.08235308,0.0026478006,0.021392846,0.000970426],"about_ca_topic_score_codex":0.00028179333,"about_ca_topic_score_gemma":0.00012505762,"teacher_disagreement_score":0.8868449,"about_ca_system_score_codex":0.000030952295,"about_ca_system_score_gemma":0.000024690087,"threshold_uncertainty_score":0.9996229},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071591355,0.0008304273,0.7938394,0.026045157,0.0012357108,0.0004724651,0.00000407466,0.0013656659,0.10461577],"genre_scores_gemma":[0.98218805,0.0000026863806,0.015577871,0.0005942913,0.00004149958,0.000013453587,0.0000031394306,0.0000041533162,0.0015748411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994628,0.000016318649,0.00007958024,0.00017263074,0.00013628177,0.00013240222],"domain_scores_gemma":[0.99928516,0.000018910627,0.000024050332,0.000528874,0.000038817707,0.00010420234],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000115251234,0.000050961626,0.00005185014,0.000026979587,0.000046902394,0.00007529702,0.0004504885,0.0000180089,0.000013508187],"category_scores_gemma":[0.000023392671,0.000047161855,0.00002402272,0.00020324299,0.000017546234,0.0001888173,0.00013578677,0.000050628507,0.0009946241],"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.000004233245,0.00033227776,0.005179153,0.000036333353,0.00003734565,0.000070043665,0.00396615,0.00011423262,0.0022248155,0.8051879,0.1242383,0.058609232],"study_design_scores_gemma":[0.0008410294,0.00011630835,0.013354414,0.000024838982,0.00001975788,0.000055615175,0.0002213335,0.08300788,0.0036157223,0.11064414,0.7876101,0.0004888195],"about_ca_topic_score_codex":0.00009882642,"about_ca_topic_score_gemma":0.000021778129,"teacher_disagreement_score":0.9105967,"about_ca_system_score_codex":0.000028480741,"about_ca_system_score_gemma":0.000037819224,"threshold_uncertainty_score":0.9997832},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08353086,0.000014463638,0.91081005,0.004066981,0.00004331119,0.0004313254,0.0000016283911,0.000033237306,0.0010681383],"genre_scores_gemma":[0.97853243,0.0000018710427,0.021012556,0.00015936306,0.00002426345,0.00011965963,0.000003316472,0.0000022250701,0.00014433717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942034,0.000027195765,0.00018231501,0.0001675426,0.00008852048,0.0001140682],"domain_scores_gemma":[0.9993979,0.00013822093,0.00005478787,0.0003549077,0.000035407094,0.00001877388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021499133,0.000056042594,0.00007321526,0.00005792073,0.000034810193,0.000048783888,0.00080689567,0.00002421013,0.000008721087],"category_scores_gemma":[0.000026101772,0.00003885799,0.000032764452,0.00024398798,0.000028673241,0.00025645542,0.00008393384,0.00004049008,0.000009107375],"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.000024280796,0.00045858303,0.0009929684,0.000046233392,0.0000131583465,8.0737794e-7,0.014872223,0.0035808806,0.039554942,0.77156305,0.0031523143,0.16574058],"study_design_scores_gemma":[0.00020425965,0.00004949331,0.00401973,0.00001694333,0.0000020618775,0.0000027842043,0.00014066974,0.96876484,0.021416506,0.0038409983,0.0014728584,0.00006885627],"about_ca_topic_score_codex":0.000024810657,"about_ca_topic_score_gemma":0.000067314155,"teacher_disagreement_score":0.965184,"about_ca_system_score_codex":0.000012985732,"about_ca_system_score_gemma":0.000017868015,"threshold_uncertainty_score":0.15845828},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053878484,0.000044803353,0.9953821,0.0028576776,0.00044983008,0.0003896089,0.000008559044,0.00012599282,0.00020269849],"genre_scores_gemma":[0.4402098,0.0000023574516,0.55822885,0.0014647958,0.000021433078,0.000023642688,0.000007353076,0.0000033661356,0.000038383885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849343,0.00004740043,0.0002522392,0.00053638575,0.00035343075,0.0003170817],"domain_scores_gemma":[0.9992713,0.0002102255,0.00007492083,0.00027227827,0.00006935244,0.000101926686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028194182,0.00011991733,0.00015167428,0.00035257862,0.00020936265,0.00018651779,0.0010963232,0.000034642544,0.0000019278057],"category_scores_gemma":[0.00012398986,0.0001250928,0.000056516106,0.0018220607,0.00008141515,0.00040079036,0.000073592564,0.00008965171,0.0000057297043],"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.000020307916,0.0006181731,0.0011784568,0.000009426169,0.0000027067144,0.00001735995,0.00015669859,0.5770874,0.0045089093,0.22606432,0.067346975,0.12298926],"study_design_scores_gemma":[0.0002601003,0.000105476436,0.04527062,0.0000025321613,0.0000011266109,0.0000099520275,0.0000025603888,0.86077714,0.00010008723,0.0882854,0.005061099,0.00012387498],"about_ca_topic_score_codex":9.520821e-7,"about_ca_topic_score_gemma":7.3254554e-8,"teacher_disagreement_score":0.439671,"about_ca_system_score_codex":0.00005230418,"about_ca_system_score_gemma":0.00011272475,"threshold_uncertainty_score":0.51011366},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9621847,0.0007992421,0.030829621,0.00093467656,0.00013797519,0.00028046165,0.0000034562158,0.000111808025,0.004718027],"genre_scores_gemma":[0.990847,0.000042441516,0.008772399,0.00012724489,0.000012745056,0.000043615575,0.0000018068466,0.0000054236175,0.00014731268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991931,0.000058699487,0.0002281904,0.00025069725,0.000090425405,0.0001789092],"domain_scores_gemma":[0.9995393,0.00007829633,0.00004170609,0.0002695234,0.000018928831,0.000052232623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023263755,0.00009242228,0.0001603011,0.00025854417,0.000026045294,0.000057456084,0.00034611637,0.00005400699,0.000017849326],"category_scores_gemma":[0.000062697945,0.00008269521,0.000034397966,0.00053677795,0.000060198505,0.00021173804,0.00009993775,0.00009365624,0.000019825964],"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.00019333993,0.00069446303,0.019893497,0.000053088275,0.000049788323,0.0002961261,0.02397809,0.000020381702,0.012047732,0.60326177,0.0021463644,0.33736533],"study_design_scores_gemma":[0.024845988,0.0007324265,0.35589954,0.00046944062,0.00006064089,0.00022786722,0.006540179,0.120397404,0.25362036,0.18623109,0.0476981,0.0032769705],"about_ca_topic_score_codex":0.00053122774,"about_ca_topic_score_gemma":0.0005608762,"teacher_disagreement_score":0.4170307,"about_ca_system_score_codex":0.000029828625,"about_ca_system_score_gemma":0.00003008666,"threshold_uncertainty_score":0.3372213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71872175,0.000045306268,0.2533288,0.009552797,0.0000903832,0.0002779194,0.000023265458,0.000037305308,0.017922506],"genre_scores_gemma":[0.99781966,0.0000027076492,0.0016835332,0.00023256915,0.0000072097573,0.000005089332,6.069936e-7,0.000001276984,0.00024735348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995824,0.00004398719,0.00014023461,0.00007345784,0.00011054335,0.000049365706],"domain_scores_gemma":[0.9992442,0.00025324925,0.00009362556,0.00033383514,0.00006571745,0.0000093396175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019744098,0.000035791352,0.00006353391,0.000015662807,0.00003761652,0.0000046051687,0.0005467216,0.000013083509,0.000041631753],"category_scores_gemma":[0.000029997886,0.000017745442,0.000049231872,0.00019303404,0.000096293355,0.000040242714,0.00010664398,0.000033626337,0.000008201602],"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":[9.752952e-7,0.00005695424,0.00029233505,0.0000031670288,0.000004886618,1.5658872e-8,0.00010936203,0.00007883641,0.015657032,0.9809222,0.0020579456,0.000816243],"study_design_scores_gemma":[0.00019043458,0.000043188593,0.03429181,0.00002439026,0.0000070437545,0.0000023414277,0.00003457329,0.14479673,0.7831141,0.036172435,0.0012524842,0.000070517315],"about_ca_topic_score_codex":0.000053198615,"about_ca_topic_score_gemma":0.000014491287,"teacher_disagreement_score":0.94474983,"about_ca_system_score_codex":0.00000589246,"about_ca_system_score_gemma":0.00004426771,"threshold_uncertainty_score":0.10159539},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12732401,0.000009119254,0.8645203,0.00055217923,0.000079720034,0.00016100131,0.0000029472626,0.00026034642,0.007090348],"genre_scores_gemma":[0.97922075,0.0000028015816,0.018628616,0.00017541385,0.000033634977,0.000031526793,0.000014737677,0.000009931854,0.0018825886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989795,0.00003474511,0.00022209909,0.00037168604,0.0002004374,0.00019153026],"domain_scores_gemma":[0.99890107,0.000101310674,0.00010035477,0.0006027315,0.00020469994,0.00008981814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046430694,0.00014463885,0.00012915823,0.00009540242,0.00022502645,0.00012029457,0.0005100827,0.000035741577,0.00012860098],"category_scores_gemma":[0.000008436937,0.0001273534,0.00004702578,0.00029568217,0.00006179161,0.0007397081,0.00010757347,0.00013269529,0.00027415066],"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.00013619763,0.0014378092,0.005973986,0.00006344751,0.00014263659,0.00013213964,0.019274285,0.7462926,0.046673816,0.12940283,0.0049012885,0.045568954],"study_design_scores_gemma":[0.00035730618,0.000041937285,0.0018020651,0.00001529638,0.000005525933,0.00002784437,0.00002533933,0.98713076,0.004108702,0.0004761106,0.0058276993,0.00018144144],"about_ca_topic_score_codex":0.000018622704,"about_ca_topic_score_gemma":0.000015388396,"teacher_disagreement_score":0.8518967,"about_ca_system_score_codex":0.000033923556,"about_ca_system_score_gemma":0.00009807454,"threshold_uncertainty_score":0.51933205},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08776021,0.00018692829,0.90693945,0.002480875,0.00014280876,0.00046039693,0.00015975886,0.000554628,0.0013149603],"genre_scores_gemma":[0.9879304,0.0000032226044,0.011589375,0.000053084175,0.00011103381,0.00006961707,0.00013765704,0.000014736251,0.000090879366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987375,0.000054558706,0.00034232115,0.00039251047,0.0002193972,0.00025371922],"domain_scores_gemma":[0.99889785,0.00007283134,0.000089273766,0.00069830817,0.00006283062,0.00017893006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001599292,0.00015803485,0.00022489767,0.0001166997,0.0003910201,0.00032582346,0.00050239504,0.00006099923,0.000011445206],"category_scores_gemma":[0.000007890644,0.00015957565,0.00006705546,0.000374153,0.00008588795,0.0003737398,0.00008877753,0.00010480727,0.00016261093],"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.0000010909249,0.00028802681,0.000549348,0.00016363476,0.000089038534,0.00004007549,0.0032896379,0.0014243792,0.06088491,0.9287889,0.0011269539,0.0033540064],"study_design_scores_gemma":[0.0072393958,0.0004969476,0.2445869,0.00058165344,0.00034654647,0.0010051933,0.001831733,0.428885,0.011497946,0.052384757,0.24784574,0.0032981965],"about_ca_topic_score_codex":0.00013272197,"about_ca_topic_score_gemma":0.000018786059,"teacher_disagreement_score":0.9001702,"about_ca_system_score_codex":0.00006211107,"about_ca_system_score_gemma":0.000073708135,"threshold_uncertainty_score":0.6507306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0108028995,0.00008680952,0.81876034,0.029560044,0.000025704612,0.00021652278,7.8989046e-7,0.00019358378,0.1403533],"genre_scores_gemma":[0.97334886,0.000014714182,0.022443054,0.0012539101,0.000017033819,0.00009729135,0.0000015890932,0.0000023287237,0.0028212348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952996,0.00002113251,0.0000967156,0.00017793404,0.00007182421,0.00010244466],"domain_scores_gemma":[0.9989653,0.000053647138,0.00001706225,0.0009319648,0.000012133706,0.00001987208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011265706,0.000040270967,0.0000350976,0.000032851545,0.00007751005,0.00008073622,0.0008718386,0.00001597844,0.00007395409],"category_scores_gemma":[0.000009122413,0.000027288082,0.000023317984,0.00043907063,0.00001488349,0.0000878011,0.000065518994,0.00005593575,0.000457314],"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":[3.595684e-8,0.00012984265,0.00019540716,0.0000010440178,0.0000012950206,0.0000016304455,0.0010254666,0.00003297255,0.00047869608,0.9579792,0.010765408,0.029389026],"study_design_scores_gemma":[0.00015192649,0.000013865705,0.016404869,0.0000027496071,0.0000025093677,0.00003289031,0.000084814965,0.7537333,0.00071399874,0.016052628,0.21265367,0.0001528396],"about_ca_topic_score_codex":0.000042570126,"about_ca_topic_score_gemma":0.00006536919,"teacher_disagreement_score":0.96254593,"about_ca_system_score_codex":0.0000074708946,"about_ca_system_score_gemma":0.0000040683717,"threshold_uncertainty_score":0.58779985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3892757,0.000011430752,0.60818225,0.0010955437,0.000016282489,0.00015613734,0.00008440019,0.00017658355,0.0010016758],"genre_scores_gemma":[0.9262613,0.0000023857028,0.07301574,0.0003045016,0.00000503056,0.000010876544,0.000026405633,0.000004455838,0.00036929664],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903744,0.000039761395,0.00023010676,0.00027034865,0.00022224733,0.00020009685],"domain_scores_gemma":[0.9990783,0.00016328804,0.000099932775,0.0004091544,0.00014656177,0.000102802755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008428631,0.00014134309,0.00018047435,0.00005978382,0.00016452213,0.00006534741,0.00035910084,0.00002698117,0.000056474688],"category_scores_gemma":[0.000010055987,0.00010954523,0.000044653236,0.00035079595,0.0001561438,0.00025330766,0.000042083964,0.00009748333,0.000014920218],"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.000038862818,0.00066916086,0.0008048052,0.000018983188,0.00008450165,0.000020937996,0.0007725123,0.34718823,0.37873235,0.26125717,0.002341234,0.008071248],"study_design_scores_gemma":[0.0005053361,0.00010315302,0.00024478007,0.000011844568,0.000007427942,0.000057714584,0.0000080761565,0.97651565,0.014459036,0.0078234915,0.00009893548,0.00016458065],"about_ca_topic_score_codex":0.0007058721,"about_ca_topic_score_gemma":0.0002034345,"teacher_disagreement_score":0.6293274,"about_ca_system_score_codex":0.00001537268,"about_ca_system_score_gemma":0.00009821049,"threshold_uncertainty_score":0.4467125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025883203,0.00012429304,0.90344745,0.0018822429,0.00002879313,0.00027040523,8.0497824e-7,0.0005301243,0.091127574],"genre_scores_gemma":[0.30834442,0.0000048367283,0.68121654,0.0010544938,0.00007804578,0.00003667686,0.0000142677,0.00001429048,0.009236462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856395,0.000021607888,0.00022616003,0.000515289,0.00033613032,0.00033686688],"domain_scores_gemma":[0.9989146,0.00003673202,0.000039374365,0.0006125763,0.000038978258,0.00035775077],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008386441,0.0001534424,0.00013603237,0.0001223115,0.0001523259,0.00024147876,0.0009147413,0.00003891284,0.00018264959],"category_scores_gemma":[0.000005980063,0.00015247292,0.000058216247,0.00067384343,0.000014906663,0.00023175623,0.00018471868,0.00009067083,0.00180898],"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":[9.985617e-7,0.00034655194,0.000001648619,0.000009011457,0.00001605888,0.0000032533362,0.0010801569,0.21077424,0.0027150235,0.7442172,0.020353068,0.020482777],"study_design_scores_gemma":[0.00021027605,0.000058734353,0.0000060534476,0.0000024163928,0.000004689028,0.000021600548,0.000008240913,0.96998173,0.0004685435,0.015663723,0.013376788,0.00019722666],"about_ca_topic_score_codex":0.00006607287,"about_ca_topic_score_gemma":4.2163697e-7,"teacher_disagreement_score":0.7592075,"about_ca_system_score_codex":0.000037993803,"about_ca_system_score_gemma":0.00006203159,"threshold_uncertainty_score":0.99896824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6871545,0.00005791305,0.30999997,0.00012299571,0.000113973336,0.00023120192,0.000003661605,0.00011200641,0.0022038037],"genre_scores_gemma":[0.9987986,0.000006910964,0.00078372384,0.00014974643,0.0001239157,0.00007013744,0.0000119581355,0.000007464556,0.000047522153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913394,0.000021108915,0.00015551616,0.00033608358,0.00014318482,0.00021017683],"domain_scores_gemma":[0.9993867,0.000037904832,0.000052541367,0.00043676753,0.000015153867,0.00007093376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114682865,0.00012170189,0.00016428364,0.00003309813,0.00009164815,0.00014250391,0.00030217058,0.00005321817,8.619159e-7],"category_scores_gemma":[0.0000015972057,0.00011596563,0.000028939843,0.00020115089,0.000029467652,0.000089145775,0.00014754313,0.00010296788,0.00008374024],"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.0000051553748,0.0001881348,0.0010096648,0.00007194774,0.000016282083,0.0000026773046,0.0006083488,0.0007729993,0.010460795,0.68452054,0.00027472334,0.3020687],"study_design_scores_gemma":[0.0027765199,0.00017196558,0.16034354,0.00006376138,0.000042248907,0.00003279105,0.00009897618,0.5671704,0.014142722,0.0598689,0.19351679,0.0017713808],"about_ca_topic_score_codex":0.000089966314,"about_ca_topic_score_gemma":0.000054089585,"teacher_disagreement_score":0.6246517,"about_ca_system_score_codex":0.0000073986785,"about_ca_system_score_gemma":0.000012978241,"threshold_uncertainty_score":0.4728941},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47654215,0.0001782884,0.5223562,0.00022331833,0.00014835045,0.00020060544,0.000012218647,0.00014343018,0.0001954403],"genre_scores_gemma":[0.9561866,2.9886323e-7,0.04356253,0.00006627025,0.000063788364,0.0000041555086,0.00009193204,0.00000935678,0.000015072673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986508,0.00007185701,0.00037753105,0.00034159655,0.00031199155,0.00024625938],"domain_scores_gemma":[0.9991522,0.000046555702,0.00014015405,0.00041118538,0.00014990914,0.00009999209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022224624,0.000149775,0.00020938263,0.00015344411,0.000083211955,0.00006749948,0.0005497567,0.00009787076,0.000015284457],"category_scores_gemma":[0.000033258173,0.00014525691,0.0000533399,0.0007597409,0.00006177132,0.00034766216,0.00013633048,0.00029487774,0.000013662556],"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.00009553834,0.0020618793,0.00035770983,0.00057130295,0.00015204013,0.00014479461,0.03577604,0.043526214,0.30217865,0.17660269,0.001681509,0.43685165],"study_design_scores_gemma":[0.0015651373,0.000074923126,0.00035487048,0.00003530838,0.0000069079297,0.00004167232,0.00015579349,0.980262,0.014117778,0.00294786,0.0002788592,0.00015890444],"about_ca_topic_score_codex":0.000026562946,"about_ca_topic_score_gemma":0.000027405658,"teacher_disagreement_score":0.93673575,"about_ca_system_score_codex":0.00009149048,"about_ca_system_score_gemma":0.00018460522,"threshold_uncertainty_score":0.5923405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48761284,0.00087469455,0.34033576,0.011340571,0.0026337965,0.0013564104,0.00010106661,0.0018976157,0.15384723],"genre_scores_gemma":[0.98339814,0.000044235207,0.007479188,0.001542399,0.0001359235,0.0000691035,0.000027974016,0.000028062212,0.007274965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824005,0.000020602645,0.00023730221,0.0005540783,0.0003528182,0.00059516914],"domain_scores_gemma":[0.99705887,0.00004549942,0.0002131157,0.0024451788,0.000047223963,0.00019012259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002564968,0.0002137412,0.00020834769,0.00006755491,0.0010055619,0.000757309,0.002376881,0.00011637975,0.00009645252],"category_scores_gemma":[0.0000349342,0.00020978689,0.00012212979,0.00014040823,0.000113302136,0.001496819,0.00094410474,0.00018332683,0.00069005677],"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.000010530542,0.0003541575,0.036643926,0.000056000645,0.00009520256,0.000077612414,0.0009286449,0.00003460554,0.03138257,0.54094106,0.35042933,0.039046347],"study_design_scores_gemma":[0.0010506186,0.00006754691,0.048321906,0.0000624964,0.000024585053,0.00002979386,0.000100023484,0.084366985,0.00860211,0.016302783,0.8403341,0.000737022],"about_ca_topic_score_codex":0.00046671895,"about_ca_topic_score_gemma":0.0005918244,"teacher_disagreement_score":0.5246383,"about_ca_system_score_codex":0.000069437694,"about_ca_system_score_gemma":0.00006355455,"threshold_uncertainty_score":0.8869513},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5285557,0.00016946284,0.46881795,0.0004981224,0.000052157622,0.00031353656,0.0000043510713,0.00012065837,0.0014680544],"genre_scores_gemma":[0.9851166,0.000008456868,0.014696816,0.000008345565,0.000035660687,0.00003726549,0.000017822911,0.00000479275,0.0000742627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986891,0.0000882973,0.0003043056,0.00031847676,0.00035507922,0.00024469988],"domain_scores_gemma":[0.99899334,0.000064052285,0.00008385106,0.0006708561,0.0001260802,0.00006185192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351015,0.000090536974,0.00012825947,0.00010029887,0.00024032536,0.000066741486,0.00047898665,0.000036294587,0.000036155743],"category_scores_gemma":[0.000026479762,0.00008716929,0.00002977912,0.0004460225,0.00034929792,0.00022118316,0.0003306141,0.00010476295,0.00003688],"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.0000033374777,0.0001718299,0.00036422064,0.00007157893,0.000006460986,0.0000020159184,0.00028366328,0.00017519196,0.07246862,0.9151479,0.0012869197,0.010018279],"study_design_scores_gemma":[0.00021582149,0.00007668314,0.025553547,0.000022089363,0.0000052752557,0.000010799108,0.000045432636,0.48048025,0.041218486,0.44993493,0.002272,0.00016466586],"about_ca_topic_score_codex":0.0005663593,"about_ca_topic_score_gemma":0.000039072584,"teacher_disagreement_score":0.48030508,"about_ca_system_score_codex":0.00002374011,"about_ca_system_score_gemma":0.00003793082,"threshold_uncertainty_score":0.35546604},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008242824,0.00013895717,0.98822486,0.0008955096,0.001096192,0.00034104503,0.000003404423,0.00029631593,0.00076088257],"genre_scores_gemma":[0.8714576,0.000003729281,0.124460354,0.00028857315,0.0024559565,0.00011540495,0.000029188124,0.000012704009,0.0011765006],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992471,0.000014896558,0.00014474738,0.0002656623,0.00013904844,0.00018855305],"domain_scores_gemma":[0.9992216,0.000110623434,0.00004688814,0.00037466167,0.00009428121,0.00015189878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029192033,0.00008569481,0.00009770489,0.00003070862,0.000102101265,0.00014626505,0.0003146249,0.00005035606,0.0000036856495],"category_scores_gemma":[0.000036417212,0.00007760803,0.000029254066,0.00015333842,0.000019367524,0.0003165694,0.00014143025,0.00003252572,0.000028467522],"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.000008187291,0.00014019627,0.0005242997,0.00003516154,0.00002846767,0.0000032044898,0.0006990333,0.001409187,0.0011849717,0.46568578,0.47313312,0.057148382],"study_design_scores_gemma":[0.00044898767,0.00004433157,0.00022731184,0.0000032982077,0.0000060611187,0.0000023028733,0.000017972074,0.77308047,0.00068711425,0.00734787,0.2180259,0.00010840593],"about_ca_topic_score_codex":0.000012771483,"about_ca_topic_score_gemma":0.000010635283,"teacher_disagreement_score":0.8637645,"about_ca_system_score_codex":0.000024611369,"about_ca_system_score_gemma":0.000056578992,"threshold_uncertainty_score":0.31647637},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036912408,0.0018212041,0.9356452,0.0150111,0.000186603,0.00042474366,0.00003675462,0.00034307007,0.009618908],"genre_scores_gemma":[0.79717475,0.00009707686,0.20217972,0.00021929917,0.00003646884,0.00006599532,0.00015764184,0.0000064048354,0.000062639236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988889,0.00014168845,0.00036823054,0.0002213428,0.00022949607,0.00015035148],"domain_scores_gemma":[0.9965948,0.00009114785,0.00020302401,0.002784032,0.00024776813,0.00007922772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003286526,0.000109297835,0.00015805509,0.00005948716,0.00024818932,0.00012999844,0.0022899034,0.00007043809,0.0000064447654],"category_scores_gemma":[0.000079127305,0.00010677593,0.000060535134,0.00068753265,0.0001362794,0.0006265987,0.00041353452,0.0001527334,0.00003641443],"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.0000036957838,0.0006675273,0.00014145019,0.000013247656,0.000043815,0.000001498747,0.009303529,0.00090314134,0.09870637,0.8679502,0.015953531,0.0063119926],"study_design_scores_gemma":[0.0023581123,0.00015821475,0.00035426405,0.00006660598,0.000050294148,0.000030948908,0.0005151948,0.768106,0.047979508,0.062627815,0.11716482,0.0005882266],"about_ca_topic_score_codex":0.00016689606,"about_ca_topic_score_gemma":0.000090352565,"teacher_disagreement_score":0.8053224,"about_ca_system_score_codex":0.00003894643,"about_ca_system_score_gemma":0.00020258247,"threshold_uncertainty_score":0.4354196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074590035,0.000026675412,0.9186918,0.00038126454,0.00017519812,0.0003690949,0.000004411335,0.00011998339,0.005641543],"genre_scores_gemma":[0.7961495,0.0000014028254,0.2037295,0.00007373586,0.000017815446,0.000013746993,0.000001028634,0.000010505017,0.0000028110599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744445,0.00010295049,0.0005470681,0.00056997105,0.000864508,0.0004710264],"domain_scores_gemma":[0.9977422,0.00012626465,0.00018669413,0.0016506197,0.00015404551,0.00014017962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012149233,0.00022122395,0.0002939357,0.00015685036,0.00024735116,0.00016199061,0.0034701591,0.00007524928,0.0000345779],"category_scores_gemma":[0.00006096869,0.00015438139,0.00013232311,0.0015441757,0.0018869162,0.00044456148,0.0008880675,0.00020763082,0.00003115835],"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.0000016321454,0.00031656146,0.000021444259,0.00004326906,0.000004470376,0.0000047787416,0.005385306,0.0000384663,0.012852143,0.97885036,0.0000050956514,0.0024764938],"study_design_scores_gemma":[0.00022079344,0.00009372983,0.0006214363,0.00018620405,0.000014357933,0.000030786374,0.000055647746,0.6607698,0.07682328,0.26093838,0.000008844712,0.00023670933],"about_ca_topic_score_codex":0.000010272644,"about_ca_topic_score_gemma":0.0000036019385,"teacher_disagreement_score":0.7215594,"about_ca_system_score_codex":0.000054683827,"about_ca_system_score_gemma":0.00012667612,"threshold_uncertainty_score":0.69524217},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84716666,0.0014589322,0.12722947,0.0011728695,0.0036411448,0.0008412352,0.00018656321,0.00008468491,0.018218447],"genre_scores_gemma":[0.9921062,0.00017109766,0.0046381433,0.0018949201,0.00040333913,0.0000048394145,0.000013615687,0.000031310377,0.00073653646],"study_design_codex":"design_other","study_design_gemma":"case_report","domain_scores_codex":[0.99707925,0.00008316105,0.00066724594,0.0004926879,0.00043052924,0.0012470935],"domain_scores_gemma":[0.9970773,0.0001301178,0.00019874042,0.0004067612,0.0002189911,0.0019680937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009933913,0.0003123977,0.00030494976,0.00060081156,0.0006275118,0.00038785386,0.0013977587,0.00006194013,0.00036365617],"category_scores_gemma":[0.000060846865,0.0003495317,0.000116879695,0.00094855856,0.0001324174,0.00067426206,0.000082411636,0.00062055007,0.000033785982],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003505124,0.00013460452,0.0027223092,0.00008482785,0.00012648857,0.14695553,0.0065840348,0.00077857054,0.022072447,0.0038919058,0.026083875,0.7905303],"study_design_scores_gemma":[0.0034423296,0.000045294895,0.00084567297,0.00005230045,0.00008928276,0.64134395,0.000046972404,0.09041543,0.029706882,0.0027378125,0.22937126,0.0019027963],"about_ca_topic_score_codex":0.021724926,"about_ca_topic_score_gemma":0.2958184,"teacher_disagreement_score":0.78862756,"about_ca_system_score_codex":0.0019213768,"about_ca_system_score_gemma":0.0025085132,"threshold_uncertainty_score":0.9998957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09410189,0.0007413346,0.90387756,0.0010320249,0.00009312736,0.00012376836,8.450842e-7,0.000009015355,0.000020433752],"genre_scores_gemma":[0.9667048,0.00007824507,0.032970943,0.00006174163,0.00015720111,0.000011794232,0.0000079169995,0.000005775288,0.0000015773031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983035,0.000097761105,0.0004110991,0.00015970776,0.0008388508,0.00018913363],"domain_scores_gemma":[0.9978272,0.000184321,0.00020326847,0.00010653004,0.0016137908,0.0000649211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018801041,0.000071535236,0.00012278206,0.00012885766,0.000081370104,0.00010671338,0.0004507408,0.000062960644,0.0000028884485],"category_scores_gemma":[0.00003446557,0.00006421965,0.00005726501,0.00019229243,0.000035573696,0.0003541611,0.00003769096,0.00024534966,2.4181207e-7],"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.000020140447,0.00010558089,0.000033246928,0.00000264101,0.000045359207,4.033742e-7,0.00025715903,0.88630706,0.000035543297,0.0812486,0.0000063846687,0.03193789],"study_design_scores_gemma":[0.00038890282,0.0004560409,0.00018143098,0.000023359273,0.000024315996,0.000026545773,0.000022360278,0.80812377,0.0001048497,0.1905471,0.000048594935,0.00005276113],"about_ca_topic_score_codex":0.00002942461,"about_ca_topic_score_gemma":0.000023150744,"teacher_disagreement_score":0.87260294,"about_ca_system_score_codex":0.00010701326,"about_ca_system_score_gemma":0.00026777116,"threshold_uncertainty_score":0.26188013},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14747906,0.00004736263,0.8493657,0.00137394,0.000018659115,0.00014372323,0.000008930578,0.00007450424,0.001488082],"genre_scores_gemma":[0.8931495,0.000024774958,0.10617212,0.00002733663,0.000011393996,0.000037658676,0.0000040214873,0.000007013673,0.0005662056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941427,0.00001229149,0.0001860844,0.00015791236,0.00013790498,0.00009155624],"domain_scores_gemma":[0.9994333,0.00007761348,0.000073450516,0.0003263404,0.000044054537,0.000045281948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009508995,0.00007460802,0.00011332413,0.000068286354,0.00005737101,0.000031113188,0.00016897633,0.000028535736,0.000034175155],"category_scores_gemma":[0.000012338021,0.00005497145,0.00003764571,0.0001866685,0.000054870896,0.00020825648,0.000037212605,0.000026661628,0.0000947757],"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.0000012233185,0.00023562608,0.000017872986,0.00010223617,0.000020191539,0.0000034928341,0.0010324056,0.0000053655654,0.44242397,0.5417696,0.000055863362,0.01433213],"study_design_scores_gemma":[0.0021707315,0.000409386,0.011788103,0.00043286994,0.00018329937,0.0006125722,0.00014785586,0.21025129,0.071464464,0.6965559,0.0053291027,0.0006544016],"about_ca_topic_score_codex":0.0000018922127,"about_ca_topic_score_gemma":0.0000023805476,"teacher_disagreement_score":0.74567044,"about_ca_system_score_codex":0.000011564852,"about_ca_system_score_gemma":0.000011822091,"threshold_uncertainty_score":0.22416708},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23519914,0.00011422001,0.013432749,0.7378106,0.00026962796,0.0024493488,0.0002653483,0.00290572,0.0075532547],"genre_scores_gemma":[0.9705093,0.000031911186,0.027252726,0.00022739342,0.00013866599,0.00034355882,0.000055066965,0.00004494632,0.0013964239],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99701846,0.000018771318,0.00043152197,0.0010840384,0.00061437924,0.0008328109],"domain_scores_gemma":[0.9980456,0.00006373008,0.00027727516,0.0010917116,0.0002691063,0.00025256738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028192622,0.00036672698,0.00033403575,0.00012106407,0.00036824532,0.0003186528,0.0016940265,0.00007916807,0.00014284429],"category_scores_gemma":[0.000021554999,0.000245957,0.00009441489,0.0008526595,0.00012516399,0.001055262,0.00064849725,0.00014515704,0.00022137667],"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.000019199364,0.00023051232,0.0002783851,0.00002451215,0.00006444997,0.0000054772686,0.00015965097,0.0000010288326,0.38908607,0.059097707,0.5508541,0.00017893055],"study_design_scores_gemma":[0.0013459409,0.00030831704,0.00037083545,0.00008213901,0.000036685702,0.000018503746,0.00002888221,0.0035219097,0.34852102,0.00061114685,0.64466643,0.00048818073],"about_ca_topic_score_codex":0.000068116555,"about_ca_topic_score_gemma":0.00000804281,"teacher_disagreement_score":0.7375832,"about_ca_system_score_codex":0.000178621,"about_ca_system_score_gemma":0.00018576269,"threshold_uncertainty_score":0.9999993},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2514666,0.000074016745,0.74786186,0.000015548874,0.000026631526,0.00013786093,0.0000019090978,0.000060118848,0.00035544782],"genre_scores_gemma":[0.92437804,0.0000013423056,0.075534165,0.000013151427,0.00002462734,0.0000016490785,0.000017384778,0.000008167435,0.000021463155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991433,0.000034483834,0.00025010784,0.0002257001,0.00022717835,0.00011921694],"domain_scores_gemma":[0.9992211,0.00008391121,0.00013519957,0.00031228727,0.00017150478,0.00007602419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001852723,0.000092165166,0.000121117606,0.0000892501,0.000080452715,0.00005592164,0.00016375119,0.000052737014,0.0000019619224],"category_scores_gemma":[0.0000066871103,0.000098513985,0.000029092378,0.00024177699,0.000024497032,0.0006026166,0.0000890738,0.00004440213,0.0000033889132],"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.0000024937508,0.000023660827,0.000027717073,0.000011142261,0.0000022117524,2.6525748e-7,0.0006674482,0.99069476,0.004152802,0.0036226355,0.0000021611447,0.0007926774],"study_design_scores_gemma":[0.0002842256,0.000013972858,0.000010189429,0.000006698527,0.000009031508,4.0259403e-7,0.000026071128,0.9816183,0.0018462724,0.015960554,0.000121264464,0.00010303321],"about_ca_topic_score_codex":0.00005572628,"about_ca_topic_score_gemma":4.944001e-7,"teacher_disagreement_score":0.67291147,"about_ca_system_score_codex":0.0000312554,"about_ca_system_score_gemma":0.000038156017,"threshold_uncertainty_score":0.4017284},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02070585,0.000035441175,0.9769725,0.00025233545,0.0000056514095,0.0007524817,0.00000938733,0.00017461095,0.0010917401],"genre_scores_gemma":[0.7746879,0.000010444965,0.2244545,0.00015688359,0.000027312146,0.0004949504,0.000061771105,0.000009109398,0.0000971526],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988312,0.000022645545,0.00039143374,0.0004022038,0.00016412011,0.00018836885],"domain_scores_gemma":[0.9990894,0.000028057695,0.00013492843,0.00057960727,0.00011314431,0.000054857424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009549701,0.00012502576,0.00016575586,0.0001983218,0.00015241899,0.000027670874,0.0006606375,0.000059301157,0.0000061699366],"category_scores_gemma":[4.0404746e-7,0.00013601182,0.000066349516,0.0007825828,0.000068346824,0.0002547439,0.00015213496,0.000103291975,0.000073546034],"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.0000040028344,0.000798441,0.0009113967,0.000058776055,0.000020514706,0.0000014334875,0.0015372393,0.015114751,0.51263124,0.32484576,0.0024407213,0.14163575],"study_design_scores_gemma":[0.00044911515,0.000023325978,0.0112019,0.000008527572,0.0000067261717,0.000034004795,0.00000819503,0.9395391,0.0072878357,0.013329864,0.02788247,0.00022898868],"about_ca_topic_score_codex":0.000022927215,"about_ca_topic_score_gemma":0.000009534032,"teacher_disagreement_score":0.9244243,"about_ca_system_score_codex":0.000048657235,"about_ca_system_score_gemma":0.000087796136,"threshold_uncertainty_score":0.5546401},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98005533,0.00031765935,0.010277069,0.00051115284,0.0007678295,0.00019433037,0.0000052849673,0.00018376742,0.0076875566],"genre_scores_gemma":[0.9945254,0.000009301187,0.0051482646,0.00017166662,0.000013618813,0.000018959448,0.0000054321363,0.000010363098,0.000097007025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998993,0.000040248084,0.00023403575,0.00020208556,0.00022500294,0.00030565303],"domain_scores_gemma":[0.9990367,0.00007717668,0.0001051246,0.0006326458,0.00004212407,0.0001062285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019912802,0.00011596454,0.0001569602,0.00006161755,0.000054028445,0.00003889742,0.0007715283,0.00005471364,0.000028850412],"category_scores_gemma":[0.0000107498645,0.000115955176,0.00008071995,0.00027369717,0.000033330838,0.0004036598,0.00017129869,0.00010734179,0.00010325542],"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.0000016000846,0.00026885886,0.010202542,0.00001555694,0.000014989748,0.0000029063212,0.0003505038,4.374741e-7,0.0073422045,0.9787932,0.0013850675,0.0016221396],"study_design_scores_gemma":[0.0016922094,0.00033119367,0.35940334,0.000074001204,0.000048286132,0.00006057141,0.00008528093,0.0047508855,0.16918191,0.44662887,0.016824542,0.0009189223],"about_ca_topic_score_codex":0.000017219974,"about_ca_topic_score_gemma":0.0000010466009,"teacher_disagreement_score":0.53216434,"about_ca_system_score_codex":0.000023545914,"about_ca_system_score_gemma":0.000052207826,"threshold_uncertainty_score":0.47285149},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97125775,0.00022106916,0.01322299,0.0015709319,0.001239648,0.000368133,7.556464e-7,0.0005619182,0.0115567865],"genre_scores_gemma":[0.9941929,0.000006007671,0.0052522672,0.00015803274,0.0000032896094,0.00006659807,0.0000029688674,0.0000065088857,0.00031143616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927634,0.000018774686,0.00013490711,0.00023442139,0.00013980822,0.00019572121],"domain_scores_gemma":[0.99916005,0.000049821952,0.00004184317,0.0006055648,0.000056425917,0.00008631675],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008415668,0.00008404764,0.00008840098,0.00005314208,0.00012288806,0.00017135186,0.00069253525,0.000037646965,0.00006884512],"category_scores_gemma":[0.000009923788,0.00008047434,0.0000511292,0.00033128986,0.000025973193,0.00037011402,0.00016865619,0.00008018522,0.0012343315],"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":[9.822291e-8,0.000038312483,0.00042415093,0.0000021422088,0.0000044026438,0.0000012149612,0.00008794416,0.0000010010438,0.002291708,0.98534864,0.0048122853,0.006988093],"study_design_scores_gemma":[0.0002738967,0.000016203405,0.007011238,0.0000047134354,0.0000028332734,0.0000060588973,0.000010094645,0.012309471,0.0055337045,0.96925795,0.0054320195,0.00014182407],"about_ca_topic_score_codex":0.000054298118,"about_ca_topic_score_gemma":6.4396176e-7,"teacher_disagreement_score":0.022935122,"about_ca_system_score_codex":0.000014365003,"about_ca_system_score_gemma":0.000021568192,"threshold_uncertainty_score":0.9995433},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.973788,0.000037961323,0.014664581,0.00080612535,0.0005022406,0.00017015645,0.0000014090894,0.00010939297,0.009920125],"genre_scores_gemma":[0.9987549,0.0000024241153,0.001024612,0.00011247037,0.0000028359736,0.000020008509,0.0000021349802,0.0000062178824,0.00007438669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991673,0.00005194231,0.00019038894,0.0002401159,0.00018544593,0.00016477058],"domain_scores_gemma":[0.9990206,0.00015962958,0.00007473437,0.0006561717,0.00003467576,0.000054220145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002456368,0.000086998945,0.00015417159,0.0000907968,0.000035784848,0.000027440292,0.0006233596,0.00004857319,0.000006307272],"category_scores_gemma":[0.00004071996,0.000086366104,0.00004101702,0.0003932299,0.000034860055,0.00008257346,0.00007091639,0.000099499965,0.000072791794],"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.0000015505648,0.00015041429,0.0006840182,0.000005766712,0.000002996748,9.628786e-7,0.00014155969,0.00002541833,0.005368642,0.9914804,0.00047179445,0.0016664445],"study_design_scores_gemma":[0.00097223703,0.00013993119,0.014736851,0.00004593423,0.0000037975838,0.0000026361552,0.0000070389087,0.022429949,0.03709481,0.9199662,0.0044092955,0.00019127976],"about_ca_topic_score_codex":0.000025846935,"about_ca_topic_score_gemma":0.0000052959376,"teacher_disagreement_score":0.07151419,"about_ca_system_score_codex":0.00002772435,"about_ca_system_score_gemma":0.00002916286,"threshold_uncertainty_score":0.35219076},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71477807,0.00016577776,0.2750852,0.0015680653,0.0015740495,0.00035248033,0.000010588081,0.0004239252,0.006041828],"genre_scores_gemma":[0.9972447,0.000003012772,0.0025598102,0.000049362705,0.0000058824694,0.000010613073,0.000026846705,0.0000060451093,0.00009369479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926966,0.000052319545,0.00017906698,0.00019865873,0.00016977664,0.00013052269],"domain_scores_gemma":[0.99915093,0.00006727247,0.00009230189,0.0005719257,0.000065387474,0.000052205716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017772146,0.00007838458,0.000119815064,0.000050940755,0.00007405845,0.000043856166,0.000552276,0.00004700593,0.0000055751875],"category_scores_gemma":[0.000022128308,0.0000799224,0.000036525234,0.0002944259,0.00002787102,0.00017088691,0.00007441208,0.00006599985,0.000056825233],"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":[8.3790036e-7,0.00006079847,0.0004362133,0.0000061575665,0.0000054646944,5.068021e-7,0.00011878083,0.000011514259,0.0041257218,0.99044776,0.0014405678,0.0033456667],"study_design_scores_gemma":[0.0010606098,0.0001269679,0.010629856,0.000025606232,0.000016017984,0.00000849172,0.000015601683,0.06929219,0.054655027,0.8451579,0.018711332,0.0003003617],"about_ca_topic_score_codex":0.000036045516,"about_ca_topic_score_gemma":0.000005691141,"teacher_disagreement_score":0.28246665,"about_ca_system_score_codex":0.000014378184,"about_ca_system_score_gemma":0.000031357606,"threshold_uncertainty_score":0.32591408},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43857458,0.0013127406,0.52418196,0.025287746,0.00021549815,0.00068983063,0.000035307097,0.001389682,0.008312653],"genre_scores_gemma":[0.84185797,0.00018064039,0.15519793,0.0021784785,0.000074461655,0.00008850316,0.0002734191,0.000028847995,0.00011974502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99835545,0.00019895812,0.0003635804,0.00038197928,0.00026756775,0.0004324745],"domain_scores_gemma":[0.99806345,0.00016042023,0.00020812535,0.0012618449,0.000019789093,0.0002864037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001721894,0.00022052691,0.00026347628,0.00009514345,0.0003718577,0.00016173333,0.0009730573,0.000050346996,0.00020634678],"category_scores_gemma":[0.000012350347,0.00023329968,0.000064976884,0.000759571,0.00020505128,0.0038767012,0.0009204381,0.00017614274,0.00019435093],"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.000014175008,0.0007632899,0.23387401,0.000052796957,0.00013518588,0.000014584926,0.0048503624,0.00001494717,0.0036455316,0.5421432,0.05595184,0.15854004],"study_design_scores_gemma":[0.0018036894,0.00023806834,0.49583516,0.00008216253,0.00014841638,0.00016014582,0.0017862143,0.19805302,0.020898914,0.033745687,0.2449579,0.0022906307],"about_ca_topic_score_codex":0.003920926,"about_ca_topic_score_gemma":0.000010582481,"teacher_disagreement_score":0.5083975,"about_ca_system_score_codex":0.000036697416,"about_ca_system_score_gemma":0.00005119421,"threshold_uncertainty_score":0.9513685},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13308904,0.00019456775,0.8633921,0.0013371833,0.0012071228,0.00006514018,0.0000046467903,0.00002444046,0.00068574504],"genre_scores_gemma":[0.8511864,0.000031322714,0.1484303,0.00007826379,0.00022509201,0.0000011407224,0.000017230775,0.000005510242,0.000024755764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781567,0.000037248683,0.0008602945,0.0001819263,0.0009697532,0.00013509889],"domain_scores_gemma":[0.9978934,0.000072920615,0.00090467714,0.00019924616,0.0008797838,0.000049950973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047984236,0.000114634764,0.00017543812,0.00016763461,0.000078925594,0.00007466411,0.0012888097,0.00003648333,0.00009537319],"category_scores_gemma":[0.000057796067,0.00011188418,0.00021024176,0.00020229774,0.00005160736,0.00063670723,0.00023890728,0.00012958585,0.00003264019],"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.00001997722,0.00066918024,0.00023729897,0.000028480132,0.0002988219,0.000049430044,0.0010555753,0.011120931,0.12581913,0.8338984,0.00054037414,0.026262403],"study_design_scores_gemma":[0.0040672733,0.00039909285,0.004751599,0.0008317785,0.0000648999,0.0005470154,0.0003019179,0.10421606,0.42389542,0.45463404,0.005735229,0.00055566407],"about_ca_topic_score_codex":0.000022918503,"about_ca_topic_score_gemma":0.0000011760512,"teacher_disagreement_score":0.7180973,"about_ca_system_score_codex":0.00007487796,"about_ca_system_score_gemma":0.00022296185,"threshold_uncertainty_score":0.45625046},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7647784,0.0005538296,0.2229797,0.005437491,0.0015457121,0.0014351199,0.000013441362,0.00046046948,0.0027958965],"genre_scores_gemma":[0.99595314,0.000002406712,0.0034519427,0.000120570745,0.000011736941,0.00020445551,0.000004766886,0.000011882497,0.00023908816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991585,0.000026059606,0.000111602436,0.00026971515,0.00020400628,0.00023010683],"domain_scores_gemma":[0.9987328,0.00030586778,0.00006348531,0.0006729044,0.00012313222,0.00010183114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030474403,0.00010948811,0.00011669305,0.000034906534,0.00018193024,0.00014620538,0.00077871786,0.000038575323,0.0000026383561],"category_scores_gemma":[0.000041442046,0.00007470338,0.00005478953,0.00034065355,0.00006575354,0.00023136631,0.00012416799,0.00007575442,0.00003760591],"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.000011033236,0.00009609767,0.0008035456,0.0000052898463,0.000022607132,0.0000023216846,0.00035896842,0.000011512964,0.0001682978,0.98627603,0.01019823,0.0020460533],"study_design_scores_gemma":[0.0041925837,0.0007440419,0.007791563,0.000028139384,0.00005851333,0.000048831793,0.00031942845,0.08351503,0.013448596,0.8228481,0.06640024,0.0006049653],"about_ca_topic_score_codex":0.0000460654,"about_ca_topic_score_gemma":0.000025202671,"teacher_disagreement_score":0.2311748,"about_ca_system_score_codex":0.000026662325,"about_ca_system_score_gemma":0.00011444706,"threshold_uncertainty_score":0.30463153},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008903338,0.000015765369,0.9821634,0.000368381,0.00025149703,0.0007291197,0.000007527039,0.0003053343,0.0072555835],"genre_scores_gemma":[0.53234535,9.734435e-7,0.46744707,0.00007674583,0.00004686321,0.00006304872,0.0000023759108,0.000009346946,0.00000821318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769807,0.0000417758,0.0003832151,0.0008297035,0.00048882136,0.00055839925],"domain_scores_gemma":[0.9978749,0.00023137787,0.00013661994,0.001226905,0.00030361995,0.00022656561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011131472,0.00023104096,0.0002520964,0.00016213964,0.0005708351,0.00037048114,0.002344387,0.00004255014,0.000023216215],"category_scores_gemma":[0.00008029547,0.00018843939,0.00013286501,0.00086447824,0.0012195259,0.00061286584,0.00070848264,0.00012193262,0.00007393613],"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.0000034179448,0.00016024579,0.0000069276907,0.00002627295,0.000007882677,0.000001750393,0.002251038,0.000008377341,0.0021396428,0.9923922,0.000055875815,0.002946389],"study_design_scores_gemma":[0.0001371582,0.00011949323,0.0001594588,0.000026031867,0.000012722877,0.00004014114,0.000021914786,0.51374316,0.025474297,0.4599746,0.00006460341,0.00022641227],"about_ca_topic_score_codex":0.0000024201895,"about_ca_topic_score_gemma":5.372942e-7,"teacher_disagreement_score":0.5324176,"about_ca_system_score_codex":0.000043948552,"about_ca_system_score_gemma":0.000103098675,"threshold_uncertainty_score":0.7684335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5918509,0.0009979107,0.39641416,0.0011758168,0.0009582083,0.00056242,0.000019801588,0.00027786326,0.007742904],"genre_scores_gemma":[0.9902874,0.000043420212,0.009177221,0.00017552846,0.000094837655,0.000011408833,0.0000061574156,0.0000413707,0.0001626466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963701,0.0002770477,0.0012807517,0.00041134586,0.0011764687,0.00048432263],"domain_scores_gemma":[0.9956662,0.00025821017,0.0013093479,0.0021667255,0.0003467716,0.00025275027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001657471,0.0003619467,0.0005904174,0.00037398867,0.00023356013,0.00014206879,0.0036625136,0.00016943857,0.00018024008],"category_scores_gemma":[0.00012316952,0.00025939805,0.0005552828,0.0007784253,0.00019122192,0.00057768775,0.00040745363,0.00053867506,0.00019306202],"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.0000607371,0.0034624483,0.0009939369,0.0002048212,0.00056542613,0.0011076445,0.0044274777,0.00018993796,0.35584852,0.61355084,0.010807877,0.008780351],"study_design_scores_gemma":[0.0030011504,0.0015451051,0.013951688,0.00051192165,0.00056190894,0.0009909399,0.00037236168,0.057975866,0.8454235,0.066190176,0.008184076,0.0012912595],"about_ca_topic_score_codex":0.00003205311,"about_ca_topic_score_gemma":9.659185e-7,"teacher_disagreement_score":0.54736066,"about_ca_system_score_codex":0.00007681091,"about_ca_system_score_gemma":0.00026350946,"threshold_uncertainty_score":0.9999858},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98944956,0.00009771943,0.007892808,0.0014196147,0.0003995703,0.0004171684,0.00003158358,0.0000452315,0.00024674728],"genre_scores_gemma":[0.9827406,5.051287e-7,0.017108351,0.000044717824,0.000008819521,0.000046885183,0.000020570018,0.000007029304,0.000022519844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990139,0.00003459118,0.00030796896,0.00020606077,0.00024132588,0.00019612368],"domain_scores_gemma":[0.99879324,0.0002701528,0.000114624476,0.0005332872,0.00022621917,0.000062471074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032538772,0.000086399705,0.00014812438,0.000036593046,0.00009380644,0.000036228394,0.0006166281,0.000034723667,0.000006938982],"category_scores_gemma":[0.00016725496,0.00006660267,0.000067167646,0.00032099997,0.000085802705,0.0001890486,0.00025632905,0.00006615721,0.0000018824619],"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.000009979343,0.00006132134,0.0047130617,0.000049456394,0.000019502491,8.521822e-7,0.0018335783,0.000004299056,0.0013906773,0.98764384,0.002648789,0.001624662],"study_design_scores_gemma":[0.0017054385,0.00034735404,0.008071379,0.000041458276,0.000038869788,0.000009877132,0.0010569358,0.12104724,0.010010925,0.85543233,0.0020190484,0.00021916059],"about_ca_topic_score_codex":0.000099542725,"about_ca_topic_score_gemma":0.000012084026,"teacher_disagreement_score":0.1322115,"about_ca_system_score_codex":0.000016953232,"about_ca_system_score_gemma":0.000057866273,"threshold_uncertainty_score":0.2715978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01756569,0.0012176125,0.979917,0.00029193453,0.00012276457,0.00046179674,0.000011149767,0.00013243464,0.00027961648],"genre_scores_gemma":[0.5551688,0.0000927366,0.4442724,0.000052006373,0.000064002896,0.00010301516,0.000022405886,0.0000069904313,0.00021761186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898374,0.000031854335,0.00020255923,0.0003925059,0.00017553178,0.0002138016],"domain_scores_gemma":[0.999273,0.00007109875,0.00008240045,0.00022659241,0.0002451683,0.0001017611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000054241158,0.0001324437,0.00012736581,0.00007092157,0.0002630544,0.00014972204,0.00025060735,0.000046413163,0.0000072839566],"category_scores_gemma":[0.0000032377525,0.00012265595,0.000023260533,0.00023235042,0.00007041574,0.00012963195,0.000067569184,0.00004626747,0.00002581125],"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.000013599067,0.00012230003,0.0023396614,0.00005287304,0.00005305719,0.000019096402,0.000405528,0.052145086,0.00026040588,0.029196225,0.0017674139,0.91362476],"study_design_scores_gemma":[0.00034462026,0.000115492025,0.06625418,0.000013806953,0.000012695371,0.0002461283,0.00003313571,0.92186594,0.000005388371,0.004798381,0.0061396617,0.00017058443],"about_ca_topic_score_codex":0.000037700618,"about_ca_topic_score_gemma":0.0000030259741,"teacher_disagreement_score":0.9134542,"about_ca_system_score_codex":0.000024464438,"about_ca_system_score_gemma":0.00014652066,"threshold_uncertainty_score":0.5001765},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019034251,0.0002504816,0.16720447,0.00024481406,0.00015267609,0.0022081053,0.00014166354,0.0005161886,0.82909125],"genre_scores_gemma":[0.018646047,0.00018041683,0.21838987,0.00032353343,0.00091761246,0.00066904345,0.0004535819,0.00040052485,0.76001936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802184,0.000002355963,0.000633556,0.00070606434,0.00030204878,0.00033411285],"domain_scores_gemma":[0.9985474,0.00014190067,0.0004091928,0.00070448307,0.00005050214,0.00014651773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032812927,0.00049633795,0.0005963758,0.00005718876,0.000381574,0.00025582238,0.00047729787,0.00086490915,0.000009640144],"category_scores_gemma":[0.0000025823645,0.00046879312,0.00037237455,0.000023452003,0.00024246438,0.000078013356,0.00044507347,0.0004633653,0.00001159555],"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.0000019026975,0.000018803916,1.3686736e-8,0.00010881803,0.00011546683,9.4507965e-7,0.0005037894,0.0000081240505,0.00046889688,0.98190147,0.0030780458,0.013793748],"study_design_scores_gemma":[0.0011983012,0.0000384173,4.3410054e-8,0.000112961134,0.00020238195,0.000017383843,0.000029859923,0.050828904,0.00070675055,0.8845198,0.061741047,0.0006041575],"about_ca_topic_score_codex":0.0000030951715,"about_ca_topic_score_gemma":5.2646266e-7,"teacher_disagreement_score":0.09738165,"about_ca_system_score_codex":0.000032315747,"about_ca_system_score_gemma":0.00006505195,"threshold_uncertainty_score":0.99977636},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073735365,0.0013502594,0.9886913,0.0012565958,0.00030904962,0.0006361352,0.000043537773,0.00012716073,0.00021245061],"genre_scores_gemma":[0.99484795,0.00004899432,0.0042560045,0.00010032819,0.00008480753,0.00017917535,0.000005290298,0.000009789569,0.00046762952],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989314,0.000042537013,0.00041767882,0.00028334864,0.0001359596,0.00018908881],"domain_scores_gemma":[0.99878037,0.00026224108,0.00017102827,0.0004906634,0.00014810632,0.00014762075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003299666,0.00011499331,0.0002363324,0.00008938763,0.00011380524,0.00010798307,0.00040929843,0.000051337578,0.000003569533],"category_scores_gemma":[0.000097763805,0.000079263555,0.00007706914,0.00013261047,0.000091980546,0.00026172746,0.00006539238,0.000029816983,0.000031228876],"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.000009751816,0.00009806415,0.00041566143,0.00022488812,0.000107993554,0.0000012453168,0.0002969427,0.000046112375,0.5359813,0.43979332,0.0037498577,0.01927486],"study_design_scores_gemma":[0.0020508396,0.0001731989,0.00028956152,0.0003043981,0.000073146664,0.000013068634,0.00012371522,0.82557935,0.045968242,0.0068684504,0.11811401,0.00044202275],"about_ca_topic_score_codex":0.000033828062,"about_ca_topic_score_gemma":0.0000014490263,"teacher_disagreement_score":0.98747444,"about_ca_system_score_codex":0.000015636313,"about_ca_system_score_gemma":0.00006211879,"threshold_uncertainty_score":0.3232274},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011459719,0.00020524932,0.40386665,0.000049034545,0.00059815345,0.0005260636,0.000053493564,0.0003446399,0.5942421],"genre_scores_gemma":[0.5425751,4.6339807e-7,0.2062386,0.0004850366,0.0009237087,0.00007417397,0.000046387424,0.00010850142,0.249548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784464,0.0000065735944,0.00038619898,0.0009568632,0.00037241392,0.00043331986],"domain_scores_gemma":[0.99820054,0.000042672174,0.00034175735,0.0010104664,0.00023598794,0.00016858421],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002547892,0.00035218208,0.00031513293,0.000079606056,0.00068488513,0.0011558288,0.001534186,0.00025080194,0.0000060013317],"category_scores_gemma":[0.00000615848,0.00036395062,0.00022136106,0.000048367474,0.00018782918,0.00010740595,0.0004999962,0.00030770694,0.0001752629],"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.0000010977212,0.000011854823,8.3780503e-7,0.000061559746,0.000006912305,0.0000049148907,0.00008545915,0.0000057904226,0.002147836,0.95535237,0.000886033,0.04143535],"study_design_scores_gemma":[0.00054983824,0.000034388853,0.000004696367,0.00018224925,0.00005540705,0.00005248113,0.000003796759,0.030513817,0.0061819423,0.67412746,0.28748158,0.0008123599],"about_ca_topic_score_codex":0.00001037217,"about_ca_topic_score_gemma":0.000019792042,"teacher_disagreement_score":0.54246056,"about_ca_system_score_codex":0.000089726265,"about_ca_system_score_gemma":0.00042672668,"threshold_uncertainty_score":0.99988127},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01233522,0.00009357827,0.98357904,0.0022050163,0.00010310514,0.000596276,0.000034759923,0.00021044246,0.00084254926],"genre_scores_gemma":[0.99675065,0.000021540243,0.0022196153,0.00009370783,0.00003212695,0.00071575376,0.00008185019,0.0000038937646,0.00008088373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919134,0.000034046592,0.00023605405,0.00016246388,0.00017473061,0.00020136131],"domain_scores_gemma":[0.9994702,0.0000481826,0.00006978177,0.00028252506,0.000049573955,0.000079765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020788831,0.00008118418,0.00008961837,0.00012224675,0.000079916696,0.00017662672,0.00026741464,0.000038590944,0.000006031841],"category_scores_gemma":[0.000023296478,0.00006251299,0.00001549213,0.0002710836,0.000036419144,0.0016075657,0.000110740184,0.00002934435,0.00005237773],"study_design_candidate":"design_other","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.0000035537084,0.000079163045,0.0026846174,0.00007013997,0.000014405226,0.000004043668,0.00023792985,0.0002880422,0.00035977882,0.28651142,0.003517874,0.70622903],"study_design_scores_gemma":[0.00095421996,0.0000077608875,0.44530356,0.000026734615,0.0000054449556,0.00002611922,0.000011507823,0.4743585,0.0003403846,0.0013220828,0.07738322,0.00026047425],"about_ca_topic_score_codex":0.000014686023,"about_ca_topic_score_gemma":0.0000030282513,"teacher_disagreement_score":0.9844154,"about_ca_system_score_codex":0.00007347644,"about_ca_system_score_gemma":0.000022685217,"threshold_uncertainty_score":0.2549206},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5133302,0.00004377737,0.4002543,0.00060566986,0.000036883433,0.00028737864,0.00001334026,0.0002618717,0.085166536],"genre_scores_gemma":[0.8426659,0.000013983279,0.15373363,0.00009006455,0.0000058897513,3.126378e-7,0.0000278337,0.000011095843,0.0034512882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991942,0.0000351382,0.000106475934,0.00029204375,0.00017491753,0.00019721761],"domain_scores_gemma":[0.99905825,0.00007635592,0.000106618754,0.0006138914,0.000025747055,0.00011912953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004310113,0.00011246408,0.00015923662,0.000092995084,0.00016220422,0.000039035673,0.0015353067,0.000037500973,0.0005064971],"category_scores_gemma":[0.0000020132395,0.00011536082,0.000054714365,0.0002577526,0.00009595685,0.0011861884,0.0005534689,0.000076984885,0.00005842284],"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.000600152,0.002695702,0.06859885,0.00029463624,0.0009844097,0.0005605238,0.08019778,0.0013055811,0.014312166,0.7670389,0.048489854,0.014921451],"study_design_scores_gemma":[0.012367495,0.001870723,0.16466554,0.00049903215,0.00036490388,0.00017419906,0.0066805766,0.3668484,0.26004273,0.06297277,0.119623534,0.0038901032],"about_ca_topic_score_codex":0.0014981257,"about_ca_topic_score_gemma":0.00046720786,"teacher_disagreement_score":0.7040661,"about_ca_system_score_codex":0.000010402133,"about_ca_system_score_gemma":0.000099202145,"threshold_uncertainty_score":0.55457884},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007005505,0.0000814849,0.92104286,0.00069802906,0.00018053051,0.00036541116,0.0000044066937,0.00053352903,0.076393194],"genre_scores_gemma":[0.26406088,0.000013519763,0.7315703,0.0005489941,0.000042847558,0.00023379958,0.000034776604,0.00001911465,0.0034757818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890935,0.00002939545,0.00022971752,0.00040090564,0.0001292026,0.00030144368],"domain_scores_gemma":[0.9987927,0.00008956984,0.000060501934,0.0008735245,0.00007604724,0.00010763665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002971676,0.00012926776,0.00013677204,0.00009797789,0.00019480393,0.00016991161,0.00063428783,0.000055883494,0.00014168052],"category_scores_gemma":[0.00003248459,0.000117002906,0.00013651323,0.0004685831,0.000025414505,0.00025190497,0.00001589237,0.000055525383,0.00017938484],"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":[9.4290294e-7,0.00010004959,0.000023067165,0.000012669163,0.000013068465,9.930646e-7,0.00006000913,0.000011729615,0.13110083,0.8513947,0.012016844,0.0052650576],"study_design_scores_gemma":[0.0004417392,0.00003588461,0.000031173775,0.0000044578624,0.000007669714,0.0000087405115,0.000020206071,0.014436148,0.38325423,0.044873778,0.55665237,0.00023359402],"about_ca_topic_score_codex":0.000010363704,"about_ca_topic_score_gemma":0.0000034675809,"teacher_disagreement_score":0.80652094,"about_ca_system_score_codex":0.00001099034,"about_ca_system_score_gemma":0.000045309265,"threshold_uncertainty_score":0.477124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023796612,0.00008936055,0.9909118,0.0006044429,0.000023467921,0.000066870925,0.0000055791124,0.000077808036,0.0058410224],"genre_scores_gemma":[0.98421526,0.000016026983,0.015208651,0.00009154045,0.00001203927,0.0000095406895,0.0000011824818,0.0000016272031,0.0004441591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950874,0.000020802301,0.00012737738,0.00013839408,0.00012255415,0.000082131344],"domain_scores_gemma":[0.9993198,0.00010041273,0.000060128576,0.0004568589,0.000042267537,0.000020543388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114033355,0.00004125658,0.00009644252,0.000070018265,0.00011071088,0.000021333226,0.0004895132,0.000015179159,0.00005794573],"category_scores_gemma":[0.000011446984,0.000027526015,0.00006797318,0.0010861284,0.000029058307,0.00010235811,0.00008784379,0.000039584174,0.000031529486],"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":[8.879743e-7,0.00018872385,0.00069390365,0.000012849708,0.0006716188,0.000002788912,0.0033603504,0.0122151,0.004613512,0.9680765,0.0020758659,0.00808786],"study_design_scores_gemma":[0.000047638976,0.000005174497,0.0012792192,0.0000026676214,0.00007769318,0.0000012849615,0.000032561402,0.99596953,0.0012158048,0.00010776067,0.0012275616,0.000033112014],"about_ca_topic_score_codex":0.00003303419,"about_ca_topic_score_gemma":0.0000055432715,"teacher_disagreement_score":0.9837544,"about_ca_system_score_codex":0.000009420853,"about_ca_system_score_gemma":0.0000047666117,"threshold_uncertainty_score":0.11224783},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19245258,0.00022202038,0.8044269,0.0018707067,0.000018618086,0.0003125853,0.00008484072,0.00008714059,0.00052456616],"genre_scores_gemma":[0.9921058,0.00014119314,0.007229282,0.000077841265,0.000022000888,0.00011736211,0.000012508344,0.000008603256,0.00028540526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913335,0.000016750962,0.00031660977,0.0002677429,0.00013391982,0.00013164358],"domain_scores_gemma":[0.9989433,0.00011069483,0.00015361956,0.00060341286,0.000112618996,0.0000763192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008971436,0.00009649821,0.00015898937,0.000073807845,0.000060843675,0.000010987652,0.00044429256,0.000051482697,0.000024894194],"category_scores_gemma":[0.000016556274,0.00006968465,0.0000478903,0.00029869954,0.000048427886,0.00015307656,0.00017017248,0.000039195835,0.000038990867],"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.0000028584486,0.00018781905,0.00095259474,0.00006497249,0.000028044058,3.1332965e-7,0.00021674483,0.0000025356815,0.21466497,0.68167144,0.0003755779,0.10183215],"study_design_scores_gemma":[0.002056141,0.00025547112,0.04536613,0.00020471607,0.000093919036,0.00003570172,0.00005127714,0.022257473,0.77696407,0.050685503,0.10119896,0.00083064],"about_ca_topic_score_codex":0.000010996716,"about_ca_topic_score_gemma":0.0000034638288,"teacher_disagreement_score":0.79965323,"about_ca_system_score_codex":0.000005994086,"about_ca_system_score_gemma":0.000031671716,"threshold_uncertainty_score":0.28416574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86937183,0.00024307016,0.115807615,0.005207659,0.0041942443,0.0004040378,0.0000044291974,0.00038565372,0.0043814555],"genre_scores_gemma":[0.9967595,0.0000050832527,0.0028973587,0.00008035266,0.000010834975,0.000014200209,3.3845572e-7,0.000005836268,0.00022654985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924827,0.000042172156,0.00016844271,0.0001794628,0.00018974664,0.00017191046],"domain_scores_gemma":[0.99896663,0.0001165739,0.00012335229,0.0007200121,0.000036993326,0.000036444006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019668925,0.00006928517,0.000088016655,0.000015272706,0.00011102381,0.000026740585,0.0011121541,0.000027854127,0.000011066854],"category_scores_gemma":[0.000021380285,0.000039479786,0.0000621592,0.0002852466,0.000054174492,0.00014783243,0.0003772688,0.000047147358,0.000033810342],"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":[2.3280315e-7,0.000025742142,0.002531718,0.0000017411586,0.000005782741,6.0322003e-7,0.000036266116,0.0000052872615,0.005654467,0.9804499,0.0015292161,0.009759053],"study_design_scores_gemma":[0.00048940146,0.000028396424,0.021893864,0.000056453027,0.0000057435577,0.0000074650666,0.0000018689557,0.0063128406,0.012087149,0.9510708,0.007929373,0.00011664634],"about_ca_topic_score_codex":0.000015179953,"about_ca_topic_score_gemma":0.000002063614,"teacher_disagreement_score":0.12738761,"about_ca_system_score_codex":0.0000220951,"about_ca_system_score_gemma":0.000023009774,"threshold_uncertainty_score":0.20666775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9754182,0.00011904093,0.019093422,0.0013508654,0.0006832013,0.00020023977,0.0000039422557,0.00046296767,0.0026681165],"genre_scores_gemma":[0.99744207,0.000025247165,0.0023579872,0.000042911204,0.0000015889931,0.000016120222,0.0000016368092,0.000008778849,0.00010368742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991069,0.000037989448,0.000208443,0.0002729784,0.0001805584,0.0001931372],"domain_scores_gemma":[0.9988181,0.00015628386,0.00010256538,0.00078457815,0.000059096274,0.000079370155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012384284,0.000104818195,0.00014698945,0.00008083058,0.00007676278,0.000031443742,0.00088509155,0.000046065896,0.000013573749],"category_scores_gemma":[0.000023318084,0.00007518338,0.000072478964,0.0004149471,0.000041097443,0.0003053528,0.00021032197,0.000053326185,0.000100517726],"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":[6.2493376e-7,0.00010438524,0.0007985063,0.000005289958,0.000016166068,0.0000015198647,0.00017255143,5.683899e-8,0.011565249,0.9767667,0.00036456654,0.010204368],"study_design_scores_gemma":[0.00088694645,0.00006028411,0.007378621,0.000031722488,0.000011947773,0.0000066389534,0.000007655779,0.0020731583,0.027924208,0.9570274,0.004389244,0.00020218438],"about_ca_topic_score_codex":0.000019338162,"about_ca_topic_score_gemma":0.0000021052672,"teacher_disagreement_score":0.022023838,"about_ca_system_score_codex":0.000023780076,"about_ca_system_score_gemma":0.00004366767,"threshold_uncertainty_score":0.30658895},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10211681,0.00018280388,0.8876466,0.0030765182,0.00015771766,0.0002629431,0.000014325415,0.00035459787,0.0061876737],"genre_scores_gemma":[0.9322574,0.0000032469654,0.06603819,0.00066678814,0.000074043724,0.000059913687,0.0001302772,0.000012364925,0.00075776613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861056,0.00002995015,0.0002681653,0.0004109444,0.00039407448,0.00028629726],"domain_scores_gemma":[0.9990021,0.00012826425,0.00009349605,0.00048272943,0.00012265038,0.00017077755],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000109451124,0.00015188019,0.00014587582,0.0002347391,0.00020693899,0.0002951823,0.00077982305,0.000050525756,0.00040880666],"category_scores_gemma":[0.000021151005,0.00014619117,0.0001038133,0.0010053238,0.00006456744,0.0006012747,0.00022916721,0.00013157076,0.0025473703],"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.0000020711138,0.00017911704,0.0033780395,0.000026998478,0.0000798085,0.000017287355,0.00037592486,0.012783063,0.0014415232,0.8954113,0.026117243,0.06018764],"study_design_scores_gemma":[0.0004723998,0.000050823048,0.22301403,0.00001945524,0.00001206346,0.00007597573,0.00005947142,0.62927,0.00038027836,0.13064356,0.0154586695,0.0005432827],"about_ca_topic_score_codex":0.00007020719,"about_ca_topic_score_gemma":7.049422e-7,"teacher_disagreement_score":0.8301406,"about_ca_system_score_codex":0.00003404972,"about_ca_system_score_gemma":0.00007600182,"threshold_uncertainty_score":0.99822927},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015823638,0.00027077706,0.064444795,0.0025526846,0.00015064061,0.00045347138,0.000035664238,0.0007135291,0.9313626],"genre_scores_gemma":[0.0012893005,0.0001011602,0.013510518,0.0005242781,0.00028921507,0.00006930015,0.000028626797,0.00009687252,0.98409075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788004,0.000021032134,0.00052621745,0.0006601736,0.000588202,0.00032433675],"domain_scores_gemma":[0.997764,0.00029487096,0.00019746271,0.0015202748,0.00002047314,0.00020294142],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011083571,0.00040629136,0.00046905666,0.00012440298,0.00009046949,0.00035492578,0.0023379556,0.00022817565,0.002246153],"category_scores_gemma":[0.000007612529,0.00028597802,0.00028190314,0.000048164657,0.00014704114,0.0005765441,0.0016115176,0.0002513684,0.0077660717],"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.0000011520295,0.00006772571,0.0000021648198,0.000057856574,0.00004671145,0.000030645333,0.00013686228,3.397186e-8,0.000023753364,0.97767264,0.015638033,0.0063224207],"study_design_scores_gemma":[0.00011277153,0.000030783813,0.000016325303,0.00021970808,0.000022258031,0.000018168861,0.0000030029062,0.00014148085,0.000074325355,0.74308646,0.2559578,0.00031691234],"about_ca_topic_score_codex":4.4039353e-8,"about_ca_topic_score_gemma":4.8871378e-8,"teacher_disagreement_score":0.24031979,"about_ca_system_score_codex":0.00002214666,"about_ca_system_score_gemma":0.00007208969,"threshold_uncertainty_score":0.99995923},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022527238,0.0024778596,0.8166335,0.00042878196,0.00063470454,0.0023524747,0.00009571791,0.0004374652,0.17671423],"genre_scores_gemma":[0.0071539516,0.002406973,0.7319075,0.00041266196,0.00027567468,0.0012801595,0.00010165826,0.00018800968,0.2562734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976137,0.000010142293,0.0007929238,0.0007624368,0.00038892095,0.00043182058],"domain_scores_gemma":[0.9970711,0.0008644916,0.00048091478,0.0013304978,0.00019544945,0.00005753316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022127648,0.0005345068,0.0007929748,0.00016756677,0.0002077579,0.000058476315,0.0010637966,0.00018323072,0.000008038256],"category_scores_gemma":[0.00012746103,0.0005053259,0.00019210343,0.00011282471,0.00021927083,0.00016855513,0.0004230016,0.00029026472,0.00007695286],"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.000004765679,0.00012252438,2.3834974e-7,0.00066564325,0.00008123684,0.000017793409,0.0008473465,0.00071621576,0.0005450264,0.98184144,0.0025730736,0.012584697],"study_design_scores_gemma":[0.0009696261,0.0002462521,0.000006623298,0.0018041276,0.00008089455,0.000015307489,0.00027678194,0.01805531,0.0024971936,0.9378315,0.037048463,0.0011679258],"about_ca_topic_score_codex":0.0000011455985,"about_ca_topic_score_gemma":0.000028142575,"teacher_disagreement_score":0.08472598,"about_ca_system_score_codex":0.00019462004,"about_ca_system_score_gemma":0.00006504553,"threshold_uncertainty_score":0.9997398},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061789256,0.000687945,0.91790825,0.002400892,0.000669243,0.0022366175,0.00009523729,0.00099263,0.013219937],"genre_scores_gemma":[0.87963265,0.00020749381,0.037148405,0.000353969,0.0002190581,0.00082974636,0.001095456,0.00019239644,0.080320835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930683,0.00036354963,0.0013961197,0.0022109197,0.001132877,0.0018282549],"domain_scores_gemma":[0.99272096,0.00027381632,0.001314545,0.0043211277,0.0005301221,0.00083945383],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010999574,0.0012087361,0.0011311842,0.00047966858,0.001985154,0.0037040901,0.0050080544,0.0011841353,0.0004619896],"category_scores_gemma":[0.0002054418,0.001245011,0.0006835713,0.00054735923,0.00024283101,0.0009892685,0.00047269583,0.0012190029,0.0010322648],"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.00017298257,0.0027171376,0.0034147971,0.004154636,0.00095399417,0.00074652594,0.031247351,0.0061544683,0.29476738,0.40477413,0.037932087,0.2129645],"study_design_scores_gemma":[0.00070938695,0.000100704936,0.0029120436,0.0005842109,0.00028642648,0.00018076709,0.0011295706,0.950589,0.026641201,0.0059002964,0.00934069,0.001625695],"about_ca_topic_score_codex":0.0017135529,"about_ca_topic_score_gemma":0.00088372675,"teacher_disagreement_score":0.9444345,"about_ca_system_score_codex":0.00050788076,"about_ca_system_score_gemma":0.0031348704,"threshold_uncertainty_score":0.99974555},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48204294,0.00003435474,0.5167243,0.0003113939,0.00003526626,0.00014517765,1.2692736e-7,0.00020245358,0.0005040131],"genre_scores_gemma":[0.89241725,8.3125883e-7,0.107310414,0.00020098177,0.000031163603,0.000008806793,9.579063e-7,0.0000063771718,0.000023189627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856496,0.00016863,0.0004148731,0.00031754677,0.00021481053,0.00031915132],"domain_scores_gemma":[0.99801415,0.00061543385,0.00022424944,0.00091234065,0.00013643566,0.00009739755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084511813,0.00013103476,0.00021445414,0.00009679584,0.00021272908,0.00012250007,0.0016605697,0.000034094046,0.000012564021],"category_scores_gemma":[0.000044966157,0.00012258868,0.000091189264,0.00046392542,0.00011237504,0.00056541635,0.00064172014,0.000100869416,0.000040966905],"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":[7.059681e-7,0.000055123935,0.00035182943,0.0000113759515,0.00001053831,5.5774905e-7,0.0022327139,0.0005365803,0.04093414,0.79166526,0.00002069478,0.16418047],"study_design_scores_gemma":[0.0003194539,0.000047686346,0.055182643,0.000035667363,0.0000050678996,0.00002418962,0.00029854188,0.41881356,0.051729944,0.47327834,0.000045131022,0.00021978334],"about_ca_topic_score_codex":0.000039542203,"about_ca_topic_score_gemma":3.4068017e-7,"teacher_disagreement_score":0.41827697,"about_ca_system_score_codex":0.000011071049,"about_ca_system_score_gemma":0.000027231836,"threshold_uncertainty_score":0.49990216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049265698,0.00014102022,0.9917368,0.00047037716,0.00016543787,0.0002050751,0.0000018706153,0.0007380544,0.0016147443],"genre_scores_gemma":[0.99019325,0.0000012845503,0.009161556,0.00007453997,0.00018891787,0.000018335611,0.000014678276,0.000008795295,0.00033865063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993172,0.00002562191,0.0001679476,0.00020528729,0.00014516643,0.00013872448],"domain_scores_gemma":[0.9992848,0.000027589082,0.000059934417,0.0004869128,0.00008071454,0.000060041628],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000080284444,0.000074603864,0.0000921575,0.0000478765,0.0001378217,0.0001834796,0.00053109654,0.0000266388,0.000023424314],"category_scores_gemma":[0.0000062805675,0.000073302464,0.000018592496,0.00039712945,0.000009632867,0.00019534421,0.000072714516,0.000036920508,0.0010257381],"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":[3.817568e-7,0.00021903143,0.00018355015,0.000050182374,0.000032061704,0.0000025326262,0.0017148628,0.01641833,0.015800023,0.9316984,0.025289668,0.008591004],"study_design_scores_gemma":[0.0001476087,0.0000090165795,0.0017143942,0.000008619972,0.0000048641364,0.000056451532,0.000015000949,0.9158069,0.00020054259,0.00017299401,0.081718706,0.00014491884],"about_ca_topic_score_codex":0.000009959373,"about_ca_topic_score_gemma":0.0000016459429,"teacher_disagreement_score":0.9852667,"about_ca_system_score_codex":0.000043143962,"about_ca_system_score_gemma":0.000023768558,"threshold_uncertainty_score":0.9997521},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005850344,0.000025748013,0.98019844,0.007985406,0.00016096515,0.00056133507,0.00014457725,0.00023054925,0.0048426073],"genre_scores_gemma":[0.84539795,0.000010178083,0.15362369,0.00021444049,0.00008150277,0.00019300764,0.000018365632,0.0000128257225,0.00044801983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986115,0.000027266318,0.00034056534,0.00037522358,0.00029496197,0.00035046972],"domain_scores_gemma":[0.99669045,0.00017586039,0.00024280253,0.0024957862,0.00017913071,0.0002159459],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034271672,0.00018764938,0.00024993232,0.00008464813,0.0010860275,0.00058243994,0.0021118396,0.000068887,0.000018656521],"category_scores_gemma":[0.001074459,0.00016333541,0.00010446094,0.00020394633,0.00010667497,0.000358532,0.00045713282,0.00015337874,0.0013607723],"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.0000016672934,0.00017226159,0.000012060233,0.000045325734,0.000021096957,0.000013170107,0.0010010232,0.00016993159,0.0027071864,0.9840422,0.0018339809,0.009980089],"study_design_scores_gemma":[0.0005278144,0.00014438193,0.00081269693,0.00040526217,0.000043256794,0.000035409896,0.000038622038,0.83857864,0.013988259,0.1309127,0.013887856,0.00062507036],"about_ca_topic_score_codex":0.000013559381,"about_ca_topic_score_gemma":0.000008222034,"teacher_disagreement_score":0.8531295,"about_ca_system_score_codex":0.0001034841,"about_ca_system_score_gemma":0.000111015215,"threshold_uncertainty_score":0.99941677},"labels":[],"label_agreement":null},{"id":"W2760174128","doi":"10.1007/978-3-319-77510-4_7","title":"Computing Shortest Paths with Cellular Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Shortest path problem; Cellular automaton; Combinatorics; Vertex (graph theory); Discrete mathematics; Distance; Mathematics; Computer science; Graph; Algorithm","score_opus":0.041049066567063364,"score_gpt":0.2571781149077312,"score_spread":0.21612904834066782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760174128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017517552,0.00031434043,0.909076,0.00034604617,0.0003396942,0.0005095582,0.00003251713,0.0006673418,0.08696279],"genre_scores_gemma":[0.6503149,0.00028079716,0.28649586,0.000704938,0.001356138,0.00005237512,0.0017729456,0.00023725974,0.05878477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744105,0.00004071926,0.00056283077,0.001031507,0.00055837777,0.00036551018],"domain_scores_gemma":[0.9982625,0.00008050723,0.00041630364,0.0007764487,0.00026726886,0.0001969522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025737062,0.00050046865,0.0004693168,0.00021183999,0.00063525815,0.00028499018,0.0008172147,0.00020239872,0.00025174455],"category_scores_gemma":[0.0000047153053,0.00048794053,0.00010867827,0.00020967129,0.00039764124,0.00031875758,0.0005377935,0.00032522946,0.00028351712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010219023,0.00010424188,0.000036260994,0.00011239669,0.00012998379,0.000045084565,0.0010205582,0.00042969867,0.00013311414,0.93401253,0.009367512,0.0545984],"study_design_scores_gemma":[0.00040684972,0.00032049956,0.00066355884,0.00023687173,0.00008007641,0.0000916735,0.000033151795,0.742001,0.00010535937,0.18851045,0.06649919,0.0010513217],"about_ca_topic_score_codex":0.000034683882,"about_ca_topic_score_gemma":0.000048275877,"teacher_disagreement_score":0.7455021,"about_ca_system_score_codex":0.00003732193,"about_ca_system_score_gemma":0.0001175824,"threshold_uncertainty_score":0.99975723},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49141526,0.115713865,0.27493235,0.00020101582,0.00391451,0.004115458,0.00008189282,0.000983384,0.108642265],"genre_scores_gemma":[0.9908413,0.0018033923,0.0016346287,0.000025568514,0.00021406852,0.000004770835,0.000021031075,0.000041370615,0.005413823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784034,0.000050518032,0.000498914,0.0009140629,0.00031040874,0.00038576193],"domain_scores_gemma":[0.9983975,0.00014458329,0.0004950079,0.0006812512,0.00010132933,0.00018028938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029904224,0.00039907708,0.00050424814,0.00019242524,0.0004758721,0.00048344533,0.00059594517,0.00023069189,0.0000045416177],"category_scores_gemma":[0.000017427888,0.00042063466,0.000068688525,0.000040226765,0.00013906999,0.000670515,0.00044835475,0.00049310335,0.00001670553],"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.00001561987,0.000101001955,0.00035103722,0.00031163124,0.000047915837,0.0007254814,0.001567781,0.00004766186,0.0028104826,0.39284775,0.00001772894,0.60115594],"study_design_scores_gemma":[0.00082301727,0.0009958975,0.0012579525,0.003396936,0.00016648415,0.0030287772,0.0005794953,0.7689969,0.0010281138,0.012569302,0.20428827,0.0028688298],"about_ca_topic_score_codex":0.00026865836,"about_ca_topic_score_gemma":0.00012840173,"teacher_disagreement_score":0.7689493,"about_ca_system_score_codex":0.00009623655,"about_ca_system_score_gemma":0.00007310545,"threshold_uncertainty_score":0.9998245},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008801153,0.00014995,0.15644059,0.0000683974,0.00014692472,0.00039186273,0.000009913368,0.00015572611,0.8426278],"genre_scores_gemma":[0.00009131954,0.000088692716,0.004924191,0.00016535635,0.00029177245,0.0000028753152,0.0000134574575,0.000013954936,0.99440837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989842,0.00007231349,0.00010750462,0.0004193362,0.00017205486,0.0002445883],"domain_scores_gemma":[0.99868804,0.00014079135,0.00014354673,0.0008892902,0.00005961949,0.000078703335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017567609,0.0001967835,0.0002299144,0.000045631346,0.00046760542,0.00014318679,0.0013314991,0.00016525404,0.000004667069],"category_scores_gemma":[0.0000022745378,0.00016801411,0.000095962074,0.000026630627,0.0003960082,0.00009354075,0.0011739554,0.00024211803,0.0000031901154],"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.000009184223,0.000003366005,1.5083911e-7,0.000012721829,0.00003633237,0.000013886152,0.00024296886,0.000003315471,0.0000017456739,0.8941838,0.09333343,0.012159099],"study_design_scores_gemma":[0.0005220226,0.000015516001,0.0000029921093,0.000031947744,0.00006365602,0.000015464695,0.0000052570986,0.007539551,0.000010070687,0.014411534,0.9771929,0.00018909937],"about_ca_topic_score_codex":0.000024420708,"about_ca_topic_score_gemma":0.0000140350485,"teacher_disagreement_score":0.88385946,"about_ca_system_score_codex":0.000057093654,"about_ca_system_score_gemma":0.00013727059,"threshold_uncertainty_score":0.6851417},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060757924,0.00006031218,0.9357282,0.00008896284,0.00004171761,0.00031133866,0.0000015645426,0.00013915815,0.0028708032],"genre_scores_gemma":[0.9465057,0.000003370718,0.053177893,0.0000464879,0.000067258974,0.000053292904,0.000014230182,0.0000073126866,0.00012440576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992005,0.000015289233,0.00024407658,0.00025329975,0.00016268111,0.00012411206],"domain_scores_gemma":[0.9990112,0.00005734991,0.000105183404,0.00057658047,0.00021046247,0.00003918865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009785603,0.00007794822,0.00009085208,0.00007365098,0.00012902387,0.000052817075,0.0003637657,0.000040752293,0.000011693671],"category_scores_gemma":[0.000012358158,0.00008226269,0.00004168883,0.00043508832,0.000029813871,0.00056807697,0.000081704646,0.000043699907,0.00010413722],"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.000008102738,0.00017352994,0.000118712116,0.0000372532,0.000008356623,2.2770574e-7,0.0009326715,0.7527322,0.044230673,0.04242344,0.000038426195,0.1592964],"study_design_scores_gemma":[0.00019922788,0.000022380087,0.00012297489,0.0000069946605,0.0000044089884,4.316586e-7,0.00001937788,0.9821041,0.009890876,0.0040887743,0.0034518775,0.00008853696],"about_ca_topic_score_codex":0.00002111236,"about_ca_topic_score_gemma":0.000004709322,"teacher_disagreement_score":0.88574785,"about_ca_system_score_codex":0.000021276253,"about_ca_system_score_gemma":0.000036568727,"threshold_uncertainty_score":0.33545753},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12553294,0.000016220387,0.86506903,0.00010295127,0.00024995452,0.0001717838,0.000053242286,0.00017055699,0.008633341],"genre_scores_gemma":[0.994673,0.000041972344,0.0031188137,0.000018442333,0.000045431432,7.4538536e-7,0.00006434789,0.000012156156,0.0020250808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876523,0.0000473119,0.00017623471,0.00071737653,0.00007793336,0.00021589016],"domain_scores_gemma":[0.9979331,0.00003860016,0.0002376741,0.0015666821,0.00012316191,0.00010082023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119052114,0.00019654447,0.00023656993,0.00014694466,0.00009083149,0.000056148336,0.0019763291,0.00019504377,0.000029407498],"category_scores_gemma":[0.000006772208,0.00022772112,0.00016689312,0.00040867148,0.00014908813,0.000170337,0.0023238729,0.00022921212,0.00009897975],"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.0000046808723,0.00006649952,0.0010129825,0.0000676471,0.000063133135,0.000058155005,0.00010475607,0.006524472,0.00007088243,0.9912456,0.00037803347,0.00040313546],"study_design_scores_gemma":[0.00015552755,0.000031283187,0.0015467223,0.000041304633,0.0000510168,0.000004050543,0.000022465292,0.91251206,0.00027727292,0.08450202,0.0005776935,0.00027860023],"about_ca_topic_score_codex":0.000196612,"about_ca_topic_score_gemma":0.00012354513,"teacher_disagreement_score":0.9067436,"about_ca_system_score_codex":0.00012344094,"about_ca_system_score_gemma":0.00013211074,"threshold_uncertainty_score":0.92861974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01104834,0.00015279214,0.98733306,0.0002551951,0.00048160597,0.0004519497,0.000015455056,0.000060061506,0.00020156012],"genre_scores_gemma":[0.36109558,0.0000029447974,0.63814247,0.0004144399,0.00027048768,0.0000053128083,0.000016685191,0.000016806944,0.0000352876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968224,0.00008514568,0.0006746274,0.0009083084,0.0011572669,0.0003522269],"domain_scores_gemma":[0.9971718,0.00036463776,0.0005751535,0.001514197,0.0003113049,0.00006287732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017123574,0.0003044705,0.0003481592,0.0002436402,0.0003637572,0.0002275879,0.0026849937,0.00016990596,0.000057336543],"category_scores_gemma":[0.000048225054,0.00022842952,0.00010440768,0.00052793085,0.0009900563,0.0003589423,0.0011448271,0.00042464954,0.000008095598],"study_design_candidate":"design_other","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.0000054862703,0.000028682372,0.000030795407,0.00008838068,0.000018925715,0.0000019306053,0.0014859482,0.060033206,0.015766224,0.029361678,0.000011880275,0.89316684],"study_design_scores_gemma":[0.00012148952,0.000063948624,0.00011132656,0.00009643103,0.000009465526,0.000015175018,8.165599e-7,0.8101255,0.009278636,0.17987482,0.00006993339,0.00023243761],"about_ca_topic_score_codex":0.00006240276,"about_ca_topic_score_gemma":0.000056534653,"teacher_disagreement_score":0.89293444,"about_ca_system_score_codex":0.00020685857,"about_ca_system_score_gemma":0.0004252743,"threshold_uncertainty_score":0.93150854},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041918684,0.002995416,0.5310202,0.023170795,0.052968517,0.0013883566,0.0002812081,0.0011901138,0.38694346],"genre_scores_gemma":[0.03902887,0.0018763558,0.19870687,0.006927362,0.0042544776,0.002447874,0.011372296,0.00018462175,0.7352013],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99760056,0.0001404206,0.0006576681,0.00069125224,0.00047664845,0.00043346724],"domain_scores_gemma":[0.9904068,0.00016821413,0.0002485308,0.0085051535,0.00037775474,0.0002935078],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027123844,0.00038808695,0.00044433484,0.00033153986,0.00090093113,0.00052608724,0.00829315,0.0007462273,0.000030447747],"category_scores_gemma":[0.00014783569,0.00040001216,0.00018311419,0.000961483,0.00033131096,0.00044504736,0.0045081973,0.0015304629,0.0015334103],"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":[7.3193286e-7,0.000095149204,0.0000019383845,0.000023911905,0.00003817406,0.0000031417264,0.0001757801,0.000091050344,0.000012830395,0.15335362,0.8453749,0.0008288081],"study_design_scores_gemma":[0.00008656583,0.000042775373,0.000066949244,0.00021750467,0.000026853902,0.000030190959,0.000008001387,0.09352397,0.0000029209057,0.0016098181,0.9039721,0.00041235378],"about_ca_topic_score_codex":0.00034843353,"about_ca_topic_score_gemma":0.00085921143,"teacher_disagreement_score":0.3482578,"about_ca_system_score_codex":0.00014115962,"about_ca_system_score_gemma":0.0007300794,"threshold_uncertainty_score":0.99984515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024258407,0.000008720698,0.9514876,0.00090693095,0.00019035595,0.0002817352,0.0000032050848,0.0005955427,0.022267515],"genre_scores_gemma":[0.9017089,2.8280462e-7,0.09667126,0.0013526506,0.000098275246,0.00004548889,0.000004415231,0.000013194572,0.00010550259],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677104,0.000018202176,0.0002545758,0.0011055289,0.0012413552,0.00060927606],"domain_scores_gemma":[0.99768955,0.0000746625,0.000105756626,0.0017330006,0.00014649887,0.00025053846],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00088841695,0.00019597044,0.00016987535,0.00029967673,0.0010532731,0.00044049358,0.002502426,0.00006155027,0.000035287092],"category_scores_gemma":[0.000026255695,0.00019751191,0.000053829768,0.0015265254,0.00073338154,0.00036111215,0.00054399663,0.00016635958,0.0010306021],"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.000006064279,0.00018821214,0.000007959528,0.0000045652923,0.0000023679804,0.0000023618459,0.00018073144,0.0014571866,0.8801728,0.09061769,0.00024248472,0.027117575],"study_design_scores_gemma":[0.00024252947,0.000043613098,0.00035534074,0.000012370906,0.0000030747372,0.0000014489377,0.000002379796,0.82087153,0.16849226,0.008854562,0.0009077274,0.0002131337],"about_ca_topic_score_codex":0.00000856222,"about_ca_topic_score_gemma":0.0000024552648,"teacher_disagreement_score":0.8774505,"about_ca_system_score_codex":0.000105004125,"about_ca_system_score_gemma":0.00040331922,"threshold_uncertainty_score":0.9997472},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057575308,0.00007771218,0.9387308,0.001574979,0.00012933201,0.00007201735,0.0000011456934,0.00025342708,0.0015852785],"genre_scores_gemma":[0.9795474,0.0000139929025,0.020118097,0.00018399967,0.000017219254,0.000010654756,0.0000033334768,0.0000053671756,0.00009995392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994406,0.000010017045,0.00010731236,0.0002018028,0.00011441505,0.00012585195],"domain_scores_gemma":[0.9994629,0.000010649554,0.000034999946,0.00041073744,0.00003523354,0.000045467154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069742266,0.000069077374,0.000054726195,0.000058181035,0.00008723699,0.00010492651,0.0005279994,0.00003834695,0.0000074017935],"category_scores_gemma":[0.000008972002,0.00006799644,0.000039340477,0.00044277174,0.000035316963,0.00024680144,0.00012391222,0.00009233593,0.00012721175],"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":[4.566802e-7,0.000038639835,0.00006966853,0.000002919227,0.000004845784,0.0000014941166,0.00030485904,0.0005481657,0.013182712,0.9840513,0.00009936714,0.0016955987],"study_design_scores_gemma":[0.001236356,0.00015783648,0.006100349,0.00007260867,0.00001711163,0.00008323343,0.000078688114,0.08184107,0.35360765,0.50000066,0.055992406,0.00081204384],"about_ca_topic_score_codex":0.00002075754,"about_ca_topic_score_gemma":0.000009676718,"teacher_disagreement_score":0.9219721,"about_ca_system_score_codex":0.000018343217,"about_ca_system_score_gemma":0.000026288268,"threshold_uncertainty_score":0.27728146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76742,0.000092758535,0.22974844,0.00029390716,0.0014043493,0.00042105233,0.000006839314,0.00037781172,0.00023483786],"genre_scores_gemma":[0.97919935,0.0000051561296,0.020371398,0.00016131332,0.000037783033,0.00013649084,0.000013759478,0.000020707552,0.000054017677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868345,0.000031851738,0.00018514442,0.0005032129,0.0002234206,0.00037291448],"domain_scores_gemma":[0.99865913,0.00007281329,0.000094404284,0.0009267025,0.00007671746,0.00017022195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028272686,0.00015869594,0.00015524279,0.000079401434,0.00047976014,0.0003674085,0.0009948681,0.00006461165,0.000012583211],"category_scores_gemma":[0.000016553557,0.00016640635,0.00007410016,0.0002827673,0.000063997526,0.00062880846,0.0002004672,0.00007796401,0.00004633009],"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.000005693986,0.00014364962,0.0002502305,0.000011989072,0.000015468244,0.0000029489038,0.0005290207,0.0000015707661,0.031577077,0.9602614,0.0008505564,0.006350368],"study_design_scores_gemma":[0.0016392826,0.0006366947,0.0068463353,0.00005139329,0.000024911275,0.000023414606,0.00009958741,0.08311568,0.07957922,0.7867751,0.040580418,0.0006279595],"about_ca_topic_score_codex":0.000044610995,"about_ca_topic_score_gemma":0.000010962355,"teacher_disagreement_score":0.21177937,"about_ca_system_score_codex":0.00007059674,"about_ca_system_score_gemma":0.000045717214,"threshold_uncertainty_score":0.6785854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000070326365,0.0195771,0.88517004,0.000045479814,0.0015581211,0.00070522213,0.00003379661,0.0002555863,0.09258434],"genre_scores_gemma":[0.80075246,0.0031361256,0.044260755,0.000343216,0.00097561086,0.00005832956,0.00030064431,0.000245925,0.14992692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974492,0.000040825857,0.0007551239,0.0009387453,0.0004204461,0.00039562068],"domain_scores_gemma":[0.9979961,0.00030629252,0.00047840766,0.0010122355,0.00009916009,0.00010782767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043586592,0.0004417765,0.00058418955,0.00029673066,0.00019467443,0.0003120591,0.0010352118,0.00021497406,0.000019445644],"category_scores_gemma":[0.000014497941,0.0004462283,0.00013286511,0.00011621279,0.00007133411,0.00039436138,0.00065686967,0.00038794952,0.00019756888],"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.0000028369138,0.000043597753,0.00024527323,0.0007666909,0.00003570342,0.00007041832,0.00030457848,0.012273467,0.00007418303,0.87973106,0.00044053662,0.10601164],"study_design_scores_gemma":[0.0002144164,0.00004093897,0.000024262132,0.0015963081,0.00001616354,0.00002194243,0.00006604016,0.70867115,0.00011458493,0.0036300784,0.28500053,0.00060357526],"about_ca_topic_score_codex":0.00006609006,"about_ca_topic_score_gemma":0.000016551208,"teacher_disagreement_score":0.876101,"about_ca_system_score_codex":0.00014123466,"about_ca_system_score_gemma":0.00010462608,"threshold_uncertainty_score":0.99979895},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37690297,0.000026835558,0.61879325,0.00013089132,0.00037928697,0.0015373717,0.0008475413,0.000209316,0.0011725093],"genre_scores_gemma":[0.95269555,0.000025948693,0.041292656,0.0003087558,0.000091806396,0.00023761512,0.004890076,0.00005548929,0.0004021331],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749976,0.000030506008,0.0010298885,0.00041266883,0.00052448316,0.00050270004],"domain_scores_gemma":[0.9965836,0.00006979256,0.0011010536,0.0017841377,0.00033077915,0.00013065901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032754315,0.00045242772,0.0006828611,0.00029248276,0.00013000741,0.00044818496,0.0018773057,0.0003217285,0.000015895455],"category_scores_gemma":[0.000012795191,0.00039595144,0.00022750256,0.00034662528,0.00008170563,0.0008787277,0.0013530621,0.00050134124,0.000101982914],"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.0009907336,0.009276144,0.041657284,0.06320339,0.0054495824,0.00008057759,0.32455727,0.03556587,0.07391508,0.29534167,0.010023408,0.139939],"study_design_scores_gemma":[0.0034351465,0.00034454896,0.004791795,0.001190572,0.0001417602,0.000067309564,0.0005490652,0.93640566,0.025117869,0.0007010934,0.025735594,0.001519602],"about_ca_topic_score_codex":0.000033328797,"about_ca_topic_score_gemma":0.0000095372125,"teacher_disagreement_score":0.90083975,"about_ca_system_score_codex":0.000085568754,"about_ca_system_score_gemma":0.00023113089,"threshold_uncertainty_score":0.99984926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001030173,0.00007332478,0.92719924,0.0015896872,0.00005106226,0.00011550097,8.414573e-7,0.00011163498,0.069828555],"genre_scores_gemma":[0.9098894,0.000027900664,0.08541856,0.00031435044,0.000023526027,0.000027494032,0.000011128255,0.0000039648303,0.0042837043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994076,0.000031386076,0.00013883646,0.00022094823,0.00010153841,0.000099694],"domain_scores_gemma":[0.9994006,0.00003717626,0.00003262463,0.00041881888,0.000046142886,0.00006460023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018229615,0.00005903346,0.000051967025,0.00003394775,0.00013982867,0.000121858735,0.00017701383,0.000018711884,0.00023599398],"category_scores_gemma":[0.000022138309,0.00005377759,0.000015107811,0.00020356147,0.000025557825,0.000252652,0.000016548374,0.00003241084,0.0001649862],"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":[1.3873185e-7,0.000040658055,0.00037259416,0.0000021286016,0.0000038997973,8.2648137e-7,0.00006800273,0.0000026572734,0.014996247,0.97670674,0.0016630574,0.0061430507],"study_design_scores_gemma":[0.00085427804,0.000045879446,0.020204507,0.000015028779,0.000018080864,0.000089728564,0.00013418842,0.01847418,0.2662475,0.021521337,0.67180234,0.00059296895],"about_ca_topic_score_codex":0.0000034515544,"about_ca_topic_score_gemma":0.000005976535,"teacher_disagreement_score":0.9551854,"about_ca_system_score_codex":0.000009460642,"about_ca_system_score_gemma":0.000026183898,"threshold_uncertainty_score":0.25839686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9402823,0.0018690656,0.056813978,0.00006510979,0.0002117922,0.0004155865,0.0000030118763,0.000117406445,0.00022177261],"genre_scores_gemma":[0.9973512,0.0000020777834,0.0025022153,0.000005809355,0.00002326397,0.0000033294875,0.000004076593,0.000009454657,0.00009853476],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987971,0.000064361906,0.00032843024,0.000305631,0.00031076177,0.00019372397],"domain_scores_gemma":[0.9990845,0.000064406566,0.0002416271,0.00047210857,0.00009220676,0.000045165132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022947295,0.0001306602,0.0003051586,0.000068726586,0.000061151135,0.00009978653,0.00048074897,0.000054072054,2.994399e-7],"category_scores_gemma":[0.0000079205765,0.000089717934,0.00003716646,0.0002632291,0.000074998774,0.00018117945,0.0002911757,0.00015051181,0.0000031536906],"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.00004624089,0.00014564749,0.010453492,0.0029737132,0.00018301046,0.000012433707,0.0024382162,0.012540946,0.7868478,0.17842428,0.00007981692,0.005854415],"study_design_scores_gemma":[0.00029664903,0.00006800188,0.0013950092,0.0003421622,0.000008400654,0.000035066652,0.00010714147,0.99390996,0.0035844487,0.000011057404,0.000112442925,0.00012966247],"about_ca_topic_score_codex":0.00016604543,"about_ca_topic_score_gemma":0.0000020228372,"teacher_disagreement_score":0.981369,"about_ca_system_score_codex":0.000021055794,"about_ca_system_score_gemma":0.000040568593,"threshold_uncertainty_score":0.36585912},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21672554,0.00005295517,0.7736032,0.00032341084,0.0002363657,0.00024057925,0.000015977745,0.00024571762,0.008556284],"genre_scores_gemma":[0.990655,0.00008574014,0.0073253466,0.000054216318,0.000047316695,0.000001511507,0.000017081942,0.000011383541,0.0018024006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985948,0.00005570247,0.00012759489,0.0009128536,0.000065341184,0.00024370613],"domain_scores_gemma":[0.9983969,0.00008167654,0.00016044521,0.0011169427,0.00008106265,0.00016298368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000113817754,0.00022369892,0.00020880894,0.00013789185,0.00018103367,0.00013642765,0.0012019876,0.00030782793,0.000022318636],"category_scores_gemma":[0.000015199814,0.00025431762,0.00011182049,0.00028273894,0.00016249117,0.00033006756,0.0021537899,0.00079255924,0.00012035366],"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.0000045626407,0.00004526031,0.0006657043,0.000017131753,0.00003852387,0.00009194616,0.00014372669,0.00069347,0.0004154007,0.9960056,0.00013475723,0.0017439417],"study_design_scores_gemma":[0.000467779,0.000033005566,0.0077450285,0.00003262024,0.000080757076,0.000019103245,0.000029340588,0.70866174,0.00044793938,0.2733693,0.008567499,0.0005458875],"about_ca_topic_score_codex":0.000085477586,"about_ca_topic_score_gemma":0.000051675823,"teacher_disagreement_score":0.7739295,"about_ca_system_score_codex":0.00006362926,"about_ca_system_score_gemma":0.00011255534,"threshold_uncertainty_score":0.9999909},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9647323,0.00025322346,0.025902584,0.0043140803,0.00041404774,0.00037977737,0.000013505775,0.00018680292,0.0038036683],"genre_scores_gemma":[0.9978201,0.00012132141,0.001125618,0.000437387,0.00007653308,0.00006915581,0.000020039492,0.000017114096,0.0003127807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985114,0.000075580596,0.00031756607,0.0005563963,0.00030704882,0.0002320609],"domain_scores_gemma":[0.9972758,0.00020572214,0.00022414964,0.002138479,0.0000872018,0.00006863932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017974302,0.0002346218,0.0002725648,0.00008379158,0.00023858398,0.000092061906,0.0020735206,0.0001600554,0.00008020433],"category_scores_gemma":[0.00010402792,0.00017377948,0.00018583983,0.00032579212,0.00016201854,0.00006208237,0.0012426359,0.0005229483,0.0005602425],"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.000090745176,0.0028864783,0.1414473,0.0006870765,0.00078583637,0.00034132804,0.06188508,0.009724466,0.010809148,0.7253911,0.028611673,0.017339762],"study_design_scores_gemma":[0.0011877473,0.0006197159,0.7120726,0.000744094,0.00015555501,0.00010021417,0.0003052472,0.08239317,0.024365429,0.03630704,0.13893805,0.002811147],"about_ca_topic_score_codex":0.000057037196,"about_ca_topic_score_gemma":0.0000046909076,"teacher_disagreement_score":0.68908405,"about_ca_system_score_codex":0.00003326379,"about_ca_system_score_gemma":0.00027865762,"threshold_uncertainty_score":0.7200971},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89425445,0.0010311496,0.10080971,0.000575071,0.0017171513,0.00066228345,0.000009567957,0.00028391246,0.0006566953],"genre_scores_gemma":[0.9980189,0.00007567927,0.0011972949,0.000110150955,0.0002604638,0.00012460237,0.00012456205,0.00002050768,0.000067814675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99772644,0.00018982582,0.00042821135,0.00091024657,0.0002780483,0.00046720353],"domain_scores_gemma":[0.99810034,0.00017618945,0.00019341313,0.0013058226,0.000098114186,0.00012609162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002543225,0.0003192959,0.0004530596,0.00012095204,0.0001277865,0.0001586225,0.0011914981,0.00032153275,0.0000025151155],"category_scores_gemma":[0.000019179959,0.00033028307,0.0001311331,0.00046015726,0.00004806801,0.00014491031,0.0011823867,0.00060122454,0.00015521068],"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.0003780127,0.002091214,0.13671044,0.00067962083,0.0005532367,0.001320824,0.0046829185,0.43640366,0.011029949,0.37363243,0.0028608444,0.029656839],"study_design_scores_gemma":[0.001132235,0.00013583993,0.5386909,0.0009755273,0.000056542693,0.00002731145,0.00006287031,0.45381883,0.000519812,0.0027953077,0.00072678673,0.0010579923],"about_ca_topic_score_codex":0.000284555,"about_ca_topic_score_gemma":0.00003537829,"teacher_disagreement_score":0.40198052,"about_ca_system_score_codex":0.00022444571,"about_ca_system_score_gemma":0.00014630819,"threshold_uncertainty_score":0.99991494},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007688889,0.0004342529,0.4453343,0.112977535,0.00068794284,0.02669865,0.0010857531,0.0005852002,0.4045075],"genre_scores_gemma":[0.05945843,0.0020611673,0.21970817,0.0005794597,0.00080879836,0.0005172928,0.0026706215,0.00018851412,0.71400756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955436,0.00066705875,0.00036285952,0.0015707668,0.0009629336,0.00089277903],"domain_scores_gemma":[0.99383384,0.0004988439,0.00024443393,0.004127708,0.0009655482,0.00032959797],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0034436965,0.00037855882,0.0005711859,0.00056583603,0.002656942,0.0032921366,0.037023336,0.00030071443,0.00016031066],"category_scores_gemma":[0.00018329581,0.00033337224,0.0002407807,0.001965888,0.00028971443,0.0010581588,0.075920165,0.0013858295,0.00013895251],"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.00027968452,0.003166889,0.00003606676,0.00016857187,0.0005184042,0.0003697727,0.0011084855,0.0013952646,0.0027900322,0.6247736,0.11760972,0.24778348],"study_design_scores_gemma":[0.0010773167,0.0001600497,0.0000796804,0.00012083557,0.00003865744,0.0000067663013,0.00024289545,0.04887922,0.0008169194,0.009256557,0.93890035,0.00042075108],"about_ca_topic_score_codex":0.0030389016,"about_ca_topic_score_gemma":0.0014043973,"teacher_disagreement_score":0.8212906,"about_ca_system_score_codex":0.00037591186,"about_ca_system_score_gemma":0.0018460092,"threshold_uncertainty_score":0.99991184},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.789589,0.00038350726,0.20617796,0.0012492511,0.0004971975,0.0008260065,0.00008969855,0.0006256026,0.0005617883],"genre_scores_gemma":[0.98620373,0.00025758633,0.012211581,0.0004007264,0.0002561625,0.00009956795,0.00021270022,0.000047660844,0.00031027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969411,0.00010610009,0.0005016341,0.0014887942,0.00045178045,0.0005105999],"domain_scores_gemma":[0.99641746,0.00013951516,0.0003829807,0.0026792104,0.00011699806,0.0002638081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016507658,0.00055363256,0.00048183827,0.00017682859,0.00027517852,0.00034784674,0.0019259305,0.00037103545,0.000029985848],"category_scores_gemma":[0.000044915836,0.00052328786,0.00016512618,0.000307979,0.00015486655,0.00017050572,0.002646342,0.00083260954,0.00020923409],"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.00008847528,0.003696872,0.21350679,0.0011918925,0.0016047249,0.0007225125,0.008302203,0.0076916404,0.16059689,0.48184943,0.009479387,0.11126919],"study_design_scores_gemma":[0.002509532,0.0003557536,0.3984376,0.00048051213,0.00028414695,0.00012525546,0.0001284551,0.43430358,0.06700622,0.049104806,0.04394873,0.0033154075],"about_ca_topic_score_codex":0.00006384062,"about_ca_topic_score_gemma":0.0000067923093,"teacher_disagreement_score":0.43274462,"about_ca_system_score_codex":0.0001382297,"about_ca_system_score_gemma":0.00010210947,"threshold_uncertainty_score":0.9997219},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6530059,0.0018402206,0.33518615,0.0041053323,0.0012897787,0.00052967673,0.000008613595,0.0003769495,0.0036573776],"genre_scores_gemma":[0.99763036,0.00016925872,0.0013807487,0.00020625547,0.00012240137,0.000032098356,0.000029020886,0.000010644172,0.00041922706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99866205,0.00006615227,0.00033594662,0.0004708823,0.00024487096,0.00022009172],"domain_scores_gemma":[0.99773574,0.00013064891,0.00025283307,0.0017100484,0.0001085283,0.00006221289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030506443,0.0001865013,0.00020711392,0.000062552346,0.00026206824,0.00016507314,0.001492632,0.00015380798,0.000018071514],"category_scores_gemma":[0.000051428287,0.00014376086,0.00014774376,0.0003182023,0.00008357836,0.000099039156,0.00082000106,0.00038555355,0.0002495106],"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.00012855887,0.00135028,0.12789434,0.00048082788,0.00068140565,0.000044258944,0.007135015,0.0047557154,0.01976042,0.43781367,0.015157448,0.38479805],"study_design_scores_gemma":[0.00031157496,0.00018419296,0.7904544,0.00011488664,0.00009851436,0.000005681234,0.000042256732,0.022478908,0.0030020017,0.03248958,0.15021585,0.0006021791],"about_ca_topic_score_codex":0.00004540978,"about_ca_topic_score_gemma":0.000015745216,"teacher_disagreement_score":0.66256005,"about_ca_system_score_codex":0.000029206783,"about_ca_system_score_gemma":0.00019436826,"threshold_uncertainty_score":0.58623976},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07317321,0.00046304078,0.9025593,0.0017785173,0.00036598602,0.0008521146,0.0000075108164,0.00023235782,0.020567976],"genre_scores_gemma":[0.9979224,0.00017280187,0.0010102224,0.00008908032,0.000055447752,0.000005409803,0.000007138091,0.0000066175403,0.0007308704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891,0.00013769284,0.0001341832,0.00044381776,0.00007705175,0.00029724033],"domain_scores_gemma":[0.9981552,0.0002233366,0.00012453081,0.0014081307,0.00003905281,0.00004977467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327909,0.00015000229,0.00011115487,0.000061709965,0.0003283683,0.00020702841,0.0030990199,0.00010831315,0.000004719971],"category_scores_gemma":[0.000008541231,0.000104226165,0.000106413616,0.00051139935,0.00007913358,0.00018093895,0.0012327596,0.00049265247,0.00011320317],"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.0000018756429,0.0000956921,0.0006253279,0.00001811306,0.000017686303,0.000026497468,0.0009982507,0.020081019,0.00002174257,0.97477186,0.0004951823,0.0028467395],"study_design_scores_gemma":[0.00027650458,0.0000156108,0.004606589,0.00006794101,0.000048705646,0.000011594231,0.0003657907,0.74252963,0.000090454574,0.19801058,0.053474844,0.00050174864],"about_ca_topic_score_codex":0.000117248885,"about_ca_topic_score_gemma":0.00007161115,"teacher_disagreement_score":0.9247492,"about_ca_system_score_codex":0.000064520296,"about_ca_system_score_gemma":0.00007872031,"threshold_uncertainty_score":0.5758801},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09156964,0.0000614238,0.90578276,0.00024171293,0.00025858555,0.0006467079,0.000031470354,0.00035682519,0.0010508973],"genre_scores_gemma":[0.98299265,0.00011125134,0.015104342,0.00016184917,0.00006803738,0.000018602444,0.00016901964,0.000015157414,0.0013591206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983644,0.00006863317,0.00022048579,0.00094501046,0.00007212538,0.00032935667],"domain_scores_gemma":[0.9983434,0.00010060591,0.00020285673,0.0010438163,0.00016438004,0.00014493056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015961283,0.0002541663,0.00027450573,0.00014479292,0.0002653294,0.00020294375,0.0015375218,0.0003065739,0.000045848767],"category_scores_gemma":[0.000017941748,0.0002639812,0.00019658197,0.0003355805,0.00009719545,0.00032521482,0.0010197569,0.0002339023,0.000116066614],"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.000007730401,0.00014316465,0.0003383395,0.000064630665,0.00004696087,0.000017603144,0.00014761394,0.039266784,0.0002162469,0.9569648,0.0011611563,0.001624968],"study_design_scores_gemma":[0.00032565507,0.000038408958,0.0007822279,0.000027945716,0.000040929306,0.0000035685996,0.00002802185,0.88978195,0.000179711,0.101423934,0.0070158336,0.0003518056],"about_ca_topic_score_codex":0.00016277573,"about_ca_topic_score_gemma":0.000054418695,"teacher_disagreement_score":0.891423,"about_ca_system_score_codex":0.00009889837,"about_ca_system_score_gemma":0.00006945723,"threshold_uncertainty_score":0.9999812},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03671326,0.0000763651,0.9604087,0.00025950884,0.00024116357,0.0004957206,0.000025425239,0.00022086824,0.00155899],"genre_scores_gemma":[0.99703825,0.00010610121,0.001699908,0.000071215574,0.000051406147,0.000008764702,0.000040372513,0.0000111624995,0.0009728052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895424,0.00003694862,0.00013224201,0.0006077885,0.00004283557,0.0002259581],"domain_scores_gemma":[0.9985484,0.000103029735,0.000132291,0.0010329782,0.00009697124,0.00008632829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019665594,0.00016036682,0.00013641466,0.00007104618,0.00038544627,0.0001381182,0.0015137574,0.00013528437,0.0000065032746],"category_scores_gemma":[0.000007967826,0.00015024438,0.000206808,0.0002241763,0.00008987059,0.00016278644,0.00034186893,0.00021375011,0.000051299707],"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.000028629862,0.0001732865,0.0000032905727,0.000042396532,0.000057428373,0.0000183358,0.00058901677,0.0027559476,0.00030661482,0.9871136,0.0007010311,0.008210442],"study_design_scores_gemma":[0.0006527175,0.000051062907,0.000020432373,0.000021906924,0.00007208327,0.000002888082,0.000039266488,0.7647389,0.0009224825,0.21831803,0.01491113,0.0002490505],"about_ca_topic_score_codex":0.000041588522,"about_ca_topic_score_gemma":0.000014168003,"teacher_disagreement_score":0.960325,"about_ca_system_score_codex":0.00005611717,"about_ca_system_score_gemma":0.000107638676,"threshold_uncertainty_score":0.6126788},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4484421,0.00002824708,0.55015266,0.000066276865,0.000080447244,0.0004607202,0.0001272674,0.0001297551,0.0005125215],"genre_scores_gemma":[0.9946229,0.000012970824,0.0047711045,0.000028574155,0.000023963055,0.000007576023,0.0003005827,0.00001857324,0.00021374988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821556,0.000108010434,0.0003570414,0.00089976384,0.00012791966,0.00029172277],"domain_scores_gemma":[0.99801004,0.00003978941,0.00028103107,0.0013588554,0.00016750807,0.0001428006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011085233,0.00030110165,0.00037724932,0.0003641077,0.00009342842,0.00008213404,0.0013636871,0.0003553711,0.00032666593],"category_scores_gemma":[0.000009581229,0.00035360825,0.00014307894,0.00086822675,0.00017219507,0.00047032093,0.0005623149,0.00049117627,0.00006086968],"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.00004697704,0.0020015712,0.00015118721,0.00096867786,0.00025069903,0.00027610196,0.0038710923,0.28449076,0.018273884,0.68238324,0.00039487155,0.0068909223],"study_design_scores_gemma":[0.0013296006,0.00006411972,0.0002999563,0.00007257611,0.000051264808,0.00000806235,0.00011145846,0.9475815,0.0033815964,0.04655541,0.0002157214,0.00032871694],"about_ca_topic_score_codex":0.00016904958,"about_ca_topic_score_gemma":0.00012247519,"teacher_disagreement_score":0.66309077,"about_ca_system_score_codex":0.00017514772,"about_ca_system_score_gemma":0.0003840651,"threshold_uncertainty_score":0.9998916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1426427,0.0000608019,0.8519234,0.00006078625,0.0003661601,0.00026325512,0.00000853227,0.0004059177,0.0042684255],"genre_scores_gemma":[0.994622,0.000050090974,0.0043107904,0.000030627787,0.000069319,0.0000022953852,0.00008183746,0.000011840153,0.0008211981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854946,0.000113446666,0.00015698139,0.0008107337,0.00008063798,0.0002887468],"domain_scores_gemma":[0.9976596,0.000056322995,0.00020516558,0.0017689868,0.00010631406,0.00020361008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021305778,0.00020458944,0.00017663103,0.00015315098,0.0001950043,0.00015222226,0.0017327215,0.00024399476,0.00003156484],"category_scores_gemma":[0.0000104353385,0.00024842675,0.00009702813,0.00065090077,0.000056043547,0.0008663242,0.00082018407,0.0003894328,0.0003142498],"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.0000054536526,0.00031366717,0.0038037442,0.00003798946,0.000028747629,0.000029609379,0.0003475552,0.06293101,0.00036933366,0.9283373,0.00026961404,0.0035260026],"study_design_scores_gemma":[0.00019910374,0.000025871128,0.014205341,0.000044409753,0.00005120381,0.000005369407,0.000026941068,0.9192739,0.00023625123,0.06278099,0.0026821543,0.0004684712],"about_ca_topic_score_codex":0.00010564486,"about_ca_topic_score_gemma":0.000023791754,"teacher_disagreement_score":0.8655563,"about_ca_system_score_codex":0.00014675884,"about_ca_system_score_gemma":0.0001505238,"threshold_uncertainty_score":0.9999968},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97466135,0.00012810156,0.021563347,0.0002930669,0.00043502735,0.00031650584,0.000031380725,0.000057424964,0.0025137665],"genre_scores_gemma":[0.99195695,0.0009160178,0.006358585,0.000041584364,0.00029958526,0.0000252898,0.000034956603,0.0000146846605,0.00035234564],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984019,0.00008214936,0.00057442934,0.00046748325,0.00023898542,0.00023509028],"domain_scores_gemma":[0.99824226,0.00009519159,0.0003688002,0.0011395941,0.00009849197,0.000055675868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019687257,0.00020938859,0.0004405126,0.00021546801,0.00003848479,0.000019416204,0.0013219193,0.00016966664,0.000021973936],"category_scores_gemma":[0.000043469096,0.0002181032,0.000156413,0.00034960397,0.00014578926,0.00008353407,0.0012315005,0.00030846836,0.000038196442],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004352846,0.0017032548,0.7994365,0.0008701742,0.00028239537,0.00014989579,0.012989127,0.0016669402,0.04866468,0.08524527,0.004366586,0.044581644],"study_design_scores_gemma":[0.00058922876,0.000050932984,0.9380215,0.00017897025,0.000024960085,0.0000064784927,0.0000792856,0.021332879,0.03406878,0.0021863014,0.002995162,0.00046553992],"about_ca_topic_score_codex":0.00012262534,"about_ca_topic_score_gemma":0.000041218653,"teacher_disagreement_score":0.13858499,"about_ca_system_score_codex":0.000053608255,"about_ca_system_score_gemma":0.00021670909,"threshold_uncertainty_score":0.88939905},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63699883,0.00007938114,0.3565065,0.0001960502,0.00022704167,0.00023728849,0.000012122661,0.0003665517,0.0053762095],"genre_scores_gemma":[0.99435115,0.00005851764,0.0048575415,0.00010850423,0.000068138645,0.0000010960966,0.00001606578,0.000017471515,0.00052152335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983607,0.0000403759,0.00017599083,0.0010419474,0.000075103104,0.00030587506],"domain_scores_gemma":[0.9982745,0.00012773632,0.00018661215,0.0011493166,0.00006811371,0.00019369373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014225827,0.00027751704,0.0002563788,0.0001818164,0.0002496595,0.00021185166,0.0012742984,0.00031609365,0.000017189652],"category_scores_gemma":[0.000022375112,0.00032070297,0.00013524404,0.0003305946,0.00013108192,0.00030846507,0.0018215637,0.00078109995,0.0000434535],"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.000011090693,0.00017348546,0.006798298,0.00015088689,0.00012768384,0.00020858146,0.0011174326,0.018961163,0.0031440167,0.9593793,0.00008509494,0.009842922],"study_design_scores_gemma":[0.00026208622,0.000015288568,0.0016702136,0.000038393096,0.000046630914,0.000007905611,0.000053679403,0.9435114,0.00060503365,0.052716542,0.00066212623,0.0004106892],"about_ca_topic_score_codex":0.00011291672,"about_ca_topic_score_gemma":0.000025445157,"teacher_disagreement_score":0.92455024,"about_ca_system_score_codex":0.000041329968,"about_ca_system_score_gemma":0.00013042268,"threshold_uncertainty_score":0.9999245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61232346,0.000065860964,0.289189,0.001216485,0.00006306547,0.00011154593,0.0000036349434,0.000102662045,0.096924275],"genre_scores_gemma":[0.99316204,0.0000011452001,0.0021020093,0.000043075273,0.0000144050555,2.7457514e-7,0.0000014855613,9.747545e-7,0.004674603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971753,0.00001064075,0.000035833527,0.00009945727,0.00007158161,0.000064968124],"domain_scores_gemma":[0.9996345,0.00001492362,0.000019421734,0.0002884309,0.00001857395,0.00002413109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034890203,0.000028985529,0.000032374875,0.000008459587,0.00016604767,0.000009428204,0.00039505473,0.000011445814,0.00033253766],"category_scores_gemma":[6.675815e-7,0.000020924681,0.000025993144,0.00009700201,0.00010708018,0.00006424431,0.00026846613,0.000014010786,0.00021763638],"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.000024162444,0.00046673376,0.0013630226,0.0000035294045,0.000053775762,0.000010561085,0.010418838,0.0000102153035,0.35832706,0.44716924,0.13901204,0.04314082],"study_design_scores_gemma":[0.0005478458,0.00013856949,0.024465127,0.0000033887572,0.000007867448,0.00002326572,0.0006068021,0.07344161,0.7794959,0.0008924894,0.120205745,0.00017137823],"about_ca_topic_score_codex":0.0004498803,"about_ca_topic_score_gemma":0.00032151645,"teacher_disagreement_score":0.44627675,"about_ca_system_score_codex":0.000017638122,"about_ca_system_score_gemma":0.000012108363,"threshold_uncertainty_score":0.36410543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7079074,0.0009074731,0.28812903,0.00032522588,0.00022241849,0.00028775982,0.000015764945,0.000286461,0.0019184927],"genre_scores_gemma":[0.99468654,0.00021667125,0.0042183776,0.00008949633,0.00006266465,0.00009009004,0.00004570735,0.000011409628,0.0005790384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875194,0.000036144844,0.00023569996,0.00060242263,0.00017129359,0.00020247832],"domain_scores_gemma":[0.9987011,0.000031095355,0.00010513223,0.0010196642,0.000045427063,0.000097600634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015188652,0.00018690925,0.00019905932,0.000069355636,0.0001503798,0.00021890702,0.0006796306,0.00018081695,0.0000044794147],"category_scores_gemma":[0.000006752755,0.00018834833,0.00005357707,0.00012469375,0.000052468822,0.00019765008,0.00058123964,0.00028681365,0.00020166782],"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.000018489869,0.00070053013,0.06033119,0.0016985919,0.00032344757,0.00013219276,0.0042571817,0.32635313,0.006589377,0.5680648,0.004847609,0.02668346],"study_design_scores_gemma":[0.000102630365,0.000004907689,0.0120370155,0.000072672745,0.0000239184,0.000021181668,0.0000039875345,0.98170936,0.00018851281,0.0025413798,0.0030440844,0.0002503209],"about_ca_topic_score_codex":0.00010178796,"about_ca_topic_score_gemma":0.000004234543,"teacher_disagreement_score":0.6553563,"about_ca_system_score_codex":0.000042256288,"about_ca_system_score_gemma":0.0001123693,"threshold_uncertainty_score":0.76806223},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020261949,0.00042951835,0.047122736,0.01706674,0.00037328998,0.009162525,0.00065554323,0.00016842257,0.9047593],"genre_scores_gemma":[0.66096556,0.002084014,0.18972312,0.0003756149,0.0003584663,0.00011008359,0.0010732731,0.00011706363,0.14519279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969064,0.00073412916,0.00027976156,0.00078679796,0.00074652024,0.0005464194],"domain_scores_gemma":[0.99510425,0.0003337405,0.00023916255,0.003593504,0.0004937154,0.00023562336],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002613468,0.00021408667,0.00042972688,0.0003919073,0.0006037154,0.0013138487,0.03242209,0.00018413685,0.00009406823],"category_scores_gemma":[0.00006282169,0.0001797796,0.00011899317,0.001657843,0.00033396343,0.0010537264,0.08478931,0.0011191258,0.00015618668],"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.00013419345,0.002971799,0.00029106156,0.0002391917,0.00042756423,0.00014325841,0.0017821877,0.00021713562,0.005741216,0.7897805,0.045200232,0.15307166],"study_design_scores_gemma":[0.0011855547,0.00008961209,0.00477169,0.00029016487,0.000049459388,0.000009090311,0.00056190405,0.022645148,0.0011730454,0.007778031,0.9609365,0.0005098402],"about_ca_topic_score_codex":0.0060419203,"about_ca_topic_score_gemma":0.00017847508,"teacher_disagreement_score":0.9157362,"about_ca_system_score_codex":0.0001599357,"about_ca_system_score_gemma":0.001473496,"threshold_uncertainty_score":0.9997229},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8455341,0.00057206827,0.14470321,0.0015706604,0.000651566,0.00029703154,0.0000115285375,0.00076497474,0.0058949078],"genre_scores_gemma":[0.9902919,0.00023193938,0.007989752,0.00036683926,0.00023446117,0.000083518615,0.000045826193,0.000022040987,0.00073370937],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99839574,0.000031814696,0.00030159482,0.0006973758,0.00026215467,0.0003113409],"domain_scores_gemma":[0.9980284,0.000053998927,0.00019125633,0.0015419348,0.00009065108,0.00009377521],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013971418,0.0002297711,0.00023021275,0.00010030108,0.00024714603,0.00016428325,0.001704931,0.00017710497,0.000021006881],"category_scores_gemma":[0.000025716623,0.00023502369,0.00013951416,0.00025073832,0.00006301357,0.00015973025,0.0015719017,0.00044125228,0.0009174097],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055885484,0.00087344344,0.7988256,0.0006605316,0.00033803834,0.00041093907,0.00668769,0.0027203383,0.016389174,0.050500076,0.06022059,0.062367994],"study_design_scores_gemma":[0.00053831545,0.000046885005,0.5900303,0.0003458677,0.00005724581,0.00011138624,0.000055162905,0.09831084,0.010977504,0.00752236,0.29005882,0.0019453135],"about_ca_topic_score_codex":0.00018278793,"about_ca_topic_score_gemma":0.000011860858,"teacher_disagreement_score":0.22983822,"about_ca_system_score_codex":0.00004924365,"about_ca_system_score_gemma":0.00016082672,"threshold_uncertainty_score":0.99986047},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7478098,0.00048364105,0.24742685,0.0012606401,0.00044860248,0.0003930726,0.0000067050796,0.0006396369,0.001530993],"genre_scores_gemma":[0.9736935,0.0001079828,0.025326956,0.00032614183,0.00011137723,0.000081237566,0.0000666004,0.000025894733,0.0002603037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975753,0.0000939245,0.00050622865,0.0010291445,0.00031578852,0.00047960892],"domain_scores_gemma":[0.9973219,0.000078306424,0.00022356464,0.0021979632,0.00004270732,0.00013557686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042257385,0.000345222,0.00040293386,0.00034414983,0.00010639021,0.00023735307,0.0024887142,0.00027392904,0.00001954269],"category_scores_gemma":[0.000037609243,0.00037322714,0.00018658939,0.00054957985,0.00004602424,0.00026153465,0.0017858489,0.0006845011,0.0004370405],"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.000036649264,0.0045147617,0.2639195,0.0016676325,0.0005722816,0.0026823797,0.013427736,0.05307587,0.1859537,0.08258786,0.018400526,0.3731611],"study_design_scores_gemma":[0.0011259055,0.00008182623,0.18213192,0.00058737665,0.00005771274,0.000023156626,0.00006281699,0.74928534,0.02461136,0.016224416,0.023756048,0.002052136],"about_ca_topic_score_codex":0.000097623146,"about_ca_topic_score_gemma":0.000010337131,"teacher_disagreement_score":0.69620943,"about_ca_system_score_codex":0.0001392995,"about_ca_system_score_gemma":0.0001406291,"threshold_uncertainty_score":0.99987197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3847694,0.00072024664,0.61196905,0.00040109875,0.00046723525,0.00059085025,0.00003055015,0.00033143925,0.00072009576],"genre_scores_gemma":[0.9871566,0.00014596767,0.011212595,0.00013807866,0.00007720488,0.00010690455,0.00035270982,0.00004124361,0.0007686804],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975776,0.00017188318,0.00068371196,0.0008431714,0.00039170554,0.00033192887],"domain_scores_gemma":[0.99705964,0.00012027551,0.00049726653,0.0020523942,0.00014203493,0.00012840494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004680744,0.0003449487,0.0005422731,0.00014201096,0.00012683962,0.000094230374,0.0016465429,0.0003137021,0.000052659143],"category_scores_gemma":[0.00008336803,0.00035244683,0.00023858962,0.00042760756,0.00008658183,0.0001912168,0.0008799996,0.0003887641,0.00027116778],"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.0002479739,0.008390376,0.13194707,0.005237093,0.002357318,0.00017544253,0.0077145677,0.035191644,0.57332796,0.101013474,0.0957632,0.038633905],"study_design_scores_gemma":[0.009647603,0.00015408026,0.019952282,0.0005603977,0.00042517477,0.0000190961,0.00003824845,0.68413204,0.23847546,0.007970568,0.035909094,0.0027159455],"about_ca_topic_score_codex":0.000042163236,"about_ca_topic_score_gemma":0.0000017939973,"teacher_disagreement_score":0.6489404,"about_ca_system_score_codex":0.00005736174,"about_ca_system_score_gemma":0.00020711168,"threshold_uncertainty_score":0.9998928},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9606731,0.00028363863,0.023822702,0.0025367485,0.0012448903,0.004528715,0.0004688924,0.00035869356,0.0060826205],"genre_scores_gemma":[0.98412615,0.0000020884281,0.014542179,0.000036713744,0.00003849786,0.00004098007,0.000016731196,0.00001045007,0.0011861932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989646,0.000002832695,0.00018045586,0.0004103647,0.00025691013,0.00018482542],"domain_scores_gemma":[0.9988802,0.000017440829,0.00015006556,0.0008046628,0.00010426227,0.00004338615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002248758,0.000097957345,0.00013296609,0.00003439039,0.00010717941,0.00018041274,0.0031594306,0.000036556798,0.0000089844625],"category_scores_gemma":[0.000006750296,0.00006853931,0.00003421344,0.00023183288,0.000023404224,0.0002316788,0.0010247264,0.000055160835,0.000019502011],"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.00001953993,0.00030865616,0.0007894957,0.0018829304,0.00010837729,2.2541487e-7,0.000534512,0.0011728538,0.16293555,0.78251517,0.04572699,0.0040057027],"study_design_scores_gemma":[0.00038447266,0.000030592033,0.0007589116,0.00009179006,0.0000288471,0.000005074824,0.00014182625,0.93239117,0.009447685,0.0013847395,0.05517571,0.00015920468],"about_ca_topic_score_codex":0.000004851066,"about_ca_topic_score_gemma":4.9363445e-7,"teacher_disagreement_score":0.93121827,"about_ca_system_score_codex":0.000020477744,"about_ca_system_score_gemma":0.000020739417,"threshold_uncertainty_score":0.5871061},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6572585,0.0010749447,0.34058422,0.000119837576,0.00017057886,0.00020767226,0.000007374785,0.00017260203,0.00040426673],"genre_scores_gemma":[0.99878544,0.000049297498,0.00074314594,0.00003275145,0.00005220585,0.000029944249,0.000008209716,0.000008553983,0.0002904533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985667,0.00030799842,0.00026112775,0.00042872765,0.00019982744,0.00023561118],"domain_scores_gemma":[0.99910814,0.00018551825,0.00005545807,0.0004751629,0.000019788133,0.00015593112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081601436,0.00014737286,0.00023391463,0.00007034258,0.00020735823,0.000066553395,0.00033720428,0.00011550461,0.0000035670798],"category_scores_gemma":[0.000042112497,0.00012641816,0.00003452723,0.0002165748,0.00016308934,0.0002181711,0.00019068095,0.00017336677,0.000026103105],"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.000025416006,0.00019541748,0.0020569633,0.00008906098,0.000018360113,0.000116617106,0.0009274708,0.00029187644,0.0036468168,0.98929405,0.00012337633,0.003214544],"study_design_scores_gemma":[0.00075914705,0.00005056628,0.013772395,0.000072362156,0.000008014361,0.00020958028,0.000048985345,0.9652254,0.00015242895,0.017406084,0.0019697049,0.00032534864],"about_ca_topic_score_codex":0.00007797713,"about_ca_topic_score_gemma":0.000009191964,"teacher_disagreement_score":0.971888,"about_ca_system_score_codex":0.000026683518,"about_ca_system_score_gemma":0.00003300556,"threshold_uncertainty_score":0.5155183},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12833086,0.00049969123,0.8546112,0.0027267511,0.000540667,0.0005526103,0.000030245303,0.0004002719,0.012307674],"genre_scores_gemma":[0.99513805,0.000001328972,0.003888261,0.00004492276,0.00007449857,0.000022906219,0.000009225812,0.000008259759,0.0008125507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990215,0.000060335882,0.00029466915,0.00020786548,0.00024435497,0.0001713018],"domain_scores_gemma":[0.99862206,0.000037565966,0.00015560907,0.0010815432,0.000056518078,0.0000467149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016052487,0.00009698523,0.00015756144,0.000038237547,0.00014070095,0.00008480666,0.0013187119,0.00004058103,0.00001472294],"category_scores_gemma":[0.0000058104247,0.00007216818,0.00008778272,0.0003326509,0.000054549135,0.00011799768,0.0002787404,0.00006685732,0.00012482455],"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":[3.8958242e-7,0.000087166016,0.00056445197,0.000061574654,0.000015682936,9.199807e-7,0.0003002084,0.0015873101,0.028135795,0.96106935,0.0037637202,0.004413422],"study_design_scores_gemma":[0.0001057675,0.0000055859546,0.0025977853,0.000021151767,0.0000046485848,0.00001479815,0.000026843625,0.95666957,0.0030965344,0.00071487424,0.036647122,0.00009528822],"about_ca_topic_score_codex":0.00006767625,"about_ca_topic_score_gemma":0.000018469844,"teacher_disagreement_score":0.9603545,"about_ca_system_score_codex":0.00006330135,"about_ca_system_score_gemma":0.0000399319,"threshold_uncertainty_score":0.29429328},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035233337,0.00006971172,0.89323795,0.0063108364,0.0000739131,0.00013107386,0.000016036782,0.00018492066,0.0647422],"genre_scores_gemma":[0.89334184,0.000026149257,0.10178453,0.00005031336,0.000012897895,0.000014006643,0.00006142968,0.000012206728,0.004696653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981271,0.00072791224,0.0002927848,0.0003765185,0.00025633856,0.00021936861],"domain_scores_gemma":[0.99667215,0.00034666483,0.00019823664,0.0017602106,0.00091909664,0.000103648854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015153737,0.0001244687,0.00014728196,0.0000920243,0.00024338503,0.00015281852,0.0014463979,0.00006613915,0.0000716521],"category_scores_gemma":[0.00017302718,0.00012693083,0.00008154252,0.00056222273,0.00024274227,0.0002345242,0.00057371473,0.0001015478,0.0000869515],"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.0000010299929,0.00012490313,0.00061955367,0.000011902817,0.000012361995,9.2439e-7,0.0018096037,0.0000014932764,0.005414726,0.96598345,0.00046094178,0.025559135],"study_design_scores_gemma":[0.0006549034,0.0000019110998,0.0125736855,0.00031966262,0.000028292116,0.00003537854,0.000112770154,0.6537551,0.27248406,0.028961029,0.030541118,0.0005320632],"about_ca_topic_score_codex":0.00041142348,"about_ca_topic_score_gemma":0.0013151836,"teacher_disagreement_score":0.9370224,"about_ca_system_score_codex":0.000042288473,"about_ca_system_score_gemma":0.00008707695,"threshold_uncertainty_score":0.5176089},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23096517,0.00003290899,0.76572216,0.00026751013,0.00063562504,0.0003843635,0.000003390479,0.00032216287,0.0016667235],"genre_scores_gemma":[0.99085206,3.794372e-7,0.008641015,0.00010279195,0.00015751601,0.000062893865,0.0000133952035,0.000015254775,0.00015470838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977342,0.00019556152,0.00058730936,0.00059260486,0.00045481444,0.00043551088],"domain_scores_gemma":[0.9982962,0.0001287575,0.00011733657,0.0011684416,0.000080708836,0.00020853861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074754155,0.00017820286,0.00029940216,0.00015490051,0.00011808703,0.00045387613,0.0016111864,0.000065545675,0.00003196736],"category_scores_gemma":[0.00008558477,0.00019149318,0.00006824805,0.000685091,0.000037044007,0.0005564848,0.0007452668,0.000111323294,0.00076246215],"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.0000034824773,0.0001472419,0.0029451926,0.0001440552,0.000013714204,0.000016476302,0.00064889767,0.0058669676,0.39020407,0.59702396,0.0013890474,0.0015968704],"study_design_scores_gemma":[0.000278107,0.00003333399,0.012566258,0.00005732164,0.0000035019796,0.000012310855,0.000022581104,0.9788204,0.0011576378,0.0009774549,0.005816324,0.00025480907],"about_ca_topic_score_codex":0.0002661807,"about_ca_topic_score_gemma":0.000031428404,"teacher_disagreement_score":0.9729534,"about_ca_system_score_codex":0.00006455203,"about_ca_system_score_gemma":0.00003967728,"threshold_uncertainty_score":0.98001623},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32520163,0.000052623214,0.6741138,0.00035292812,0.000021619995,0.000038820443,0.0000069197076,0.00007478264,0.0001368781],"genre_scores_gemma":[0.97210455,0.000009889664,0.02775962,0.000041698568,0.000028465407,0.0000021014803,0.0000054872958,0.0000058323503,0.000042332682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866974,0.00006358177,0.0003393928,0.00039566986,0.00028950072,0.0002421316],"domain_scores_gemma":[0.99867654,0.00021622036,0.00019265358,0.00075225416,0.000074804324,0.000087545806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021413356,0.00011994479,0.00029101185,0.00022515215,0.000119053766,0.00005930861,0.0007932874,0.000047660706,0.000049911458],"category_scores_gemma":[0.00004071949,0.00008463595,0.00028072452,0.0015544555,0.00010988386,0.00029699013,0.00034495487,0.000049419785,0.000024757128],"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.000018083372,0.00027099447,0.094169445,0.00006748476,0.0020580217,0.000036627596,0.0012467236,0.004258857,0.28591263,0.54701596,0.00020466522,0.06474049],"study_design_scores_gemma":[0.00020442181,0.00002199517,0.068151094,0.00004540346,0.00045626977,0.0000028514082,0.000027778187,0.920617,0.006839757,0.0031314502,0.00024438405,0.00025763141],"about_ca_topic_score_codex":0.000052468356,"about_ca_topic_score_gemma":0.000012804998,"teacher_disagreement_score":0.9163581,"about_ca_system_score_codex":0.000033632834,"about_ca_system_score_gemma":0.00003880186,"threshold_uncertainty_score":0.3451354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9390509,0.0023714025,0.053456444,0.0008992628,0.000397433,0.0008232213,0.0000045375955,0.000082765175,0.0029139975],"genre_scores_gemma":[0.99697274,0.00001472077,0.0027182135,0.000022345943,0.000081586666,0.00001070598,8.0710487e-7,0.00000859637,0.00017029297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850875,0.000224443,0.00051849824,0.00030841498,0.00018316419,0.00025672474],"domain_scores_gemma":[0.9984236,0.0003140429,0.00026973838,0.00084245746,0.00011763419,0.000032576903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024479623,0.00011487171,0.0002587099,0.00010842675,0.000116682604,0.000073398485,0.00089297513,0.000045300265,0.0000010953621],"category_scores_gemma":[0.00005117872,0.000089700006,0.000023640629,0.00056953076,0.00027642158,0.00014309064,0.0003429478,0.000096237294,0.0000059962285],"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.0000119797405,0.000112169095,0.0012977129,0.0002797062,0.000016771666,0.0000018836884,0.010956996,0.00007631712,0.004008757,0.97429127,0.00055776595,0.008388699],"study_design_scores_gemma":[0.0043126014,0.00092747225,0.026554111,0.0034679207,0.00003521689,0.00015390306,0.0034455012,0.458841,0.031628978,0.46191034,0.007644889,0.0010780528],"about_ca_topic_score_codex":0.00023721738,"about_ca_topic_score_gemma":0.00002214286,"teacher_disagreement_score":0.5123809,"about_ca_system_score_codex":0.000022300677,"about_ca_system_score_gemma":0.0000527796,"threshold_uncertainty_score":0.36578602},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28614634,0.002730183,0.7072327,0.0003501417,0.00061154756,0.00052288244,0.000009703773,0.0005078548,0.0018885996],"genre_scores_gemma":[0.99893045,0.0000224183,0.00034169207,0.000092327835,0.0000995005,0.0000350766,0.000014796432,0.000010491717,0.00045321675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978343,0.00047097876,0.00046137883,0.0005581809,0.00027103344,0.00040409688],"domain_scores_gemma":[0.9986671,0.00029515542,0.00011154589,0.000712283,0.00002399222,0.00018989996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013320751,0.00021681678,0.00034093327,0.00014695892,0.00017800399,0.0004039931,0.00067948183,0.00015648938,0.0000052550754],"category_scores_gemma":[0.000040221552,0.00019301083,0.0000635154,0.0003875801,0.00006978971,0.00036235416,0.00013045994,0.00022353101,0.0000749293],"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.000011986538,0.000096557465,0.00006466381,0.000054345768,0.000009520289,0.00005401016,0.00034885708,0.0024715946,0.0050065,0.9883995,0.00013150646,0.003350962],"study_design_scores_gemma":[0.00046371,0.00006352818,0.00080127496,0.00015409279,0.000008879296,0.00010780926,0.00023230257,0.98537666,0.00006784099,0.010162951,0.0022585914,0.00030233373],"about_ca_topic_score_codex":0.00008010155,"about_ca_topic_score_gemma":0.0000026122907,"teacher_disagreement_score":0.9829051,"about_ca_system_score_codex":0.00007710841,"about_ca_system_score_gemma":0.000036079477,"threshold_uncertainty_score":0.78707534},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0099674845,0.00004640066,0.119014755,0.00021143966,0.00050880486,0.0006912753,0.00037663514,0.00083682395,0.8683464],"genre_scores_gemma":[0.89024377,0.00004758165,0.00076638366,0.00031255218,0.000062563144,0.0000014312875,0.00022071699,0.000024915189,0.108320095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987039,0.000011859281,0.00023050104,0.0005894555,0.00017095539,0.0002933314],"domain_scores_gemma":[0.99775064,0.00005264639,0.00038600838,0.0014177633,0.00020655725,0.00018635731],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012176339,0.00032561008,0.0002608824,0.00024438565,0.0005918539,0.00033367827,0.0015109014,0.000232933,0.000075875905],"category_scores_gemma":[0.000006349516,0.0003640312,0.00017869043,0.00006310542,0.000156609,0.0013463594,0.00045681893,0.00031745565,0.0010251688],"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.000013120199,0.000021788632,0.000009995132,0.000015884494,0.00003379287,0.000054698245,0.00007611135,0.079637766,0.000013473188,0.9169773,0.0009673975,0.0021786839],"study_design_scores_gemma":[0.00057105557,0.00004269719,0.00011325766,0.00007669877,0.000029614715,0.000010162561,0.0000019972808,0.9025888,0.000060205977,0.07900282,0.017053628,0.00044905386],"about_ca_topic_score_codex":0.00008385187,"about_ca_topic_score_gemma":0.000030594903,"teacher_disagreement_score":0.88027626,"about_ca_system_score_codex":0.00015810694,"about_ca_system_score_gemma":0.00018477078,"threshold_uncertainty_score":0.99988115},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057088333,0.000056785357,0.9967086,0.00041307553,0.00063794444,0.0009678758,0.00014684747,0.00009158385,0.00040640478],"genre_scores_gemma":[0.62626404,0.00005174276,0.3685144,0.0002813301,0.000130521,0.0007796566,0.000043808777,0.000024015777,0.0039104954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989796,0.000021692778,0.00026722933,0.00039272982,0.00015788391,0.00018084748],"domain_scores_gemma":[0.99755645,0.00072476076,0.00020003108,0.0013665388,0.00011473328,0.00003746732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002502147,0.00015324839,0.00022764604,0.00005139431,0.00007614813,0.00012711078,0.00163239,0.00008316858,0.0000103358725],"category_scores_gemma":[0.000031490457,0.00010523463,0.00017658834,0.000103823324,0.00005862703,0.000045427587,0.000982941,0.0001642711,0.00003684392],"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.0000036651572,0.00027604704,0.000010671371,0.00062522636,0.00023480749,0.0000049817395,0.0030665544,0.03286991,0.0004754085,0.05686253,0.0029205724,0.90264964],"study_design_scores_gemma":[0.000094844945,0.000021174155,0.000033849534,0.000020963746,0.00001734355,0.0000031017871,0.000005951085,0.97487617,0.0022224628,0.017556865,0.0050147106,0.00013255305],"about_ca_topic_score_codex":0.00008821614,"about_ca_topic_score_gemma":0.00000534932,"teacher_disagreement_score":0.9420063,"about_ca_system_score_codex":0.000015164992,"about_ca_system_score_gemma":0.000117457654,"threshold_uncertainty_score":0.42913434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8011765,0.0000558196,0.1917013,0.0005175882,0.00044928765,0.0008693371,0.000044757086,0.0004089786,0.004776424],"genre_scores_gemma":[0.9886473,0.00001556806,0.009193637,0.00012170625,0.000051261366,0.000039028397,0.00005275668,0.00001973351,0.0018590476],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982072,0.00006820742,0.0003343685,0.00057694566,0.0004998971,0.00031336886],"domain_scores_gemma":[0.99801123,0.000058269183,0.00028278973,0.0013799552,0.00015776342,0.00011000127],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019919235,0.00024850864,0.00031808496,0.00015361652,0.00009296757,0.00018761674,0.00101592,0.00009525604,0.00021232832],"category_scores_gemma":[0.000009243232,0.00021141731,0.00007810572,0.00031545953,0.00007514481,0.000493514,0.00014515097,0.00016321719,0.0011484483],"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.000022894656,0.00058390293,0.0012434598,0.00027386151,0.00018879077,0.000042317988,0.0029356948,0.00268421,0.69190955,0.19773518,0.009793598,0.092586555],"study_design_scores_gemma":[0.0007661724,0.00025792522,0.0012577748,0.00014965846,0.00004280703,0.000012029075,0.00009035688,0.93684983,0.058480244,0.00062174664,0.0010748958,0.00039657505],"about_ca_topic_score_codex":0.00013930652,"about_ca_topic_score_gemma":0.000019565558,"teacher_disagreement_score":0.9341656,"about_ca_system_score_codex":0.00003849333,"about_ca_system_score_gemma":0.00018100545,"threshold_uncertainty_score":0.99962926},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026610766,0.00004591982,0.9677052,0.0038708951,0.000031318206,0.000069417525,0.0000022405745,0.00007837426,0.0015858518],"genre_scores_gemma":[0.98240703,0.000005410999,0.017208463,0.00027979424,0.000034805646,0.0000057179095,0.0000040777372,0.0000020963953,0.000052595853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996101,0.000009852216,0.000093323295,0.00012168232,0.00009904368,0.0000659566],"domain_scores_gemma":[0.9996886,0.000011623124,0.000035958186,0.00019955437,0.000020833897,0.000043395743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000026168846,0.00003542817,0.000054846685,0.000012872472,0.000023812401,0.000021080854,0.00025460473,0.000014398806,0.000026864953],"category_scores_gemma":[0.000005908368,0.000033369968,0.00002629033,0.00015366811,0.000009258781,0.00015078155,0.00006723606,0.000028316688,0.00006159955],"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.0000010938926,0.000021290003,0.00006659729,0.0000065522227,0.000004565366,0.0000011108579,0.0010604716,0.0012988613,0.049101382,0.9401227,0.001992695,0.0063226637],"study_design_scores_gemma":[0.00015396051,0.000026468791,0.00035307722,0.0000023997545,0.0000035228666,0.0000010705913,0.000013505068,0.921201,0.05557484,0.013631417,0.00897338,0.000065339416],"about_ca_topic_score_codex":0.000011093829,"about_ca_topic_score_gemma":3.2324346e-7,"teacher_disagreement_score":0.9557963,"about_ca_system_score_codex":0.0000064841583,"about_ca_system_score_gemma":0.000017247477,"threshold_uncertainty_score":0.13607879},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49236208,0.0002128458,0.5062918,0.000025951847,0.00018756265,0.00033572727,0.000021335092,0.000033520857,0.00052913715],"genre_scores_gemma":[0.9989991,0.0000042968823,0.0008479182,0.000008599663,0.0000111292575,0.000014172119,0.000007998417,0.000004512026,0.000102246064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991486,0.00012295859,0.00027534683,0.00020782778,0.00012791686,0.00011736565],"domain_scores_gemma":[0.99879265,0.0005833192,0.00010941506,0.00039384313,0.000071600414,0.00004919906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066494,0.000071821174,0.00021875057,0.000031868636,0.000032707085,0.000019695684,0.00026853365,0.000055000415,0.000013544634],"category_scores_gemma":[0.00008502968,0.000058654925,0.000054374166,0.00011892409,0.00006782215,0.00008477044,0.00008023162,0.000045189943,0.0000065485788],"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.000064028834,0.000066607456,0.0016867619,0.00030225934,0.000020533842,2.6505208e-7,0.00040820174,0.00013629098,0.01772972,0.97717494,0.00001235947,0.0023980166],"study_design_scores_gemma":[0.0023913211,0.001186016,0.014605098,0.0003487328,0.00009114544,0.000027605562,0.00087204156,0.80612314,0.013062485,0.15304595,0.007450945,0.0007955419],"about_ca_topic_score_codex":0.000014136657,"about_ca_topic_score_gemma":0.0000016848936,"teacher_disagreement_score":0.824129,"about_ca_system_score_codex":0.000010825454,"about_ca_system_score_gemma":0.00004209917,"threshold_uncertainty_score":0.23918785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046604645,0.0057905815,0.7845335,0.051874124,0.00083894236,0.0010828554,0.000110969995,0.0009875613,0.10817684],"genre_scores_gemma":[0.7988146,0.0010149247,0.1136289,0.0002041165,0.000063903026,0.00019845071,0.0006622124,0.000097194876,0.08531568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98960096,0.005671234,0.0011193642,0.0018964286,0.00084003905,0.0008719968],"domain_scores_gemma":[0.98831683,0.0020471744,0.0009797524,0.0057844426,0.0024244403,0.00044733446],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0052213883,0.0007562486,0.00074391573,0.0002795631,0.0011869122,0.0018903172,0.0048800553,0.000614455,0.00043811815],"category_scores_gemma":[0.0007714328,0.000860199,0.0005766391,0.00086069776,0.00061248115,0.0005184539,0.004534623,0.0010756773,0.0012822968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.0000031116656,0.0010363206,0.000979956,0.00028654677,0.000085639156,0.0000101191445,0.0077943946,0.000625974,0.007838754,0.8904731,0.0035988695,0.087267175],"study_design_scores_gemma":[0.0007809011,9.770728e-7,0.013752053,0.0025744908,0.00009297014,0.00006065194,0.0001670377,0.4801635,0.12202948,0.01563985,0.3634542,0.0012838622],"about_ca_topic_score_codex":0.011297337,"about_ca_topic_score_gemma":0.0019237468,"teacher_disagreement_score":0.8748333,"about_ca_system_score_codex":0.00027501708,"about_ca_system_score_gemma":0.0012391594,"threshold_uncertainty_score":0.9994953},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.383809,0.000050484065,0.60962045,0.0004380904,0.000018332741,0.000068371635,1.8280082e-7,0.00021739151,0.0057777213],"genre_scores_gemma":[0.9681581,0.000002928298,0.030555567,0.00018853173,0.000010458254,0.0000025193845,0.0000018443269,0.0000028678082,0.0010771727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996795,0.000004566892,0.00006221856,0.0001408126,0.00005040149,0.00006252145],"domain_scores_gemma":[0.99971646,0.00002637282,0.000008868764,0.00021232535,0.000005397666,0.000030580242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002146112,0.00003553823,0.000038367085,0.000023776554,0.00003274887,0.00010748549,0.00016098961,0.000016161883,0.000060730432],"category_scores_gemma":[7.581969e-7,0.00003101104,0.0000123291575,0.000112696405,0.0000037269135,0.00048229072,0.00008985262,0.00002384201,0.00014415637],"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":[5.3504357e-7,0.000016550943,0.00016415038,0.000007014477,0.0000028269665,5.998541e-7,0.00022352436,0.8506272,0.00021438785,0.10905246,0.00011062078,0.039580178],"study_design_scores_gemma":[0.000066218374,0.0000047936132,0.000078412064,0.0000018188596,6.080234e-7,0.0000017794731,0.0000072014927,0.9960883,0.000058959286,0.0009018042,0.0027426651,0.000047426336],"about_ca_topic_score_codex":8.754886e-7,"about_ca_topic_score_gemma":2.1490581e-7,"teacher_disagreement_score":0.5843491,"about_ca_system_score_codex":0.0000015353921,"about_ca_system_score_gemma":0.0000136462095,"threshold_uncertainty_score":0.18528865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20155813,0.002013306,0.75758934,0.027231695,0.0038959584,0.00041739264,0.000011271028,0.00018728703,0.007095619],"genre_scores_gemma":[0.9688252,0.0000645551,0.029744098,0.00064186903,0.0006474785,0.00000224151,6.891952e-7,0.000010666103,0.00006315535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912584,0.00015111837,0.0002788748,0.00012359732,0.00020284629,0.000117724114],"domain_scores_gemma":[0.99911165,0.00024403934,0.00021135448,0.0001373612,0.00012498621,0.00017063138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035428273,0.00009383806,0.00022203694,0.000022604945,0.00009985809,0.00014854652,0.00043379999,0.000046519515,0.000025076772],"category_scores_gemma":[0.0001468928,0.00007754031,0.0000724244,0.00022488796,0.00008017611,0.00056245964,0.00015457098,0.00018312108,0.0000069201687],"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.00020620912,0.000056102563,0.000018790632,0.000006935985,0.000039223287,0.00004089725,0.0016074543,0.0000022163993,0.0020730153,0.9847185,0.00042513557,0.010805533],"study_design_scores_gemma":[0.003035971,0.0018908955,0.0008082127,0.0000448961,0.00008849105,0.00048752688,0.0007152785,0.00122195,0.011032898,0.8538146,0.1264987,0.00036060088],"about_ca_topic_score_codex":0.0000010064522,"about_ca_topic_score_gemma":8.2178374e-8,"teacher_disagreement_score":0.7672671,"about_ca_system_score_codex":0.00001544028,"about_ca_system_score_gemma":0.00006699929,"threshold_uncertainty_score":0.31620023},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16005816,0.0006897427,0.8304433,0.0055976347,0.0010245838,0.000085751264,1.9040485e-7,0.00004912617,0.0020514757],"genre_scores_gemma":[0.99917394,0.00010296592,0.00032317982,0.00009794818,0.000095659074,0.0000019095585,1.8975598e-7,0.0000066211687,0.00019757917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902225,0.000038142647,0.00023920386,0.00008413037,0.00029176747,0.0003244935],"domain_scores_gemma":[0.99890953,0.00011020326,0.00023962634,0.0005257681,0.00014751735,0.00006732926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008110355,0.00008215114,0.00012280792,0.000059847687,0.00015412184,0.000089553105,0.0017453276,0.0000402846,0.000008677941],"category_scores_gemma":[0.000037496204,0.000053993932,0.0000957767,0.00042708562,0.000041276267,0.00021978845,0.0000920144,0.0008850936,0.000027774702],"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.0000012504111,0.00006299741,0.000028050974,9.652315e-7,0.0000141865985,0.0000020738137,0.00010858849,0.0000062939475,0.008830274,0.98846245,0.00074198627,0.0017408866],"study_design_scores_gemma":[0.00031763667,0.00012521286,0.00029052974,0.0000026627235,0.00001385491,0.0004181883,0.000012959355,0.001968386,0.009371169,0.92650646,0.060885496,0.000087450615],"about_ca_topic_score_codex":0.0000021245046,"about_ca_topic_score_gemma":0.0000030659362,"teacher_disagreement_score":0.8391158,"about_ca_system_score_codex":0.000047363115,"about_ca_system_score_gemma":0.0003412155,"threshold_uncertainty_score":0.38453403},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51320267,0.0003135671,0.48430485,0.0011225028,0.00014761132,0.00036656932,0.000009082149,0.00034413976,0.00018901561],"genre_scores_gemma":[0.9784557,0.000010954624,0.021261383,0.0001023144,0.00007534959,0.000059833124,0.000003782113,0.000007848169,0.000022830116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812394,0.00008045632,0.00033596766,0.0007730488,0.0003650003,0.0003215853],"domain_scores_gemma":[0.9989413,0.000038846356,0.00012101962,0.00060444593,0.00004750389,0.00024686966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003025437,0.00021276074,0.00022863515,0.000034192683,0.0007825118,0.0009429589,0.00092774536,0.0000389578,0.0000013788243],"category_scores_gemma":[0.000038654132,0.0001811802,0.00004952421,0.0009648726,0.00022906426,0.0016963527,0.00077814073,0.00012808715,0.00001617648],"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.000050073024,0.0013204694,0.02172034,0.0008524359,0.0002714666,0.016716564,0.3367159,0.065461844,0.03177051,0.44868916,0.0021466296,0.074284576],"study_design_scores_gemma":[0.00016986036,0.00019487941,0.000055382763,0.000026464599,0.00001539433,0.0007899291,0.017117763,0.9792492,0.00030340618,0.00061202305,0.0012010437,0.0002646878],"about_ca_topic_score_codex":0.001896488,"about_ca_topic_score_gemma":0.0001218236,"teacher_disagreement_score":0.9137873,"about_ca_system_score_codex":0.000039640552,"about_ca_system_score_gemma":0.000094738185,"threshold_uncertainty_score":0.90929747},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12003868,0.0000492542,0.8774409,0.0018481143,0.00017478314,0.00006498451,0.000044286728,0.000058264064,0.0002806827],"genre_scores_gemma":[0.95027816,0.0000016773404,0.049352705,0.0001654432,0.00014410452,0.0000030145047,0.000032026295,0.0000149462385,0.000007902718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980482,0.000054477558,0.0007217757,0.00021007168,0.0008189274,0.00014656149],"domain_scores_gemma":[0.99819076,0.00018660242,0.00081093743,0.00020218959,0.00048408288,0.00012544314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020148768,0.00014399721,0.00028083552,0.000043418004,0.000051759736,0.0001019302,0.0013757095,0.00005281543,0.000007043721],"category_scores_gemma":[0.00004884813,0.0001410724,0.0001992403,0.00018874566,0.00004045219,0.00040497616,0.00032936616,0.0002352295,0.000015466927],"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.00009081063,0.0010042215,0.0020035408,0.0003492616,0.00083980215,0.00021256067,0.0033748094,0.06280709,0.311029,0.5432698,0.0015107075,0.07350838],"study_design_scores_gemma":[0.0004019486,0.0000272212,0.000019632025,0.00011378267,0.000016358888,0.0000733108,0.000039588493,0.9776071,0.012740953,0.008790446,0.00005199119,0.00011772137],"about_ca_topic_score_codex":0.000010129963,"about_ca_topic_score_gemma":5.143988e-7,"teacher_disagreement_score":0.9147999,"about_ca_system_score_codex":0.00013174537,"about_ca_system_score_gemma":0.00013142597,"threshold_uncertainty_score":0.5752766},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026467144,0.00018232102,0.38859737,0.0007211473,0.00041927525,0.002487526,0.000021106955,0.000033579494,0.58107054],"genre_scores_gemma":[0.18870154,0.0000063419857,0.7473929,0.00035663016,0.00018992966,0.0006809899,0.0038037638,0.00008393886,0.05878398],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983393,0.000035536792,0.00031104241,0.000798577,0.00029228767,0.00022323563],"domain_scores_gemma":[0.99862516,0.000023508068,0.00014608951,0.00094390934,0.000048438284,0.00021287522],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013941062,0.00023465684,0.00031063202,0.000095252144,0.00013992116,0.0009448066,0.0035775916,0.00013423925,0.0002538418],"category_scores_gemma":[0.000019409374,0.00023837728,0.00008537684,0.0006452039,0.000008037558,0.0002565995,0.00044439564,0.00016923361,0.0059073553],"study_design_candidate":"design_other","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.000021487996,0.00077135843,0.000005725667,0.00029941896,0.00019329449,0.00006273513,0.032002445,0.000064298605,0.06560429,0.05964487,0.019956585,0.82137346],"study_design_scores_gemma":[0.00052613695,0.00011456018,0.00031261618,0.00018053359,0.00013445245,0.000016063688,0.0012757783,0.06813862,0.17140147,0.0025574304,0.75372183,0.0016205299],"about_ca_topic_score_codex":0.000021745887,"about_ca_topic_score_gemma":0.000013120235,"teacher_disagreement_score":0.81975293,"about_ca_system_score_codex":0.000029418054,"about_ca_system_score_gemma":0.00019423375,"threshold_uncertainty_score":0.99486667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9433876,0.00019507704,0.05290376,0.0022725188,0.00008806512,0.0005169239,0.0000014669308,0.00015615037,0.00047841982],"genre_scores_gemma":[0.9936582,0.000001392932,0.0061592334,0.00013723393,0.000019024343,0.000006027496,4.2571406e-7,0.000008900675,0.000009602986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836576,0.00013692793,0.00052948523,0.00038416905,0.0003566242,0.0002270632],"domain_scores_gemma":[0.9984053,0.00015291729,0.00031349022,0.0007752588,0.00027301905,0.00008002993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005190024,0.00014039154,0.0002763605,0.000025534762,0.00020398427,0.00004832457,0.0016520066,0.00005700574,0.0000012593375],"category_scores_gemma":[0.00035459438,0.00011101231,0.00013339515,0.0010240995,0.00016687225,0.00015697311,0.0013512566,0.00021496782,0.000003836375],"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.000010557795,0.0007096284,0.022186983,0.0015790068,0.000049427992,0.0000013868353,0.017235823,0.014425579,0.02198839,0.91521543,0.00021715068,0.006380642],"study_design_scores_gemma":[0.0004010147,0.00008143306,0.0022095866,0.00013829464,0.0000203493,0.000004445256,0.000107529086,0.8602547,0.10246876,0.0333911,0.0007038165,0.00021894125],"about_ca_topic_score_codex":0.000025007816,"about_ca_topic_score_gemma":3.5093188e-7,"teacher_disagreement_score":0.8818243,"about_ca_system_score_codex":0.000049059836,"about_ca_system_score_gemma":0.00012178723,"threshold_uncertainty_score":0.45269507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14226724,0.00008071353,0.83638066,0.017267419,0.0003513723,0.000087142675,0.0000039658107,0.00034455804,0.003216933],"genre_scores_gemma":[0.88170546,0.000015117876,0.09377445,0.023207,0.000502925,0.000020746875,0.00003199394,0.00003646616,0.00070585654],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988096,0.000074081734,0.00015483581,0.000464437,0.00023034474,0.00026674458],"domain_scores_gemma":[0.99888515,0.000058583653,0.000059059275,0.00087068364,0.000053423842,0.00007306844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000065261345,0.0001337973,0.00013036747,0.000039895076,0.00020432698,0.00029713844,0.0006065599,0.00002248906,0.000015202898],"category_scores_gemma":[0.000013848336,0.0001422043,0.00009806938,0.0007103212,0.000042588286,0.00026698373,0.0003218527,0.00017481245,0.00052505464],"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":[5.992304e-7,0.00010307057,0.00007691498,0.000012691097,0.000016188995,0.00028677713,0.0002908655,0.00010192781,0.80327785,0.17312804,0.0047680754,0.017937023],"study_design_scores_gemma":[0.0015262072,0.000094398034,0.01153781,0.00010316134,0.00008647877,0.00031618786,0.000059580743,0.080953546,0.38965136,0.06324933,0.4502502,0.0021717537],"about_ca_topic_score_codex":0.0000073998135,"about_ca_topic_score_gemma":6.2106125e-7,"teacher_disagreement_score":0.7426062,"about_ca_system_score_codex":0.000026273225,"about_ca_system_score_gemma":0.000043063632,"threshold_uncertainty_score":0.67486906},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5331908,0.00020692279,0.4627708,0.00063735445,0.000038376264,0.00017931288,0.0000071754653,0.00012203598,0.0028472543],"genre_scores_gemma":[0.967651,0.00000863814,0.032060057,0.000053079595,0.000014097688,0.0000046045197,0.000008102773,0.0000066172324,0.00019377093],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988111,0.00004986922,0.00036829378,0.00031108086,0.00027679797,0.00018281014],"domain_scores_gemma":[0.99890846,0.000053062726,0.00016156501,0.00070451025,0.0001123911,0.000059987404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035183146,0.00012289581,0.00025215163,0.00008520124,0.00007991622,0.000058977614,0.0005082598,0.00005672865,0.000026637268],"category_scores_gemma":[0.000024757406,0.00010977545,0.000061403094,0.0002554704,0.00013070597,0.0001798588,0.0003461102,0.0000582953,0.000015741278],"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.0000073732876,0.0004127868,0.00768814,0.000085871485,0.00003404431,0.000021804583,0.0004988862,0.000009992351,0.6553272,0.325448,0.0020679263,0.008398],"study_design_scores_gemma":[0.0010657537,0.000113803,0.10197311,0.000053220658,0.00004524227,0.00009489748,0.00008912761,0.053236037,0.8241324,0.016348774,0.0024349228,0.0004127525],"about_ca_topic_score_codex":0.0008855581,"about_ca_topic_score_gemma":0.000059812326,"teacher_disagreement_score":0.43446025,"about_ca_system_score_codex":0.000011236772,"about_ca_system_score_gemma":0.000058715945,"threshold_uncertainty_score":0.4476513},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020336412,0.000065211374,0.97573555,0.00026775568,0.00015258665,0.00007306428,0.000015066023,0.00009595971,0.0032583736],"genre_scores_gemma":[0.97208345,0.000021837675,0.027593333,0.0001384223,0.000021599666,0.000012040753,0.000018560899,0.0000041436283,0.00010659707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931866,0.000032617176,0.00016924948,0.00022411793,0.00014065011,0.00011467749],"domain_scores_gemma":[0.9991501,0.00007718735,0.000081781036,0.00046684837,0.000185736,0.000038353974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009412289,0.00006298708,0.00010462232,0.000032638975,0.00006424833,0.0001392198,0.00069974357,0.00003479364,0.000056865712],"category_scores_gemma":[0.000032505515,0.00006489781,0.000023673267,0.0006468856,0.000054030545,0.0004856246,0.0001232909,0.000046583926,0.000012496636],"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.0000015581904,0.00020485357,0.0014488384,0.0001210828,0.00004534342,0.00003604809,0.000293076,0.003354126,0.29434982,0.65663046,0.0011479384,0.042366877],"study_design_scores_gemma":[0.00038200515,0.00001767393,0.0011337699,0.00006641177,0.000020279962,0.000072868665,0.000023007884,0.4169418,0.560555,0.017636431,0.0028919715,0.0002587993],"about_ca_topic_score_codex":0.000043793847,"about_ca_topic_score_gemma":0.000008191353,"teacher_disagreement_score":0.95174706,"about_ca_system_score_codex":0.000017932978,"about_ca_system_score_gemma":0.00023959023,"threshold_uncertainty_score":0.26464558},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025471809,0.0053543635,0.96943927,0.0018117002,0.00038761046,0.0012603367,0.00594488,0.00030757303,0.015468806],"genre_scores_gemma":[0.5844976,0.012739664,0.32726917,0.001761902,0.0018646478,0.001142338,0.015485245,0.00062787,0.054611556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974257,0.000028419192,0.0006615442,0.0012933661,0.00033491894,0.00025607029],"domain_scores_gemma":[0.99633497,0.00031667785,0.00037843568,0.002768077,0.000060936152,0.00014092284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049704727,0.00032543825,0.0007117402,0.00013403832,0.00018402068,0.000060660004,0.0023212659,0.0001475184,4.1110232e-7],"category_scores_gemma":[0.00020630436,0.00031011953,0.00008738722,0.00009843481,0.00031398877,0.00019304278,0.006828554,0.00021043092,0.0000051684096],"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.00002693126,0.000033731732,0.000010963999,0.0042964453,0.0005488418,0.000084770654,0.0019646497,0.0005205942,0.0006390801,0.96634674,0.018890172,0.0066370685],"study_design_scores_gemma":[0.00040451778,0.000020945316,0.0000010742242,0.00026198654,0.00011887936,0.000009957411,0.00024632987,0.9625216,0.000041219482,0.01887615,0.017146356,0.00035099214],"about_ca_topic_score_codex":0.00007611954,"about_ca_topic_score_gemma":0.0001240049,"teacher_disagreement_score":0.962001,"about_ca_system_score_codex":0.000116407435,"about_ca_system_score_gemma":0.00014742222,"threshold_uncertainty_score":0.9999351},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.627946,0.0007810126,0.3698268,0.00035553097,0.00043007248,0.0003816494,0.0000027685421,0.0001720434,0.000104110346],"genre_scores_gemma":[0.99715286,0.0000011791179,0.002717725,0.000027293867,0.00005157976,0.0000046707974,0.0000034738362,0.0000085730135,0.00003265929],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890685,0.00006234297,0.0003030307,0.00030322923,0.0002677395,0.00015681703],"domain_scores_gemma":[0.99933237,0.000061862025,0.00017831977,0.00024697234,0.000094244475,0.000086250155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001406852,0.00011745162,0.0002544989,0.00004921922,0.00008258056,0.00010049391,0.00036374023,0.000035859368,1.3841294e-7],"category_scores_gemma":[0.000033438257,0.000086171145,0.00003113452,0.00041597584,0.000049277136,0.00013729691,0.00025928282,0.00015290121,0.0000016979835],"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.00009686052,0.00010878573,0.002674691,0.0017312692,0.00014280027,0.000016175696,0.0075052707,0.045769464,0.8990587,0.026657552,0.0011544923,0.015083917],"study_design_scores_gemma":[0.0001757057,0.000116802876,0.0007163119,0.00026282205,0.000008798939,0.000023550665,0.00015248843,0.99217427,0.0060835117,0.0000021689852,0.00016999157,0.00011356328],"about_ca_topic_score_codex":0.00019524693,"about_ca_topic_score_gemma":0.000003844301,"teacher_disagreement_score":0.9464048,"about_ca_system_score_codex":0.000021239557,"about_ca_system_score_gemma":0.00003624511,"threshold_uncertainty_score":0.35139573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46773222,0.13846384,0.25574628,0.011507,0.0012624011,0.0022216376,0.0004251509,0.002052389,0.12058909],"genre_scores_gemma":[0.8982355,0.02949034,0.04157286,0.0058939345,0.0015742065,0.00033293967,0.00030122302,0.00046178972,0.022137182],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9884054,0.003629219,0.0016687259,0.0022021022,0.001254879,0.0028396556],"domain_scores_gemma":[0.99022263,0.0040831026,0.0008659332,0.0031498962,0.00055234303,0.0011260649],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0045324247,0.0012848494,0.0016028242,0.00036575942,0.0011122951,0.0025757188,0.0036036053,0.0014540653,0.0005626909],"category_scores_gemma":[0.0020386823,0.0014065488,0.0008378844,0.002259308,0.001872218,0.00040281957,0.0011823339,0.0029564514,0.00040407706],"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.000086172724,0.0010145956,0.0037118897,0.001306121,0.0005994376,0.0050028414,0.005429181,0.000059491234,0.65420544,0.21041746,0.08205351,0.03611384],"study_design_scores_gemma":[0.0022227583,0.00017452377,0.0072041843,0.0012007379,0.00070257776,0.009456008,0.0004331813,0.008056546,0.03385424,0.004735456,0.9304463,0.0015134596],"about_ca_topic_score_codex":0.0005553246,"about_ca_topic_score_gemma":0.000112933725,"teacher_disagreement_score":0.84839284,"about_ca_system_score_codex":0.0019854447,"about_ca_system_score_gemma":0.005193822,"threshold_uncertainty_score":0.99999034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44957992,0.0020833232,0.54425627,0.0015519523,0.00013784252,0.00035167008,0.00029802363,0.0002842112,0.0014567893],"genre_scores_gemma":[0.9578749,0.00015040168,0.03956346,0.0006690298,0.0002792386,0.00011029945,0.00033208978,0.000055467364,0.0009650978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611944,0.00055675063,0.00060240884,0.0009896662,0.0005487603,0.0011829912],"domain_scores_gemma":[0.9977221,0.0003777702,0.00019769892,0.0009793428,0.00017220073,0.0005509101],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00067333266,0.00048498405,0.0004445085,0.0001404651,0.00057455816,0.001050277,0.001210168,0.00033568696,0.0002985889],"category_scores_gemma":[0.000042662712,0.000532055,0.00023782536,0.00063049735,0.00030188274,0.00036653932,0.00045305557,0.0005943398,0.00014849707],"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.0000638835,0.0024515192,0.015504782,0.0016030222,0.0004772263,0.0031989955,0.013223256,0.0168257,0.4131426,0.4333107,0.023841593,0.07635674],"study_design_scores_gemma":[0.0022568172,0.0001891304,0.012100041,0.00019688839,0.00027787796,0.002402939,0.0011939867,0.71695393,0.14917189,0.015479847,0.09837219,0.0014044712],"about_ca_topic_score_codex":0.00012025815,"about_ca_topic_score_gemma":0.000013751543,"teacher_disagreement_score":0.7001282,"about_ca_system_score_codex":0.0004634293,"about_ca_system_score_gemma":0.0027128563,"threshold_uncertainty_score":0.9999867},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014234543,0.00018542103,0.9771954,0.0062770615,0.000043496955,0.00035719544,0.000008127037,0.000099973266,0.0015988194],"genre_scores_gemma":[0.95417583,0.0000030394378,0.044633716,0.00020314126,0.000037596365,0.00019083217,0.000004892279,0.000007977667,0.0007429553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999293,0.000073773364,0.00016832504,0.00012302051,0.0002268728,0.0001149847],"domain_scores_gemma":[0.9983487,0.00094210653,0.00007742116,0.000597472,0.000010867824,0.000023445147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000717614,0.00006535365,0.000091196685,0.00002287754,0.00091653754,0.00012876716,0.0007402752,0.000014722091,0.000015230874],"category_scores_gemma":[0.000028677132,0.000037320737,0.000039692073,0.00025428357,0.00009369575,0.000060934744,0.0005613209,0.00019165942,0.000026622145],"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":[2.813977e-7,0.000021206457,0.00044745274,0.000008905066,0.00000966368,7.2703165e-7,0.0032233724,0.000056441928,0.0000016605767,0.9899196,0.00090441975,0.0054062456],"study_design_scores_gemma":[0.00043850768,0.000013507594,0.0062343352,0.0000031095774,0.000028951074,0.00006660956,0.00037598785,0.47453848,0.00003361568,0.50761056,0.010545261,0.00011110774],"about_ca_topic_score_codex":0.000005241737,"about_ca_topic_score_gemma":5.4200154e-7,"teacher_disagreement_score":0.9399413,"about_ca_system_score_codex":0.000016559934,"about_ca_system_score_gemma":0.000021906595,"threshold_uncertainty_score":0.70493585},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000982303,0.00003625245,0.7506444,0.00005576031,0.00015975676,0.0018928018,0.00011320666,0.00025912677,0.24674049],"genre_scores_gemma":[0.0025402256,0.00012463973,0.57100224,0.000120234385,0.0008103242,0.0005610735,0.00027481184,0.00023123632,0.4243352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877685,0.0000016331466,0.0004983227,0.00033382516,0.00021354512,0.00017581882],"domain_scores_gemma":[0.998678,0.00037945903,0.00043918085,0.00038042318,0.000060279075,0.00006261518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033019544,0.00024212613,0.0004660279,0.000044434142,0.00017902859,0.00008417844,0.00034730966,0.00044576442,0.0000035419066],"category_scores_gemma":[0.00000854402,0.00023019215,0.00037167539,0.00003091457,0.00008666318,0.00002348339,0.00020916076,0.00021597682,0.000008251689],"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.000004470066,0.000013614645,1.3761825e-8,0.0002619308,0.00006960353,6.037292e-8,0.00072358723,0.000009035704,0.002427125,0.9861215,0.0011718052,0.009197304],"study_design_scores_gemma":[0.0035333266,0.000045514644,5.481687e-8,0.00021982886,0.00027329233,0.0000022982301,0.00014040957,0.0076635536,0.013251522,0.94205004,0.032266483,0.0005536869],"about_ca_topic_score_codex":7.741884e-7,"about_ca_topic_score_gemma":4.3584657e-7,"teacher_disagreement_score":0.17964213,"about_ca_system_score_codex":0.000018474013,"about_ca_system_score_gemma":0.00009359871,"threshold_uncertainty_score":0.9386964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115235254,0.00008720262,0.88214874,0.0009895805,0.00080374704,0.000046410572,0.000010060578,0.000040532796,0.00063849246],"genre_scores_gemma":[0.9914198,0.0000104813935,0.007933993,0.00017510283,0.00030354926,0.0000070382102,0.000009248841,0.000010107205,0.00013065974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983839,0.0000559742,0.00033874286,0.00015806688,0.00094054674,0.00012276741],"domain_scores_gemma":[0.9989704,0.00007978103,0.0003694471,0.00029772558,0.00022071575,0.00006196707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026949894,0.000085970714,0.00011865802,0.000120028046,0.00017425345,0.00014777727,0.002053575,0.0000143678535,0.000022102255],"category_scores_gemma":[0.000019050274,0.00008659593,0.00013322849,0.0001632463,0.000018618035,0.0003481157,0.000781142,0.00023874498,0.000012017316],"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.00004943422,0.0011667566,0.00030622768,0.000009771579,0.00018468915,0.0005540798,0.0021288744,0.029100535,0.29489496,0.13030317,0.0021065085,0.539195],"study_design_scores_gemma":[0.0005762418,0.00007585056,0.00017947202,0.00001454222,0.000011297576,0.00023147163,0.000023147752,0.86886615,0.0065482855,0.112972885,0.010368191,0.00013249341],"about_ca_topic_score_codex":0.000003828926,"about_ca_topic_score_gemma":2.3495674e-7,"teacher_disagreement_score":0.8761846,"about_ca_system_score_codex":0.00010819206,"about_ca_system_score_gemma":0.00011164055,"threshold_uncertainty_score":0.38160872},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26007095,0.00016018315,0.7373987,0.00032862797,0.0001340082,0.00026979268,0.000035905443,0.00021727812,0.0013845662],"genre_scores_gemma":[0.9882346,0.000111947214,0.008753442,0.0001424664,0.00007758061,0.000003724232,0.00029830748,0.000022424945,0.00235552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979869,0.00008255332,0.00023304732,0.0012112437,0.00016343327,0.0003228136],"domain_scores_gemma":[0.997999,0.0001172287,0.0003201651,0.0012465441,0.00014349332,0.00017355841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011865893,0.00033103395,0.00035491664,0.0002020571,0.00023574289,0.0006722917,0.0015437239,0.00021604548,0.00003459362],"category_scores_gemma":[0.0000070888404,0.00035683237,0.00019225103,0.00073211687,0.000096563424,0.0008603372,0.0015939389,0.0004595059,0.000056665955],"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.000035018536,0.0004208995,0.002244106,0.00017025064,0.00029119375,0.0008909933,0.00032121554,0.7647032,0.00023154284,0.22731541,0.001896594,0.0014795645],"study_design_scores_gemma":[0.0011123421,0.00006552536,0.007887013,0.0002740445,0.00019993082,0.000074201525,0.00021727502,0.9640672,0.00069736183,0.020387702,0.0037323183,0.0012850537],"about_ca_topic_score_codex":0.0003247133,"about_ca_topic_score_gemma":0.000066773864,"teacher_disagreement_score":0.72864527,"about_ca_system_score_codex":0.00018935806,"about_ca_system_score_gemma":0.0005941637,"threshold_uncertainty_score":0.99988836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15708776,0.00024903505,0.84236884,0.00017806212,0.000046559224,0.00002505626,9.0510326e-8,0.000021163887,0.000023450488],"genre_scores_gemma":[0.81935436,0.000015029885,0.18052514,0.000025044548,0.000068164154,2.4598916e-7,2.0242808e-7,0.0000045997685,0.0000072354783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991139,0.000044110602,0.00022749488,0.00019916327,0.00024485966,0.00017047113],"domain_scores_gemma":[0.99948335,0.00004518926,0.00006988811,0.00012020368,0.00016605454,0.00011533753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004144311,0.00008089155,0.000105922976,0.00020763671,0.000100390076,0.00020450485,0.000259504,0.000009031382,0.0000011393903],"category_scores_gemma":[0.000014069485,0.0000627157,0.000026037234,0.0013980077,0.0000352287,0.00042206296,0.00006289755,0.00016941092,7.130746e-7],"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.000010867394,0.0001880738,0.00015905037,0.00002579093,0.0000137508705,0.00077318127,0.00045248785,0.21533254,0.25901845,0.004468189,0.000027816459,0.5195298],"study_design_scores_gemma":[0.00020617455,0.00015718068,0.0039981455,0.000074147385,0.0000041899852,0.0011085055,0.0000018627967,0.9840966,0.009733939,0.000018245399,0.0005125684,0.000088484194],"about_ca_topic_score_codex":6.8394814e-7,"about_ca_topic_score_gemma":8.400259e-8,"teacher_disagreement_score":0.768764,"about_ca_system_score_codex":0.000029068184,"about_ca_system_score_gemma":0.00017576378,"threshold_uncertainty_score":0.2557472},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41486287,0.0018116123,0.58111227,0.000612061,0.0006683491,0.00021254082,0.000050313694,0.00016216493,0.00050783495],"genre_scores_gemma":[0.9629066,0.0010440886,0.034702335,0.00016281441,0.0010188537,0.000016688988,0.00011994632,0.000012013818,0.00001663917],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753964,0.00026787075,0.0007860673,0.0006244043,0.00043037123,0.00035162066],"domain_scores_gemma":[0.9973177,0.00026060618,0.0009545759,0.0008631079,0.00038649637,0.00021751355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004673212,0.000374836,0.00083906605,0.00006877517,0.00012589394,0.00033078287,0.0023757645,0.0005282247,0.000029866274],"category_scores_gemma":[0.00010527086,0.00024685176,0.00066438445,0.00031161646,0.0001183585,0.00021990582,0.002424243,0.0011615684,0.000019850173],"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.0003320235,0.012965698,0.013362147,0.0005205418,0.0038865437,0.0038120416,0.0048927036,0.010814994,0.29673302,0.17307204,0.017368037,0.4622402],"study_design_scores_gemma":[0.004039104,0.00520754,0.05095311,0.0013631781,0.00053629815,0.0009116549,0.000731203,0.26622427,0.09547647,0.54710335,0.023172705,0.004281134],"about_ca_topic_score_codex":0.000004464261,"about_ca_topic_score_gemma":3.6293585e-7,"teacher_disagreement_score":0.5480437,"about_ca_system_score_codex":0.00008140512,"about_ca_system_score_gemma":0.00027060637,"threshold_uncertainty_score":0.9999984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85649276,0.00009460694,0.13706836,0.0020459325,0.000051712497,0.00046020336,0.000033126962,0.00014668435,0.0036065849],"genre_scores_gemma":[0.968331,0.000010599345,0.031199796,0.00022618336,0.000013130891,0.00007068222,0.000001595017,0.000009317852,0.00013772136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989196,0.000012252152,0.0002688302,0.00020358527,0.0004424408,0.0001532566],"domain_scores_gemma":[0.9990466,0.00012189617,0.00047826892,0.00021958434,0.00009714694,0.00003646317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003271394,0.000095577954,0.00026766624,0.00004486091,0.00019171229,0.000027793649,0.0011142986,0.000015702844,0.000028692935],"category_scores_gemma":[0.000075219294,0.00006967045,0.00023022985,0.0024340677,0.00019294108,0.0000824645,0.00066370744,0.00011552785,0.0000016346733],"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.000014713614,0.001257242,0.0073453705,0.0008662407,0.0002806933,3.5153255e-7,0.009300842,0.0011501358,0.13951917,0.8107979,0.019206196,0.010261146],"study_design_scores_gemma":[0.0012894432,0.0007458126,0.018412089,0.00012577814,0.0003056476,0.00013118962,0.004431812,0.504783,0.21253143,0.24358714,0.012418069,0.0012386154],"about_ca_topic_score_codex":0.0000148742165,"about_ca_topic_score_gemma":5.304016e-8,"teacher_disagreement_score":0.5672108,"about_ca_system_score_codex":0.000040081737,"about_ca_system_score_gemma":0.00003250439,"threshold_uncertainty_score":0.28410786},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027812566,0.000250832,0.99515414,0.00036238474,0.00012368163,0.00035087587,0.000020478987,0.00023987077,0.00071647076],"genre_scores_gemma":[0.7483011,0.000009893728,0.2487371,0.0014680992,0.00017295005,0.0006267228,0.000342113,0.000019917647,0.00032212448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998935,0.00002697187,0.00040242105,0.00018927162,0.00023559526,0.00021073387],"domain_scores_gemma":[0.998895,0.000041622567,0.00026962,0.00025341354,0.0004900519,0.000050316445],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00014615452,0.0001287918,0.00016078769,0.000074211224,0.00036030804,0.0011082164,0.00025897118,0.00006510668,0.0000010008091],"category_scores_gemma":[0.000016412081,0.00010727136,0.00004200264,0.0004289891,0.000018847732,0.005038904,0.00006109948,0.0000991716,0.000007914174],"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.000007452996,0.000038080467,0.000013506459,0.00048675004,0.00003101072,0.000004039414,0.004930309,0.100845695,0.0011334588,0.025446959,0.0017508097,0.8653119],"study_design_scores_gemma":[0.00029033012,0.000032885775,0.000005422422,0.0000634481,0.0000058951855,0.00008482695,0.00041925517,0.99005324,0.003307111,0.0012659053,0.004318642,0.00015303472],"about_ca_topic_score_codex":0.000018981595,"about_ca_topic_score_gemma":0.000004022543,"teacher_disagreement_score":0.88920754,"about_ca_system_score_codex":0.00004395339,"about_ca_system_score_gemma":0.00020378949,"threshold_uncertainty_score":0.9999287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3960977,0.00006799898,0.5886818,0.0036556602,0.000051897707,0.0011979942,0.000008872334,0.00040611433,0.009831953],"genre_scores_gemma":[0.9457738,0.000010959036,0.053468782,0.00010620517,0.000026597789,0.00036091552,0.000003452558,0.000015940994,0.00023336145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830484,0.000027599173,0.00043505774,0.0004077404,0.00048382682,0.00034092183],"domain_scores_gemma":[0.9980056,0.0002147054,0.00024977312,0.0012820661,0.00009028097,0.00015754005],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002323597,0.00020144641,0.0003324657,0.00009140652,0.000098226774,0.00020775246,0.0012307831,0.00009171013,0.00037470594],"category_scores_gemma":[0.000033834815,0.00016780049,0.00010364996,0.0004465327,0.00012141374,0.00043269686,0.00039318248,0.00014924876,0.0007919786],"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.0000011510075,0.00025743883,0.00013308588,0.00011501467,0.000032037387,0.000002139878,0.0010536215,0.0000022526206,0.074146986,0.91521907,0.002694814,0.006342388],"study_design_scores_gemma":[0.0009458889,0.00013649957,0.009560047,0.0001331409,0.000054637763,0.000096417585,0.00029951544,0.054359093,0.09531564,0.81894773,0.01919243,0.0009589492],"about_ca_topic_score_codex":0.00007770383,"about_ca_topic_score_gemma":0.0000027427047,"teacher_disagreement_score":0.5496761,"about_ca_system_score_codex":0.0000215057,"about_ca_system_score_gemma":0.00005715807,"threshold_uncertainty_score":0.999986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1832427,0.0010460566,0.8009508,0.007757755,0.00031292377,0.000731574,0.0000825642,0.0002793159,0.005596314],"genre_scores_gemma":[0.9510385,0.00084798364,0.047033116,0.00003298434,0.000014558283,0.00004275341,0.000212014,0.000026667123,0.0007514687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493146,0.002700324,0.00069904927,0.00076433824,0.0005342941,0.00037052282],"domain_scores_gemma":[0.99311334,0.0013960983,0.0006135295,0.004036787,0.0007240095,0.00011625659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020541262,0.00030330272,0.0003677317,0.00022006466,0.00036585872,0.00033846783,0.00410881,0.00025204231,0.000014511658],"category_scores_gemma":[0.00051350077,0.00026927373,0.00020328649,0.0006504802,0.0003186981,0.0001362312,0.002642668,0.000641044,0.000011974444],"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.000018904522,0.001308599,0.0029957562,0.00040140806,0.00020017325,0.00003827313,0.028115055,0.0016866327,0.08254989,0.50647277,0.002367172,0.37384537],"study_design_scores_gemma":[0.0011045473,9.869651e-7,0.012355854,0.0010715727,0.000035552526,0.000022814671,0.000097684206,0.57622766,0.3583645,0.024127703,0.025651053,0.00094007683],"about_ca_topic_score_codex":0.0027598161,"about_ca_topic_score_gemma":0.0022203312,"teacher_disagreement_score":0.76779574,"about_ca_system_score_codex":0.00009899744,"about_ca_system_score_gemma":0.00037401574,"threshold_uncertainty_score":0.9999759},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.954328,0.00017648234,0.04458737,0.0002085132,0.00021208575,0.000123092,0.000009409846,0.000034305645,0.00032071292],"genre_scores_gemma":[0.9843953,0.00003650948,0.015266038,0.000111836525,0.00014024768,0.000012799036,0.000009061942,0.000009991284,0.000018218101],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980455,0.0002937969,0.00069957954,0.00044614772,0.00020332915,0.0003116525],"domain_scores_gemma":[0.99743617,0.00029301195,0.0009689309,0.0006171814,0.0005266396,0.00015806494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002887276,0.00032563918,0.0011032899,0.00021882937,0.00014912686,0.000027047872,0.0010348816,0.000084748644,0.000027894448],"category_scores_gemma":[0.000029615736,0.00023261902,0.00024064876,0.00040034266,0.0012395637,0.0003637912,0.00022271484,0.00059628417,0.000009074452],"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.000061816405,0.00018382474,0.00018143111,0.00000922351,0.00015601075,0.0000011919459,0.001514847,0.00074693165,0.93724877,0.05804599,0.00012065327,0.001729327],"study_design_scores_gemma":[0.0019170117,0.0038581828,0.10454656,0.00013966966,0.00013448206,0.00015455973,0.004560936,0.50569755,0.3196941,0.05680172,0.0014835139,0.0010116799],"about_ca_topic_score_codex":0.000055553788,"about_ca_topic_score_gemma":0.000024549176,"teacher_disagreement_score":0.61755466,"about_ca_system_score_codex":0.000018239893,"about_ca_system_score_gemma":0.00016236454,"threshold_uncertainty_score":0.9485928},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026080928,0.0001669885,0.042229876,0.000054606324,0.00004611104,0.0002530167,0.0000622076,0.0005105343,0.95665056],"genre_scores_gemma":[0.00017098962,0.00008714089,0.002588545,0.00009794689,0.000048336635,7.0327604e-7,0.00005516262,0.000012038777,0.9969391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889904,0.000035342295,0.00011647269,0.0005430314,0.00018928801,0.00021684234],"domain_scores_gemma":[0.9986757,0.00005691875,0.000121719946,0.00093415944,0.000059025122,0.000152497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007285254,0.00023456577,0.0002599079,0.0001241568,0.00020822986,0.00015380424,0.0011698277,0.00020381362,3.54494e-7],"category_scores_gemma":[0.0000031535567,0.0002800021,0.00008584536,0.000019369698,0.00012935417,0.00014988652,0.00069643283,0.00024184574,0.000014064307],"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.0000016299036,0.000008573444,1.7843682e-7,0.000024056066,0.00001956793,0.00007451402,0.000023372053,4.1667397e-7,0.000031169555,0.77704686,0.21438712,0.008382522],"study_design_scores_gemma":[0.00025710525,0.000024542647,0.000048389586,0.00005103215,0.000048488197,0.00003610358,0.0000028743118,0.0037318983,0.00016943239,0.00006793314,0.99525905,0.00030317003],"about_ca_topic_score_codex":0.00003124011,"about_ca_topic_score_gemma":8.18055e-7,"teacher_disagreement_score":0.7808719,"about_ca_system_score_codex":0.00010555412,"about_ca_system_score_gemma":0.00019278268,"threshold_uncertainty_score":0.9999652},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000029182736,0.000033151005,0.17336567,0.0004109329,0.0001258729,0.00032094278,0.000057727306,0.00031102062,0.8253718],"genre_scores_gemma":[0.00005618869,0.000017207714,0.011225927,0.00048297894,0.00010087159,0.0000013411401,0.000022859856,0.000019830868,0.9880728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883646,0.000011263233,0.0001506906,0.0006028239,0.00021051116,0.00018825894],"domain_scores_gemma":[0.99856967,0.000023866349,0.00010032497,0.00094678905,0.00009636042,0.00026298664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00003133581,0.00023619409,0.00024755532,0.00008960551,0.00014089428,0.00007418337,0.0015308497,0.00014343245,0.000001939498],"category_scores_gemma":[0.0000057815523,0.00029760637,0.00014199139,0.000017409699,0.000043608306,0.00009806341,0.0011339352,0.00023084557,0.00012191869],"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.0000036181068,0.0000028353447,5.039378e-8,0.000015276535,0.000020534648,0.00010194264,0.00003041518,0.0000049844075,0.00017072563,0.9054422,0.07726603,0.016941417],"study_design_scores_gemma":[0.00017150003,0.000028735965,0.0000025916067,0.00003433943,0.000028035889,0.000006314576,0.0000041481517,0.0005796427,0.00076282304,0.000029917243,0.9980378,0.00031412332],"about_ca_topic_score_codex":0.000026682197,"about_ca_topic_score_gemma":0.0000011806043,"teacher_disagreement_score":0.9207718,"about_ca_system_score_codex":0.00011339256,"about_ca_system_score_gemma":0.000100263234,"threshold_uncertainty_score":0.9999476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010755467,0.0001152404,0.99623007,0.00062551646,0.0005077616,0.0007630624,0.000032047185,0.0002969375,0.00035379615],"genre_scores_gemma":[0.06479069,0.0000037798084,0.9301453,0.00065465225,0.0002257592,0.0010827448,0.000081647784,0.000046905214,0.002968503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823594,0.00003898383,0.00028051142,0.00057685236,0.0004388965,0.00042881595],"domain_scores_gemma":[0.99894994,0.0001208499,0.00013298653,0.0006153704,0.000035103472,0.00014574903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039117198,0.00016995675,0.00017267186,0.00018216984,0.0008132014,0.00027230865,0.00097608153,0.000034088425,0.00006817834],"category_scores_gemma":[0.000009323855,0.00018860148,0.00012883214,0.00055682234,0.000012267249,0.00023646055,0.000369839,0.00018183545,0.000032797798],"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.000011601648,0.00047353978,0.000120107165,0.000058857335,0.00006490089,0.00003912081,0.0011240289,0.015191463,0.0088249715,0.005024238,0.0052502006,0.963817],"study_design_scores_gemma":[0.0009234314,0.00016148083,0.00010159476,0.000017174993,0.000010291909,0.000018945846,0.00004130199,0.96948206,0.0064320713,0.0026387637,0.01994118,0.00023172669],"about_ca_topic_score_codex":0.00009975017,"about_ca_topic_score_gemma":0.000002059596,"teacher_disagreement_score":0.96358526,"about_ca_system_score_codex":0.00015117644,"about_ca_system_score_gemma":0.00019400468,"threshold_uncertainty_score":0.7690945},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021209814,0.0013817875,0.033934742,0.00020981008,0.00051448675,0.0005629108,0.00010614647,0.00022420728,0.9628538],"genre_scores_gemma":[0.15672238,0.0041914503,0.03834489,0.00026592624,0.0009091948,0.000086427666,0.00016778256,0.000091792324,0.79922014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997036,0.000031339005,0.0006323808,0.000919772,0.0009954943,0.00038501885],"domain_scores_gemma":[0.9974489,0.00012649375,0.00052466895,0.0013619482,0.00027860247,0.00025934042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007692816,0.00035193958,0.00059215364,0.00033632037,0.0004189942,0.00025858494,0.0022055323,0.00016769838,0.0000307532],"category_scores_gemma":[0.000035298453,0.00033643353,0.00010920083,0.00027028378,0.0014170592,0.0005946659,0.0006070539,0.00027305193,0.000088215704],"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":[8.7954896e-7,0.00002197704,0.0000014446748,0.00004539725,0.000007586558,0.0000100797915,0.00022835491,0.000002804251,0.00020833807,0.9803624,0.0009795144,0.018131198],"study_design_scores_gemma":[0.00024237858,0.00015942179,0.0004899319,0.00034401935,0.000025251624,0.00008077528,0.000027156286,0.026158134,0.00025128073,0.13909185,0.83240116,0.00072862476],"about_ca_topic_score_codex":0.00005635889,"about_ca_topic_score_gemma":0.000006852851,"teacher_disagreement_score":0.84127057,"about_ca_system_score_codex":0.00006428586,"about_ca_system_score_gemma":0.000424553,"threshold_uncertainty_score":0.99990875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014248443,0.000041745283,0.99434793,0.00084886176,0.0006305788,0.00036191015,0.000034756067,0.00041221693,0.0018971378],"genre_scores_gemma":[0.96989757,0.0000023882744,0.02759818,0.0004956155,0.000094768984,0.00031135883,0.000039071405,0.000025752372,0.0015353091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998107,0.00007496863,0.00038482458,0.0006839916,0.000383175,0.0003660402],"domain_scores_gemma":[0.99820167,0.0001560173,0.00012960933,0.0013407297,0.000058452373,0.000113501585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004314432,0.00019551758,0.0001733957,0.00020625202,0.0006787063,0.00016555088,0.0011493711,0.00004661456,0.00028006334],"category_scores_gemma":[0.000033727836,0.00021688688,0.00014285024,0.0009791924,0.000049972066,0.00015998328,0.00038995774,0.0002930137,0.00057976454],"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.000012521667,0.0014925791,0.0000068284294,0.00004121789,0.000018796987,0.00008435013,0.0009272074,0.282315,0.12630141,0.027820246,0.00092195027,0.56005794],"study_design_scores_gemma":[0.000060068392,0.00014941192,0.000011388862,0.000009790647,0.000007457821,0.00004544712,0.000081145445,0.8692026,0.102089494,0.0006412087,0.027476786,0.0002252083],"about_ca_topic_score_codex":0.00004633648,"about_ca_topic_score_gemma":0.0000032030348,"teacher_disagreement_score":0.9684727,"about_ca_system_score_codex":0.00015083129,"about_ca_system_score_gemma":0.00006514466,"threshold_uncertainty_score":0.88443905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22186945,0.0009455798,0.7759681,0.00006066313,0.0001446238,0.00025329588,0.000016198994,0.00016382674,0.0005782579],"genre_scores_gemma":[0.9986088,0.000012129043,0.0006907452,0.000015222659,0.000057825313,0.000027939377,0.00008116245,0.000010614696,0.0004955252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985407,0.0003226842,0.00040909933,0.00032114336,0.0002133215,0.00019304703],"domain_scores_gemma":[0.99896765,0.0003305576,0.00014428818,0.00044616195,0.000033219632,0.000078099394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008171715,0.00013974709,0.0002729384,0.000058996317,0.00011622128,0.00008051889,0.00037945563,0.00010215558,0.000007478414],"category_scores_gemma":[0.000030113975,0.00011870615,0.000064678934,0.00023497724,0.000109689805,0.00017690044,0.000104750296,0.00008161601,0.000020976271],"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.000036769878,0.0001335883,0.00015234172,0.00006086032,0.000014353425,0.0000029935225,0.00006721655,0.0006986118,0.020904012,0.9767749,0.00026283984,0.00089152553],"study_design_scores_gemma":[0.002129311,0.000055876248,0.0005627976,0.000066843066,0.00002972328,0.000017549472,0.000025866046,0.97270274,0.0020887894,0.020367937,0.0016886477,0.00026391342],"about_ca_topic_score_codex":0.00008823905,"about_ca_topic_score_gemma":0.0000021872117,"teacher_disagreement_score":0.9720041,"about_ca_system_score_codex":0.000020693373,"about_ca_system_score_gemma":0.000019937223,"threshold_uncertainty_score":0.48406965},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36954245,0.000005781944,0.6299945,0.0001710683,0.000010734388,0.00011427253,3.3869281e-7,0.000009453693,0.00015138467],"genre_scores_gemma":[0.9797565,0.0000016437658,0.020179622,0.000020738793,0.0000098602595,0.000003726552,0.000002611629,0.0000023879463,0.000022960834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999575,0.000009709905,0.00013306207,0.000115604176,0.00007371732,0.00009290982],"domain_scores_gemma":[0.9994782,0.000019468975,0.00007063997,0.0003691215,0.000042073723,0.000020483227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017653966,0.000043272274,0.000054343098,0.00003673681,0.0002232508,0.00013740003,0.00030197305,0.000024071034,8.089984e-7],"category_scores_gemma":[0.000008992705,0.000032209093,0.0000130714525,0.00009693158,0.000012824116,0.00044634985,0.00019982258,0.00003971638,4.7255307e-7],"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":[8.613867e-7,0.0000061299806,0.0009372038,0.0000034744155,6.841856e-7,1.13061276e-7,0.0001389782,0.9816745,0.00015991722,0.0069691273,4.4214076e-7,0.010108571],"study_design_scores_gemma":[0.000068231995,0.000005199737,0.0024996316,0.000007929308,0.0000024298272,5.214958e-7,0.00003497799,0.9968723,0.00011758953,0.0003464421,0.0000020962314,0.000042640375],"about_ca_topic_score_codex":0.0001863009,"about_ca_topic_score_gemma":0.00024301067,"teacher_disagreement_score":0.610214,"about_ca_system_score_codex":0.000021079726,"about_ca_system_score_gemma":0.000013647264,"threshold_uncertainty_score":0.17170872},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016550715,0.00032443576,0.8338714,0.000560335,0.0003654579,0.00027460343,0.00001862604,0.00016731491,0.16441613],"genre_scores_gemma":[0.0012596737,0.0002270938,0.35121223,0.00032985047,0.00009242595,0.000048962735,0.000026423082,0.000026544021,0.6467768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977865,0.0000121685,0.00020677787,0.0009959318,0.00056970323,0.0004288765],"domain_scores_gemma":[0.99773484,0.00002657982,0.00024846356,0.0016412797,0.00008843879,0.0002604048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048577698,0.00028612843,0.00029987385,0.00019357233,0.0012642541,0.0009416001,0.0033434376,0.000120882774,0.00003659962],"category_scores_gemma":[0.000025222216,0.0002482931,0.00007292148,0.0001334142,0.00038285073,0.0006199736,0.0015611736,0.00026526095,0.00011736501],"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":[4.853851e-7,0.000015243893,6.2110365e-7,0.000017162653,0.0000048608113,0.000017064545,0.00006966285,0.0001877705,0.0016081694,0.9673017,0.0030347225,0.027742531],"study_design_scores_gemma":[0.00031943448,0.00010269407,0.00007234729,0.00009797653,0.000027708276,0.00012936695,0.000002556229,0.42356554,0.00048654882,0.36212286,0.21231526,0.00075771374],"about_ca_topic_score_codex":0.000079531506,"about_ca_topic_score_gemma":0.000036880596,"teacher_disagreement_score":0.60517883,"about_ca_system_score_codex":0.00006843268,"about_ca_system_score_gemma":0.0006653436,"threshold_uncertainty_score":0.99999696},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015991258,0.00040345502,0.1848477,0.0006344975,0.00020553925,0.00041533244,0.00029286995,0.00019339594,0.8130056],"genre_scores_gemma":[0.0009036312,0.00029417555,0.018979652,0.0001419937,0.00014173938,0.0000053423664,0.00086033583,0.000029865047,0.97864324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999016,0.00003463405,0.00016140021,0.00044961905,0.00015327097,0.00018509099],"domain_scores_gemma":[0.9970347,0.0001667785,0.00012820064,0.0022150197,0.00033132712,0.00012395308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000081264116,0.0002226897,0.00024031078,0.0000938092,0.00049198914,0.0001390222,0.0020015496,0.00022876935,0.000013722927],"category_scores_gemma":[0.000009572236,0.0002624154,0.00020650183,0.000025689149,0.00031081613,0.000099555786,0.0011646261,0.00032309841,0.000019061688],"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.000004455077,0.000016675716,1.0431159e-7,0.000021164471,0.00006265526,0.000009430196,0.00003310296,5.3878716e-7,0.000032636297,0.986728,0.010030506,0.0030607192],"study_design_scores_gemma":[0.00022269425,0.00002140587,0.0000024622182,0.000031397336,0.00011047178,0.000015392181,0.000014455666,0.00832333,0.00007427403,0.0009974657,0.9899153,0.00027131068],"about_ca_topic_score_codex":0.000010393426,"about_ca_topic_score_gemma":0.0000036911558,"teacher_disagreement_score":0.9857305,"about_ca_system_score_codex":0.00009293567,"about_ca_system_score_gemma":0.00020954065,"threshold_uncertainty_score":0.99998283},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004751679,0.000032443168,0.9916185,0.0009214482,0.000012727115,0.00017151384,0.0000036812578,0.0002461778,0.0022418122],"genre_scores_gemma":[0.56659824,2.7159635e-7,0.43313363,0.00007504647,0.00003110472,0.000036979694,0.0000048047777,0.000003940646,0.000115993396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992992,0.0000016069258,0.00013083094,0.00022627418,0.0000992843,0.00024277098],"domain_scores_gemma":[0.9996165,0.000033544722,0.000043850596,0.00022245261,0.00004030249,0.000043348402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007641034,0.00006576024,0.00006233306,0.000027637583,0.00023007183,0.0005458121,0.00039534358,0.000026012232,0.000011290616],"category_scores_gemma":[0.000010063646,0.000058874302,0.000042082454,0.00019311835,0.000013253335,0.0005758722,0.00014567279,0.000041561,0.000025186071],"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":[4.7327262e-7,0.000042888558,0.00004259663,0.000013483609,0.000003571541,5.3398173e-7,0.00021428234,0.00012942545,0.00081025664,0.80941063,0.00010250732,0.18922937],"study_design_scores_gemma":[0.00029320567,0.000034930872,0.00010262863,0.00003765054,0.0000041168514,0.000009668219,0.00012022987,0.14881667,0.012440014,0.81961954,0.018316261,0.00020508523],"about_ca_topic_score_codex":0.000006134319,"about_ca_topic_score_gemma":0.0000020617033,"teacher_disagreement_score":0.56184655,"about_ca_system_score_codex":0.00002000934,"about_ca_system_score_gemma":0.000048613518,"threshold_uncertainty_score":0.52632785},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.0410515e-7,0.00003037246,0.2164383,0.0006166355,0.00010835587,0.000074977754,0.0000023206328,0.00028266903,0.7824455],"genre_scores_gemma":[0.00010847524,0.00003370532,0.045734365,0.00049739936,0.00010383731,0.0000064168403,0.000017235947,0.0000132241685,0.95348537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993457,0.0000012333925,0.00012424044,0.00028818107,0.00014471482,0.00009591273],"domain_scores_gemma":[0.99883175,0.00001903804,0.000057562116,0.0009896465,0.0000332089,0.0000688133],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000047384085,0.000120736346,0.000109106484,0.00004797156,0.000058790698,0.0000829743,0.00084461673,0.0001916738,0.0007342664],"category_scores_gemma":[0.0000015310582,0.00010676283,0.00007374649,0.000014894124,0.000029574167,0.000062788065,0.00023036244,0.00025316948,0.0028288818],"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":[3.8659092e-8,0.0000025770114,2.2827268e-7,0.00000189672,0.00000376658,0.0000029205191,0.0000054731936,4.488971e-8,0.00028389026,0.9856374,0.004546932,0.0095147975],"study_design_scores_gemma":[0.000020416217,0.000003869361,0.000008640456,0.000004172114,0.00000308321,0.000010392261,5.0537253e-8,0.00034931363,0.0003479929,0.11340302,0.885724,0.00012505703],"about_ca_topic_score_codex":0.000008419418,"about_ca_topic_score_gemma":0.000023269937,"teacher_disagreement_score":0.88117707,"about_ca_system_score_codex":0.0000080563,"about_ca_system_score_gemma":0.00005070583,"threshold_uncertainty_score":0.9979475},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.7304492e-7,0.000023742703,0.4595931,0.00021587827,0.00004764716,0.0000472182,0.0000021349642,0.00018346445,0.53988653],"genre_scores_gemma":[0.0014589691,0.000010499803,0.0038802892,0.00020171017,0.000087125154,0.0000031406148,0.00003485148,0.00001334598,0.9943101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999306,0.0000011951357,0.00012939371,0.000299781,0.00017004766,0.00009357749],"domain_scores_gemma":[0.9990792,0.000026611175,0.00005796925,0.0007484224,0.000027423373,0.000060321614],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003315236,0.00013029546,0.00011769606,0.00005218414,0.00006254604,0.000215979,0.0006941523,0.00010385831,0.00025097735],"category_scores_gemma":[0.0000020183982,0.000111934205,0.00008514456,0.000015833059,0.000022132554,0.00010669452,0.0004963626,0.00009079875,0.0037755934],"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":[5.366823e-8,0.0000019858112,1.3983426e-7,0.0000022821675,0.000002522537,0.0000014525986,0.0000044038516,2.7224382e-7,0.0000110929905,0.8199075,0.009640109,0.17042822],"study_design_scores_gemma":[0.000030743322,0.000008861493,0.0000023167272,0.000010998092,0.0000022752927,0.000009530608,1.12144896e-7,0.003598924,0.000029628824,0.06038154,0.93577933,0.00014570712],"about_ca_topic_score_codex":7.4531596e-7,"about_ca_topic_score_gemma":8.9139405e-7,"teacher_disagreement_score":0.92613924,"about_ca_system_score_codex":0.00001477572,"about_ca_system_score_gemma":0.000022754019,"threshold_uncertainty_score":0.9970001},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045116423,0.0032596844,0.02158265,0.00017154626,0.0007887546,0.0008182548,0.00008550105,0.00009495995,0.968687],"genre_scores_gemma":[0.8985722,0.0018123763,0.007509024,0.000016389571,0.00016214162,0.000037909474,0.000020287693,0.000038269463,0.09183138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970649,0.00003731987,0.0007950591,0.0007371426,0.0010454307,0.00032016836],"domain_scores_gemma":[0.9967465,0.00011176983,0.0008804638,0.0018350304,0.00026833283,0.00015791596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014491552,0.00028731488,0.00073172146,0.0004146152,0.0002874483,0.00016856882,0.0030177603,0.0001674606,0.000009210856],"category_scores_gemma":[0.00008371486,0.00027289536,0.00009356092,0.00013989663,0.0018319322,0.000537814,0.00081341784,0.00024135252,0.000016862794],"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.0000017515256,0.00003632615,0.00011719795,0.00022021969,0.000008550914,0.000009957776,0.00049352343,0.000011114512,0.0009776988,0.9934548,0.00013442508,0.0045343996],"study_design_scores_gemma":[0.0015707087,0.0004165108,0.014413418,0.0039332723,0.00008179173,0.0001703945,0.00010876541,0.0866049,0.002857899,0.30531615,0.58205587,0.0024702991],"about_ca_topic_score_codex":0.00051211816,"about_ca_topic_score_gemma":0.00010977139,"teacher_disagreement_score":0.89406055,"about_ca_system_score_codex":0.00004787425,"about_ca_system_score_gemma":0.0005001537,"threshold_uncertainty_score":0.99997234},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.0370391e-7,0.0006396183,0.04378025,0.13494466,0.000598025,0.0033119645,0.81657803,0.00012766005,0.000019670933],"genre_scores_gemma":[0.000043089236,0.00008285627,0.008709035,0.0013024249,0.00024541406,0.0018005972,0.987508,0.000027701024,0.0002809112],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948759,0.00036382463,0.0020985147,0.00083676714,0.0013569868,0.00046800132],"domain_scores_gemma":[0.9894198,0.00024549777,0.0022548311,0.002588911,0.0051929657,0.0002979682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015973479,0.0005576247,0.0009378224,0.00039878974,0.00037355183,0.00033373458,0.0036239515,0.0005766431,0.00005166953],"category_scores_gemma":[0.0017876239,0.00038580952,0.00083202764,0.0020317845,0.00020600091,0.000716758,0.0006948577,0.00061840646,0.00006903722],"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.000002776169,0.00039926654,3.9966545e-7,0.012525194,0.00008055472,1.3100659e-7,0.00013163385,3.9442304e-7,0.0000032443045,0.0011477309,0.96381426,0.021894397],"study_design_scores_gemma":[0.00067984936,0.00008093502,0.000053899264,0.008479787,0.00018641642,0.000056396293,0.0000323287,0.002499007,0.00009828634,0.000016179996,0.98744524,0.0003716992],"about_ca_topic_score_codex":0.0000343755,"about_ca_topic_score_gemma":0.000006363016,"teacher_disagreement_score":0.17092992,"about_ca_system_score_codex":0.00020513004,"about_ca_system_score_gemma":0.0004048233,"threshold_uncertainty_score":0.9998594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56626004,0.00033508363,0.4037584,0.01653506,0.0034642739,0.0015977095,0.00015565018,0.00025718985,0.0076365937],"genre_scores_gemma":[0.9743042,0.00006145419,0.023055313,0.00013762554,0.00033020982,0.000086249296,0.000010294965,0.000020576374,0.001994066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998049,0.000060247814,0.000603102,0.0004993551,0.00037607353,0.00041222488],"domain_scores_gemma":[0.99849594,0.00019018703,0.00034633218,0.00051064085,0.00032100282,0.00013589417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029134715,0.00026768647,0.00025776975,0.00021443963,0.00019991783,0.00033119347,0.0015623453,0.00011184663,0.00015983527],"category_scores_gemma":[0.000065127984,0.00024224202,0.00016771581,0.00013114727,0.00024065525,0.000454007,0.0002970495,0.0002350143,0.000025020907],"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.00010085598,0.00045497416,0.000369625,0.000072749346,0.000113647555,0.0000035333137,0.00076601905,0.0012389885,0.35612532,0.03207589,0.0037042396,0.60497415],"study_design_scores_gemma":[0.0009808,0.00014929316,0.0045616026,0.0001548143,0.000040716044,0.00010482946,0.00004976562,0.7528177,0.20883173,0.00657818,0.025306605,0.00042398126],"about_ca_topic_score_codex":0.000052970398,"about_ca_topic_score_gemma":0.00027629733,"teacher_disagreement_score":0.7515787,"about_ca_system_score_codex":0.000117956915,"about_ca_system_score_gemma":0.00009408479,"threshold_uncertainty_score":0.9878343},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.4255394e-7,0.00002539845,0.4688096,0.00030222686,0.000058209764,0.000052293442,0.0000014598351,0.00021097006,0.5305391],"genre_scores_gemma":[0.0022834556,0.000018482971,0.017689865,0.00040324734,0.000045474328,0.000007781913,0.000028766308,0.000017123477,0.9795058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992087,0.0000034840266,0.00014978847,0.00035121763,0.00016829443,0.00011851467],"domain_scores_gemma":[0.9989268,0.000033785214,0.000055897304,0.00088039675,0.000027875452,0.000075249096],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000054410135,0.00014735396,0.00014994496,0.000076577395,0.000052889696,0.00008056788,0.00084939244,0.00014522889,0.00030375164],"category_scores_gemma":[0.000001519614,0.00012961046,0.00012419844,0.000023965415,0.00004000004,0.000037299065,0.000238273,0.00014585415,0.0020661333],"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":[6.144647e-8,0.0000025069212,2.4325917e-7,0.0000030300087,0.000006368561,0.0000017557251,0.000003603001,3.5473758e-7,0.000019812887,0.9707351,0.006593005,0.02263417],"study_design_scores_gemma":[0.000032700922,0.0000083211635,0.0000054799843,0.000007676728,0.000005322526,0.000009865153,7.825599e-8,0.015391515,0.000019182266,0.32569352,0.6586657,0.0001606237],"about_ca_topic_score_codex":0.0000036725457,"about_ca_topic_score_gemma":0.0000066216035,"teacher_disagreement_score":0.6520727,"about_ca_system_score_codex":0.000014091625,"about_ca_system_score_gemma":0.00002404731,"threshold_uncertainty_score":0.9987109},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028117965,0.021755064,0.13254997,0.0034164698,0.0007036339,0.004410348,0.00086360995,0.0012781498,0.83221096],"genre_scores_gemma":[0.7200652,0.00044503328,0.11485548,0.00523907,0.00060507446,0.0009543708,0.0001469134,0.0002731189,0.15741578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835414,0.00004090925,0.00037180734,0.0005881174,0.00026341525,0.0003816253],"domain_scores_gemma":[0.9983279,0.00018245276,0.00016148403,0.0010688034,0.000061565865,0.0001977553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004508422,0.00031542542,0.0003907714,0.00009855523,0.00012443123,0.00009350978,0.0006557021,0.00019346418,0.0000073141264],"category_scores_gemma":[0.00002568666,0.00033546143,0.0001200067,0.000037772836,0.00009514361,0.00011039713,0.0005230073,0.0001721559,0.00007899571],"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.000021785409,0.000026884225,0.0000045442384,0.00005360452,0.000021086049,0.000011151524,0.00004458708,5.884329e-7,0.0011440396,0.9910523,0.0014533789,0.006166017],"study_design_scores_gemma":[0.0016255435,0.0001508879,0.00031914376,0.0011327128,0.00014154769,0.00008799373,0.000004156549,0.003857599,0.0012289656,0.67304367,0.31722298,0.0011847776],"about_ca_topic_score_codex":0.000041088446,"about_ca_topic_score_gemma":0.000047048863,"teacher_disagreement_score":0.7172533,"about_ca_system_score_codex":0.000107633015,"about_ca_system_score_gemma":0.00016193496,"threshold_uncertainty_score":0.99990976},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000039075962,0.000035914993,0.30446365,0.00025042574,0.00009717369,0.00007403712,0.0000035246012,0.000274415,0.6947969],"genre_scores_gemma":[0.0006270673,0.000019880701,0.02326516,0.0002789516,0.00007143631,0.0000067978604,0.000026629648,0.000016312744,0.97568774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919164,0.0000025038855,0.00014434328,0.00036909565,0.00016928492,0.00012313588],"domain_scores_gemma":[0.9989278,0.000020962967,0.000052487176,0.0008824615,0.000043738324,0.000072591356],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000045064702,0.00014525995,0.00012825447,0.00007820807,0.00006126165,0.000086699954,0.00088331057,0.00014840509,0.0015748582],"category_scores_gemma":[0.000001290614,0.00012728777,0.00011266722,0.000030433463,0.000075132324,0.00007052521,0.00029509066,0.00011827347,0.0046056174],"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":[9.2157705e-8,0.0000042092265,1.8551867e-7,0.0000020989542,0.000008156335,0.0000027915696,0.000011227291,3.927429e-8,0.000023083889,0.9739357,0.020230513,0.005781851],"study_design_scores_gemma":[0.000027989596,0.000012354956,0.0000042372344,0.0000078466155,0.000005147983,0.0000112133885,2.2914907e-7,0.0056210817,0.000038953942,0.43552238,0.55859774,0.00015081429],"about_ca_topic_score_codex":0.0000029964567,"about_ca_topic_score_gemma":0.000009018801,"teacher_disagreement_score":0.5384134,"about_ca_system_score_codex":0.00001674918,"about_ca_system_score_gemma":0.000034516986,"threshold_uncertainty_score":0.99933785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006510342,0.00014427934,0.9523079,0.000011888031,0.00015920299,0.0009512221,0.00044647692,0.00022857335,0.045099434],"genre_scores_gemma":[0.9100354,9.825504e-7,0.08572424,0.000024342206,0.00008946271,0.00002027817,0.00015410404,0.00004512414,0.003906096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982008,0.000013394446,0.00057305687,0.00052085565,0.00036625954,0.00032563764],"domain_scores_gemma":[0.99810183,0.00009365114,0.0005630816,0.00089256646,0.00022294503,0.00012593299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014061376,0.0003635242,0.00041548305,0.00010397296,0.00015034968,0.00007951276,0.00068543013,0.00038442382,0.0000022318898],"category_scores_gemma":[0.00001510455,0.0004116539,0.00020669584,0.00004195041,0.000040289746,0.00020805058,0.00027215396,0.000117892014,0.000014745857],"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.000006048307,0.00003161702,0.000016053094,0.00014001645,0.000019025805,9.1252207e-7,0.00006750165,0.08200533,0.00092536246,0.9119379,0.00001733083,0.00483291],"study_design_scores_gemma":[0.0002860389,0.0000206605,0.000007519282,0.000047467773,0.000079403806,0.0000022141658,0.0000010557269,0.8285309,0.00065124134,0.16980797,0.000248168,0.00031734048],"about_ca_topic_score_codex":0.00014531519,"about_ca_topic_score_gemma":0.000047869813,"teacher_disagreement_score":0.9093843,"about_ca_system_score_codex":0.0003354865,"about_ca_system_score_gemma":0.000116033894,"threshold_uncertainty_score":0.9998335},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024368153,0.00008545709,0.28376505,0.00023550031,0.00011035143,0.000086289045,0.0000037639404,0.00029825454,0.7154129],"genre_scores_gemma":[0.0004932378,0.000044951426,0.026865507,0.00023177925,0.000022148082,0.0000070151063,0.000023987574,0.000016296131,0.9722951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923235,0.0000020184095,0.00013690368,0.00035995172,0.00015070153,0.00011804762],"domain_scores_gemma":[0.9988534,0.000015819078,0.00006342521,0.0009663655,0.000043773987,0.00005721761],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000044581495,0.00014698408,0.000121268655,0.000093404924,0.00006745453,0.000086358574,0.0008962488,0.000121787765,0.0014326968],"category_scores_gemma":[8.803257e-7,0.00013168302,0.00010391032,0.00003289231,0.00005881324,0.00007843512,0.0002546481,0.000098163546,0.0052182716],"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":[6.537103e-8,0.0000031314833,7.742282e-8,0.0000028083816,0.000008649191,0.0000023770392,0.0000164433,6.366712e-8,0.000028696566,0.9747282,0.01661297,0.0085964715],"study_design_scores_gemma":[0.00002500132,0.000010635432,0.000004576736,0.000009013115,0.000005056955,0.000009310238,2.970082e-7,0.005811378,0.000023272501,0.3964358,0.5975198,0.00014584222],"about_ca_topic_score_codex":0.0000027430062,"about_ca_topic_score_gemma":0.00001574918,"teacher_disagreement_score":0.58090687,"about_ca_system_score_codex":0.000018139646,"about_ca_system_score_gemma":0.000036031368,"threshold_uncertainty_score":0.9994801},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081172294,0.0019629921,0.96125203,0.00286575,0.0009840004,0.0026552933,0.000527216,0.00066548574,0.028275525],"genre_scores_gemma":[0.90609443,0.00022506971,0.05923279,0.0009592566,0.0013382646,0.0006696861,0.0010228507,0.00053562026,0.029922003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975478,0.000054461165,0.00054014486,0.0008494678,0.00060654717,0.00040155524],"domain_scores_gemma":[0.9966519,0.0003703873,0.0005838194,0.0020543952,0.00025990087,0.00007958864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026659807,0.0006403917,0.0006435693,0.00025933576,0.0004303942,0.0001329194,0.0018692195,0.00056751666,0.000018191256],"category_scores_gemma":[0.00003854669,0.00048269975,0.0008405557,0.00032714527,0.00031344444,0.00022710828,0.00025156897,0.00055166095,0.0000128778265],"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.00043974924,0.00065191527,0.00031379348,0.001507694,0.0011730904,0.000041330506,0.0010081417,0.0041251774,0.031401217,0.8556138,0.006609855,0.09711421],"study_design_scores_gemma":[0.0013112644,0.00071917835,0.0017669383,0.0010188223,0.0005231125,0.000063280924,0.000005990441,0.0060014455,0.22263706,0.16586964,0.5977604,0.0023228691],"about_ca_topic_score_codex":0.000036078607,"about_ca_topic_score_gemma":0.00010333701,"teacher_disagreement_score":0.90528274,"about_ca_system_score_codex":0.00004984032,"about_ca_system_score_gemma":0.00015650227,"threshold_uncertainty_score":0.9997625},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001597281,0.00011428442,0.33715746,0.000041712403,0.00004542893,0.000052125164,0.0000047295744,0.000083228915,0.66248506],"genre_scores_gemma":[0.03241567,0.000034457724,0.017005976,0.00004389213,0.0000651772,0.0000051291395,0.000024203131,0.000011567615,0.9503939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995883,0.0000045552465,0.0001421372,0.000089425186,0.00011742926,0.000058129463],"domain_scores_gemma":[0.9989678,0.00002783953,0.000092707225,0.0008061149,0.00008595764,0.000019530615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056444216,0.000082210405,0.000111837064,0.000073030824,0.000049936985,0.000020548265,0.00070211146,0.000080613085,0.00068230013],"category_scores_gemma":[6.8762256e-7,0.00007639077,0.000058047113,0.000019916377,0.00010343881,0.00007020752,0.0002650923,0.000069454036,0.00041138858],"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":[1.1711983e-7,0.0000041871317,9.672306e-7,0.0000071022764,0.000005957549,1.1222448e-7,0.00011716882,3.2067342e-7,0.000031385036,0.99307084,0.0055288114,0.001233053],"study_design_scores_gemma":[0.000058656275,0.00004223422,0.00003624918,0.000059702536,0.000011964326,0.0000072142952,0.00003054352,0.008149681,0.0003863616,0.40388808,0.58713746,0.00019184835],"about_ca_topic_score_codex":0.000067907364,"about_ca_topic_score_gemma":0.000049441394,"teacher_disagreement_score":0.58918273,"about_ca_system_score_codex":0.000026324473,"about_ca_system_score_gemma":0.000046992653,"threshold_uncertainty_score":0.7470708},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015821577,0.00021314636,0.30753016,0.00020039381,0.0005561188,0.00070731895,0.00020909582,0.0010234574,0.6894021],"genre_scores_gemma":[0.95325774,0.0000015979217,0.010629862,0.0008950163,0.0005010534,0.00011894179,0.00007422736,0.00012488349,0.034396704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965322,0.00006302303,0.00069087977,0.0011094401,0.00089729106,0.0007071349],"domain_scores_gemma":[0.99630183,0.00007065896,0.00038249433,0.0026896647,0.00012613456,0.00042922198],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027212038,0.00074648845,0.000797286,0.00013499614,0.0001886554,0.00034425236,0.002186296,0.0006064315,0.00006786911],"category_scores_gemma":[0.000010716139,0.0007371271,0.00057045696,0.000051322273,0.000117175994,0.00011660438,0.0005792578,0.00047106258,0.0017345769],"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.000010290384,0.00006486034,0.000003908017,0.000060127302,0.000057725272,0.000096653486,0.000022102064,0.000028641662,0.00041524568,0.9884598,0.0008274357,0.009953212],"study_design_scores_gemma":[0.0017222314,0.0003963361,0.000079752135,0.0009988267,0.000257605,0.0001654833,0.0000064551073,0.55563295,0.0010366866,0.16540779,0.27184024,0.002455633],"about_ca_topic_score_codex":0.000031917178,"about_ca_topic_score_gemma":0.000010760535,"teacher_disagreement_score":0.9530995,"about_ca_system_score_codex":0.00043891903,"about_ca_system_score_gemma":0.00023109926,"threshold_uncertainty_score":0.99950796},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017447826,0.00014012746,0.9759128,0.00012521137,0.00018883117,0.00056910573,0.000010507776,0.00023999943,0.0053655803],"genre_scores_gemma":[0.6953428,0.00020411875,0.2644951,0.00019213506,0.00018345148,0.00018903377,0.0026362797,0.000066757435,0.036690377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999196,0.000008757713,0.0001713544,0.0003444802,0.00012081716,0.00015860434],"domain_scores_gemma":[0.9993814,0.00009628841,0.000102560916,0.00024214569,0.000115692994,0.0000619051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011773624,0.00014964378,0.00014187132,0.0001189121,0.00016987375,0.00016471944,0.000296852,0.00014612482,0.000007944302],"category_scores_gemma":[0.000009629467,0.00014877369,0.00004455748,0.00015348931,0.000018500006,0.00017759354,0.000023875322,0.000073085546,0.000008417069],"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.000030214478,0.000098055505,0.00003726781,0.00026288762,0.000068583555,0.0000035538746,0.001982976,0.0000347464,0.0461446,0.8688589,0.0064683557,0.076009914],"study_design_scores_gemma":[0.0032108054,0.00051883777,0.009416397,0.00029792704,0.00035541362,0.0000799238,0.0038760935,0.3806649,0.23494717,0.03154697,0.33180082,0.0032847268],"about_ca_topic_score_codex":0.000089617744,"about_ca_topic_score_gemma":0.00040169136,"teacher_disagreement_score":0.83731186,"about_ca_system_score_codex":0.000024663319,"about_ca_system_score_gemma":0.00008894624,"threshold_uncertainty_score":0.6066815},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032457003,0.00029497236,0.28382546,0.00010723678,0.0004070342,0.00031329624,0.000096727934,0.00022885349,0.71469396],"genre_scores_gemma":[0.0017462501,0.0002709654,0.0049703005,0.00012153372,0.0002778976,5.696989e-7,0.00008169406,0.000044687655,0.9924861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974272,0.00005778223,0.00031292124,0.0012276357,0.00046697888,0.0005074675],"domain_scores_gemma":[0.9970319,0.00011994534,0.0003251532,0.0017499666,0.00023371828,0.0005393152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011328154,0.0005420629,0.0005527844,0.00019993659,0.00060019473,0.00039662977,0.0020451292,0.00042574876,0.000042018484],"category_scores_gemma":[0.000009094733,0.00073296897,0.0004376131,0.000042585714,0.00018320048,0.00025171693,0.0020873381,0.0006478635,0.00015045296],"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.000007752184,0.0000129196915,0.0000010860581,0.000057725876,0.00011839246,0.0006631949,0.00008256644,0.0000047066756,0.0007061576,0.9553903,0.028959438,0.013995781],"study_design_scores_gemma":[0.0005474664,0.000028481252,0.00002492828,0.00027369856,0.00022028785,0.0000797957,0.00003443543,0.0032386228,0.0027616394,0.000014940768,0.99203306,0.00074265536],"about_ca_topic_score_codex":0.0004866479,"about_ca_topic_score_gemma":0.000004274517,"teacher_disagreement_score":0.9630736,"about_ca_system_score_codex":0.00022805255,"about_ca_system_score_gemma":0.0005904248,"threshold_uncertainty_score":0.99951214},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018521693,0.0023121054,0.9755216,0.0005049387,0.00032264763,0.00044542106,0.000018120663,0.00041841564,0.001935022],"genre_scores_gemma":[0.9951257,0.00003451633,0.001487408,0.000068445865,0.0001243693,0.0001322964,0.000011626796,0.000012853694,0.003002763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873227,0.00016330059,0.00025746197,0.00039799174,0.0001805259,0.00026843324],"domain_scores_gemma":[0.99879193,0.00038919057,0.00006749743,0.0005704648,0.000034993453,0.00014594564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069907116,0.0001501288,0.00021128333,0.00005521336,0.00023557428,0.00020264016,0.0005199135,0.0000965787,0.000022035932],"category_scores_gemma":[0.00006778568,0.00012494432,0.000078480705,0.00015871727,0.0000794238,0.00016783067,0.00012477949,0.0000880811,0.000076072865],"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.0000075764333,0.00008891407,0.000011710681,0.00004686021,0.000019412388,0.0000043076207,0.00017599296,0.000075973956,0.0035217183,0.9764076,0.0008990622,0.01874086],"study_design_scores_gemma":[0.00051131117,0.00007531945,0.00007756658,0.00003372131,0.00001958073,0.00004773825,0.000036860765,0.9238662,0.0002621268,0.0188172,0.056007627,0.00024472817],"about_ca_topic_score_codex":0.000008039741,"about_ca_topic_score_gemma":0.0000016994451,"teacher_disagreement_score":0.97660404,"about_ca_system_score_codex":0.000023698602,"about_ca_system_score_gemma":0.000008730476,"threshold_uncertainty_score":0.50950813},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21708563,0.0005253384,0.25849992,0.46788034,0.0006516777,0.0024995627,0.000012659936,0.0006884605,0.052156407],"genre_scores_gemma":[0.9963858,0.00027682955,0.0022732639,0.000092871676,0.0001608105,0.00013541894,0.0000015767425,0.000018017514,0.0006553757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996811,0.00007462516,0.000440692,0.0006336535,0.0013240167,0.0007160433],"domain_scores_gemma":[0.9957378,0.0003043798,0.00037395358,0.0014154082,0.0018820119,0.0002864745],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023274436,0.00020040752,0.00029162623,0.00021842706,0.0013595214,0.0022609206,0.005760274,0.000103418366,0.000018549441],"category_scores_gemma":[0.0017437884,0.00014881564,0.00010721342,0.0004884445,0.0014671638,0.001579083,0.0019313666,0.0006176841,0.00012315542],"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.000008004198,0.00007182612,0.0029597958,0.00007685201,0.00003596208,0.000002487021,0.0024580953,0.0000012017775,0.0067789485,0.9712734,0.008301027,0.008032379],"study_design_scores_gemma":[0.0010162676,0.00027271826,0.035281207,0.00034899035,0.000020433545,0.000022635493,0.0019683226,0.10986988,0.018576017,0.81127614,0.020651981,0.0006954045],"about_ca_topic_score_codex":0.0004979244,"about_ca_topic_score_gemma":0.000015520756,"teacher_disagreement_score":0.7793002,"about_ca_system_score_codex":0.00006475734,"about_ca_system_score_gemma":0.00073410285,"threshold_uncertainty_score":0.9999406},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002297011,0.0003708994,0.9907694,0.003118105,0.0016010191,0.000977408,0.000027358628,0.00020280058,0.0027033219],"genre_scores_gemma":[0.096206285,0.000072950366,0.8973313,0.0038140602,0.00064580643,0.00035012802,0.000037548845,0.000059880025,0.0014820477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963414,0.000026190315,0.0005192365,0.0016861232,0.0007816514,0.00064539124],"domain_scores_gemma":[0.99739087,0.00046849428,0.00020994237,0.0014234598,0.0002925891,0.00021467658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006468695,0.00041073494,0.00042778492,0.0005445678,0.0006837881,0.00045006297,0.0037128034,0.00015664166,0.00011023887],"category_scores_gemma":[0.00009446725,0.000402442,0.00015256251,0.00097116415,0.000365866,0.00043974194,0.0016800101,0.0004324636,0.000060158654],"study_design_candidate":"design_other","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.000010724485,0.00007063903,0.000019259276,0.000042377433,0.000017930663,0.000040638268,0.0010365547,0.025418656,0.0008777304,0.21241497,0.0003653063,0.7596852],"study_design_scores_gemma":[0.00050219893,0.0005345901,0.00010008321,0.00019075928,0.00003093832,0.00011453283,0.0000010171019,0.6399837,0.0038190428,0.18329148,0.16984141,0.0015902186],"about_ca_topic_score_codex":0.000049994716,"about_ca_topic_score_gemma":0.000054316097,"teacher_disagreement_score":0.758095,"about_ca_system_score_codex":0.00021066607,"about_ca_system_score_gemma":0.0009792207,"threshold_uncertainty_score":0.99984276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5164727,0.00011758631,0.47774005,0.004322564,0.00002061838,0.0005832192,0.00004209843,0.000048335274,0.0006528129],"genre_scores_gemma":[0.9482177,0.000039562477,0.051686205,0.000011786354,0.0000099493855,0.000017899443,0.0000038146627,0.000008602709,0.00000450562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99549055,0.00030091507,0.00071005285,0.0006107369,0.0022373758,0.0006503498],"domain_scores_gemma":[0.99760795,0.00020481985,0.0003074541,0.0005098384,0.0008639777,0.0005059355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035049333,0.00017160861,0.0005132735,0.0004166326,0.00067245134,0.00017366554,0.001188252,0.000051835075,0.0000016848412],"category_scores_gemma":[0.00027072997,0.00013959952,0.00006390652,0.0027485262,0.0017475466,0.0010934455,0.00063011196,0.0006131337,0.0000013320188],"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.00016484754,0.0010730214,0.013005683,0.00042002555,0.00004380587,0.000019318586,0.008550217,0.1974118,0.36571676,0.40851995,0.00020678538,0.0048677726],"study_design_scores_gemma":[0.00047071348,0.00015633389,0.002188024,0.00006960838,0.000006111616,0.000009909773,0.0002600668,0.92737013,0.03267384,0.03665417,0.000011670296,0.00012941874],"about_ca_topic_score_codex":0.00008977186,"about_ca_topic_score_gemma":0.000044864784,"teacher_disagreement_score":0.72995836,"about_ca_system_score_codex":0.00020162914,"about_ca_system_score_gemma":0.00084175,"threshold_uncertainty_score":0.64389086},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6204658,0.00056440744,0.37695512,0.00011090689,0.00018911724,0.00016382281,0.0000314608,0.000068396956,0.0014509407],"genre_scores_gemma":[0.9993568,0.0000054064767,0.000106801366,0.000034713976,0.000010270228,0.000034814588,0.000006038146,0.000005710889,0.00043945044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989278,0.00027514884,0.00023866529,0.0002101998,0.0002272556,0.00012096094],"domain_scores_gemma":[0.99904543,0.00042669752,0.000117168354,0.000341572,0.000020837024,0.000048320013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006456737,0.000084030326,0.00019762831,0.00006936508,0.00014053861,0.00002811252,0.00039291172,0.000030581443,0.000028213695],"category_scores_gemma":[0.000019833622,0.0000733064,0.00005201645,0.00020262811,0.00012778546,0.00006511637,0.00024364937,0.00010902888,0.0000031024617],"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.000018078186,0.000077756704,0.000041410636,0.000040480565,0.000014163206,0.0000012207719,0.00044344208,0.0012429792,0.0035934984,0.9941276,0.00006496088,0.00033444708],"study_design_scores_gemma":[0.0008587816,0.0005211822,0.0056619784,0.000082393264,0.000041658568,0.000102787475,0.0018948383,0.1834775,0.0022989567,0.80348325,0.00112939,0.0004472656],"about_ca_topic_score_codex":0.000035253866,"about_ca_topic_score_gemma":4.109776e-7,"teacher_disagreement_score":0.378891,"about_ca_system_score_codex":0.000019413856,"about_ca_system_score_gemma":0.00002397487,"threshold_uncertainty_score":0.29893485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007451783,0.00087870564,0.9765548,0.0055663255,0.00027817566,0.0015044208,0.00012807247,0.00090373604,0.0067339423],"genre_scores_gemma":[0.13309205,0.0006507583,0.8546607,0.00022400546,0.000035744204,0.0013714427,0.0052697035,0.00011413786,0.0045814607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458206,0.0022432643,0.0007627281,0.0013319677,0.00051851844,0.00056147797],"domain_scores_gemma":[0.9928462,0.0013780535,0.00074867444,0.0032484473,0.0015407542,0.00023788675],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034587607,0.0004445757,0.00049687084,0.00025438567,0.0011086122,0.0013323853,0.0035695245,0.00026891663,0.0008179254],"category_scores_gemma":[0.00067180366,0.0005262813,0.00031907737,0.00082779396,0.00010954804,0.00035892823,0.0030281423,0.00056747836,0.000048650105],"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.00009853734,0.004949449,0.00076200545,0.0010905504,0.0008673848,0.000030126954,0.021053482,0.23678383,0.026552105,0.41840935,0.012837549,0.2765656],"study_design_scores_gemma":[0.00085425103,6.122553e-7,0.00016153874,0.00024595435,0.000049583155,0.00000904906,0.000016982403,0.9689486,0.0118708415,0.0024521523,0.014848189,0.00054225017],"about_ca_topic_score_codex":0.0002857969,"about_ca_topic_score_gemma":0.00010905805,"teacher_disagreement_score":0.73216474,"about_ca_system_score_codex":0.00032601514,"about_ca_system_score_gemma":0.0007084343,"threshold_uncertainty_score":0.9997189},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15379223,0.00007639383,0.84493923,0.00025102447,0.00021831214,0.00031986288,0.00001828491,0.000037936465,0.00034671644],"genre_scores_gemma":[0.9615911,0.000050809176,0.03780117,0.00028023127,0.00011128362,0.00006381888,0.0000030136912,0.000009424389,0.00008913914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894357,0.0000587059,0.00029985883,0.00022100142,0.000298522,0.00017835911],"domain_scores_gemma":[0.99919015,0.000078880075,0.00030406888,0.00029038027,0.000051044713,0.00008546248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005840528,0.000108028646,0.00016548911,0.00017303535,0.0005993001,0.00009660675,0.0005247355,0.000021571279,0.0000065648615],"category_scores_gemma":[0.000051846026,0.000102630605,0.00009510019,0.00021845667,0.000010321207,0.000100224315,0.00029423146,0.00016325139,0.0000021754995],"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.000046484696,0.00038210113,0.00007349736,0.000019044322,0.000017375598,0.00007358108,0.0012918535,0.0007425867,0.0004493703,0.72999597,0.00024156008,0.2666666],"study_design_scores_gemma":[0.004244867,0.0028179456,0.0027217187,0.00005144561,0.00014753029,0.00010081988,0.00097310345,0.64145637,0.0016691282,0.2772209,0.068127066,0.00046907525],"about_ca_topic_score_codex":0.000023241406,"about_ca_topic_score_gemma":0.0000041950934,"teacher_disagreement_score":0.80779886,"about_ca_system_score_codex":0.000043192256,"about_ca_system_score_gemma":0.000032631804,"threshold_uncertainty_score":0.46093923},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069309495,0.000014109199,0.9227769,0.0014848121,0.00027151546,0.00021588647,0.000005455101,0.0002528206,0.0056690024],"genre_scores_gemma":[0.9358455,0.0000028451086,0.06306593,0.00095680985,0.000027997814,0.000025738003,0.0000029633593,0.000007960952,0.000064260974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761015,0.00010579917,0.00020451855,0.00077010575,0.0008163576,0.00049306516],"domain_scores_gemma":[0.9983264,0.00015618945,0.00005847411,0.0011414447,0.0000542759,0.00026316955],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017442789,0.00016014035,0.00016166226,0.00023210853,0.0014008398,0.00037645086,0.0025593755,0.000023810833,0.00011612171],"category_scores_gemma":[0.00001915748,0.00014876813,0.00004384898,0.0015350215,0.0010458251,0.00048166246,0.00325366,0.00026073604,0.00006721093],"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.0000023383031,0.000088326764,0.000008588371,0.0000052992336,0.000002123541,0.000013174787,0.00029289475,0.00044279709,0.0033140997,0.98279244,0.0004395229,0.012598391],"study_design_scores_gemma":[0.00024112314,0.00028403208,0.00015598597,0.0000066462576,0.0000031909212,0.00003443467,0.000012295453,0.8484278,0.007449651,0.14175048,0.0014371284,0.00019727887],"about_ca_topic_score_codex":0.0000071564955,"about_ca_topic_score_gemma":2.4405526e-7,"teacher_disagreement_score":0.866536,"about_ca_system_score_codex":0.000096409145,"about_ca_system_score_gemma":0.00014752231,"threshold_uncertainty_score":0.9998992},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043529864,0.000058864007,0.9542011,0.00031866741,0.00020063562,0.00013918294,0.0000068273243,0.0005461713,0.0009987138],"genre_scores_gemma":[0.42314008,0.0000028087863,0.57554346,0.00039342488,0.00007990726,0.00005542382,0.00004049186,0.000014385467,0.00073001644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989686,0.000052336487,0.00016872166,0.00031520703,0.00029851802,0.00019659259],"domain_scores_gemma":[0.99930495,0.000018982748,0.000058249654,0.0005303035,0.00002533028,0.00006221266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020537701,0.00008989624,0.00008740677,0.000089559435,0.0004792345,0.00007173269,0.0006372469,0.00001294294,0.00032083094],"category_scores_gemma":[0.0000023748767,0.00009581357,0.000063071086,0.0003992499,0.000015875852,0.0002273118,0.00055940956,0.00011860096,0.00010652715],"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.000002125046,0.0006364656,0.000106291605,0.000020980147,0.000045132572,0.00017396058,0.0007187306,0.011653192,0.32468238,0.27464423,0.0072965897,0.3800199],"study_design_scores_gemma":[0.00009824504,0.000018013556,0.000032590233,8.62914e-7,0.0000038284825,0.00007245367,0.000020674683,0.92902535,0.03158459,0.0017513406,0.037268676,0.00012338141],"about_ca_topic_score_codex":0.000054136664,"about_ca_topic_score_gemma":2.8291555e-7,"teacher_disagreement_score":0.91737217,"about_ca_system_score_codex":0.00007829203,"about_ca_system_score_gemma":0.00006386738,"threshold_uncertainty_score":0.3907164},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023962103,0.0055225096,0.9243737,0.009012951,0.0012362903,0.003337424,0.000091039976,0.00297722,0.029486747],"genre_scores_gemma":[0.44240478,0.0010134451,0.53433245,0.00033403301,0.0024581016,0.003147866,0.0004837505,0.00017817349,0.015647432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962182,0.0003837224,0.00025000906,0.00097047485,0.0015532653,0.00062432076],"domain_scores_gemma":[0.9969132,0.00017902274,0.00007362982,0.002330047,0.00019781315,0.00030629817],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00125666,0.00019197997,0.00021241973,0.0004040882,0.00063833385,0.0008608706,0.0035745562,0.00014554226,0.000667103],"category_scores_gemma":[0.00004998244,0.00020385231,0.00016168496,0.0010460605,0.000025487112,0.00013154076,0.011151215,0.001754588,0.0003327291],"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.000006636716,0.0005113753,0.0011391332,0.00076586,0.00018286612,0.00033033494,0.0063156774,0.001943563,0.0025438268,0.62030786,0.18729435,0.1786585],"study_design_scores_gemma":[0.00026330195,0.000083949024,0.0017197417,0.000114006965,0.000007981989,0.000015040634,0.00010735027,0.09383983,0.0013641332,0.028698312,0.87325066,0.0005357053],"about_ca_topic_score_codex":0.00036809593,"about_ca_topic_score_gemma":0.000019763973,"teacher_disagreement_score":0.6859563,"about_ca_system_score_codex":0.0003655812,"about_ca_system_score_gemma":0.0017490236,"threshold_uncertainty_score":0.9968464},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8050569,0.0005829459,0.19193195,0.0012773437,0.00008430021,0.00017762868,0.0000012415853,0.00016362681,0.0007240545],"genre_scores_gemma":[0.9972628,0.000764137,0.0007587954,0.000036436562,0.000032616284,0.000010031373,0.0000016682982,0.000011155249,0.001122365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835914,0.00002320247,0.00022088746,0.00019347426,0.00024736492,0.0009559383],"domain_scores_gemma":[0.9993882,0.00002853907,0.000106294814,0.00035804178,0.000049245624,0.000069686736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008426467,0.00010668517,0.000138457,0.00017504385,0.00020090396,0.00009145376,0.00057776883,0.000039914758,0.0000034131733],"category_scores_gemma":[0.000022096896,0.000084840794,0.00005679443,0.00047063341,0.000042282692,0.00025759736,0.00015237392,0.0004495997,0.00006426305],"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.000018194705,0.0001470955,0.00010183307,0.00003658784,0.00008713602,0.000011757488,0.00062276697,0.0003065365,0.11461276,0.83104736,0.00057548436,0.052432477],"study_design_scores_gemma":[0.0015273315,0.0008061669,0.0009950969,0.00014659412,0.0000336948,0.0004917388,0.0007020187,0.3610128,0.08805202,0.54265237,0.0031060004,0.00047414284],"about_ca_topic_score_codex":0.000021734739,"about_ca_topic_score_gemma":0.000035979705,"teacher_disagreement_score":0.36070627,"about_ca_system_score_codex":0.00011808473,"about_ca_system_score_gemma":0.0006318474,"threshold_uncertainty_score":0.3459707},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124173135,0.000019128807,0.8731274,0.00019105812,0.0005174124,0.0005072828,0.00005494022,0.00070336985,0.0007062888],"genre_scores_gemma":[0.99092144,0.000056518,0.002960198,0.00006760647,0.000078895406,0.000011764224,0.00002940868,0.000022980466,0.005851208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998384,0.00005731454,0.00015883558,0.0009912116,0.00007474743,0.00033388846],"domain_scores_gemma":[0.99793905,0.00031018665,0.00016958494,0.0013344358,0.00012019021,0.00012653913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030661796,0.0002221076,0.0002435244,0.00018407212,0.00024929328,0.00014927759,0.002345289,0.00019975424,0.0000067458905],"category_scores_gemma":[0.000051761297,0.00026306164,0.00021685334,0.00055354007,0.00015449268,0.00018405687,0.0020487611,0.00030138588,0.00019269146],"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.000013838419,0.000055758028,0.00031948503,0.000059199192,0.000038128794,0.000052957905,0.00014870436,0.052034814,0.00044934946,0.9452563,0.00094914663,0.00062230567],"study_design_scores_gemma":[0.00022851703,0.000019657826,0.0008568664,0.000043725162,0.000033670658,0.000002911458,0.00003029083,0.7902199,0.00062452885,0.205024,0.002592795,0.00032311876],"about_ca_topic_score_codex":0.00006781092,"about_ca_topic_score_gemma":0.000021608892,"teacher_disagreement_score":0.8701672,"about_ca_system_score_codex":0.00011753626,"about_ca_system_score_gemma":0.0001737243,"threshold_uncertainty_score":0.9999822},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010315539,0.009464359,0.9754706,0.000010269321,0.0009049429,0.00053725153,0.000015179505,0.0001275062,0.0031543276],"genre_scores_gemma":[0.9850228,0.0009462279,0.01076023,0.000002727898,0.00014661562,0.000009663327,0.000040615152,0.00004313672,0.0030280296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997972,0.000045520577,0.00091012596,0.0005094751,0.00038995454,0.00017288678],"domain_scores_gemma":[0.99821794,0.00020864878,0.000870708,0.0005117075,0.00014880631,0.000042165186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031056415,0.00020896793,0.0004929812,0.00035336922,0.00009153191,0.000034469693,0.00033530392,0.00014786253,0.0000019334236],"category_scores_gemma":[0.000016230779,0.00023171479,0.000102265,0.00023886932,0.00007435159,0.00022813003,0.0003003108,0.00015723113,0.0000065425315],"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.000012286987,0.0000869141,0.00020656503,0.0011179262,0.000092686656,0.000016412972,0.0003977927,0.21253453,0.018321473,0.69580543,0.000013716433,0.07139429],"study_design_scores_gemma":[0.00012309609,0.000051941806,0.000047735462,0.0014797734,0.000031953816,0.000033106367,0.00009419593,0.97650796,0.0072786277,0.0132231265,0.0008651125,0.0002633421],"about_ca_topic_score_codex":0.00028916445,"about_ca_topic_score_gemma":0.000019150366,"teacher_disagreement_score":0.9747072,"about_ca_system_score_codex":0.00013255929,"about_ca_system_score_gemma":0.00006213668,"threshold_uncertainty_score":0.9449055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.784318,0.00026563695,0.21372336,0.0006958774,0.00017448496,0.00013488167,0.00002609954,0.0000543356,0.0006073486],"genre_scores_gemma":[0.93668103,0.000030424972,0.06294653,0.000041549225,0.000041683943,0.0000025777192,0.0000051550487,0.000016249493,0.000234798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990772,0.00001860089,0.0004088949,0.00010141545,0.00018233474,0.00021156993],"domain_scores_gemma":[0.9988048,0.00012478336,0.00027277623,0.00036050592,0.00013287611,0.0003042801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050987286,0.00008967631,0.00022198237,0.0002948352,0.000091623646,0.00007678719,0.00059880636,0.000046655543,0.000012652254],"category_scores_gemma":[0.00008954142,0.00008288581,0.000055149303,0.00057530403,0.00006327725,0.00019176105,0.00006031844,0.000103904604,0.000022969585],"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.0000063782636,0.000505782,0.0053227236,0.0030803538,0.00042788128,0.0016314395,0.029414576,0.0016123937,0.07993329,0.83602005,0.01888969,0.023155408],"study_design_scores_gemma":[0.0018070113,0.00033066343,0.009440394,0.000946147,0.0001513137,0.0008832385,0.002126536,0.8484983,0.027863802,0.054025967,0.053076986,0.0008496536],"about_ca_topic_score_codex":0.00029091287,"about_ca_topic_score_gemma":0.0004562885,"teacher_disagreement_score":0.8468859,"about_ca_system_score_codex":0.000028238863,"about_ca_system_score_gemma":0.00029731813,"threshold_uncertainty_score":0.33799854},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4495915,0.00002855867,0.54650617,0.0019223364,0.0014955391,0.00008323006,0.0000061382407,0.000027173504,0.00033938003],"genre_scores_gemma":[0.9346809,0.000051035382,0.065136604,0.000034300832,0.00007564604,0.0000025546406,0.0000051039196,0.0000031874793,0.000010665058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810684,0.000038162812,0.0007182201,0.00018539888,0.00081502105,0.00013634353],"domain_scores_gemma":[0.9978483,0.00014692938,0.00058967725,0.00031032992,0.0010490232,0.00005577505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010885607,0.000076275486,0.00016284338,0.0014893283,0.000066857036,0.00014130097,0.0022710548,0.000025561068,0.000008755439],"category_scores_gemma":[0.00010330526,0.00007366545,0.000097209486,0.002056289,0.00024203691,0.0013600353,0.00020626915,0.00009568363,0.000010224494],"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.00002274957,0.00049744727,0.0078073884,0.000025281359,0.00009792367,0.000050414557,0.0035590925,0.020625925,0.15475105,0.43310532,0.0010665456,0.37839088],"study_design_scores_gemma":[0.0011331899,0.00027372607,0.36419052,0.0003438453,0.000012919532,0.00026185755,0.00009971369,0.47915903,0.07545712,0.07555842,0.003199407,0.00031022995],"about_ca_topic_score_codex":0.000028643582,"about_ca_topic_score_gemma":0.000015610638,"teacher_disagreement_score":0.4850894,"about_ca_system_score_codex":0.00006652733,"about_ca_system_score_gemma":0.00037025,"threshold_uncertainty_score":0.42202225},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30755877,0.00007223933,0.6894451,0.0013220172,0.00013730672,0.00017611554,0.000005205096,0.0012345621,0.000048741804],"genre_scores_gemma":[0.97634614,0.000069622576,0.0232728,0.0000806472,0.000014040624,0.0000913251,0.000002044343,0.000021481312,0.000101912345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874806,0.00002903706,0.00020870462,0.00050573214,0.00015937534,0.00034910586],"domain_scores_gemma":[0.99896455,0.000046994704,0.00005412774,0.0008134471,0.000044300632,0.0000765535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013958295,0.00016851658,0.00018352934,0.0006404098,0.0004103517,0.000065120854,0.00051133346,0.00020218796,0.000009724508],"category_scores_gemma":[0.0000040642462,0.00017394323,0.0000806748,0.0016530332,0.00014538542,0.00017682913,0.000014689897,0.00031452306,0.00025502735],"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.000011022871,0.00042427127,0.00011705825,0.00005870515,0.00022118549,0.0003336481,0.0004942838,0.108918466,0.325711,0.064066246,0.00026377488,0.49938035],"study_design_scores_gemma":[0.0006243893,0.00011575287,0.00009820876,0.000029212608,0.000051696305,0.00035688924,0.000060870596,0.8239658,0.16469114,0.005872571,0.0037774232,0.00035606726],"about_ca_topic_score_codex":0.000030147236,"about_ca_topic_score_gemma":0.000027047477,"teacher_disagreement_score":0.7150473,"about_ca_system_score_codex":0.0000637571,"about_ca_system_score_gemma":0.00004525874,"threshold_uncertainty_score":0.70931995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37130755,0.06258302,0.46307307,0.06705466,0.0018026787,0.006414993,0.0027319635,0.012506019,0.012526064],"genre_scores_gemma":[0.9874994,0.005793969,0.0024458421,0.0017921539,0.00028053974,0.00018403307,0.0015391915,0.00004378681,0.00042108053],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804,0.00009555777,0.00029424447,0.00078373967,0.00041426488,0.00037218363],"domain_scores_gemma":[0.9967936,0.00016361936,0.00012234306,0.002694587,0.00003600489,0.00018983446],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038925133,0.00019202828,0.00034343978,0.000042617066,0.0001666321,0.00010642168,0.0027592499,0.000030051999,0.000012499731],"category_scores_gemma":[0.000103221755,0.0001734299,0.00009586455,0.0012178737,0.0000686771,0.00039468115,0.00093747664,0.00022616393,0.00079079036],"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.0000015370407,0.0009284284,0.000013498078,0.0008604685,0.000046253906,0.00005167614,0.0004346679,0.0000062063646,0.32225513,0.038316168,0.4121449,0.22494107],"study_design_scores_gemma":[0.00057178835,0.000074310236,0.00012169388,0.00058001425,0.00007546117,0.000008387871,0.000017517505,0.5684684,0.017304108,0.0030136278,0.40917802,0.0005867018],"about_ca_topic_score_codex":0.000034802233,"about_ca_topic_score_gemma":0.0000031932354,"teacher_disagreement_score":0.61619186,"about_ca_system_score_codex":0.000034257057,"about_ca_system_score_gemma":0.00009742953,"threshold_uncertainty_score":0.9999872},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055474916,0.0005219684,0.013553609,0.00053881155,0.0012856314,0.0005011638,0.00012927306,0.00039643157,0.9825184],"genre_scores_gemma":[0.028606765,0.0026353225,0.00553247,0.000034376924,0.0002651724,0.000054018587,0.00006657604,0.000057734786,0.9627476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771404,0.000018281558,0.00053043227,0.0006653467,0.0007379544,0.0003339202],"domain_scores_gemma":[0.99816084,0.00009558724,0.0003501654,0.0009988599,0.00022200083,0.0001725227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062275666,0.00028145657,0.0005144972,0.0003413863,0.0004570208,0.00029469462,0.0016257052,0.00013882472,0.000009031949],"category_scores_gemma":[0.000036394275,0.0002680497,0.00008375772,0.00034917184,0.001944614,0.00071518705,0.00080727215,0.00020464398,0.000089651396],"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":[7.4746515e-7,0.000005773883,0.000014505399,0.00010940213,0.000008146063,0.0000055523255,0.00033142223,0.000004544794,0.000022428085,0.99744624,0.00025003045,0.0018012258],"study_design_scores_gemma":[0.0001874979,0.00017581982,0.0015443042,0.00048993883,0.000039834118,0.0002445397,0.0002950919,0.036499985,0.000049040325,0.6763435,0.28304383,0.0010866562],"about_ca_topic_score_codex":0.000119361095,"about_ca_topic_score_gemma":0.00014209736,"teacher_disagreement_score":0.32110274,"about_ca_system_score_codex":0.000059226968,"about_ca_system_score_gemma":0.00034883234,"threshold_uncertainty_score":0.9999772},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43247622,0.0007080896,0.559696,0.00036830406,0.0005241751,0.0002711125,0.000010934056,0.0010959273,0.004849216],"genre_scores_gemma":[0.9984542,0.0000511164,0.0003306072,0.000048185728,0.00008481522,0.000043652617,0.000010710246,0.0000099741455,0.00096669694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986876,0.00022369045,0.00023353353,0.00037690447,0.00018248106,0.00029575365],"domain_scores_gemma":[0.9988649,0.00056456635,0.00005952933,0.00039340253,0.000018234556,0.00009935427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009005414,0.00012969133,0.00018901362,0.00006121986,0.00032578484,0.00023339796,0.00043344186,0.00008000387,0.0000044636636],"category_scores_gemma":[0.00005488574,0.00011050324,0.000052785115,0.00047765317,0.000060533413,0.0002479521,0.0002402549,0.00011885881,0.00017338691],"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.0000030685092,0.000013574474,0.00011556356,0.000031753276,0.000011405714,0.000014960476,0.00065238634,0.00019029828,0.0033036708,0.9948059,0.00019574887,0.00066169177],"study_design_scores_gemma":[0.00043446623,0.00005089882,0.0017179558,0.00016699689,0.000021957612,0.00017203468,0.0007719822,0.8399579,0.0005909673,0.14420463,0.011401191,0.0005090472],"about_ca_topic_score_codex":0.00002473092,"about_ca_topic_score_gemma":0.0000024722744,"teacher_disagreement_score":0.85060126,"about_ca_system_score_codex":0.000024365774,"about_ca_system_score_gemma":0.000018733983,"threshold_uncertainty_score":0.45061916},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.1805619e-8,0.00014385217,0.5632486,0.00019271727,0.00027282687,0.00056429557,0.000041763535,0.00097576366,0.43456018],"genre_scores_gemma":[0.014135199,0.00009015762,0.0022481966,0.00007607474,0.0005175579,0.00029506919,0.0003184833,0.00014678686,0.9821725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799216,0.000017626382,0.00048025342,0.0007073259,0.00048281057,0.00031981742],"domain_scores_gemma":[0.9978347,0.00019103788,0.00030447732,0.001460123,0.00006312353,0.000146544],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022483576,0.00033111073,0.00040640548,0.00035093896,0.000437909,0.00050885585,0.0013309022,0.0002239302,0.000044526165],"category_scores_gemma":[0.000003197645,0.0003537064,0.00017291885,0.00019272917,0.000091063404,0.00011806962,0.00035729428,0.00025225183,0.0026515622],"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":[2.5065853e-7,0.000005646101,5.3315324e-7,0.00007543972,0.00004895917,0.0000073155165,0.000050764407,0.00003428047,0.000037473103,0.97643,0.023011807,0.00029752564],"study_design_scores_gemma":[0.00009503033,0.000011531767,0.000001642311,0.00010859865,0.000020740496,0.000031490672,0.000043542193,0.023534257,9.665782e-7,0.26579785,0.70999306,0.00036126253],"about_ca_topic_score_codex":0.000017937691,"about_ca_topic_score_gemma":0.000010984068,"teacher_disagreement_score":0.71063215,"about_ca_system_score_codex":0.000507255,"about_ca_system_score_gemma":0.00009455105,"threshold_uncertainty_score":0.9998915},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000022760244,0.00019926298,0.52232766,0.000108893,0.0009286557,0.00029148543,0.000035216206,0.0011451059,0.47496143],"genre_scores_gemma":[0.05870095,0.00008835797,0.0011696056,0.000052422085,0.0005661978,0.000057241978,0.00017239974,0.00015084387,0.939042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977727,0.000026092628,0.0005552128,0.0006479296,0.00061108236,0.00038697713],"domain_scores_gemma":[0.9982414,0.00022198161,0.0003637296,0.0009923202,0.00006122077,0.00011931444],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003255023,0.0003556745,0.00047231285,0.00040162157,0.0005160756,0.0010050914,0.0011585554,0.00019042607,0.000060622653],"category_scores_gemma":[0.000009763283,0.00038901356,0.0001962561,0.00013236034,0.000094559226,0.00026502056,0.00048896385,0.00025533195,0.0014296481],"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":[3.2756063e-7,0.0000033934973,0.0000020644102,0.00012752078,0.000056328714,0.00003375655,0.00023018685,0.00004429285,0.00007576943,0.98141986,0.017934168,0.00007233465],"study_design_scores_gemma":[0.00029544096,0.00003201807,0.000009531564,0.00096288515,0.000050644383,0.0001423646,0.0009500914,0.06346752,0.000010737644,0.81643015,0.11659517,0.0010534254],"about_ca_topic_score_codex":0.000035019388,"about_ca_topic_score_gemma":0.000010343782,"teacher_disagreement_score":0.52115804,"about_ca_system_score_codex":0.0005341306,"about_ca_system_score_gemma":0.00007494682,"threshold_uncertainty_score":0.9998562},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010132677,0.00017859742,0.5696959,0.0002691781,0.0010858891,0.0008451128,0.00006868597,0.002119756,0.4257359],"genre_scores_gemma":[0.0839095,0.000057381327,0.0018407283,0.000067922636,0.0006016181,0.00012453932,0.00050770305,0.00027955594,0.91261107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968895,0.000044441505,0.0007245106,0.0010334637,0.00079741864,0.0005106734],"domain_scores_gemma":[0.9969299,0.000287731,0.00043463326,0.002058778,0.0000817499,0.00020723828],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004500635,0.00052644475,0.00066202774,0.00042022936,0.00045319248,0.00078490673,0.0018210192,0.0003228391,0.00006110071],"category_scores_gemma":[0.000018218687,0.00054235983,0.00024061736,0.00021747671,0.00014917448,0.00017197842,0.00061379716,0.00035430322,0.0021591915],"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":[7.943531e-7,0.000012351087,4.0227016e-7,0.00025190166,0.000072124574,0.00006024048,0.00011138089,0.00015681535,0.00013217241,0.9756085,0.02350725,0.00008604998],"study_design_scores_gemma":[0.0003197899,0.000055406814,0.000003348897,0.00056987064,0.000064632426,0.000072300994,0.000070341346,0.31975782,0.000005279223,0.39794403,0.2802277,0.00090948853],"about_ca_topic_score_codex":0.00003551809,"about_ca_topic_score_gemma":0.000014390229,"teacher_disagreement_score":0.5776645,"about_ca_system_score_codex":0.0008443763,"about_ca_system_score_gemma":0.00016561146,"threshold_uncertainty_score":0.9997028},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.9744957e-7,0.00031821977,0.6283956,0.00021300037,0.0014173889,0.00059576856,0.00006198579,0.0023304261,0.36666703],"genre_scores_gemma":[0.007353197,0.000042354724,0.0016155053,0.000058650356,0.00055732246,0.00009049369,0.0005994023,0.00016082526,0.9895223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965589,0.00008681558,0.0007206557,0.0010578911,0.0008830952,0.0006926365],"domain_scores_gemma":[0.9966744,0.0003050249,0.00045604032,0.0022670683,0.00007274739,0.00022469938],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057373545,0.0005264257,0.00073268445,0.0005123499,0.0005976072,0.0011519679,0.0024321505,0.00037220732,0.00004632012],"category_scores_gemma":[0.000013621861,0.00055594137,0.00025839856,0.0005189383,0.00011599494,0.00026075024,0.00077899673,0.00040158952,0.002950862],"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":[4.896837e-7,0.0000138209025,5.872086e-7,0.00020103111,0.000062853316,0.00004546285,0.0001113641,0.00011295755,0.00021291852,0.64155936,0.35764176,0.000037393784],"study_design_scores_gemma":[0.00031611943,0.000037512673,0.0000020846362,0.00041830484,0.000041964737,0.000046551166,0.00011777205,0.3154114,0.000012857183,0.09653756,0.5863235,0.0007343897],"about_ca_topic_score_codex":0.00005151753,"about_ca_topic_score_gemma":0.000013746988,"teacher_disagreement_score":0.6267801,"about_ca_system_score_codex":0.0016514345,"about_ca_system_score_gemma":0.00048766428,"threshold_uncertainty_score":0.9998849},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018008403,0.00030524275,0.4684001,0.00029277592,0.00095475186,0.0005091343,0.00012854935,0.00091080053,0.52849686],"genre_scores_gemma":[0.015197864,0.00019954695,0.0058762687,0.0002212216,0.0007524243,0.00008823657,0.00107316,0.00022365058,0.97636765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751365,0.000026573218,0.0005891738,0.0007737115,0.0006362395,0.000460646],"domain_scores_gemma":[0.9980503,0.00018407652,0.000337655,0.0012218476,0.000051158026,0.00015500053],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034090105,0.0004143197,0.0005165068,0.00037628587,0.000500755,0.00062787044,0.0013048183,0.00020615906,0.00013580828],"category_scores_gemma":[0.0000027298152,0.00043528446,0.00019615938,0.00012134438,0.000095258525,0.00020034413,0.00038345932,0.00027366905,0.0018479488],"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":[7.5802217e-7,0.0000076270267,0.0000019338702,0.00010405249,0.00009637491,0.000028363438,0.00013131638,0.000041204876,0.00009251758,0.926762,0.07262555,0.00010830106],"study_design_scores_gemma":[0.00027263246,0.00004296579,0.0000044063268,0.00030897168,0.000047482674,0.000052423045,0.00018727395,0.048748307,0.000006097131,0.55504966,0.39458823,0.0006915264],"about_ca_topic_score_codex":0.00007776498,"about_ca_topic_score_gemma":0.000039991275,"teacher_disagreement_score":0.46252382,"about_ca_system_score_codex":0.0006659993,"about_ca_system_score_gemma":0.00009097044,"threshold_uncertainty_score":0.9998099},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.9490925e-7,0.00014253132,0.6044914,0.00015304175,0.0011735063,0.0005126145,0.00006924065,0.0017164048,0.39174035],"genre_scores_gemma":[0.15821211,0.00006498782,0.0018664547,0.00008068267,0.00059459475,0.00007662334,0.0004026478,0.00026650028,0.8384354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701667,0.00004027361,0.0007199545,0.0009678473,0.00074642187,0.0005088125],"domain_scores_gemma":[0.99697745,0.00030593353,0.0004492628,0.0019890585,0.00006187734,0.00021642928],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003706687,0.00052619644,0.0006656131,0.00046478788,0.00048288735,0.0008231258,0.0018531282,0.00032401466,0.00005773388],"category_scores_gemma":[0.000013139471,0.00055720535,0.00024756553,0.00018302765,0.00013599056,0.00015598508,0.00061582634,0.00033297387,0.0025327953],"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":[7.993465e-7,0.000008946782,5.6589045e-7,0.00017098524,0.00006834636,0.00012922265,0.00010082863,0.00004749841,0.00021028135,0.9822349,0.016866347,0.0001613124],"study_design_scores_gemma":[0.00040853902,0.00007601703,0.0000050189124,0.0006477178,0.000086018925,0.00014234394,0.00009074887,0.4017271,0.000010219827,0.22921789,0.36644158,0.0011467972],"about_ca_topic_score_codex":0.000025886682,"about_ca_topic_score_gemma":0.0000109110915,"teacher_disagreement_score":0.753017,"about_ca_system_score_codex":0.0006321614,"about_ca_system_score_gemma":0.00014712467,"threshold_uncertainty_score":0.99968797},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.249218e-8,0.0001846053,0.59157777,0.00014694975,0.0007766296,0.00038052202,0.000023795672,0.0010532667,0.40585643],"genre_scores_gemma":[0.0032939832,0.00008720214,0.0647585,0.000081971266,0.0004334868,0.00008837324,0.00019911147,0.00021582539,0.93084157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976255,0.000074614196,0.0005828634,0.0008176876,0.0004843634,0.0004149369],"domain_scores_gemma":[0.99756664,0.00035837907,0.00038465456,0.0014734399,0.000058140973,0.00015872039],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077657483,0.00041883736,0.0006088228,0.0004044275,0.0003815196,0.0006487785,0.0014089362,0.00027169462,0.000047676574],"category_scores_gemma":[0.000011502582,0.00042226605,0.00022540672,0.00018820773,0.00010063289,0.00014391006,0.00053218834,0.00031414602,0.00078858755],"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":[5.5009775e-7,0.0000048434968,2.8443316e-7,0.00012993722,0.000076201795,0.00001726315,0.00012798792,0.000047718782,0.00017038819,0.9852871,0.013647545,0.000490196],"study_design_scores_gemma":[0.00016786669,0.000023910963,0.000001415919,0.0002672325,0.000036775207,0.00006940698,0.00009077591,0.23208934,0.000008886558,0.42363778,0.34299853,0.0006080698],"about_ca_topic_score_codex":0.000023304101,"about_ca_topic_score_gemma":0.0000049284986,"teacher_disagreement_score":0.5616493,"about_ca_system_score_codex":0.00053232507,"about_ca_system_score_gemma":0.0000839614,"threshold_uncertainty_score":0.9999894},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8089345e-7,0.0001056048,0.52890605,0.00022531039,0.00068234355,0.0005112144,0.000050575458,0.0010520096,0.4684667],"genre_scores_gemma":[0.064147085,0.000024439783,0.0010840375,0.00004596492,0.00038938553,0.00010639863,0.00019926796,0.00013760715,0.9338658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978528,0.000029132445,0.00050214224,0.00068638986,0.0004940617,0.00043547235],"domain_scores_gemma":[0.99802417,0.00023474256,0.000276747,0.001247263,0.00007087693,0.00014621788],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032439083,0.00034075242,0.00042581846,0.000326126,0.0005997892,0.0005220424,0.00108345,0.00021467346,0.000031514],"category_scores_gemma":[0.000013989068,0.0003552115,0.00018284135,0.00013434584,0.0001359719,0.00009590085,0.00045322347,0.00026375588,0.0011928434],"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":[3.5545202e-7,0.000006065867,2.1084715e-7,0.00010519633,0.000050154256,0.000014925767,0.000092205686,0.00015765126,0.00003129696,0.97812015,0.021352464,0.00006933182],"study_design_scores_gemma":[0.0001657092,0.000032269087,0.0000039844554,0.00036109856,0.000044912904,0.00007293278,0.00007028325,0.1585986,4.724955e-7,0.6063372,0.2337312,0.0005813598],"about_ca_topic_score_codex":0.000028694083,"about_ca_topic_score_gemma":0.000033030847,"teacher_disagreement_score":0.527822,"about_ca_system_score_codex":0.0007427204,"about_ca_system_score_gemma":0.00014907403,"threshold_uncertainty_score":0.99988997},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.49632e-7,0.00006505397,0.5383677,0.00012246855,0.00076481694,0.00055786455,0.000054688837,0.00089153077,0.45917547],"genre_scores_gemma":[0.23991926,0.000051150873,0.0061768563,0.00016596184,0.0012626012,0.00018037383,0.00044417946,0.00035301162,0.7514466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741805,0.000043092397,0.0006673419,0.00080573023,0.00062832085,0.0004374491],"domain_scores_gemma":[0.99792176,0.0003029177,0.00039869244,0.0011419031,0.00006115295,0.00017358895],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032827488,0.00043684294,0.00055965397,0.00038630073,0.00044162126,0.0007257791,0.00130147,0.00027501487,0.000035767942],"category_scores_gemma":[0.000009400314,0.00045766647,0.00019936981,0.00015593797,0.00012739716,0.00014126173,0.0004619726,0.00032205787,0.0012214414],"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.0000010800879,0.0000073510837,4.94645e-7,0.00017592352,0.000059739796,0.000078517594,0.00015503315,0.00010909805,0.00004232328,0.9914261,0.0077765803,0.00016777072],"study_design_scores_gemma":[0.00040253653,0.00010296622,0.000004261314,0.0008568677,0.00007772032,0.00024679356,0.00009692435,0.20128833,0.00000383213,0.5869163,0.20896845,0.0010349762],"about_ca_topic_score_codex":0.000035598096,"about_ca_topic_score_gemma":0.000013859358,"teacher_disagreement_score":0.5321908,"about_ca_system_score_codex":0.0005791463,"about_ca_system_score_gemma":0.00017593944,"threshold_uncertainty_score":0.9997875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47992218,0.000041791252,0.5190565,0.00007110157,0.00010453277,0.00029807087,0.000055797984,0.00034933496,0.00010066827],"genre_scores_gemma":[0.9974819,0.00000477845,0.0016257929,0.00003125456,0.00005436798,0.00016292554,0.000036950645,0.000012369818,0.00058969005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887437,0.00017456913,0.00016710463,0.00038010272,0.0001448659,0.00025897517],"domain_scores_gemma":[0.99898225,0.00034190202,0.000052175845,0.0004296642,0.000033820572,0.00016020442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052473764,0.00013169397,0.00019233955,0.00005812045,0.00024073599,0.00018802882,0.00036101794,0.00007408177,0.0000035958258],"category_scores_gemma":[0.00002572578,0.000096906,0.000037915284,0.00023952815,0.00010572862,0.00019315303,0.00007229252,0.00007971651,0.000022752462],"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.000047650796,0.0000569866,0.00017045734,0.00009511512,0.000027129028,0.0000067957976,0.000460602,0.000121728976,0.0019683184,0.98735005,0.00007318177,0.009622004],"study_design_scores_gemma":[0.0007916898,0.00039475595,0.006781845,0.0000781813,0.000024777075,0.00010825806,0.00037056417,0.94722915,0.00019237478,0.039783042,0.003759444,0.00048593266],"about_ca_topic_score_codex":0.00004049778,"about_ca_topic_score_gemma":0.0000150853375,"teacher_disagreement_score":0.947567,"about_ca_system_score_codex":0.000021840257,"about_ca_system_score_gemma":0.000024529088,"threshold_uncertainty_score":0.3951712},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036454406,0.00005858775,0.9625501,0.00005792795,0.000017997083,0.00017251681,0.0000015774181,0.00038264933,0.0003042327],"genre_scores_gemma":[0.74952406,0.0000106092575,0.25034845,0.0000017742715,0.000006770079,0.000057976024,0.000003449863,0.000011973757,0.000034937748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990783,0.0000060449834,0.0003075396,0.00023486497,0.0001548025,0.00021844446],"domain_scores_gemma":[0.9994682,0.00008067372,0.000035650686,0.00034154867,0.00001492819,0.00005900326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037564142,0.00010960256,0.000209575,0.00016266569,0.00002501437,0.00004709428,0.00028892604,0.000055861154,6.274391e-7],"category_scores_gemma":[0.0000110056,0.00010071768,0.00003458997,0.00055882917,0.000014028084,0.00009540143,0.00012756126,0.00009372023,0.000014255591],"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":[1.8756705e-7,0.000060967803,0.0000021305939,0.00071867387,0.0000049693767,8.3596194e-7,0.00073278585,0.73794997,0.0102450615,0.2500909,0.0000037816442,0.00018972816],"study_design_scores_gemma":[0.00014992814,0.000008030682,0.0000071651175,0.00014709061,0.000002980835,0.000008520161,0.000016005943,0.990458,0.0005812837,0.008456725,0.000057172918,0.000107073705],"about_ca_topic_score_codex":0.000007357171,"about_ca_topic_score_gemma":5.7019935e-8,"teacher_disagreement_score":0.7130697,"about_ca_system_score_codex":0.000009570869,"about_ca_system_score_gemma":0.000008933811,"threshold_uncertainty_score":0.4107148},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038544484,0.09601256,0.25304872,0.03147835,0.0030729948,0.0025652598,0.0009460444,0.003579372,0.6089113],"genre_scores_gemma":[0.019269137,0.005851539,0.014709199,0.00081273576,0.00115872,0.0002501347,0.00046049803,0.0001673865,0.95732063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971168,0.000044466473,0.0007288269,0.0012298261,0.00047281143,0.00040728698],"domain_scores_gemma":[0.99815714,0.0002054444,0.00027332033,0.0009894457,0.000105263505,0.00026938863],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00032802607,0.0005848491,0.00070730527,0.0002625968,0.00042256317,0.0017374132,0.0009789079,0.00040060206,0.000052320465],"category_scores_gemma":[0.00002916959,0.0005621043,0.00017856502,0.00018219848,0.0005481136,0.0005304147,0.0010752867,0.0005545064,0.00033519324],"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.0000082285405,0.000031704036,0.000017615397,0.0002125499,0.00010278157,0.00012926696,0.0009932899,0.0000020651785,0.000031473937,0.8392689,0.09416858,0.065033495],"study_design_scores_gemma":[0.000076689255,0.00007684528,0.000030460029,0.0003528793,0.00007814887,0.00010193003,0.00005208686,0.008329825,0.00012686405,0.18518215,0.80496705,0.0006250837],"about_ca_topic_score_codex":0.0001791607,"about_ca_topic_score_gemma":0.00017468356,"teacher_disagreement_score":0.71079844,"about_ca_system_score_codex":0.000085405394,"about_ca_system_score_gemma":0.00057111145,"threshold_uncertainty_score":0.999683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82993436,0.0030386755,0.12749715,0.0046169404,0.00079727144,0.00040457764,0.00020652401,0.00035237402,0.033152107],"genre_scores_gemma":[0.997056,0.000088769804,0.0020582292,0.00005803107,0.0004449776,0.000007176054,0.000009720526,0.0000059356544,0.0002711435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99937123,0.0000194316,0.00013610531,0.00023504603,0.00013213375,0.00010602959],"domain_scores_gemma":[0.99963266,0.000090868394,0.000037597954,0.0001658916,0.000033024597,0.000039979015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006569667,0.00007749424,0.00010451842,0.00011052895,0.000050115905,0.00015034125,0.00023115115,0.000031064414,0.00003096577],"category_scores_gemma":[0.000006142391,0.00006738434,0.00004189277,0.00038651796,0.000030120085,0.00024632155,0.00014492875,0.000058864924,0.000038983508],"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.000012974953,0.000109269604,0.0014937167,0.00014947227,0.000092149894,0.00012237483,0.0042265314,0.0000049067185,0.019013986,0.6788472,0.0035191355,0.29240826],"study_design_scores_gemma":[0.0011762896,0.00074838626,0.69444233,0.0008379575,0.00024184614,0.00022832882,0.00055432395,0.039759606,0.13955238,0.039487857,0.08145768,0.0015130126],"about_ca_topic_score_codex":0.0001085238,"about_ca_topic_score_gemma":0.000026576514,"teacher_disagreement_score":0.69294864,"about_ca_system_score_codex":0.000013858115,"about_ca_system_score_gemma":0.000027839267,"threshold_uncertainty_score":0.27478534},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018142788,0.000011248743,0.9788173,0.00088131434,0.00026452492,0.0004981311,0.000054312033,0.00022504915,0.0011053391],"genre_scores_gemma":[0.98097146,0.000058570946,0.015962819,0.002153884,0.00017814442,0.00034429602,0.00008966149,0.00002018612,0.00022099528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983851,0.00015292491,0.00062622037,0.00016692241,0.0003867051,0.00028214807],"domain_scores_gemma":[0.9981295,0.0005693001,0.00023950094,0.00048559014,0.00034577327,0.00023035787],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010524224,0.0001448456,0.00019305023,0.0010132729,0.0002318094,0.00013570332,0.00082140625,0.00007053824,0.000025241918],"category_scores_gemma":[0.00020815317,0.000121215744,0.000062780964,0.0031919614,0.000024183733,0.00067563955,0.000108434106,0.0002733649,0.0009509335],"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.00011005929,0.00023590353,0.00004075114,0.000017628387,0.000079871475,0.000006492789,0.013643053,0.030229488,0.011201226,0.72864074,0.009938793,0.205856],"study_design_scores_gemma":[0.0018867712,0.0004781704,0.015735943,0.0004634768,0.00004504975,0.00011354189,0.002219073,0.11171739,0.07061059,0.71319497,0.08238203,0.001152989],"about_ca_topic_score_codex":0.0000059504127,"about_ca_topic_score_gemma":0.0000021584244,"teacher_disagreement_score":0.96285444,"about_ca_system_score_codex":0.00009606118,"about_ca_system_score_gemma":0.00012534372,"threshold_uncertainty_score":0.99982697},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033803843,0.000761166,0.9566806,0.004125516,0.00008855396,0.0006615848,0.000098936755,0.0006905845,0.0030892247],"genre_scores_gemma":[0.97545326,0.00044316336,0.021017946,0.00043338866,0.00022552295,0.00040312708,0.00020079248,0.00003642123,0.001786373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987007,0.000017157889,0.0002616866,0.00060476223,0.00018395964,0.00023175766],"domain_scores_gemma":[0.99892706,0.00016056866,0.00004485703,0.0006471802,0.000050096605,0.0001702273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019219135,0.00018892123,0.00016197808,0.000117269716,0.0003250297,0.0002573386,0.000383927,0.00010026355,0.0000127446265],"category_scores_gemma":[0.000011084116,0.00017231048,0.000053204974,0.0005496825,0.000065069275,0.0003002667,0.00024405913,0.00021320475,0.0002477322],"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":[8.96104e-7,0.000072877854,0.000005995298,0.00007811308,0.00001759898,0.0000031467605,0.00015975768,0.000027732905,0.0011207642,0.9741702,0.00034934445,0.023993548],"study_design_scores_gemma":[0.00013166838,0.000037268073,0.00015600187,0.000023340612,0.000020407386,0.00001883166,0.000018092358,0.9164252,0.0019849006,0.019351356,0.0616241,0.0002087914],"about_ca_topic_score_codex":0.000010301712,"about_ca_topic_score_gemma":0.000005540213,"teacher_disagreement_score":0.95481884,"about_ca_system_score_codex":0.000030057989,"about_ca_system_score_gemma":0.000053727676,"threshold_uncertainty_score":0.70266175},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20652011,0.023995193,0.4677131,0.188032,0.0015444318,0.0020027612,0.00006994143,0.024112202,0.08601026],"genre_scores_gemma":[0.985083,0.00033841038,0.008210224,0.000020343905,0.000007423963,0.000032176085,0.00002460432,0.0000071288346,0.0062767128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905235,0.000022302693,0.00016014668,0.0005177792,0.000113477996,0.0001339477],"domain_scores_gemma":[0.9984518,0.00005044983,0.0000481392,0.0013921717,0.000029777806,0.000027605955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015359519,0.00011905151,0.00012888123,0.00013268345,0.00015125841,0.0007362185,0.001067157,0.00015992706,0.000010444019],"category_scores_gemma":[0.00000946637,0.00007162007,0.00009556567,0.00067117414,0.00008071368,0.00004532125,0.0033871739,0.00035069603,0.00006374946],"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":[1.8197245e-7,0.000020012098,0.00014477846,0.000013469004,0.0004362636,0.000009299407,0.00041387838,0.0002594177,0.00007056579,0.8859264,0.0010041072,0.11170161],"study_design_scores_gemma":[0.000019689907,0.0000031366187,0.000751471,0.000008561179,0.00022176177,0.000004812039,0.0002469364,0.71404344,0.00037883624,0.27538309,0.0087746605,0.00016364107],"about_ca_topic_score_codex":0.000074794836,"about_ca_topic_score_gemma":0.00014862185,"teacher_disagreement_score":0.77856284,"about_ca_system_score_codex":0.00001726456,"about_ca_system_score_gemma":0.000031535907,"threshold_uncertainty_score":0.7099372},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81531376,0.000030645377,0.1708877,0.00096961146,0.00037554232,0.00043004047,0.0000049781493,0.00048114016,0.011506566],"genre_scores_gemma":[0.9970531,0.000002174634,0.002450118,0.00002295175,0.000009542417,0.000025373067,0.0000075437583,0.000003234915,0.00042595738],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992395,0.000022720327,0.00019433451,0.0002539616,0.00012021241,0.00016929605],"domain_scores_gemma":[0.99935937,0.00004332856,0.000033997992,0.0004974262,0.000028332683,0.00003754152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020530558,0.00005858911,0.00009250548,0.00008273617,0.000014530111,0.00002682827,0.0005230952,0.000027238882,0.000011618564],"category_scores_gemma":[0.000020651267,0.000055093824,0.00003747456,0.00073255925,0.000027150878,0.00015363807,0.0002538116,0.000051381787,0.00032034586],"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.000001548215,0.00072218705,0.03473511,0.00021402058,0.00001716317,0.000014294891,0.0037781158,0.00019020458,0.4096291,0.24408104,0.009135754,0.29748145],"study_design_scores_gemma":[0.0011260059,0.000074276824,0.21881445,0.00008097826,0.000007655025,0.0000059116373,0.00007987879,0.34515822,0.23749393,0.17979753,0.016625483,0.0007356776],"about_ca_topic_score_codex":0.000014783686,"about_ca_topic_score_gemma":0.000023592114,"teacher_disagreement_score":0.34496802,"about_ca_system_score_codex":0.000016376778,"about_ca_system_score_gemma":0.00004284513,"threshold_uncertainty_score":0.41175047},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038255224,0.00007133681,0.111348085,0.00004489578,0.00013768434,0.00029547117,0.00010212517,0.0004575679,0.8875046],"genre_scores_gemma":[0.0030869509,0.000022706678,0.0013178153,0.000038875914,0.000028509963,0.0000013649129,0.00007225422,0.000027088745,0.9954044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988275,0.000009973607,0.00011588491,0.0006053825,0.00025704337,0.00018419781],"domain_scores_gemma":[0.9988115,0.000035983656,0.00011871876,0.000818743,0.00009767627,0.0001173742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000046626566,0.00025780624,0.00019336694,0.00014134328,0.0001545991,0.00014497532,0.00085691345,0.00018891676,0.0000020263158],"category_scores_gemma":[9.78395e-7,0.00026936084,0.00009840291,0.00002201606,0.00013355166,0.00018270517,0.00043967928,0.00036371365,0.00014277884],"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.0000044012627,0.000003865873,5.238098e-7,0.00005231805,0.00004419713,0.00026693323,0.000041209656,0.000025419404,0.000046692992,0.99138105,0.006230381,0.0019030229],"study_design_scores_gemma":[0.00018154719,0.00003558887,0.000006540887,0.00027462616,0.00011035845,0.0000966296,0.000004862307,0.026600126,0.00019460068,0.00019315685,0.97186744,0.0004345242],"about_ca_topic_score_codex":0.000048621543,"about_ca_topic_score_gemma":0.0000023966813,"teacher_disagreement_score":0.9911879,"about_ca_system_score_codex":0.00015157637,"about_ca_system_score_gemma":0.00014272428,"threshold_uncertainty_score":0.99997586},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010063692,0.0002648338,0.05183175,0.00005743021,0.000214972,0.00021665629,0.000099495635,0.00058424077,0.94672054],"genre_scores_gemma":[0.00065425865,0.00006141516,0.000701307,0.00005565314,0.00007881462,0.0000011261808,0.000032722517,0.00002698736,0.9983877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886566,0.0000074667396,0.00012464174,0.00059043494,0.00021328134,0.00019848517],"domain_scores_gemma":[0.9987689,0.000039346145,0.000079566016,0.00091703207,0.00006745606,0.00012765387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000050313247,0.00025704163,0.00022952315,0.0001505249,0.00014682964,0.00016750037,0.0011564563,0.00020954397,0.0000037576813],"category_scores_gemma":[0.0000010694287,0.00029200528,0.00019189132,0.000012636516,0.000114116876,0.000110580884,0.00090367347,0.00032237242,0.00020326313],"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.0000015698085,0.0000038655558,6.042819e-8,0.000039016784,0.00005870772,0.00018696838,0.000032696407,9.300595e-7,0.00010985443,0.9535119,0.044482097,0.0015723354],"study_design_scores_gemma":[0.00011045116,0.000011501336,0.0000015882528,0.00007720072,0.00007810676,0.00002416934,0.0000054218513,0.0016637872,0.0004763395,0.00036620226,0.9968647,0.00032054743],"about_ca_topic_score_codex":0.000033615026,"about_ca_topic_score_gemma":0.0000010174766,"teacher_disagreement_score":0.9531457,"about_ca_system_score_codex":0.00009842558,"about_ca_system_score_gemma":0.00008748907,"threshold_uncertainty_score":0.9999532},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008076253,0.00023066887,0.040170852,0.00008090443,0.00023460781,0.00022736799,0.00014150256,0.000616769,0.95828927],"genre_scores_gemma":[0.00044161436,0.00006534094,0.0010616326,0.000050214217,0.000082106526,0.0000010056581,0.00003762192,0.000027766357,0.9982327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988151,0.000009636707,0.00013053916,0.0006158404,0.00022218346,0.0002066815],"domain_scores_gemma":[0.9986825,0.000044290347,0.00008417053,0.0009810812,0.000073822615,0.00013414929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00005724762,0.0002641369,0.00024020932,0.00015004443,0.00015141728,0.00017287636,0.0013363058,0.00021770786,0.0000036171689],"category_scores_gemma":[0.0000012691768,0.00030642972,0.00019856956,0.000014702499,0.00011621836,0.00010753895,0.0010079828,0.00035430052,0.00026192123],"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.0000014954448,0.0000037801547,6.3272246e-8,0.0000440241,0.000055718036,0.0002143577,0.000028172502,9.1032103e-7,0.00007987827,0.9452939,0.052405562,0.0018721246],"study_design_scores_gemma":[0.00009602644,0.0000126542545,0.0000015468125,0.000082629216,0.00008218954,0.000024620798,0.0000040101318,0.002685374,0.00038698956,0.00037241832,0.99592745,0.00032406597],"about_ca_topic_score_codex":0.00005024959,"about_ca_topic_score_gemma":0.0000012961835,"teacher_disagreement_score":0.9449215,"about_ca_system_score_codex":0.000108688255,"about_ca_system_score_gemma":0.000095641226,"threshold_uncertainty_score":0.9999388},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.3172856e-8,0.0009300882,0.0000673236,0.000096279284,0.00007844896,0.00011571148,0.99839187,0.000116829506,0.00020339516],"genre_scores_gemma":[2.693359e-7,0.0000147308365,0.0006233408,0.00039329153,0.00014520652,0.00020678865,0.99823743,0.000008139046,0.00037082928],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896884,0.000018457305,0.00015063916,0.0004690036,0.00018871797,0.00020436813],"domain_scores_gemma":[0.9982106,0.000055705965,0.00009848828,0.001467677,0.00008544573,0.00008205145],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00001617167,0.00017528111,0.00016970478,0.000059262366,0.00009047372,0.00033537197,0.0017513962,0.00017454181,0.11385862],"category_scores_gemma":[0.00011233416,0.00018249512,0.00010179534,0.00033583242,0.0000025851928,0.00010272815,0.0008879602,0.00023771958,0.023153506],"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":[4.2836735e-8,0.000022791934,8.845628e-9,0.000104369195,0.000006889336,0.000059945236,0.0000027786941,5.970306e-7,0.00001079665,0.0000072071375,0.9988796,0.0009049336],"study_design_scores_gemma":[0.00003973914,0.0000034507805,0.0000060291463,0.00041086233,0.000004801638,0.000039678696,6.700658e-7,0.00015266181,0.00024062429,0.000014099777,0.9988759,0.00021144791],"about_ca_topic_score_codex":0.000010689634,"about_ca_topic_score_gemma":0.000014703808,"teacher_disagreement_score":0.09070511,"about_ca_system_score_codex":0.000025050398,"about_ca_system_score_gemma":0.00020405871,"threshold_uncertainty_score":0.9776071},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.3172856e-8,0.0009300882,0.0000673236,0.000096279284,0.00007844896,0.00011571148,0.99839187,0.000116829506,0.00020339516],"genre_scores_gemma":[2.693359e-7,0.0000147308365,0.0006233408,0.00039329153,0.00014520652,0.00020678865,0.99823743,0.000008139046,0.00037082928],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896884,0.000018457305,0.00015063916,0.0004690036,0.00018871797,0.00020436813],"domain_scores_gemma":[0.9982106,0.000055705965,0.00009848828,0.001467677,0.00008544573,0.00008205145],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00001617167,0.00017528111,0.00016970478,0.000059262366,0.00009047372,0.00033537197,0.0017513962,0.00017454181,0.11385862],"category_scores_gemma":[0.00011233416,0.00018249512,0.00010179534,0.00033583242,0.0000025851928,0.00010272815,0.0008879602,0.00023771958,0.023153506],"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":[4.2836735e-8,0.000022791934,8.845628e-9,0.000104369195,0.000006889336,0.000059945236,0.0000027786941,5.970306e-7,0.00001079665,0.0000072071375,0.9988796,0.0009049336],"study_design_scores_gemma":[0.00003973914,0.0000034507805,0.0000060291463,0.00041086233,0.000004801638,0.000039678696,6.700658e-7,0.00015266181,0.00024062429,0.000014099777,0.9988759,0.00021144791],"about_ca_topic_score_codex":0.000010689634,"about_ca_topic_score_gemma":0.000014703808,"teacher_disagreement_score":0.09070511,"about_ca_system_score_codex":0.000025050398,"about_ca_system_score_gemma":0.00020405871,"threshold_uncertainty_score":0.9776071},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0145933535,0.000079548816,0.9543466,0.007458529,0.00035297626,0.00064923905,0.00010810799,0.00034420626,0.02206746],"genre_scores_gemma":[0.9597682,0.000008806099,0.038533602,0.00023826065,0.00017890356,0.000076519944,0.000037229038,0.00001580071,0.0011427318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991322,0.000020459063,0.00018337193,0.00027317635,0.00022176224,0.0001690409],"domain_scores_gemma":[0.9985987,0.000425678,0.000040625702,0.0008399609,0.000054520195,0.000040536663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051528215,0.00010261793,0.00011792251,0.000047483947,0.00012557505,0.00016368559,0.0010532782,0.000056480647,0.00004124539],"category_scores_gemma":[0.000043894393,0.000067361085,0.00012747102,0.00025924764,0.000061240025,0.000099386445,0.00020146856,0.00013457479,0.00008432253],"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.0000042259917,0.00012728499,0.0000033245951,0.00008149091,0.000029338089,0.000003406613,0.0004829042,0.000052859177,0.005334529,0.9712044,0.0067978455,0.015878376],"study_design_scores_gemma":[0.000104513376,0.00005547259,0.00004168905,0.000035100606,0.000012042327,0.0000029368064,0.00003247408,0.9028662,0.02233318,0.024879074,0.049541965,0.000095383904],"about_ca_topic_score_codex":0.000006412928,"about_ca_topic_score_gemma":0.0000038591647,"teacher_disagreement_score":0.94632536,"about_ca_system_score_codex":0.000019708215,"about_ca_system_score_gemma":0.00009337339,"threshold_uncertainty_score":0.27469054},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033989243,0.0015250169,0.9790546,0.001284559,0.0013867402,0.00032011297,0.0000062689573,0.0005715141,0.015817242],"genre_scores_gemma":[0.2614424,0.000281718,0.6945821,0.004536842,0.0026150965,0.00008549155,0.000040926923,0.00025237034,0.036163032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963502,0.000011529408,0.00044288512,0.0017265707,0.0008534273,0.00061538565],"domain_scores_gemma":[0.99744713,0.00023400884,0.00014369357,0.0018635282,0.00011862729,0.00019298035],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004609414,0.00048854284,0.00039874087,0.0008534523,0.0002462255,0.00115938,0.0038432197,0.00027393142,0.000042426178],"category_scores_gemma":[0.000020850024,0.00044800885,0.00017753166,0.00090097665,0.0005497344,0.00037385724,0.0021034668,0.00085380295,0.00089430617],"study_design_candidate":"design_other","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":[5.9838806e-7,0.000019850997,0.000004783093,0.000036532405,0.0000094813495,0.00007200785,0.0005626788,0.005384482,0.00021314604,0.11576543,0.00012348691,0.8778075],"study_design_scores_gemma":[0.00009626833,0.00006088284,0.000014014239,0.00026962828,0.00001152777,0.00020248916,9.370295e-8,0.61463207,0.0007904993,0.29650697,0.086778566,0.0006369533],"about_ca_topic_score_codex":0.000023225895,"about_ca_topic_score_gemma":0.000030403726,"teacher_disagreement_score":0.87717056,"about_ca_system_score_codex":0.00022441671,"about_ca_system_score_gemma":0.00039712258,"threshold_uncertainty_score":0.9998836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019230576,0.0006388197,0.97300565,0.00062759715,0.00030571056,0.00016023217,0.0000144436235,0.000430028,0.005586959],"genre_scores_gemma":[0.9493232,0.000034578625,0.049754415,0.00004320396,0.00066082244,0.000016458092,0.000025798383,0.00001502461,0.00012650204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992492,0.000017173126,0.0001679646,0.00027962943,0.00013407148,0.0001519396],"domain_scores_gemma":[0.99936825,0.000039661456,0.000041797666,0.00046715818,0.000033596363,0.00004954175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073198185,0.00009566753,0.00012544567,0.000057198493,0.000052105956,0.000083406565,0.00036982013,0.000023158116,0.0000131880515],"category_scores_gemma":[0.0000023298662,0.00009048309,0.00008098649,0.0004872967,0.00006578019,0.00023617333,0.00011826526,0.00010122798,0.00007960742],"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.0000020857046,0.00016543915,0.000013889369,0.00006906612,0.00007145255,0.00000433262,0.00043444187,0.0034970702,0.025740003,0.6544857,0.00041605087,0.31510046],"study_design_scores_gemma":[0.000060495942,0.000021417049,0.00008132007,0.00001992186,0.000010120667,0.000004362037,0.000011595671,0.96041566,0.0036056014,0.0070306575,0.028636657,0.00010217116],"about_ca_topic_score_codex":0.0000070372917,"about_ca_topic_score_gemma":3.5353077e-7,"teacher_disagreement_score":0.9569186,"about_ca_system_score_codex":0.000018552548,"about_ca_system_score_gemma":0.000037388203,"threshold_uncertainty_score":0.36897933},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008050281,0.000022597507,0.97984135,0.017749019,0.000010218099,0.0008550025,0.00026759383,0.00010636033,0.00034281585],"genre_scores_gemma":[0.49731565,0.0000014285022,0.50161386,0.00035563228,0.000038962793,0.00012073978,0.000018218225,0.000015459022,0.00052003213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896854,0.000013277084,0.00034097416,0.00022972605,0.000214095,0.00023336183],"domain_scores_gemma":[0.9984821,0.00032465276,0.0001444777,0.000706475,0.00013803858,0.00020427405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011398426,0.00014013577,0.00025250943,0.00003343959,0.0002010526,0.00007869212,0.00086979585,0.000046487636,0.000007040983],"category_scores_gemma":[0.00040382778,0.00009031249,0.0001220196,0.000454664,0.000050406787,0.0001017574,0.00023290605,0.0000867257,0.000023114053],"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.000005688569,0.000045718836,0.0000032866121,0.00007092727,0.000027097267,3.3909134e-7,0.0026926394,0.004335424,0.0020154654,0.9883347,0.0022675006,0.00020120184],"study_design_scores_gemma":[0.0003172017,0.00004330453,0.000006139467,0.00006681779,0.000054880995,0.0000066816574,0.00007967877,0.91490656,0.0055212774,0.07805355,0.00082122214,0.00012268522],"about_ca_topic_score_codex":0.0000018056877,"about_ca_topic_score_gemma":0.0000037042169,"teacher_disagreement_score":0.91057116,"about_ca_system_score_codex":0.000022957387,"about_ca_system_score_gemma":0.00019513437,"threshold_uncertainty_score":0.36828363},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039740073,0.00083753123,0.99171567,0.0011830113,0.00004105536,0.00033275096,0.000046731635,0.00037450355,0.005071367],"genre_scores_gemma":[0.51365715,0.0007394135,0.47800905,0.00047955877,0.0004420862,0.00199794,0.00014679242,0.00006793359,0.0044600875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990813,0.000007602014,0.00022808979,0.00035245824,0.00015651438,0.00017403858],"domain_scores_gemma":[0.9990633,0.00021029478,0.000039377654,0.0005662199,0.000028339391,0.00009247392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013141379,0.0001361798,0.00013326359,0.00007684088,0.00019919965,0.00053254043,0.00039304726,0.000059593058,0.000032484808],"category_scores_gemma":[0.000007078894,0.000115508825,0.00006567663,0.00040220693,0.000057768335,0.00020566494,0.00018295857,0.000116893636,0.00012082215],"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":[7.0369566e-8,0.000037198493,0.0000026448447,0.000081122,0.000018933464,0.0000018089219,0.00046523593,0.000022076114,0.0002389864,0.9513278,0.0006510182,0.047153108],"study_design_scores_gemma":[0.000056618894,0.000009961635,0.000042752057,0.00003356759,0.000020298025,0.00001608408,0.000052835898,0.7534841,0.00041213192,0.15117191,0.094523534,0.00017624332],"about_ca_topic_score_codex":0.000009579562,"about_ca_topic_score_gemma":0.0000027205408,"teacher_disagreement_score":0.8001559,"about_ca_system_score_codex":0.000010981024,"about_ca_system_score_gemma":0.000029231378,"threshold_uncertainty_score":0.51352996},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006667297,0.0003279741,0.96747386,0.028245827,0.0002361652,0.0019432551,0.00007164152,0.0010243464,0.000010169375],"genre_scores_gemma":[0.029465798,0.000006434208,0.96864355,0.00028437743,0.00012211193,0.0009920154,0.00006719709,0.000031539836,0.0003870042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998666,0.00001833045,0.00027605688,0.00055659574,0.00010651259,0.00037652065],"domain_scores_gemma":[0.9990452,0.0001389208,0.00005910024,0.00061761064,0.00008763751,0.00005155451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022762128,0.00016804467,0.00022714456,0.00015286331,0.00034641434,0.00022904215,0.0009168389,0.00017628688,0.00000879766],"category_scores_gemma":[0.000039730945,0.00012837979,0.0001209348,0.0005760028,0.000110423025,0.000121022946,0.00029320858,0.00015618435,0.000032266424],"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.000012633966,0.00008879654,0.000001271358,0.00006683558,0.00008119305,0.0000018126494,0.00014269318,0.004667743,0.030975921,0.27867442,0.0046172873,0.68066937],"study_design_scores_gemma":[0.00025058902,0.000100215715,0.0000018495426,0.000015027919,0.000023674003,0.000021032047,0.000005367447,0.8911569,0.0026906596,0.012513455,0.09307692,0.00014430427],"about_ca_topic_score_codex":0.000018153896,"about_ca_topic_score_gemma":0.000020107438,"teacher_disagreement_score":0.88648915,"about_ca_system_score_codex":0.000102381884,"about_ca_system_score_gemma":0.00008742963,"threshold_uncertainty_score":0.52351755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023085803,0.0004005802,0.98779297,0.0017162473,0.000107077234,0.00011259807,0.000001923909,0.0009903817,0.0065696132],"genre_scores_gemma":[0.6838574,0.000009227898,0.30807176,0.00019122276,0.00007979712,0.00010557387,0.0000055648484,0.000007701052,0.007671778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995527,0.0000030416022,0.00007584539,0.00020811909,0.000057373705,0.00010289462],"domain_scores_gemma":[0.99960953,0.000068002424,0.0000065549334,0.00027206595,0.000015805814,0.000028043976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009664655,0.00004387368,0.000043221455,0.000033534125,0.00006514638,0.00021031762,0.00026702735,0.000016490416,0.00002070717],"category_scores_gemma":[0.00000806635,0.000036350393,0.00005063067,0.00016469594,0.000010415181,0.00017741388,0.000079584504,0.000026609858,0.00012574544],"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":[1.227861e-7,0.000007309261,0.000010715353,0.000021898266,0.0000061146097,0.0000012594958,0.000056401062,0.000003116417,0.0051882453,0.94044834,0.012290596,0.041965872],"study_design_scores_gemma":[0.000026866686,0.000006599289,0.000025694057,0.000008947095,0.0000023204905,0.0000045327743,0.000005842284,0.42305607,0.025332646,0.0092794085,0.54219484,0.00005621832],"about_ca_topic_score_codex":0.000004915441,"about_ca_topic_score_gemma":0.0000026926607,"teacher_disagreement_score":0.9311689,"about_ca_system_score_codex":0.000009143154,"about_ca_system_score_gemma":0.000026183852,"threshold_uncertainty_score":0.20280978},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007590941,0.00029134686,0.43738228,0.00218451,0.5545447,0.0010928194,0.003882458,0.0005349523,0.000079382495],"genre_scores_gemma":[0.0020364108,0.000050096158,0.00030727076,0.000055187513,0.9918852,0.0010565574,0.0043034726,0.00007202017,0.0002338281],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99544096,0.00019269472,0.0010907211,0.00148034,0.0011022998,0.00069300615],"domain_scores_gemma":[0.99543095,0.0012444755,0.00028121902,0.0020408628,0.00044954626,0.00055295526],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008489519,0.0006502467,0.00068932725,0.00018041067,0.00070069154,0.002152621,0.002718416,0.0007998225,0.000024828754],"category_scores_gemma":[0.0006452697,0.0005057272,0.00020313555,0.0014998654,0.0002518352,0.00022436366,0.0013698214,0.0011649543,0.0020462405],"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.000012115515,0.00009898515,2.377648e-7,0.00008889332,0.00006130052,0.000004509248,0.00022492633,0.000092961825,0.00015161898,0.03537799,0.95902544,0.0048610084],"study_design_scores_gemma":[0.000050818475,0.0000638179,0.0000013152817,0.000075701544,0.00006864705,0.0000027345732,0.0001318346,0.033377614,0.00017749668,0.0041242265,0.96138406,0.0005417565],"about_ca_topic_score_codex":0.00023659224,"about_ca_topic_score_gemma":0.00007289646,"teacher_disagreement_score":0.4373405,"about_ca_system_score_codex":0.00023383743,"about_ca_system_score_gemma":0.0006518974,"threshold_uncertainty_score":0.9997394},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002618208,0.99212104,0.0054601836,0.00019881848,0.0007255783,0.00059086067,0.000012313257,0.0005011982,0.00012818066],"genre_scores_gemma":[0.004874728,0.99112624,0.0026317437,0.000026874488,0.00062895904,0.0003977669,0.000046389785,0.000044304903,0.000222973],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979936,0.00011252279,0.00053193717,0.0008933831,0.00021481841,0.00025376654],"domain_scores_gemma":[0.9988728,0.000035230416,0.000118094606,0.00085125596,0.000024415416,0.000098208715],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004215034,0.00024844357,0.0005094392,0.0003365739,0.0000591542,0.0002633112,0.00038479693,0.00020106512,0.0000059987865],"category_scores_gemma":[0.000036153062,0.00023532633,0.00015046004,0.0009724661,0.00004059211,0.00026260182,0.00032562186,0.00030187296,0.0010751489],"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.0000013794618,0.00016602749,0.000008585761,0.004143801,0.000063788,0.00007100972,0.00036399934,0.000001586547,0.000012861082,0.06659363,0.001182482,0.9273909],"study_design_scores_gemma":[0.000033020333,0.000015320062,0.000105898755,0.0007396736,0.00021042739,0.000022944765,0.000006034072,0.004206483,0.0000038395738,0.0025703763,0.9917856,0.00030038087],"about_ca_topic_score_codex":0.000036463105,"about_ca_topic_score_gemma":0.000019524628,"teacher_disagreement_score":0.99060315,"about_ca_system_score_codex":0.00013132828,"about_ca_system_score_gemma":0.00026322555,"threshold_uncertainty_score":0.99970263},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010680945,0.022652384,0.9432838,0.009353191,0.003665,0.0014253367,0.00078051037,0.0003697867,0.0174019],"genre_scores_gemma":[0.43618497,0.012732011,0.4582808,0.0012855012,0.0019387493,0.0011849357,0.002288575,0.00021488583,0.08588956],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99617183,0.00021789497,0.001150353,0.0009868249,0.0011564789,0.00031659094],"domain_scores_gemma":[0.9972189,0.00019442977,0.0006629281,0.0014337146,0.00038100095,0.0001090192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019042988,0.00043506478,0.000975592,0.00017628826,0.0000913127,0.00014608708,0.0021732838,0.00022554059,0.00011016057],"category_scores_gemma":[0.00005457357,0.0003259515,0.00028970154,0.00073147396,0.00036395254,0.00029537393,0.0012431653,0.0005758191,0.000029618723],"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.000005087037,0.0011430322,0.000041775038,0.057087578,0.0004284109,0.00001113648,0.0016087552,0.0053442246,0.007488395,0.07851424,0.8370658,0.01126156],"study_design_scores_gemma":[0.00042578392,0.00034849474,0.00017638422,0.01437565,0.0010997815,0.000033369688,0.00049623265,0.23708653,0.3007244,0.0022213839,0.44098008,0.0020319484],"about_ca_topic_score_codex":0.00039311155,"about_ca_topic_score_gemma":0.00007757091,"teacher_disagreement_score":0.485003,"about_ca_system_score_codex":0.00008167554,"about_ca_system_score_gemma":0.00081876887,"threshold_uncertainty_score":0.99991924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074769566,0.00045275624,0.9873263,0.0013493624,0.00025759623,0.000058966303,0.00000253272,0.0003662105,0.0027092888],"genre_scores_gemma":[0.98781586,0.000026902819,0.008663063,0.00022309583,0.000104285056,0.000059988382,0.000006374596,0.000007609931,0.0030927986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927205,0.000020862406,0.00012740768,0.0003189615,0.000120161225,0.00014053615],"domain_scores_gemma":[0.9995394,0.000056033172,0.0000139286,0.00030196455,0.000022496488,0.00006620777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010700578,0.00008332816,0.00008066986,0.000039684008,0.00009636822,0.00037240537,0.00020545737,0.000032089065,0.00015659173],"category_scores_gemma":[0.00000370267,0.000066841145,0.000040355288,0.00028676604,0.000016406053,0.000111863614,0.000113031514,0.00004549953,0.00017473962],"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":[7.497295e-7,0.000026079877,0.000007824766,0.000009013117,0.000015144108,0.0000050474273,0.00019678747,0.0002745299,0.0014894794,0.9763747,0.0020949985,0.019505657],"study_design_scores_gemma":[0.00022801582,0.000005144816,0.00017297384,0.0000062319623,0.000007169272,0.000025421856,0.0000045740067,0.92009807,0.0007533429,0.0020775078,0.076524556,0.00009699895],"about_ca_topic_score_codex":0.00005163858,"about_ca_topic_score_gemma":0.000008986198,"teacher_disagreement_score":0.98033893,"about_ca_system_score_codex":0.000024583433,"about_ca_system_score_gemma":0.000076803204,"threshold_uncertainty_score":0.35911137},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39625114,0.00007959428,0.58680695,0.016583417,0.000099221084,0.0000484281,8.501096e-7,0.00007447514,0.00005592764],"genre_scores_gemma":[0.9857489,0.0000033736665,0.013239285,0.0006837682,0.0002511795,0.000007211519,5.0732655e-7,0.000008373727,0.000057407855],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904877,0.000052872,0.0001238219,0.00019155229,0.00033071925,0.00025227363],"domain_scores_gemma":[0.9994515,0.000103548526,0.000038660284,0.0003042132,0.000020184469,0.000081872204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013577878,0.000106374515,0.000096674165,0.000039981758,0.00025404783,0.0007498791,0.0007518294,0.000010244108,0.000008904125],"category_scores_gemma":[0.0000026064395,0.000055513996,0.000078872865,0.0003750599,0.00012101342,0.00021668721,0.00008126974,0.00030839106,0.00015096371],"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.000007147311,0.00006934706,0.000008747848,0.000014649375,0.00007820679,0.00032768038,0.00091622624,0.020500377,0.86780214,0.072019264,0.002467985,0.035788212],"study_design_scores_gemma":[0.00087261474,0.0006273346,0.0152529,0.0006160134,0.00021890776,0.0052717393,0.00031104428,0.88999134,0.041391518,0.0061177285,0.038130056,0.0011987991],"about_ca_topic_score_codex":0.0000059418544,"about_ca_topic_score_gemma":3.17147e-7,"teacher_disagreement_score":0.869491,"about_ca_system_score_codex":0.000039522733,"about_ca_system_score_gemma":0.000054531087,"threshold_uncertainty_score":0.72311014},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049087495,0.0039836843,0.94463706,0.0006863724,0.0012629009,0.000074965945,0.00006267039,0.00006685586,0.00013799615],"genre_scores_gemma":[0.9931611,0.0003174292,0.0062722685,0.000009210995,0.00014820078,0.0000045896763,0.00002832631,0.0000061518426,0.00005272903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858487,0.000031295243,0.0006454707,0.00014719879,0.00047837346,0.000112783215],"domain_scores_gemma":[0.99916035,0.000040184634,0.00025054082,0.00014173928,0.0003123347,0.00009485311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033519583,0.00010020585,0.00018253949,0.00016120732,0.00003572101,0.00016892224,0.0005880097,0.00004722576,0.000007010032],"category_scores_gemma":[0.0000120162495,0.00008395895,0.00012721366,0.00015655892,0.000017375642,0.00031810527,0.000098314114,0.000101874255,0.0000065876943],"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.000021007309,0.00029692208,0.0006593674,0.00026786045,0.00086850696,0.00015433726,0.0012661854,0.22409192,0.039680928,0.7181846,0.012454471,0.0020539204],"study_design_scores_gemma":[0.00020216838,0.000022943297,0.000057833007,0.00011405079,0.000023494626,0.00010100666,0.000048675578,0.98727953,0.0006954165,0.0014922533,0.009879399,0.0000832107],"about_ca_topic_score_codex":0.000019107225,"about_ca_topic_score_gemma":6.218502e-7,"teacher_disagreement_score":0.9440736,"about_ca_system_score_codex":0.00005087802,"about_ca_system_score_gemma":0.00011878349,"threshold_uncertainty_score":0.34237465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24106956,0.00008582199,0.75322604,0.0004087122,0.00039275078,0.0005593374,0.000018733705,0.00041243606,0.0038265903],"genre_scores_gemma":[0.9992832,0.000005842858,0.00046932683,0.000035194036,0.00003334114,0.0000046584964,0.00007090961,0.000008971054,0.00008856324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881387,0.0000767392,0.00023212271,0.00057671254,0.00011167209,0.00018890659],"domain_scores_gemma":[0.9991905,0.000038839782,0.00017953907,0.00037938703,0.00014430936,0.00006742925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001413381,0.00020344577,0.00019556234,0.00047692715,0.0000860148,0.00043197328,0.0005952015,0.000174693,0.0000010097525],"category_scores_gemma":[0.000011610749,0.00023059706,0.00008600227,0.0007740835,0.000044499033,0.00055585004,0.0007228506,0.00059012463,0.000117987554],"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.000008151999,0.00005067293,0.000088863366,0.00014497091,0.000011140487,0.00004975872,0.0009531005,0.6742902,0.0000040066247,0.32123607,0.000040274448,0.0031227937],"study_design_scores_gemma":[0.00018467999,0.000025074267,0.0009710405,0.00016758026,0.000014504394,0.000004753507,0.0003487584,0.9729771,0.0000044571466,0.025035517,0.000047494133,0.00021905263],"about_ca_topic_score_codex":0.0005474415,"about_ca_topic_score_gemma":0.0000434809,"teacher_disagreement_score":0.75821364,"about_ca_system_score_codex":0.0007228671,"about_ca_system_score_gemma":0.00020552635,"threshold_uncertainty_score":0.9403475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058324065,0.00005972453,0.99465674,0.0004324784,0.00054731424,0.00029972903,0.000043581338,0.0009878236,0.0023893928],"genre_scores_gemma":[0.972105,0.000023936891,0.026119709,0.00039886194,0.000035923313,0.00039046802,0.000016068534,0.000010027944,0.000900001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992887,0.000021711478,0.0002555337,0.0001434526,0.00013938097,0.00015122596],"domain_scores_gemma":[0.999249,0.0002440372,0.000037414306,0.0003634523,0.000056561083,0.000049555678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038171778,0.00010210764,0.00007905097,0.00022834528,0.00026652755,0.0003403854,0.00029795157,0.00005291652,0.000047236434],"category_scores_gemma":[0.0000061974706,0.000095669995,0.00012443819,0.00033402225,0.00003290062,0.0018741369,0.0000020379125,0.00011520376,0.0004621825],"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.000008226155,0.000025059795,1.3449055e-7,0.000084888685,0.00003209907,3.2091344e-7,0.0010554441,0.0019926983,0.00045874916,0.6510687,0.00095392246,0.34431976],"study_design_scores_gemma":[0.00025824714,0.000061112376,0.000006604618,0.000077173754,0.000026487174,0.000021633325,0.00017538098,0.5756243,0.0975194,0.03690206,0.28907195,0.00025570163],"about_ca_topic_score_codex":0.0000018345056,"about_ca_topic_score_gemma":8.2891415e-7,"teacher_disagreement_score":0.97152174,"about_ca_system_score_codex":0.00004548959,"about_ca_system_score_gemma":0.00006162356,"threshold_uncertainty_score":0.5940575},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015630243,0.015394359,0.9617386,0.0061102626,0.0005832453,0.00015036862,2.7474326e-7,0.00006139653,0.00033126833],"genre_scores_gemma":[0.9982926,0.00023069516,0.00011175419,0.00007294817,0.00007666293,0.000010088013,2.1700212e-7,0.000009640768,0.0011953625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992113,0.00002474387,0.00022137964,0.00009335953,0.00018713681,0.00026204405],"domain_scores_gemma":[0.99939704,0.000120481105,0.00007879696,0.00022879473,0.00014311018,0.00003178367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006934994,0.00007623548,0.000106436855,0.000067251814,0.00010412618,0.00017450805,0.00086957536,0.000027543238,0.0000027740887],"category_scores_gemma":[0.000027296546,0.000043705244,0.000120694116,0.0003271873,0.000028418415,0.00022763474,0.00006282814,0.00032255103,0.0000150317865],"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.0000036060997,0.000029181156,9.630512e-7,0.000015196156,0.00003696181,0.0000013471189,0.00041044666,0.000018953535,0.001915148,0.9909502,0.001998045,0.0046199393],"study_design_scores_gemma":[0.00017247151,0.00021691882,0.0000037708453,0.000042139145,0.000029053012,0.0001628575,0.00003600109,0.04730082,0.012658135,0.7700185,0.16927627,0.00008307466],"about_ca_topic_score_codex":0.0000011247424,"about_ca_topic_score_gemma":3.3408674e-7,"teacher_disagreement_score":0.9826624,"about_ca_system_score_codex":0.00011533464,"about_ca_system_score_gemma":0.00041089006,"threshold_uncertainty_score":0.17822482},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032243101,0.00026325727,0.03656754,0.00011326076,0.00027296378,0.0002491738,0.00014732064,0.000628687,0.96175456],"genre_scores_gemma":[0.0003306138,0.00005781077,0.0007236648,0.000071058734,0.00007815438,9.3121406e-7,0.000036192603,0.000026234491,0.99867535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888235,0.000008791962,0.00012846004,0.0005752768,0.00021061086,0.00019451209],"domain_scores_gemma":[0.99866074,0.00004559748,0.000081614075,0.0009879265,0.000072635026,0.0001515007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000048035865,0.00024593718,0.00022375469,0.00015548935,0.0002228496,0.00013131413,0.001315947,0.00021488448,0.000004621494],"category_scores_gemma":[0.0000014597164,0.0002829341,0.0002075627,0.000014522032,0.000120903045,0.000094629475,0.0017257404,0.00036810598,0.00029172888],"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":[9.870614e-7,0.0000035719445,2.614006e-8,0.000025900086,0.000044790937,0.0002439793,0.000027822985,6.929978e-7,0.00007367832,0.9357481,0.062358126,0.0014723366],"study_design_scores_gemma":[0.000098963006,0.000012961995,7.1731085e-7,0.00007940777,0.000081043814,0.000027538896,0.000004044862,0.0018566714,0.00019129888,0.00037674644,0.9969725,0.00029810125],"about_ca_topic_score_codex":0.00003317017,"about_ca_topic_score_gemma":7.3756166e-7,"teacher_disagreement_score":0.93537134,"about_ca_system_score_codex":0.000115063056,"about_ca_system_score_gemma":0.00011624549,"threshold_uncertainty_score":0.9999623},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020112813,0.003116981,0.95980346,0.007360798,0.0015768128,0.00031140953,0.0000059229374,0.0011454839,0.006566328],"genre_scores_gemma":[0.97133577,0.000025260653,0.027713561,0.00016148952,0.000104357714,0.000032853357,0.000009034334,0.000010336592,0.0006073392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991221,0.00001709743,0.00015352706,0.0003412626,0.00014520848,0.00022081459],"domain_scores_gemma":[0.99958926,0.00004766436,0.000014486295,0.0002853475,0.000019041392,0.000044217883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010408309,0.00009240201,0.00008895296,0.00012491363,0.00005110535,0.00017718978,0.00046474836,0.000034589946,0.000015834852],"category_scores_gemma":[0.000007570406,0.00008645824,0.000052288662,0.00060945615,0.000019411105,0.00031724115,0.0001674882,0.00016454264,0.00022405905],"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":[8.5880987e-7,0.000079380916,0.00012744851,0.000067525405,0.000032549553,0.0002616453,0.0013249055,0.000017952636,0.01041192,0.48968348,0.005752211,0.49224013],"study_design_scores_gemma":[0.00013651676,0.000013680164,0.0020481122,0.00007755368,0.0000055583055,0.00006591117,0.000020428459,0.9378384,0.008515142,0.015702067,0.035279844,0.0002968035],"about_ca_topic_score_codex":0.000045584868,"about_ca_topic_score_gemma":0.00001136512,"teacher_disagreement_score":0.95122296,"about_ca_system_score_codex":0.00003774124,"about_ca_system_score_gemma":0.00005199457,"threshold_uncertainty_score":0.35256648},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29920006,0.010763792,0.64272094,0.014012519,0.002979189,0.00067423354,0.000026036656,0.004366833,0.02525642],"genre_scores_gemma":[0.9968547,0.000044369914,0.0022473733,0.0003320363,0.00018693163,0.00002351496,0.0000053419863,0.000010825837,0.0002948938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989897,0.000016214442,0.00014253847,0.0004091052,0.0002189998,0.00022346799],"domain_scores_gemma":[0.9990364,0.000059225047,0.000018472701,0.0007776596,0.00002486435,0.000083391365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001339376,0.00011723669,0.00009527025,0.000081619364,0.00010281488,0.00045701838,0.0011283297,0.00006791366,0.00004180827],"category_scores_gemma":[0.000008572759,0.000106502695,0.00009499234,0.0004515928,0.000033166893,0.00041669275,0.00022816032,0.00024499325,0.0005844672],"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.000001084489,0.000109131586,0.000031320444,0.000074596835,0.000036813075,0.00010164272,0.0036271943,0.00003626677,0.02148501,0.8660696,0.08155031,0.026877023],"study_design_scores_gemma":[0.00011686891,0.000027021782,0.0002648064,0.000053143995,0.000013346485,0.00003342072,0.000008889496,0.17300442,0.045681756,0.2343235,0.54613554,0.0003372832],"about_ca_topic_score_codex":0.000014220441,"about_ca_topic_score_gemma":0.0000038023888,"teacher_disagreement_score":0.69765466,"about_ca_system_score_codex":0.00002463906,"about_ca_system_score_gemma":0.00006825221,"threshold_uncertainty_score":0.7512338},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027677247,0.10757674,0.85049546,0.0059735216,0.00041074774,0.005001954,0.00042859593,0.00017511898,0.0022606181],"genre_scores_gemma":[0.9271021,0.06838115,0.0023115997,0.0010961456,0.00026680282,0.0006311031,0.00010314263,0.000024938177,0.0000830116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606705,0.00053101627,0.0011785311,0.0010769778,0.0007960927,0.00035032572],"domain_scores_gemma":[0.9946438,0.0004243739,0.0011473219,0.0031720637,0.00047163267,0.00014081744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040724827,0.0005825585,0.0021122447,0.000058230777,0.00011695086,0.000052820575,0.00344967,0.00007725253,0.000012567786],"category_scores_gemma":[0.00031115155,0.00040589742,0.0015356615,0.0010489866,0.00024755605,0.0001747483,0.0029695586,0.0007484888,0.000059567246],"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.000007665537,0.0026884065,0.000063844294,0.07205153,0.00039324834,0.0000017625242,0.00030978583,0.00037277184,0.33502096,0.37998056,0.007245215,0.20186424],"study_design_scores_gemma":[0.00026933383,0.00013967346,0.00073848176,0.056710165,0.001339129,0.0000031066438,0.0000017180558,0.72802925,0.12159206,0.08056359,0.0095817745,0.001031704],"about_ca_topic_score_codex":0.00006082453,"about_ca_topic_score_gemma":0.000007971947,"teacher_disagreement_score":0.89942485,"about_ca_system_score_codex":0.00007950972,"about_ca_system_score_gemma":0.00027471743,"threshold_uncertainty_score":0.9998393},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8131422,0.00041462173,0.16228472,0.00061253214,0.00069932075,0.00035243863,0.000015605065,0.0007086699,0.021769902],"genre_scores_gemma":[0.997265,0.00015601348,0.0011263471,0.00004662802,0.000040310326,0.000002136995,0.000008816674,0.000010419915,0.001344323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858296,0.000039270424,0.00014890444,0.0009229714,0.00006121598,0.00024466944],"domain_scores_gemma":[0.9988764,0.000055568154,0.00007180658,0.00088622415,0.000029052755,0.00008093962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017058295,0.00018876568,0.00018551649,0.00027093416,0.00008099108,0.00018694693,0.0015671243,0.00016407829,0.000021275977],"category_scores_gemma":[0.0000071109316,0.00021549428,0.00012446205,0.0008449701,0.000061315295,0.00016490814,0.0025325543,0.00054066384,0.00031683285],"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.0000013940221,0.0000485113,0.0006485251,0.00010232511,0.000030183795,0.00059150794,0.00036595803,0.042669542,0.0007162009,0.9525926,0.00018043304,0.0020527856],"study_design_scores_gemma":[0.000104570594,0.000009203396,0.0008296464,0.00015469339,0.000025830514,0.0000060113175,0.000057050227,0.698708,0.00036542665,0.29773852,0.0016571699,0.0003438957],"about_ca_topic_score_codex":0.00025615137,"about_ca_topic_score_gemma":0.00014504229,"teacher_disagreement_score":0.65603846,"about_ca_system_score_codex":0.00016373412,"about_ca_system_score_gemma":0.00019740986,"threshold_uncertainty_score":0.87876016},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.46631e-8,0.0017697708,0.16924296,0.00038469947,0.00048901705,0.00014849327,0.000011271113,0.00064620504,0.8273075],"genre_scores_gemma":[0.00031377655,0.00004204882,0.0014100489,0.00007182411,0.0001522473,0.000020020016,0.000020723031,0.000021470072,0.9979478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912554,0.0000015104561,0.0001744194,0.00040732167,0.00018078875,0.000110410605],"domain_scores_gemma":[0.99895877,0.000022560165,0.00003898411,0.0008922745,0.000028459093,0.00005894568],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000056034027,0.00015467394,0.00014921383,0.00008031527,0.00003861149,0.00034187487,0.0007046039,0.00012369797,0.00014395137],"category_scores_gemma":[5.522495e-7,0.0001297281,0.00009787705,0.000032201828,0.000017609047,0.00006856575,0.0003055364,0.00015204727,0.010379143],"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":[3.026493e-8,0.0000017012017,1.8476147e-8,0.000031265678,0.000014707938,0.000012237379,0.00001158868,0.0000020993584,0.00001666959,0.9702484,0.027057007,0.0026042704],"study_design_scores_gemma":[0.000012166036,0.0000050872,1.708965e-7,0.000049115115,0.000009653786,0.000023898028,7.7203504e-7,0.014191641,0.000009473626,0.111887045,0.873666,0.00014499214],"about_ca_topic_score_codex":0.000013399374,"about_ca_topic_score_gemma":0.000002020215,"teacher_disagreement_score":0.85836136,"about_ca_system_score_codex":0.00003192405,"about_ca_system_score_gemma":0.000041778105,"threshold_uncertainty_score":0.9903914},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011959182,0.00003784772,0.0014674773,0.00090673723,0.0000014589242,0.00013610408,0.0000058686423,0.00036598046,0.9969589],"genre_scores_gemma":[0.00025823983,1.6059879e-7,0.0027110542,0.000060339764,0.000058557667,0.000030945113,0.000008951001,0.0000094921725,0.99686223],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991715,0.000019221457,0.00013075609,0.00029244093,0.00016355178,0.00022252728],"domain_scores_gemma":[0.9991056,0.00002788022,0.000019979136,0.00068847626,0.000025253996,0.00013284599],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000089397516,0.000098513636,0.000095721574,0.000053028532,0.000102214384,0.000105703715,0.00078766857,0.000035848672,0.9871287],"category_scores_gemma":[0.0000039231354,0.000097811855,0.000047264748,0.0002315112,0.00001758711,0.00017021145,0.00011640635,0.00006534776,0.9988074],"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.0000018791932,0.000040453575,2.8146928e-8,0.0000014709914,0.000004623329,0.0000035359594,0.000021790236,0.000032321772,0.00018335435,0.00009220566,0.22440788,0.77521044],"study_design_scores_gemma":[0.0000891284,0.000028256363,0.000030691714,0.0000030005694,0.0000034990671,0.00001507571,1.8565355e-7,0.0065689743,0.00038818188,0.000083236904,0.992658,0.00013174917],"about_ca_topic_score_codex":0.000010829555,"about_ca_topic_score_gemma":1.197384e-7,"teacher_disagreement_score":0.7750787,"about_ca_system_score_codex":0.000018744313,"about_ca_system_score_gemma":0.00002750348,"threshold_uncertainty_score":0.39886516},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009140763,0.000059470913,0.0011986591,0.0007466378,0.000001356153,0.0001502688,0.0000053874296,0.00038225026,0.9973646],"genre_scores_gemma":[0.00014986402,2.0996974e-7,0.0029850013,0.00007251012,0.000060133498,0.000033814053,0.000011179144,0.000009676429,0.99667764],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916184,0.000020346977,0.00013618842,0.00029400506,0.0001613499,0.00022626112],"domain_scores_gemma":[0.99910015,0.000030142503,0.000020618632,0.00068711094,0.00002557809,0.00013642185],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009269269,0.00010129256,0.00009966384,0.000038916594,0.000109444365,0.00012258305,0.00080251246,0.000036522408,0.98007536],"category_scores_gemma":[0.0000061628516,0.000100374404,0.000049929367,0.00038098832,0.000019109759,0.00017388999,0.00011290811,0.00006714909,0.9979989],"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.0000015736354,0.00003679449,1.4864681e-8,0.0000013797691,0.0000037343018,0.0000024966832,0.0000198248,0.000039900548,0.0000987686,0.00011763112,0.21287331,0.78680456],"study_design_scores_gemma":[0.00008273837,0.000030323587,0.000015222743,0.000004264685,0.0000035436165,0.000010747891,1.9409123e-7,0.011550687,0.00029896578,0.00007711574,0.98779005,0.00013611876],"about_ca_topic_score_codex":0.000014532124,"about_ca_topic_score_gemma":1.1303065e-7,"teacher_disagreement_score":0.7866685,"about_ca_system_score_codex":0.00001902113,"about_ca_system_score_gemma":0.000026233583,"threshold_uncertainty_score":0.40931493},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.003856e-8,0.00020869284,0.00071390887,0.00043520317,0.0000051963975,0.0003947205,0.000068453446,0.0005734136,0.9976003],"genre_scores_gemma":[6.552747e-7,8.378513e-7,0.0018168789,0.00008207384,0.00022410965,0.000041929463,0.000120415396,0.000060002552,0.9976531],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816626,0.000013214465,0.00034686134,0.0007420343,0.0003793457,0.0003522744],"domain_scores_gemma":[0.99793017,0.000056637564,0.000118274664,0.0015778369,0.00006944483,0.00024764438],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000112085996,0.0003863166,0.00036195622,0.00021454091,0.00014834765,0.00021176215,0.0016578058,0.00024483365,0.9870392],"category_scores_gemma":[0.0000052693276,0.0004086124,0.0001956653,0.000115011964,0.000052825777,0.00015644744,0.0004139777,0.0002913238,0.9980715],"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.0000033038227,0.000020947638,5.9684935e-10,0.000007137191,0.000027135493,0.000015619386,0.000011556469,0.000015262303,0.000015643225,0.0060828733,0.2491798,0.74462074],"study_design_scores_gemma":[0.000101895654,0.00005388636,4.6019187e-7,0.000048011614,0.000025462929,0.00002841855,4.3327454e-8,0.0012880233,0.00002873895,0.0018985535,0.9960514,0.0004751223],"about_ca_topic_score_codex":0.000008331453,"about_ca_topic_score_gemma":2.0444611e-7,"teacher_disagreement_score":0.7468716,"about_ca_system_score_codex":0.000065335,"about_ca_system_score_gemma":0.000102171834,"threshold_uncertainty_score":0.99983656},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87004167,0.000074306554,0.12335435,0.0031318807,0.00039752698,0.00052403595,0.00014531869,0.0001893715,0.0021415409],"genre_scores_gemma":[0.98845804,0.000010107606,0.010291204,0.00083566265,0.000051573006,0.00009884011,0.000052362804,0.000010449336,0.00019178212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99819803,0.0001096606,0.00039740163,0.0007316757,0.00030590242,0.00025734882],"domain_scores_gemma":[0.9969637,0.00044543846,0.000261784,0.0021310435,0.000109734145,0.000088303794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025519377,0.00025474036,0.00034652193,0.00012175529,0.00024981785,0.00012559455,0.0021253708,0.0001272048,0.00004474808],"category_scores_gemma":[0.00011835235,0.00020634492,0.00018332289,0.00053861225,0.00015194449,0.000056925823,0.002102073,0.00051169714,0.00011277335],"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.000051425483,0.0012621668,0.05237947,0.00030342292,0.0006167604,0.000034629018,0.008287463,0.0015643016,0.05440281,0.8323969,0.011875818,0.036824808],"study_design_scores_gemma":[0.0005194383,0.000089104666,0.45567906,0.00075488654,0.000087831824,0.0000033594051,0.00012892732,0.026520433,0.070976764,0.43747267,0.0068073017,0.0009602077],"about_ca_topic_score_codex":0.002125602,"about_ca_topic_score_gemma":0.00014518225,"teacher_disagreement_score":0.4032996,"about_ca_system_score_codex":0.00005769864,"about_ca_system_score_gemma":0.00018308009,"threshold_uncertainty_score":0.84145015},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43534377,0.00057740766,0.5183713,0.0060187923,0.0013571092,0.00068070367,0.00006461164,0.0013551244,0.036231186],"genre_scores_gemma":[0.9771914,0.000052340405,0.012568057,0.00037817692,0.00013133441,0.00011593486,0.000111896676,0.000009973818,0.009440907],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866146,0.000027469998,0.00027866548,0.0006175325,0.0001757486,0.0002391105],"domain_scores_gemma":[0.9980063,0.000045810004,0.00013121031,0.0016736228,0.00006247051,0.00008060896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013928849,0.0002168324,0.0002329355,0.00012336591,0.0001319261,0.0001430062,0.0019344281,0.00017981928,0.000028592893],"category_scores_gemma":[0.000014849335,0.00020997386,0.0001544476,0.0003069256,0.000044232384,0.00013257236,0.0022789242,0.0003858756,0.00032713928],"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.000007726394,0.0007599949,0.59221226,0.000515073,0.00033693638,0.00009806467,0.0021056482,0.0011353341,0.0020334348,0.2757753,0.03763071,0.08738952],"study_design_scores_gemma":[0.0006130264,0.000052644322,0.4281215,0.00036814954,0.00009074071,0.000015164393,0.00006126734,0.08762081,0.009502386,0.02932991,0.44271904,0.0015053665],"about_ca_topic_score_codex":0.00021011978,"about_ca_topic_score_gemma":0.00008044878,"teacher_disagreement_score":0.5418476,"about_ca_system_score_codex":0.000055485612,"about_ca_system_score_gemma":0.00026735404,"threshold_uncertainty_score":0.85624856},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005417574,0.008480389,0.9607728,0.004934993,0.0017545964,0.0011525352,0.00047842125,0.00018819275,0.021696284],"genre_scores_gemma":[0.27365056,0.015558259,0.6171871,0.001714742,0.0010932359,0.0011613952,0.0023320438,0.00011359232,0.08718911],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963072,0.00027861382,0.0011768658,0.0008995632,0.0010276174,0.00031011895],"domain_scores_gemma":[0.9966889,0.00027008622,0.000860493,0.0015722825,0.00051520794,0.00009301999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017975209,0.00041544388,0.0010525393,0.00018352023,0.00012022866,0.000095467876,0.0024837763,0.00023186611,0.000083840314],"category_scores_gemma":[0.00009125738,0.0003262293,0.00026344284,0.0007581558,0.00034425166,0.00029070297,0.001227788,0.00047832198,0.0000071379336],"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.000009893625,0.0022020033,0.00017047198,0.06339329,0.00054311054,0.000006497238,0.0013676796,0.010170445,0.007404479,0.116036765,0.77519876,0.023496587],"study_design_scores_gemma":[0.0008177513,0.0003455868,0.00051323,0.016136114,0.0010290225,0.000014764817,0.0005216084,0.19153494,0.43545556,0.0015127794,0.34987032,0.00224831],"about_ca_topic_score_codex":0.00045957632,"about_ca_topic_score_gemma":0.000075859796,"teacher_disagreement_score":0.42805108,"about_ca_system_score_codex":0.000079824495,"about_ca_system_score_gemma":0.0011269529,"threshold_uncertainty_score":0.999919},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070409705,0.0011772566,0.9776402,0.0003117021,0.00028575675,0.00056303473,0.000022556324,0.00008718054,0.012871345],"genre_scores_gemma":[0.81813604,0.0001331699,0.18091312,0.00004541417,0.000007187706,0.00020780676,0.0000017609377,0.00000556574,0.0005499703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991547,0.000021597045,0.0003246694,0.00022283949,0.00013750835,0.00013870245],"domain_scores_gemma":[0.99877846,0.00030281648,0.00018256537,0.00061606994,0.00008273785,0.000037375426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001230271,0.000100455174,0.00023840046,0.0001495648,0.000059233273,0.000037124737,0.00054525037,0.000034717574,0.0000034434067],"category_scores_gemma":[0.00006602915,0.0000895066,0.000036289566,0.00068548485,0.00009841159,0.00020545274,0.0001574488,0.00007243477,0.00001794723],"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":[8.7599767e-7,0.00007339712,0.00063323125,0.0001908336,0.000010197195,0.0000012409188,0.0013275141,0.0004972799,0.000539402,0.99290764,0.00012710155,0.003691297],"study_design_scores_gemma":[0.001467547,0.0000589639,0.0019641311,0.0030100313,0.000054950582,0.00007640695,0.016379574,0.30814037,0.037325576,0.53716785,0.09350002,0.0008546111],"about_ca_topic_score_codex":0.000005002802,"about_ca_topic_score_gemma":0.000014853367,"teacher_disagreement_score":0.81109506,"about_ca_system_score_codex":0.000039610637,"about_ca_system_score_gemma":0.000043758082,"threshold_uncertainty_score":0.3649973},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028334087,0.00019178946,0.9690717,0.0021713078,0.000076744946,0.00006028053,0.000039616367,0.00001070983,0.0000437823],"genre_scores_gemma":[0.6421659,0.000006711538,0.3575595,0.00019931226,0.000050277602,0.0000019182355,9.151809e-7,0.000002897054,0.000012595207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929583,0.00002652553,0.00025673935,0.00014085254,0.00014948449,0.0001305781],"domain_scores_gemma":[0.99543905,0.0041428767,0.00006457094,0.00009812353,0.00015770459,0.00009764845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018951666,0.00007678643,0.00018692558,0.00001960259,0.00015527118,0.00017894665,0.00013672002,0.00002947874,0.0000035461646],"category_scores_gemma":[0.00058010285,0.0000656028,0.00002781777,0.00011462333,0.00015805771,0.00015966002,0.00009161519,0.00011821246,0.000001223614],"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.000015370451,0.000064611275,0.000053572796,0.00003662074,0.000018334804,0.000007217875,0.00004223343,0.000058122336,0.0011984964,0.96870744,0.0006142994,0.029183699],"study_design_scores_gemma":[0.0005761016,0.00013151583,0.010455363,0.00005884113,0.00006611762,0.000019664483,0.000010794741,0.2605188,0.00060121913,0.7267613,0.00070299726,0.00009728908],"about_ca_topic_score_codex":0.0000031635682,"about_ca_topic_score_gemma":4.2426484e-7,"teacher_disagreement_score":0.6138318,"about_ca_system_score_codex":0.000010711251,"about_ca_system_score_gemma":0.000076956974,"threshold_uncertainty_score":0.26752046},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14356035,0.00017906561,0.853938,0.0019682888,0.00018914297,0.000030561343,0.000002545415,0.0000068874874,0.00012519285],"genre_scores_gemma":[0.99713546,0.00004446155,0.0023976301,0.00034547408,0.00004346511,0.0000017793909,0.000006539117,0.0000017448681,0.000023448622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932295,0.000024533547,0.00028706007,0.000103984676,0.0002113859,0.000050063296],"domain_scores_gemma":[0.9993548,0.00006449486,0.00015646499,0.0001187906,0.00026902006,0.000036439902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018228272,0.00005669761,0.00012515161,0.00052162784,0.000035539004,0.00007066504,0.00028920808,0.00002958854,0.00000530333],"category_scores_gemma":[0.000019457895,0.000050022572,0.00007414443,0.0003394147,0.000022898683,0.00013510653,0.000039305458,0.00007512274,1.6905125e-7],"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.000060462866,0.0002581056,0.004767916,0.000015823936,0.0008605472,0.000007584913,0.0004995459,0.8092994,0.009843201,0.09016693,0.00012839682,0.08409206],"study_design_scores_gemma":[0.00023442341,0.000020794634,0.002316051,0.000021197535,0.000072318246,0.0000023639038,0.000022089827,0.99585825,0.0008922719,0.00040149494,0.000120470286,0.000038281072],"about_ca_topic_score_codex":0.000008519355,"about_ca_topic_score_gemma":0.000002237454,"teacher_disagreement_score":0.8535751,"about_ca_system_score_codex":0.000018087305,"about_ca_system_score_gemma":0.000026303645,"threshold_uncertainty_score":0.20398612},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005417574,0.008480389,0.9607728,0.004934993,0.0017545964,0.0011525352,0.00047842125,0.00018819275,0.021696284],"genre_scores_gemma":[0.27365056,0.015558259,0.6171871,0.001714742,0.0010932359,0.0011613952,0.0023320438,0.00011359232,0.08718911],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963072,0.00027861382,0.0011768658,0.0008995632,0.0010276174,0.00031011895],"domain_scores_gemma":[0.9966889,0.00027008622,0.000860493,0.0015722825,0.00051520794,0.00009301999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017975209,0.00041544388,0.0010525393,0.00018352023,0.00012022866,0.000095467876,0.0024837763,0.00023186611,0.000083840314],"category_scores_gemma":[0.00009125738,0.0003262293,0.00026344284,0.0007581558,0.00034425166,0.00029070297,0.001227788,0.00047832198,0.0000071379336],"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.000009893625,0.0022020033,0.00017047198,0.06339329,0.00054311054,0.000006497238,0.0013676796,0.010170445,0.007404479,0.116036765,0.77519876,0.023496587],"study_design_scores_gemma":[0.0008177513,0.0003455868,0.00051323,0.016136114,0.0010290225,0.000014764817,0.0005216084,0.19153494,0.43545556,0.0015127794,0.34987032,0.00224831],"about_ca_topic_score_codex":0.00045957632,"about_ca_topic_score_gemma":0.000075859796,"teacher_disagreement_score":0.42805108,"about_ca_system_score_codex":0.000079824495,"about_ca_system_score_gemma":0.0011269529,"threshold_uncertainty_score":0.999919},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005101022,0.000014411688,0.97271234,0.0010236672,0.0005255418,0.0001919417,0.000021359196,0.00040705016,0.024593582],"genre_scores_gemma":[0.9861466,0.000015812322,0.0077465926,0.0020926856,0.000009340398,0.00014151238,0.00001025346,0.0000040649425,0.0038331028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992782,0.00004988597,0.0002624532,0.0001176134,0.00014612393,0.00014571258],"domain_scores_gemma":[0.99913096,0.00014133171,0.000058875983,0.00051786896,0.00010440251,0.000046558827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022925647,0.00010535088,0.00008795954,0.00027383602,0.000315311,0.00017228126,0.00039839864,0.00005960302,0.00015918889],"category_scores_gemma":[0.000003847232,0.000101304504,0.00006240588,0.0007077539,0.000050392344,0.0013277379,0.000003106881,0.00013969906,0.0005975096],"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.000011441509,0.00007153304,6.4016103e-7,0.000019521012,0.000025408677,3.9109952e-7,0.00040427176,0.004189353,0.0001353634,0.80412686,0.0011893109,0.18982594],"study_design_scores_gemma":[0.002526501,0.00015389273,0.00056439784,0.00012571353,0.00009516191,0.000024628996,0.0007391402,0.18311916,0.14025994,0.21364786,0.45777282,0.0009708103],"about_ca_topic_score_codex":0.00000737767,"about_ca_topic_score_gemma":0.0000019972076,"teacher_disagreement_score":0.98563653,"about_ca_system_score_codex":0.00005114415,"about_ca_system_score_gemma":0.0000879777,"threshold_uncertainty_score":0.7679977},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038407356,0.0006220115,0.9594409,0.0019374731,0.000073226925,0.0007048285,0.0000016836588,0.00011652901,0.03326265],"genre_scores_gemma":[0.40882716,0.00006430786,0.5836916,0.00064107304,0.000028897288,0.00091885024,0.000023628672,0.000009603727,0.0057949047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992035,0.000046117293,0.00019613741,0.00026416883,0.00007654109,0.00021353373],"domain_scores_gemma":[0.9988895,0.00025072412,0.00003909549,0.0007321842,0.00006147098,0.000026996844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000334878,0.00007635198,0.000112644695,0.000095559815,0.0002571548,0.0001158246,0.000693008,0.000040555584,0.000010772321],"category_scores_gemma":[0.00000480327,0.000074230134,0.00004257888,0.0013142121,0.000034457735,0.00006238243,0.00021299647,0.00006811568,0.000022729502],"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.0000055028613,0.0001196598,0.00013444145,0.000006049212,0.00000564789,1.8620095e-7,0.00032829502,0.0037837094,0.00033908983,0.9663972,0.024145594,0.0047345725],"study_design_scores_gemma":[0.0010720332,0.000029611121,0.007122602,0.000062479754,0.00000330868,0.0000013538798,0.00012821368,0.43430704,0.001420663,0.139499,0.4161539,0.00019978605],"about_ca_topic_score_codex":0.000027409109,"about_ca_topic_score_gemma":0.00007517324,"teacher_disagreement_score":0.8268983,"about_ca_system_score_codex":0.00014405312,"about_ca_system_score_gemma":0.000099857054,"threshold_uncertainty_score":0.3027017},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13956359,0.000013283933,0.84029007,0.0038884939,0.00007917285,0.00039038772,0.000004716998,0.00010497627,0.015665296],"genre_scores_gemma":[0.98595184,0.000019268835,0.013354754,0.0002678959,0.000017699609,0.000050200262,8.9225324e-7,0.000007065472,0.00033039768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985256,0.000012534922,0.00039688146,0.0004806335,0.00033514967,0.0002491637],"domain_scores_gemma":[0.9987798,0.000047559217,0.00018160832,0.0003366657,0.0005974556,0.00005691276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023838409,0.00019569093,0.00021454226,0.00011873543,0.00029498705,0.00026858845,0.0015537936,0.00006416626,0.000010737264],"category_scores_gemma":[0.000049364917,0.00013680907,0.00007514542,0.0006871996,0.00020895322,0.00037472928,0.0003541102,0.00021325097,0.000014311598],"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.000023505721,0.00009298935,0.000007658705,0.000015772686,0.000013318608,2.2577994e-7,0.0005806648,0.003782825,0.083471864,0.8943063,0.000033005355,0.017671894],"study_design_scores_gemma":[0.00002374533,0.000036956746,0.0000072795856,0.00011261706,0.000008347002,0.0000013300632,0.00017372148,0.5941664,0.23102847,0.17433742,0.000008568525,0.00009517561],"about_ca_topic_score_codex":0.00003678707,"about_ca_topic_score_gemma":0.00001149786,"teacher_disagreement_score":0.8463882,"about_ca_system_score_codex":0.000037586677,"about_ca_system_score_gemma":0.00017480049,"threshold_uncertainty_score":0.55789125},"labels":[],"label_agreement":null},{"id":"W4409829874","doi":"10.1007/978-3-031-78757-7_1","title":"Solving the Initial Value Problem for Cellular Automata by Pattern Decomposition","year":2025,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Cellular automaton; Decomposition; Value (mathematics); Mathematics; Computer science; Algorithm; Chemistry; Statistics","score_opus":0.03859784314250021,"score_gpt":0.3027714591920461,"score_spread":0.2641736160495459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409829874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008273148,0.0005213288,0.9699522,0.0020204673,0.0004050478,0.0011227556,0.00017437218,0.0002870535,0.025433997],"genre_scores_gemma":[0.62971514,0.00060127553,0.26138538,0.0039132363,0.0016898614,0.0014740183,0.011661776,0.00027455343,0.089284755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808097,0.000057763005,0.0005495278,0.0007082179,0.00032727903,0.0002762221],"domain_scores_gemma":[0.9987146,0.00020466311,0.00033190975,0.00049942126,0.00016907498,0.000080275866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003062357,0.0003522012,0.0003188156,0.00013410812,0.0008753068,0.00030636424,0.00079904177,0.00017990975,0.000033981472],"category_scores_gemma":[0.00000561903,0.0003273598,0.00016572705,0.00012681293,0.00015133915,0.0002568693,0.00040017412,0.00025702035,0.00002466344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046510745,0.000049400118,0.0000028124427,0.00015713488,0.00006732299,0.000001495329,0.00020997648,0.00026597275,0.0002573888,0.8875548,0.026862357,0.084566675],"study_design_scores_gemma":[0.00026311917,0.00006793007,0.000037174643,0.000116737836,0.00006144297,0.0000071743366,0.000008413224,0.56848866,0.00017929508,0.38594204,0.044476632,0.00035140588],"about_ca_topic_score_codex":0.00007755631,"about_ca_topic_score_gemma":0.000025086041,"teacher_disagreement_score":0.70856684,"about_ca_system_score_codex":0.00005154088,"about_ca_system_score_gemma":0.00010791081,"threshold_uncertainty_score":0.99991786},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59505874,0.00084307697,0.38665468,0.0036327038,0.011798984,0.0009499214,0.000020383155,0.00007593626,0.0009655986],"genre_scores_gemma":[0.9817255,0.000026563486,0.017866936,0.00006201035,0.00029903406,0.0000024317426,0.000002326215,0.000010308059,0.0000048503175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978744,0.00018661223,0.0009362126,0.00028005007,0.00051654875,0.00020619754],"domain_scores_gemma":[0.99435127,0.0036273315,0.0007493343,0.0008408557,0.00031773178,0.00011347084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002312173,0.00021636712,0.00064137625,0.00022922573,0.00040620283,0.000335506,0.0015156149,0.00010082079,8.5024874e-7],"category_scores_gemma":[0.0013592556,0.00015028857,0.00009389631,0.0005704253,0.00020469306,0.00019323533,0.0009266769,0.0003895353,7.351309e-7],"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.000061810846,0.00014146022,0.0002515767,0.00011834383,0.00006003374,0.000001298039,0.0008983447,0.000032192605,0.00016783059,0.9952411,0.0005366343,0.0024893496],"study_design_scores_gemma":[0.0031788023,0.00019403777,0.0013585776,0.0005036402,0.00009092267,0.000025320907,0.00010560765,0.024659773,0.0005696283,0.9684738,0.00068426074,0.00015561645],"about_ca_topic_score_codex":0.000022733151,"about_ca_topic_score_gemma":0.0000014152553,"teacher_disagreement_score":0.3866668,"about_ca_system_score_codex":0.000031919466,"about_ca_system_score_gemma":0.00015351587,"threshold_uncertainty_score":0.612859},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2547335,0.00024707508,0.7437355,0.00069055316,0.0002793058,0.00014287625,0.000008619701,0.00008159998,0.000080982834],"genre_scores_gemma":[0.9583053,0.000016127831,0.0413573,0.00020011148,0.000048868154,0.000007913132,0.000030500049,0.000008579966,0.00002528392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9987408,0.00004551027,0.0005244698,0.000196568,0.00028521844,0.0002074371],"domain_scores_gemma":[0.99907905,0.00012605079,0.00028812373,0.00027079365,0.00016349863,0.000072508796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020932799,0.0001326069,0.00020724816,0.00015188003,0.00012395892,0.000058655085,0.0003351424,0.000057644018,0.000010056893],"category_scores_gemma":[0.000013374373,0.00012767284,0.00015240979,0.000671212,0.000023521687,0.00034951515,0.000002876336,0.00020296984,0.000003477883],"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.00008177855,0.00026382616,0.0010390982,0.00006248021,0.000023805724,0.00009073513,0.00030176557,0.8714767,0.066865094,0.008696083,0.00024684228,0.0508518],"study_design_scores_gemma":[0.0038632755,0.00056562346,0.51730216,0.0005564312,0.00015142393,0.000010146776,0.00015243355,0.40364122,0.056365114,0.004621297,0.012311546,0.000459336],"about_ca_topic_score_codex":0.0000016601491,"about_ca_topic_score_gemma":0.000005940322,"teacher_disagreement_score":0.7035718,"about_ca_system_score_codex":0.00006081451,"about_ca_system_score_gemma":0.00012139757,"threshold_uncertainty_score":0.5206348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0151018705,0.00028541643,0.9816951,0.0012794544,0.00014434787,0.00015778995,0.000009814391,0.000038946197,0.0012872609],"genre_scores_gemma":[0.99670994,0.000031169144,0.002726193,0.00010159525,0.00013641149,0.000051153504,0.00002391512,0.0000032057787,0.00021642241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987722,0.00004061219,0.0005930643,0.00019666327,0.00030187014,0.00009560531],"domain_scores_gemma":[0.998407,0.00011644997,0.00046833744,0.00024479657,0.0006912548,0.00007215896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028151844,0.00010344504,0.00030815005,0.0006441867,0.00013651742,0.0003200151,0.0006265804,0.000047173264,0.000016947795],"category_scores_gemma":[0.000011376732,0.000086276894,0.00027738864,0.0009200856,0.000029552668,0.00034689534,0.00008028675,0.00012610307,0.000008476757],"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.00015102095,0.00066132325,0.011627126,0.000023458897,0.010075872,0.000015203525,0.00015229268,0.002194123,0.01870583,0.8062907,0.0007341108,0.14936896],"study_design_scores_gemma":[0.0062381057,0.0001299508,0.1019835,0.00011658087,0.004053132,0.00014223183,0.0004089106,0.7955089,0.0029406378,0.0066206134,0.08132678,0.00053060544],"about_ca_topic_score_codex":0.000025453435,"about_ca_topic_score_gemma":0.000011136701,"teacher_disagreement_score":0.9816081,"about_ca_system_score_codex":0.00007007397,"about_ca_system_score_gemma":0.000060505798,"threshold_uncertainty_score":0.35182697},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016615126,0.00015763764,0.9725666,0.006971814,0.000055486,0.0004723951,0.000008429335,0.00015741197,0.0029951052],"genre_scores_gemma":[0.97950524,0.00027794906,0.019012142,0.000480697,0.000005850845,0.00061151426,0.000007000943,0.000008171834,0.00009143774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873245,0.0002598002,0.00029536267,0.0003329573,0.0001452202,0.00023422117],"domain_scores_gemma":[0.9967376,0.0010247726,0.00005640424,0.0020984563,0.000036677935,0.000046090026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004680317,0.00013911976,0.00015401246,0.0002793063,0.0010356911,0.00037664417,0.0030502167,0.00007219205,0.0000012634913],"category_scores_gemma":[0.000010284621,0.000120421006,0.00006503288,0.0013052487,0.00016452115,0.00039932175,0.00006146015,0.00056646304,0.000005663569],"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.0000291637,0.004326492,0.00082725246,0.00016825262,0.00013935653,0.0000035519863,0.011177208,0.017440818,0.0036080023,0.5248072,0.00035618732,0.4371165],"study_design_scores_gemma":[0.0004096626,0.0000121934945,0.0014695507,0.0000578859,0.000016523072,0.000011251104,0.00030286002,0.9925744,0.0010755956,0.0027000243,0.0012129646,0.00015709375],"about_ca_topic_score_codex":0.0001554479,"about_ca_topic_score_gemma":0.00026557263,"teacher_disagreement_score":0.9751336,"about_ca_system_score_codex":0.000043724784,"about_ca_system_score_gemma":0.00006673657,"threshold_uncertainty_score":0.7965803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031227162,0.0005417129,0.962309,0.0006551808,0.0017622727,0.00068924465,0.00020108603,0.00031241387,0.0023019002],"genre_scores_gemma":[0.9970053,0.000033604338,0.00080504344,0.00023872359,0.00006619792,0.00019812358,0.00001248184,0.000020160242,0.0016203701],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99766076,0.00015990128,0.0006152507,0.00078733667,0.00044900095,0.00032773794],"domain_scores_gemma":[0.9978291,0.00030695138,0.00025146708,0.0013201548,0.00017692058,0.00011544638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002006343,0.00029836345,0.00046753668,0.00027746495,0.00037322845,0.00015073853,0.0012834875,0.00030540963,0.000016151502],"category_scores_gemma":[0.000008786967,0.00029234638,0.00021568965,0.00080524496,0.00017412374,0.000456452,0.000015271546,0.00057054946,0.000036899906],"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.0001407126,0.004508998,0.00032471845,0.0023517509,0.002696409,0.00012452739,0.06521473,0.0851868,0.5828591,0.16537045,0.008901339,0.08232044],"study_design_scores_gemma":[0.0047258604,0.0005975253,0.0043258313,0.007503061,0.0006477555,0.00010092988,0.0039720437,0.11832068,0.7782724,0.0034100935,0.07508115,0.0030426965],"about_ca_topic_score_codex":0.00095919217,"about_ca_topic_score_gemma":0.00006188012,"teacher_disagreement_score":0.9657781,"about_ca_system_score_codex":0.00011362667,"about_ca_system_score_gemma":0.00023781863,"threshold_uncertainty_score":0.99995285},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002063417,0.005885314,0.7730732,0.0005987322,0.001820673,0.0006083228,0.0000088810075,0.0004044249,0.21757983],"genre_scores_gemma":[0.013776534,0.001118433,0.010506735,0.00014610596,0.000347995,0.000097229226,0.00003885056,0.000060004222,0.9739081],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867725,0.000026998572,0.0002640557,0.0004731647,0.0002902865,0.00026825196],"domain_scores_gemma":[0.9986767,0.000024083589,0.00020227906,0.00092261966,0.000059729027,0.00011457398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023049503,0.00027129613,0.00022940505,0.00016816845,0.0006087861,0.00016264367,0.0006826316,0.0002205847,0.00007492662],"category_scores_gemma":[0.0000024989286,0.00023489396,0.000110821406,0.00018248352,0.00011291977,0.00024447337,0.00028298047,0.0002810962,0.00014110758],"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.00000712664,0.00004274449,0.00002313238,0.00004328827,0.00014492124,0.000005981723,0.00068898627,0.00000715136,0.0007848501,0.15987912,0.7208901,0.11748259],"study_design_scores_gemma":[0.00013927527,0.00003381914,0.000053249143,0.000017677397,0.000078792225,0.000037403013,0.000018054712,0.040886186,0.00020727605,0.021272276,0.93689346,0.00036252275],"about_ca_topic_score_codex":0.000028251128,"about_ca_topic_score_gemma":0.00002237384,"teacher_disagreement_score":0.76256645,"about_ca_system_score_codex":0.00006956192,"about_ca_system_score_gemma":0.00009562101,"threshold_uncertainty_score":0.95786977},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018447243,0.0001863673,0.97507465,0.0023451415,0.00010616135,0.0004270561,0.000067656074,0.00034229527,0.003003424],"genre_scores_gemma":[0.8567605,0.000003844138,0.14248903,0.00014919008,0.000087844994,0.00016693122,0.00002133657,0.000011715594,0.0003096268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988221,0.000030731364,0.0003080716,0.00017887731,0.00021219972,0.0004480538],"domain_scores_gemma":[0.9984605,0.00014879477,0.00008516443,0.00091666204,0.00009533538,0.00029357764],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032879473,0.00014544655,0.00019583014,0.00008962485,0.00025416512,0.0001477987,0.0007169449,0.000051699728,0.000038172606],"category_scores_gemma":[0.00022281507,0.00012913671,0.00009049922,0.0004810109,0.000031352927,0.0004141667,0.00030672573,0.00007888609,0.0015493468],"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":[2.8696184e-7,0.00017171701,0.00007114496,0.000024191768,0.000022332406,6.966666e-7,0.0014674537,0.000020178988,0.004831769,0.9886076,0.0031899652,0.0015926907],"study_design_scores_gemma":[0.0016489548,0.00016866499,0.0179244,0.00039490568,0.00030774804,0.0003077192,0.000966245,0.41965464,0.070789315,0.35108012,0.1341187,0.002638576],"about_ca_topic_score_codex":0.000003718033,"about_ca_topic_score_gemma":0.0000011765056,"teacher_disagreement_score":0.8383132,"about_ca_system_score_codex":0.00008476254,"about_ca_system_score_gemma":0.000038802194,"threshold_uncertainty_score":0.99922806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008263893,0.00058941,0.9304555,0.014470356,0.00037412584,0.00019954359,0.0000043591576,0.0005568389,0.04508596],"genre_scores_gemma":[0.95644164,0.000024746974,0.015166555,0.0024004718,0.00004123071,0.00002905083,0.000021041196,0.000009784003,0.025865458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991011,0.000018548499,0.00015989126,0.00031219094,0.00013882208,0.00026941943],"domain_scores_gemma":[0.99899846,0.000040134164,0.000035591886,0.0008464149,0.000028233519,0.000051135277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000152591,0.000100316494,0.00010784134,0.00008466359,0.00019340687,0.00012534698,0.0008634127,0.00006239542,0.00002834271],"category_scores_gemma":[0.000012766853,0.000094644856,0.00007602309,0.00036260125,0.000031526917,0.00022640999,0.00034435268,0.00010223868,0.00014138602],"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.0000010158395,0.000048777052,0.0010988015,0.000012601312,0.0000159168,0.0000038783287,0.00021470562,0.000025159945,0.006527023,0.8743769,0.10037823,0.017296972],"study_design_scores_gemma":[0.00031045356,0.00002354636,0.002937138,0.000039106777,0.000010862776,0.000014325938,0.00009424982,0.081752494,0.024276279,0.07744943,0.81285703,0.00023504911],"about_ca_topic_score_codex":0.000029800887,"about_ca_topic_score_gemma":0.000034273202,"teacher_disagreement_score":0.94817775,"about_ca_system_score_codex":0.00002921835,"about_ca_system_score_gemma":0.000060358503,"threshold_uncertainty_score":0.38595054},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002738363,0.00012335987,0.120090455,0.00006386815,0.00019357337,0.00025964476,0.000076177355,0.000350387,0.8788398],"genre_scores_gemma":[0.00017870033,0.000055487275,0.001761705,0.00010051236,0.000049085924,0.0000011589036,0.000034819364,0.000013598463,0.99780494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988188,0.000018926034,0.00014800497,0.00058186706,0.00021752143,0.00021488301],"domain_scores_gemma":[0.9983605,0.00006088092,0.000120590026,0.0012290943,0.000108953995,0.00011993839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006177268,0.00026362995,0.00026762765,0.00020402786,0.00020517968,0.0000964486,0.0016901921,0.00022431707,0.0000033328347],"category_scores_gemma":[0.0000036908139,0.00032278913,0.00020064083,0.00001915987,0.00010932546,0.00010022281,0.0010843214,0.00030583536,0.000049043527],"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.0000019239992,0.000005404179,1.1835496e-7,0.000033728094,0.000045962955,0.000072477764,0.000011859333,8.0159384e-7,0.000035529072,0.91341794,0.081041895,0.0053323554],"study_design_scores_gemma":[0.0001841708,0.000012502277,0.0000042821835,0.000072299394,0.00008407387,0.00000834166,0.0000021484886,0.0013588851,0.0004024603,0.000099502766,0.9974686,0.0003027684],"about_ca_topic_score_codex":0.000045153145,"about_ca_topic_score_gemma":8.443101e-7,"teacher_disagreement_score":0.91642666,"about_ca_system_score_codex":0.000119481294,"about_ca_system_score_gemma":0.00017381579,"threshold_uncertainty_score":0.9999224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21622525,0.0010447513,0.760859,0.007163355,0.00037959765,0.0017294437,0.00041134778,0.000517638,0.011669608],"genre_scores_gemma":[0.98667824,0.000048322716,0.012424744,0.000082809616,0.00012504027,0.0002841667,0.00019948973,0.0000139986205,0.00014317721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630314,0.00059801113,0.0004074455,0.0010421659,0.0010524176,0.00059678976],"domain_scores_gemma":[0.9958071,0.0020397536,0.0000624519,0.0014597715,0.000489206,0.00014170386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013085991,0.00022080394,0.0003357956,0.00055484596,0.00024469564,0.0006828092,0.0017528061,0.0003328355,0.00004121406],"category_scores_gemma":[0.0004972239,0.00024191233,0.00010868695,0.00074686616,0.00013673239,0.00033672323,0.0032498534,0.0017084172,0.00009792991],"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.000014157039,0.0004114595,0.0014103866,0.0010314932,0.000035755256,0.0000793314,0.004511111,0.0070560435,0.0013792951,0.9768313,0.00045229497,0.0067873336],"study_design_scores_gemma":[0.00017071758,0.000014491936,0.0031990614,0.0007133348,0.0000052625496,7.699431e-7,0.0002710004,0.80042994,0.0004137103,0.19404341,0.0005244765,0.00021381809],"about_ca_topic_score_codex":0.0023610306,"about_ca_topic_score_gemma":0.0002728498,"teacher_disagreement_score":0.7933739,"about_ca_system_score_codex":0.00033145104,"about_ca_system_score_gemma":0.0006576923,"threshold_uncertainty_score":0.98648983},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003925899,0.005420609,0.9563175,0.0023373736,0.0005326338,0.00081714144,0.000112434616,0.00010097534,0.03435743],"genre_scores_gemma":[0.049418442,0.105720185,0.60815793,0.016334318,0.0012959995,0.0026828917,0.0025607676,0.0001681712,0.21366131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980736,0.000067668705,0.0005549738,0.000648133,0.00037686745,0.000278802],"domain_scores_gemma":[0.9985983,0.00015005122,0.00027069187,0.00076804514,0.0001374707,0.00007548192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005512628,0.00025515925,0.0006312423,0.0001750211,0.00006813519,0.0000630074,0.00092690706,0.00016834654,0.000018361374],"category_scores_gemma":[0.000014474408,0.0002472427,0.000098922654,0.00073343434,0.0000384063,0.00013905566,0.00081316044,0.00038482997,0.0000031342363],"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":[9.056849e-7,0.00012581455,0.000007858237,0.0027408444,0.00004143138,0.000005201736,0.00008462152,0.0017567663,0.00008339939,0.544573,0.43592253,0.014657604],"study_design_scores_gemma":[0.00036229222,0.000047586673,0.00007242636,0.0033547052,0.000116690964,0.0000045363636,0.000010465578,0.9044763,0.0002197412,0.04212404,0.048799396,0.00041180538],"about_ca_topic_score_codex":0.00006571267,"about_ca_topic_score_gemma":0.00003412705,"teacher_disagreement_score":0.90271956,"about_ca_system_score_codex":0.000081680686,"about_ca_system_score_gemma":0.0005209781,"threshold_uncertainty_score":0.999998},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41959718,0.0018929823,0.5703752,0.0041029453,0.0013085493,0.001146219,0.00039138758,0.00043840578,0.0007471349],"genre_scores_gemma":[0.9851551,0.000024313551,0.012300328,0.00029356615,0.00018744225,0.0005254847,0.00022394267,0.000014868853,0.0012749436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852294,0.00004831949,0.0003234885,0.0006975082,0.00015984096,0.0002478963],"domain_scores_gemma":[0.99859047,0.00022684659,0.00012109272,0.00083126005,0.00011992354,0.00011037952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021152713,0.00022347351,0.00028518963,0.000115170864,0.00029922806,0.00018755467,0.00061527593,0.00018081965,0.000006485942],"category_scores_gemma":[0.0000133288,0.00023291982,0.00012166689,0.0001897587,0.000049796545,0.0001504711,0.0004415873,0.00027029347,0.000019299987],"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.00005459754,0.0020168715,0.004498686,0.0037602403,0.0008681443,0.00007635951,0.0029276176,0.003992469,0.03593689,0.9118703,0.015790664,0.018207163],"study_design_scores_gemma":[0.00591931,0.00022261869,0.02667874,0.0019000287,0.00074809155,0.00005914008,0.00009874433,0.79786676,0.007253575,0.020372495,0.13647182,0.0024086898],"about_ca_topic_score_codex":0.00007719202,"about_ca_topic_score_gemma":0.000010331368,"teacher_disagreement_score":0.8914978,"about_ca_system_score_codex":0.00003853763,"about_ca_system_score_gemma":0.00015658187,"threshold_uncertainty_score":0.94981945},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006542495,0.000113764436,0.9864231,0.0017788811,0.0017149951,0.00131767,0.000056600686,0.00037440046,0.008155203],"genre_scores_gemma":[0.23059645,0.000051885832,0.75674963,0.0046189683,0.00089414755,0.000247419,0.0001564665,0.00011895286,0.006566071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956665,0.00002348647,0.0005519279,0.0021057206,0.0008509461,0.00080142054],"domain_scores_gemma":[0.99529696,0.0011854927,0.00031084183,0.0027739203,0.00023730451,0.00019549616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088966236,0.0007217793,0.00071150914,0.0008995127,0.0005253207,0.0006273578,0.004303074,0.00050251326,0.000017387794],"category_scores_gemma":[0.00010941786,0.0006592609,0.00029586235,0.0007844059,0.0004622895,0.00042050052,0.0013209656,0.00084266294,0.000049174167],"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.0000125525885,0.000121873505,0.000004579945,0.00016858029,0.000030849606,0.00004575174,0.0002852566,0.012405121,0.00066025194,0.42251325,0.0009144772,0.5628375],"study_design_scores_gemma":[0.00046706796,0.00020829975,0.000018577806,0.00031637552,0.000015942678,0.000015629357,7.670266e-8,0.7336339,0.0058421814,0.24466065,0.01416424,0.00065707887],"about_ca_topic_score_codex":0.000018766716,"about_ca_topic_score_gemma":0.000059084472,"teacher_disagreement_score":0.7212288,"about_ca_system_score_codex":0.00035174983,"about_ca_system_score_gemma":0.00096902903,"threshold_uncertainty_score":0.99958587},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033746948,0.0006960109,0.99242944,0.0009133681,0.00072244834,0.0004486575,0.000032687367,0.00025609077,0.004163808],"genre_scores_gemma":[0.3346619,0.00015420152,0.6555152,0.002584015,0.00041552586,0.00006930668,0.00010881814,0.000102920734,0.0063881036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629146,0.000030571373,0.0006660142,0.0015276696,0.00090506504,0.0005792118],"domain_scores_gemma":[0.9963594,0.0003089369,0.00049270515,0.0023999475,0.00029370317,0.00014528507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051340053,0.0005200688,0.00065076636,0.0006629186,0.00022827569,0.0003090707,0.0047965376,0.0003887949,0.000028208591],"category_scores_gemma":[0.000054277876,0.00050536875,0.00014443263,0.001176887,0.00033709806,0.0004574581,0.0021633809,0.0006845236,0.000035146877],"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.000010404917,0.0004367544,0.0001929542,0.0005359058,0.00009684295,0.00014834657,0.0010756206,0.007171093,0.0683997,0.06297344,0.0037605937,0.8551983],"study_design_scores_gemma":[0.00045589593,0.00012685561,0.00008090946,0.0008646841,0.000024414805,0.00002584599,4.4351637e-7,0.8751438,0.055347234,0.055735167,0.01119834,0.0009963816],"about_ca_topic_score_codex":0.000073815754,"about_ca_topic_score_gemma":0.000028302416,"teacher_disagreement_score":0.86797273,"about_ca_system_score_codex":0.00017397561,"about_ca_system_score_gemma":0.00064158463,"threshold_uncertainty_score":0.99973977},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17649537,0.0007979015,0.8188243,0.0003839412,0.0001764708,0.0002471674,0.000024207871,0.000103518316,0.002947149],"genre_scores_gemma":[0.9987501,0.000008613132,0.00021146926,0.000058940816,0.000012064064,0.000021052289,0.000027887905,0.000005457605,0.00090439647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913794,0.00004140523,0.00026768228,0.0002624495,0.000112380694,0.00017816643],"domain_scores_gemma":[0.9993856,0.000108288485,0.00008481446,0.0003173765,0.000050602528,0.000053325257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010682472,0.00010424309,0.00022752478,0.000049609473,0.000069747985,0.00013304572,0.00032965431,0.00006128815,0.0000015006253],"category_scores_gemma":[0.000022708397,0.00009042375,0.000045983492,0.00027649364,0.000040506766,0.00009700455,0.00015195714,0.0000626417,0.0000028891182],"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.000039671,0.0005560548,0.021610465,0.0008928298,0.00035270676,0.000026036623,0.0015357675,0.00014008966,0.2055094,0.50201637,0.0052516414,0.26206896],"study_design_scores_gemma":[0.0006203785,0.00014643386,0.001964438,0.00027217425,0.000035103316,0.0000054405914,0.00020737821,0.9819928,0.00092086324,0.0013435395,0.012182097,0.00030937046],"about_ca_topic_score_codex":0.00020472553,"about_ca_topic_score_gemma":0.000011236519,"teacher_disagreement_score":0.9818527,"about_ca_system_score_codex":0.000017963117,"about_ca_system_score_gemma":0.000015985108,"threshold_uncertainty_score":0.36873734},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003154303,0.0008202335,0.95376325,0.007013667,0.00024718457,0.0006750419,0.000037363818,0.00014971009,0.037261996],"genre_scores_gemma":[0.130779,0.0058673276,0.844859,0.008716953,0.00041549955,0.0005694183,0.0005638459,0.00003454277,0.008194396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986421,0.00001813379,0.00052838476,0.00034962647,0.00024228376,0.000219462],"domain_scores_gemma":[0.99723494,0.00020533006,0.00022238662,0.001807872,0.00043714355,0.00009231514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048288255,0.00020742165,0.00023840331,0.0008077157,0.0008274129,0.0007095442,0.0023035125,0.00013370493,0.0000023421267],"category_scores_gemma":[0.000028921097,0.00021763702,0.000050685696,0.00052599976,0.00050745695,0.0038028455,0.0015566028,0.00031329974,0.000010680834],"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":[8.647203e-7,0.0000073071033,0.000016792425,0.00003243691,0.0000038459566,5.6017626e-8,0.00043394166,0.000037331673,0.000007198323,0.8223638,0.0009105418,0.1761859],"study_design_scores_gemma":[0.00025483832,0.000020777512,0.00067281927,0.00012730595,0.000007809188,0.000019224814,0.000014679847,0.69267577,0.000007677847,0.009900332,0.29608467,0.00021408343],"about_ca_topic_score_codex":0.000008394528,"about_ca_topic_score_gemma":0.000012478403,"teacher_disagreement_score":0.81246346,"about_ca_system_score_codex":0.00012898985,"about_ca_system_score_gemma":0.00038839714,"threshold_uncertainty_score":0.887498},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004070322,0.00021603591,0.10744413,0.000021906892,0.00016421019,0.0007103763,0.00024134856,0.0002061484,0.8905888],"genre_scores_gemma":[0.0061960453,0.000035788446,0.00183543,0.000014989359,0.00004285673,0.0000058454775,0.000032786324,0.000016450103,0.9918198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895716,0.000039824954,0.00017133175,0.00047364115,0.0001722833,0.00018577384],"domain_scores_gemma":[0.99871385,0.00008943471,0.0001675664,0.00062980485,0.00021883547,0.00018048858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005902108,0.0001988468,0.00030742266,0.00018281577,0.00013539336,0.000067210996,0.0008927994,0.00016745746,6.978221e-7],"category_scores_gemma":[0.000012327143,0.00022819894,0.00006369187,0.000045939836,0.00012841096,0.00010602029,0.00067995477,0.00016319132,0.0000070040687],"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.000008559861,0.000019996036,0.0000018903148,0.0003065623,0.000053300453,0.000021576847,0.00011780369,7.5720845e-7,0.00015247539,0.97541213,0.02319184,0.0007131351],"study_design_scores_gemma":[0.000342647,0.00008683259,0.000055904435,0.00026291894,0.00014531566,0.0000561851,0.00004315512,0.002616694,0.00057830237,0.000042954798,0.9953122,0.00045687048],"about_ca_topic_score_codex":0.00019987665,"about_ca_topic_score_gemma":0.000003717864,"teacher_disagreement_score":0.97536916,"about_ca_system_score_codex":0.00010567854,"about_ca_system_score_gemma":0.00031613084,"threshold_uncertainty_score":0.9305683},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011823217,0.00040315802,0.9824086,0.0020333102,0.001709817,0.0010000484,0.000012395842,0.000572306,0.00003718518],"genre_scores_gemma":[0.51577014,0.0000044742133,0.48349306,0.00031897213,0.00025245638,0.00012929681,0.000013343318,0.000016271952,0.0000020046944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959561,0.000070241025,0.00052744284,0.0018614951,0.0007808789,0.0008038436],"domain_scores_gemma":[0.99644333,0.00036041174,0.00029541238,0.0022806232,0.00038312,0.00023707525],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001469194,0.00045111214,0.0005056394,0.0005866275,0.00027492002,0.0012109258,0.0053571328,0.00029405448,0.0000024107667],"category_scores_gemma":[0.00016625978,0.00042989294,0.0001770364,0.0014681632,0.00032163697,0.0003938462,0.0043888437,0.00062576093,0.000017621847],"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.000005073179,0.00022138405,0.00037320066,0.0002584756,0.000024605552,0.000040295978,0.0040689716,0.33715147,0.0045530912,0.011353591,0.00034396446,0.64160585],"study_design_scores_gemma":[0.000220023,0.000042214997,0.00011761513,0.00014163755,0.0000075283597,0.000013328485,4.2188393e-7,0.85804504,0.02272575,0.11719807,0.0010360403,0.0004523238],"about_ca_topic_score_codex":0.00012795,"about_ca_topic_score_gemma":0.00002319362,"teacher_disagreement_score":0.6411536,"about_ca_system_score_codex":0.0003291727,"about_ca_system_score_gemma":0.0013019717,"threshold_uncertainty_score":0.9998259},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72286004,0.00025346124,0.2604904,0.013715015,0.00027134092,0.00045842188,0.000012437228,0.00050396,0.00143494],"genre_scores_gemma":[0.9366121,0.00011440629,0.06309963,0.000087285174,0.000018211893,0.0000296183,0.0000014951379,0.000007986423,0.000029266164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895626,0.000008311408,0.0002926094,0.0003591148,0.00018566362,0.00019801444],"domain_scores_gemma":[0.9985357,0.000044446515,0.00019312832,0.0011121529,0.000076679826,0.000037895465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017898173,0.00015057506,0.00021723093,0.00023929263,0.00014034397,0.000018404126,0.001193055,0.00014488834,0.0000029296164],"category_scores_gemma":[0.00012188457,0.000113117996,0.00006471121,0.00071849953,0.0007685974,0.00018868074,0.00051768316,0.00025801733,0.000021424099],"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.0000030637946,0.000079567195,0.00009320397,0.000020259586,0.000023247607,0.0000035072587,0.00008591479,0.00020515312,0.009986292,0.96841216,0.000017223963,0.021070419],"study_design_scores_gemma":[0.0018451725,0.0006562021,0.003293316,0.00049091695,0.000064140775,0.00005453516,0.0000774462,0.014147485,0.54601586,0.4058797,0.02687662,0.00059862545],"about_ca_topic_score_codex":0.000050815524,"about_ca_topic_score_gemma":0.000010414516,"teacher_disagreement_score":0.5625325,"about_ca_system_score_codex":0.000026053729,"about_ca_system_score_gemma":0.00009024392,"threshold_uncertainty_score":0.4612818},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6418968,0.00010546732,0.3420953,0.0018111874,0.00038706686,0.0011514602,0.000031587577,0.00056894583,0.011952219],"genre_scores_gemma":[0.99717236,0.00001907899,0.0019000592,0.00018275442,0.00004068688,0.000006801877,0.000032871314,0.000014349748,0.00063102844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981545,0.00019298973,0.00021160014,0.0008833134,0.00015611095,0.0004014712],"domain_scores_gemma":[0.997408,0.00023452747,0.00018840321,0.001976884,0.00005912299,0.00013309828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050202344,0.0002708083,0.00024764918,0.00016604124,0.00020199285,0.000109811976,0.002288523,0.00023495991,0.000060301296],"category_scores_gemma":[0.000016422424,0.00024976532,0.00015391878,0.0005802038,0.000103211496,0.00022404693,0.0023839357,0.00077173824,0.00047033888],"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.0000060091984,0.00041341886,0.00037546418,0.00003086788,0.00003027698,0.00004743726,0.00013465944,0.026746683,0.00023579907,0.9710664,0.00059467764,0.00031828482],"study_design_scores_gemma":[0.00039228846,0.000022231861,0.003716373,0.00012841361,0.000042388292,0.0000030444676,0.00001471352,0.7295623,0.00084162824,0.2631879,0.0015582255,0.0005305325],"about_ca_topic_score_codex":0.0002030081,"about_ca_topic_score_gemma":0.00003846826,"teacher_disagreement_score":0.70787853,"about_ca_system_score_codex":0.00017710551,"about_ca_system_score_gemma":0.00016660085,"threshold_uncertainty_score":0.99999547},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076088137,0.00019066088,0.6171832,0.0053935554,0.00018603547,0.00051473046,0.000076343575,0.0030904582,0.3657562],"genre_scores_gemma":[0.9806966,0.00009025667,0.006486948,0.00096147717,0.000102884114,1.9516968e-7,0.0007016676,0.00067074713,0.010289207],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986437,0.00014379434,0.00020632715,0.0004495324,0.0002521459,0.00030448605],"domain_scores_gemma":[0.9986413,0.00002447309,0.0000583196,0.00089405075,0.00026821333,0.00011361287],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038388578,0.00011316002,0.000108165,0.00022254846,0.0017900388,0.0011059516,0.0021775377,0.00004546622,0.0019641737],"category_scores_gemma":[0.00014323207,0.00012181146,0.000052168845,0.0010730698,0.0000889058,0.00029607996,0.0018688553,0.0001717384,0.00692357],"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.000007840499,0.00015777638,0.0000033093863,0.000042106956,0.000034667355,0.00001829204,0.00056655385,0.00003773024,0.00759867,0.32915312,0.35562396,0.30675596],"study_design_scores_gemma":[0.0002238599,0.0000385085,0.00057377794,0.000015849175,0.000006352195,0.000040084346,0.000046426525,0.004514797,0.0014326308,0.001962329,0.9910209,0.00012443912],"about_ca_topic_score_codex":0.000019439067,"about_ca_topic_score_gemma":3.3093468e-7,"teacher_disagreement_score":0.9730878,"about_ca_system_score_codex":0.00009646225,"about_ca_system_score_gemma":0.000007085046,"threshold_uncertainty_score":0.999931},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010684862,0.0002714661,0.03647091,0.0012612969,0.00019690275,0.0005816219,0.0005594851,0.0039561777,0.95669144],"genre_scores_gemma":[0.007465563,0.000916955,0.0067504393,0.0019246542,0.0008720502,0.0000013419476,0.010544415,0.01790344,0.95362115],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99768746,0.00034141398,0.00024932282,0.00080410606,0.0005198974,0.0003977966],"domain_scores_gemma":[0.9978416,0.00002263586,0.00019778988,0.0015586336,0.000113629896,0.00026569894],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00036125397,0.00023082565,0.0002070411,0.0004340319,0.002206539,0.00067324756,0.0035657426,0.00011428068,0.10175098],"category_scores_gemma":[0.00019773458,0.00026163374,0.000092262526,0.0009220025,0.000100207144,0.00015470441,0.0040015946,0.00043454094,0.0198854],"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.0000021116505,0.000097523895,2.1285817e-7,0.00005928516,0.000026170706,0.000029814802,0.00012109338,0.000012154637,0.000117671705,0.03731195,0.8321155,0.13010652],"study_design_scores_gemma":[0.00024859523,0.00006391998,0.000016441238,0.000014429467,0.000012488291,0.00008108022,0.0000313527,0.0010113548,0.000028438297,0.00038995667,0.9978254,0.00027656485],"about_ca_topic_score_codex":0.00006088148,"about_ca_topic_score_gemma":8.9873515e-7,"teacher_disagreement_score":0.16570988,"about_ca_system_score_codex":0.00022983883,"about_ca_system_score_gemma":0.000010582705,"threshold_uncertainty_score":0.9999836},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046569022,0.005483165,0.18345156,0.00062322343,0.00044717916,0.00140679,0.0010103579,0.0030518132,0.8040602],"genre_scores_gemma":[0.12753686,0.013368806,0.10737795,0.0013062952,0.0038128337,0.000003091056,0.0693283,0.03809739,0.6391685],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809813,0.0002911382,0.000305629,0.0006439933,0.00041101375,0.00025009608],"domain_scores_gemma":[0.9982076,0.000016915441,0.00025908448,0.0010800111,0.00030323397,0.00013314415],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00024111582,0.0002079302,0.00024693308,0.00024174174,0.0005042955,0.00063251785,0.001638755,0.00017229357,0.012008163],"category_scores_gemma":[0.00005525397,0.00022029203,0.00009745867,0.00068000436,0.00010390453,0.00013744208,0.0009546806,0.0002251504,0.0020768715],"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.0000041057087,0.00019687833,7.597306e-7,0.00011155338,0.00006991551,0.000011406241,0.0010179258,0.000005306558,0.093258545,0.003969583,0.7420566,0.15929742],"study_design_scores_gemma":[0.00021568939,0.000047430352,0.00009658702,0.00008769939,0.00001281802,0.000008104109,0.000062946216,0.0006021379,0.009005737,0.00008755765,0.98955727,0.00021603757],"about_ca_topic_score_codex":0.00007147574,"about_ca_topic_score_gemma":0.0000034161596,"teacher_disagreement_score":0.24750066,"about_ca_system_score_codex":0.00006048659,"about_ca_system_score_gemma":0.000011572025,"threshold_uncertainty_score":0.99870014},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.5022145e-7,0.0009065878,0.06278155,0.0011819418,0.00047703687,0.00041587072,0.00006801564,0.0011985754,0.93296957],"genre_scores_gemma":[0.0049173487,0.020751808,0.08146966,0.04364276,0.005852389,0.0002489754,0.010714402,0.0005941565,0.8318085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833006,0.00005926952,0.00054329453,0.0003534043,0.0002382585,0.00047573642],"domain_scores_gemma":[0.9984496,0.00003202151,0.00041238058,0.00087085157,0.000012950164,0.00022218795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009141793,0.00039138034,0.0003469434,0.00027794117,0.00017244334,0.000692017,0.0009888244,0.00035504793,0.0008755929],"category_scores_gemma":[0.0000025212419,0.0003679027,0.00011819937,0.00052131637,0.000053819087,0.006795268,0.0004325632,0.00034109663,0.000483643],"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.000001946297,0.000017272187,0.0000055683736,0.000030282392,0.0000150547385,0.0000012586136,0.000039909726,0.000016471457,3.1989495e-7,0.5086382,0.4640509,0.02718282],"study_design_scores_gemma":[0.00037042337,0.000031146075,0.0002457556,0.00020355044,0.000010252029,0.000024154073,7.3540906e-7,0.007988056,0.00001162433,0.0015421966,0.98917264,0.0003994646],"about_ca_topic_score_codex":9.045308e-8,"about_ca_topic_score_gemma":5.956214e-7,"teacher_disagreement_score":0.52512175,"about_ca_system_score_codex":0.000008095776,"about_ca_system_score_gemma":0.0000657901,"threshold_uncertainty_score":0.9998773},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032894186,0.0024404777,0.1614035,0.002349138,0.00006263482,0.00023181296,0.000078502846,0.000049529448,0.8333515],"genre_scores_gemma":[0.010840201,0.0017591642,0.021320483,0.00067636854,0.000050702114,0.00001305771,0.000014469714,0.00010334715,0.9652222],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997914,0.000027811213,0.00023472891,0.00038629517,0.0010580361,0.00037909637],"domain_scores_gemma":[0.99887395,0.000095275085,0.00017007021,0.00055061333,1.4500634e-7,0.0003099218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00000737586,0.0002565587,0.0002254233,0.000018557335,0.0003457132,0.00006072629,0.0008756415,0.000053036252,0.000040352566],"category_scores_gemma":[1.6098456e-7,0.00020847935,0.000047190093,0.00009361231,0.00005021665,0.00013547856,0.00028529696,0.00015481951,1.6437895e-8],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.00009766972,0.000036304325,0.00004027529,0.0002130951,0.00010534509,0.000043673102,0.00015229474,0.070683934,0.0056991633,0.12026639,0.71796757,0.0846943],"study_design_scores_gemma":[0.00010709328,0.0000060865514,0.000010698317,0.00009006625,0.0000109878565,0.0000024512942,0.000011401847,0.6947616,0.0008988686,0.0030212281,0.3008961,0.00018344882],"about_ca_topic_score_codex":0.001238638,"about_ca_topic_score_gemma":0.021721961,"teacher_disagreement_score":0.6240776,"about_ca_system_score_codex":0.000010314978,"about_ca_system_score_gemma":0.0023073312,"threshold_uncertainty_score":0.99612904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007904829,0.00017711963,0.9854352,0.00059062056,0.00014437488,0.0009055363,0.00005496569,0.00025908492,0.0045282985],"genre_scores_gemma":[0.2496643,0.00021750543,0.73151475,0.00005875856,0.0001323309,0.000035006695,0.0037557946,0.00009489245,0.014526616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884605,0.000030682495,0.0001355099,0.00044090865,0.00031066212,0.00023618957],"domain_scores_gemma":[0.9987734,0.00008080503,0.0002906872,0.0005565984,0.00022723386,0.00007127397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001116455,0.00020287407,0.0002741261,0.00024270656,0.0002826657,0.000049202707,0.0012438312,0.00024175092,0.000010137158],"category_scores_gemma":[0.000008214305,0.00029110815,0.00018870422,0.00034729025,0.000043660268,0.00018695607,0.00010065862,0.00017503393,0.000050719387],"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.00015654149,0.0023030755,0.00034894372,0.003312269,0.00069362466,0.00016716095,0.0026849103,0.0032794352,0.2735705,0.4662517,0.20642787,0.04080397],"study_design_scores_gemma":[0.00281233,0.0010959029,0.017310163,0.00040633028,0.0005151459,0.00004847702,0.0033812574,0.73165244,0.047614455,0.030372094,0.16241823,0.002373183],"about_ca_topic_score_codex":0.000103048296,"about_ca_topic_score_gemma":0.004722332,"teacher_disagreement_score":0.728373,"about_ca_system_score_codex":0.00008000347,"about_ca_system_score_gemma":0.000109897,"threshold_uncertainty_score":0.9999541},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029335767,0.0009622446,0.06996119,0.0015206578,0.002273004,0.0027692798,0.0018185936,0.001529927,0.88982934],"genre_scores_gemma":[0.13708445,0.0007985797,0.00577297,0.00019672864,0.0007392677,0.0000056463414,0.0008704565,0.00026033292,0.8542716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9901175,0.00082294387,0.0010764371,0.0036739684,0.0023291241,0.0019800165],"domain_scores_gemma":[0.992081,0.00043949837,0.0012058575,0.003226195,0.0012826821,0.001764789],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","insufficient_payload"],"category_scores_codex":[0.00048096117,0.0020812417,0.0019341225,0.0025998172,0.005148948,0.00090738403,0.006238153,0.0019556584,0.0025201614],"category_scores_gemma":[0.00009692055,0.0026135673,0.0014064981,0.0028562355,0.002775449,0.0027099575,0.0024813558,0.0019697435,0.0017558783],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065656146,0.003027813,0.0020638793,0.0014675349,0.0038490896,0.015115499,0.0050038686,0.0016249183,0.004747939,0.8755378,0.07098155,0.015923548],"study_design_scores_gemma":[0.0033252754,0.00029216104,0.0018404211,0.00079420325,0.0009896642,0.00048313336,0.0034702343,0.003841853,0.00094496564,0.00012060021,0.9811279,0.002769573],"about_ca_topic_score_codex":0.0040627373,"about_ca_topic_score_gemma":0.00077152863,"teacher_disagreement_score":0.91014636,"about_ca_system_score_codex":0.005173561,"about_ca_system_score_gemma":0.0038084348,"threshold_uncertainty_score":0.9999384},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.3587005e-7,0.00014108587,0.0004332536,0.0020297265,0.00018901262,0.0005484569,0.00021949802,0.00065359456,0.99578446],"genre_scores_gemma":[0.00038920602,0.0001897866,0.003961619,0.0018336151,0.0001064742,0.00004497728,0.00017668799,0.00006848088,0.99322915],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99820197,0.00007823697,0.0005291714,0.00038745906,0.000521505,0.00028165628],"domain_scores_gemma":[0.998053,0.00011364491,0.0005308649,0.0008694494,0.00007591032,0.00035711486],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013747657,0.00034997516,0.00039157714,0.000067235946,0.00009773733,0.00016879004,0.0013673836,0.00029611008,0.12307671],"category_scores_gemma":[0.0001199916,0.00034800847,0.00014895918,0.000016307507,0.00012544978,3.8554452e-7,0.0002852018,0.00028847498,0.011287907],"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.000011690215,0.000046851474,1.869285e-7,0.00031387853,0.000030753326,0.00001482245,0.00021604399,0.00014507723,9.77434e-7,0.0073125004,0.9902414,0.0016658374],"study_design_scores_gemma":[0.00035688264,0.00009877335,0.0000012785663,0.00008590411,0.000020399311,0.000029986006,0.000023076793,0.0011711799,0.000024695697,0.00007533915,0.99775136,0.00036112635],"about_ca_topic_score_codex":0.0028196773,"about_ca_topic_score_gemma":0.00032073146,"teacher_disagreement_score":0.111788794,"about_ca_system_score_codex":0.000052131705,"about_ca_system_score_gemma":0.00011860093,"threshold_uncertainty_score":0.9998972},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057036918,0.000028538883,0.9371755,0.0008707646,0.00007254335,0.00011797601,4.4136942e-7,0.00007824417,0.0046190363],"genre_scores_gemma":[0.7622862,0.0000012880519,0.23557478,0.00027258857,0.00003916458,0.000055279732,0.0000148293,0.0000023275402,0.0017535315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997431,0.0000031484392,0.000072323935,0.0000949673,0.000041033843,0.000045445144],"domain_scores_gemma":[0.99970984,0.000020231553,0.000024691371,0.00012532549,0.000096629294,0.000023270253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009704792,0.00002608259,0.00002500637,0.00004782099,0.000034028963,0.00006252249,0.000092831586,0.000012075047,0.000001107099],"category_scores_gemma":[0.000029953751,0.000023528393,0.000004468457,0.00021539119,0.0000055120217,0.00018616184,0.000031641197,0.00001167763,0.000006078244],"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":[1.1086174e-7,0.00003395041,0.0001001038,0.0000016753879,8.3373146e-7,6.7192847e-9,0.0001561989,0.000002257573,0.00074814557,0.78003895,0.005959281,0.2129585],"study_design_scores_gemma":[0.00074300723,0.00008748261,0.0036828106,0.000014462816,0.000007292075,0.000012520138,0.00020389861,0.2247825,0.02529496,0.41777712,0.3270841,0.00030984601],"about_ca_topic_score_codex":0.0000042211022,"about_ca_topic_score_gemma":9.0437106e-7,"teacher_disagreement_score":0.7052493,"about_ca_system_score_codex":0.000008066448,"about_ca_system_score_gemma":0.00006797693,"threshold_uncertainty_score":0.095946},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09235044,0.0015890539,0.26742813,0.048117135,0.000615621,0.0034352841,0.0011206032,0.0011386715,0.5842051],"genre_scores_gemma":[0.9451366,0.0012477576,0.0063665705,0.0033106061,0.00019110336,0.00010621558,0.002239585,0.00030330298,0.041098237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946223,0.0013816523,0.00081106345,0.0014086312,0.0008509963,0.0009253738],"domain_scores_gemma":[0.9964107,0.0005972209,0.0011673799,0.001119207,0.0002870631,0.0004183909],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010681892,0.0009298721,0.000806957,0.00049447117,0.0020400214,0.00059165404,0.0013172417,0.00057966314,0.04705512],"category_scores_gemma":[0.000046180416,0.0010934138,0.00043737257,0.00067759637,0.000571842,0.00069372694,0.0007320016,0.0009903094,0.00011224953],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013052471,0.0018063647,0.013677199,0.00055554725,0.0011050848,0.00036348338,0.2314868,0.004995862,0.002345319,0.32864538,0.2870997,0.12778875],"study_design_scores_gemma":[0.0024734433,0.00037335875,0.012712675,0.00027851047,0.00050947285,0.00035694143,0.03784935,0.084626086,0.0004948572,0.00043346762,0.85833573,0.0015561274],"about_ca_topic_score_codex":0.022733111,"about_ca_topic_score_gemma":0.06358928,"teacher_disagreement_score":0.8527862,"about_ca_system_score_codex":0.0018751041,"about_ca_system_score_gemma":0.003207827,"threshold_uncertainty_score":0.9992592},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031890834,0.01762811,0.017358918,0.05064044,0.004003495,0.0030348217,0.00009263017,0.0055948542,0.89845765],"genre_scores_gemma":[0.017324356,0.00028932898,0.0024689408,0.00033072633,0.00010629155,0.00014405655,0.000019321864,0.00004052919,0.9792764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981562,0.0000169939,0.0004174659,0.0007579636,0.00022933034,0.00042205778],"domain_scores_gemma":[0.99780166,0.0001294833,0.000102408056,0.0018520415,0.00008005582,0.00003437793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029537088,0.00040428914,0.00037271372,0.0002323507,0.00044115054,0.00030035857,0.0013668775,0.00019312695,0.00003731599],"category_scores_gemma":[0.000010315765,0.00022560856,0.00017649384,0.000089635636,0.000219991,0.00015657341,0.0018866314,0.0005556221,0.00047447567],"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.000011948635,0.00010621003,0.00003902215,0.000541974,0.0018120495,0.003135605,0.0029548479,0.000031839685,0.007572118,0.6169694,0.26505733,0.101767674],"study_design_scores_gemma":[0.000087690365,0.000009908342,1.8495555e-7,0.00013642339,0.00006171107,0.00016285054,0.000076608645,0.0003242302,0.025105149,0.024310563,0.9493555,0.00036920005],"about_ca_topic_score_codex":0.000018094033,"about_ca_topic_score_gemma":0.00006677174,"teacher_disagreement_score":0.68429816,"about_ca_system_score_codex":0.000096298834,"about_ca_system_score_gemma":0.000024066409,"threshold_uncertainty_score":0.92000496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04093818,0.0000080206655,0.9054181,0.002046344,0.000010748721,0.00008340354,5.9041597e-8,0.0002243066,0.05127082],"genre_scores_gemma":[0.89549005,5.9299776e-7,0.099105366,0.00039948054,0.000009525709,0.000028481189,5.892046e-7,0.000001919643,0.0049639908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973696,0.0000020917291,0.000034931923,0.00010021339,0.000055560384,0.00007021439],"domain_scores_gemma":[0.99966675,0.000008803115,0.000008947668,0.00026163732,0.00002151988,0.000032335185],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000015918684,0.00002827615,0.000024924904,0.000012332717,0.000032751585,0.0000858687,0.0002482302,0.000007919033,0.00018054777],"category_scores_gemma":[6.714822e-7,0.000018513389,0.000007821043,0.00011011535,0.000009553507,0.00019508539,0.000045953,0.000018824858,0.0015031301],"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":[2.3676323e-7,0.000062106556,0.0007865951,0.000004096907,0.0000074754507,0.0000019248455,0.00026775853,0.0000121926605,0.012274049,0.8272811,0.024641253,0.1346612],"study_design_scores_gemma":[0.0005845961,0.00013507636,0.042155314,0.000012025002,0.0000066626612,0.00007590109,0.000103343475,0.59656435,0.061804015,0.031336937,0.26662362,0.00059816375],"about_ca_topic_score_codex":0.000055583656,"about_ca_topic_score_gemma":0.0000031589411,"teacher_disagreement_score":0.85455185,"about_ca_system_score_codex":0.0000025421775,"about_ca_system_score_gemma":0.0000091465445,"threshold_uncertainty_score":0.9992743},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072828956,0.00009222798,0.91040623,0.0003983554,0.00013171526,0.00018029743,0.000008404904,0.00054563896,0.015408164],"genre_scores_gemma":[0.88247806,0.000006102612,0.11703975,0.00011253256,0.000032012686,0.0000021353421,0.00001834628,0.000008387502,0.0003027036],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985917,0.000015591158,0.00045085844,0.00033506806,0.00027351972,0.0003332611],"domain_scores_gemma":[0.9986426,0.00033059256,0.00017622282,0.00065565394,0.000089871784,0.00010506441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004644331,0.00014027201,0.00018618802,0.00015182128,0.00012213073,0.000074572636,0.00081605,0.000059252394,0.0000685882],"category_scores_gemma":[0.000027207336,0.00012826757,0.000097821365,0.000483075,0.00007066142,0.00026065734,0.00028821884,0.000117380776,0.00013822243],"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.000011929585,0.00088041363,0.0014692039,0.00010578777,0.000059714428,0.000120249395,0.0010075195,0.0005768332,0.44437072,0.43577215,0.010795763,0.10482971],"study_design_scores_gemma":[0.00088462426,0.000105464766,0.06351804,0.000054503158,0.000016461885,0.000058322585,0.00027590376,0.3051775,0.61378455,0.008675591,0.0068807993,0.00056825916],"about_ca_topic_score_codex":0.000045782934,"about_ca_topic_score_gemma":0.0000036611343,"teacher_disagreement_score":0.80964905,"about_ca_system_score_codex":0.000022275319,"about_ca_system_score_gemma":0.000051616284,"threshold_uncertainty_score":0.5230599},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016894828,0.000012016806,0.96262175,0.03181234,0.000035705387,0.00046789416,0.0000055507558,0.00007702656,0.0032782203],"genre_scores_gemma":[0.9401181,0.0000030620165,0.055543326,0.0035976348,0.00005515834,0.00008251837,0.0000075257362,0.0000045295355,0.0005881931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991953,0.00010040599,0.0002023911,0.00011837017,0.00020160429,0.00018195044],"domain_scores_gemma":[0.99857664,0.0004937436,0.000073615345,0.0006873392,0.00007711408,0.00009154257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000662278,0.00008300035,0.00007140434,0.00008422481,0.00031977866,0.00018051226,0.00069923344,0.000049331913,0.000112655434],"category_scores_gemma":[0.00012381289,0.000049722876,0.000032728676,0.00055253133,0.000032181928,0.00038870497,0.000060337123,0.000107619526,0.00069183763],"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.0000030513309,0.000010509983,0.000008184128,9.597401e-7,0.000007315973,7.533207e-8,0.003330977,0.2784296,0.00007582596,0.68200016,0.009682605,0.026450757],"study_design_scores_gemma":[0.00006775474,0.0000152042785,0.0016098423,0.000029062336,0.0000058916653,0.000002053432,0.00016118528,0.9378067,0.00078647444,0.016187182,0.043222252,0.00010638852],"about_ca_topic_score_codex":0.00050847145,"about_ca_topic_score_gemma":0.0014924778,"teacher_disagreement_score":0.9384286,"about_ca_system_score_codex":0.000061744766,"about_ca_system_score_gemma":0.00010913167,"threshold_uncertainty_score":0.8892404},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086313635,0.0006804994,0.95691615,0.0021914367,0.0003277102,0.0010273426,0.000010350146,0.00021349602,0.030001659],"genre_scores_gemma":[0.97142375,0.00009377444,0.010774292,0.00030389926,0.00009489362,0.00031617773,0.000017171398,0.000014319168,0.016961697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980402,0.00007851085,0.000544105,0.0007098686,0.00031472463,0.00031259813],"domain_scores_gemma":[0.99754393,0.0002208142,0.00025321692,0.0016001967,0.00028623792,0.00009561509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032288447,0.0002875132,0.00035836943,0.00030996522,0.00039926203,0.00015850276,0.0010116339,0.00012945969,0.00009361672],"category_scores_gemma":[0.000019483807,0.00021996448,0.0001324534,0.0026566118,0.00033869498,0.00046055616,0.0003030397,0.00021821403,0.00006934045],"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.000017478142,0.0005415696,0.0028497367,0.00009789979,0.00010879391,7.315644e-7,0.00049606053,0.00056097074,0.0026012808,0.93926126,0.0011110657,0.05235317],"study_design_scores_gemma":[0.0012974384,0.00019374471,0.025150763,0.00023323148,0.00018192692,0.00004139247,0.00051031285,0.723281,0.019581584,0.21018231,0.018547334,0.0007989376],"about_ca_topic_score_codex":0.00012146931,"about_ca_topic_score_gemma":0.00011428375,"teacher_disagreement_score":0.9627924,"about_ca_system_score_codex":0.00006141929,"about_ca_system_score_gemma":0.0003751254,"threshold_uncertainty_score":0.8969891},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20836748,0.00062588614,0.78570265,0.0018031077,0.001051958,0.0006973395,0.00002251331,0.000097230906,0.0016318519],"genre_scores_gemma":[0.98963684,0.000008959108,0.008713951,0.0008266938,0.00006643607,0.00003677339,0.000008742947,0.000014855,0.00068672874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969878,0.000488345,0.000765585,0.0008414613,0.00033231682,0.0005844657],"domain_scores_gemma":[0.9979639,0.00033843107,0.000120979144,0.0012825913,0.00009285617,0.00020121664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010066328,0.00028024625,0.0004677799,0.00035762886,0.0002946572,0.000547371,0.0013318235,0.00015343181,0.0000284703],"category_scores_gemma":[0.00010145318,0.00030741148,0.00011939917,0.0019104921,0.00018779494,0.00023566128,0.0008363106,0.00029395684,0.000303977],"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.0000111929685,0.00021477816,0.0015107258,0.000114879396,0.000036111007,0.000016944263,0.0003304435,0.004268028,0.0024092863,0.9876289,0.00023006981,0.0032286649],"study_design_scores_gemma":[0.00032611043,0.000024562936,0.013328304,0.00039909128,0.000036929934,0.000017546054,0.00012865692,0.9711823,0.00019187076,0.009183806,0.0048604636,0.00032038082],"about_ca_topic_score_codex":0.0011488887,"about_ca_topic_score_gemma":0.00017486722,"teacher_disagreement_score":0.97844505,"about_ca_system_score_codex":0.00027600696,"about_ca_system_score_gemma":0.00039867562,"threshold_uncertainty_score":0.9999378},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010771566,0.00009268774,0.63300306,0.006870727,0.0005346782,0.0021603378,0.00053956854,0.00498763,0.34103975],"genre_scores_gemma":[0.9289288,0.00040271855,0.035107113,0.0016643067,0.001627542,0.000002478859,0.010977329,0.004029298,0.01726041],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975899,0.00016747409,0.00031817143,0.0009859381,0.00050960336,0.00042890155],"domain_scores_gemma":[0.9974032,0.00003699167,0.00020313688,0.0017030361,0.00046270562,0.00019090054],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005602703,0.0002821441,0.00025372655,0.00034682712,0.0018838882,0.0014270422,0.0032696293,0.00014514323,0.0010830214],"category_scores_gemma":[0.0001372575,0.0002741283,0.00008510492,0.0008782982,0.000101557715,0.00020791579,0.0056679533,0.00081022026,0.0038079082],"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.00010775415,0.0011233913,0.000009876188,0.00078076124,0.00033276217,0.00009987831,0.0036843184,0.0061811158,0.0025626738,0.070109844,0.29262096,0.6223867],"study_design_scores_gemma":[0.0003651078,0.00016880567,0.00013300127,0.00027982972,0.000021070075,0.00002743757,0.000054579607,0.028928425,0.0014671744,0.0002983633,0.96791494,0.00034128095],"about_ca_topic_score_codex":0.000018579845,"about_ca_topic_score_gemma":6.1762734e-7,"teacher_disagreement_score":0.9181572,"about_ca_system_score_codex":0.00016077097,"about_ca_system_score_gemma":0.000020520114,"threshold_uncertainty_score":0.9999711},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010771566,0.00009268774,0.63300306,0.006870727,0.0005346782,0.0021603378,0.00053956854,0.00498763,0.34103975],"genre_scores_gemma":[0.9289288,0.00040271855,0.035107113,0.0016643067,0.001627542,0.000002478859,0.010977329,0.004029298,0.01726041],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975899,0.00016747409,0.00031817143,0.0009859381,0.00050960336,0.00042890155],"domain_scores_gemma":[0.9974032,0.00003699167,0.00020313688,0.0017030361,0.00046270562,0.00019090054],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005602703,0.0002821441,0.00025372655,0.00034682712,0.0018838882,0.0014270422,0.0032696293,0.00014514323,0.0010830214],"category_scores_gemma":[0.0001372575,0.0002741283,0.00008510492,0.0008782982,0.000101557715,0.00020791579,0.0056679533,0.00081022026,0.0038079082],"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.00010775415,0.0011233913,0.000009876188,0.00078076124,0.00033276217,0.00009987831,0.0036843184,0.0061811158,0.0025626738,0.070109844,0.29262096,0.6223867],"study_design_scores_gemma":[0.0003651078,0.00016880567,0.00013300127,0.00027982972,0.000021070075,0.00002743757,0.000054579607,0.028928425,0.0014671744,0.0002983633,0.96791494,0.00034128095],"about_ca_topic_score_codex":0.000018579845,"about_ca_topic_score_gemma":6.1762734e-7,"teacher_disagreement_score":0.9181572,"about_ca_system_score_codex":0.00016077097,"about_ca_system_score_gemma":0.000020520114,"threshold_uncertainty_score":0.9999711},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4017146,0.005115947,0.55616516,0.009847531,0.0009984066,0.001606511,0.000058672653,0.000390932,0.02410223],"genre_scores_gemma":[0.9118726,0.0006695594,0.06042043,0.0019790637,0.00010257269,0.00031115473,0.000028524726,0.000045583623,0.0245705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715346,0.00013463698,0.00080312614,0.0009320119,0.00038022286,0.00059656333],"domain_scores_gemma":[0.9975114,0.00032934107,0.00021537115,0.0016247183,0.000093704424,0.00022550786],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005350751,0.00043714527,0.00060159434,0.0002644577,0.00058478117,0.0011435765,0.0011673535,0.00016397653,0.0004220135],"category_scores_gemma":[0.00006447012,0.00042959573,0.00015171203,0.0010580516,0.00030264253,0.00043476975,0.0010990271,0.00022187272,0.00042842675],"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.0000091179,0.0005262641,0.00038518533,0.0006131174,0.00015734388,0.0000114969935,0.0015271074,0.0000041728954,0.004664733,0.94540876,0.0030726031,0.043620095],"study_design_scores_gemma":[0.0047722906,0.00019168256,0.0066398988,0.00155089,0.0007223243,0.00014086334,0.0008385815,0.42711756,0.018320391,0.3522627,0.18542765,0.0020151765],"about_ca_topic_score_codex":0.00003248841,"about_ca_topic_score_gemma":0.00000787349,"teacher_disagreement_score":0.5931461,"about_ca_system_score_codex":0.00008865878,"about_ca_system_score_gemma":0.00019971882,"threshold_uncertainty_score":0.9998933},"labels":[],"label_agreement":null},{"id":"W853868720","doi":"10.1007/978-3-319-65558-1_10","title":"An Example of Computation of the Density of Ones in Probabilistic Cellular Automata by Direct Recursion","year":2018,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Recursion (computer science); Cellular automaton; Probabilistic logic; Simple (philosophy); Set (abstract data type); Computation; Block (permutation group theory); Mathematics; Algorithm; Probabilistic automaton; Computer science; Construct (python library); Theoretical computer science; Combinatorics; Statistics","score_opus":0.05078467912281573,"score_gpt":0.2640733069235046,"score_spread":0.21328862780068888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W853868720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32645345,0.00042878216,0.6637666,0.00015409657,0.00045474872,0.0013807982,0.00014854486,0.00012672145,0.007086224],"genre_scores_gemma":[0.99060035,0.00003830037,0.00866344,0.00001048977,0.00002335652,0.0000074559557,0.00018821715,0.000015879703,0.00045250083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979511,0.00013587691,0.0007963765,0.0005313624,0.00043991226,0.00014538737],"domain_scores_gemma":[0.998059,0.000101617334,0.00085719523,0.00061042665,0.00031724476,0.000054566295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042785922,0.00023454972,0.00048472307,0.00016445416,0.00012589648,0.000021014945,0.00062637107,0.0001474835,0.000028501823],"category_scores_gemma":[0.000013862975,0.00021436554,0.00010405467,0.0002860169,0.00046746508,0.00019099735,0.00026064494,0.00013931785,0.0000029431453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090902315,0.0014555211,0.0013926682,0.002056103,0.00015595903,0.0000028586853,0.007434822,0.007889508,0.02984922,0.89359325,0.004149002,0.051930163],"study_design_scores_gemma":[0.0004080308,0.00034010923,0.009651021,0.0004442953,0.000057486708,0.000004570352,0.000040170333,0.638747,0.007582254,0.3412076,0.0011183076,0.00039919818],"about_ca_topic_score_codex":0.0008281986,"about_ca_topic_score_gemma":0.00024185296,"teacher_disagreement_score":0.6641469,"about_ca_system_score_codex":0.000027130935,"about_ca_system_score_gemma":0.00009647077,"threshold_uncertainty_score":0.8741573},"labels":[],"label_agreement":null},{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029405332,0.00021884491,0.99439836,0.00052986183,0.00043574878,0.0005190694,0.00012683586,0.00010646424,0.00072428177],"genre_scores_gemma":[0.91393614,0.000012677643,0.08567111,0.000121292906,0.00010012442,0.0000124788485,0.000080755395,0.000024909554,0.00004048809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679464,0.00004823319,0.00087839185,0.0010532053,0.00079659553,0.0004289203],"domain_scores_gemma":[0.9971878,0.00023277778,0.00042739758,0.0017928805,0.00021099087,0.000148186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042906756,0.00041238664,0.00063865527,0.001098203,0.00012995441,0.000090638634,0.0027638294,0.00033304468,0.000039460185],"category_scores_gemma":[0.000029340108,0.00040690528,0.00015832669,0.0010745281,0.0011486448,0.00027808806,0.00045039738,0.0005477586,0.000012305839],"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.000012355378,0.00048652416,0.000056853187,0.00031683635,0.00004771955,0.000050713486,0.0036136492,0.1119679,0.020928495,0.2806498,0.00004593595,0.5818232],"study_design_scores_gemma":[0.0010737865,0.00038869336,0.0001391677,0.0004898604,0.000034089033,0.000062723986,0.0000015816572,0.84455377,0.038218062,0.113285914,0.0011367752,0.0006155505],"about_ca_topic_score_codex":0.000057854264,"about_ca_topic_score_gemma":0.00013986575,"teacher_disagreement_score":0.9109956,"about_ca_system_score_codex":0.00017107793,"about_ca_system_score_gemma":0.0007864385,"threshold_uncertainty_score":0.9998383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9668637,0.00015929074,0.005939513,0.0012227135,0.0005024818,0.00016888634,6.620818e-7,0.00049791456,0.024644827],"genre_scores_gemma":[0.9957401,0.000014191111,0.002673788,0.00026795213,0.0000055736364,0.000026309186,0.0000022946326,0.000007234285,0.0012625156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992463,0.00002202846,0.00013318886,0.0002521642,0.00015033642,0.000195983],"domain_scores_gemma":[0.99925196,0.00004259326,0.00002904991,0.0005763596,0.000021762746,0.00007827531],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011197889,0.000085384054,0.000093516624,0.000031271014,0.00014707707,0.00012718808,0.0006965834,0.000037720503,0.00015836323],"category_scores_gemma":[0.000006346712,0.000085338324,0.00004490872,0.00031172638,0.000014788274,0.0002547862,0.000081715276,0.00009122038,0.0010241928],"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":[7.343287e-7,0.00006596989,0.0001236577,0.0000020476396,0.000005131601,0.0000060949346,0.00020201622,0.000009668302,0.0010770902,0.940574,0.0025549727,0.055378597],"study_design_scores_gemma":[0.00079300546,0.000064303895,0.006982591,0.000015591679,0.000008893316,0.00003222673,0.000013467825,0.056951936,0.005456117,0.7453947,0.18390876,0.0003783993],"about_ca_topic_score_codex":0.000027652795,"about_ca_topic_score_gemma":0.0000013196351,"teacher_disagreement_score":0.19517931,"about_ca_system_score_codex":0.000024641402,"about_ca_system_score_gemma":0.000033612854,"threshold_uncertainty_score":0.99975365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038134027,0.00014111544,0.8373507,0.008201065,0.0023830761,0.00043011198,0.000068568734,0.00028810304,0.11300323],"genre_scores_gemma":[0.9980965,0.00003159732,0.00060952175,0.000029773953,0.000064758395,0.000047949172,0.000022221308,0.0000063427633,0.0010912835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987832,0.00003239808,0.0003301306,0.0002349873,0.00047397974,0.00014531241],"domain_scores_gemma":[0.9988723,0.0000672106,0.00019418936,0.00057853723,0.00023956387,0.00004820428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002419493,0.00010460953,0.00011676043,0.00006304783,0.00012808338,0.00029729377,0.0015479627,0.000045218232,0.000010937602],"category_scores_gemma":[0.000020773883,0.00007804217,0.00006202419,0.00013367468,0.000068897956,0.00015996021,0.00014615455,0.00009630903,0.00025126897],"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.0000015451674,0.000046715075,0.000021643858,0.00000509382,0.000022796637,0.0000033418141,0.00008321728,0.0004024775,0.0021196108,0.99500245,0.000087440625,0.0022036426],"study_design_scores_gemma":[0.0009245755,0.00011214084,0.00083325524,0.0002417404,0.000009254787,0.000044011937,0.00045669594,0.8745259,0.007788574,0.101995416,0.012708672,0.0003597309],"about_ca_topic_score_codex":0.00015884952,"about_ca_topic_score_gemma":0.000017255748,"teacher_disagreement_score":0.95996255,"about_ca_system_score_codex":0.00011870413,"about_ca_system_score_gemma":0.00012508286,"threshold_uncertainty_score":0.3229638},"labels":[],"label_agreement":null}]}