{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":448,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":448,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"4d4108f4fc85","filters":{"topic":"Cellular Automata and Applications"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Dalhousie University","funders":"","keywords":"Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01884103371675665,"gpt":0.26462287622025,"spread":0.2457818425034934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003878468,0.00004469515,0.0000418456,0.00006991489,0.0003249394,0.0002305997,0.001845886,0.00001415078,0.00005054471],"category_scores_gemma":[0.000044614,0.00003955033,0.00001583682,0.0009825947,0.0005730129,0.0006098366,0.0003002791,0.0001044792,0.0004660886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007808631,"about_ca_system_score_gemma":0.0001488698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001061525,"about_ca_topic_score_gemma":0.00002505411,"domain_scores_codex":[0.9991256,0.000003571426,0.0000714481,0.0002828971,0.0002885785,0.0002279197],"domain_scores_gemma":[0.9990737,0.00001909605,0.00002420738,0.0007041208,0.00006242943,0.0001164884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[4.337425e-8,0.00001613355,0.0002024887,6.298383e-7,1.872444e-7,6.497345e-7,0.00008002593,0.000001119155,0.3518601,0.6375319,0.0002581014,0.01004852],"study_design_scores_gemma":[0.0001977621,0.00002695786,0.0566219,0.000004190151,0.000001914522,0.00006264777,0.00002141835,0.2130917,0.2403952,0.1832651,0.305942,0.0003691967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.35647,0.00002363052,0.5790871,0.004370385,0.001694544,0.0001928237,0.000001985193,0.0005817776,0.05757779],"genre_scores_gemma":[0.8985127,4.731115e-7,0.1009665,0.0001759504,0.00003535819,0.00000761811,4.492909e-7,0.000001583037,0.0002993763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5420427,"threshold_uncertainty_score":0.5990781,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01395270491409317,"gpt":0.1948340756669944,"spread":0.1808813707529012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007285254,0.0002345658,0.0002599079,0.0001241568,0.0002082299,0.0001538042,0.001169828,0.0002038136,3.54494e-7],"category_scores_gemma":[0.000003153557,0.0002800021,0.00008584536,0.0000193697,0.0001293542,0.0001498865,0.0006964328,0.0002418457,0.00001406431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001055541,"about_ca_system_score_gemma":0.0001927827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003124011,"about_ca_topic_score_gemma":8.18055e-7,"domain_scores_codex":[0.998899,0.00003534229,0.0001164727,0.0005430314,0.000189288,0.0002168423],"domain_scores_gemma":[0.9986757,0.00005691875,0.0001217199,0.0009341594,0.00005902512,0.000152497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001629904,0.000008573444,1.784368e-7,0.00002405607,0.00001956793,0.00007451402,0.00002337205,4.16674e-7,0.00003116955,0.7770469,0.2143871,0.008382522],"study_design_scores_gemma":[0.0002571052,0.00002454265,0.00004838959,0.00005103215,0.0000484882,0.00003610358,0.000002874312,0.003731898,0.0001694324,0.00006793314,0.995259,0.00030317],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00002608093,0.0001669885,0.04222988,0.00005460632,0.00004611104,0.0002530167,0.0000622076,0.0005105343,0.9566506],"genre_scores_gemma":[0.0001709896,0.00008714089,0.002588545,0.00009794689,0.00004833663,7.03276e-7,0.00005516262,0.00001203878,0.9969391],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7808719,"threshold_uncertainty_score":0.9999652,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009067863765680985,"gpt":0.240658269237084,"spread":0.231590405471403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001654098,0.0001292401,0.0001643365,0.00007607007,0.00006350125,0.00008833787,0.0004914586,0.00004806287,0.0000175225],"category_scores_gemma":[0.00001537984,0.0001195455,0.00003830328,0.0003611273,0.00003201136,0.000104137,0.00008795029,0.00009025232,0.0001737034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004057242,"about_ca_system_score_gemma":0.00003044419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003011682,"about_ca_topic_score_gemma":0.000009089452,"domain_scores_codex":[0.9990982,0.000008480037,0.0002503391,0.0002420366,0.0001600539,0.0002408716],"domain_scores_gemma":[0.9991218,0.00006192821,0.00006931623,0.000679775,0.00001155784,0.0000555678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[1.841865e-7,0.00005650393,0.000007046535,0.00002030645,0.000003473904,0.000001483499,0.0008736593,0.00002998366,0.003696705,0.9943283,0.00006750287,0.0009148502],"study_design_scores_gemma":[0.0005185032,0.00001505578,0.0002288974,0.000027739,0.00001149609,0.00001868185,0.0008609894,0.1332173,0.01228921,0.8431763,0.009123189,0.0005125806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02164189,0.00007708557,0.8915778,0.0001589212,0.0000539647,0.0003127247,0.000002399215,0.0001905691,0.08598462],"genre_scores_gemma":[0.6862865,0.00001436336,0.3132701,0.00005976991,0.000004275063,0.0001035049,0.000004586191,0.00001294612,0.0002439394],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6646446,"threshold_uncertainty_score":0.4874924,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0388504897602568,"gpt":0.2533514514007004,"spread":0.2145009616404436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006439025,0.0001604661,0.0002776908,0.0001283137,0.0001249089,0.0001485905,0.0006691864,0.00006370362,0.00001495928],"category_scores_gemma":[0.00007280591,0.0001128575,0.000100202,0.0002502949,0.00007037995,0.0005435369,0.0001548582,0.0002141474,0.00002611939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000378447,"about_ca_system_score_gemma":0.00004611878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002396841,"about_ca_topic_score_gemma":0.000001550557,"domain_scores_codex":[0.9988009,0.00004135232,0.0005279885,0.0001179165,0.0002786516,0.0002331703],"domain_scores_gemma":[0.9984379,0.0002614169,0.0004881535,0.0004655657,0.0001270182,0.0002199045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003311144,0.0009503805,0.005915775,0.0001164573,0.0001127716,0.000005821322,0.01800528,0.000006662946,0.00433781,0.9370863,0.001803163,0.03165623],"study_design_scores_gemma":[0.003358125,0.0006102033,0.265649,0.0006071156,0.0003641064,0.002550005,0.01933528,0.01699761,0.06798774,0.5012767,0.1186807,0.002583397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5461081,0.00141231,0.4502305,0.0008292096,0.0002332397,0.0001095195,0.000004242471,0.00004195813,0.001030893],"genre_scores_gemma":[0.9426332,0.0001207579,0.05689337,0.00009273251,0.0002073605,0.000001946966,0.000001343116,0.00001175991,0.00003749965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4358097,"threshold_uncertainty_score":0.4602197,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Universidad de Chile; National Science Foundation","keywords":"Mathematics; Separation (statistics); Pure mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01105647539877131,"gpt":0.2601677423339833,"spread":0.249111266935212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001352851,0.0001149579,0.0001848223,0.00001401821,0.0002548406,0.00003146267,0.0003615089,0.00003456664,0.00003132379],"category_scores_gemma":[0.00001150258,0.0000696052,0.0002026159,0.0002863022,0.0004719194,0.0001382594,0.00003597805,0.000209968,0.000008534148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000957597,"about_ca_system_score_gemma":0.0000336642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002801207,"about_ca_topic_score_gemma":0.000006561683,"domain_scores_codex":[0.999301,0.00002727936,0.0001857398,0.0001910428,0.0001599741,0.0001349694],"domain_scores_gemma":[0.9990458,0.0002112921,0.0001250212,0.0005115178,0.00003745167,0.00006890613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008903421,0.001190609,0.002021258,0.0001203395,0.0002802402,1.640704e-7,0.02003749,0.000314738,0.7852915,0.1601318,0.0004006388,0.03020228],"study_design_scores_gemma":[0.0005909957,0.0001244857,0.05229568,0.00004158167,0.0001075832,0.0000371249,0.001852073,0.7799072,0.1067666,0.05615601,0.001502912,0.000617759],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.480837,0.000003351215,0.5183901,0.0005251251,0.00002711272,0.00009943177,0.00000507866,0.00004956017,0.00006326292],"genre_scores_gemma":[0.9122873,0.000004161759,0.08752919,0.00007106936,0.0000081335,0.00001544308,9.712293e-7,0.00000681931,0.00007693446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7795924,"threshold_uncertainty_score":0.2838418,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01702914256608409,"gpt":0.2791472115642058,"spread":0.2621180689981217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001323084,0.0004574261,0.0007087039,0.00004767549,0.0004496785,0.000167841,0.0006808449,0.0001008803,0.00004277781],"category_scores_gemma":[0.00009906433,0.0003585513,0.0001439306,0.0003772389,0.0005321495,0.0003976011,0.0007391405,0.0005490209,0.0003212992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008650927,"about_ca_system_score_gemma":0.00004230057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003645303,"about_ca_topic_score_gemma":0.000002016496,"domain_scores_codex":[0.9972355,0.0001571695,0.000634648,0.001015024,0.0004711463,0.0004865],"domain_scores_gemma":[0.9977862,0.0004205924,0.0002256971,0.001072213,0.0001614347,0.0003339062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001815982,0.001771814,0.00007890436,0.001359793,0.0001439349,0.0001537855,0.001346248,0.00002654363,0.002689669,0.8987043,0.006087244,0.08761963],"study_design_scores_gemma":[0.0006032719,0.0005008849,0.001565616,0.0007034195,0.0002920947,0.00009366533,0.00003162956,0.7966174,0.0004020916,0.1968691,0.001649368,0.0006714295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05114114,0.002337544,0.9216018,0.007045883,0.0005514258,0.002179129,0.0001779808,0.0007901311,0.01417494],"genre_scores_gemma":[0.9896092,0.001254207,0.00747948,0.000231557,0.000261235,0.00014742,0.0002080168,0.00004672841,0.0007621051],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9384681,"threshold_uncertainty_score":0.9998866,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07650001709710176,"gpt":0.3021696976145776,"spread":0.2256696805174758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002659074,0.00005045611,0.00004933491,0.00002138421,0.0001897932,0.00004166034,0.0002100853,0.00002814285,0.000003412133],"category_scores_gemma":[0.000006402714,0.00003934518,0.00003681759,0.00006241006,0.000008850597,0.00009345372,0.00004886417,0.00003163297,0.00002047138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001896887,"about_ca_system_score_gemma":0.000007279212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002274254,"about_ca_topic_score_gemma":0.000001401833,"domain_scores_codex":[0.9994947,0.00003545971,0.0001250572,0.0001615915,0.00007860199,0.0001045642],"domain_scores_gemma":[0.9993786,0.0002815921,0.00004385681,0.0002717914,0.00001332973,0.00001083958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[4.999001e-7,0.00001034687,0.00001234388,0.000002215202,9.038266e-7,3.731507e-8,0.00005984951,0.9546728,0.005500327,0.02791165,0.00001791991,0.01181115],"study_design_scores_gemma":[0.0001036816,0.000004865441,0.00005409269,6.346421e-7,0.000004456806,2.189146e-7,0.000009159076,0.9597042,0.002076715,0.02906619,0.008927393,0.00004836907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009217424,0.00006219361,0.9894879,0.0002687648,0.00003940063,0.0004850845,0.00000105454,0.00006412432,0.0003740132],"genre_scores_gemma":[0.8431855,8.062999e-7,0.1563727,0.00005707464,0.00004809832,0.0002024894,0.00001329044,0.000004085572,0.0001159201],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.833968,"threshold_uncertainty_score":0.160445,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Robot; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01875195398452069,"gpt":0.2462010460510475,"spread":0.2274490920665268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000485777,0.0002861284,0.0002998738,0.0001935723,0.001264254,0.0009416001,0.003343438,0.0001208828,0.00003659962],"category_scores_gemma":[0.00002522222,0.0002482931,0.00007292148,0.0001334142,0.0003828507,0.0006199736,0.001561174,0.000265261,0.000117365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006843268,"about_ca_system_score_gemma":0.0006653436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007953151,"about_ca_topic_score_gemma":0.0000368806,"domain_scores_codex":[0.9977865,0.0000121685,0.0002067779,0.0009959318,0.0005697032,0.0004288765],"domain_scores_gemma":[0.9977348,0.00002657982,0.0002484636,0.00164128,0.00008843879,0.0002604048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[4.853851e-7,0.00001524389,6.211037e-7,0.00001716265,0.000004860811,0.00001706455,0.00006966285,0.0001877705,0.001608169,0.9673017,0.003034723,0.02774253],"study_design_scores_gemma":[0.0003194345,0.0001026941,0.00007234729,0.00009797653,0.00002770828,0.0001293669,0.000002556229,0.4235655,0.0004865488,0.3621229,0.2123153,0.0007577137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.000001655072,0.0003244358,0.8338714,0.000560335,0.0003654579,0.0002746034,0.00001862604,0.0001673149,0.1644161],"genre_scores_gemma":[0.001259674,0.0002270938,0.3512122,0.0003298505,0.00009242595,0.00004896273,0.00002642308,0.00002654402,0.6467768],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6051788,"threshold_uncertainty_score":0.999997,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.106162117386747,"gpt":0.2594392455828755,"spread":0.1532771281961285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002999296,0.0000553109,0.0001031798,0.00002787864,0.0000478326,0.00004434074,0.00037372,0.00001545009,0.00001675236],"category_scores_gemma":[5.885726e-7,0.00004789001,0.00004031263,0.0001915045,0.00002110715,0.0001834971,0.00009478853,0.0000285416,0.00005236994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009909818,"about_ca_system_score_gemma":0.00000567374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007608197,"about_ca_topic_score_gemma":3.266564e-7,"domain_scores_codex":[0.9994801,0.00001325784,0.0001192047,0.0001460255,0.0001362643,0.0001052039],"domain_scores_gemma":[0.9994784,0.00002295634,0.00004579774,0.0003811512,0.00003348237,0.00003820751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[2.403102e-7,0.000374863,0.0000121672,0.00004533439,0.000008557297,0.000001806728,0.0009732952,0.05162094,0.1673677,0.7742002,0.002801301,0.002593531],"study_design_scores_gemma":[0.00006846273,0.000006783328,0.00001154306,0.000003137704,0.000002602204,0.000004109337,0.00001699545,0.9941679,0.00422744,0.0008376075,0.0005942305,0.00005917882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05142015,0.00004858704,0.9203432,0.00005470492,0.00002805897,0.00008932171,0.000001825692,0.00009517946,0.027919],"genre_scores_gemma":[0.9777659,0.000001619951,0.02161138,0.00002000627,0.00002269215,0.000003616371,9.010782e-7,0.000003420289,0.0005705176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.942547,"threshold_uncertainty_score":0.1952898,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01130383720653694,"gpt":0.2372261305907799,"spread":0.225922293384243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001785021,0.0001586279,0.0001968429,0.0001044473,0.00008803423,0.0001215341,0.0008196404,0.00006136089,0.0000460975],"category_scores_gemma":[0.00000808153,0.0001528984,0.00005500977,0.0005721316,0.00003986013,0.0001899109,0.0002819633,0.0001394869,0.0003153439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004563305,"about_ca_system_score_gemma":0.00002906342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001000823,"about_ca_topic_score_gemma":0.000006274109,"domain_scores_codex":[0.9988275,0.000005526987,0.0002884737,0.0003221866,0.0002308415,0.0003254541],"domain_scores_gemma":[0.9990579,0.00005683676,0.0000880938,0.0006943176,0.00001642873,0.00008645375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004798718,0.0003225172,0.0001559635,0.00008289998,0.00001888308,0.00003297899,0.002814621,0.001040837,0.0109942,0.9769382,0.001107186,0.006486865],"study_design_scores_gemma":[0.001500273,0.00004580319,0.001490895,0.00007653825,0.00002882324,0.0001076414,0.001014767,0.900949,0.007662522,0.06549572,0.02062737,0.001000618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1164273,0.00002381135,0.827311,0.0003443616,0.00003562608,0.000352103,0.000002500117,0.0002322854,0.05527094],"genre_scores_gemma":[0.6456874,0.0000198436,0.3534941,0.00009531773,0.00002723999,0.0001197094,0.00001251024,0.00001917914,0.0005247017],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9114425,"threshold_uncertainty_score":0.6235017,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04911065660645651,"gpt":0.2492169924499519,"spread":0.2001063358434954,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005678193,0.0001388983,0.0001597017,0.0002827889,0.000314245,0.0002467399,0.0003164573,0.00007705355,0.000006132672],"category_scores_gemma":[0.00009682737,0.0001614995,0.00005722748,0.0004386789,0.00003751602,0.001777026,0.00008886908,0.00008576303,0.00002177611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001243384,"about_ca_system_score_gemma":0.00005054677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001286718,"about_ca_topic_score_gemma":0.00005626202,"domain_scores_codex":[0.9985836,0.00007252161,0.0004378814,0.0004340913,0.00023921,0.0002327652],"domain_scores_gemma":[0.999016,0.0001038897,0.0002014366,0.0005123593,0.0001144714,0.00005178822],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002815948,0.00002673839,0.0002397043,0.00002896381,0.00000722067,5.149548e-7,0.0002178674,0.0007170233,0.1112208,0.6941029,0.0001440646,0.1932914],"study_design_scores_gemma":[0.0005627671,0.00002601537,0.006456984,0.00002021526,0.000009282038,0.00001820573,0.00002050887,0.7783034,0.1864247,0.02725211,0.000720595,0.0001851997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4444798,0.000003576414,0.5539037,0.0003412441,0.0006508048,0.0002413721,0.00000141893,0.000326846,0.00005120784],"genre_scores_gemma":[0.7736944,0.000006361703,0.2257396,0.00003039086,0.0002386735,0.0002209075,0.00005022844,0.000009976075,0.000009441221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7775863,"threshold_uncertainty_score":0.6585758,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01139168928661437,"gpt":0.2297975905710381,"spread":0.2184059012844237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003314002,0.0003572621,0.000339029,0.0004344365,0.0002472721,0.0004908928,0.002106865,0.0002100268,0.00001273522],"category_scores_gemma":[0.00002182756,0.0003322105,0.00007225796,0.0003557618,0.0004313112,0.0003647626,0.0008657096,0.0004547219,0.00004840837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009862894,"about_ca_system_score_gemma":0.0002278141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001211321,"about_ca_topic_score_gemma":0.0000243534,"domain_scores_codex":[0.9975377,0.0000118094,0.000313425,0.00120406,0.0005215569,0.0004115009],"domain_scores_gemma":[0.9982396,0.0001960817,0.0001510899,0.001173778,0.00008535734,0.0001540831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[6.188761e-7,0.0000136641,0.000008588389,0.00001139889,0.000002700513,0.00002524648,0.0002104404,0.0005882759,0.0002213557,0.04958481,0.00005844551,0.9492745],"study_design_scores_gemma":[0.0002696868,0.0001372827,0.0009359749,0.0002492587,0.00001037565,0.0002022635,8.570026e-8,0.5012532,0.001536795,0.4587021,0.03576862,0.0009343243],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009233407,0.001189056,0.9903407,0.001331217,0.000306284,0.0002541094,0.000003689069,0.0001900597,0.006292623],"genre_scores_gemma":[0.2275529,0.0003595935,0.7648344,0.00387293,0.0007222834,0.0000206333,0.00001879249,0.00005340189,0.002565057],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9483401,"threshold_uncertainty_score":0.999913,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1022592542495059,"gpt":0.3613943902709545,"spread":0.2591351360214487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002886349,0.0001120579,0.0003063461,0.0001026165,0.00005832558,0.0002489097,0.001585453,0.00003562062,0.000003608117],"category_scores_gemma":[0.0001376727,0.00009422036,0.00005181592,0.0004487236,0.000009552149,0.0004556679,0.0001609551,0.00005449261,0.0000232825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002547296,"about_ca_system_score_gemma":0.0001121867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003093728,"about_ca_topic_score_gemma":0.0001096198,"domain_scores_codex":[0.998873,0.00004983774,0.000417887,0.000224579,0.0002601876,0.0001745081],"domain_scores_gemma":[0.9982984,0.0003414149,0.0002146683,0.0008649928,0.0001474084,0.0001331086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000173744,0.01214658,0.007763904,0.05055472,0.001542593,0.0001208893,0.1117116,0.01460598,0.004962621,0.2233777,0.5509214,0.02211831],"study_design_scores_gemma":[0.014013,0.002193114,0.002992328,0.004767468,0.0008418987,0.00008187403,0.004312667,0.8229513,0.02864648,0.1143856,0.002625412,0.002188847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1261133,0.00006300964,0.8704861,0.000244232,0.0003153752,0.0018034,0.000002256989,0.0001175454,0.000854813],"genre_scores_gemma":[0.9944958,4.05302e-7,0.004296437,0.0001362649,0.00007088525,0.0002852225,0.000001524554,0.000008775405,0.0007046971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8683825,"threshold_uncertainty_score":0.3842195,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08559055733109319,"gpt":0.2555777888714224,"spread":0.1699872315403292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006315481,0.000065991,0.00008126956,0.00002799538,0.0001509183,0.0001096253,0.000441391,0.0000214896,0.00006790095],"category_scores_gemma":[0.00001630672,0.00006384816,0.00002198972,0.0001648138,0.00008164703,0.0001653109,0.0002792722,0.0000546866,0.0003434816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007197003,"about_ca_system_score_gemma":0.000006355067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001380455,"about_ca_topic_score_gemma":0.000003954424,"domain_scores_codex":[0.9994289,0.00001858681,0.00009724178,0.0002217608,0.00009882059,0.0001346354],"domain_scores_gemma":[0.9993179,0.00002872888,0.00002816518,0.0004928688,0.00001638926,0.0001159114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[2.86778e-7,0.00009216138,0.0003570051,0.00001059919,0.000006440133,0.00000360824,0.000381129,0.00000150416,0.0005458037,0.9412946,0.02147277,0.03583408],"study_design_scores_gemma":[0.0005398919,0.00003907099,0.08759648,0.000008931818,0.000005356927,0.00005407781,0.00001923851,0.6279266,0.0004714362,0.1594354,0.12354,0.0003634563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2592085,0.001548285,0.5448023,0.02138336,0.0003382421,0.0004779246,0.00002251994,0.002336478,0.1698824],"genre_scores_gemma":[0.9756145,0.00001926128,0.02363176,0.0004461097,0.0000329018,0.000008811556,0.000002489131,0.000003626038,0.0002404758],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7818592,"threshold_uncertainty_score":0.4414876,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009014872145899952,"gpt":0.2197660738144691,"spread":0.2107512016685691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008239467,0.0001609626,0.0002221643,0.00005728198,0.0004049012,0.0001602651,0.0005452831,0.0001046732,0.00000404064],"category_scores_gemma":[0.00006295447,0.0001337673,0.00008423302,0.0001674037,0.00009064701,0.0001801159,0.0002094043,0.00009456745,0.00002643609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000458644,"about_ca_system_score_gemma":0.00004785235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002408548,"about_ca_topic_score_gemma":0.000004856398,"domain_scores_codex":[0.9987378,0.0001015991,0.0002700889,0.0004202221,0.0001901746,0.0002801025],"domain_scores_gemma":[0.9989657,0.0002026388,0.00007191589,0.0005663023,0.00004017919,0.0001532494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001460697,0.00009710168,0.000004225405,0.00003916281,0.0000180495,0.000004085639,0.0002161072,0.0005211406,0.007200407,0.9866649,0.00008242737,0.005137783],"study_design_scores_gemma":[0.003716784,0.0005701535,0.0003848258,0.0002281597,0.00008561428,0.0002193992,0.0002012431,0.4519136,0.00404849,0.4482117,0.08938532,0.001034711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06958644,0.001014065,0.9269392,0.0006466911,0.0003129818,0.0004576317,0.00001781242,0.0003961842,0.0006289468],"genre_scores_gemma":[0.9958119,0.00001509638,0.00291948,0.00007295229,0.0001212214,0.0001369845,0.00002168761,0.00001333069,0.0008872852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9262255,"threshold_uncertainty_score":0.5454874,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02565413947899917,"gpt":0.2280014864183632,"spread":0.202347346939364,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001442086,0.0001151666,0.00010482,0.00002375004,0.0002852005,0.0000597487,0.0005527072,0.0000374618,0.00001824558],"category_scores_gemma":[0.000005117384,0.00007702319,0.00004661135,0.0002205212,0.00004930207,0.00007106415,0.00004709024,0.0001033026,0.000195301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001141862,"about_ca_system_score_gemma":0.00001723052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001152433,"about_ca_topic_score_gemma":3.539228e-7,"domain_scores_codex":[0.9991803,0.000007726646,0.0001999856,0.0002030619,0.0002454387,0.0001635204],"domain_scores_gemma":[0.999082,0.0002075117,0.00007900636,0.0005783577,0.00001354615,0.00003957303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[6.415901e-7,0.00006019271,4.454723e-7,0.00001468293,0.000007103737,5.724436e-7,0.002006789,0.00004564832,0.01408053,0.9779317,0.00323226,0.002619471],"study_design_scores_gemma":[0.0005577916,0.00004786776,0.00002132063,0.00004598889,0.00002632443,0.0000361369,0.0002906994,0.3766991,0.07058777,0.533222,0.01786672,0.0005982124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01324184,0.00003125687,0.9361393,0.001101216,0.00001385652,0.0004444387,0.000004810383,0.0002085177,0.04881478],"genre_scores_gemma":[0.8340566,0.00001658747,0.1651527,0.0002959222,0.00001802211,0.0001815096,0.0000192709,0.00001790454,0.0002415955],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8208147,"threshold_uncertainty_score":0.3140915,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01807832908499125,"gpt":0.2561319647095773,"spread":0.2380536356245861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008849594,0.00009626012,0.0001048975,0.00006680385,0.0001828546,0.0001364346,0.0002754882,0.00007857036,7.740866e-7],"category_scores_gemma":[0.000006290355,0.00008140591,0.00004059263,0.0001944271,0.000009799664,0.0005487436,0.00005039279,0.00004444919,0.00001400347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008766357,"about_ca_system_score_gemma":0.00003443524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003083497,"about_ca_topic_score_gemma":0.000002067807,"domain_scores_codex":[0.9993309,0.00001155863,0.0002251483,0.0001613847,0.0001064679,0.0001645532],"domain_scores_gemma":[0.9996325,0.000008587256,0.00007197877,0.0002071584,0.00003698994,0.00004275193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003498452,0.00009529115,0.000004039317,0.00001795825,0.00000142088,2.047657e-7,0.0006358171,0.0008873196,0.9752401,0.02139744,0.0008832299,0.0008337065],"study_design_scores_gemma":[0.0003378173,0.00008636965,0.0006424824,0.00003753165,0.000001766495,0.000014328,0.00009399824,0.8635733,0.1331064,0.00134356,0.0006212771,0.0001412412],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3178257,0.0002319338,0.6797413,0.0004781499,0.0001124666,0.001019945,0.000032385,0.0003483833,0.0002097026],"genre_scores_gemma":[0.9818838,0.000001532104,0.01763763,0.0001528611,0.00002987761,0.0001967443,0.0000490624,0.000002779369,0.0000456599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.862686,"threshold_uncertainty_score":0.3319637,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009571394653827168,"gpt":0.2712746619802195,"spread":0.2617032673263923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003379368,0.00008174601,0.0003712079,0.0000289625,0.00003202858,0.00001274087,0.0006643644,0.00000477066,0.000001091445],"category_scores_gemma":[0.00001390767,0.00005155757,0.0002986993,0.001786189,0.00007757742,0.00005863929,0.0001553089,0.00007664702,0.000004850531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001656755,"about_ca_system_score_gemma":0.000009263858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004130283,"about_ca_topic_score_gemma":0.000004249117,"domain_scores_codex":[0.9990106,0.00007490906,0.0002909296,0.0001791307,0.0002733228,0.000171137],"domain_scores_gemma":[0.998795,0.0001766548,0.0002278453,0.0007262758,0.00003034325,0.00004392951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001285676,0.0006713832,0.007753241,0.00430723,0.002626177,0.00001291798,0.001288071,0.1877933,0.1706591,0.5882694,0.01260403,0.02400234],"study_design_scores_gemma":[0.0001116558,0.00002123292,0.03784544,0.0009469971,0.001071685,0.000001746502,0.000004461444,0.9518825,0.0009685256,0.0008240656,0.00605556,0.000266115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.179547,0.002895332,0.8124256,0.004565459,0.00007261331,0.0003331907,0.00000831813,0.00002877666,0.0001236676],"genre_scores_gemma":[0.9980251,0.0001684369,0.0007602283,0.0009895444,0.00003009275,0.000008626443,0.000003766124,0.000003961644,0.00001028571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.818478,"threshold_uncertainty_score":0.2102457,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04060905330121274,"gpt":0.3770059370644711,"spread":0.3363968837632584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003931217,0.00007230768,0.0001328514,0.0000600405,0.0001086031,0.00008995183,0.0003612376,0.00002324204,0.000003068837],"category_scores_gemma":[0.00003114912,0.00006899819,0.0001257957,0.0002601312,0.00002348232,0.0005311792,0.00004816891,0.000091293,0.000006743282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005090851,"about_ca_system_score_gemma":0.00007485539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.380616e-7,"about_ca_topic_score_gemma":5.299162e-8,"domain_scores_codex":[0.9992592,0.00004416565,0.0003116588,0.0001056946,0.000175078,0.0001041757],"domain_scores_gemma":[0.9987442,0.0003146984,0.0003129452,0.0001147848,0.0004587979,0.0000545079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001139868,0.0001531132,0.00005468,0.00001108006,0.0000476573,0.000001461736,0.0002487774,0.3398112,0.004468766,0.3634254,0.001428942,0.2903375],"study_design_scores_gemma":[0.0002762606,0.0000421649,0.0004748472,0.00001120653,0.000009258102,0.00006570916,0.000009261543,0.6207116,0.002109727,0.368899,0.007330778,0.00006018212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005735321,0.0001480338,0.9925386,0.001063573,0.0002540443,0.00009161622,0.00000144199,0.0000269786,0.0001404334],"genre_scores_gemma":[0.462513,0.000004788079,0.5371837,0.00009017333,0.0001724344,0.000002915222,0.000003032262,0.000004308788,0.00002564952],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4567777,"threshold_uncertainty_score":0.2813665,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008214123691781969,"gpt":0.2248132115146015,"spread":0.2165990878228196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007176524,0.00008814817,0.00008558253,0.00006657069,0.00008852328,0.0001330822,0.0003236803,0.00003259162,0.00003025164],"category_scores_gemma":[0.000007093305,0.00007130537,0.00002506785,0.0002905428,0.00002630864,0.0002308326,0.0001114011,0.0000769765,0.0001902561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001899226,"about_ca_system_score_gemma":0.00001929356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000286312,"about_ca_topic_score_gemma":0.00005499386,"domain_scores_codex":[0.9992714,0.00001348238,0.00014319,0.0002886791,0.0001180705,0.0001652133],"domain_scores_gemma":[0.9993118,0.0001021638,0.00003108358,0.0004549772,0.00002413051,0.00007581788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.471868e-7,0.00008840514,0.005420859,0.00001231642,0.000006016118,9.993581e-7,0.0003380357,0.0002019128,0.002194231,0.9670902,0.001438749,0.02320736],"study_design_scores_gemma":[0.001021863,0.00008983343,0.2437187,0.00004264307,0.000007413089,0.00000779422,0.0001656561,0.5405822,0.001611966,0.1659971,0.04602502,0.0007297225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04984931,0.00008028015,0.928842,0.002023041,0.00002472752,0.001122186,0.000002860126,0.0002795116,0.01777605],"genre_scores_gemma":[0.976545,0.00002034,0.02084711,0.0003776258,0.00001133057,0.0009009123,0.000006905928,0.000006094275,0.0012847],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9266956,"threshold_uncertainty_score":0.2907749,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trent University","funders":"","keywords":"Abelian group; Mathematics; Combinatorics; Haar measure; Measure (data warehouse); Endomorphism; Semigroup; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01481682317553256,"gpt":0.2132049150398816,"spread":0.1983880918643491,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006990712,0.0001501288,0.0002112833,0.00005521336,0.0002355743,0.0002026402,0.0005199135,0.0000965787,0.00002203593],"category_scores_gemma":[0.00006778568,0.0001249443,0.00007848071,0.0001587173,0.0000794238,0.0001678307,0.0001247795,0.0000880811,0.00007607287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000236986,"about_ca_system_score_gemma":0.000008730476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008039741,"about_ca_topic_score_gemma":0.000001699445,"domain_scores_codex":[0.9987323,0.0001633006,0.000257462,0.0003979917,0.0001805259,0.0002684332],"domain_scores_gemma":[0.9987919,0.0003891906,0.00006749743,0.0005704648,0.00003499345,0.0001459456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007576433,0.00008891407,0.00001171068,0.00004686021,0.00001941239,0.000004307621,0.000175993,0.00007597396,0.003521718,0.9764076,0.0008990622,0.01874086],"study_design_scores_gemma":[0.0005113112,0.00007531945,0.00007756658,0.00003372131,0.00001958073,0.00004773825,0.00003686077,0.9238662,0.0002621268,0.0188172,0.05600763,0.0002447282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01852169,0.002312105,0.9755216,0.0005049387,0.0003226476,0.0004454211,0.00001812066,0.0004184156,0.001935022],"genre_scores_gemma":[0.9951257,0.00003451633,0.001487408,0.00006844586,0.0001243693,0.0001322964,0.0000116268,0.00001285369,0.003002763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.976604,"threshold_uncertainty_score":0.5095081,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008565788645505834,"gpt":0.2259731974361792,"spread":0.2174074087906734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002323597,0.0002014464,0.0003324657,0.00009140652,0.00009822677,0.0002077525,0.001230783,0.00009171013,0.0003747059],"category_scores_gemma":[0.00003383481,0.0001678005,0.00010365,0.0004465327,0.0001214137,0.0004326969,0.0003931825,0.0001492488,0.0007919786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000215057,"about_ca_system_score_gemma":0.00005715807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007770383,"about_ca_topic_score_gemma":0.000002742705,"domain_scores_codex":[0.9983048,0.00002759917,0.0004350577,0.0004077404,0.0004838268,0.0003409218],"domain_scores_gemma":[0.9980056,0.0002147054,0.0002497731,0.001282066,0.00009028097,0.0001575401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001151007,0.0002574388,0.0001330859,0.0001150147,0.00003203739,0.000002139878,0.001053622,0.000002252621,0.07414699,0.9152191,0.002694814,0.006342388],"study_design_scores_gemma":[0.0009458889,0.0001364996,0.009560047,0.0001331409,0.00005463776,0.00009641759,0.0002995154,0.05435909,0.09531564,0.8189477,0.01919243,0.0009589492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3960977,0.00006799898,0.5886818,0.00365566,0.00005189771,0.001197994,0.000008872334,0.0004061143,0.009831953],"genre_scores_gemma":[0.9457738,0.00001095904,0.05346878,0.0001062052,0.00002659779,0.0003609155,0.000003452558,0.00001594099,0.0002333615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5496761,"threshold_uncertainty_score":0.999986,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01497642273216219,"gpt":0.2539691154864794,"spread":0.2389926927543172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003122953,0.0001607463,0.0001942394,0.000185153,0.0002670953,0.0002643676,0.002026351,0.0000460078,0.00003469787],"category_scores_gemma":[0.00007065726,0.0001455404,0.00007455895,0.001932414,0.001199433,0.0004801208,0.001032642,0.0001937322,0.0002339257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007134198,"about_ca_system_score_gemma":0.00009987742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000542948,"about_ca_topic_score_gemma":0.000002568994,"domain_scores_codex":[0.9973122,0.00006034092,0.0004204486,0.0006698809,0.0008059995,0.0007310763],"domain_scores_gemma":[0.9980667,0.0003700398,0.00006520252,0.001100638,0.00009927364,0.0002981377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002746215,0.0001940347,0.0001016269,0.000004926227,0.000001966668,0.00002615442,0.0001779018,0.0002641824,0.02225475,0.9637921,0.00003230244,0.0131473],"study_design_scores_gemma":[0.000273997,0.0000684183,0.003490935,0.00002529529,0.000003329021,0.00002427172,0.000003141919,0.8525968,0.06432154,0.07886674,0.0001182959,0.0002072547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.29637,0.00001973764,0.7009996,0.001075918,0.0001447164,0.0001508443,5.097066e-7,0.0002115957,0.001027175],"genre_scores_gemma":[0.7729858,7.484303e-7,0.2262852,0.0006779755,0.0000333265,0.000005066115,9.956698e-7,0.000006121086,0.000004750199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8849254,"threshold_uncertainty_score":0.5934964,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0147556519904048,"gpt":0.2299582503591558,"spread":0.215202598368751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004331422,0.0001326461,0.0001389406,0.00006360465,0.0003466552,0.0003100884,0.001062953,0.00005677827,0.00001335742],"category_scores_gemma":[0.00002964593,0.00009821973,0.00005904919,0.000502263,0.00004275293,0.0003747719,0.0007625445,0.0004501937,0.000211614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005127743,"about_ca_system_score_gemma":0.00004532891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002607843,"about_ca_topic_score_gemma":0.00001521518,"domain_scores_codex":[0.9985757,0.00008502728,0.0002905834,0.0003724446,0.0003084924,0.0003677068],"domain_scores_gemma":[0.9989909,0.0002383408,0.0001016839,0.00053914,0.00007679824,0.00005315507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004489995,0.0006828651,0.006375078,0.0001399358,0.00007928471,0.00004221001,0.004034369,0.007744664,0.1982909,0.241999,0.01218227,0.528425],"study_design_scores_gemma":[0.000173867,0.000007280941,0.02040342,0.00003810244,0.00000219203,0.00001188185,0.00001403829,0.9711572,0.002065012,0.005363146,0.0006096186,0.0001542795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8918076,0.0007718662,0.09610461,0.007780883,0.0004285957,0.0008709482,7.630784e-7,0.0006690183,0.001565685],"genre_scores_gemma":[0.931075,9.067853e-7,0.06837104,0.0003646369,0.00009258995,0.00001327532,0.000006097946,0.000007163023,0.00006923264],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9634125,"threshold_uncertainty_score":0.4005284,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01459313141946253,"gpt":0.1917996756849538,"spread":0.1772065442654912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005902108,0.0001988468,0.0003074227,0.0001828158,0.0001353934,0.000067211,0.0008927994,0.0001674575,6.978221e-7],"category_scores_gemma":[0.00001232714,0.0002281989,0.00006369187,0.00004593984,0.000128411,0.0001060203,0.0006799548,0.0001631913,0.000007004069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001056785,"about_ca_system_score_gemma":0.0003161308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001998767,"about_ca_topic_score_gemma":0.000003717864,"domain_scores_codex":[0.9989572,0.00003982495,0.0001713317,0.0004736412,0.0001722833,0.0001857738],"domain_scores_gemma":[0.9987139,0.00008943471,0.0001675664,0.0006298049,0.0002188355,0.0001804886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000008559861,0.00001999604,0.000001890315,0.0003065623,0.00005330045,0.00002157685,0.0001178037,7.572085e-7,0.0001524754,0.9754121,0.02319184,0.0007131351],"study_design_scores_gemma":[0.000342647,0.00008683259,0.00005590443,0.0002629189,0.0001453157,0.0000561851,0.00004315512,0.002616694,0.0005783024,0.0000429548,0.9953122,0.0004568705],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0004070322,0.0002160359,0.1074441,0.00002190689,0.0001642102,0.0007103763,0.0002413486,0.0002061484,0.8905888],"genre_scores_gemma":[0.006196045,0.00003578845,0.00183543,0.00001498936,0.00004285673,0.000005845478,0.00003278632,0.0000164501,0.9918198],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9753692,"threshold_uncertainty_score":0.9305683,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01029249049498029,"gpt":0.2191020108133134,"spread":0.2088095203183331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009969883,0.0001792618,0.0001904874,0.0002742964,0.0002548249,0.00006478601,0.0004762285,0.00008702497,0.0001016848],"category_scores_gemma":[0.000003051151,0.0001847059,0.0001323377,0.0006919616,0.00005896604,0.0007266906,0.000005980163,0.0001430017,0.0004336346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007506346,"about_ca_system_score_gemma":0.00008945036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008632411,"about_ca_topic_score_gemma":0.000003367991,"domain_scores_codex":[0.9985216,0.0000818096,0.0004000317,0.0003878156,0.0003810235,0.0002277517],"domain_scores_gemma":[0.9988784,0.0001670655,0.0001466872,0.0004874567,0.0002243539,0.00009608119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001861332,0.001904605,0.0000574136,0.0001394847,0.000138461,0.00000471509,0.000816108,0.8194709,0.04961194,0.01061535,0.003986332,0.1132361],"study_design_scores_gemma":[0.0004480432,0.00009510502,0.00374174,0.00002740261,0.00001897594,0.00001298462,0.00003043577,0.9751506,0.0156161,0.004502698,0.0001535164,0.0002023897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07025805,0.00005297311,0.9275605,0.0005861943,0.0003482598,0.0004232858,0.00001618144,0.0004062642,0.0003482866],"genre_scores_gemma":[0.9538402,0.000009800497,0.04574039,0.00004502996,0.00002565112,0.0001235975,0.00003282508,0.00001425097,0.0001682353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8835822,"threshold_uncertainty_score":0.7532088,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01942626732019955,"gpt":0.2270055634178707,"spread":0.2075792960976711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004452596,0.0004395813,0.0003869499,0.0007541896,0.000181741,0.000409774,0.002759063,0.0003190025,0.00001222336],"category_scores_gemma":[0.00002057855,0.0004400909,0.000116482,0.0006987456,0.0003315527,0.0005514739,0.0009388422,0.0007362481,0.00006350206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004682819,"about_ca_system_score_gemma":0.0009260213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005525178,"about_ca_topic_score_gemma":0.0001533266,"domain_scores_codex":[0.9968528,0.00001432442,0.0005231436,0.001427214,0.0005853265,0.0005971499],"domain_scores_gemma":[0.9979699,0.000146547,0.0002215332,0.001403076,0.0001186606,0.0001402796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004918963,0.0001619332,0.00001669132,0.00009148908,0.000005185847,0.00008077603,0.001557587,0.3885744,0.006130065,0.3190543,0.0000173321,0.2843053],"study_design_scores_gemma":[0.0002382861,0.00003354612,0.00002522233,0.0001050189,0.000002667066,0.00001354397,6.331747e-8,0.654964,0.002086656,0.3421063,0.00007172812,0.0003529477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002023715,0.0002106812,0.9902229,0.0005538806,0.0003501476,0.0004421238,0.000007759598,0.0001861209,0.007824006],"genre_scores_gemma":[0.4401536,0.00004429193,0.5585133,0.0009007868,0.0001077933,0.00003070199,0.00001649078,0.00003018835,0.0002029087],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4399512,"threshold_uncertainty_score":0.9998051,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Algorithm; Type (biology); Annotation; Mathematics; Artificial intelligence; Computer science; Geology; Paleontology","retraction":null,"screen_n_in":null,"score":{"opus":0.01592011194873066,"gpt":0.2581394422465884,"spread":0.2422193302978577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002467319,0.00008045979,0.000279916,0.00002683372,0.00005350619,0.000002923881,0.0004485217,0.00003190861,0.00001052637],"category_scores_gemma":[0.00005029025,0.00005945616,0.0002637166,0.0007134427,0.000585063,0.00006383003,0.00002930273,0.00009083658,0.000002319201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001905199,"about_ca_system_score_gemma":0.00007073076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003959992,"about_ca_topic_score_gemma":0.000002013387,"domain_scores_codex":[0.9990498,0.00006424234,0.0003855951,0.00014236,0.0002645029,0.00009349774],"domain_scores_gemma":[0.9982182,0.0004901382,0.0004849178,0.0005881622,0.0001913424,0.00002724552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004207064,0.002793832,0.0007871868,0.0008197174,0.0003748831,3.877226e-8,0.009255624,0.005930398,0.489465,0.4658273,0.0001035563,0.02460034],"study_design_scores_gemma":[0.0002074268,0.0001586467,0.01721376,0.00006343528,0.0000779051,0.000001471913,0.0004701141,0.933546,0.03273238,0.015392,0.00003267225,0.0001041706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2610978,0.000004881913,0.7383564,0.0002031148,0.00001641318,0.0001461509,0.00001287895,0.00001603385,0.0001462713],"genre_scores_gemma":[0.8650865,0.000006933261,0.1348533,0.00001186884,0.00000272327,0.000008781375,0.00000133962,0.000005458806,0.00002307952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9276156,"threshold_uncertainty_score":0.2424552,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Cellular automaton; Automaton; Computer science; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04308627970307399,"gpt":0.2541731670022407,"spread":0.2110868872991667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004052241,0.0001208824,0.0001392144,0.00005662876,0.0001688672,0.0003527802,0.0007131073,0.00005484256,0.000006156523],"category_scores_gemma":[0.00003404056,0.0001079342,0.00005913725,0.0002368323,0.00001537648,0.0002448672,0.0001062891,0.00004523309,0.0001553208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006697318,"about_ca_system_score_gemma":0.0002127192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001143318,"about_ca_topic_score_gemma":0.00000921346,"domain_scores_codex":[0.9988619,0.00003149593,0.0002308812,0.0003552806,0.0002536889,0.0002667446],"domain_scores_gemma":[0.9987186,0.000084501,0.000076613,0.0007932463,0.0001593925,0.0001676936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000538404,0.0003937767,0.0004944777,0.0001895868,0.00004749468,0.00001647212,0.0006027683,0.08870967,0.08503187,0.6858147,0.1289641,0.00972966],"study_design_scores_gemma":[0.0004198776,0.00003339824,0.000005477128,0.000006327002,0.000005104886,0.000002941465,0.00005284146,0.9598438,0.00716611,0.0001841766,0.03212822,0.0001517317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00771835,0.0001036056,0.9871708,0.0004205081,0.0003298452,0.000460029,0.000008188089,0.0006352464,0.003153459],"genre_scores_gemma":[0.7795973,4.694977e-7,0.2159561,0.0002184472,0.0001433169,0.0002524764,0.00005388395,0.00001705822,0.003760913],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8711341,"threshold_uncertainty_score":0.4401427,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04692854746229932,"gpt":0.3016999441893789,"spread":0.2547713967270796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003584335,0.0001630896,0.0001262212,0.0001693299,0.000447089,0.0003319682,0.0002351942,0.00007350681,0.0001382873],"category_scores_gemma":[0.0001194297,0.0001672409,0.00005707307,0.0002781376,0.00003356578,0.001336806,0.00007812934,0.0001690851,0.0006015369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004458322,"about_ca_system_score_gemma":0.00006512269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002377206,"about_ca_topic_score_gemma":0.000007036776,"domain_scores_codex":[0.9986247,0.0001561909,0.0003049821,0.0004249116,0.0002634938,0.0002257439],"domain_scores_gemma":[0.9972156,0.001621609,0.0001708975,0.0005105147,0.0003009114,0.0001804755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000168659,0.00008427942,0.000005378274,0.000003383602,0.00001824155,9.257056e-7,0.0006206933,0.927739,0.0003449322,0.05768396,0.00003070863,0.01345163],"study_design_scores_gemma":[0.0002629272,0.0000375046,0.000122618,0.000009651438,0.00003600239,0.000001946901,0.000168353,0.9717276,0.0002684442,0.02111726,0.006053516,0.0001941608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01738048,0.00003952868,0.9785926,0.00162561,0.0001885244,0.0006085266,0.000008929591,0.0002011481,0.001354621],"genre_scores_gemma":[0.9452565,0.000005336512,0.05328172,0.00083373,0.00007645533,0.00002939373,0.00002367613,0.00001604106,0.0004771829],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.927876,"threshold_uncertainty_score":0.773174,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01348442618563141,"gpt":0.2528001034624525,"spread":0.239315677276821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006974227,0.00006907737,0.0000547262,0.00005818103,0.00008723699,0.0001049265,0.0005279994,0.00003834695,0.000007401793],"category_scores_gemma":[0.000008972002,0.00006799644,0.00003934048,0.0004427717,0.00003531696,0.0002468014,0.0001239122,0.00009233593,0.0001272118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001834322,"about_ca_system_score_gemma":0.00002628827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002075754,"about_ca_topic_score_gemma":0.000009676718,"domain_scores_codex":[0.9994406,0.00001001704,0.0001073124,0.0002018028,0.0001144151,0.0001258519],"domain_scores_gemma":[0.9994629,0.00001064955,0.00003499995,0.0004107374,0.00003523354,0.00004546715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[4.566802e-7,0.00003863984,0.00006966853,0.000002919227,0.000004845784,0.000001494117,0.000304859,0.0005481657,0.01318271,0.9840513,0.00009936714,0.001695599],"study_design_scores_gemma":[0.001236356,0.0001578365,0.006100349,0.00007260867,0.00001711163,0.00008323343,0.00007868811,0.08184107,0.3536077,0.5000007,0.05599241,0.0008120438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05757531,0.00007771218,0.9387308,0.001574979,0.000129332,0.00007201735,0.000001145693,0.0002534271,0.001585279],"genre_scores_gemma":[0.9795474,0.0000139929,0.0201181,0.0001839997,0.00001721925,0.00001065476,0.000003333477,0.000005367176,0.00009995392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9219721,"threshold_uncertainty_score":0.2772815,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01389813015122753,"gpt":0.2565077526960917,"spread":0.2426096225448641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770954,0.0001677856,0.0001511429,0.0001709098,0.0005242882,0.0003956453,0.002058661,0.00005533973,0.00000613056],"category_scores_gemma":[0.0003371952,0.000120434,0.00004020416,0.001342818,0.001005074,0.0003265055,0.0003580879,0.0004669588,0.00004831221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001014935,"about_ca_system_score_gemma":0.0001378879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001910676,"about_ca_topic_score_gemma":8.717945e-7,"domain_scores_codex":[0.9978059,0.0001315971,0.0002530274,0.0006608418,0.0004705994,0.0006780417],"domain_scores_gemma":[0.9964415,0.002316688,0.00005651656,0.001025211,0.00003304986,0.0001270763],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001240856,0.00003435777,0.0006320492,0.000001111307,9.643858e-7,0.000002053787,0.0001347071,0.00003585869,0.0002322039,0.974839,0.00001160924,0.02407487],"study_design_scores_gemma":[0.0001262056,0.0001890823,0.0310079,0.00001743332,0.000002461637,0.00000777848,0.000001062811,0.1424621,0.002388806,0.8236105,0.00004299586,0.0001437119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2539011,0.00006048083,0.7341769,0.01057491,0.00004175126,0.0001977626,5.886778e-7,0.0001415922,0.0009049154],"genre_scores_gemma":[0.9898148,0.000003504217,0.009288006,0.0008174228,0.00005706029,0.00000840011,0.000001376462,0.000005148681,0.000004265138],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7359138,"threshold_uncertainty_score":0.4911158,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00975577503316551,"gpt":0.2228204489104135,"spread":0.213064673877248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003540569,0.000147826,0.0001418831,0.0005536646,0.0002775824,0.0001179013,0.0004235181,0.0001061003,0.0001687957],"category_scores_gemma":[0.0000149556,0.0001410571,0.0001156277,0.0006018213,0.000291755,0.001264538,0.000003292894,0.0003008861,0.0001051827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004443265,"about_ca_system_score_gemma":0.0001004722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001765719,"about_ca_topic_score_gemma":0.000002985202,"domain_scores_codex":[0.998937,0.00004150292,0.0004181401,0.0001400529,0.000270936,0.0001924432],"domain_scores_gemma":[0.9988232,0.0001769935,0.0002056224,0.0005620649,0.0001531673,0.00007893665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008779694,0.0005777592,0.000004688437,0.00008150105,0.0000989005,8.184876e-7,0.004970982,0.004750276,0.04405006,0.6992288,0.00009022531,0.2460582],"study_design_scores_gemma":[0.00225904,0.0005043175,0.0002178627,0.00009838615,0.00008027077,0.00007618968,0.001297005,0.3592678,0.6144636,0.01752284,0.003350617,0.0008620922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1545192,0.000002105758,0.8398333,0.00003259553,0.001080035,0.0002177586,0.00005626733,0.000128022,0.004130776],"genre_scores_gemma":[0.9944452,0.000003272813,0.005187905,0.0002077013,0.00001523839,0.00002821475,0.000005869923,0.000006885136,0.00009968794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8399261,"threshold_uncertainty_score":0.5752142,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007394260334922949,"gpt":0.2047678837767302,"spread":0.1973736234418073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000475915,0.00008068058,0.0001244888,0.00005822417,0.0001366624,0.00006737373,0.001189833,0.00002879483,0.00001783064],"category_scores_gemma":[0.00002113673,0.00005506681,0.00009472738,0.0004509603,0.00003323433,0.0002145924,0.00008137635,0.000409994,0.00006023048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00011575,"about_ca_system_score_gemma":0.0000923193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001837599,"about_ca_topic_score_gemma":5.123129e-7,"domain_scores_codex":[0.9990533,0.00003067226,0.000235056,0.00009011397,0.0002816324,0.0003092082],"domain_scores_gemma":[0.9991162,0.00008916057,0.000231995,0.0003548814,0.0001553145,0.00005243035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001073369,0.00009002502,0.00002648904,0.000001573371,0.00002273563,0.000005121634,0.0004149018,0.00001361927,0.0004858235,0.9950328,0.00164713,0.002258705],"study_design_scores_gemma":[0.0008253382,0.0005030223,0.000446747,0.00002057313,0.00004140607,0.0006327977,0.00006586184,0.03448617,0.009392148,0.885655,0.06772346,0.0002074288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1430117,0.005105629,0.8325972,0.008519594,0.000556968,0.0001799617,3.62689e-7,0.00006612828,0.009962452],"genre_scores_gemma":[0.9984064,0.0004943022,0.00007733554,0.0001250234,0.0000545347,0.00000204097,1.086122e-7,0.000006091839,0.0008342173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8553947,"threshold_uncertainty_score":0.224556,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02916209321312204,"gpt":0.2340792648274338,"spread":0.2049171716143117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003543826,0.000384442,0.000425186,0.0006143273,0.0001885177,0.0001872976,0.002811628,0.0002156591,0.00001843319],"category_scores_gemma":[0.0000198384,0.0003815921,0.0001314051,0.0006182826,0.0005541156,0.0003094843,0.001135578,0.0003174214,0.00003654992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003588363,"about_ca_system_score_gemma":0.001587194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002583804,"about_ca_topic_score_gemma":0.00003853866,"domain_scores_codex":[0.997039,0.000005683596,0.0005853506,0.001135082,0.0007932307,0.0004416392],"domain_scores_gemma":[0.9983903,0.00009935267,0.0002713713,0.0009415363,0.0001685428,0.0001289472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003428128,0.0001231127,0.000007675984,0.00004310385,0.0000159469,0.00001409595,0.0009328277,0.3688594,0.05184164,0.2372732,0.000004022103,0.3408816],"study_design_scores_gemma":[0.0001509144,0.00003098142,0.0000276192,0.0001186648,0.000007103373,0.00003563988,1.263789e-7,0.8189138,0.02541966,0.1547735,0.0000901426,0.0004318741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007505323,0.000101008,0.9968786,0.0002466496,0.0002621206,0.000315776,0.00002369465,0.0001075426,0.001314075],"genre_scores_gemma":[0.2364946,0.00001011542,0.7629579,0.000300133,0.00008305617,0.00001237224,0.000007838932,0.00002318597,0.0001108159],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4500544,"threshold_uncertainty_score":0.9998636,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03083041699549339,"gpt":0.285843586839928,"spread":0.2550131698444346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001107982,0.00007126602,0.0000909079,0.00004199743,0.0001299946,0.0001340448,0.0002597921,0.00003731311,0.000008496161],"category_scores_gemma":[0.000009565963,0.00007132749,0.0000422202,0.0001299403,0.000009915023,0.0002478929,0.0000370535,0.00002860505,0.0001329342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003056229,"about_ca_system_score_gemma":0.00001722934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000010033,"about_ca_topic_score_gemma":0.000001866965,"domain_scores_codex":[0.999354,0.00001459183,0.0001826591,0.0001930885,0.0001141974,0.0001414847],"domain_scores_gemma":[0.9993504,0.0001230317,0.00007910171,0.0003202304,0.00008619898,0.00004098023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004372015,0.0001080205,0.000142232,0.00003905547,0.000008312435,4.04268e-7,0.0005089927,0.8417686,0.01084382,0.09729046,0.006488151,0.04279761],"study_design_scores_gemma":[0.0002535196,0.00001274242,0.0004773503,0.000002611415,0.000003193303,7.419138e-7,0.000009163455,0.8058375,0.0004785797,0.0002428755,0.1926067,0.00007509732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01038194,0.00008921152,0.9858485,0.0003558925,0.0001060213,0.0004778681,0.000007373411,0.000234933,0.0024983],"genre_scores_gemma":[0.9728908,8.161086e-7,0.02583198,0.00009658553,0.0001534937,0.00004825162,0.00004628589,0.000006874706,0.0009249288],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9625089,"threshold_uncertainty_score":0.2908651,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009629854834946269,"gpt":0.233971299432128,"spread":0.2243414445971817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000296896,0.0001778545,0.0002889859,0.00005428881,0.0002066297,0.0003625984,0.0005018801,0.00008717048,0.000001685283],"category_scores_gemma":[0.00002808366,0.000146021,0.00009019217,0.0001500725,0.00006399772,0.0002740734,0.0001371558,0.00008503027,0.00001681831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004449331,"about_ca_system_score_gemma":0.00004059251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009963318,"about_ca_topic_score_gemma":0.00002276158,"domain_scores_codex":[0.9986026,0.00006994685,0.0003285821,0.0004669572,0.0002130404,0.0003188673],"domain_scores_gemma":[0.9990876,0.0001190932,0.0001046763,0.0004600683,0.0000772263,0.0001513615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001559939,0.0001416022,0.0001531527,0.00009166877,0.0001100435,0.00001248653,0.001827483,0.0002188496,0.02978021,0.886791,0.0009023229,0.07995556],"study_design_scores_gemma":[0.000590254,0.00007231178,0.0002274123,0.00003427184,0.00002390225,0.00002879941,0.0001690922,0.9597806,0.0006334815,0.001045584,0.03711548,0.0002787486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03694679,0.000807207,0.9583225,0.001493633,0.0001276849,0.0007298872,0.00005334755,0.0003016377,0.001217316],"genre_scores_gemma":[0.9928103,0.00001236998,0.00574282,0.00008537382,0.000128266,0.0002482368,0.000046422,0.00001524277,0.0009109773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9595618,"threshold_uncertainty_score":0.5954565,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Enumeration; Combinatorics; Mathematics; Planar; Planar graph; Discrete mathematics; Computer science; Graph; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.05856235887585335,"gpt":0.268270643138712,"spread":0.2097082842628586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001173323,0.00006567979,0.0001295976,0.0000791793,0.00004306697,0.00001803394,0.0004404023,0.00004280633,0.00001525519],"category_scores_gemma":[0.00002175991,0.00006804832,0.00005443069,0.0004863619,0.00002428395,0.0001816224,0.00004526395,0.00005182514,0.00003256934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004150811,"about_ca_system_score_gemma":0.00001168955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001659197,"about_ca_topic_score_gemma":7.91475e-7,"domain_scores_codex":[0.9992882,0.00002531696,0.0002313673,0.0001303007,0.0002104241,0.0001143774],"domain_scores_gemma":[0.9991603,0.00004859197,0.0001459231,0.0004422123,0.0001604947,0.00004251018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[7.644409e-7,0.0002741149,0.0002817171,0.00002308984,0.000012825,0.000001557144,0.0002844565,0.00002095578,0.004029445,0.9721068,0.01651937,0.006444879],"study_design_scores_gemma":[0.000732995,0.0003560266,0.005151231,0.00005215529,0.00001702398,0.00001141111,0.00002390167,0.1093825,0.408716,0.3984522,0.0767006,0.0004039892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4306333,0.00502476,0.5162236,0.01258645,0.0008891002,0.0007068157,0.00005281167,0.0004447823,0.03343834],"genre_scores_gemma":[0.998757,0.0001315722,0.0007325241,0.00008019078,0.000008165517,0.000004967129,0.000007938747,0.000004183286,0.0002734348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5736547,"threshold_uncertainty_score":0.277493,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02080407555336356,"gpt":0.2511358208580585,"spread":0.230331745304695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003025437,0.0002127607,0.0002286352,0.00003419268,0.0007825118,0.0009429589,0.0009277454,0.0000389578,0.000001378824],"category_scores_gemma":[0.00003865413,0.0001811802,0.00004952421,0.0009648726,0.0002290643,0.001696353,0.0007781407,0.0001280872,0.00001617648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003964055,"about_ca_system_score_gemma":0.00009473818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001896488,"about_ca_topic_score_gemma":0.0001218236,"domain_scores_codex":[0.9981239,0.00008045632,0.0003359677,0.0007730488,0.0003650003,0.0003215853],"domain_scores_gemma":[0.9989413,0.00003884636,0.0001210196,0.0006044459,0.00004750389,0.0002468697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005007302,0.001320469,0.02172034,0.0008524359,0.0002714666,0.01671656,0.3367159,0.06546184,0.03177051,0.4486892,0.00214663,0.07428458],"study_design_scores_gemma":[0.0001698604,0.0001948794,0.00005538276,0.0000264646,0.00001539433,0.0007899291,0.01711776,0.9792492,0.0003034062,0.0006120231,0.001201044,0.0002646878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5132027,0.0003135671,0.4843048,0.001122503,0.0001476113,0.0003665693,0.000009082149,0.0003441398,0.0001890156],"genre_scores_gemma":[0.9784557,0.00001095462,0.02126138,0.0001023144,0.00007534959,0.00005983312,0.000003782113,0.000007848169,0.00002283012],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9137873,"threshold_uncertainty_score":0.9092975,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01859558278348932,"gpt":0.2532387237377519,"spread":0.2346431409542626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001590975,0.0001445536,0.0001179089,0.0001072665,0.000951018,0.0006316478,0.002437709,0.00005650656,0.00001954028],"category_scores_gemma":[0.0002609673,0.00009549423,0.00003923612,0.0008144914,0.002537272,0.0003360305,0.000903043,0.0004475868,0.0001950625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000012341,"about_ca_system_score_gemma":0.00006433871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001965428,"about_ca_topic_score_gemma":5.055819e-7,"domain_scores_codex":[0.9982714,0.00007625537,0.0001971946,0.0005823195,0.0005097264,0.0003631002],"domain_scores_gemma":[0.9963617,0.001896702,0.00005427606,0.001403894,0.00005711519,0.0002262564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[4.898865e-7,0.00001919137,0.0007676568,0.00000173141,0.000001099997,0.000001587645,0.0001392445,0.000002370562,0.001251755,0.9908249,0.00008332564,0.006906698],"study_design_scores_gemma":[0.0001003098,0.00005814288,0.0418924,0.000009395039,0.000004306424,0.00001380997,0.000002511971,0.1380771,0.003461509,0.8159454,0.0002724038,0.0001627532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4106473,0.000003650993,0.5798832,0.005491952,0.0001628082,0.0001432824,0.000001588831,0.0001977317,0.003468511],"genre_scores_gemma":[0.967485,3.598439e-7,0.03189572,0.0004740511,0.0001104551,0.00001016264,0.000001279605,0.000006483529,0.00001646588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5568377,"threshold_uncertainty_score":0.9348685,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02115161466375061,"gpt":0.2594140246813323,"spread":0.2382624100175817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003876287,0.0002244472,0.0003023958,0.0001373068,0.0001903294,0.0002512573,0.001087688,0.00009620868,0.00007451591],"category_scores_gemma":[0.00007027625,0.0001509222,0.0001056667,0.0004512527,0.00004505902,0.0006059108,0.0004566556,0.0001022438,0.0008466983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003170061,"about_ca_system_score_gemma":0.00003972449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001632623,"about_ca_topic_score_gemma":0.000004518211,"domain_scores_codex":[0.9983699,0.00005589133,0.0003423174,0.000457887,0.0003794439,0.0003945935],"domain_scores_gemma":[0.9982046,0.0005351694,0.0001879278,0.0008838376,0.00004139569,0.0001471097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004223443,0.0002891417,0.02609871,0.0001832893,0.000311938,0.00003419716,0.003575137,0.000008700938,0.07293391,0.7872571,0.01756601,0.09173759],"study_design_scores_gemma":[0.005587165,0.0003728824,0.2175453,0.001560197,0.0004222382,0.0001636524,0.0001889372,0.01819837,0.2232884,0.2711176,0.2570328,0.004522467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.289049,0.000331605,0.6978375,0.003656747,0.00009656641,0.000348861,0.00003533663,0.0007690392,0.007875346],"genre_scores_gemma":[0.9737935,0.00001617161,0.02503625,0.00009666504,0.0001267022,0.0000548714,0.000004123262,0.00002321931,0.0008484802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6847445,"threshold_uncertainty_score":0.9999313,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006131947615819681,"gpt":0.239668162957194,"spread":0.2335362153413743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008325288,0.0001047988,0.0002062834,0.0001652859,0.00004799285,0.00002328806,0.000816392,0.00005362943,0.0000330515],"category_scores_gemma":[0.00003144168,0.00008937062,0.0001246903,0.0004241052,0.00002193626,0.0002658085,0.00007924003,0.0003871694,0.0000144209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005185341,"about_ca_system_score_gemma":0.0004653403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001254223,"about_ca_topic_score_gemma":0.00002185831,"domain_scores_codex":[0.9985297,0.00002784135,0.0005772805,0.0001310037,0.0003313004,0.0004029052],"domain_scores_gemma":[0.9989045,0.00008444172,0.0003767528,0.0003189848,0.0002230499,0.00009222246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00009441924,0.0009674614,0.004642663,0.00006398353,0.0003863865,0.0001397944,0.001359556,0.0002236308,0.1240938,0.764158,0.0007354666,0.1031348],"study_design_scores_gemma":[0.005338651,0.003339862,0.03430804,0.0002691392,0.0002011746,0.002846876,0.0002379644,0.02500522,0.7495871,0.07892952,0.09860589,0.001330577],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3188936,0.0005784763,0.6795733,0.0005182603,0.00007911358,0.00004773524,7.368942e-7,0.00001878397,0.0002900566],"genre_scores_gemma":[0.984918,0.0001032671,0.01444775,0.0002037714,0.0002033685,6.193529e-7,0.000001774374,0.00001100352,0.0001104338],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6852285,"threshold_uncertainty_score":0.3644428,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02115046832566303,"gpt":0.2485615586318899,"spread":0.2274110903062269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001016012,0.00005158104,0.00004073654,0.00004822158,0.0001100568,0.00006176295,0.0002993995,0.00001917375,0.00001662938],"category_scores_gemma":[0.000005193479,0.00004644024,0.0000202574,0.0002533387,0.000005724747,0.0004849166,0.00003283155,0.00002687521,0.0002482996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002856756,"about_ca_system_score_gemma":0.00001943513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009954616,"about_ca_topic_score_gemma":8.617307e-7,"domain_scores_codex":[0.999454,0.00002886054,0.0000997149,0.0001812536,0.0001169832,0.0001191652],"domain_scores_gemma":[0.9994047,0.000007229209,0.00001530856,0.0004438711,0.00002965888,0.00009917873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[3.299444e-7,0.0002706432,0.00004163645,0.000004217773,0.000001827305,2.544935e-7,0.0005354297,0.001533056,0.005075362,0.9786341,0.005717366,0.008185829],"study_design_scores_gemma":[0.0001219439,0.00002826111,0.002559412,0.000001221089,0.000001494855,0.00002637954,0.00008717666,0.9148369,0.008125951,0.002282012,0.07178579,0.0001434358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003414968,0.00001676797,0.957211,0.0002273391,0.00003378858,0.0001921175,7.230055e-7,0.0001985799,0.03870467],"genre_scores_gemma":[0.5530681,6.13946e-7,0.4463623,0.000270419,0.000007045418,0.00004305174,0.000008721549,0.000001927678,0.0002378804],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.976352,"threshold_uncertainty_score":0.3191472,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.015684973936033,"gpt":0.2730012043168712,"spread":0.2573162303808382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002990422,0.0003990771,0.0005042481,0.0001924252,0.0004758721,0.0004834453,0.0005959452,0.0002306919,0.000004541618],"category_scores_gemma":[0.00001742789,0.0004206347,0.00006868853,0.00004022677,0.00013907,0.000670515,0.0004483548,0.0004931033,0.00001670553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009623655,"about_ca_system_score_gemma":0.00007310545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002686584,"about_ca_topic_score_gemma":0.0001284017,"domain_scores_codex":[0.9978403,0.00005051803,0.000498914,0.0009140629,0.0003104087,0.0003857619],"domain_scores_gemma":[0.9983975,0.0001445833,0.0004950079,0.0006812512,0.0001013293,0.0001802894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001561987,0.000101002,0.0003510372,0.0003116312,0.00004791584,0.0007254814,0.001567781,0.00004766186,0.002810483,0.3928477,0.00001772894,0.6011559],"study_design_scores_gemma":[0.0008230173,0.0009958975,0.001257953,0.003396936,0.0001664842,0.003028777,0.0005794953,0.7689969,0.001028114,0.0125693,0.2042883,0.00286883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4914153,0.1157139,0.2749324,0.0002010158,0.00391451,0.004115458,0.00008189282,0.000983384,0.1086423],"genre_scores_gemma":[0.9908413,0.001803392,0.001634629,0.00002556851,0.0002140685,0.000004770835,0.00002103108,0.00004137061,0.005413823],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7689493,"threshold_uncertainty_score":0.9998245,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trent University","funders":"","keywords":"Combinatorics; Abelian group; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.002546248122147697,"gpt":0.1883043920305705,"spread":0.1857581439084228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007763161,0.0001372335,0.0002686026,0.00005973401,0.0001204291,0.00008039813,0.000372279,0.0001001861,0.000007742211],"category_scores_gemma":[0.00003072137,0.0001163921,0.00006400783,0.0002269961,0.0001094169,0.0001636175,0.0001020254,0.00008043413,0.00002435434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001995258,"about_ca_system_score_gemma":0.00002314735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000065965,"about_ca_topic_score_gemma":0.000001558915,"domain_scores_codex":[0.99857,0.0003115732,0.0004028169,0.0003174431,0.0002082106,0.0001900084],"domain_scores_gemma":[0.9989811,0.0003232356,0.0001429574,0.0004441313,0.00003307887,0.00007546989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003517652,0.0001382513,0.00009731864,0.00007522049,0.00001564846,0.0000029872,0.00007221371,0.001166873,0.01815505,0.9788291,0.0003205001,0.001091606],"study_design_scores_gemma":[0.001809115,0.00004555529,0.0003517019,0.00005494291,0.00002627555,0.00001646862,0.00002319926,0.9731898,0.001340625,0.0211817,0.001734241,0.0002263456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1798595,0.00108418,0.8178355,0.0000667294,0.0001520801,0.0002594787,0.00001637042,0.0001742601,0.0005519707],"genre_scores_gemma":[0.9984635,0.00001155381,0.0007050931,0.00001442958,0.00005623075,0.00002734128,0.00007400375,0.00001045023,0.0006373618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.972023,"threshold_uncertainty_score":0.4746332,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04482802075209594,"gpt":0.2642642397316009,"spread":0.219436218979505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003469418,0.00005353638,0.0000946041,0.00002077731,0.0001485544,0.00006031568,0.002439984,0.00001685686,0.0002846571],"category_scores_gemma":[0.00007331957,0.00002598063,0.0001473321,0.0001771608,0.00009402216,0.00009835514,0.0002398998,0.0001612825,0.00004749857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001645384,"about_ca_system_score_gemma":0.00004080795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001007175,"about_ca_topic_score_gemma":0.000003290299,"domain_scores_codex":[0.9993438,0.0000593815,0.0002199987,0.00006555022,0.0002274505,0.00008389324],"domain_scores_gemma":[0.998269,0.0001301715,0.0001798194,0.001338374,0.00004918145,0.00003349712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002873307,0.004161117,0.001385528,0.00007048207,0.0006412735,0.00180397,0.008577428,0.006805819,0.04180648,0.3823644,0.3731116,0.1789846],"study_design_scores_gemma":[0.001882887,0.000737596,0.03429978,0.0002731161,0.0001325879,0.01695202,0.0001314444,0.05493379,0.04912062,0.5264487,0.3145382,0.0005493732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9740859,0.00004737271,0.002901339,0.01997905,0.0001590372,0.0000832068,0.000002617455,0.000007585918,0.002733952],"genre_scores_gemma":[0.995993,0.00001016032,0.002611403,0.0006550203,0.00006137852,7.778907e-7,5.644103e-8,0.000002923331,0.0006652319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1784352,"threshold_uncertainty_score":0.4534138,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01190106065325264,"gpt":0.2493156393802527,"spread":0.2374145787270001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001114661,0.000107097,0.0001048691,0.0002464568,0.0001267729,0.0001496847,0.0006831095,0.00003299217,0.00008573297],"category_scores_gemma":[0.00001932452,0.0001136756,0.00005363557,0.0007459419,0.00001768088,0.0001784803,0.0002491755,0.00007514434,0.0007930095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006278083,"about_ca_system_score_gemma":0.00009151956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002685579,"about_ca_topic_score_gemma":0.00001445515,"domain_scores_codex":[0.998925,0.00001733471,0.00018895,0.0003366482,0.0003049157,0.0002271354],"domain_scores_gemma":[0.9992499,0.00009761063,0.00004389912,0.0003547065,0.00007517338,0.0001787129],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004309565,0.0003631119,0.001117769,0.0000136937,0.00005116825,0.00001064033,0.001703274,0.1326791,0.0007688872,0.4708541,0.08031153,0.3121224],"study_design_scores_gemma":[0.0005304171,0.00008260184,0.03603939,0.00001612018,0.000009293984,0.00006965127,0.00002398768,0.6177335,0.0006309271,0.04561623,0.2987483,0.0004995334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04301159,0.0001095307,0.9380273,0.01665983,0.00008868385,0.0001681579,0.0000148754,0.0002374051,0.001682621],"genre_scores_gemma":[0.7443259,5.279825e-7,0.2515097,0.003193324,0.0001338584,0.00002812953,0.00002989566,0.000007441525,0.000771301],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7013143,"threshold_uncertainty_score":0.999985,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01221954954693704,"gpt":0.3137382065719715,"spread":0.3015186570250345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002735069,0.0002433716,0.00066465,0.0000616948,0.00006515587,0.00007048344,0.0004488202,0.00005473505,0.00001898099],"category_scores_gemma":[0.0001733432,0.0002171552,0.00009271425,0.0005520179,0.0001296094,0.0004804364,0.0009198523,0.0003742362,0.0001094471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000778275,"about_ca_system_score_gemma":0.00003865411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003784772,"about_ca_topic_score_gemma":0.00000548296,"domain_scores_codex":[0.9977385,0.0001605904,0.0008465352,0.0005790032,0.0002616453,0.0004137467],"domain_scores_gemma":[0.9985929,0.000511517,0.0001467562,0.0004788605,0.00007489057,0.0001950598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001088705,0.002096592,0.005402981,0.002883563,0.0001429441,0.00031328,0.007828553,0.003940622,0.04983051,0.879923,0.004278611,0.04325048],"study_design_scores_gemma":[0.0003178593,0.0001813536,0.002703221,0.002022381,0.00002801888,0.00002206919,0.00006878414,0.9639152,0.0006051346,0.02944807,0.0003845244,0.0003034305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.770395,0.003757258,0.2139159,0.004632107,0.0006855206,0.00161665,0.00007295448,0.0001704891,0.004754099],"genre_scores_gemma":[0.9976996,0.0003843731,0.001408107,0.00006224373,0.00008030456,0.00005933537,0.00002583301,0.00001728496,0.0002629637],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9599745,"threshold_uncertainty_score":0.8855333,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01949142500402901,"gpt":0.2830307755182556,"spread":0.2635393505142266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000209378,0.0001584578,0.0002115333,0.00009154529,0.0001706316,0.0001887273,0.0008191264,0.00006805233,0.000001888221],"category_scores_gemma":[0.00005057922,0.0001527443,0.0001032722,0.0004237713,0.00006778994,0.0003496649,0.00007210833,0.0001236842,0.000006485449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002869107,"about_ca_system_score_gemma":0.00007495563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004782333,"about_ca_topic_score_gemma":1.940877e-7,"domain_scores_codex":[0.9987241,0.00002016124,0.0002935192,0.0003955223,0.0002319852,0.0003347264],"domain_scores_gemma":[0.9991451,0.00005583434,0.0002045282,0.0004442507,0.00007916139,0.00007114072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001316253,0.0002318792,0.00002298849,0.0001690608,0.00002056901,0.00000640083,0.002584895,0.0002367475,0.04771537,0.1341132,0.0006116281,0.8142741],"study_design_scores_gemma":[0.002391421,0.0006302075,0.002889322,0.0009652382,0.000125216,0.00004302183,0.0002837348,0.6006102,0.1002309,0.2597884,0.03021474,0.001827586],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006696166,0.0002093128,0.9827738,0.009341409,0.00005047892,0.0004113885,0.000002400478,0.0003286389,0.0001864272],"genre_scores_gemma":[0.4921736,0.000001838076,0.506662,0.001032858,0.00004246001,0.00006402137,0.000007299583,0.000007124513,0.000008827313],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8124465,"threshold_uncertainty_score":0.6228729,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.03611765041715627,"gpt":0.234303913910352,"spread":0.1981862634931957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002326376,0.00009242228,0.0001603011,0.0002585442,0.00002604529,0.00005745608,0.0003461164,0.00005400699,0.00001784933],"category_scores_gemma":[0.00006269795,0.00008269521,0.00003439797,0.000536778,0.0000601985,0.000211738,0.00009993775,0.00009365624,0.00001982596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002982862,"about_ca_system_score_gemma":0.00003008666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005312277,"about_ca_topic_score_gemma":0.0005608762,"domain_scores_codex":[0.9991931,0.00005869949,0.0002281904,0.0002506973,0.0000904254,0.0001789092],"domain_scores_gemma":[0.9995393,0.00007829633,0.00004170609,0.0002695234,0.00001892883,0.00005223262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001933399,0.000694463,0.0198935,0.00005308828,0.00004978832,0.0002961261,0.02397809,0.0000203817,0.01204773,0.6032618,0.002146364,0.3373653],"study_design_scores_gemma":[0.02484599,0.0007324265,0.3558995,0.0004694406,0.00006064089,0.0002278672,0.006540179,0.1203974,0.2536204,0.1862311,0.0476981,0.00327697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9621847,0.0007992421,0.03082962,0.0009346766,0.0001379752,0.0002804617,0.000003456216,0.000111808,0.004718027],"genre_scores_gemma":[0.990847,0.00004244152,0.008772399,0.0001272449,0.00001274506,0.00004361558,0.000001806847,0.000005423617,0.0001473127],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4170307,"threshold_uncertainty_score":0.3372213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}