{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":182,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":182,"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":"f65248b65cd1","filters":{"venue":"International Journal of Foundations of Computer Science"}},"results":[{"id":"W1976120600","doi":"10.1142/s0129054100000260","title":"ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES","year":2000,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":231,"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":"Combinatorics; Mathematics; Discrete mathematics; Clique graph; Treewidth; Split graph; Vertex (graph theory); Chordal graph; Block graph; Bounded function; Graph; Pathwidth; Line graph; Graph power; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02382651196834527,"gpt":0.3362367416029343,"spread":0.312410229634589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001825354,0.0001064021,0.0001783151,0.0007866748,0.0001674725,0.0002166421,0.005124066,0.0000229346,0.0001027213],"category_scores_gemma":[0.000259021,0.00007300705,0.0001709283,0.00103149,0.0009882601,0.002010332,0.0002492574,0.000230263,0.00001481051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007083338,"about_ca_system_score_gemma":0.0004672889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005303869,"about_ca_topic_score_gemma":0.000001053379,"domain_scores_codex":[0.9971703,0.0001332708,0.0005885239,0.0002153524,0.001695288,0.0001972686],"domain_scores_gemma":[0.9963065,0.0009641348,0.0004787083,0.000487684,0.001678651,0.00008428536],"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.00004959702,0.0002085791,0.0002562859,0.000003229427,0.00005532541,0.000008825999,0.0003321803,0.01293782,0.002216148,0.8548802,0.0002230642,0.1288288],"study_design_scores_gemma":[0.0007749217,0.001183928,0.01250994,0.0002528118,0.000009521324,0.0002507737,0.0000224862,0.05972134,0.02458238,0.8988541,0.001617048,0.0002207753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3744083,0.0000502351,0.6196644,0.003903247,0.0008907479,0.00009549627,0.000003579717,0.00001264469,0.0009713812],"genre_scores_gemma":[0.9503284,0.00007942262,0.04912636,0.0003005039,0.0001160527,0.000001766714,3.387697e-7,0.000004105625,0.00004308689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5759201,"threshold_uncertainty_score":0.9521874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988560957","doi":"10.1142/s012905410200100x","title":"UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Concatenation (mathematics); Unary operation; Regular language; Intersection (aeronautics); State (computer science); Mathematics; Symbol (formal); Alphabet; Discrete mathematics; Function (biology); Finite-state machine; Connection (principal bundle); Automaton; Combinatorics; Computer science; Algorithm; Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02369577806896057,"gpt":0.2801950661256422,"spread":0.2564992880566816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006767123,0.00008729793,0.0001322754,0.0004668607,0.0001555135,0.0004408195,0.001465638,0.00001673071,0.0000498011],"category_scores_gemma":[0.00006087452,0.00007679475,0.00005443954,0.0004064646,0.0004064534,0.002534981,0.0003156612,0.0001072927,0.00001037375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005660755,"about_ca_system_score_gemma":0.00008977614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001886329,"about_ca_topic_score_gemma":0.000003823117,"domain_scores_codex":[0.9984963,0.00004732483,0.0004357657,0.0001850142,0.0007084411,0.0001271868],"domain_scores_gemma":[0.998478,0.00009830068,0.0002573681,0.0002390115,0.0008395807,0.00008776417],"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.00002205008,0.0004566666,0.001185815,0.00001158455,0.0001253593,0.00005660246,0.005051815,0.008758323,0.0113805,0.2549134,0.0009345284,0.7171033],"study_design_scores_gemma":[0.0007349667,0.000331271,0.03034985,0.0000874015,0.00001064862,0.00063873,0.00007886842,0.9426056,0.002690879,0.02115416,0.001124005,0.0001936417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2537917,0.0001771358,0.7431424,0.001402553,0.001201529,0.0000399305,0.000003712067,0.00001979396,0.0002212772],"genre_scores_gemma":[0.867025,0.00004660935,0.1325084,0.0002566651,0.0001223317,7.022726e-7,0.00000112825,0.000002796797,0.00003639206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9338472,"threshold_uncertainty_score":0.4250832,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099641843","doi":"10.1142/s0129054103002011","title":"EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":106,"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":"Qubit; Quantum error correction; Quantum; Computer science; Error detection and correction; Theoretical computer science; Mathematics; Topology (electrical circuits); Quantum mechanics; Algorithm; Physics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02039125300906239,"gpt":0.3038096427327279,"spread":0.2834183897236655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002257018,0.000186508,0.0003059103,0.0008623585,0.0003680297,0.0005020258,0.003107921,0.00004203771,0.00000533531],"category_scores_gemma":[0.0005727069,0.0001647452,0.0002345718,0.0008995914,0.0003224761,0.0005409116,0.0002636103,0.0002307533,0.000004652884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001307144,"about_ca_system_score_gemma":0.0009254083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009256491,"about_ca_topic_score_gemma":0.00000168676,"domain_scores_codex":[0.997049,0.00007337891,0.0008740631,0.0003910038,0.001250451,0.0003620944],"domain_scores_gemma":[0.9952031,0.0006001118,0.0009654426,0.0003823785,0.002690419,0.0001584964],"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.000019608,0.0005644495,0.0006343296,0.00003231049,0.0001411309,0.00002765771,0.002733308,0.5711983,0.006735516,0.2102215,0.0003400024,0.2073519],"study_design_scores_gemma":[0.0006045782,0.0002985035,0.001478107,0.0001585577,0.000008969041,0.0005420659,0.00004469815,0.980895,0.005145872,0.009889279,0.0007517762,0.0001825769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2673178,0.00003464708,0.7258828,0.0006037218,0.00593651,0.0001166136,0.000003686761,0.00002282516,0.00008140245],"genre_scores_gemma":[0.7867017,0.000002917739,0.2129055,0.000109559,0.0002617657,0.000002606653,7.376688e-7,0.000007508529,0.000007617675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.519384,"threshold_uncertainty_score":0.6718116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980577621","doi":"10.1142/s012905410400242x","title":"ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Combinatorics on words; Set (abstract data type); Product (mathematics); Enumeration; Simple (philosophy); Combinatorics; Existential quantification; Discrete mathematics; Word (group theory); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03640076233099542,"gpt":0.301955305417043,"spread":0.2655545430860475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00128672,0.0000868381,0.0001578198,0.0004570236,0.0001123564,0.0001905739,0.004043789,0.00001890352,0.0000214463],"category_scores_gemma":[0.0001758714,0.0000598622,0.0001185734,0.0006146571,0.000921796,0.0009339536,0.0003561817,0.0001420917,0.00000856442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009108692,"about_ca_system_score_gemma":0.0004844705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001736568,"about_ca_topic_score_gemma":0.000002285132,"domain_scores_codex":[0.9980136,0.00004386978,0.0005748803,0.0001473013,0.001094249,0.0001261467],"domain_scores_gemma":[0.9974175,0.0003462192,0.0007314147,0.0003838768,0.001065108,0.00005585931],"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.00001036425,0.0001452764,0.00008429526,0.000001831836,0.00003169762,0.000005317605,0.0006497346,0.008763928,0.001845656,0.9743941,0.00004535182,0.01402238],"study_design_scores_gemma":[0.001059328,0.0005105085,0.02051703,0.0003584225,0.000009362366,0.0003063214,0.00004963679,0.05912041,0.02570017,0.8918371,0.0003567259,0.0001749296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3585956,0.00001297536,0.6363704,0.003543126,0.001151195,0.00003795069,0.000002875083,0.000007745337,0.0002780675],"genre_scores_gemma":[0.9106402,0.000007519161,0.0889467,0.0003082253,0.00009085509,5.748906e-7,3.964242e-7,0.000002386929,0.000003101818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5520446,"threshold_uncertainty_score":0.7514433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083735143","doi":"10.1142/s012905410300214x","title":"A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Queen's University; University of Prince Edward Island","funders":"","keywords":"Regular expression; Regular language; Computer science; Pumping lemma for regular languages; Context-free language; Context (archaeology); Theoretical computer science; Programming language; Artificial intelligence; Automaton; Biology; Rule-based machine translation; Programming paradigm; Fifth-generation programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02637070741872171,"gpt":0.3423945622337794,"spread":0.3160238548150577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001743176,0.00008719952,0.000186606,0.0005686728,0.0001194925,0.000179964,0.002198556,0.00002142869,0.00002101167],"category_scores_gemma":[0.0003485237,0.00007135206,0.00008917927,0.0006029476,0.0002578607,0.003202815,0.0003678169,0.0001283058,0.00000250341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005013187,"about_ca_system_score_gemma":0.0005836465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005422406,"about_ca_topic_score_gemma":0.000001003038,"domain_scores_codex":[0.9975227,0.0001080782,0.0007047938,0.0001794959,0.001323256,0.0001616612],"domain_scores_gemma":[0.9967362,0.0002743884,0.000798884,0.000391433,0.001705232,0.00009387257],"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.00004110778,0.003349039,0.002173557,0.000008345903,0.0001787197,0.0000749652,0.005135695,0.004355939,0.01927537,0.9170356,0.0004138038,0.04795779],"study_design_scores_gemma":[0.01357042,0.009559941,0.1004732,0.001198864,0.0001802426,0.007743404,0.004620526,0.4355917,0.175953,0.237117,0.01244483,0.001546853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3509693,0.00001232509,0.6472813,0.0003126385,0.001082198,0.00005732466,7.320129e-7,0.000007524959,0.000276592],"genre_scores_gemma":[0.7733172,0.00000379254,0.2265732,0.00004166742,0.0000532488,0.000001054094,1.578148e-7,0.000002305332,0.000007349495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6799187,"threshold_uncertainty_score":0.40855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076994310","doi":"10.1142/s0129054103001741","title":"A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":75,"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":"Connected dominating set; Dominating set; Mobile ad hoc network; Wireless ad hoc network; Computer science; Cluster analysis; Vertex (graph theory); Graph; Algorithm; Mathematics; Theoretical computer science; Computer network; Wireless; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01905439722890007,"gpt":0.3031961872650348,"spread":0.2841417900361347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001769545,0.0001314377,0.0002061971,0.0004756667,0.0001776786,0.0005560663,0.003434008,0.00004159473,0.00001342238],"category_scores_gemma":[0.00009323764,0.0001249956,0.0001418305,0.0006040594,0.000268382,0.002942432,0.0002579538,0.0001585708,0.000001766154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001403962,"about_ca_system_score_gemma":0.0005982197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002286679,"about_ca_topic_score_gemma":0.000004454487,"domain_scores_codex":[0.9976816,0.00006578741,0.0006970011,0.0002988268,0.000981158,0.0002756015],"domain_scores_gemma":[0.9960702,0.000245013,0.0006637498,0.0003844304,0.002462452,0.0001741419],"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.00001015721,0.0001762011,0.00009366759,0.000002164945,0.00005291402,0.00001010313,0.0002359223,0.1288423,0.0001671888,0.07897159,0.0001886299,0.7912492],"study_design_scores_gemma":[0.0005953546,0.0003654289,0.0005332479,0.00004791593,0.000006490207,0.0003732654,0.000008714524,0.9874247,0.0003767273,0.005647162,0.004493204,0.0001278112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002811637,0.0001007634,0.9914932,0.0002651509,0.005015738,0.0001295541,0.000002444948,0.00002015208,0.0001613301],"genre_scores_gemma":[0.2652071,0.00002415994,0.7341015,0.0001739574,0.0004687081,0.000004893141,0.000001476176,0.00000602492,0.00001215138],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8585824,"threshold_uncertainty_score":0.6381299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570053645","doi":"10.1142/s0129054112400448","title":"ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Decidability; Enumeration; Recursively enumerable language; Mathematics; Combinatorics; Class (philosophy); Discrete mathematics; Function (biology); Sequence (biology); Computer science; Biology; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02306499012198243,"gpt":0.278462639676021,"spread":0.2553976495540386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001203883,0.00006694927,0.0001392329,0.0003998544,0.00007930295,0.000188229,0.001282378,0.00001680524,0.000008062646],"category_scores_gemma":[0.0001202744,0.00005179356,0.00004425035,0.0003358425,0.0003707255,0.003670096,0.0002293171,0.00005523771,0.000001916138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004342069,"about_ca_system_score_gemma":0.0002579687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000120036,"about_ca_topic_score_gemma":6.957993e-7,"domain_scores_codex":[0.9985412,0.00003856032,0.0004810204,0.00009677353,0.0007182183,0.0001241757],"domain_scores_gemma":[0.9981824,0.00009410113,0.0005497794,0.0001627254,0.0009412133,0.00006976682],"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.00001873251,0.0005637087,0.0186322,0.00006832753,0.00016259,0.000004881341,0.00938771,0.002506475,0.2032661,0.383257,0.0001771719,0.3819551],"study_design_scores_gemma":[0.000862866,0.0004301498,0.0871254,0.0007837439,0.00002709492,0.0009542365,0.0001899837,0.5713896,0.3133016,0.02388675,0.0007227951,0.0003257779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.499198,0.0002012587,0.4994515,0.0003586093,0.0006896254,0.00003195227,5.470461e-7,0.000008560097,0.00005989272],"genre_scores_gemma":[0.8366163,0.00002098155,0.163202,0.00005034659,0.0001018028,8.233233e-7,1.781058e-7,0.000001645632,0.000005912007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5688832,"threshold_uncertainty_score":0.2660731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091969952","doi":"10.1142/s0129054111008295","title":"UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Computer science; Grid; Asynchronous communication; Occupancy grid mapping; Mobile robot; Constructive proof; Distributed computing; Artificial intelligence; Mathematics; Computer network; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03563350950154959,"gpt":0.3052799339019074,"spread":0.2696464244003579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009845681,0.0000749787,0.0001623997,0.001065643,0.00004452371,0.0001097248,0.002696733,0.00002078857,0.00003558811],"category_scores_gemma":[0.00005015195,0.00006904388,0.00007060815,0.0007853429,0.0003295971,0.002093459,0.0003974027,0.0001107344,0.000003962083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001029522,"about_ca_system_score_gemma":0.0005571817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000441288,"about_ca_topic_score_gemma":0.000007366124,"domain_scores_codex":[0.9982107,0.00003137063,0.0007071073,0.0001559726,0.0007439344,0.0001509003],"domain_scores_gemma":[0.9975795,0.0000618313,0.0005582778,0.0002393724,0.00148304,0.00007805174],"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.00006748098,0.001705786,0.01481032,0.00004341396,0.0001328137,0.00007238142,0.01658781,0.4578367,0.01117877,0.1916585,0.0002325065,0.3056735],"study_design_scores_gemma":[0.001541035,0.0009004076,0.05477967,0.0003843777,0.000006839369,0.0003600334,0.00009206364,0.9084958,0.02243109,0.00988723,0.0008286418,0.0002927833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06217171,0.00001713053,0.9347096,0.0002950937,0.001698705,0.00008453686,0.0000016369,0.000009609679,0.001011945],"genre_scores_gemma":[0.655788,0.00001719505,0.3440896,0.00004056538,0.00005268991,0.000001632429,4.220177e-7,0.000002124769,0.000007816337],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5936162,"threshold_uncertainty_score":0.5011246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975121090","doi":"10.1142/s012905410200145x","title":"COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Membrane; Membrane computing; Computer science; Theoretical computer science; Mathematics; Chemistry; Biochemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.01656679589912971,"gpt":0.2873662264388591,"spread":0.2707994305397294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005581137,0.0000512804,0.0001056979,0.0001306976,0.00003854887,0.00003090209,0.0008763404,0.00003125277,0.000009299725],"category_scores_gemma":[0.00009750245,0.00004392966,0.00005397829,0.0001952859,0.0002700798,0.00002485871,0.0001933949,0.00007304492,3.692078e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001530637,"about_ca_system_score_gemma":0.00003199354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000796216,"about_ca_topic_score_gemma":0.000002416974,"domain_scores_codex":[0.9991003,0.0000439861,0.0004347512,0.0000936727,0.0002447288,0.00008252623],"domain_scores_gemma":[0.9987603,0.00005865084,0.0004212433,0.0001218925,0.0006104989,0.00002735286],"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.0000854017,0.0008821895,0.03896292,0.00001939153,0.0001266898,0.000004750249,0.000559059,0.1253483,0.5671337,0.002076629,0.001231111,0.2635699],"study_design_scores_gemma":[0.002264878,0.001161598,0.05757055,0.0004591375,0.00001882349,0.0002188441,0.00009150309,0.7949262,0.1352269,0.001209429,0.006461428,0.0003907458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8264701,0.0004541314,0.1722279,0.0002677574,0.0002854776,0.00002891791,0.00000142521,0.00000140565,0.0002628473],"genre_scores_gemma":[0.985552,0.0001616701,0.01410934,0.00006800493,0.00009459553,1.452845e-7,0.000005428969,0.000001847387,0.0000069931],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6695778,"threshold_uncertainty_score":0.17914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786516640","doi":"10.1142/s0129054113400133","title":"IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":52,"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":"Mathematics; Regular language; Combinatorics; Concatenation (mathematics); State (computer science); Quotient; Alphabet; Permutation (music); Discrete mathematics; Integer (computer science); Binary logarithm; Automaton; Algorithm; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02001200027157618,"gpt":0.3211004986114298,"spread":0.3010884983398536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009455902,0.00007050746,0.0001668949,0.0006315371,0.00003926563,0.0001881515,0.003056004,0.00001902721,0.00007609857],"category_scores_gemma":[0.00007994068,0.00006078355,0.00006137758,0.000758235,0.0003704451,0.002313855,0.0004061298,0.00009921287,0.00001036078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006472368,"about_ca_system_score_gemma":0.0002948848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000110827,"about_ca_topic_score_gemma":0.000002991134,"domain_scores_codex":[0.9981487,0.00004965871,0.0005648053,0.000145916,0.0009491352,0.0001417357],"domain_scores_gemma":[0.997526,0.0001698909,0.0003758504,0.0002792968,0.00158718,0.0000617874],"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.00001754108,0.0006864331,0.006036578,0.0000263109,0.00009491568,0.00005638964,0.003591978,0.01068631,0.1620249,0.506346,0.002230338,0.3082024],"study_design_scores_gemma":[0.001464413,0.0004218086,0.2420136,0.000346461,0.000006511012,0.0005132818,0.0002894202,0.633272,0.06449486,0.05578048,0.001096761,0.0003003974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4225866,0.00003431498,0.573899,0.002458834,0.0005802387,0.00005927449,0.0000018453,0.000006837909,0.0003730448],"genre_scores_gemma":[0.8389134,0.000009175461,0.1608174,0.000160094,0.00008009828,7.753796e-7,6.601872e-7,0.0000021984,0.00001611271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6225857,"threshold_uncertainty_score":0.5678866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971882628","doi":"10.1142/s0129054111008738","title":"PERIODS ON TWO KINDS OF NONLINEAR FEEDBACK SHIFT REGISTERS WITH TIME VARYING FEEDBACK FUNCTIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nonlinear system; Shift register; Computer science; Control theory (sociology); Mathematics; Arithmetic; Artificial intelligence; Telecommunications; Control (management); Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02546006147461441,"gpt":0.2705732151522423,"spread":0.2451131536776279,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001099079,0.0001431404,0.0002225742,0.0009972475,0.0001727682,0.0001913826,0.002875426,0.00002593419,0.00006581066],"category_scores_gemma":[0.00005642512,0.0001180669,0.0001636224,0.001038682,0.000877137,0.001641818,0.0002712914,0.0001798908,0.00001832959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006246733,"about_ca_system_score_gemma":0.0004096565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001497839,"about_ca_topic_score_gemma":0.00000276613,"domain_scores_codex":[0.997817,0.00007037669,0.0005946143,0.0002699847,0.001061948,0.0001860213],"domain_scores_gemma":[0.9970114,0.0001872852,0.000815946,0.0004615054,0.001407794,0.0001160535],"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.001487591,0.003214415,0.01182798,0.00004104698,0.001021403,0.0001236522,0.01965379,0.02085465,0.01231087,0.6508986,0.0006130895,0.2779529],"study_design_scores_gemma":[0.01769639,0.02014429,0.2350546,0.004997719,0.0004136412,0.003798533,0.0006461024,0.4811477,0.08293122,0.1373446,0.01247998,0.003345164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1724815,0.00000964542,0.8217026,0.0005425467,0.00117322,0.00006151884,0.000004883959,0.00002072832,0.004003288],"genre_scores_gemma":[0.7764739,0.000003037784,0.22325,0.000121841,0.0001215574,9.836451e-7,0.000001075145,0.000005151732,0.00002239071],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6039924,"threshold_uncertainty_score":0.5343305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966140610","doi":"10.1142/s0129054107004838","title":"DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Chord (peer-to-peer); Chordal graph; Asynchronous communication; Computer science; Torus; Node (physics); Human decontamination; Upper and lower bounds; Visibility; Mathematics; Theoretical computer science; Computer network; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01931218671582376,"gpt":0.3218863398165222,"spread":0.3025741531006985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001667697,0.00007544988,0.0001178819,0.0005885825,0.0001827501,0.0003070143,0.001262275,0.00002598324,0.000009755106],"category_scores_gemma":[0.00007804969,0.00007259803,0.00005309625,0.0005057841,0.0002098552,0.002305185,0.0003752584,0.0001258373,0.000001236703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001337932,"about_ca_system_score_gemma":0.0001589844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002247115,"about_ca_topic_score_gemma":0.000006393983,"domain_scores_codex":[0.9983521,0.00002071625,0.0005180026,0.0001708882,0.0007811825,0.0001571762],"domain_scores_gemma":[0.9978631,0.0001323465,0.0005338295,0.0001442846,0.001228696,0.00009778518],"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.00002423924,0.0001602441,0.004737921,0.00000721011,0.00005144537,0.00003267328,0.00195527,0.005882518,0.01026991,0.02896764,0.00005556263,0.9478554],"study_design_scores_gemma":[0.00111555,0.0006814713,0.06550327,0.0002796777,0.00001571005,0.001620713,0.00009022217,0.8874925,0.02809394,0.007781611,0.007007896,0.0003174247],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4502548,0.00002756003,0.54773,0.00006749676,0.001797688,0.00002938893,2.530147e-7,0.000006222132,0.00008660444],"genre_scores_gemma":[0.7824401,0.00001672691,0.2171717,0.00007765774,0.0002867479,2.651337e-7,1.388471e-7,0.000002059685,0.00000450364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.947538,"threshold_uncertainty_score":0.2960546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011421072","doi":"10.1142/s0129054108006327","title":"USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Mobile Agent-Based Network Management","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":"Carleton University; University of Ottawa","funders":"","keywords":"Black hole (networking); Ring (chemistry); Security token; Mobile agent; Node (physics); Computer science; Ring network; Token ring; Combinatorics; Physics; Topology (electrical circuits); Mathematics; Computer network; Quantum mechanics; Network topology; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.05176515794922026,"gpt":0.317240406160664,"spread":0.2654752482114437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326097,0.0001398107,0.0001978393,0.001194081,0.000143651,0.0002359569,0.002814453,0.00001835782,0.0000134644],"category_scores_gemma":[0.00002098146,0.000128528,0.00005675098,0.001557072,0.0003054786,0.002364038,0.0005623408,0.0001271687,0.000008859292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003726626,"about_ca_system_score_gemma":0.0004565383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003767519,"about_ca_topic_score_gemma":0.00001954504,"domain_scores_codex":[0.9973514,0.00006530587,0.000638833,0.0003552589,0.001315075,0.0002741291],"domain_scores_gemma":[0.9975139,0.00005078492,0.0004771011,0.0004572902,0.001315478,0.00018547],"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.00003076206,0.0002322653,0.005440594,0.000003612079,0.00003586044,0.0001480121,0.001672538,0.9651195,0.001276551,0.001567007,0.00005354542,0.0244197],"study_design_scores_gemma":[0.0009488238,0.0005141885,0.03035075,0.0001869096,0.000007235285,0.0001654294,0.00003922797,0.9635966,0.003243413,0.0001537792,0.0006034483,0.000190152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4904618,0.00000463872,0.5087352,0.0001947248,0.0004404695,0.000118524,7.483511e-7,0.000009021283,0.00003488079],"genre_scores_gemma":[0.7286391,0.000005595904,0.2709767,0.0002518361,0.0001106031,0.00000396879,9.436321e-7,0.000005300688,0.000006000938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2381772,"threshold_uncertainty_score":0.5241222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067033580","doi":"10.1142/s0129054107004784","title":"NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Artificial Immune Systems Applications","field":"Engineering","cited_by":34,"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":"Human decontamination; Vertex (graph theory); Upper and lower bounds; Computer science; Tree (set theory); Mathematical proof; Binary tree; Constructive; Node (physics); Protocol (science); Binary number; Theoretical computer science; Distributed computing; Graph; Mathematics; Combinatorics; Algorithm; Medicine; Arithmetic; Engineering; Process (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.01411593980073721,"gpt":0.2913679085688274,"spread":0.2772519687680902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001606698,0.00005605215,0.0001287449,0.000469838,0.00003792391,0.0000289881,0.0008245932,0.00002402065,0.000008176914],"category_scores_gemma":[0.00006634009,0.00005835258,0.0000409891,0.000613825,0.0002809156,0.0006447017,0.00007247115,0.0001133554,0.000002312488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001563147,"about_ca_system_score_gemma":0.0001213038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006537862,"about_ca_topic_score_gemma":0.0001191316,"domain_scores_codex":[0.9985383,0.00001815558,0.0007773449,0.00006349849,0.0004843234,0.0001183875],"domain_scores_gemma":[0.9982213,0.0002112211,0.000318132,0.000149043,0.001065213,0.00003505126],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00002552437,0.0001522813,0.006866717,0.00001543075,0.0000452942,0.000005023159,0.001185398,0.7297738,0.02515937,0.0271079,0.0001346513,0.2095287],"study_design_scores_gemma":[0.0006494412,0.0001466281,0.5524654,0.0004145994,0.00001210295,0.0001168746,0.0003631716,0.3854087,0.05196141,0.00724038,0.00101655,0.0002047132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3647548,0.00004306479,0.6339349,0.00004503809,0.0007964997,0.0000451663,8.692584e-7,0.000005387588,0.0003742541],"genre_scores_gemma":[0.9760816,0.00000874174,0.02377511,0.0000073802,0.0001182068,9.905991e-7,0.000001069251,0.000003907815,0.000003003185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6113268,"threshold_uncertainty_score":0.2379549,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073495011","doi":"10.1142/s0129054110007441","title":"FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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 Waterloo","funders":"","keywords":"Polynomial; Time complexity; Context (archaeology); Context-free language; Context-free grammar; Rule-based machine translation; Mathematics; Square-free polynomial; Matrix polynomial; Monic polynomial; Order (exchange); Discrete mathematics; Combinatorics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.009884880501276559,"gpt":0.2769687651552374,"spread":0.2670838846539608,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002162057,0.00008248787,0.0001682974,0.0005411503,0.00007508026,0.0002177626,0.005167885,0.00002632347,0.00003713353],"category_scores_gemma":[0.0005531813,0.00005438738,0.00008381386,0.0006179709,0.0004745245,0.001320189,0.000576056,0.0001987991,0.00000463643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004216391,"about_ca_system_score_gemma":0.0004146068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005235769,"about_ca_topic_score_gemma":0.00003365838,"domain_scores_codex":[0.9984976,0.00006451063,0.000557195,0.000151741,0.0005893492,0.0001395958],"domain_scores_gemma":[0.9976817,0.0004791261,0.0006104179,0.0004247084,0.0007540943,0.00004995419],"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.0001840025,0.0005215862,0.002231265,0.00001628048,0.0001362817,0.0001302022,0.00969018,0.0009586442,0.3847109,0.3787981,0.002608383,0.2200142],"study_design_scores_gemma":[0.005903608,0.0009036319,0.1137354,0.000724223,0.00003416662,0.001966028,0.0004474394,0.5316508,0.2635939,0.07794864,0.002420871,0.0006712669],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7780197,0.00002019512,0.2167658,0.0033091,0.001654254,0.00006337473,0.000004675146,0.000009248428,0.0001537227],"genre_scores_gemma":[0.9495789,0.000003338092,0.05001613,0.0001800842,0.0001832204,8.340352e-7,4.572125e-7,0.000003072931,0.00003393469],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5306922,"threshold_uncertainty_score":0.9603301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048819748","doi":"10.1142/s0129054102000947","title":"VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":29,"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":"Algorithm; Bit array; String (physics); String searching algorithm; Matching (statistics); Automaton; Computation; Bounded function; Computer science; Focus (optics); Mathematics; Pattern matching; Theoretical computer science; Type (biology); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04030689551270782,"gpt":0.3145119637821279,"spread":0.2742050682694201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007718863,0.0001039467,0.0001722037,0.0005185831,0.0001900312,0.0005208173,0.003327385,0.00002401945,0.00001728419],"category_scores_gemma":[0.00008498149,0.00008962546,0.0001160545,0.0004229313,0.0001559423,0.003031478,0.0004825883,0.0001101934,0.000004669474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000901706,"about_ca_system_score_gemma":0.0001301324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006960326,"about_ca_topic_score_gemma":4.2629e-7,"domain_scores_codex":[0.9979995,0.00002055499,0.0005733421,0.0002333799,0.0009799224,0.0001932937],"domain_scores_gemma":[0.9972534,0.000188292,0.0006026107,0.0003099405,0.001545086,0.0001006826],"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.000015956,0.0003997002,0.0001192417,0.0000179412,0.0000962799,0.00001944099,0.001568228,0.01055424,0.007332327,0.18042,0.001159573,0.798297],"study_design_scores_gemma":[0.0006309115,0.000176644,0.0008297113,0.000116553,0.000006291368,0.0001929858,0.00001440497,0.9780756,0.003823123,0.01294094,0.003055441,0.0001374087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00759615,0.0000659057,0.987943,0.001033177,0.003128082,0.00008804799,0.000009871756,0.00002152801,0.0001142241],"genre_scores_gemma":[0.3822014,0.00001988291,0.6173548,0.00007668826,0.0003258293,0.000001996219,0.000001311259,0.000003747056,0.00001442194],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9675214,"threshold_uncertainty_score":0.6183164,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993598446","doi":"10.1142/s0129054102000960","title":"AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Nondeterministic finite automaton; DFA minimization; Deterministic finite automaton; Quantum finite automata; Nested word; Regular language; Finite-state machine; Automaton; Deterministic automaton; ω-automaton; Computer science; Time complexity; Algorithm; Formal language; Timed automaton; Mathematics; Theoretical computer science; Automata theory; Two-way deterministic finite automaton","retraction":null,"screen_n_in":null,"score":{"opus":0.01962646832423218,"gpt":0.3115234385093699,"spread":0.2918969701851377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001045567,0.0001047482,0.0001747623,0.0004686546,0.0001610412,0.0004716069,0.002604987,0.00002704171,0.00001778873],"category_scores_gemma":[0.0001894199,0.00009395926,0.0001315299,0.00030494,0.0002852047,0.001382656,0.0001687915,0.00006669148,0.000003804887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006829335,"about_ca_system_score_gemma":0.0001586937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002070376,"about_ca_topic_score_gemma":2.309884e-7,"domain_scores_codex":[0.9983245,0.00002653421,0.0005342991,0.0002425447,0.000671914,0.0002002672],"domain_scores_gemma":[0.9968221,0.0006336209,0.0005903002,0.000289866,0.001570313,0.00009383453],"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.00001196648,0.0003379331,0.00006251855,0.000008961214,0.00006025287,0.000006298727,0.001070872,0.0158556,0.003070371,0.06234862,0.0004068219,0.9167598],"study_design_scores_gemma":[0.0007968201,0.0003031675,0.0002091067,0.00005241596,0.000007765319,0.0001517075,0.00005412672,0.9905261,0.004742849,0.001913791,0.001136528,0.0001056559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02976299,0.00004121162,0.967342,0.0006098791,0.00194528,0.0001349539,0.00003526027,0.00003132327,0.00009706555],"genre_scores_gemma":[0.4162287,0.000003210903,0.583382,0.0001146303,0.0002521708,0.000003291613,0.000002110713,0.000003752228,0.00001009473],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9746705,"threshold_uncertainty_score":0.4840757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974278282","doi":"10.1142/s0129054107004917","title":"ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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":"Western University; Queen's University","funders":"","keywords":"State (computer science); Nondeterministic algorithm; Computational complexity theory; Estimation; Computer science; Theoretical computer science; Class (philosophy); Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02741647812262987,"gpt":0.2995984270744542,"spread":0.2721819489518243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001794238,0.00007820583,0.0001302682,0.0003942505,0.0001513935,0.0002096473,0.001725573,0.00001312929,0.000008063984],"category_scores_gemma":[0.0001781259,0.00005041635,0.00005453838,0.0004265444,0.0007708956,0.001012898,0.000241703,0.00009785334,0.000001480913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004468155,"about_ca_system_score_gemma":0.0001852201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001610799,"about_ca_topic_score_gemma":0.000006923813,"domain_scores_codex":[0.9986081,0.00004344101,0.0005247052,0.0001246143,0.0005921434,0.000106996],"domain_scores_gemma":[0.9975508,0.0005681144,0.0003942291,0.0002514434,0.001181507,0.00005385421],"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.00002066723,0.0001457391,0.00007909951,0.000002637096,0.00003544663,0.000002037077,0.00153791,0.01244311,0.005641805,0.901848,0.00005057623,0.078193],"study_design_scores_gemma":[0.0003645965,0.0002811641,0.01801492,0.00008731494,0.000003000277,0.00007764246,0.00004719025,0.7465661,0.02375429,0.2106911,0.00003739253,0.00007533051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3766728,0.000009087501,0.6211911,0.001532076,0.0004609324,0.00004387453,0.000002997583,0.000005921846,0.00008116286],"genre_scores_gemma":[0.8948772,0.000006023904,0.1048797,0.0001975814,0.00003198538,4.232868e-7,8.191763e-7,0.000001954978,0.000004332737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7341229,"threshold_uncertainty_score":0.3206573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074221742","doi":"10.1142/s0129054108005838","title":"STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Finite-state machine; Deterministic finite automaton; Alphabet; Intersection (aeronautics); Regular language; Nondeterministic finite automaton; Mathematics; Upper and lower bounds; Automaton; State (computer science); Discrete mathematics; Finite state; Quantum finite automata; Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02956932046349621,"gpt":0.2988042262286668,"spread":0.2692349057651706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000759491,0.00006534955,0.0001670236,0.0005483414,0.00006019081,0.00004395963,0.001192867,0.00001433692,0.000006849481],"category_scores_gemma":[0.00009083493,0.00005721477,0.00006228087,0.000389496,0.000925938,0.001184645,0.0002861537,0.00007319982,5.87059e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003771036,"about_ca_system_score_gemma":0.0001998617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004869755,"about_ca_topic_score_gemma":0.000004220898,"domain_scores_codex":[0.9986169,0.00005182485,0.0005151978,0.0001211452,0.0006135324,0.00008144152],"domain_scores_gemma":[0.9976434,0.0001773434,0.0007397911,0.0001797043,0.001213846,0.00004593921],"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.00012893,0.001028714,0.01963766,0.00008302794,0.0003175061,0.00006559955,0.0170623,0.01650313,0.1021212,0.4194615,0.0003019028,0.4232885],"study_design_scores_gemma":[0.001822203,0.001200943,0.3501113,0.0005765039,0.00001918716,0.001440336,0.0002543434,0.4279215,0.1410374,0.07494493,0.0003540605,0.0003173801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4644504,0.00002732405,0.5347907,0.0002049069,0.0004133458,0.0000196772,0.000003615496,0.000004705409,0.00008536787],"genre_scores_gemma":[0.9039468,0.00003752909,0.09593567,0.00002925218,0.00004093069,2.029742e-7,7.84653e-7,0.00000180316,0.000007048338],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4394964,"threshold_uncertainty_score":0.3411657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003022262","doi":"10.1142/s0129054108005620","title":"AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; String (physics); Combinatorics; Mathematics; Sequence (biology); Function (biology); Discrete mathematics; Mathematical analysis; Mathematical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02601152134161641,"gpt":0.3290096093632813,"spread":0.3029980880216649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008497873,0.00007998155,0.0001516336,0.0003260975,0.0001594882,0.0001696562,0.003305587,0.00002088483,0.00001114736],"category_scores_gemma":[0.00008335526,0.00005827185,0.00008774636,0.0004706735,0.0003788169,0.002450601,0.0002982221,0.0001067095,0.00000150951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006944196,"about_ca_system_score_gemma":0.0005416101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003902504,"about_ca_topic_score_gemma":0.000005983216,"domain_scores_codex":[0.9982067,0.00002395522,0.0005693358,0.0001754637,0.0008775294,0.000147042],"domain_scores_gemma":[0.9974739,0.0002942868,0.0004989747,0.000345438,0.001326766,0.00006061243],"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.0003335642,0.003227313,0.04174154,0.0000359115,0.000280249,0.0001408959,0.006785622,0.1005708,0.01774543,0.3593196,0.001027226,0.4687918],"study_design_scores_gemma":[0.001259965,0.0004122091,0.1327558,0.0001690234,0.000009202214,0.0007805848,0.00003397172,0.8490372,0.003230651,0.01087137,0.001271628,0.0001684084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2905637,0.0000186478,0.7077126,0.0003577486,0.001242159,0.0000612688,0.00000441381,0.000004032458,0.00003546493],"genre_scores_gemma":[0.7682745,0.00001784958,0.2315165,0.00004458202,0.0001368825,0.000001467297,8.651991e-7,0.000002429668,0.000004867499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7484664,"threshold_uncertainty_score":0.6142657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060731856","doi":"10.1142/s0129054104002443","title":"SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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 Waterloo","funders":"","keywords":"Integer (computer science); Binary number; Mathematics; Combinatorics; Hierarchy; Cube (algebra); Word (group theory); Discrete mathematics; Arithmetic; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.00849638401482924,"gpt":0.2899285919874882,"spread":0.2814322079726589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009125499,0.00009066392,0.0001729571,0.0008470195,0.00007024715,0.0001342979,0.001566458,0.00002763197,0.000009469271],"category_scores_gemma":[0.0002224642,0.00008388985,0.00006165041,0.0006692274,0.0003550167,0.001838231,0.0003173691,0.0001492665,0.000001923909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001053077,"about_ca_system_score_gemma":0.0004685337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002234677,"about_ca_topic_score_gemma":0.000006490548,"domain_scores_codex":[0.9981932,0.00003221989,0.0005871885,0.0001842576,0.0008520114,0.0001510914],"domain_scores_gemma":[0.9979435,0.0003856381,0.0005596354,0.00019328,0.0008506482,0.00006725573],"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.0001271355,0.001349932,0.00953675,0.00003283526,0.0001151167,0.0002294738,0.006666796,0.3277098,0.02256893,0.5318648,0.00005989702,0.09973857],"study_design_scores_gemma":[0.005008093,0.00123391,0.1745033,0.001239081,0.00001600743,0.001363541,0.0003674418,0.6573185,0.01256667,0.1440693,0.001751183,0.0005630224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4663056,0.00007371391,0.5319072,0.0008839816,0.0007262428,0.00003003295,0.000004047075,0.000006428719,0.00006278723],"genre_scores_gemma":[0.9062451,0.00004114415,0.09348793,0.000149359,0.00006844597,5.575228e-7,7.696136e-7,0.000002693739,0.000003975176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4399396,"threshold_uncertainty_score":0.3420929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1501444314","doi":"10.1142/s0129054112400515","title":"QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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 Waterloo","funders":"","keywords":"Quotient; Concatenation (mathematics); Mathematics; Regular language; Discrete mathematics; Star (game theory); Combinatorics; Pumping lemma for regular languages; Intersection (aeronautics); Computer science; Theoretical computer science; Automaton; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03215229918022616,"gpt":0.3184217059545243,"spread":0.2862694067742982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001340143,0.00008493943,0.0001788413,0.0005026383,0.00006762797,0.0001162949,0.004048596,0.00001874518,0.00003005022],"category_scores_gemma":[0.00016297,0.00007156475,0.0001080496,0.0004564608,0.0006393909,0.002277627,0.000713128,0.00009299091,0.000004716391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007452713,"about_ca_system_score_gemma":0.0002372612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002020696,"about_ca_topic_score_gemma":0.000001628729,"domain_scores_codex":[0.9979469,0.00004796459,0.0005700255,0.0001210202,0.001130569,0.0001835384],"domain_scores_gemma":[0.9972538,0.0001566105,0.0007250485,0.0004379587,0.001317289,0.000109341],"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.00001890263,0.0006283688,0.0040846,0.0000134789,0.00009552374,0.000006648775,0.002777217,0.001000898,0.008384443,0.9170928,0.0007482899,0.06514882],"study_design_scores_gemma":[0.0032714,0.001113659,0.449171,0.0006362121,0.00005482356,0.001195215,0.0005532856,0.2515096,0.1146976,0.1715488,0.005459591,0.0007887722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2976187,0.0001070576,0.6989694,0.0008985574,0.00194668,0.00003542665,0.000007121991,0.00001214922,0.0004048505],"genre_scores_gemma":[0.7436277,0.000007423891,0.2560851,0.00008560994,0.0001848257,3.398501e-7,7.582203e-7,0.000002170576,0.000006137033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7455441,"threshold_uncertainty_score":0.7523366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062377295","doi":"10.1142/s0129054111008970","title":"THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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":"Carleton University","funders":"","keywords":"Conjecture; Simple (philosophy); Automaton; Mathematics; Scheme (mathematics); Computer science; Discrete mathematics; Calculus (dental); Algebra over a field; Pure mathematics; Theoretical computer science; Epistemology; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.01441121656554072,"gpt":0.2536581839400586,"spread":0.2392469673745178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002040787,0.00006922822,0.00010671,0.0001873221,0.0003143021,0.000484759,0.003371925,0.0000132985,0.000005265541],"category_scores_gemma":[0.0001454809,0.00003556627,0.00007245093,0.0003378291,0.001017226,0.001056414,0.000447903,0.0001277464,0.000002927979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003000016,"about_ca_system_score_gemma":0.0002051974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001389844,"about_ca_topic_score_gemma":0.000001629591,"domain_scores_codex":[0.9986517,0.0000699046,0.0003773368,0.0001235941,0.0006575418,0.000119885],"domain_scores_gemma":[0.9979682,0.0005277852,0.0004644726,0.0002702493,0.0007213804,0.00004793111],"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.00002582633,0.00003046052,0.0002881291,0.000001019277,0.00004739905,0.000007101542,0.002876092,0.0001268066,0.000119746,0.8155006,0.0001406204,0.1808362],"study_design_scores_gemma":[0.003354327,0.0002864039,0.03927005,0.0001444806,0.00003061924,0.002138756,0.0002362413,0.4099406,0.004245509,0.5306881,0.009382836,0.0002820967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04719476,0.0002196719,0.9453818,0.004337957,0.002160621,0.00005775704,5.867773e-7,0.00001112602,0.0006356815],"genre_scores_gemma":[0.9522575,0.00007530387,0.04722541,0.0002862002,0.0001343786,9.165996e-7,1.01906e-7,0.00000197529,0.00001817995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9050628,"threshold_uncertainty_score":0.6265932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099378738","doi":"10.1142/s0129054105003467","title":"BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Decidability; Discrete mathematics; Characterization (materials science); Property (philosophy); Mathematics; Context (archaeology); Hamming code; Hamming distance; Computer science; Combinatorics; Algorithm; Block code","retraction":null,"screen_n_in":null,"score":{"opus":0.01543495050001134,"gpt":0.3606698463397361,"spread":0.3452348958397248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007074788,0.00005135152,0.00007670961,0.0001188774,0.00006905544,0.00006744118,0.0005168265,0.00002787869,0.000007173152],"category_scores_gemma":[0.000246245,0.00004165361,0.00004424703,0.0001098527,0.0003180388,0.0000484281,0.0002368448,0.00004746129,4.281848e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001738915,"about_ca_system_score_gemma":0.00009897824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002865702,"about_ca_topic_score_gemma":0.000002181959,"domain_scores_codex":[0.9992835,0.000032692,0.000291992,0.000107547,0.0002100604,0.00007421299],"domain_scores_gemma":[0.9988658,0.00003034763,0.0002581767,0.0001147315,0.000687899,0.00004308307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005529324,0.0001214965,0.0100543,0.000006578904,0.00008161883,0.000002006483,0.0001435779,0.001066425,0.196567,0.02158012,0.0004268624,0.7698947],"study_design_scores_gemma":[0.004016325,0.001887944,0.144917,0.0002064076,0.00008298495,0.003152285,0.000470899,0.04525355,0.6665817,0.01899582,0.1136689,0.0007662103],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4101314,0.000114705,0.5884967,0.000578036,0.0002891195,0.00002265193,0.000003007816,0.000002448587,0.0003619159],"genre_scores_gemma":[0.5620844,0.0000328075,0.4375193,0.0001102208,0.0002425063,2.154012e-7,0.0000032929,0.00000116761,0.000006064419],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7691285,"threshold_uncertainty_score":0.1698585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046033718","doi":"10.1142/s0129054103002151","title":"LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"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 en Outaouais","funders":"","keywords":"Prefix code; Concatenation (mathematics); Prefix; Prime (order theory); Mathematics; Discrete mathematics; Regular language; Combinatorics; Linear code; Automaton; Computer science; Algorithm; Theoretical computer science; Block code; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.009870597442700342,"gpt":0.2953084454662966,"spread":0.2854378480235963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483502,0.00009876275,0.000211608,0.000568913,0.00008627393,0.0001538126,0.002407746,0.00002910886,0.00002980667],"category_scores_gemma":[0.0001558401,0.00008794754,0.0001243761,0.0005697915,0.0003704482,0.001794228,0.0002068524,0.00009416793,0.000009472639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007891784,"about_ca_system_score_gemma":0.0004251011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004107853,"about_ca_topic_score_gemma":3.030716e-7,"domain_scores_codex":[0.9978506,0.00008688815,0.0006906539,0.0001908264,0.001037379,0.0001436812],"domain_scores_gemma":[0.9966021,0.0001973282,0.000840374,0.0003450682,0.001934564,0.00008063509],"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.00004245389,0.0008694023,0.001068124,0.00001847729,0.0002158678,0.00002575386,0.001228986,0.01269202,0.2527564,0.6150313,0.000422914,0.1156283],"study_design_scores_gemma":[0.001356281,0.000687817,0.01158324,0.000427276,0.00002938839,0.001021304,0.00002494062,0.3706021,0.5291335,0.08227029,0.002520356,0.0003434848],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1755508,0.0000490782,0.8225799,0.0003825524,0.0009837509,0.00004840969,0.000002961615,0.00001410069,0.0003884519],"genre_scores_gemma":[0.6478011,0.000009047689,0.3520528,0.00004968327,0.00006584531,4.729499e-7,0.000001005234,0.000002765134,0.00001722978],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.532761,"threshold_uncertainty_score":0.4474232,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053288014","doi":"10.1142/s0129054109007005","title":"AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS","year":2009,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Strong","keywords":"Indeterminate; Algorithm; Matching (statistics); Computer science; String searching algorithm; Pattern matching; Hybrid algorithm (constraint satisfaction); Successor cardinal; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0150100370285392,"gpt":0.3052397887745584,"spread":0.2902297517460192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008407883,0.0001474745,0.0002016357,0.0007772309,0.0001828254,0.0006104696,0.004345744,0.00002470986,0.000008316587],"category_scores_gemma":[0.00003227067,0.0001260473,0.00009704135,0.0003850985,0.0001612268,0.004603222,0.0002902298,0.0002291648,0.000006847742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001360515,"about_ca_system_score_gemma":0.0003190076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001728323,"about_ca_topic_score_gemma":5.06712e-7,"domain_scores_codex":[0.9973045,0.0000542159,0.000600274,0.0003260962,0.0015035,0.0002114006],"domain_scores_gemma":[0.9971134,0.0001120239,0.000717862,0.000460674,0.001430499,0.0001655336],"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.00001155339,0.0002298726,0.00002786442,6.33225e-7,0.00001416924,0.00005320038,0.0003142054,0.00413236,0.001045664,0.006365125,0.00006154732,0.9877438],"study_design_scores_gemma":[0.0007006717,0.001981449,0.01470629,0.00024374,0.000006674676,0.0004797863,0.00002230448,0.9451463,0.01062039,0.02543335,0.000414612,0.0002444287],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06609552,0.00001133703,0.9312893,0.0006750014,0.001717776,0.00005669265,0.00001081664,0.00002459589,0.0001189537],"genre_scores_gemma":[0.6796204,0.000007459391,0.3197837,0.0003288677,0.0002514375,4.105359e-7,0.000002198987,0.000002794946,0.000002700416],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9874994,"threshold_uncertainty_score":0.8075546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972572665","doi":"10.1142/s0129054113400315","title":"THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Edit distance; Context-free language; Regular language; Computer science; String (physics); Nondeterministic finite automaton; Regular expression; Deterministic pushdown automaton; Unary operation; Formal language; Automaton; Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Programming language; Rule-based machine translation; Artificial intelligence; Automata theory","retraction":null,"screen_n_in":null,"score":{"opus":0.007283888517623,"gpt":0.2653929551883784,"spread":0.2581090666707554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001033792,0.00008633532,0.0001367817,0.000218878,0.0001918532,0.0007794276,0.004012633,0.00001968937,0.000009338339],"category_scores_gemma":[0.0002512875,0.00005939528,0.00006248296,0.0003211835,0.0005567223,0.001832916,0.0006452355,0.0001180734,0.000006890757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005138717,"about_ca_system_score_gemma":0.0001744013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004763717,"about_ca_topic_score_gemma":0.000007065551,"domain_scores_codex":[0.9983853,0.00004708928,0.0004239576,0.0001653261,0.0008173523,0.0001609989],"domain_scores_gemma":[0.9976889,0.0004361102,0.0004451218,0.0004705808,0.0008679911,0.0000912254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005098207,0.00004136154,0.0008467966,0.000004077032,0.00006375103,0.00001494096,0.003652947,0.0000399107,0.002946608,0.1446865,0.001809841,0.8458882],"study_design_scores_gemma":[0.005686214,0.001173226,0.2153339,0.001013313,0.00007423422,0.001477768,0.004908857,0.322931,0.03212737,0.3806223,0.03336475,0.001287097],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2770685,0.0004810123,0.7154863,0.005597116,0.001107348,0.00007695609,0.000004316395,0.00001830351,0.00016013],"genre_scores_gemma":[0.9459009,0.0000263613,0.05347518,0.0001882449,0.0003632566,0.000002149196,6.051939e-7,0.00000324617,0.00004011864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8446011,"threshold_uncertainty_score":0.7516038,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057447340","doi":"10.1142/s0129054107005145","title":"INVOLUTIVELY BORDERED WORDS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Prefix; Suffix; Alphabet; Mathematics; Combinatorics on words; Combinatorics; Watson; Word (group theory); Involution (esoterism); Discrete mathematics; Computer science; Biology; Linguistics; Natural language processing","retraction":null,"screen_n_in":null,"score":{"opus":0.01718857657105889,"gpt":0.3233007750085465,"spread":0.3061121984374877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009452687,0.00005428878,0.00007618862,0.0001811735,0.0000569677,0.00004536053,0.0007801834,0.00002557242,0.000007171491],"category_scores_gemma":[0.0001853737,0.00004357452,0.00006997812,0.0001983094,0.0002913583,0.00002685621,0.0001858883,0.00006027134,0.000001463035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002448746,"about_ca_system_score_gemma":0.0001807249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003838898,"about_ca_topic_score_gemma":0.000004013386,"domain_scores_codex":[0.9990557,0.00001444558,0.0003380949,0.0001128776,0.0003641083,0.0001148137],"domain_scores_gemma":[0.9983782,0.00003514874,0.0002851007,0.00008899085,0.001155338,0.00005719323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001725704,0.0002552157,0.01740126,0.000003213903,0.000108697,0.00001477727,0.0001665385,0.00107776,0.676206,0.005122644,0.0004102628,0.299061],"study_design_scores_gemma":[0.001797661,0.002173893,0.4970822,0.0001382863,0.00002221019,0.0005242334,0.0001484535,0.003723909,0.4346405,0.003958044,0.05535631,0.0004342543],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6174587,0.0000369743,0.3810752,0.0001615045,0.0008007608,0.00001688892,0.000001144224,0.000001640058,0.0004471415],"genre_scores_gemma":[0.9526243,0.00001713869,0.0467266,0.000144128,0.0004656954,1.552385e-7,0.000002823299,0.000001917656,0.0000173065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.479681,"threshold_uncertainty_score":0.1776917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964048382","doi":"10.1142/s0129054112400655","title":"THE CRITICAL EXPONENT IS COMPUTABLE FOR AUTOMATIC SEQUENCES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"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":"Tulane University","keywords":"Exponent; Infimum and supremum; Mathematics; Critical exponent; Rational number; Computation; Constant (computer programming); Discrete mathematics; Sequence (biology); Diophantine equation; Diophantine approximation; Combinatorics; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02862647734812847,"gpt":0.3462912195548554,"spread":0.317664742206727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00229779,0.00009283841,0.0001465777,0.0002547046,0.0003568867,0.0006260264,0.003434743,0.00002064218,0.00001177233],"category_scores_gemma":[0.0003276847,0.00006344116,0.0001277312,0.0003555957,0.0006010358,0.002767097,0.0003471433,0.00008682131,0.000007731157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009478074,"about_ca_system_score_gemma":0.000352101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004468085,"about_ca_topic_score_gemma":2.988755e-7,"domain_scores_codex":[0.9979418,0.00004664158,0.0005852923,0.0001399128,0.001000295,0.0002860917],"domain_scores_gemma":[0.9963591,0.001224773,0.00042473,0.0002913616,0.001573528,0.0001265741],"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.000009631956,0.0002466688,0.0008315755,0.00001139128,0.00007482772,0.000002403111,0.001828059,0.0007859052,0.001563082,0.7500067,0.001921107,0.2427187],"study_design_scores_gemma":[0.0005238627,0.0002849025,0.00773775,0.0001621234,0.00001713621,0.0004763475,0.0001054657,0.8639601,0.01085565,0.1002325,0.01542639,0.0002177648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04117853,0.0002178154,0.9457983,0.007512244,0.005101101,0.00007802085,0.000003427902,0.00001963183,0.00009087301],"genre_scores_gemma":[0.7164978,0.00001410967,0.2828409,0.0003042147,0.0003275177,0.000003179746,3.00161e-7,0.000002662766,0.000009334422],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8631742,"threshold_uncertainty_score":0.6382664,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077220764","doi":"10.1142/s0129054110007155","title":"SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Ambiguity; Word (group theory); Matrix (chemical analysis); Alphabet; Image (mathematics); Combinatorics; Binary number; Mathematics; Palindrome; Variance (accounting); Logical matrix; Characterization (materials science); Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Arithmetic; Linguistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.008635601422458672,"gpt":0.2860126926709665,"spread":0.2773770912485078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119027,0.00009106497,0.0001417404,0.0005641733,0.0001234368,0.0006552318,0.002878756,0.00002504658,0.00002131688],"category_scores_gemma":[0.0001309832,0.00007495331,0.00006038987,0.0004718098,0.0005354435,0.002684236,0.0004488237,0.000182752,0.000004676676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002062632,"about_ca_system_score_gemma":0.0003313883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001577648,"about_ca_topic_score_gemma":0.000003938793,"domain_scores_codex":[0.998377,0.00002535186,0.0004438713,0.0001997918,0.0008106646,0.0001433522],"domain_scores_gemma":[0.9977621,0.0002314543,0.000534521,0.000252529,0.001117452,0.0001019615],"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.00001441134,0.0002174205,0.007106544,0.0000112425,0.00005531967,0.00003024939,0.0007333723,0.0001790789,0.0346866,0.2554599,0.0009441858,0.7005617],"study_design_scores_gemma":[0.00266887,0.0008887523,0.240177,0.0003737236,0.00005112776,0.004640965,0.0001130704,0.4619049,0.08112489,0.1846176,0.02243464,0.001004397],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3417321,0.00006511209,0.6524671,0.001716182,0.003712621,0.00004488883,0.000003381508,0.00001879431,0.0002398692],"genre_scores_gemma":[0.7910013,0.00003408275,0.2086609,0.00008635032,0.0002084458,6.589054e-7,4.74147e-7,0.000001927124,0.000005938294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6995573,"threshold_uncertainty_score":0.6318415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570765932","doi":"10.1142/s0129054111008052","title":"CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Algebra and Logic","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Closure (psychology); Mathematics; Complement (music); Separation axiom; Axiom; Discrete mathematics; Regular language; Partition (number theory); Formal language; Abstract family of languages; Concatenation (mathematics); Topological space; Pure mathematics; Combinatorics; Computer science; Algorithm; Theoretical computer science; Second-generation programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01872716622195174,"gpt":0.3057454771416453,"spread":0.2870183109196935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684194,0.000065502,0.000110056,0.0005019867,0.00005404817,0.0001098005,0.001592682,0.00001656801,0.00001282078],"category_scores_gemma":[0.00007458822,0.00005224229,0.00003808631,0.00034904,0.0003055514,0.002686279,0.0003142306,0.00009260936,0.00000168842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003121253,"about_ca_system_score_gemma":0.0001509114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009577647,"about_ca_topic_score_gemma":0.000005421102,"domain_scores_codex":[0.9989042,0.00002626235,0.0003532995,0.0001309478,0.0004525171,0.0001327164],"domain_scores_gemma":[0.9989033,0.000084915,0.0002876452,0.000146249,0.0005223436,0.00005556397],"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.00001628354,0.0001072288,0.005683525,0.000002573686,0.00001625258,0.0000432319,0.002600896,0.0002923313,0.001260787,0.7691805,0.00001385759,0.2207825],"study_design_scores_gemma":[0.001994707,0.00100086,0.5052297,0.0002370299,0.00001077787,0.0015289,0.0003372031,0.05984915,0.02314058,0.4053552,0.0008895273,0.0004264449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2902007,0.00006421842,0.7077637,0.0002450632,0.0005255592,0.00002806108,5.697078e-7,0.000007092718,0.00116499],"genre_scores_gemma":[0.8074372,0.00002110875,0.1923907,0.00008896311,0.00005550716,4.701383e-7,1.400964e-7,0.00000139362,0.000004543061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5172365,"threshold_uncertainty_score":0.2959626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001923775","doi":"10.1142/s0129054106004467","title":"A SIMPLE ALPHABET-INDEPENDENT FM-INDEX","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"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":"Huffman coding; Substring; Alphabet; Algorithm; Computer science; Mathematics; Entropy (arrow of time); Simple (philosophy); Combinatorics; Order (exchange); Index (typography); Discrete mathematics; Data structure; Data compression; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01057454723675103,"gpt":0.2872282731876885,"spread":0.2766537259509374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008255857,0.000115632,0.0001794288,0.0006785233,0.0001581334,0.000552425,0.004117552,0.00003044796,0.00002733027],"category_scores_gemma":[0.00004867334,0.00009843816,0.0001164675,0.0005938465,0.0002450787,0.003054596,0.0007533712,0.0001412573,0.0000114626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001242925,"about_ca_system_score_gemma":0.0004616664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009076729,"about_ca_topic_score_gemma":0.000008424704,"domain_scores_codex":[0.9970569,0.00003278736,0.0007023101,0.0002562568,0.001746073,0.0002056654],"domain_scores_gemma":[0.9967092,0.0001117677,0.0007069386,0.0004085963,0.001964636,0.0000988417],"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.00005704453,0.001359181,0.01715285,0.00001330592,0.000148937,0.000190841,0.000472336,0.05699481,0.01678605,0.3502933,0.008470036,0.5480613],"study_design_scores_gemma":[0.001348529,0.000290278,0.1148953,0.0000992821,0.00001095398,0.0005741011,0.00001496487,0.7939208,0.01020528,0.06148019,0.01685585,0.000304436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03909516,0.00004421324,0.9572037,0.000770776,0.002335622,0.00005197654,0.000005812283,0.00002083924,0.0004718977],"genre_scores_gemma":[0.8307461,0.000006387518,0.1687039,0.0000973991,0.0004194471,6.1105e-7,0.000003411695,0.000003496373,0.00001927507],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7916509,"threshold_uncertainty_score":0.7651505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169267790","doi":"10.1142/s0129054111009045","title":"STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Catenation; Intersection (aeronautics); State (computer science); Combined operations; Mathematics; Computer science; Algorithm; Engineering; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.04102082880490474,"gpt":0.2955954996665427,"spread":0.254574670861638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001362292,0.0001120803,0.0002002103,0.0008672365,0.0001449436,0.0001944957,0.00166728,0.00002125657,0.00002061915],"category_scores_gemma":[0.0001052828,0.0001000915,0.00007420241,0.000585346,0.0007404673,0.002828144,0.0003186696,0.0001075092,0.000002602805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009849363,"about_ca_system_score_gemma":0.0003294375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000240501,"about_ca_topic_score_gemma":0.00004010594,"domain_scores_codex":[0.9980027,0.00008944712,0.0007759699,0.0002147956,0.0007840244,0.0001330773],"domain_scores_gemma":[0.9959652,0.0001014411,0.0006532719,0.000263985,0.002930472,0.00008562864],"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.00006044937,0.0006790684,0.003584518,0.00001892216,0.0001738431,0.00001184552,0.008940293,0.005799653,0.0253333,0.861789,0.00008370907,0.09352534],"study_design_scores_gemma":[0.002006054,0.0007096214,0.1097888,0.0002105185,0.00002284523,0.0003817275,0.0001463373,0.6463162,0.0602204,0.1798487,0.00006584158,0.000282869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3241843,0.00001756533,0.6738212,0.0004902474,0.001221928,0.00006945009,0.00000489815,0.0000150501,0.0001753597],"genre_scores_gemma":[0.8286456,0.00002054923,0.1712024,0.00006395491,0.00004949765,0.00000154614,0.000002949491,0.00000363101,0.000009851207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6819404,"threshold_uncertainty_score":0.4081615,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996179839","doi":"10.1142/s012905410600398x","title":"PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":20,"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":"Centre National de la Recherche Scientifique","keywords":"Corollary; Mathematics; Combinatorics; Property (philosophy); Square lattice; Lattice (music); Reentrancy; Hexagonal lattice; Hexagonal crystal system; Discrete valuation; Polyomino; Salient; Discrete mathematics; Pure mathematics; Geometry; Computer science; Statistical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01818290402632325,"gpt":0.2840745121671717,"spread":0.2658916081408484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006306958,0.00007937564,0.0001654284,0.0003136745,0.00005957214,0.0002445874,0.003922811,0.00001697788,0.000001563547],"category_scores_gemma":[0.0001379617,0.00005231437,0.0001144996,0.0005198226,0.0008032223,0.002396908,0.0005823314,0.00007956548,4.681893e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005152686,"about_ca_system_score_gemma":0.0006086025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003720118,"about_ca_topic_score_gemma":0.000003046769,"domain_scores_codex":[0.9978901,0.00003051659,0.00068368,0.0001304885,0.001160476,0.0001047835],"domain_scores_gemma":[0.9956515,0.00005320282,0.001115932,0.0003074177,0.002843344,0.00002864827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006391353,0.001217912,0.01119862,0.0001164561,0.0001667296,0.00001645362,0.002212731,0.006343548,0.3667527,0.3645996,0.001700421,0.2456108],"study_design_scores_gemma":[0.0005630734,0.0002927724,0.03401039,0.00115949,0.00001582424,0.0002501456,0.00002157837,0.08701527,0.7987954,0.07712934,0.0005426535,0.0002040379],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1502232,0.00007353654,0.8468707,0.001294469,0.0007099672,0.00006235792,0.000003870074,0.00001339724,0.0007485315],"genre_scores_gemma":[0.8191519,0.000003158491,0.1807438,0.00003545043,0.00004359819,6.802622e-7,1.845906e-7,0.00000235898,0.0000189492],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6689286,"threshold_uncertainty_score":0.7289624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010556217","doi":"10.1142/s0129054111008556","title":"BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Multiplication (music); Speedup; Matrix multiplication; Computation; Computer science; Parallel computing; Univariate; Multiplication algorithm; Symbolic computation; Bivariate analysis; Polynomial; Fast Fourier transform; Mathematics; Arithmetic; Algorithm; Combinatorics; Multivariate statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0428232199411026,"gpt":0.3180081989553516,"spread":0.275184979014249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007333399,0.0001114493,0.0001581128,0.0007866977,0.0001248158,0.0001806771,0.003138869,0.00003384776,0.000009153184],"category_scores_gemma":[0.0001728066,0.00009984373,0.0001010021,0.0005096654,0.0002627406,0.001204256,0.0002816549,0.0001270872,0.00001104289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001022183,"about_ca_system_score_gemma":0.0003202995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001808233,"about_ca_topic_score_gemma":0.000001429988,"domain_scores_codex":[0.9981974,0.00004794569,0.0005924951,0.0002435027,0.0007642579,0.0001544362],"domain_scores_gemma":[0.9967464,0.0001082912,0.0007434773,0.0003728887,0.001934387,0.00009457012],"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.0003899811,0.003819337,0.0152182,0.00001914036,0.0003349555,0.00008275551,0.01082062,0.07210596,0.02396872,0.1871042,0.004571453,0.6815647],"study_design_scores_gemma":[0.001394337,0.0006304096,0.07519676,0.0001560317,0.000009154347,0.000200561,0.000014686,0.8534501,0.0648986,0.002927197,0.0008305003,0.0002917281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03666643,0.00001312481,0.9607825,0.000369163,0.001528154,0.0000730032,0.000001530864,0.00005700253,0.0005091396],"genre_scores_gemma":[0.5400647,0.00001042802,0.4597079,0.0001195984,0.00008284048,0.000001131256,5.426343e-7,0.000002618085,0.0000102213],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7813441,"threshold_uncertainty_score":0.5832851,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071427315","doi":"10.1142/s0129054103002023","title":"QUANTUM SOFTWARE REUSABILITY","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"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":"Division of Mathematical Sciences; National Science Foundation","keywords":"Computer science; Quantum circuit; Quantum Fourier transform; Quantum algorithm; Quantum phase estimation algorithm; Quantum network; Theoretical computer science; Quantum gate; Quantum; Quantum computer; Quantum error correction; Algorithm; Mathematics; Topology (electrical circuits); Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01462380469152812,"gpt":0.2890170193050417,"spread":0.2743932146135136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001705786,0.0001147495,0.0001918658,0.0005380102,0.000164252,0.0003318751,0.003466021,0.0000276911,0.00001415661],"category_scores_gemma":[0.0007074609,0.00009706753,0.0001436269,0.0007905664,0.0004050544,0.001192611,0.000325753,0.0001954694,0.000006258638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009274109,"about_ca_system_score_gemma":0.0008004375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005779416,"about_ca_topic_score_gemma":7.086101e-7,"domain_scores_codex":[0.997587,0.00008756949,0.0006480173,0.0002616851,0.001211664,0.0002041132],"domain_scores_gemma":[0.9963554,0.0002804783,0.0005985847,0.0004524116,0.002189418,0.000123755],"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.00001613191,0.0006138032,0.004296458,0.0000148621,0.0001153564,0.00005338537,0.001579563,0.05667483,0.002381877,0.4796146,0.0005148927,0.4541243],"study_design_scores_gemma":[0.001452939,0.0008457347,0.02871928,0.0002721877,0.00001768844,0.002174784,0.000036269,0.7191947,0.01290596,0.2145431,0.01928813,0.0005492243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1190276,0.00004241578,0.8761456,0.0009375783,0.003628856,0.00004236758,0.000001474334,0.00002496692,0.0001490796],"genre_scores_gemma":[0.5398838,0.00000445934,0.4599139,0.00008467922,0.0001054094,3.2087e-7,2.137832e-7,0.000002456842,0.000004717941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6625199,"threshold_uncertainty_score":0.6440786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2590512199","doi":"10.1142/s0129054116500386","title":"Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties","year":2016,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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 Waterloo","funders":"","keywords":"Fibonacci number; Enumeration; Abelian group; Representation (politics); Mathematics; Word (group theory); Combinatorics; Discrete mathematics; Class (philosophy); State (computer science); Function (biology); Algorithm; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02227528627460695,"gpt":0.2935118611464839,"spread":0.271236574871877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001098777,0.0000990374,0.0001626516,0.0005189311,0.0001513974,0.0004090401,0.001663209,0.00002534028,0.000008408732],"category_scores_gemma":[0.0002186627,0.0000632543,0.00007284769,0.0002888722,0.0002810542,0.002777553,0.0002703271,0.00004498179,0.000002967743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007934516,"about_ca_system_score_gemma":0.0002915591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004735481,"about_ca_topic_score_gemma":0.000001782272,"domain_scores_codex":[0.9982855,0.00002563603,0.0005725693,0.0002164177,0.0007511969,0.0001486283],"domain_scores_gemma":[0.9974959,0.0003674979,0.0004809251,0.000233503,0.001339902,0.00008227977],"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.00001359059,0.00005536576,0.000106446,0.000004399858,0.00002499855,0.000001884811,0.0004448027,0.0001086737,0.01157938,0.02576748,0.0001388304,0.9617541],"study_design_scores_gemma":[0.002935452,0.0006852758,0.01135333,0.001152766,0.00002095795,0.0005304395,0.00005044687,0.8360527,0.03735743,0.1060911,0.003406405,0.0003636924],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1517297,0.00008444921,0.8442184,0.002179963,0.001654614,0.00009609648,0.000003041537,0.00001877343,0.00001497081],"genre_scores_gemma":[0.6707301,0.00003397508,0.3289701,0.00009068251,0.0001510022,0.000003243499,3.347096e-7,0.000003107579,0.00001749227],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9613904,"threshold_uncertainty_score":0.3944384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146148441","doi":"10.1142/s0129054112400059","title":"FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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":"Saint Mary's University","funders":"","keywords":"Decidability; Property (philosophy); Formal language; Computer science; Regular language; Programming language; Code (set theory); Coding (social sciences); Mathematics; Theoretical computer science; Automaton","retraction":null,"screen_n_in":null,"score":{"opus":0.07281263454795484,"gpt":0.3521866772893369,"spread":0.2793740427413821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001956957,0.00009873394,0.0001881715,0.0005703705,0.000143438,0.0001878215,0.002619844,0.00002162611,0.00004316606],"category_scores_gemma":[0.00009064209,0.00008314833,0.0001229651,0.0005552733,0.0005969572,0.005780163,0.0006219483,0.0000938359,0.000004735388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001416856,"about_ca_system_score_gemma":0.0004286028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003033673,"about_ca_topic_score_gemma":0.000009405591,"domain_scores_codex":[0.9975712,0.00006245793,0.0008518749,0.0001400093,0.001126385,0.0002480244],"domain_scores_gemma":[0.9966839,0.0001095731,0.0008162936,0.000312412,0.001960853,0.0001169788],"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.0000389735,0.0009947184,0.0207002,0.0000295476,0.0001519808,0.000002354981,0.006048269,0.001487586,0.04092425,0.6643286,0.0003648681,0.2649286],"study_design_scores_gemma":[0.003354927,0.001443538,0.4737116,0.0005137288,0.00007943999,0.001210502,0.001095264,0.2246967,0.1893483,0.0999705,0.003815852,0.0007596727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3507104,0.00004031911,0.6470787,0.0004983698,0.001468452,0.0000730738,0.00000760164,0.00001130979,0.0001117999],"genre_scores_gemma":[0.8045805,0.000006638305,0.1951672,0.00008032284,0.0001553725,0.000001948995,0.000001768684,0.000002946378,0.000003338119],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5643581,"threshold_uncertainty_score":0.4868366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994383533","doi":"10.1142/s0129054105003157","title":"STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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 Waterloo","funders":"","keywords":"Monoid; State (computer science); Syntactic monoid; Set (abstract data type); Root (linguistics); Mathematics; Free monoid; Regular language; Finite-state machine; Finite set; Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02362928073566646,"gpt":0.2931312758776484,"spread":0.269501995141982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471686,0.00007101161,0.0001942643,0.0003856432,0.00008649602,0.0001133516,0.001977593,0.00001255344,0.000008947511],"category_scores_gemma":[0.00008384368,0.00004974096,0.00009518789,0.0004177895,0.001200328,0.001676235,0.0002098584,0.00008842015,0.000001031537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002805312,"about_ca_system_score_gemma":0.0002359908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001938924,"about_ca_topic_score_gemma":0.00000594435,"domain_scores_codex":[0.9982924,0.00006162865,0.0007303647,0.000100762,0.0007186124,0.00009626817],"domain_scores_gemma":[0.9973412,0.0004251824,0.0007594874,0.0002277103,0.001199472,0.00004695609],"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.0000953148,0.0002713031,0.0004570475,0.00002315582,0.0001483074,0.000002023727,0.01295353,0.03782202,0.002784705,0.6883178,0.0001400021,0.2569848],"study_design_scores_gemma":[0.001537942,0.0001403715,0.008499186,0.0001110291,0.0000129976,0.0001280247,0.00006153894,0.9016171,0.009017411,0.07816547,0.0006181339,0.0000908293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2006081,0.00006407322,0.7958196,0.002975162,0.0002989211,0.00005761475,0.00001460971,0.000005125111,0.0001567791],"genre_scores_gemma":[0.8678965,0.00005271232,0.1318979,0.000102708,0.00004291895,6.750583e-7,7.500411e-7,0.000001557998,0.00000432028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.863795,"threshold_uncertainty_score":0.4422657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2952369254","doi":"10.1142/s0129054103002047","title":"ANALYSIS OF QUANTUM FUNCTIONS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","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 Ottawa","funders":"","keywords":"Quantum algorithm; Quantum; Quantum operation; Quantum computer; Quantum capacity; Mathematics; Oracle; Computer science; Theoretical computer science; Quantum network; Open quantum system; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01346643962724772,"gpt":0.2863128427988463,"spread":0.2728464031715986,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001211083,0.00009799397,0.0002750571,0.002002427,0.0001172128,0.0001683131,0.002357879,0.00002369394,0.0000212797],"category_scores_gemma":[0.0002201071,0.00008398897,0.0002720538,0.002898201,0.0003367071,0.0008079545,0.000200308,0.0001345035,0.000002417771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005439723,"about_ca_system_score_gemma":0.0005553635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001131179,"about_ca_topic_score_gemma":0.000001857643,"domain_scores_codex":[0.9977049,0.00006849781,0.0007365568,0.0002106716,0.001123819,0.0001555638],"domain_scores_gemma":[0.9960728,0.0002434518,0.0008587153,0.0003728013,0.00236044,0.00009184866],"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.00001119632,0.0004843455,0.006007177,0.000006533394,0.001125218,0.00001525932,0.001291302,0.5216978,0.003194601,0.3652637,0.0001668886,0.100736],"study_design_scores_gemma":[0.0002688824,0.0001826973,0.0205498,0.00003821323,0.00007960214,0.0001100068,0.00001915415,0.9704711,0.001915169,0.004950425,0.001311743,0.0001032364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1650985,0.00003633113,0.8320607,0.0004225801,0.002092483,0.00002739548,0.00000389618,0.00001028255,0.000247846],"genre_scores_gemma":[0.82365,0.000006633914,0.1762153,0.00004912866,0.00006516642,3.27183e-7,8.605609e-7,0.000002302726,0.00001027839],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6585515,"threshold_uncertainty_score":0.4381565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2802228513","doi":"10.1142/s0129054118420017","title":"Rigidity and Substitutive Dendric Words","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Aperiodic graph; Rigidity (electromagnetism); Algebraic number; Word (group theory); Extension (predicate logic); Discrete mathematics; Class (philosophy); Graph; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01495877571196648,"gpt":0.2995764434481059,"spread":0.2846176677361394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009069304,0.00007546583,0.0001219309,0.000494134,0.0001460072,0.00034556,0.002229369,0.00001835764,0.00001703903],"category_scores_gemma":[0.0001127846,0.00006367622,0.00005001445,0.0005417106,0.0009659386,0.002156683,0.0004350572,0.00008352398,0.000008422018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006326645,"about_ca_system_score_gemma":0.0003372128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008452205,"about_ca_topic_score_gemma":0.000002700599,"domain_scores_codex":[0.9985679,0.00003036529,0.0003638608,0.0001790128,0.000730482,0.0001283827],"domain_scores_gemma":[0.9975157,0.0001395505,0.0003930542,0.0002216176,0.001642206,0.00008791511],"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.0000226709,0.0001931787,0.002910612,0.000004308973,0.00008346934,0.00002903539,0.002473723,0.0001819679,0.005967417,0.6520903,0.0004726304,0.3355707],"study_design_scores_gemma":[0.002152795,0.00139686,0.2133205,0.0004285699,0.00003521797,0.002849727,0.0001217587,0.461642,0.0595332,0.2468537,0.01101551,0.0006500726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2609273,0.00003241472,0.7357432,0.0006359736,0.002169236,0.00002409662,0.000001219181,0.00001166493,0.0004548162],"genre_scores_gemma":[0.8289748,0.00001528765,0.1705379,0.0001346792,0.0003259192,3.246819e-7,2.093631e-7,0.00000163385,0.000009194607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5680475,"threshold_uncertainty_score":0.4142759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131225295","doi":"10.1142/s0129054107004905","title":"INFORMATION DISTANCE AND ITS APPLICATIONS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Universality (dynamical systems); Computer science; Information theory; Theoretical computer science; Tracing; Range (aeronautics); Triangle inequality; Mathematics; Discrete mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01218228403692906,"gpt":0.2975188154901351,"spread":0.285336531453206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001850688,0.00009968043,0.000147893,0.0007413329,0.0001487979,0.0004095431,0.002495987,0.00002802566,0.00000514923],"category_scores_gemma":[0.0001864524,0.00009267117,0.00006386054,0.0008831727,0.0002911171,0.004726924,0.0005088689,0.000129744,0.000008415884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001469318,"about_ca_system_score_gemma":0.0003363434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004340306,"about_ca_topic_score_gemma":0.000003011869,"domain_scores_codex":[0.9977573,0.00002067511,0.0007844627,0.0001564402,0.001100866,0.0001803224],"domain_scores_gemma":[0.9954164,0.0003069111,0.0006944146,0.0002785773,0.003168103,0.0001355918],"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.00001198997,0.0001400258,0.0008268501,0.00001092434,0.00002849283,0.000004710665,0.0009199717,0.002280711,0.0006844893,0.3667213,0.00004969291,0.6283208],"study_design_scores_gemma":[0.001861526,0.0005967111,0.1049752,0.0001709705,0.00002443925,0.001385327,0.0001519213,0.7390155,0.01251598,0.08849628,0.05015923,0.0006469547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01840322,0.00007981578,0.9784797,0.00114588,0.001296828,0.000128327,0.000003417995,0.00002420555,0.0004386375],"genre_scores_gemma":[0.744974,0.00002002985,0.2547104,0.000124836,0.0001620315,0.000001673282,0.000001041576,0.000001718056,0.000004296608],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7367347,"threshold_uncertainty_score":0.4638206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967415065","doi":"10.1142/s0129054112400709","title":"BOUNDED PARIKH AUTOMATA","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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":"Université de Montréal","funders":"","keywords":"Bounded function; Class (philosophy); Automaton; Set (abstract data type); Discrete mathematics; Affine transformation; Mathematics; Word (group theory); Regular language; Pure mathematics; Computer science; Theoretical computer science; Programming language; Artificial intelligence; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01829245612019108,"gpt":0.3058326623659386,"spread":0.2875402062457475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001754352,0.00009864806,0.0001621654,0.0005923409,0.0001247143,0.0004161173,0.00399689,0.00002540584,0.00002670878],"category_scores_gemma":[0.0001350134,0.00008424322,0.0001098582,0.0005937494,0.0003483081,0.004805572,0.0005564748,0.0001152275,0.00002572467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001109977,"about_ca_system_score_gemma":0.0003966801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000641966,"about_ca_topic_score_gemma":4.288703e-7,"domain_scores_codex":[0.9977787,0.00004418234,0.0005656846,0.0001485284,0.001215594,0.0002473608],"domain_scores_gemma":[0.9974961,0.0001723056,0.0006111774,0.0003941491,0.001169123,0.0001571319],"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.00001068147,0.0004919911,0.002455009,0.000005227435,0.00008727155,0.00001065581,0.001760396,0.0004401711,0.004479889,0.7546342,0.001041152,0.2345834],"study_design_scores_gemma":[0.003512112,0.0008298902,0.1922287,0.000480863,0.000058576,0.004139233,0.0001731818,0.5240461,0.05156025,0.1708666,0.05103085,0.001073551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.105243,0.00006296281,0.8872058,0.001376554,0.005212948,0.00003805729,0.000001741085,0.00003317929,0.0008257553],"genre_scores_gemma":[0.7517236,0.00001226653,0.2476808,0.0001992657,0.0003657209,6.250648e-7,6.346772e-7,0.000002962903,0.00001403686],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6464807,"threshold_uncertainty_score":0.7427283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975431188","doi":"10.1142/s0129054113400285","title":"COMPLEXITY OF ATOMS OF REGULAR LANGUAGES","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","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":"University of Waterloo","funders":"","keywords":"Quotient; Atom (system on chip); Intersection (aeronautics); Mathematics; Regular language; State (computer science); Upper and lower bounds; Combinatorics; Discrete mathematics; Physics; Computer science; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02073960704499473,"gpt":0.2991157101043507,"spread":0.278376103059356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008000795,0.00007920916,0.0002193946,0.0005171333,0.00004507205,0.0001131753,0.003223015,0.00002118335,0.00005189989],"category_scores_gemma":[0.00009937956,0.0000662299,0.0001187199,0.00048115,0.000914024,0.00171434,0.0004145841,0.00007769912,0.000005398096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003963992,"about_ca_system_score_gemma":0.0002278721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000619545,"about_ca_topic_score_gemma":0.000001385581,"domain_scores_codex":[0.997999,0.00004379235,0.0006930133,0.0001408318,0.001005433,0.0001179119],"domain_scores_gemma":[0.9960803,0.0001570959,0.0009775478,0.0003507568,0.002368852,0.00006542366],"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.000009735923,0.0003417221,0.00191339,0.00002169071,0.0001053912,0.000006722267,0.001226892,0.0008456812,0.05526073,0.8062221,0.0004358819,0.1336101],"study_design_scores_gemma":[0.001306487,0.0006386149,0.1707541,0.0005110049,0.00002197445,0.0004321444,0.000221515,0.2651835,0.2313902,0.3286064,0.0006105021,0.0003236645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4097653,0.00004723134,0.5885081,0.0007698571,0.0005863124,0.00004308407,0.000003449393,0.000007421839,0.0002692132],"genre_scores_gemma":[0.7698699,0.000007760933,0.2299917,0.00005209649,0.00006493499,5.282989e-7,6.420162e-7,0.000002054305,0.00001046144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4776157,"threshold_uncertainty_score":0.5989217,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001444496","doi":"10.1142/s0129054105003030","title":"APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; McMaster University","keywords":"Job shop scheduling; Job shop; Mathematical optimization; Generalization; Approximation algorithm; Scheduling (production processes); Computer science; Scheme (mathematics); Flow shop scheduling; Algorithm; Process (computing); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0273347959252601,"gpt":0.2993553875880289,"spread":0.2720205916627688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005760589,0.00007875459,0.0001179521,0.0004898135,0.00007088691,0.0001660758,0.0006768922,0.00002660408,0.0000204538],"category_scores_gemma":[0.00006754766,0.00007530671,0.00007649435,0.0003262617,0.00011522,0.001068927,0.0000337668,0.00007862377,0.000005490183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001223933,"about_ca_system_score_gemma":0.0001355267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.462221e-7,"about_ca_topic_score_gemma":8.181965e-7,"domain_scores_codex":[0.998732,0.000006815825,0.0004958325,0.00009684452,0.0005481516,0.000120317],"domain_scores_gemma":[0.9979655,0.00007224743,0.0002016543,0.0001042373,0.001593726,0.00006265226],"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.000004233199,0.00003756093,0.00005279447,0.000007390469,0.00003287445,2.143968e-7,0.000273034,0.8612276,0.0007956343,0.002317586,0.0001789533,0.1350722],"study_design_scores_gemma":[0.0004372624,0.00005266986,0.0002884436,0.00005020482,0.000007540116,0.00004192419,0.00001691735,0.9900134,0.006409869,0.0008392285,0.001764289,0.00007827438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01139025,0.00006225438,0.9854447,0.0006321127,0.001944787,0.00009437454,0.000005879942,0.00004692834,0.0003787553],"genre_scores_gemma":[0.2711332,0.00002427846,0.7281913,0.00003769785,0.0005640781,0.000004087317,0.000004602145,0.000007327714,0.00003349431],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2597429,"threshold_uncertainty_score":0.3070918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2888233883","doi":"10.1142/s012905411842008x","title":"Operations on Unambiguous Finite Automata","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Concatenation (mathematics); Mathematics; Combinatorics; Nondeterministic finite automaton; Quotient; Closure (psychology); Discrete mathematics; String (physics); Regular language; Deterministic finite automaton; Upper and lower bounds; Alphabet; Finite-state machine; Automaton; Computer science; Automata theory; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01799966834057566,"gpt":0.3097499118820159,"spread":0.2917502435414403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001007167,0.0001039278,0.0001477457,0.000775533,0.0002223547,0.0005406014,0.003991725,0.00002515508,0.00003770219],"category_scores_gemma":[0.0002351262,0.00008812381,0.00009115908,0.0007106008,0.0005789047,0.002033525,0.000406926,0.0001147854,0.00006317549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009432367,"about_ca_system_score_gemma":0.0005227251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000110471,"about_ca_topic_score_gemma":0.000002776226,"domain_scores_codex":[0.9978902,0.00004466472,0.0005498093,0.0002261191,0.001121026,0.0001681911],"domain_scores_gemma":[0.9966116,0.0001912125,0.0003265667,0.0004697745,0.002301862,0.0000990043],"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.00002839958,0.000534618,0.0001963399,0.000003358943,0.00008964921,0.00003218467,0.001384906,0.01588417,0.006731672,0.653995,0.001125834,0.3199939],"study_design_scores_gemma":[0.0007778814,0.0009937957,0.009284345,0.0001679669,0.000008171871,0.0003093744,0.00001655115,0.9452243,0.01939443,0.01992479,0.00369216,0.0002061983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08562258,0.000009216716,0.9067809,0.002580944,0.003905834,0.00004632562,0.000004113044,0.00003595936,0.001014121],"genre_scores_gemma":[0.8119062,0.000007897255,0.1870557,0.0005447993,0.0004501743,8.613443e-7,9.654206e-7,0.000003566375,0.00002983349],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9293402,"threshold_uncertainty_score":0.7417685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091155243","doi":"10.1142/s0129054112400679","title":"UNARY PATTERNS WITH INVOLUTION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Unary operation; Involution (esoterism); Mathematics; Alphabet; Combinatorics; Existential quantification; Discrete mathematics; Biology; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01414582211363474,"gpt":0.2763654520099963,"spread":0.2622196298963616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009908243,0.00008391883,0.0001202876,0.0005118478,0.00009104404,0.0001965355,0.002284783,0.0000182346,0.00001480726],"category_scores_gemma":[0.00003771747,0.00006420534,0.00006022859,0.0004735529,0.0002358948,0.004186811,0.0002959986,0.00009898035,0.00000780247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001013955,"about_ca_system_score_gemma":0.0002764423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009412272,"about_ca_topic_score_gemma":0.000001074805,"domain_scores_codex":[0.9982775,0.00003541147,0.0003789543,0.0001255265,0.0009928111,0.0001898139],"domain_scores_gemma":[0.9979419,0.0001017803,0.0004871681,0.0002611495,0.001091163,0.0001167995],"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.00005178777,0.0009318251,0.08307901,0.0000161321,0.000187822,0.00003258582,0.003652289,0.003865652,0.007442463,0.5724582,0.000537006,0.3277452],"study_design_scores_gemma":[0.002373096,0.001231314,0.7161835,0.0007085524,0.00004544651,0.00409846,0.000212985,0.2135576,0.03062771,0.02453993,0.005676684,0.0007447479],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2619184,0.00004371596,0.7355516,0.0006125645,0.001659717,0.00002794687,0.000001429836,0.00001442653,0.0001701606],"genre_scores_gemma":[0.8462768,0.00001062321,0.1532409,0.0001558251,0.0003048662,6.940107e-7,8.457582e-7,0.000002833962,0.000006641426],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6331045,"threshold_uncertainty_score":0.4245734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168854371","doi":"10.1142/s0129054107005443","title":"STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"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":"Deterministic finite automaton; Nondeterministic finite automaton; Finite-state machine; Quantum finite automata; Automaton; Mathematics; Regular language; DFA minimization; ω-automaton; Simple (philosophy); Upper and lower bounds; State (computer science); Discrete mathematics; Finite state; Automata theory; Combinatorics; Theoretical computer science; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02620600082371652,"gpt":0.3086807984164208,"spread":0.2824747975927043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002231318,0.0001129048,0.0002328975,0.0009179149,0.00009697848,0.0001703672,0.003677536,0.0000238312,0.00002991386],"category_scores_gemma":[0.0001591525,0.00009919692,0.0001267945,0.0008814214,0.001006946,0.002012169,0.0005275743,0.00013609,0.00000728101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009942073,"about_ca_system_score_gemma":0.0004645002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001862328,"about_ca_topic_score_gemma":0.000005327931,"domain_scores_codex":[0.9972603,0.00004667627,0.0009132524,0.0002073123,0.001362482,0.0002100259],"domain_scores_gemma":[0.9950829,0.0005367912,0.001168396,0.0003674868,0.002729306,0.0001151356],"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.00008253764,0.0006560145,0.001026132,0.0000126415,0.0001860428,0.00007277405,0.002273457,0.001811841,0.008986956,0.4464275,0.0004418137,0.5380223],"study_design_scores_gemma":[0.001835769,0.0007051087,0.1227036,0.0003857941,0.00001871605,0.0004686891,0.00006560821,0.5846027,0.09874997,0.1873728,0.002713683,0.0003774962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1353526,0.00001905163,0.8617227,0.0006296475,0.001685747,0.00005041515,0.00002020293,0.00002214626,0.0004975608],"genre_scores_gemma":[0.7264398,0.00001253724,0.273335,0.00009925322,0.00009816668,2.656264e-7,0.000002349521,0.000002935139,0.000009687908],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5910873,"threshold_uncertainty_score":0.6833839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089455626","doi":"10.1142/s0129054112400047","title":"STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Catenation; Combined operations; Continuation; State (computer science); Star (game theory); Computer science; Mathematics; Algorithm; Programming language; History","retraction":null,"screen_n_in":null,"score":{"opus":0.03211804920181332,"gpt":0.3122282846005669,"spread":0.2801102353987536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001579767,0.0001161464,0.0002171592,0.0006853878,0.000154637,0.000241506,0.001772872,0.00002015831,0.00001677008],"category_scores_gemma":[0.0001462329,0.0001022432,0.00007270243,0.0005806124,0.0007699429,0.003968327,0.0003833986,0.0001108708,0.00000391105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000997401,"about_ca_system_score_gemma":0.0003857812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000924194,"about_ca_topic_score_gemma":0.00001150276,"domain_scores_codex":[0.9978066,0.00007412477,0.0007539628,0.0001708711,0.0009999283,0.0001945019],"domain_scores_gemma":[0.9963664,0.0001947973,0.0005904261,0.0002653165,0.002447938,0.000135125],"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.00002971059,0.0006154487,0.006769786,0.00001657482,0.0001539213,0.000004789061,0.004397068,0.007473475,0.01859533,0.9208919,0.0001827458,0.04086928],"study_design_scores_gemma":[0.002861099,0.0004473456,0.1844941,0.0002054337,0.00003540411,0.0004318232,0.0001241892,0.6918846,0.03398294,0.08460457,0.0005031788,0.0004253527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4033467,0.0000698458,0.5935405,0.001492892,0.00138583,0.00007134617,0.000009481128,0.00001302628,0.00007025867],"genre_scores_gemma":[0.8016104,0.00002450821,0.198128,0.0001159504,0.0001023225,0.000001272695,0.000003755611,0.000003582354,0.00001025543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8362873,"threshold_uncertainty_score":0.4169357,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992434757","doi":"10.1142/s0129054100000259","title":"FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT","year":2000,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"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":"Supertree; Combinatorics; Mathematics; Tree (set theory); Vertex (graph theory); Minor (academic); Bounded function; Embedding; Discrete mathematics; Computer science; Graph; Biology; Artificial intelligence; Phylogenetic tree","retraction":null,"screen_n_in":null,"score":{"opus":0.0312662277924988,"gpt":0.3391405770950674,"spread":0.3078743493025686,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044045,0.0001064879,0.0001646919,0.0007137593,0.0001685413,0.0003739133,0.004031408,0.00002286932,0.0002062462],"category_scores_gemma":[0.0000693496,0.00009344855,0.000113005,0.0006892545,0.0005297947,0.001889813,0.0003133617,0.0001526743,0.00002430306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001786867,"about_ca_system_score_gemma":0.0004554122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008503235,"about_ca_topic_score_gemma":0.000004750573,"domain_scores_codex":[0.9974315,0.00005561563,0.0005490343,0.0002375995,0.001489133,0.000237155],"domain_scores_gemma":[0.9976573,0.0002593001,0.0002739812,0.0003455011,0.0013286,0.0001353014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006797961,0.0003407817,0.002430469,0.000004422357,0.0001252179,0.00005971343,0.001144951,0.031183,0.007255271,0.3378368,0.0002112069,0.6193402],"study_design_scores_gemma":[0.006087428,0.002489855,0.1455983,0.0007363627,0.00004162308,0.003169481,0.0003290831,0.3206992,0.04772129,0.4524248,0.01937103,0.001331526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2935923,0.00004040091,0.7030054,0.001809173,0.0007616432,0.00005577029,0.000001762905,0.00001114456,0.0007224528],"genre_scores_gemma":[0.8422722,0.00003452793,0.157285,0.0001780093,0.0001307905,0.000001342538,6.376866e-7,0.000003532343,0.00009404727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6180087,"threshold_uncertainty_score":0.7491425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}