{"meta":{"query_hash":"4423166447e2","filters":{"topic":"semigroups and automata theory"},"cohort_total":1153,"direct_labels_cover":1,"predictions_cover":1153,"exported":1153,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/4423166447e2","api":"https://metacan.xera.ac/api/v1/cohort?topic=semigroups+and+automata+theory"},"results":[{"id":"W104024513","doi":"10.1007/978-3-642-40663-8_7","title":"The Algebraic Theory of Parikh Automata","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Unary operation; Automaton; Regular language; Computer science; Automata theory; Algebraic theory; Discrete mathematics; Set (abstract data type); Deterministic finite automaton; Algebraic number; Mathematics; Theoretical computer science; Programming language","score_opus":0.011804015400249616,"score_gpt":0.2192549703204398,"score_spread":0.2074509549201902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104024513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015304275,0.0014439477,0.9871332,0.0008508269,0.0017723357,0.00037989253,0.000004073861,0.00021660083,0.008046097],"genre_scores_gemma":[0.56063545,0.0006387019,0.42748618,0.004503347,0.0011380689,0.00006205706,0.000010107289,0.0001585576,0.0053675156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963389,0.00009891458,0.0006692924,0.0011493971,0.0010326592,0.00071080634],"domain_scores_gemma":[0.9941715,0.0022424494,0.00048046466,0.002745748,0.00021894649,0.00014086721],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023463327,0.0004981294,0.0005267359,0.00040309379,0.00039273864,0.000637698,0.007260191,0.0002765344,0.000057386555],"category_scores_gemma":[0.000175233,0.00032819243,0.00018364229,0.00050822383,0.0017456118,0.00059924036,0.0023406097,0.0006733409,0.0001410159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021796059,0.000011076461,0.000004195874,0.000013863423,0.000010220287,0.000009433859,0.0002499099,0.0004156707,0.000059313756,0.43669376,0.00007312652,0.56245726],"study_design_scores_gemma":[0.00014555141,0.00009752146,0.0001444627,0.0002204877,0.0000064806927,0.00004182411,3.4985786e-7,0.18028061,0.0010149627,0.8149242,0.0027365459,0.00038699],"about_ca_topic_score_codex":0.000014931176,"about_ca_topic_score_gemma":0.000013117146,"teacher_disagreement_score":0.56207025,"about_ca_system_score_codex":0.00011673491,"about_ca_system_score_gemma":0.00044800236,"threshold_uncertainty_score":0.99991703},"labels":[],"label_agreement":null},{"id":"W104936076","doi":"","title":"Homomorphisms Preserving Types of Density.","year":2008,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Homomorphism; Endomorphism; Mathematics; Hierarchy; Relation (database); Pure mathematics; Monoid; Equivalence relation; Algebra over a field; Discrete mathematics; Computer science","score_opus":0.013487506600315502,"score_gpt":0.20321824248603676,"score_spread":0.18973073588572126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104936076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95730394,0.00028387253,0.018805102,0.00053702784,0.00016765403,0.00008147781,0.0000016141598,0.00016849431,0.022650829],"genre_scores_gemma":[0.9831659,0.00004371656,0.016100839,0.00013025277,0.00003156257,0.000001781629,0.0000010181068,0.00000756629,0.00051736063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992387,0.000036737387,0.00015018908,0.00020263111,0.00019194435,0.00017978418],"domain_scores_gemma":[0.9991157,0.00011290253,0.00006399371,0.00059713656,0.000049997714,0.00006026545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010763182,0.00008427444,0.00014185648,0.000048754908,0.00006710556,0.000020855216,0.00082755636,0.00004310134,0.00010072374],"category_scores_gemma":[0.00005320825,0.00007553171,0.000047714755,0.00017664336,0.00007947727,0.0001914653,0.00036293984,0.00006908574,0.00006166361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032221727,0.0005296222,0.005673871,0.00007738589,0.0001493757,0.00034433272,0.0060665198,0.00008608648,0.10407131,0.80873233,0.030790593,0.04344638],"study_design_scores_gemma":[0.0019767415,0.0007216734,0.2565869,0.00026240776,0.00007583439,0.0014942015,0.00012544094,0.10043597,0.41467836,0.14560114,0.076339364,0.0017019528],"about_ca_topic_score_codex":0.000050607465,"about_ca_topic_score_gemma":0.000002606704,"teacher_disagreement_score":0.6631312,"about_ca_system_score_codex":0.000007935333,"about_ca_system_score_gemma":0.000028591137,"threshold_uncertainty_score":0.30800936},"labels":[],"label_agreement":null},{"id":"W1081471053","doi":"10.1016/j.ic.2017.09.002","title":"On the complexity and decidability of some problems involving shuffle","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Decidability; Combinatorics; Pushdown automaton; Discrete mathematics; Mathematics; Closure (psychology); Time complexity; Bounded function; Decision problem; Finite-state machine; Algorithm","score_opus":0.04185534428189584,"score_gpt":0.2631921773337993,"score_spread":0.22133683305190344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1081471053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8176817,0.000030400413,0.17936552,0.0017275147,0.00008238194,0.00017857715,0.0000023263121,0.000041085772,0.0008904658],"genre_scores_gemma":[0.9975939,0.000009149767,0.0019758053,0.00040416062,0.000006616274,0.0000046924865,0.0000027138792,9.3019725e-7,0.000002081397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954736,0.000030029001,0.00017729215,0.00006649044,0.00011803037,0.00006077079],"domain_scores_gemma":[0.9993551,0.00012865663,0.00021900177,0.00021729704,0.000056476645,0.000023511338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004158218,0.000051675983,0.00006769312,0.000034908582,0.0003555002,0.00034929128,0.00021398222,0.0000208734,0.0000020507173],"category_scores_gemma":[0.00009031818,0.000035815057,0.000012975193,0.000030258163,0.00015009589,0.0017775631,0.00013774766,0.000046135436,0.000004374806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032664173,0.000010567135,0.0005937556,0.00003214375,0.0000032584437,4.3171617e-8,0.0017176822,0.00025503823,0.00003105854,0.9221118,0.00007686875,0.07516451],"study_design_scores_gemma":[0.00015782173,0.000034388744,0.07885462,0.000023320623,0.0000010394532,0.0000017713056,0.0000743226,0.548423,0.00015725658,0.3721476,0.00008139492,0.000043501645],"about_ca_topic_score_codex":0.00004172675,"about_ca_topic_score_gemma":0.0000036008742,"teacher_disagreement_score":0.5499642,"about_ca_system_score_codex":0.000008142951,"about_ca_system_score_gemma":0.000013051821,"threshold_uncertainty_score":0.3368224},"labels":[],"label_agreement":null},{"id":"W108390543","doi":"","title":"On imp-sets, kernels by monochromatic paths of the duplication.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Gene duplication; Arithmetic; Optics; Physics; Biology; Genetics","score_opus":0.006482147157062837,"score_gpt":0.22893580515048087,"score_spread":0.22245365799341804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108390543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907554,0.00018579431,0.005336905,0.00033777367,0.0010133297,0.00018459558,0.0000035203668,0.000103796345,0.0020789192],"genre_scores_gemma":[0.99899846,0.0000054138677,0.0005165064,0.00034460519,0.0000031292177,0.0000073067795,0.0000015314024,0.000009010827,0.00011405956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989433,0.000052851934,0.00026234146,0.00023317769,0.00028633897,0.0002219343],"domain_scores_gemma":[0.9984292,0.000312658,0.00016921594,0.0009836747,0.0000460843,0.00005920173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057940633,0.000113346665,0.00013563083,0.000038906037,0.00009963902,0.00003906101,0.0011819154,0.00005702013,0.000012346194],"category_scores_gemma":[0.00007333867,0.000081390965,0.00007118298,0.00036468267,0.000057533794,0.00014733305,0.00019667101,0.00010650233,0.000052265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022228905,0.000120126184,0.00056805986,0.000008407527,0.000008995226,0.000001282191,0.00023511548,0.0000030043102,0.003314532,0.98331565,0.0062349574,0.006187621],"study_design_scores_gemma":[0.00039614577,0.000081241,0.023988416,0.00004218125,0.000005168704,0.0000051146485,0.00002478117,0.0031541416,0.039064694,0.93268526,0.00041266275,0.0001401802],"about_ca_topic_score_codex":0.000019432851,"about_ca_topic_score_gemma":5.2330074e-7,"teacher_disagreement_score":0.0506304,"about_ca_system_score_codex":0.000042911084,"about_ca_system_score_gemma":0.0000287156,"threshold_uncertainty_score":0.33190274},"labels":[],"label_agreement":null},{"id":"W112721313","doi":"10.46298/dmtcs.412","title":"Properties of the extremal infinite smooth words","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; De Bruijn sequence; Alphabet; Fibonacci number; Combinatorics; Mathematics; Graph; De Bruijn graph; Word (group theory); Sequence (biology); Reduction (mathematics); Order (exchange); Construct (python library); Discrete mathematics; Computer science","score_opus":0.01691437624846669,"score_gpt":0.24090651037820063,"score_spread":0.22399213412973393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112721313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16078603,0.000052786032,0.833048,0.00047439773,0.0004585006,0.00022661893,0.0000013738545,0.00012961421,0.0048227133],"genre_scores_gemma":[0.84068924,0.0000018064758,0.15892299,0.00028757085,0.00006466216,0.000003765893,1.4045624e-7,0.0000118652915,0.000017987571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685365,0.00008022534,0.00063141197,0.00053770316,0.0011963114,0.0007006763],"domain_scores_gemma":[0.9973918,0.00033603644,0.00024337816,0.0016393438,0.00019396172,0.00019544593],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0036523815,0.00025776797,0.0003182593,0.00017669551,0.00040752877,0.00035196223,0.0046479194,0.000067029476,0.000024526906],"category_scores_gemma":[0.00023292954,0.00014557861,0.00016943633,0.0015559552,0.0041966983,0.000551652,0.00224115,0.00023982632,0.000021882815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042981496,0.00007520634,0.000047374087,0.000043151107,0.000005701876,0.0000034379404,0.0030043656,0.000019924579,0.008013913,0.9807922,0.0000095787545,0.007980839],"study_design_scores_gemma":[0.0002202388,0.000103186016,0.000906953,0.0003465257,0.000013515434,0.00004925359,0.00019744941,0.49451327,0.070254534,0.43296748,0.00007108102,0.00035650964],"about_ca_topic_score_codex":0.0000025626894,"about_ca_topic_score_gemma":0.0000010909441,"teacher_disagreement_score":0.6799032,"about_ca_system_score_codex":0.000036371002,"about_ca_system_score_gemma":0.00014327676,"threshold_uncertainty_score":0.9985133},"labels":[],"label_agreement":null},{"id":"W1168124290","doi":"10.1007/978-3-319-20028-6_4","title":"A New Approach to the Paperfolding Sequences","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Environmental Studies Association of Canada; Queen's University; University of Waterloo","funders":"","keywords":"Computer science; Computation; Function (biology); Algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.03616012033275176,"score_gpt":0.25462790725618134,"score_spread":0.21846778692342958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1168124290","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000131844645,0.000858473,0.97045904,0.0023034094,0.0016325797,0.00039709604,0.00000223526,0.00019740086,0.024136582],"genre_scores_gemma":[0.04201157,0.00002528532,0.9484899,0.0053240876,0.0014918509,0.000015915251,0.0000030369338,0.000042235,0.002596134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604654,0.000049752958,0.00039091203,0.0015665465,0.0012611108,0.00068516086],"domain_scores_gemma":[0.99701613,0.0003683971,0.00017738598,0.001931883,0.00015630727,0.00034990752],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020602592,0.00048179663,0.00043315112,0.00046192989,0.00032979145,0.0010221882,0.0073244777,0.00021165168,0.000026140628],"category_scores_gemma":[0.00011893232,0.0003200878,0.00011132095,0.00090160046,0.00034523042,0.00056098343,0.002244037,0.00067085784,0.00020619157],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002330693,0.000009839525,0.0000043306704,0.000010479293,0.0000077090235,0.00001951448,0.0018708349,0.039552234,0.00005330675,0.13396138,0.0010797157,0.82342833],"study_design_scores_gemma":[0.00018221134,0.00012124934,0.000023310879,0.00027929214,0.000009304187,0.00018456976,0.0000011098747,0.48460838,0.00031469055,0.47675598,0.036682542,0.00083737844],"about_ca_topic_score_codex":0.000064674045,"about_ca_topic_score_gemma":0.00003109449,"teacher_disagreement_score":0.82259095,"about_ca_system_score_codex":0.0002686585,"about_ca_system_score_gemma":0.0010297673,"threshold_uncertainty_score":0.99992514},"labels":[],"label_agreement":null},{"id":"W124365840","doi":"10.1007/978-3-642-22600-7_13","title":"State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Intersection (aeronautics); Star (game theory); Computer science; State (computer science); Algorithm; Theoretical computer science; Mathematics; Aerospace engineering; Engineering","score_opus":0.029660957460839108,"score_gpt":0.23200068623280984,"score_spread":0.20233972877197073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124365840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008948517,0.00011417689,0.989007,0.0002663937,0.00075116614,0.00031190854,0.000026974365,0.00007339717,0.0005004512],"genre_scores_gemma":[0.79730237,0.000034881934,0.20229855,0.00021774092,0.000040090024,0.0000021734234,0.000006560795,0.000016977636,0.000080636215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761856,0.00008852808,0.00067731756,0.0008016679,0.0004987467,0.00031517862],"domain_scores_gemma":[0.9978959,0.00024408779,0.00034436758,0.0009748083,0.0004250421,0.000115806986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009629487,0.00034649318,0.00060714234,0.0006094196,0.00015407937,0.00010889646,0.0017273007,0.00014287003,0.00002520107],"category_scores_gemma":[0.000047846053,0.0003179274,0.00008994218,0.00041570148,0.0019126396,0.0004955745,0.0010879318,0.00038899985,0.000003035317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109446766,0.00033726747,0.0005223446,0.0004571001,0.00015389171,0.00007258696,0.013826979,0.015662882,0.010037866,0.6729698,0.00008611682,0.28576368],"study_design_scores_gemma":[0.00074224506,0.00071460515,0.0021070384,0.0006169807,0.000016312826,0.000059307404,0.0000015271278,0.3995672,0.010458016,0.58502305,0.00011395424,0.00057979807],"about_ca_topic_score_codex":0.00026687692,"about_ca_topic_score_gemma":0.0002890695,"teacher_disagreement_score":0.78835386,"about_ca_system_score_codex":0.00008996899,"about_ca_system_score_gemma":0.00028726485,"threshold_uncertainty_score":0.9999273},"labels":[],"label_agreement":null},{"id":"W124609046","doi":"10.1007/978-3-642-22600-7_21","title":"State Trade-Offs in Unranked Tree Automata","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Deterministic finite automaton; Tree (set theory); Automaton; Upper and lower bounds; Computer science; Horizontal and vertical; State (computer science); ω-automaton; Finite-state machine; Quantum finite automata; Discrete mathematics; Mathematics; Combinatorics; Automata theory; Theoretical computer science; Algorithm; Geometry","score_opus":0.018659769607563,"score_gpt":0.22903347662304183,"score_spread":0.21037370701547883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124609046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044536043,0.0004871863,0.98592204,0.00069942116,0.0017830711,0.0004391753,0.0000100076195,0.00043347402,0.0097802635],"genre_scores_gemma":[0.6081273,0.0002921391,0.3841426,0.0051168203,0.000602651,0.000038190887,0.000017683078,0.00016589693,0.0014967255],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99500644,0.00007723574,0.00081357406,0.0020324166,0.0010039309,0.0010663859],"domain_scores_gemma":[0.9966142,0.00047545403,0.0003389345,0.0022716166,0.00006526562,0.00023451177],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014312703,0.0007451363,0.00079331227,0.0013558614,0.00016727249,0.00049024855,0.0060034157,0.00036549426,0.000044131953],"category_scores_gemma":[0.00005559476,0.0006730809,0.00017576544,0.0009429938,0.00079999573,0.000991155,0.0016323046,0.0010606609,0.000098237026],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009339492,0.000061039485,0.000057667967,0.000034918914,0.000009367396,0.00033058634,0.0019420763,0.0016580553,0.0001254988,0.03839444,0.00003782984,0.95733917],"study_design_scores_gemma":[0.00070032704,0.00022200517,0.0018449231,0.00059467,0.0000066985685,0.00012053059,2.2197031e-7,0.37332198,0.0013814842,0.6183559,0.002318061,0.0011332482],"about_ca_topic_score_codex":0.00008653794,"about_ca_topic_score_gemma":0.0003490256,"teacher_disagreement_score":0.9562059,"about_ca_system_score_codex":0.00031508756,"about_ca_system_score_gemma":0.0005377933,"threshold_uncertainty_score":0.99957204},"labels":[],"label_agreement":null},{"id":"W136331652","doi":"10.14232/actacyb.21.4.2014.1","title":"Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language","year":2014,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Regular language; Quotient; Prefix; Suffix; Mathematics; Discrete mathematics; Concatenation (mathematics); Combinatorics; Computer science; Automaton; Theoretical computer science; Linguistics","score_opus":0.012780509155064247,"score_gpt":0.21787180460326577,"score_spread":0.20509129544820154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136331652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811173,0.00023344693,0.011675966,0.0011443556,0.00014266158,0.00010866259,0.000011169425,0.00013658362,0.0054298737],"genre_scores_gemma":[0.9883975,0.000011935368,0.011153657,0.00026988896,0.00003992436,0.0000024979647,0.0000027223407,0.000009848837,0.00011204474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989106,0.00009919216,0.00020145084,0.00031075385,0.00024082836,0.00023719255],"domain_scores_gemma":[0.9985266,0.00016149067,0.000095129835,0.0010745409,0.00003461496,0.00010763663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002284464,0.00013240926,0.00021067941,0.000061716724,0.000048516766,0.00006241247,0.00091873383,0.00005471157,0.000058886213],"category_scores_gemma":[0.00010437374,0.00011352282,0.00004783822,0.00014280096,0.0002692382,0.00014539258,0.0005605726,0.00008743601,0.000013513487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010285693,0.000114229326,0.0009858486,0.000048270143,0.000028325736,0.0000059959516,0.0023298291,0.0000017734866,0.026536927,0.91724205,0.00203861,0.050657846],"study_design_scores_gemma":[0.0030904629,0.0009272885,0.42451176,0.0002303673,0.00005443314,0.00007691933,0.00043471274,0.095190756,0.10431217,0.33601838,0.03373269,0.0014200538],"about_ca_topic_score_codex":0.00010207894,"about_ca_topic_score_gemma":0.000014757135,"teacher_disagreement_score":0.58122367,"about_ca_system_score_codex":0.000010551462,"about_ca_system_score_gemma":0.000014212273,"threshold_uncertainty_score":0.46293262},"labels":[],"label_agreement":null},{"id":"W14029668","doi":"10.1007/978-3-642-31623-4_12","title":"State Complexity of Star and Square of Union of k Regular Languages","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Star (game theory); Component (thermodynamics); Discrete mathematics; Mathematics; Combinatorics; Computer science; Algorithm; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.019033828007513583,"score_gpt":0.24505816518295828,"score_spread":0.2260243371754447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14029668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017303197,0.0025699886,0.9791568,0.00012229486,0.00024868042,0.00019903669,0.000036183133,0.000037740265,0.00032609887],"genre_scores_gemma":[0.8017877,0.000089117995,0.1979596,0.000065432534,0.000047464226,8.089926e-7,0.000004042204,0.000013312318,0.00003254635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795574,0.00006221054,0.00051290024,0.00054480555,0.000616921,0.00030741806],"domain_scores_gemma":[0.9978699,0.00030617695,0.00054501876,0.0009821582,0.00021111997,0.000085609274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010898174,0.000270357,0.0005930581,0.00045370773,0.000048849946,0.00003643546,0.0014775674,0.00013388116,0.0000130105145],"category_scores_gemma":[0.000036433798,0.00023213746,0.00008148806,0.00032089726,0.0017239887,0.00033798494,0.0010106468,0.0002395877,9.3858927e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001245257,0.00007185826,0.0003992456,0.0005543495,0.000026089836,0.000013282863,0.0036075297,0.0015360418,0.0058388677,0.15119973,0.000006985501,0.8367336],"study_design_scores_gemma":[0.00066883536,0.0006602541,0.008246767,0.0020370972,0.000029171739,0.000061802,0.0000050606664,0.14876893,0.11160707,0.7266642,0.00034680028,0.0009040184],"about_ca_topic_score_codex":0.00008603225,"about_ca_topic_score_gemma":0.00003084263,"teacher_disagreement_score":0.83582956,"about_ca_system_score_codex":0.00003923326,"about_ca_system_score_gemma":0.00011933151,"threshold_uncertainty_score":0.9466291},"labels":[],"label_agreement":null},{"id":"W1440639274","doi":"10.1007/978-3-319-22360-5_20","title":"State Complexity of Prefix Distance","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Suffix; Prefix; Generalized suffix tree; Combinatorics; Deterministic finite automaton; Nondeterministic algorithm; Regular language; State (computer science); Nondeterministic finite automaton; Discrete mathematics; Mathematics; Computer science; Suffix tree; Finite-state machine; Set (abstract data type); Automaton; Algorithm; Theoretical computer science; Automata theory","score_opus":0.039669410557302325,"score_gpt":0.26118050086586275,"score_spread":0.22151109030856042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1440639274","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017741461,0.000987989,0.9918095,0.00031064393,0.0011675094,0.00027160242,0.00003058183,0.00016694366,0.0050778426],"genre_scores_gemma":[0.44499946,0.000056741406,0.55285597,0.0007301107,0.00029046237,0.000007743254,0.000011378318,0.000054682747,0.0009934334],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625826,0.00004595216,0.00062375295,0.0012670252,0.0012126022,0.00059240015],"domain_scores_gemma":[0.9968098,0.00028779102,0.0004701218,0.0018523419,0.00037404345,0.00020594464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012749077,0.0004748247,0.00068196625,0.00047232967,0.00011896738,0.00023857091,0.0043684873,0.00017856715,0.000022653032],"category_scores_gemma":[0.00007515504,0.00041714197,0.00012647873,0.0005518316,0.0019384836,0.0006011689,0.0017263094,0.0005545168,0.00003226692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013872598,0.00005651883,0.00004991454,0.00009624305,0.000016400625,0.000070385875,0.0012394708,0.012450254,0.0001821332,0.35492048,0.000117990574,0.6307863],"study_design_scores_gemma":[0.00020347293,0.00012456033,0.00010238176,0.00029800832,0.0000037397988,0.000027343942,1.12676176e-7,0.23212406,0.0011793266,0.7634898,0.0020031142,0.00044409797],"about_ca_topic_score_codex":0.00003283313,"about_ca_topic_score_gemma":0.0000715792,"teacher_disagreement_score":0.63034225,"about_ca_system_score_codex":0.00024931866,"about_ca_system_score_gemma":0.00059247727,"threshold_uncertainty_score":0.99982804},"labels":[],"label_agreement":null},{"id":"W1442386651","doi":"10.1007/978-3-319-23660-5_15","title":"Mechanical Proofs of Properties of the Tribonacci Word","year":2015,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematical proof; Class (philosophy); Word (group theory); Point (geometry); Mathematics; Computer science; Combinatorics; Artificial intelligence","score_opus":0.0298734212841338,"score_gpt":0.25029416221898626,"score_spread":0.22042074093485245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1442386651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15239447,0.00065622147,0.84350455,0.00096958235,0.0019460687,0.00044883596,0.0000033123142,0.000064528,0.000012436202],"genre_scores_gemma":[0.87376106,0.0000059307276,0.12587522,0.00023011836,0.000100994584,0.000016156726,3.716578e-7,0.000008956853,0.0000011980023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668825,0.00021152885,0.000629011,0.0009404239,0.0010978137,0.00043299232],"domain_scores_gemma":[0.99667215,0.0001829656,0.00048318444,0.0021704119,0.00040199474,0.000089313864],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002197734,0.00030251924,0.00055437547,0.0002833494,0.00008339542,0.00017230705,0.007532804,0.00021776113,0.0000019471972],"category_scores_gemma":[0.0004324429,0.00018326174,0.00016631428,0.0016288873,0.00077192445,0.00027875302,0.008463095,0.0006899673,0.0000015220123],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033882672,0.00035833556,0.000592682,0.00047879157,0.00002952924,0.000009594865,0.0060804244,0.1238919,0.02811618,0.0089348825,0.000040924144,0.8314329],"study_design_scores_gemma":[0.00018633601,0.00006276565,0.00047438635,0.0006965286,0.0000053931994,0.000013987218,9.960445e-7,0.6013821,0.25145495,0.1454806,0.000013808774,0.00022814893],"about_ca_topic_score_codex":0.00007375212,"about_ca_topic_score_gemma":0.000025605617,"teacher_disagreement_score":0.8312047,"about_ca_system_score_codex":0.00012569461,"about_ca_system_score_gemma":0.0013066514,"threshold_uncertainty_score":0.99955624},"labels":[],"label_agreement":null},{"id":"W1479790588","doi":"10.37236/583","title":"On Variants of Conway and Conolly's Meta-Fibonacci Recursions","year":2011,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fibonacci number; Combinatorics; Monotonic function; Integer (computer science); Recursion (computer science); Mathematics; Sequence (biology); Physics; Algorithm; Mathematical analysis; Chemistry","score_opus":0.025882670816511837,"score_gpt":0.240042085165349,"score_spread":0.21415941434883717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479790588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3571882,0.0938312,0.5228295,0.0060319817,0.00821049,0.0013720469,0.000030096931,0.0001695583,0.01033692],"genre_scores_gemma":[0.99666035,0.0027779236,0.00022009305,0.00013916563,0.000045800905,0.0000054474367,6.7825533e-7,0.000019521896,0.00013103857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765533,0.0004067201,0.00071313285,0.0002713877,0.0004815935,0.000471831],"domain_scores_gemma":[0.9964186,0.0007065315,0.0014968212,0.00095089275,0.00031885304,0.00010830779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027077629,0.00030515532,0.00088627666,0.00021671162,0.00011140991,0.00008101757,0.0024833493,0.00019541763,0.000025131127],"category_scores_gemma":[0.00016033155,0.00018872831,0.0003724781,0.0002474578,0.00011790179,0.00016928585,0.0008112731,0.0016863762,0.0000035657747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036759324,0.00015764819,0.000005331471,0.00002303205,0.0010503314,0.000009651917,0.00041898884,0.000043585653,0.000064692635,0.9966713,0.00049968885,0.0010189979],"study_design_scores_gemma":[0.0005274989,0.0007697893,0.0001267812,0.00009803859,0.00059632544,0.00017555567,0.000022825248,0.0005034098,0.0014333712,0.9950064,0.00055542705,0.00018460467],"about_ca_topic_score_codex":0.000016187363,"about_ca_topic_score_gemma":0.000001203266,"teacher_disagreement_score":0.6394721,"about_ca_system_score_codex":0.00014233023,"about_ca_system_score_gemma":0.00081971596,"threshold_uncertainty_score":0.7696117},"labels":[],"label_agreement":null},{"id":"W1480727594","doi":"","title":"Simple permutations of the classes Av(321;13524) and Av(321;13452) have polynomial growth","year":2011,"lang":"en","type":"article","venue":"Redalyc (Universidad Autónoma del Estado de México)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Guelph","funders":"","keywords":"Combinatorics; Permutation (music); Cyclic permutation; Simple (philosophy); Permutation graph; Mathematics; Parity of a permutation; Class (philosophy); Partial permutation; Derangement; Bit-reversal permutation; Set (abstract data type); Discrete mathematics; Symmetric group; Computer science; Artificial intelligence","score_opus":0.0176476972011365,"score_gpt":0.22334931950861164,"score_spread":0.20570162230747513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480727594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9435134,0.00025237614,0.042016547,0.00065484777,0.00029959108,0.00031759575,0.000051248593,0.00024443315,0.012649955],"genre_scores_gemma":[0.99239826,0.000048009184,0.006456298,0.00026910505,0.00006561944,0.0000071113595,0.000006727278,0.000031326865,0.0007175152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99789137,0.00022363181,0.00035034373,0.0006037308,0.00035339873,0.00057755254],"domain_scores_gemma":[0.9980816,0.00025245085,0.00031853616,0.00094611483,0.0001662906,0.00023495968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033359395,0.00032134514,0.0003657771,0.00033079906,0.00048050768,0.0001344001,0.0015346217,0.00019939148,0.00010012986],"category_scores_gemma":[0.000093179915,0.00028724593,0.00022403026,0.00068881526,0.00043147165,0.0010436085,0.00077265984,0.00030801122,0.000021558908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018957189,0.00082999014,0.09241346,0.00025423872,0.00044905275,0.0004401244,0.037415974,0.00013097633,0.025698967,0.8029639,0.007851359,0.031362392],"study_design_scores_gemma":[0.0035339522,0.0006383206,0.77031034,0.00022659068,0.0003330025,0.00058881997,0.016312256,0.11097339,0.02794462,0.06382564,0.0035990751,0.0017140261],"about_ca_topic_score_codex":0.0008922228,"about_ca_topic_score_gemma":0.00012726412,"teacher_disagreement_score":0.73913825,"about_ca_system_score_codex":0.00015128704,"about_ca_system_score_gemma":0.00032822826,"threshold_uncertainty_score":0.999958},"labels":[],"label_agreement":null},{"id":"W1481269160","doi":"10.1007/978-3-642-02930-1_5","title":"Faithful Loops for Aperiodic E-Ordered Monoids","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Université de Sherbrooke","funders":"","keywords":"Aperiodic graph; Computer science; Algebra over a field; Combinatorics; Mathematics; Pure mathematics","score_opus":0.01230811188658492,"score_gpt":0.23358944386566746,"score_spread":0.22128133197908254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481269160","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090691756,0.00094366126,0.99206203,0.0012806148,0.0015544661,0.0006661189,0.000011619906,0.000364217,0.0030265637],"genre_scores_gemma":[0.07672162,0.000079563004,0.91303486,0.0070462646,0.0011153857,0.000041850402,0.000019659172,0.000081007835,0.0018598057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571526,0.000028710738,0.0005981724,0.0019062283,0.00081290875,0.0009387072],"domain_scores_gemma":[0.99686396,0.00055277057,0.0003026829,0.0018294958,0.00023190012,0.00021916737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000950102,0.0006820656,0.00070248154,0.00075542444,0.0003816498,0.0009181941,0.00475889,0.0004262322,0.00002498352],"category_scores_gemma":[0.000099815756,0.0006172558,0.00025423118,0.000556333,0.000596777,0.0006906325,0.0009015507,0.0006292232,0.000052618092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069372986,0.000027734439,0.0000053003982,0.00002967498,0.000008723814,0.00003531393,0.00040142238,0.0031179024,0.00021011593,0.04947706,0.00008652892,0.9465933],"study_design_scores_gemma":[0.00044786744,0.0003528807,0.00006607028,0.0002647998,0.000009913055,0.00007086492,2.0591845e-7,0.47374696,0.0011974764,0.51233315,0.010634573,0.0008752642],"about_ca_topic_score_codex":0.000010809983,"about_ca_topic_score_gemma":0.000020673731,"teacher_disagreement_score":0.94571805,"about_ca_system_score_codex":0.00023680864,"about_ca_system_score_gemma":0.0005471398,"threshold_uncertainty_score":0.9996279},"labels":[],"label_agreement":null},{"id":"W1482663448","doi":"10.1016/j.ipl.2005.06.011","title":"The state complexity of and","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unary operation; Alphabet; State (computer science); Mathematics; Computational complexity theory; Combinatorics; Time complexity; Discrete mathematics; Regular language; Algorithm; Computer science; Automaton; Theoretical computer science; Linguistics","score_opus":0.01051109242909641,"score_gpt":0.2119664226953609,"score_spread":0.2014553302662645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482663448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34947217,0.00008658624,0.64451563,0.004831857,0.00005299733,0.00005385003,0.00000155413,0.00008885411,0.0008964755],"genre_scores_gemma":[0.9916698,0.0000020639488,0.0069948127,0.0013111844,0.000007966822,0.0000020962161,0.0000019554582,0.0000010960256,0.000009028364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995706,0.000011159843,0.00017967648,0.00003804545,0.00011479958,0.00008568558],"domain_scores_gemma":[0.9996824,0.000030107594,0.0001388567,0.00010358899,0.000034501583,0.000010502068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020205646,0.000040182855,0.00004152971,0.000032208365,0.0001541034,0.00025182244,0.00020110607,0.000007834926,3.8760768e-7],"category_scores_gemma":[0.0000072088233,0.00002716898,0.000009715919,0.00010641405,0.0001384422,0.0014564337,0.000049537568,0.00003273878,0.0000034787367],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007534363,0.000011148345,0.0004948795,0.00012370739,0.000005368018,6.0502776e-7,0.003499109,0.00082143873,0.0029071905,0.13272768,0.0038802193,0.85552114],"study_design_scores_gemma":[0.00075048435,0.000032791664,0.04747141,0.0001022287,0.00000526497,0.000037862024,0.0002386179,0.7434259,0.013066794,0.16691554,0.027598485,0.0003546078],"about_ca_topic_score_codex":0.000028158218,"about_ca_topic_score_gemma":0.000001346844,"teacher_disagreement_score":0.8551665,"about_ca_system_score_codex":0.000006663359,"about_ca_system_score_gemma":0.00001233311,"threshold_uncertainty_score":0.24283297},"labels":[],"label_agreement":null},{"id":"W1483785569","doi":"10.1007/11812128_10","title":"Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Concatenation (mathematics); Deterministic context-free grammar; Embedded pushdown automaton; Time complexity; Theoretical computer science; Simple (philosophy); Reduction (mathematics); Context-free grammar; Stateless protocol; Pushdown automaton; Algorithm; Rule-based machine translation; Automaton; Artificial intelligence; State (computer science); Tree-adjoining grammar; Mathematics; Arithmetic","score_opus":0.008559549543281935,"score_gpt":0.2297447781685894,"score_spread":0.22118522862530746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483785569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012848635,0.00043851158,0.9874644,0.00096926885,0.002035595,0.00046081064,0.000009616108,0.00031004573,0.0070268717],"genre_scores_gemma":[0.33712012,0.00008965659,0.65293086,0.005213919,0.0031742086,0.00003198307,0.0000804112,0.00015710658,0.0012017739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946759,0.00012188417,0.0008953013,0.002081344,0.0011522329,0.0010733759],"domain_scores_gemma":[0.99630314,0.0011029608,0.0005197749,0.0017233118,0.0001688398,0.00018197366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018012603,0.0006959669,0.00071185495,0.0012005143,0.0002621494,0.0009771233,0.0038949456,0.00044835653,0.000020368303],"category_scores_gemma":[0.00022423801,0.0006874314,0.00017835376,0.0008727616,0.00059490686,0.0016674448,0.0018828271,0.0011339157,0.00013373795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035969457,0.0001737644,0.000023188431,0.000043686105,0.00002445049,0.0009641418,0.0010867784,0.097395435,0.0038864757,0.010144909,0.0014052489,0.88481593],"study_design_scores_gemma":[0.00088018144,0.00020215499,0.00007972398,0.00059766864,0.000018694082,0.00017609386,6.1511616e-7,0.92047125,0.00342298,0.056960262,0.015626756,0.0015636262],"about_ca_topic_score_codex":0.00026839878,"about_ca_topic_score_gemma":0.00006344815,"teacher_disagreement_score":0.8832523,"about_ca_system_score_codex":0.0005588475,"about_ca_system_score_gemma":0.0006258256,"threshold_uncertainty_score":0.9995577},"labels":[],"label_agreement":null},{"id":"W1485181793","doi":"10.1017/cbo9780511808876","title":"A Second Course in Formal Languages and Automata Theory","year":2008,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":206,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Formal language; Abstract family of languages; Computer science; Lemma (botany); Parsing; Automaton; Context-free language; Automata theory; Chomsky hierarchy; Pumping lemma for regular languages; Context (archaeology); Programming language; Course (navigation); Turing machine; Second-generation programming language; Artificial intelligence; Computation; Rule-based machine translation; Fifth-generation programming language","score_opus":0.008768383314324668,"score_gpt":0.202186131174794,"score_spread":0.19341774786046934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485181793","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033107288,0.00072245643,0.0036286311,0.000011213558,0.00013379262,0.00027759522,0.0001348418,0.00032439857,0.99145633],"genre_scores_gemma":[0.0031628916,0.00013360877,0.0005191051,0.0001428916,0.000062837025,0.0000010963543,0.000025470363,0.000023837181,0.9959283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985016,0.00014661258,0.00017065505,0.0005639832,0.00021270278,0.00040447272],"domain_scores_gemma":[0.9986772,0.00020163019,0.00015751593,0.00078177877,0.000040059047,0.00014182566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003092063,0.00031959184,0.0003847714,0.00022375617,0.00015725115,0.00008467307,0.0012296976,0.00029092535,0.0000031981933],"category_scores_gemma":[0.000008449202,0.00035389778,0.000098221746,0.00002489239,0.00026578185,0.00047094154,0.0012102599,0.00043761396,0.0000074928585],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024632602,0.000019585857,0.000003903268,0.00008384993,0.000044576085,0.0014413721,0.0003861359,5.951974e-7,0.000018026203,0.9528691,0.035173733,0.009934503],"study_design_scores_gemma":[0.0015695897,0.000096000294,0.0006823865,0.0002779035,0.00005446774,0.0003534957,0.00015808133,0.0024799663,0.00019808562,0.0002082565,0.99311835,0.000803449],"about_ca_topic_score_codex":0.000026928115,"about_ca_topic_score_gemma":0.000004385362,"teacher_disagreement_score":0.9579446,"about_ca_system_score_codex":0.00013270143,"about_ca_system_score_gemma":0.00029365928,"threshold_uncertainty_score":0.9998913},"labels":[],"label_agreement":null},{"id":"W1486877437","doi":"10.1007/3-540-44674-5_26","title":"The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Parameterized complexity; Intersection (aeronautics); Finite-state machine; Transducer; Automaton; Composition (language); Computational complexity theory; Computer science; State (computer science); Finite state; Representation (politics); Algorithm; Time complexity; Theoretical computer science; Acoustics","score_opus":0.028241553057275538,"score_gpt":0.2603732987965553,"score_spread":0.23213174573927975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486877437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011428673,0.00009881823,0.98641306,0.00049633643,0.0005957507,0.00030997637,0.000021182457,0.000070643466,0.0005655291],"genre_scores_gemma":[0.9191133,0.00010126013,0.08038405,0.0003024537,0.00003956276,0.000005640842,0.000009375806,0.000013602115,0.000030741394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979675,0.00008170401,0.0005376213,0.0006408583,0.0005025236,0.00026983902],"domain_scores_gemma":[0.99753773,0.0009979213,0.00029436263,0.000935623,0.00016954244,0.000064817374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007864482,0.00028157697,0.00039904594,0.0003682824,0.00028557464,0.0002501361,0.0013654004,0.000113397255,0.0000048597394],"category_scores_gemma":[0.00006550331,0.00020920727,0.0000835013,0.0003415822,0.001542432,0.00031454687,0.00062899996,0.00034280584,0.0000031282143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006669812,0.00010396037,0.0000162536,0.00007203008,0.00003551537,0.000028332484,0.0017377603,0.07096822,0.003654609,0.13998345,0.0000111065965,0.7833221],"study_design_scores_gemma":[0.00027204448,0.0003194656,0.00021093739,0.00035065203,0.00000574877,0.000047372803,4.6303023e-7,0.8260351,0.0055466616,0.166937,0.00006658585,0.00020799003],"about_ca_topic_score_codex":0.000049072238,"about_ca_topic_score_gemma":0.00006303623,"teacher_disagreement_score":0.9076846,"about_ca_system_score_codex":0.000084669206,"about_ca_system_score_gemma":0.00011801615,"threshold_uncertainty_score":0.8531225},"labels":[],"label_agreement":null},{"id":"W1489809596","doi":"10.1007/978-3-319-15579-1_54","title":"Order Structures for Subclasses of Generalised Traces","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; TRACE (psycholinguistics); Equivalence (formal languages); Causality (physics); Simultaneity; Order (exchange); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics","score_opus":0.03179765081236744,"score_gpt":0.2717965071202799,"score_spread":0.23999885630791248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489809596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042559922,0.001434037,0.9947152,0.0003931755,0.0016013526,0.00042936872,0.000025284466,0.00012273628,0.00085321575],"genre_scores_gemma":[0.13203141,0.000038933977,0.866029,0.00078260794,0.0006123081,0.000016173197,0.000014433458,0.00004878849,0.00042634705],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969216,0.000030200346,0.00053920987,0.0011356649,0.0008451786,0.00052812573],"domain_scores_gemma":[0.9970668,0.0005718661,0.00039496552,0.0012029436,0.00061559334,0.00014781166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009062905,0.0004647415,0.0006414138,0.00059502455,0.00012901623,0.0002914027,0.0034416444,0.0002963333,0.000020296264],"category_scores_gemma":[0.00015767239,0.00038100427,0.00014610545,0.00048922666,0.0006682469,0.0005129766,0.00068537437,0.00031984187,0.0000039042275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000221649,0.0000389455,0.000025207895,0.000145499,0.000032343367,0.0000234101,0.0010585944,0.03882655,0.0018134896,0.35813227,0.00041304194,0.59946847],"study_design_scores_gemma":[0.00040996235,0.00021897057,0.000042081996,0.00014091974,0.000011407997,0.000029146231,3.2411788e-7,0.2726344,0.0072595757,0.7152041,0.0035209893,0.00052811153],"about_ca_topic_score_codex":0.000020030246,"about_ca_topic_score_gemma":0.0000384371,"teacher_disagreement_score":0.5989404,"about_ca_system_score_codex":0.000119810844,"about_ca_system_score_gemma":0.0007526013,"threshold_uncertainty_score":0.99986416},"labels":[],"label_agreement":null},{"id":"W1489975931","doi":"10.25596/jalc-2002-247","title":"The Computing Power of Programs over Finite Monoids","year":2002,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Monoid; Formalism (music); Computation; Connection (principal bundle); Syntactic monoid; Expressive power; Mathematics; Polynomial; Regular language; Computer science; Discrete mathematics; Free monoid; Algebra over a field; Pure mathematics; Theoretical computer science; Algorithm; Automaton","score_opus":0.015135791753426598,"score_gpt":0.21903853496017972,"score_spread":0.2039027432067531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489975931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3296496,0.0009075697,0.6023509,0.0013834386,0.00066260766,0.0002688728,6.3791583e-7,0.0005571398,0.06421925],"genre_scores_gemma":[0.9901511,0.000008389207,0.0086434055,0.00023581034,0.000017795861,0.0000013539959,1.4856779e-7,0.000003828209,0.000938132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993359,0.000031129443,0.00015497152,0.0001405541,0.00015264592,0.00018480115],"domain_scores_gemma":[0.9992471,0.00021136188,0.000058718695,0.00042513543,0.00002681555,0.000030913783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024272813,0.000065832966,0.00007443192,0.00001929459,0.00010595098,0.00011301897,0.00064929615,0.000023517772,0.00006347997],"category_scores_gemma":[0.000018421659,0.000038605267,0.000051365845,0.00020220957,0.000055997458,0.00013404005,0.0002136471,0.000057865152,0.000046309757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012907689,0.000112123715,0.0012423687,0.000005117658,0.000019172167,0.000005517821,0.0017645926,0.00006426578,0.00017796515,0.41569036,0.0035024607,0.57741475],"study_design_scores_gemma":[0.00020395612,0.00009920889,0.0025760138,0.000018454795,0.0000018994212,0.000006138133,0.0001108408,0.97478294,0.0009004346,0.006607523,0.014556474,0.00013609207],"about_ca_topic_score_codex":0.000010246937,"about_ca_topic_score_gemma":0.0000011707593,"teacher_disagreement_score":0.9747187,"about_ca_system_score_codex":0.000005439219,"about_ca_system_score_gemma":0.0000036501337,"threshold_uncertainty_score":0.15742771},"labels":[],"label_agreement":null},{"id":"W1498880175","doi":"10.46298/dmtcs.486","title":"Cubefree words with many squares","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Construct (python library); Binary number; Square (algebra); Mathematics; Integer (computer science); Semantics (computer science); Discrete mathematics; Automaton; Cellular automaton; Combinatorics; Computer science; Arithmetic; Algorithm; Theoretical computer science; Geometry","score_opus":0.0070838399705147334,"score_gpt":0.23674419756294127,"score_spread":0.22966035759242653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498880175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086093366,0.000010623026,0.9017039,0.0009050302,0.0005651539,0.0002384791,0.000003162411,0.00046585093,0.01001446],"genre_scores_gemma":[0.57569945,9.679195e-7,0.42388302,0.00027327088,0.00009869666,0.000012061311,7.3958023e-7,0.00001583428,0.0000159415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964244,0.000055398355,0.00042440006,0.0009514201,0.001249548,0.00089482736],"domain_scores_gemma":[0.9965776,0.00043367402,0.00015502916,0.0021919976,0.00020013572,0.00044151346],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018354983,0.00037409939,0.000371428,0.00024075352,0.00055906904,0.0013191216,0.0049862424,0.00009195663,0.00014715768],"category_scores_gemma":[0.00012398437,0.000247899,0.00010755281,0.0012783571,0.0038801848,0.00102285,0.0015328657,0.00051243394,0.0001517216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040578184,0.00009236378,0.00003847866,0.000023057053,0.000007745885,0.000026794185,0.001276039,0.000014991057,0.0023854107,0.9878666,0.00003580627,0.008228647],"study_design_scores_gemma":[0.00020316483,0.00016335871,0.00017691674,0.00005798116,0.000008802352,0.00015227425,0.000049603917,0.54276556,0.0033639774,0.4525764,0.00013051719,0.00035146775],"about_ca_topic_score_codex":0.0000021169558,"about_ca_topic_score_gemma":0.0000024869776,"teacher_disagreement_score":0.54275054,"about_ca_system_score_codex":0.000022671156,"about_ca_system_score_gemma":0.0001426207,"threshold_uncertainty_score":0.9999973},"labels":[],"label_agreement":null},{"id":"W1500269013","doi":"10.1007/11907350_34","title":"An Optimal Algorithm for Detecting Pseudo-squares","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Computer science; Algorithm; Quadratic equation; Square (algebra); Plane (geometry); Boundary (topology); Word (group theory); Translation (biology); Time complexity; Mathematics; Geometry","score_opus":0.012223271622770836,"score_gpt":0.2472001122946769,"score_spread":0.23497684067190605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500269013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017317785,0.00032810433,0.99610907,0.0001427498,0.0016264892,0.0004951113,0.00001875467,0.00041931676,0.00068725256],"genre_scores_gemma":[0.028420176,0.0000062580602,0.9695369,0.0007264038,0.001063918,0.000023642868,0.000012651521,0.000055061464,0.00015499954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586046,0.000036635825,0.0005538393,0.0018780907,0.0007669796,0.0009039936],"domain_scores_gemma":[0.9969961,0.00068127346,0.00031496704,0.0015840366,0.00023763407,0.0001859684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012216045,0.00060510816,0.00055197807,0.00072647416,0.0004650645,0.0010150844,0.004198308,0.00036162764,0.0000119998895],"category_scores_gemma":[0.000047437232,0.000562577,0.00019644557,0.00043247864,0.00048081006,0.0009974935,0.00076582417,0.0005830559,0.00001431114],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002828248,0.000025462083,0.000002977293,0.000018093862,0.0000056848107,0.000036381094,0.0002224394,0.031496875,0.00021209943,0.0045721573,0.000026256379,0.9633787],"study_design_scores_gemma":[0.00024894223,0.00032244294,0.000021125607,0.00016107086,0.00000712213,0.00008209688,2.774594e-7,0.90641993,0.0039002954,0.08738737,0.000779118,0.00067022967],"about_ca_topic_score_codex":0.00003171467,"about_ca_topic_score_gemma":0.000022452932,"teacher_disagreement_score":0.96270853,"about_ca_system_score_codex":0.00021737439,"about_ca_system_score_gemma":0.00033509516,"threshold_uncertainty_score":0.99968255},"labels":[],"label_agreement":null},{"id":"W1500786493","doi":"10.3233/fi-2010-285","title":"An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality","year":2010,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Extension (predicate logic); Mathematics; Discrete mathematics; Combinatorics; Computer science; Programming language","score_opus":0.016521425353453467,"score_gpt":0.27466689756448437,"score_spread":0.2581454722110309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500786493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96577495,0.000036913556,0.03316618,0.00011419401,0.00015514376,0.00035617454,0.000028162242,0.00007144569,0.00029680645],"genre_scores_gemma":[0.94571054,0.000006987796,0.053883962,0.00031801948,0.000029250537,0.000016272726,0.000015058522,0.0000063529815,0.000013552058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991347,0.000023780107,0.00032070265,0.00019164507,0.00012116801,0.00020800288],"domain_scores_gemma":[0.99899065,0.000110601046,0.00014866992,0.00052592,0.00007294088,0.0001512367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007843516,0.00012922443,0.00018650055,0.000059366794,0.00014252182,0.00024018653,0.00037316585,0.00006389619,0.000016801137],"category_scores_gemma":[0.00005517006,0.00010303616,0.000025605026,0.00007112452,0.000117111806,0.0020745923,0.00018604878,0.0000979036,0.0000020677817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011735601,0.0002745776,0.00044228078,0.00038861088,0.00003536524,8.654934e-7,0.0073123276,0.000006943855,0.28167185,0.53960365,0.00021166561,0.16993454],"study_design_scores_gemma":[0.0010496202,0.0009798466,0.0061685448,0.000029609546,0.000015064844,0.000039714978,0.0003906882,0.9501228,0.018788956,0.021322241,0.0008379751,0.00025497572],"about_ca_topic_score_codex":0.000012404625,"about_ca_topic_score_gemma":0.00001350856,"teacher_disagreement_score":0.9501158,"about_ca_system_score_codex":0.000006448718,"about_ca_system_score_gemma":0.000027535087,"threshold_uncertainty_score":0.42016926},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032152299180226156,"score_gpt":0.31842170595452435,"score_spread":0.2862694067742982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501444314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29761875,0.00010705756,0.6989694,0.0008985574,0.0019466802,0.00003542665,0.000007121991,0.000012149222,0.00040485052],"genre_scores_gemma":[0.74362767,0.0000074238915,0.2560851,0.000085609936,0.00018482568,3.398501e-7,7.582203e-7,0.0000021705757,0.0000061370333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99794686,0.000047964593,0.0005700255,0.00012102021,0.0011305687,0.00018353837],"domain_scores_gemma":[0.9972538,0.00015661046,0.0007250485,0.00043795875,0.001317289,0.000109341025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013401434,0.00008493943,0.00017884128,0.0005026383,0.000067627974,0.00011629489,0.004048596,0.000018745177,0.000030050216],"category_scores_gemma":[0.00016297001,0.00007156475,0.00010804956,0.00045646075,0.0006393909,0.0022776267,0.00071312796,0.00009299091,0.000004716391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018902629,0.00062836875,0.0040845997,0.000013478898,0.00009552374,0.0000066487746,0.0027772172,0.0010008978,0.008384443,0.9170928,0.0007482899,0.06514882],"study_design_scores_gemma":[0.0032714005,0.0011136587,0.44917104,0.00063621206,0.00005482356,0.0011952154,0.00055328564,0.2515096,0.11469764,0.17154875,0.0054595913,0.0007887722],"about_ca_topic_score_codex":0.000020206955,"about_ca_topic_score_gemma":0.0000016287289,"teacher_disagreement_score":0.7455441,"about_ca_system_score_codex":0.00007452713,"about_ca_system_score_gemma":0.00023726119,"threshold_uncertainty_score":0.7523366},"labels":[],"label_agreement":null},{"id":"W1502715615","doi":"10.1016/j.ejc.2015.05.006","title":"Palindromic sequences generated from marked morphisms","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Morphism; Mathematics; Palindrome; Alphabet; Combinatorics; Combinatorics on words; Fixed point; Class (philosophy); Aperiodic graph; Order (exchange); Discrete mathematics; Sequence (biology); Geometry","score_opus":0.03061910790872446,"score_gpt":0.21986033904549562,"score_spread":0.18924123113677116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502715615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85217804,0.0013078647,0.13632879,0.0006689796,0.003799775,0.00004630701,0.000003010799,0.00009253122,0.0055747363],"genre_scores_gemma":[0.99104565,0.00005103969,0.008251175,0.00026162196,0.00021531575,1.678628e-7,0.000001702939,0.000018732653,0.00015459723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978849,0.0007493573,0.000509911,0.00017402729,0.00047953153,0.00020224835],"domain_scores_gemma":[0.99841714,0.00009625864,0.00048119426,0.00038663088,0.00032890475,0.00028986417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020373622,0.00014888948,0.00024348745,0.0001231971,0.0000604822,0.00022099802,0.0015980297,0.000025095069,0.000016357106],"category_scores_gemma":[0.00013980761,0.00012045855,0.00009141669,0.00036755088,0.000046650992,0.00052659627,0.00020739448,0.00025829347,0.00011538998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035450232,0.0017417578,0.010136589,0.000037866466,0.0008816727,0.029276688,0.012126107,0.003384775,0.04173694,0.5434964,0.20960334,0.14722338],"study_design_scores_gemma":[0.015457655,0.0040644747,0.03612322,0.0005152691,0.00016455461,0.002913097,0.000938671,0.09334224,0.018948669,0.70980495,0.1153392,0.002387994],"about_ca_topic_score_codex":0.0000046624486,"about_ca_topic_score_gemma":1.2048102e-7,"teacher_disagreement_score":0.16630857,"about_ca_system_score_codex":0.00007024545,"about_ca_system_score_gemma":0.00014701547,"threshold_uncertainty_score":0.4912157},"labels":[],"label_agreement":null},{"id":"W1503119185","doi":"10.1007/3-540-36136-7_56","title":"Expected Acceptance Counts for Finite Automata with Almost Uniform Input","year":2002,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reciprocal; Sequence (biology); Mathematics; Prefix; Automaton; Entropy (arrow of time); Discrete mathematics; Constant (computer programming); Random sequence; Finite-state machine; Algorithm; Computer science; Distribution (mathematics); Theoretical computer science","score_opus":0.016065270335361096,"score_gpt":0.2365474981994039,"score_spread":0.2204822278640428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503119185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051377937,0.00012626107,0.99270177,0.00067125796,0.00057566754,0.00021497879,0.0000038462867,0.000264654,0.00030376203],"genre_scores_gemma":[0.6590485,0.000007115143,0.339757,0.0010634664,0.00009077794,0.000014440211,0.0000011935263,0.000008121874,0.000009392271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983031,0.000021175525,0.0001864775,0.000625247,0.00038962945,0.00047434616],"domain_scores_gemma":[0.9985533,0.00037909002,0.00008372702,0.00079317135,0.00010545989,0.000085293075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031845007,0.00018325704,0.00017442109,0.00020865162,0.00019669737,0.000339618,0.0018659846,0.000058771646,0.000038914943],"category_scores_gemma":[0.00008387786,0.00014147254,0.000033735596,0.0015989756,0.00024304893,0.0007167568,0.0002899623,0.00014386715,0.000053129297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007977563,0.000097746735,0.0004715401,0.00002114681,0.000006633692,0.000030692256,0.0015009469,0.01275933,0.00029119186,0.0047344347,0.00034567894,0.9797327],"study_design_scores_gemma":[0.00037797893,0.00012674648,0.0006383374,0.000053019372,0.0000015364666,0.00003484273,6.528731e-7,0.98944765,0.002160652,0.00589476,0.0010282794,0.00023556336],"about_ca_topic_score_codex":0.0000050011427,"about_ca_topic_score_gemma":0.00001023178,"teacher_disagreement_score":0.97949713,"about_ca_system_score_codex":0.0000750068,"about_ca_system_score_gemma":0.00007268855,"threshold_uncertainty_score":0.5769083},"labels":[],"label_agreement":null},{"id":"W1503539558","doi":"10.1007/978-3-540-74456-6_45","title":"State Complexity of Basic Operations on Suffix-Free Regular Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Suffix; State (computer science); Programming language; Theoretical computer science; Linguistics","score_opus":0.02995933655791481,"score_gpt":0.2700726167175028,"score_spread":0.24011328015958802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503539558","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013030091,0.00036671254,0.991647,0.00065842894,0.00072910823,0.0003092011,0.000034927856,0.00017154515,0.004780078],"genre_scores_gemma":[0.28348354,0.00006351069,0.7113037,0.0036021406,0.00048427176,0.00000772666,0.000023215836,0.000066688575,0.00096519146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661016,0.000050792536,0.00057204557,0.0011554407,0.0010490279,0.0005625022],"domain_scores_gemma":[0.9964454,0.00046600957,0.00021741445,0.0024937792,0.0002313172,0.00014608995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012973493,0.00045192652,0.0005465496,0.00084372616,0.00021570337,0.00027708133,0.0044483794,0.00019916399,0.00003997441],"category_scores_gemma":[0.00012641557,0.00039553674,0.00014139964,0.00058381073,0.0013711966,0.00039733746,0.0014232541,0.00061001955,0.0000313607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012039809,0.00008915106,0.000019485524,0.000056335084,0.000019855928,0.00013860576,0.0012425819,0.033597693,0.0006981783,0.51601005,0.00007669743,0.44803932],"study_design_scores_gemma":[0.00055392884,0.00045896665,0.00054370257,0.0006820446,0.000010127093,0.00006567129,9.961686e-7,0.3515376,0.020215787,0.6242055,0.0008077943,0.0009178631],"about_ca_topic_score_codex":0.00007798634,"about_ca_topic_score_gemma":0.00024283625,"teacher_disagreement_score":0.44712144,"about_ca_system_score_codex":0.00016866147,"about_ca_system_score_gemma":0.0003097199,"threshold_uncertainty_score":0.9998497},"labels":[],"label_agreement":null},{"id":"W1504799708","doi":"10.46298/dmtcs.566","title":"Monadic Second-Order Classes of Forests with a Monadic Second-Order 0-1 Law","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Order (exchange); Mathematics; Law; Political science; Business","score_opus":0.010491665668105733,"score_gpt":0.24365169020359717,"score_spread":0.23316002453549145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504799708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1563844,0.00015187246,0.8275194,0.00025882962,0.00033683635,0.00036887213,0.000014089202,0.00021566586,0.01475001],"genre_scores_gemma":[0.69867146,0.0000021331205,0.3006309,0.0005096704,0.00008573242,0.00002175839,0.0000026141108,0.000029283623,0.000046450903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569905,0.00013256623,0.00072470424,0.00082493003,0.0012753747,0.0013433546],"domain_scores_gemma":[0.996137,0.0007073265,0.00033637794,0.001762604,0.00041744052,0.000639209],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001994222,0.00049974635,0.0006497644,0.00027409752,0.00043924135,0.0004903573,0.0032870134,0.00012771864,0.00046051963],"category_scores_gemma":[0.00009796162,0.00035233216,0.00013987179,0.001834176,0.0043926584,0.0018563144,0.0012772749,0.00034417454,0.00008232961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008316582,0.00021739201,0.00019410868,0.00013439385,0.000029111008,0.000009179343,0.0025600705,0.00003950307,0.00058581686,0.99487627,0.00008108311,0.0012647795],"study_design_scores_gemma":[0.0006368351,0.00043741768,0.00122502,0.00026171352,0.000041009895,0.00026466898,0.0001853876,0.46507788,0.008350001,0.52216816,0.0005138474,0.0008380516],"about_ca_topic_score_codex":0.000008291902,"about_ca_topic_score_gemma":0.000025952935,"teacher_disagreement_score":0.54228705,"about_ca_system_score_codex":0.000058335438,"about_ca_system_score_gemma":0.00022378277,"threshold_uncertainty_score":0.9998929},"labels":[],"label_agreement":null},{"id":"W1504896064","doi":"10.3233/fi-2013-804","title":"Filtrations of Formal Languages by Arithmetic Progressions","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arithmetic; Computer science; Mathematics; Programming language; Algebra over a field; Pure mathematics","score_opus":0.004885578396302735,"score_gpt":0.22976776281802905,"score_spread":0.2248821844217263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504896064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47882,0.0003470849,0.45006597,0.002882289,0.00034743326,0.0013763623,0.00008982829,0.00061617186,0.06545486],"genre_scores_gemma":[0.9561318,0.0000073511324,0.042563852,0.0006213179,0.000014233108,0.00010145043,0.000031837004,0.0000050685267,0.0005230776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990625,0.000019057097,0.0003547233,0.00008523229,0.00022087239,0.0002576642],"domain_scores_gemma":[0.9992477,0.0000843171,0.00013753583,0.00039842783,0.000044554075,0.000087425564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014213721,0.00009938115,0.00012803248,0.000075048854,0.00011363402,0.00018477949,0.00057090167,0.000036975922,0.0005960756],"category_scores_gemma":[0.0000284002,0.00007623602,0.000048654325,0.00020259693,0.000069799724,0.0023017733,0.00021188735,0.00007804128,0.00033625116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044052817,0.00057713455,0.0018995418,0.00028585512,0.00011701452,0.0000025142658,0.012484165,0.000028691305,0.016597409,0.3817879,0.19452056,0.3916948],"study_design_scores_gemma":[0.004392972,0.0018154101,0.026883477,0.0008292351,0.000095800715,0.00021811605,0.021942817,0.6625804,0.1327509,0.04376441,0.10225813,0.0024683536],"about_ca_topic_score_codex":0.000026599886,"about_ca_topic_score_gemma":7.830635e-7,"teacher_disagreement_score":0.6625517,"about_ca_system_score_codex":0.000015824051,"about_ca_system_score_gemma":0.000029129742,"threshold_uncertainty_score":0.65266097},"labels":[],"label_agreement":null},{"id":"W1505339043","doi":"10.1090/proc/13013","title":"Incoherent Coxeter Groups","year":2015,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coxeter group; Mathematics; Combinatorics","score_opus":0.019771557830328072,"score_gpt":0.25868605566610214,"score_spread":0.23891449783577406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505339043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93140346,0.00019530857,0.04730401,0.0051724534,0.0005041577,0.0010837113,0.000025207903,0.0006160622,0.013695619],"genre_scores_gemma":[0.8530001,0.000034346704,0.14526641,0.001112491,0.00019249987,0.00010512542,0.0000012844212,0.000046762198,0.00024098335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750185,0.00002194752,0.00058167253,0.00060982327,0.0008616618,0.0004230253],"domain_scores_gemma":[0.99741757,0.00014679246,0.0011922402,0.0006949323,0.00036746787,0.00018097603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010906945,0.0003858236,0.00084209704,0.000030190651,0.00009907585,0.00024447226,0.003986508,0.00014306809,0.000015224564],"category_scores_gemma":[0.00020777006,0.0002459258,0.0007851723,0.00046223373,0.00077819906,0.00019185572,0.0069681024,0.0007282734,0.000029580564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002903852,0.001084116,0.0014422074,0.0034052245,0.0007600677,0.000001339855,0.019755602,0.000040385185,0.0054007308,0.8310989,0.12199645,0.0149859125],"study_design_scores_gemma":[0.00017938238,0.00008123864,0.0005160508,0.0004234725,0.000071534225,0.000015265825,0.0008859631,0.043129917,0.002064666,0.9518263,0.00037294257,0.00043330318],"about_ca_topic_score_codex":0.000016262002,"about_ca_topic_score_gemma":9.965382e-8,"teacher_disagreement_score":0.12162351,"about_ca_system_score_codex":0.00016282724,"about_ca_system_score_gemma":0.0001168504,"threshold_uncertainty_score":0.9999993},"labels":[],"label_agreement":null},{"id":"W1506687179","doi":"10.1007/3-540-45005-x_28","title":"Circular Words Avoiding Patterns","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Cube (algebra); Binary number; Algorithm; Arithmetic; Combinatorics; Mathematics","score_opus":0.014616099937376179,"score_gpt":0.22725970504435922,"score_spread":0.21264360510698305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506687179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034323128,0.00074826635,0.9916585,0.0005509494,0.0027349037,0.00026587787,0.0000050863746,0.00027284253,0.0034203152],"genre_scores_gemma":[0.6546491,0.00018242118,0.33127704,0.011611879,0.001086117,0.000020899599,0.000011128332,0.000135011,0.001026436],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557304,0.00008215039,0.0005361929,0.001835216,0.001081255,0.0008921141],"domain_scores_gemma":[0.9968752,0.00048569264,0.00027637673,0.0020117222,0.00012873222,0.0002222247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016148324,0.0006311178,0.0005805242,0.00082101516,0.0003903885,0.00081761746,0.0042326185,0.00035650338,0.00006517923],"category_scores_gemma":[0.00009853064,0.0005894345,0.00020162211,0.0006050076,0.00041011232,0.00070378283,0.0012614956,0.0011641006,0.00008614302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025174027,0.00004794999,0.00024498824,0.000103067665,0.000028277374,0.0004910179,0.0019102623,0.008287163,0.00044286615,0.115199916,0.00007285869,0.8731691],"study_design_scores_gemma":[0.00043282608,0.0001588367,0.00016315751,0.0010456577,0.00001614235,0.00037296407,8.192234e-7,0.34841335,0.0035978484,0.6368421,0.0071052387,0.0018511146],"about_ca_topic_score_codex":0.000015298749,"about_ca_topic_score_gemma":0.000012850953,"teacher_disagreement_score":0.871318,"about_ca_system_score_codex":0.0003259716,"about_ca_system_score_gemma":0.00029342918,"threshold_uncertainty_score":0.9996557},"labels":[],"label_agreement":null},{"id":"W1512110678","doi":"10.1007/bfb0023887","title":"Kleene automata and recursion theory","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Recursion (computer science); Kleene's recursion theorem; Primitive recursive function; Negation; Automaton; Class (philosophy); Finite-state machine; Mathematics; Turing machine; Discrete mathematics; Computer science; Algebra over a field; Algorithm; Theoretical computer science; Pure mathematics; Programming language; Artificial intelligence","score_opus":0.010200385523994044,"score_gpt":0.22829224856054825,"score_spread":0.2180918630365542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512110678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022812239,0.0017831841,0.9887618,0.001187393,0.0011771357,0.00025859693,0.0000056417707,0.00037626125,0.0062219063],"genre_scores_gemma":[0.16014989,0.0006964416,0.82847863,0.0059667733,0.0014512413,0.000013376107,0.000010544431,0.000099950004,0.003133165],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646056,0.00006318111,0.0004427653,0.001614324,0.0007828366,0.00063633797],"domain_scores_gemma":[0.99711096,0.00068141846,0.00023868876,0.0016588176,0.00010296555,0.00020715919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001727423,0.0005328729,0.00049447746,0.0006865438,0.00027980842,0.00058405707,0.0030779173,0.0003379365,0.000047869937],"category_scores_gemma":[0.00007539662,0.00045860434,0.00009576613,0.000391454,0.0008404925,0.00081570196,0.002126875,0.0006781301,0.00006546127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004250961,0.000015291025,0.00000652791,0.00001806767,0.000005356896,0.00004264706,0.0003686819,0.0005399729,0.000072643285,0.18089314,0.000027261303,0.81800616],"study_design_scores_gemma":[0.00029402197,0.00014389302,0.00016019939,0.00043751937,0.00000769479,0.00019789118,1.9124171e-7,0.29240158,0.0008894552,0.69837475,0.006392697,0.00070013147],"about_ca_topic_score_codex":0.000005788131,"about_ca_topic_score_gemma":0.0000109633,"teacher_disagreement_score":0.81730604,"about_ca_system_score_codex":0.00017652003,"about_ca_system_score_gemma":0.0002529964,"threshold_uncertainty_score":0.99978656},"labels":[],"label_agreement":null},{"id":"W1512254831","doi":"10.1007/3-540-45687-2_27","title":"Algorithms for Computing Small NFAs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science","score_opus":0.03125291508506543,"score_gpt":0.248655068798754,"score_spread":0.21740215371368854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512254831","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035781704,0.0006306635,0.9914475,0.00065550656,0.002706119,0.0006010567,0.000010553707,0.00039310867,0.003519722],"genre_scores_gemma":[0.0151080005,0.000038335995,0.97994506,0.002513099,0.0012191476,0.000012353649,0.000008613786,0.00006772677,0.0010876834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956498,0.000030852178,0.000644654,0.0019535196,0.0007137454,0.0010074053],"domain_scores_gemma":[0.9964664,0.0010991428,0.0003687313,0.0016000537,0.0002508346,0.000214868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012415217,0.00066283584,0.00068408716,0.00074235274,0.00041511987,0.00079086376,0.004707746,0.0003800701,0.000025107058],"category_scores_gemma":[0.00009822828,0.000615553,0.00025689893,0.00051569764,0.00055071135,0.0004214599,0.0016052991,0.00068975205,0.00006075401],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020972652,0.000026438243,0.000006878424,0.000045370332,0.0000118961125,0.000047994796,0.00050824246,0.007422816,0.000044796423,0.070192255,0.000058314123,0.9216329],"study_design_scores_gemma":[0.00029545676,0.00014885452,0.00001998535,0.00030224174,0.000007243196,0.000081044986,1.12850636e-7,0.78938496,0.00059212896,0.2045833,0.003922466,0.0006622225],"about_ca_topic_score_codex":0.000011670946,"about_ca_topic_score_gemma":0.00001075857,"teacher_disagreement_score":0.9209707,"about_ca_system_score_codex":0.00024612507,"about_ca_system_score_gemma":0.00022745585,"threshold_uncertainty_score":0.99962956},"labels":[],"label_agreement":null},{"id":"W1512553031","doi":"10.1007/978-3-540-77684-0_16","title":"Visibly Pushdown Transducers for Approximate Validation of Streaming XML","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Well-formed document; XML validation; Document Structure Description; XML; Pushdown automaton; Streaming XML; Programming language; XML Schema (W3C); XML Encryption; Theoretical computer science; Automaton; World Wide Web","score_opus":0.01680012912695094,"score_gpt":0.23939827623336368,"score_spread":0.22259814710641274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512553031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096520735,0.00031641225,0.99590105,0.00023156258,0.0009587329,0.0005602941,0.000019837757,0.00014755914,0.00089932786],"genre_scores_gemma":[0.36575648,0.00011443449,0.6331206,0.00044481343,0.00033261298,0.000023728197,0.000022852626,0.000051950894,0.00013254641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968801,0.000026764847,0.0006075463,0.0012038891,0.0007398839,0.00054181356],"domain_scores_gemma":[0.99760854,0.00056434475,0.00039901212,0.0010906009,0.0002282485,0.00010923926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008111552,0.0004404868,0.000570004,0.000748645,0.00021215362,0.0002074294,0.002584882,0.00025831352,0.0000090323265],"category_scores_gemma":[0.0000581991,0.00040454787,0.0002129978,0.000484834,0.00055728276,0.0006678505,0.00037580813,0.00032509994,0.000004816032],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013579522,0.000048389295,0.000014717465,0.00016793591,0.00002213938,0.000020675674,0.0023100208,0.023393089,0.0025070603,0.026018227,0.000033067965,0.9454511],"study_design_scores_gemma":[0.0006210865,0.0003466342,0.00005918914,0.0006074372,0.000018497822,0.00008615694,6.3855913e-7,0.77837497,0.06186604,0.15622924,0.00092835276,0.00086173543],"about_ca_topic_score_codex":0.000012582916,"about_ca_topic_score_gemma":0.000005162818,"teacher_disagreement_score":0.9445894,"about_ca_system_score_codex":0.00014605992,"about_ca_system_score_gemma":0.00037641142,"threshold_uncertainty_score":0.9998406},"labels":[],"label_agreement":null},{"id":"W1517109152","doi":"10.37236/2721","title":"On a Matrix Representation for Polynomially Recursive Sequences","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Characterization (materials science); Sequence (biology); Uniqueness; Extension (predicate logic); Combinatorics; Representation (politics); Matrix (chemical analysis); Similarity (geometry); Field (mathematics); Canonical form; Discrete mathematics; Pure mathematics; Algebra over a field; Mathematical analysis; Computer science","score_opus":0.012416149409724757,"score_gpt":0.2878384431530843,"score_spread":0.2754222937433596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517109152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32013255,0.0058858837,0.66626436,0.004396191,0.0023534829,0.00029988794,0.0000010960515,0.000044112105,0.00062245026],"genre_scores_gemma":[0.9989053,0.00017618552,0.00033852967,0.00018130659,0.00021329298,0.0000047331373,3.5810734e-7,0.000008122884,0.0001721779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873024,0.00013944853,0.00027192032,0.000087113716,0.00029866156,0.00047261102],"domain_scores_gemma":[0.9984255,0.0006680727,0.0004185902,0.0002754858,0.00014589715,0.000066476896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016977568,0.000097599994,0.00016006353,0.00008746537,0.00013795463,0.00006861264,0.00093188573,0.000040119092,0.0000030135532],"category_scores_gemma":[0.00018039906,0.00006277837,0.00012402801,0.00028974403,0.000030567942,0.0005181584,0.00004635366,0.00027891106,0.000006706629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044695436,0.00006916068,0.0000355676,0.000002718874,0.000034246004,8.8528907e-7,0.0005298811,0.000043411317,0.00033123736,0.9958463,0.0014247682,0.0016371475],"study_design_scores_gemma":[0.0005201602,0.00073315215,0.00012808875,0.000016608285,0.000020089423,0.0001405279,0.00010970547,0.0005721231,0.005899219,0.9899988,0.0017745083,0.00008697479],"about_ca_topic_score_codex":0.000002978665,"about_ca_topic_score_gemma":3.3902054e-7,"teacher_disagreement_score":0.67877275,"about_ca_system_score_codex":0.00022083007,"about_ca_system_score_gemma":0.0002534195,"threshold_uncertainty_score":0.25600275},"labels":[],"label_agreement":null},{"id":"W1519107695","doi":"10.37236/436","title":"A Theory of Transformation Monoids: Combinatorics and Representation Theory","year":2010,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monoid; Mathematics; Transformation (genetics); Discrete mathematics; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.010460771401402174,"score_gpt":0.24416750660461436,"score_spread":0.2337067352032122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519107695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3156223,0.009413043,0.6710058,0.00084389484,0.0018433587,0.0003747375,0.0000035827645,0.0000538423,0.0008394817],"genre_scores_gemma":[0.99613816,0.003459299,0.00013793688,0.00006243049,0.000083801046,0.000008332382,0.0000032246398,0.000026402166,0.00008042595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655837,0.0009253354,0.001024765,0.0002732141,0.00073541264,0.00048289463],"domain_scores_gemma":[0.9956307,0.0010717257,0.0017243971,0.0009560301,0.0005176974,0.000099494464],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006881914,0.00032711774,0.00063778803,0.00031196963,0.00016399809,0.00016546634,0.0022567736,0.00034850242,0.0000055918604],"category_scores_gemma":[0.00025684052,0.00023413137,0.00028173605,0.00046118855,0.00020580806,0.0005550539,0.0005003604,0.0027129916,0.0000014017934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081471386,0.00014400213,0.000026937958,0.0000826972,0.00016111002,0.000003753509,0.0033221832,0.00009477849,0.000515608,0.984038,0.00004607891,0.011483375],"study_design_scores_gemma":[0.00081543264,0.00036677794,0.00026607062,0.00010870644,0.00014412415,0.00017368601,0.000399194,0.0035250261,0.006551019,0.9871791,0.00024583226,0.00022505909],"about_ca_topic_score_codex":0.000007043895,"about_ca_topic_score_gemma":0.0000011609548,"teacher_disagreement_score":0.6805159,"about_ca_system_score_codex":0.00018824135,"about_ca_system_score_gemma":0.0007311995,"threshold_uncertainty_score":0.9995878},"labels":[],"label_agreement":null},{"id":"W1524205571","doi":"10.1007/978-3-540-30500-2_20","title":"State Complexity and the Monoid of Transformations of a Finite Set","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monoid; State (computer science); Computer science; Root (linguistics); Set (abstract data type); Free monoid; Syntactic monoid; Finite-state machine; Computational complexity theory; Regular language; Finite set; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Automaton; Programming language; Linguistics","score_opus":0.021319518591987767,"score_gpt":0.23951034962227816,"score_spread":0.21819083103029038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524205571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071146264,0.0006147363,0.9958977,0.0009151752,0.00019943799,0.00030122208,0.00003891893,0.00003868003,0.0012826553],"genre_scores_gemma":[0.79882896,0.00023030532,0.20000218,0.0007606152,0.00007607182,0.0000057966536,0.000004686677,0.000014630766,0.00007678612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981396,0.00005215019,0.00056124415,0.00046688307,0.00051054027,0.00026956561],"domain_scores_gemma":[0.99767774,0.0009538322,0.00034273427,0.00082625315,0.00013828497,0.000061134895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011305806,0.0002557467,0.00048974366,0.00034459267,0.0001308858,0.00011298125,0.0018899103,0.00009358465,0.000010527073],"category_scores_gemma":[0.000041128045,0.00017508127,0.00010678171,0.00034584914,0.002335619,0.00040884488,0.00052358804,0.00034135964,0.0000026648154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025287662,0.000027036189,0.000016372807,0.00010378352,0.000022820306,0.0000044428966,0.009517547,0.033329424,0.0000800316,0.28208765,0.000009398281,0.6747762],"study_design_scores_gemma":[0.00040377592,0.000052576277,0.0001024394,0.00014711589,0.0000061400865,0.000016101163,4.2919916e-7,0.5956718,0.0008281733,0.40239584,0.00021373674,0.00016191715],"about_ca_topic_score_codex":0.00003612854,"about_ca_topic_score_gemma":0.000057408168,"teacher_disagreement_score":0.79811746,"about_ca_system_score_codex":0.000034561985,"about_ca_system_score_gemma":0.00017480463,"threshold_uncertainty_score":0.8605686},"labels":[],"label_agreement":null},{"id":"W1524482766","doi":"10.1007/978-3-540-30550-7_8","title":"The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hierarchy; Delta; Polynomial; Mathematics; Combinatorics; Physics; Mathematical analysis; Political science; Astronomy","score_opus":0.017019496046477036,"score_gpt":0.2334018407475007,"score_spread":0.21638234470102366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524482766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007929677,0.0015565706,0.9709538,0.018461155,0.002651424,0.0008019338,0.000011181693,0.00012941688,0.0046415376],"genre_scores_gemma":[0.9609434,0.00024367885,0.018275717,0.018146936,0.0012331075,0.00003956162,0.0000019842007,0.00006251078,0.0010530807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645555,0.00018599113,0.00045046955,0.0011430604,0.0010434457,0.0007214815],"domain_scores_gemma":[0.9916117,0.005737517,0.0002846596,0.0021418864,0.000103155624,0.00012103629],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0032465023,0.0005337107,0.00040643566,0.00024488816,0.0014763735,0.001772202,0.0063697854,0.00020578351,0.000015303569],"category_scores_gemma":[0.00026699502,0.00023444358,0.00015981158,0.0004634384,0.0039691622,0.00030239724,0.0021161092,0.0012193603,0.000033075365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042576266,0.000008525007,0.0000041213098,0.0000044309577,0.000013056123,0.00002516616,0.0012783869,0.0018535738,0.000018779709,0.5162943,0.00012531312,0.48033178],"study_design_scores_gemma":[0.00094308046,0.00019365313,0.00038025482,0.00033898262,0.000011979148,0.00015017587,0.0000017326068,0.17937706,0.0006533563,0.80918837,0.008162831,0.000598533],"about_ca_topic_score_codex":0.00006594751,"about_ca_topic_score_gemma":0.000115538445,"teacher_disagreement_score":0.9601505,"about_ca_system_score_codex":0.0001852832,"about_ca_system_score_gemma":0.0005769799,"threshold_uncertainty_score":0.9998236},"labels":[],"label_agreement":null},{"id":"W1524812206","doi":"10.1007/978-3-642-02737-6_14","title":"An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Extension (predicate logic); Computer science; Algorithm; Programming language","score_opus":0.011703666272083312,"score_gpt":0.24108665072141916,"score_spread":0.22938298444933586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524812206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004469048,0.00026248832,0.98927903,0.001623273,0.0018422266,0.00046016555,0.0000053067506,0.00015256478,0.0019058819],"genre_scores_gemma":[0.75260067,0.000025121848,0.23975876,0.0066658156,0.00044073662,0.000005779051,0.0000023771834,0.00003843253,0.00046230794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995931,0.0000821216,0.0006072701,0.0015592552,0.0012132725,0.0006070514],"domain_scores_gemma":[0.99562246,0.00022328932,0.00031806648,0.0033615641,0.00026236862,0.00021225066],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013287996,0.00048670243,0.00054102205,0.0006121702,0.00030462528,0.00042027442,0.0062025595,0.00027616473,0.000020388175],"category_scores_gemma":[0.00012654955,0.00033295003,0.00017441812,0.0010951733,0.0005826521,0.0005835766,0.001442717,0.0006430899,0.000029850611],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013443351,0.000051060466,0.000024836283,0.000015181702,0.000005005273,0.00003210309,0.001366634,0.015161158,0.0055332445,0.0181754,0.00008360403,0.95953834],"study_design_scores_gemma":[0.00064743817,0.0010559519,0.004732996,0.0023790395,0.000023715997,0.00021788648,0.0000014358557,0.6554525,0.028263988,0.30042434,0.0049499795,0.0018507178],"about_ca_topic_score_codex":0.000024716754,"about_ca_topic_score_gemma":0.00003554704,"teacher_disagreement_score":0.9576876,"about_ca_system_score_codex":0.0001558472,"about_ca_system_score_gemma":0.00041806462,"threshold_uncertainty_score":0.99991226},"labels":[],"label_agreement":null},{"id":"W1525517827","doi":"10.1007/3-540-45005-x_18","title":"Improved Bounds on the Number of Automata Accepting Finite Languages","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic finite automaton; Computer science; Pairwise comparison; Automaton; Finite-state machine; Upper and lower bounds; DFA minimization; Regular language; Quantum finite automata; Finite set; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Automata theory; Artificial intelligence","score_opus":0.014217663678697284,"score_gpt":0.2594135747342495,"score_spread":0.2451959110555522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525517827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071532227,0.00016437988,0.98080456,0.0011394417,0.0009922669,0.0002846771,0.000008570675,0.00017705106,0.015713736],"genre_scores_gemma":[0.68165946,0.00006187763,0.30461147,0.011602172,0.000570244,0.000021798734,0.0000074154086,0.00009293963,0.0013726191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699455,0.000073600735,0.0005076042,0.001066434,0.00078576175,0.00057206705],"domain_scores_gemma":[0.99562925,0.0016920308,0.00042528895,0.0020260387,0.00013791324,0.00008945705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014603224,0.00047032392,0.00046958672,0.00030983632,0.0002661638,0.00049588847,0.004206223,0.00024261656,0.0000959415],"category_scores_gemma":[0.00027064906,0.00032285557,0.00016394432,0.00055100577,0.00071496767,0.00036875755,0.0011181046,0.00072473154,0.000047066645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007645115,0.00006446877,0.00006704919,0.00006135587,0.000030232351,0.000058849786,0.0015212558,0.0032585692,0.0007279895,0.24124224,0.00014970978,0.7528106],"study_design_scores_gemma":[0.0004231217,0.00020384848,0.00016147766,0.0008000839,0.000014527432,0.00010731245,0.0000024256706,0.7453526,0.008365187,0.24104437,0.0025097548,0.0010152324],"about_ca_topic_score_codex":0.00002078993,"about_ca_topic_score_gemma":0.000009705282,"teacher_disagreement_score":0.7517954,"about_ca_system_score_codex":0.0001169895,"about_ca_system_score_gemma":0.00023353739,"threshold_uncertainty_score":0.99992234},"labels":[],"label_agreement":null},{"id":"W1526241488","doi":"10.1007/978-3-540-70844-5_2","title":"Language Decompositions, Primality, and Trajectory-Based Operations","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Primality test; Catenation; Computer science; Theoretical computer science; Programming language; Arithmetic; Algebra over a field; Discrete mathematics; Mathematics; Pure mathematics","score_opus":0.011695224623256516,"score_gpt":0.24572345660833153,"score_spread":0.23402823198507502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526241488","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017193557,0.0012022842,0.99432176,0.00075695873,0.00049202866,0.00027774822,0.000013300992,0.00022757571,0.0009890121],"genre_scores_gemma":[0.26423803,0.000074474134,0.7320576,0.0031677154,0.0002605608,0.000012481566,0.000017260074,0.000030541833,0.00014133999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753547,0.00004570364,0.00035605757,0.0010932462,0.0005527474,0.00041676563],"domain_scores_gemma":[0.99827886,0.00033541524,0.00009419299,0.001032043,0.00010105959,0.00015841759],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004688995,0.00038249747,0.00036909597,0.0005670075,0.00041858663,0.0005005922,0.0016748041,0.0002010304,0.00002143867],"category_scores_gemma":[0.00003299716,0.000352849,0.00009022747,0.00033747556,0.00068601844,0.0004777832,0.00060533336,0.00047723326,0.000021627897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010640288,0.00016985302,0.00015469815,0.0001144685,0.00003131642,0.00061090285,0.0051410566,0.093584664,0.0029728313,0.058707893,0.00016540202,0.8383363],"study_design_scores_gemma":[0.0004968248,0.00018791288,0.0007201323,0.00035508713,0.000011463999,0.00032685781,3.9792815e-7,0.97393036,0.0045596394,0.017661486,0.0007828032,0.0009670393],"about_ca_topic_score_codex":0.000037793372,"about_ca_topic_score_gemma":0.00009528889,"teacher_disagreement_score":0.8803457,"about_ca_system_score_codex":0.00014925409,"about_ca_system_score_gemma":0.0004956576,"threshold_uncertainty_score":0.99989235},"labels":[],"label_agreement":null},{"id":"W1529714626","doi":"10.1007/3-540-44674-5_20","title":"An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Cover (algebra); Computer science; Deterministic finite automaton; DFA minimization; Finite-state machine; Automaton; Nondeterministic finite automaton; Regular language; Algorithm; Deterministic automaton; Time complexity; Quantum finite automata; Computational complexity theory; Formal language; Theoretical computer science; Automata theory","score_opus":0.015139076732280194,"score_gpt":0.26906014390683425,"score_spread":0.25392106717455404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529714626","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077401564,0.0002868858,0.9950838,0.0002638611,0.0015656567,0.0008603716,0.00012076361,0.0003969485,0.0013443048],"genre_scores_gemma":[0.007722435,0.000017332557,0.9891807,0.0015357638,0.0010604542,0.00004493317,0.000042540636,0.00005898331,0.0003368463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996209,0.000030481415,0.0005537244,0.001726753,0.00059224095,0.0008877537],"domain_scores_gemma":[0.99582386,0.001898205,0.00036907545,0.0014381601,0.00026932903,0.00020138701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001169442,0.0005819949,0.0006287172,0.000589735,0.00035867107,0.0008438286,0.0035194787,0.00035808366,0.00002230162],"category_scores_gemma":[0.00014721564,0.00054295314,0.00021264188,0.00035636307,0.00058408873,0.00093246216,0.00064304535,0.00038456375,0.000015223607],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007239262,0.000027987231,0.00000772433,0.00004105941,0.000013434057,0.000030605326,0.00039363862,0.0026788025,0.00016894948,0.022722622,0.000055077522,0.9738529],"study_design_scores_gemma":[0.00064619025,0.00037737307,0.0000084449675,0.00022952491,0.000013616205,0.00011847474,0.0000018016974,0.89915603,0.0018117598,0.09088954,0.006053097,0.0006941184],"about_ca_topic_score_codex":0.000010935206,"about_ca_topic_score_gemma":0.000011172644,"teacher_disagreement_score":0.9731587,"about_ca_system_score_codex":0.00015764927,"about_ca_system_score_gemma":0.00041791203,"threshold_uncertainty_score":0.9997022},"labels":[],"label_agreement":null},{"id":"W1529995230","doi":"10.1007/978-3-540-88282-4_7","title":"Finite Automata, Palindromes, Powers, and Patterns","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Word (group theory); Automaton; Nondeterministic algorithm; Computer science; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Theoretical computer science; Biology","score_opus":0.012039608008618592,"score_gpt":0.2215446534782919,"score_spread":0.2095050454696733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529995230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059235585,0.0012044135,0.99383354,0.0006607306,0.0014139443,0.00026935182,0.00001988598,0.00036094294,0.0016448353],"genre_scores_gemma":[0.6415509,0.0018457778,0.34848836,0.006100561,0.00080115616,0.000017220476,0.000029196124,0.000120994184,0.0010457967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960551,0.00004039344,0.0005117495,0.0017231643,0.00092484936,0.00074474467],"domain_scores_gemma":[0.9970298,0.0006746334,0.0002686829,0.0016718978,0.00010625763,0.0002487457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065427844,0.0006212652,0.00060501293,0.0007827502,0.00031425976,0.0005565319,0.0030606624,0.00035653057,0.000032959342],"category_scores_gemma":[0.00006599045,0.0005602698,0.00012255079,0.00039508208,0.00075277616,0.000693213,0.0019676934,0.0007520836,0.0000593092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000432479,0.00003892296,0.00034644242,0.000064527325,0.000020360467,0.0007608408,0.0014834305,0.0025225857,0.000030477162,0.013763849,0.0001284199,0.9808358],"study_design_scores_gemma":[0.0007798661,0.0003721878,0.0024042164,0.0009970998,0.000013916526,0.0011908546,3.804028e-7,0.8678609,0.00049066835,0.11541258,0.008638986,0.001838331],"about_ca_topic_score_codex":0.000033735447,"about_ca_topic_score_gemma":0.000025195135,"teacher_disagreement_score":0.97899747,"about_ca_system_score_codex":0.00014154126,"about_ca_system_score_gemma":0.0003242238,"threshold_uncertainty_score":0.9996849},"labels":[],"label_agreement":null},{"id":"W1532642937","doi":"10.1016/j.tcs.2009.07.049","title":"On NFAs where all states are final, initial, or both","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Automaton; Nondeterministic finite automaton; Finite-state machine; Regular language; Computer science; Discrete mathematics; Theoretical computer science; Combinatorics; Mathematics; Programming language; Automata theory","score_opus":0.024796216736811667,"score_gpt":0.2909578726236236,"score_spread":0.26616165588681195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532642937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073281534,0.00006987732,0.9152896,0.0066957134,0.00060838007,0.00019899009,0.0000046591485,0.00060272915,0.0032485523],"genre_scores_gemma":[0.93659395,0.0000227073,0.05231048,0.010864838,0.00015132318,0.0000040648033,0.0000011689117,0.00000971442,0.000041752133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679923,0.00014606283,0.00032970903,0.00097341405,0.00089086907,0.00086069515],"domain_scores_gemma":[0.99763215,0.0005528256,0.000115783805,0.001200713,0.00011684036,0.00038168495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012252354,0.00030062185,0.00030516167,0.00021166363,0.00041549414,0.0009111338,0.0035552077,0.00007172767,0.00018591998],"category_scores_gemma":[0.000103845494,0.00020684524,0.00008423516,0.0010460089,0.0015396642,0.00085605175,0.0006061164,0.00028897883,0.00020539305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035264708,0.0001506566,0.0000046000737,0.000005201363,0.000003295105,0.00011742518,0.00035592867,0.00020173375,0.00012993475,0.9420714,0.0017568935,0.05516767],"study_design_scores_gemma":[0.00035951324,0.0012425308,0.00078639167,0.000122023484,0.0000045051875,0.000079469144,0.000016046492,0.3579614,0.0020168473,0.6362441,0.0007775985,0.0003895806],"about_ca_topic_score_codex":0.0000024675453,"about_ca_topic_score_gemma":0.0000010002318,"teacher_disagreement_score":0.8633124,"about_ca_system_score_codex":0.000066205874,"about_ca_system_score_gemma":0.00013474234,"threshold_uncertainty_score":0.87860835},"labels":[],"label_agreement":null},{"id":"W1533036729","doi":"10.1007/s00224-013-9515-7","title":"Quotient Complexity of Closed Languages","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo","funders":"","keywords":"Suffix; Concatenation (mathematics); Prefix; Closure (psychology); Regular language; Complement (music); Subsequence; Formal language; Abstract family of languages; Mathematics; Quotient; Computer science; Discrete mathematics; Transitive closure; Word (group theory); Combinatorics; Theoretical computer science; Algorithm; Automaton; Linguistics; Programming language","score_opus":0.024427312795081518,"score_gpt":0.2479190127007407,"score_spread":0.2234916999056592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533036729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7030852,0.0004334663,0.2908066,0.000047958514,0.00045125044,0.00025006902,0.0000029454877,0.00017434043,0.0047481707],"genre_scores_gemma":[0.9942707,0.0000010772957,0.005493982,0.000041105424,0.000070916045,0.0000028130974,0.0000017209227,0.000009510618,0.00010820086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832714,0.0004232484,0.00050987676,0.00022648192,0.00027883693,0.00023443539],"domain_scores_gemma":[0.9982559,0.0004547449,0.0004147523,0.0006716794,0.00014406606,0.000058864633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012326852,0.00013685756,0.00039146992,0.000105814914,0.000059994727,0.00005091294,0.0009703396,0.000047701582,0.000022950675],"category_scores_gemma":[0.000046615958,0.0001137163,0.00009377233,0.00021084947,0.00023104504,0.00015524638,0.0002733566,0.00007964016,0.00004332475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035520632,0.00006781546,0.00022396079,0.00017014075,0.00003275048,0.0000013773391,0.0023449166,0.00059474655,0.006275971,0.98096883,0.00027054056,0.009045415],"study_design_scores_gemma":[0.0014481233,0.00047712083,0.052628513,0.0013430656,0.000030994797,0.00008765712,0.005548912,0.64318794,0.02868062,0.2654893,0.00024467325,0.00083304226],"about_ca_topic_score_codex":0.00021554672,"about_ca_topic_score_gemma":3.999223e-7,"teacher_disagreement_score":0.7154795,"about_ca_system_score_codex":0.00001802623,"about_ca_system_score_gemma":0.00002483318,"threshold_uncertainty_score":0.4637216},"labels":[],"label_agreement":null},{"id":"W1533466804","doi":"10.37236/3605","title":"Square-Free Words with Square-Free Self-Shuffles","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Square-free integer; Square (algebra); Combinatorics; Discrete mathematics; Geometry","score_opus":0.0035218822975547205,"score_gpt":0.1908905607506606,"score_spread":0.1873686784531059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533466804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24094616,0.004886389,0.7409054,0.0076617934,0.0011603785,0.00024932492,0.0000012376414,0.00030300333,0.0038862932],"genre_scores_gemma":[0.9980378,0.00027789047,0.0009231878,0.00033498302,0.00022480178,0.0000039679535,3.2040225e-7,0.000030909683,0.00016615042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711376,0.0003540337,0.00049629033,0.00023988608,0.0009367328,0.000859267],"domain_scores_gemma":[0.99658644,0.00055370084,0.00060961815,0.0017992085,0.0002999444,0.00015109385],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002740408,0.00027875006,0.0004075431,0.0001724304,0.00026808103,0.00022938113,0.0054912907,0.00008720996,0.000008786745],"category_scores_gemma":[0.00020443322,0.00016805837,0.00017039443,0.00081280863,0.0000886766,0.0005775266,0.00046900386,0.0009210972,0.000013879753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038273996,0.00017649165,0.00022549559,0.000014670952,0.00010128357,0.000012027965,0.0006293722,0.000077552475,0.000048491427,0.99381703,0.0021025413,0.002756774],"study_design_scores_gemma":[0.0021461411,0.0020657438,0.00052534946,0.000068621615,0.00006639812,0.00058757054,0.00011121112,0.004425134,0.0008835867,0.9742966,0.01454289,0.000280719],"about_ca_topic_score_codex":0.000009198969,"about_ca_topic_score_gemma":0.000011267317,"teacher_disagreement_score":0.75709164,"about_ca_system_score_codex":0.00030063948,"about_ca_system_score_gemma":0.0005183102,"threshold_uncertainty_score":0.9998895},"labels":[],"label_agreement":null},{"id":"W1535419843","doi":"10.26686/ajl.v2i0.1768","title":"Limiting Cases for Spectrum Closure Results","year":2004,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Spectrum (functional analysis); Closure (psychology); Mathematics; Class (philosophy); Image (mathematics); Function (biology); Limiting; Set (abstract data type); Sentence; Order (exchange); Pure mathematics; Spectral line; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.038826823084315766,"score_gpt":0.27515505416402564,"score_spread":0.23632823107970988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535419843","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7036264,0.00051225437,0.21298012,0.0792723,0.0012322345,0.00032014214,0.000016917144,0.00011572655,0.0019239213],"genre_scores_gemma":[0.9794344,0.000016685595,0.01966842,0.00034200982,0.0004372533,0.0000011360827,4.446729e-7,0.0000066522957,0.0000930107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891156,0.000059732763,0.00041860619,0.00013234119,0.00019215902,0.0002855827],"domain_scores_gemma":[0.998813,0.00030221773,0.00042412995,0.00031600113,0.00006330251,0.000081363876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010671754,0.000114947914,0.00017968428,0.00007125881,0.00016177549,0.00013444122,0.0010655946,0.00004392232,0.0000044486887],"category_scores_gemma":[0.00022214082,0.000066793844,0.00017824223,0.00018676909,0.000065332555,0.00031966277,0.00006337009,0.00022107546,0.0000104428445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004248216,0.0003269646,0.00044297896,0.00005573392,0.00019988316,0.0022133472,0.0045868545,0.010680493,0.0036224832,0.9448714,0.00541281,0.027162192],"study_design_scores_gemma":[0.0038233267,0.0028009699,0.007836495,0.0003023618,0.00006869186,0.013952217,0.0011279571,0.0004723006,0.018728092,0.94774103,0.0027745285,0.00037200702],"about_ca_topic_score_codex":0.0000033407955,"about_ca_topic_score_gemma":0.0000026509813,"teacher_disagreement_score":0.275808,"about_ca_system_score_codex":0.000040942527,"about_ca_system_score_gemma":0.00008273326,"threshold_uncertainty_score":0.27237737},"labels":[],"label_agreement":null},{"id":"W1537925488","doi":"","title":"Factorizations of languages and commutativity conditions","year":2002,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Prime (order theory); Prime factor; Factorization; Commutative property; Product (mathematics); Mathematics; Section (typography); Computer science; Discrete mathematics; Algebra over a field; Pure mathematics; Combinatorics; Algorithm; Geometry","score_opus":0.011980022641201264,"score_gpt":0.25367416798842124,"score_spread":0.24169414534721997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537925488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9108017,0.0005949449,0.040324353,0.0032238727,0.00011313598,0.00017056061,0.00006398448,0.00025261848,0.044454835],"genre_scores_gemma":[0.99645835,0.00003694674,0.0031478044,0.00009614462,0.000009410456,0.0000031797977,0.00000336241,0.0000034120726,0.00024138838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995918,0.000039774408,0.0000889314,0.00010910456,0.000079851954,0.00009050824],"domain_scores_gemma":[0.9994159,0.00022263546,0.00003982131,0.0002588432,0.000021669772,0.00004115547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047926962,0.00005370245,0.000081378865,0.000036631856,0.00005463985,0.000034062545,0.00022152314,0.000024038194,0.00018112465],"category_scores_gemma":[0.000045029803,0.00004871352,0.000017457196,0.00012249869,0.00008996564,0.00016112266,0.00009928811,0.00004592888,0.000014824061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.595057e-7,0.00021649829,0.003200632,0.000019318495,0.000034375767,0.000007785729,0.004777535,0.0000054713696,0.01996719,0.9465969,0.0058712685,0.019302333],"study_design_scores_gemma":[0.0022410527,0.0005937828,0.5735973,0.00019275218,0.00010764835,0.00018610754,0.0013307375,0.18167773,0.052350942,0.15038264,0.035897005,0.0014422906],"about_ca_topic_score_codex":0.000021113221,"about_ca_topic_score_gemma":0.00000382495,"teacher_disagreement_score":0.7962143,"about_ca_system_score_codex":0.0000039492334,"about_ca_system_score_gemma":0.000003692068,"threshold_uncertainty_score":0.19864796},"labels":[],"label_agreement":null},{"id":"W1539025858","doi":"10.25596/jalc-2004-233","title":"Regular Expressions: New Results and Open Problems","year":2004,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sketch; Computer science; Regular expression; Theoretical computer science; Programming language; Algorithm","score_opus":0.0232650438718394,"score_gpt":0.23158112755538385,"score_spread":0.20831608368354446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539025858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23766945,0.0062662954,0.47437057,0.063727856,0.0029034372,0.005206567,0.00014059202,0.0036489475,0.20606631],"genre_scores_gemma":[0.76192373,0.00096536276,0.19759889,0.002523004,0.0004937344,0.000021060467,0.00006685561,0.0000916137,0.03631575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979772,0.000081535174,0.00028117094,0.00082918745,0.00035338392,0.00047753064],"domain_scores_gemma":[0.9981808,0.00007707997,0.00016876619,0.0011385526,0.00006700491,0.000367804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041814367,0.00026881363,0.0003143267,0.00017422174,0.0004184904,0.00048802627,0.002760198,0.00014724245,0.000027103042],"category_scores_gemma":[0.000054115055,0.00024846217,0.000075031225,0.00051184156,0.00010581186,0.0038771932,0.002794545,0.0002178258,0.00014036405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002747681,0.00047943005,0.000087159875,0.00011021095,0.00022132622,0.00066058454,0.022385487,0.0018467337,0.015673108,0.77628803,0.059519745,0.12245343],"study_design_scores_gemma":[0.024850622,0.00126206,0.004801169,0.0017956165,0.00019988687,0.00035985353,0.007183351,0.0047097383,0.010646768,0.3851541,0.55618274,0.0028540592],"about_ca_topic_score_codex":0.00084498397,"about_ca_topic_score_gemma":0.000044261742,"teacher_disagreement_score":0.52425426,"about_ca_system_score_codex":0.00015621218,"about_ca_system_score_gemma":0.00036537924,"threshold_uncertainty_score":0.9999968},"labels":[],"label_agreement":null},{"id":"W1541666628","doi":"10.1007/11496656_27","title":"Reducing the Size of NFAs by Using Equivalences and Preorders","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nondeterministic algorithm; Automaton; Nondeterministic finite automaton; Computer science; Regular expression; Matching (statistics); DFA minimization; Deterministic automaton; Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Automata theory; Programming language","score_opus":0.01572826700469847,"score_gpt":0.2468300156282682,"score_spread":0.23110174862356972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541666628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003594988,0.0032522536,0.9902163,0.00084013253,0.00064446696,0.00024444266,0.0000050007548,0.000067099565,0.0011353036],"genre_scores_gemma":[0.70352864,0.00025243685,0.2942648,0.0012851377,0.0003596546,0.0000032650769,8.7919534e-7,0.000030345358,0.0002748472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974455,0.00004556304,0.00042710933,0.00096387055,0.00067310955,0.0004448315],"domain_scores_gemma":[0.9973937,0.0011206156,0.0003405195,0.0009672115,0.00009456411,0.00008338137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011133222,0.00034736434,0.00038547814,0.00020795251,0.0002601249,0.00033717413,0.002665652,0.0001663613,0.000020198771],"category_scores_gemma":[0.00011078358,0.00024699655,0.000077508455,0.00036598218,0.0014078679,0.0005291244,0.0012513977,0.00043281162,0.0000019376528],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003445463,0.000017046399,0.000031293093,0.000048253205,0.000013862588,0.00000831775,0.0018145236,0.013657106,0.002796779,0.011804781,0.000036356923,0.9697682],"study_design_scores_gemma":[0.0002141748,0.0001378404,0.000062132814,0.0007904585,0.000017118167,0.000115125265,0.000001824255,0.8700284,0.0064753597,0.12054509,0.0009902836,0.000622232],"about_ca_topic_score_codex":0.000059527327,"about_ca_topic_score_gemma":0.000010483956,"teacher_disagreement_score":0.969146,"about_ca_system_score_codex":0.00008338414,"about_ca_system_score_gemma":0.00025266287,"threshold_uncertainty_score":0.9999982},"labels":[],"label_agreement":null},{"id":"W154460323","doi":"10.1007/978-3-642-31623-4_9","title":"Syntactic Complexities of Some Classes of Star-Free Languages","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abstract family of languages; Cardinality (data modeling); Computer science; Monotonic function; Regular language; Pumping lemma for regular languages; Cone (formal languages); Star (game theory); Discrete mathematics; Upper and lower bounds; Context-free language; Function (biology); Automaton; Mathematics; Theoretical computer science; Artificial intelligence; Algorithm; Second-generation programming language; Programming language; Fifth-generation programming language; Rule-based machine translation; Programming paradigm","score_opus":0.019513624987755076,"score_gpt":0.25123815036967634,"score_spread":0.23172452538192126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154460323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021228164,0.0050038616,0.988335,0.00036726595,0.0010505248,0.0002495841,0.000038929993,0.00013168175,0.0027002993],"genre_scores_gemma":[0.73614436,0.00011427605,0.2626385,0.0004963564,0.00041172453,0.000004013108,0.0000053188623,0.000034542303,0.00015087714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714375,0.00004837357,0.00061618385,0.0007211256,0.0009301623,0.0005404001],"domain_scores_gemma":[0.99615645,0.001029632,0.0005619117,0.001944305,0.00019228684,0.00011539176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080212345,0.00041272384,0.0007380121,0.000708769,0.00009104303,0.00011999917,0.004406155,0.00021314116,0.000051791973],"category_scores_gemma":[0.00013009657,0.00035702102,0.00015985242,0.00034820227,0.0012332619,0.0008960922,0.0019239533,0.0004265516,0.000010847352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010691906,0.00008715663,0.00011804027,0.00036471614,0.000041053096,0.00003308756,0.0019311733,0.0010410484,0.001849131,0.72069854,0.000053209013,0.27377218],"study_design_scores_gemma":[0.000419976,0.00033865808,0.0009212235,0.0011719487,0.00003088858,0.000080530815,0.00000466493,0.054926306,0.028081164,0.9125322,0.000615862,0.00087656104],"about_ca_topic_score_codex":0.000065371445,"about_ca_topic_score_gemma":0.00002995082,"teacher_disagreement_score":0.73402154,"about_ca_system_score_codex":0.00010262481,"about_ca_system_score_gemma":0.00030495378,"threshold_uncertainty_score":0.9998882},"labels":[],"label_agreement":null},{"id":"W1546124752","doi":"","title":"The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Catenation; Star (game theory); Combined operations; State (computer science); Automaton; Computer science; Regular language; Theoretical computer science; Algorithm; Mathematics","score_opus":0.03127157510158429,"score_gpt":0.2525004377000977,"score_spread":0.22122886259851343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546124752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.985636,0.00006154774,0.013395396,0.00022651452,0.000069529764,0.00023469415,0.000044849083,0.0000219997,0.00030949307],"genre_scores_gemma":[0.98187876,0.00009427071,0.017866658,0.00009622404,0.0000033459617,0.0000052110577,0.000012382982,0.0000028480301,0.00004029097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888235,0.000052127638,0.0005883736,0.00007171229,0.00027801568,0.00012744726],"domain_scores_gemma":[0.99909323,0.00014522918,0.00023824417,0.00035126583,0.00013412378,0.00003789667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044924885,0.00008170673,0.00018368888,0.0000637494,0.00014957755,0.00003180852,0.00039307322,0.000015802401,0.000012998478],"category_scores_gemma":[0.00003964096,0.00005807372,0.000032242457,0.00017881063,0.00044780655,0.0007096348,0.00019627904,0.000055255274,0.0000035546227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017283203,0.00043133687,0.0038173466,0.00056231534,0.00025311872,0.0000029570867,0.060311552,0.0009582615,0.012711004,0.90754855,0.0019876463,0.011243085],"study_design_scores_gemma":[0.0042462028,0.0011192292,0.047790926,0.00019849095,0.000030457804,0.00003200144,0.0031312204,0.8376162,0.05613612,0.04844951,0.0008591126,0.00039050076],"about_ca_topic_score_codex":0.00022393325,"about_ca_topic_score_gemma":0.000026674506,"teacher_disagreement_score":0.85909903,"about_ca_system_score_codex":0.000021917791,"about_ca_system_score_gemma":0.00006913815,"threshold_uncertainty_score":0.23681776},"labels":[],"label_agreement":null},{"id":"W1548490899","doi":"10.1007/11779148_15","title":"On Weakly Ambiguous Finite Transducers","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nondeterministic algorithm; Transducer; Hierarchy; Ambiguity; Expressive power; Finite set; Computer science; Nondeterministic finite automaton; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Automaton; Acoustics; Physics; Automata theory; Programming language; Mathematical analysis","score_opus":0.010220810517743562,"score_gpt":0.2162199880394688,"score_spread":0.20599917752172522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548490899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027688578,0.00028402853,0.97901785,0.00077720423,0.0021342016,0.00029148883,0.000010786325,0.00036784942,0.016839702],"genre_scores_gemma":[0.72978723,0.00006495322,0.2544924,0.010751925,0.0012734215,0.000023653372,0.000025681456,0.00015003812,0.003430731],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557596,0.000041763025,0.0005390795,0.0018413516,0.0011630089,0.00083883404],"domain_scores_gemma":[0.9969934,0.0006724465,0.00024152231,0.0017999655,0.00011362281,0.00017902223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007604828,0.0006810861,0.00058337214,0.00095523824,0.00027571165,0.0006348846,0.004193838,0.00037344507,0.000044829507],"category_scores_gemma":[0.000054399956,0.00060874113,0.00022460747,0.0006211362,0.00068073405,0.00047970368,0.0005648125,0.0009458489,0.00017520125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008696841,0.00005261749,0.0000030734245,0.00002905795,0.000010754989,0.00024933703,0.00038119883,0.10700237,0.00020542968,0.08716384,0.00023727636,0.8046563],"study_design_scores_gemma":[0.0003537593,0.00035317673,0.00012969568,0.0005002586,0.000009170765,0.000051546776,8.389347e-8,0.45509326,0.002000642,0.5375657,0.0028625163,0.0010802043],"about_ca_topic_score_codex":0.000064159445,"about_ca_topic_score_gemma":0.00003479619,"teacher_disagreement_score":0.8035761,"about_ca_system_score_codex":0.00028739576,"about_ca_system_score_gemma":0.00037113205,"threshold_uncertainty_score":0.9996364},"labels":[],"label_agreement":null},{"id":"W1549690229","doi":"10.1007/978-3-540-30500-2_2","title":"Enumerating Regular Expressions and Their Languages","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Enumeration; Programming language; Regular expression; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.009472930485466024,"score_gpt":0.2319570946696085,"score_spread":0.2224841641841425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549690229","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041197796,0.003306126,0.99109626,0.0007992777,0.00044026435,0.00017301274,0.000004827018,0.00021083445,0.0035574252],"genre_scores_gemma":[0.3719943,0.0002060569,0.62256765,0.0030746164,0.0011883419,0.000011657101,0.0000049821747,0.000055432556,0.000896996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975379,0.00003562816,0.00031914047,0.0011259917,0.0005081979,0.0004731184],"domain_scores_gemma":[0.9979817,0.0004764326,0.00017358286,0.0011251929,0.00009950457,0.00014353811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008126975,0.00041786671,0.00038553172,0.00039533715,0.00031170386,0.00055266975,0.0019726818,0.00021855143,0.000024944871],"category_scores_gemma":[0.000074086405,0.00031725678,0.000076667544,0.0002370063,0.00046931568,0.0005645548,0.0014998119,0.0005389449,0.00001399864],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5017746e-7,0.000009259083,0.00000618626,0.000013584863,0.0000052481755,0.00003232616,0.0015073546,0.001242136,0.0016637291,0.02996557,0.000023860266,0.9655299],"study_design_scores_gemma":[0.00036092225,0.00013890213,0.00011883051,0.0012583035,0.000007726976,0.00030608344,0.000003608192,0.6647392,0.014652966,0.30754253,0.009551939,0.0013189908],"about_ca_topic_score_codex":0.000009062704,"about_ca_topic_score_gemma":0.000020079564,"teacher_disagreement_score":0.9642109,"about_ca_system_score_codex":0.000100364094,"about_ca_system_score_gemma":0.00018315094,"threshold_uncertainty_score":0.99992794},"labels":[],"label_agreement":null},{"id":"W1554118774","doi":"10.1007/3-540-45061-0_76","title":"Locally Commutative Categories","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Variety (cybernetics); Commutative property; Monoid; Characterization (materials science); Mathematics; Pure mathematics; Algebra over a field; Physics","score_opus":0.012707246946327678,"score_gpt":0.23440598915890878,"score_spread":0.2216987422125811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554118774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029691339,0.0008232151,0.9840315,0.0010426347,0.0017512969,0.0002816947,0.000005047475,0.00024348297,0.01179142],"genre_scores_gemma":[0.15053973,0.00013636064,0.8324443,0.0143751865,0.0005418407,0.000024589552,0.000014205627,0.000109764886,0.0018139848],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634016,0.000069191454,0.00050633686,0.0014258772,0.0009173263,0.00074112444],"domain_scores_gemma":[0.99693537,0.0006475721,0.0002838628,0.001692177,0.000251934,0.00018907715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010297179,0.00060457573,0.0005938149,0.00062156306,0.00033397943,0.0006949388,0.004204224,0.00031125324,0.00004136628],"category_scores_gemma":[0.00008752286,0.0005326752,0.00013924761,0.00063858257,0.001300618,0.0007293398,0.0012953049,0.0008967426,0.0001088984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004206155,0.000033751792,0.000018348434,0.00003212319,0.000018409604,0.00020407383,0.0018758482,0.007504558,0.000063986074,0.39674655,0.00014704454,0.5933511],"study_design_scores_gemma":[0.0002443335,0.00017230472,0.000032291013,0.0002353419,0.0000069532853,0.0001437249,5.822885e-7,0.15476505,0.0017936828,0.83660907,0.005160937,0.0008357484],"about_ca_topic_score_codex":0.000022977041,"about_ca_topic_score_gemma":0.000041187872,"teacher_disagreement_score":0.59251535,"about_ca_system_score_codex":0.0002850641,"about_ca_system_score_gemma":0.0005297822,"threshold_uncertainty_score":0.99971247},"labels":[],"label_agreement":null},{"id":"W1554222672","doi":"10.37236/1052","title":"Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Mathematics; Combinatorics; Integer sequence; Integer (computer science); Pisano period; Binary number; Discrete mathematics; Binary tree; Fibonacci polynomials; Generating function; Arithmetic; Computer science","score_opus":0.017613448403264544,"score_gpt":0.2302005328627704,"score_spread":0.21258708445950586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554222672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81459373,0.08423422,0.09256503,0.006437563,0.000571633,0.00016863624,0.000002243435,0.000106824504,0.0013201265],"genre_scores_gemma":[0.99873203,0.0006468323,0.00015050029,0.00012069969,0.00007937579,0.000001073203,5.1373524e-7,0.000010794907,0.00025815069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982108,0.00024513016,0.0004258045,0.00015909052,0.00044584312,0.00051334227],"domain_scores_gemma":[0.9986416,0.00039676824,0.0004244218,0.0003454369,0.0001216852,0.00007006324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001655535,0.00019548951,0.0004299058,0.0001254184,0.00020311156,0.00017136015,0.0011739921,0.000051508945,0.00001013542],"category_scores_gemma":[0.000020088311,0.00011404344,0.00019327653,0.00042177443,0.00011526017,0.00052450254,0.00010299577,0.00047153133,0.000002906655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001463297,0.000100659796,0.0003009658,0.000004238156,0.00028977284,0.000031281663,0.000096519565,0.00019123078,0.0011631066,0.996044,0.001149848,0.000613743],"study_design_scores_gemma":[0.0005463913,0.00053714024,0.002580268,0.000014203895,0.00028459143,0.0009675261,0.000046487363,0.003865854,0.0018572526,0.98499256,0.0041323956,0.00017530611],"about_ca_topic_score_codex":0.00004602653,"about_ca_topic_score_gemma":0.00001268398,"teacher_disagreement_score":0.18413834,"about_ca_system_score_codex":0.00013443791,"about_ca_system_score_gemma":0.00026724304,"threshold_uncertainty_score":0.46505564},"labels":[],"label_agreement":null},{"id":"W1555454948","doi":"10.37236/1587","title":"Weakly Self-Avoiding Words and a Construction of Friedman","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Alphabet; Word (group theory); Combinatorics; Mathematics; Sequence (biology); Upper and lower bounds; Longest increasing subsequence; Longest common subsequence problem; Combinatorics on words; Discrete mathematics; Linguistics","score_opus":0.003872217624354327,"score_gpt":0.19836813087052352,"score_spread":0.1944959132461692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555454948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87132996,0.0035399576,0.123440355,0.0007636796,0.00037456822,0.000048605758,1.0405325e-7,0.00002950096,0.0004732812],"genre_scores_gemma":[0.99778247,0.0016430555,0.0004539819,0.00003814626,0.0000515061,4.7523673e-7,4.9628763e-8,0.0000061738115,0.000024118748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889696,0.00014391559,0.0003119082,0.00008835526,0.000270215,0.0002886482],"domain_scores_gemma":[0.9990033,0.00021111994,0.00040011562,0.00022469048,0.0001112417,0.000049561633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014400949,0.000093085546,0.00019338804,0.000103959486,0.00013125474,0.000051429466,0.00060815795,0.000039962677,0.0000027604535],"category_scores_gemma":[0.000043068645,0.0000646046,0.00006265653,0.00043967366,0.000057444122,0.00032174523,0.00008867723,0.00043464976,8.5610725e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012248281,0.000044420794,0.00044138785,0.000005500044,0.000045058554,0.0000051321413,0.000752808,0.0000039179486,0.0006800186,0.9934058,0.00003389096,0.0045697764],"study_design_scores_gemma":[0.0005072214,0.00041448348,0.0003948074,0.000032133372,0.000030853822,0.0015868688,0.0003688345,0.0020108137,0.003185431,0.9897403,0.0016379833,0.000090232694],"about_ca_topic_score_codex":0.0000031782993,"about_ca_topic_score_gemma":6.921049e-7,"teacher_disagreement_score":0.12645255,"about_ca_system_score_codex":0.000103796374,"about_ca_system_score_gemma":0.00019374058,"threshold_uncertainty_score":0.2634499},"labels":[],"label_agreement":null},{"id":"W15569406","doi":"10.1007/978-1-4614-6642-0_17","title":"Description of Generalized Continued Fractions by Finite Automata","year":2013,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Mathematics; Finite-state machine; Automaton; Set (abstract data type); Discrete mathematics; Fraction (chemistry); Finite set; Deterministic finite automaton; Combinatorics; Algorithm; Computer science; Theoretical computer science; Mathematical analysis","score_opus":0.02113937369145425,"score_gpt":0.23462824092515933,"score_spread":0.21348886723370508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15569406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069805223,0.00036406916,0.8706667,0.00008920786,0.00047817946,0.0008358091,0.00036533887,0.00034635147,0.1261563],"genre_scores_gemma":[0.0031055931,0.00060720294,0.87283254,0.00008917271,0.00008531174,0.00007213718,0.00006412802,0.00012659868,0.12301731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972513,0.000008752011,0.0011655624,0.0005554909,0.0006231996,0.00039571887],"domain_scores_gemma":[0.99737483,0.00034010914,0.0012106389,0.0005334646,0.00042814,0.000112825765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005394744,0.0004972245,0.00081961503,0.0003615282,0.000081982354,0.00031297334,0.001079465,0.0003493249,0.00022494822],"category_scores_gemma":[0.00029202038,0.00050602184,0.000107237516,0.00010625351,0.00015238662,0.0004894342,0.00039263687,0.0005121739,0.00017672892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026815594,0.00010639537,0.000011530541,0.00064402825,0.000056778674,0.0000066836,0.0009356113,0.0000039263446,0.0013209347,0.9725154,0.020322483,0.0040735444],"study_design_scores_gemma":[0.0005395753,0.00007407811,0.000043737757,0.00087912893,0.0000761629,0.000013156021,0.00004486083,0.09808056,0.0005342416,0.87502515,0.024027277,0.0006620406],"about_ca_topic_score_codex":0.00002702712,"about_ca_topic_score_gemma":0.0000040747796,"teacher_disagreement_score":0.098076634,"about_ca_system_score_codex":0.0001277783,"about_ca_system_score_gemma":0.00007341608,"threshold_uncertainty_score":0.9997391},"labels":[],"label_agreement":null},{"id":"W1557475033","doi":"10.1007/3-540-45841-7_37","title":"Nesting Until and Since in Linear Temporal Logic","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decidability; Linear temporal logic; Nesting (process); Temporal logic; Interval temporal logic; Characterization (materials science); Hierarchy; Property (philosophy); Computer science; Computation tree logic; Class (philosophy); Block (permutation group theory); Algebraic number; Semigroup; Mathematics; Theoretical computer science; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics; Artificial intelligence; Combinatorics","score_opus":0.02280034160031561,"score_gpt":0.23929726892646178,"score_spread":0.21649692732614617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557475033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008386725,0.0010053457,0.99392164,0.00096535037,0.0009659006,0.00023536562,0.000002032224,0.00018015597,0.0018855332],"genre_scores_gemma":[0.43991318,0.00009929099,0.5564643,0.002572717,0.00044350562,0.000005703209,0.000003019832,0.000040032977,0.00045826266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967247,0.00004234083,0.0005029145,0.0014715822,0.00059873,0.0006597298],"domain_scores_gemma":[0.99804085,0.00053675426,0.00023484296,0.00095729064,0.000084112085,0.00014611683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00099612,0.00047401083,0.00050776376,0.00072700315,0.0001759985,0.00042738553,0.0022495484,0.00028591938,0.0000149478865],"category_scores_gemma":[0.00011656316,0.00042371388,0.00006626717,0.0006738818,0.0006686984,0.00063464,0.0014660351,0.0007908833,0.000030396805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047651747,0.00005362615,0.0013364136,0.00008734975,0.0000057543853,0.0006869827,0.0012152849,0.014329795,0.00012073823,0.097767375,0.000017876722,0.884374],"study_design_scores_gemma":[0.00022215124,0.000095233445,0.0004400198,0.00048115212,0.0000023939492,0.00014630875,1.9029208e-7,0.7992298,0.00012376516,0.198094,0.0006275414,0.0005374399],"about_ca_topic_score_codex":0.00005048467,"about_ca_topic_score_gemma":0.000056667464,"teacher_disagreement_score":0.8838366,"about_ca_system_score_codex":0.00015052065,"about_ca_system_score_gemma":0.00016721283,"threshold_uncertainty_score":0.9998215},"labels":[],"label_agreement":null},{"id":"W1558734229","doi":"10.1007/3-540-44612-5_37","title":"Alternating and Empty Alternating Auxiliary Stack Automata","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Stack (abstract data type); PSPACE; Bounded function; Hierarchy; Automaton; Polynomial hierarchy; Constant (computer programming); Combinatorics; Mathematics; Cellular automaton; Discrete mathematics; Time complexity; Computer science; Computational complexity theory; Theoretical computer science; Algorithm; Programming language","score_opus":0.013270922330737804,"score_gpt":0.24352863857550208,"score_spread":0.23025771624476427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558734229","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005404319,0.00075487274,0.9814347,0.0005445947,0.0013380283,0.0003172186,0.00001235124,0.0004920507,0.009701883],"genre_scores_gemma":[0.47801697,0.00036777847,0.51665556,0.0031476817,0.0011187819,0.000011249187,0.000009802951,0.00009985233,0.0005723314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953059,0.000054692347,0.00068091945,0.0019950576,0.0011108423,0.0008526068],"domain_scores_gemma":[0.9969992,0.0006415005,0.00036889804,0.0016279434,0.0001178876,0.00024456385],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001258733,0.00066588284,0.0006086125,0.0006894658,0.0003993078,0.0011556257,0.0039087757,0.00027372997,0.00005955746],"category_scores_gemma":[0.00008749328,0.000618858,0.00011725635,0.00037749292,0.00064670615,0.0011079784,0.002325601,0.00091348705,0.000063808286],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034358782,0.000019426838,0.00008026748,0.00003444255,0.000013083942,0.00017648589,0.0006588456,0.0055858865,0.00012870398,0.027753003,0.000011378944,0.96553504],"study_design_scores_gemma":[0.00028871556,0.00009513,0.00025646802,0.00053057674,0.0000061994165,0.0001920717,2.542591e-7,0.7097574,0.0006477731,0.28680038,0.0007529431,0.00067210826],"about_ca_topic_score_codex":0.000094628056,"about_ca_topic_score_gemma":0.000028270602,"teacher_disagreement_score":0.96486294,"about_ca_system_score_codex":0.00019929868,"about_ca_system_score_gemma":0.00034762113,"threshold_uncertainty_score":0.99988127},"labels":[],"label_agreement":null},{"id":"W1571429055","doi":"10.1007/978-3-540-73208-2_22","title":"State Complexity of Union and Intersection of Finite Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Intersection (aeronautics); Alphabet; Finite-state machine; Regular language; Upper and lower bounds; Deterministic finite automaton; Automaton; State (computer science); Mathematics; Nondeterministic finite automaton; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automata theory","score_opus":0.02657055417739969,"score_gpt":0.26644678083795076,"score_spread":0.23987622666055108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571429055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044284146,0.0003525436,0.9929156,0.00007838225,0.00044458517,0.00013832185,0.000009659735,0.000053191412,0.0015793326],"genre_scores_gemma":[0.84084105,0.00003867477,0.15878537,0.00018501955,0.000064209264,6.706323e-7,0.0000032498504,0.00001232484,0.00006943971],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982393,0.000036258043,0.00042456956,0.0005925181,0.00044892507,0.00025846603],"domain_scores_gemma":[0.9983473,0.00044766956,0.0003591003,0.00062943384,0.00015057405,0.00006592368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011144347,0.00023973791,0.00039319985,0.00068235036,0.000058016343,0.000067169465,0.0010663413,0.00012789886,0.000008708434],"category_scores_gemma":[0.000050042087,0.00021312051,0.00006416766,0.0003542627,0.0012480469,0.00029019386,0.0007807875,0.00030738654,0.0000017453451],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010001914,0.000026573818,0.00012159094,0.00011654537,0.000011775704,0.000021771577,0.0018572876,0.0031272522,0.00116909,0.06968737,0.000002902883,0.92384785],"study_design_scores_gemma":[0.00038562255,0.0004400896,0.0022746588,0.00095765025,0.000009400204,0.000062552965,0.000002389785,0.41359887,0.02654385,0.55501556,0.00016911687,0.000540246],"about_ca_topic_score_codex":0.00009627357,"about_ca_topic_score_gemma":0.00012020851,"teacher_disagreement_score":0.9233076,"about_ca_system_score_codex":0.00006729241,"about_ca_system_score_gemma":0.00010165017,"threshold_uncertainty_score":0.86908025},"labels":[],"label_agreement":null},{"id":"W1571887931","doi":"10.1007/978-3-642-30870-3_12","title":"An Undecidable Nested Recurrence Relation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Undecidable problem; Mathematics; Combinatorics; Relation (database); Recurrence relation; Turing; Left and right; Discrete mathematics; Computer science; Decidability","score_opus":0.01961635530253146,"score_gpt":0.2509982774693665,"score_spread":0.231381922166835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571887931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030309832,0.0008938128,0.9926103,0.00024685377,0.0022219438,0.00031213995,0.000003480186,0.0003297773,0.0030785971],"genre_scores_gemma":[0.51103866,0.00009077468,0.4861665,0.001286741,0.0009612295,0.000013601375,0.000020661626,0.000057126053,0.00036471884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963487,0.00006804279,0.00049282674,0.0014084738,0.00091598526,0.0007659905],"domain_scores_gemma":[0.99675596,0.00042771167,0.00032602073,0.0020263828,0.00018690119,0.00027704134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014145686,0.0004904574,0.00042952594,0.0006836477,0.00030324655,0.00065442483,0.0038193215,0.00038408453,0.000056127978],"category_scores_gemma":[0.00006506565,0.0004501263,0.000094831856,0.0007398423,0.00047684484,0.0022316582,0.00078531634,0.0007588531,0.00014668457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032526705,0.000049726023,0.00012744927,0.000017300215,0.0000044527856,0.000023222397,0.0006440065,0.006930765,0.0002622589,0.12177881,0.00001616288,0.8701426],"study_design_scores_gemma":[0.00019391025,0.00021065708,0.0010171528,0.00035005732,0.000008651456,0.00009007303,2.0006324e-7,0.57952726,0.001008418,0.41471702,0.0020460016,0.0008306065],"about_ca_topic_score_codex":0.000020448288,"about_ca_topic_score_gemma":0.000027122973,"teacher_disagreement_score":0.869312,"about_ca_system_score_codex":0.0002916533,"about_ca_system_score_gemma":0.00039702913,"threshold_uncertainty_score":0.999795},"labels":[],"label_agreement":null},{"id":"W1571909284","doi":"10.1007/3-540-45465-9_20","title":"On the Complexity of Resolution with Bounded Conjunctions","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Resolution (logic); Hierarchy; Proof complexity; Bounded function; Space (punctuation); Mathematics; Upper and lower bounds; Computer science; Discrete mathematics; Algorithm; Combinatorics; Mathematical proof; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.03747163055043265,"score_gpt":0.22937757133314626,"score_spread":0.1919059407827136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571909284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021340139,0.00011682648,0.9862298,0.002089733,0.00058300834,0.00030860314,0.0000064294436,0.0001121513,0.010340081],"genre_scores_gemma":[0.7792568,0.000029856545,0.21637458,0.0034915921,0.00025888195,0.000014826763,0.000005174528,0.000039155602,0.00052911084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750876,0.000045928686,0.00034427198,0.0008477423,0.00086371874,0.00038955794],"domain_scores_gemma":[0.99706656,0.0008273049,0.00030341317,0.0015484256,0.00017975195,0.00007453417],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006852089,0.00034559006,0.00036725958,0.0003822471,0.00036760463,0.0002465933,0.002423011,0.00014822619,0.000071553],"category_scores_gemma":[0.0000697052,0.00021614338,0.000093479,0.0005550127,0.0029469978,0.0002631985,0.0005189822,0.0005981519,0.00003130558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008498291,0.000035141373,0.000005645265,0.000011567755,0.000011736967,0.0000125596625,0.0002941179,0.0047562467,0.000039477087,0.96233094,0.00007891728,0.03241518],"study_design_scores_gemma":[0.00015699233,0.00027785203,0.00011918315,0.00028357765,0.000006205561,0.000040433126,1.8423665e-7,0.33077377,0.00059823826,0.66698366,0.0005023401,0.00025758753],"about_ca_topic_score_codex":0.00002586589,"about_ca_topic_score_gemma":0.000046625955,"teacher_disagreement_score":0.77904344,"about_ca_system_score_codex":0.00015841793,"about_ca_system_score_gemma":0.00018681947,"threshold_uncertainty_score":0.9997664},"labels":[],"label_agreement":null},{"id":"W1572529124","doi":"10.3233/fi-2011-533","title":"Transition Complexity of Incomplete DFAs","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Transition (genetics); Computer science; Theoretical computer science","score_opus":0.08387304573960493,"score_gpt":0.23571382373511496,"score_spread":0.15184077799551005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572529124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2269834,0.000019412239,0.7168291,0.0002910085,0.0002630449,0.00025682434,0.000027229558,0.0002535706,0.05507641],"genre_scores_gemma":[0.9279596,0.0000028485342,0.07128171,0.000708993,0.000011764966,0.000007354517,0.000009769099,0.000003906473,0.0000140561115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990312,0.000031870957,0.00041667165,0.000101833706,0.00021825562,0.0002001747],"domain_scores_gemma":[0.99924815,0.000031374504,0.00014953584,0.000461547,0.00003788898,0.00007152784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026828,0.00010714135,0.00017575751,0.00009520011,0.000072981675,0.00004121562,0.0006648705,0.000033621807,0.00035603187],"category_scores_gemma":[0.000007189779,0.00009434686,0.00007067362,0.00019762556,0.00017323105,0.0010550515,0.00015448047,0.000072494084,0.00018431996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017181728,0.00013684909,0.00016242954,0.00011584878,0.00003498853,0.000002572379,0.02143325,0.0000043369464,0.00073307095,0.9614336,0.0006122714,0.015313588],"study_design_scores_gemma":[0.0031187248,0.0012405749,0.04878751,0.00033264857,0.000056162855,0.00014830731,0.0041981814,0.32690054,0.059604667,0.5462902,0.008063998,0.0012584915],"about_ca_topic_score_codex":0.000048326427,"about_ca_topic_score_gemma":0.000002721139,"teacher_disagreement_score":0.7009762,"about_ca_system_score_codex":0.000023699467,"about_ca_system_score_gemma":0.000022593058,"threshold_uncertainty_score":0.38982993},"labels":[],"label_agreement":null},{"id":"W1573072008","doi":"10.1007/978-3-540-68746-7_18","title":"Modelling Concurrency with Quotient Monoids","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quotient; Concurrency; Computer science; Algebra over a field; Programming language; Mathematics; Combinatorics; Pure mathematics","score_opus":0.018538662174425805,"score_gpt":0.2175353934230081,"score_spread":0.1989967312485823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573072008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034146247,0.0012237399,0.992538,0.00023328605,0.001194031,0.0003177642,0.00000443224,0.00028921987,0.003858076],"genre_scores_gemma":[0.31331065,0.00033602398,0.6839845,0.0012599928,0.0005289709,0.000015016585,0.0000074942955,0.000069818925,0.00048748113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582446,0.000028757715,0.00049393973,0.0017340143,0.001140798,0.0007780362],"domain_scores_gemma":[0.9973561,0.00029435765,0.0002894942,0.001619615,0.00022065327,0.00021977109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047800152,0.00063463947,0.00058192987,0.00067719026,0.0003343463,0.00040041664,0.00355299,0.00026350035,0.000015949478],"category_scores_gemma":[0.0000140363445,0.00050736143,0.00012413197,0.0005817339,0.00089198805,0.0007280919,0.0010001743,0.00085122214,0.000054399705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006430957,0.000036340265,0.000021749282,0.000026383554,0.000012821341,0.0002321219,0.0014326435,0.581077,0.000016790465,0.03361909,0.000045001867,0.38347366],"study_design_scores_gemma":[0.00025069024,0.00023329194,0.0000070546093,0.00038877066,0.000005552443,0.00020413997,1.4717718e-7,0.943732,0.0004331684,0.052350823,0.0016852205,0.00070912135],"about_ca_topic_score_codex":0.000032509583,"about_ca_topic_score_gemma":0.000009648926,"teacher_disagreement_score":0.38276455,"about_ca_system_score_codex":0.00023653166,"about_ca_system_score_gemma":0.00063150574,"threshold_uncertainty_score":0.9997378},"labels":[],"label_agreement":null},{"id":"W1573169217","doi":"10.1007/978-3-540-30500-2_11","title":"Concatenation State Machines and Simple Functions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Concatenation (mathematics); Computer science; Simple (philosophy); Class (philosophy); State (computer science); Domain (mathematical analysis); Theoretical computer science; Algorithm; Finite-state machine; Arithmetic; Artificial intelligence; Mathematics","score_opus":0.010849468625131165,"score_gpt":0.23140519608087287,"score_spread":0.2205557274557417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573169217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008105354,0.0006104828,0.99472165,0.0008869398,0.0007968043,0.00020389807,0.000010043756,0.00021331394,0.001746308],"genre_scores_gemma":[0.69165605,0.00027888353,0.29775053,0.0057371394,0.001246762,0.000020967735,0.000037427093,0.00008349468,0.0031887393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770325,0.000024367651,0.00033827493,0.0010261919,0.00049545604,0.00041245396],"domain_scores_gemma":[0.99852765,0.00030944665,0.0001533289,0.00074734,0.00013147337,0.00013074264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057121704,0.00035352216,0.0003128794,0.0005347198,0.00026936762,0.0005437997,0.0012815363,0.00014469701,0.000025329877],"category_scores_gemma":[0.000040995543,0.00030522607,0.00006032903,0.00032310767,0.00047569507,0.0007300508,0.0008444404,0.00041688894,0.000042613512],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018755877,0.000010739961,0.000048998943,0.0000121129915,0.000006084046,0.000017024006,0.00031211387,0.009475858,0.00014442368,0.017180322,0.000039462877,0.97275096],"study_design_scores_gemma":[0.00019049786,0.00007596346,0.00046499545,0.00007183725,0.000005077193,0.00007328688,1.0723694e-7,0.73439115,0.00029609722,0.26031947,0.0036921466,0.0004193794],"about_ca_topic_score_codex":0.000027140783,"about_ca_topic_score_gemma":0.0001895222,"teacher_disagreement_score":0.9723316,"about_ca_system_score_codex":0.00012804399,"about_ca_system_score_gemma":0.00018591463,"threshold_uncertainty_score":0.99994},"labels":[],"label_agreement":null},{"id":"W1576164625","doi":"10.1007/3-540-44693-1_8","title":"Star-Free Open Languages and Aperiodic Loops","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec à Chicoutimi; Université de Sherbrooke","funders":"","keywords":"Aperiodic graph; Mathematics; Wreath product; Closure (psychology); Class (philosophy); Context (archaeology); Star (game theory); Star product; Discrete mathematics; Pure mathematics; Product (mathematics); Computer science; Combinatorics; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.01792938583660957,"score_gpt":0.2759212597018551,"score_spread":0.2579918738652455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576164625","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004769352,0.0019075908,0.98596466,0.0008451773,0.00076509523,0.00041544755,0.000009942476,0.0001831171,0.00943206],"genre_scores_gemma":[0.086578615,0.00017503243,0.902244,0.008602689,0.00072594895,0.000012824783,0.000009910959,0.00007790065,0.0015731372],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966457,0.000023999779,0.00041077958,0.001515596,0.00073570205,0.0006682478],"domain_scores_gemma":[0.99687284,0.0005009984,0.00021042707,0.002090483,0.00010869535,0.00021656729],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015269719,0.00048789743,0.0005270961,0.000604213,0.0002895044,0.001640389,0.00802571,0.00027896962,0.000047706835],"category_scores_gemma":[0.00010721775,0.0004223097,0.00006973766,0.00045004577,0.00087369676,0.00091339374,0.0072245835,0.000640332,0.000034206816],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006205548,0.000019707735,0.000044337674,0.000033512155,0.000010208641,0.0002680058,0.00089180854,0.00019221523,0.00013694781,0.10107566,0.000076211814,0.89724517],"study_design_scores_gemma":[0.0011618409,0.00043607535,0.0009501685,0.0009404772,0.00001856941,0.00047901378,0.0000025284382,0.18257064,0.0023107617,0.7976554,0.011494404,0.00198011],"about_ca_topic_score_codex":0.00008406265,"about_ca_topic_score_gemma":0.00017588894,"teacher_disagreement_score":0.8952651,"about_ca_system_score_codex":0.00013249979,"about_ca_system_score_gemma":0.00031474658,"threshold_uncertainty_score":0.99982285},"labels":[],"label_agreement":null},{"id":"W1582270156","doi":"10.1007/3-540-45007-6_20","title":"On Enumeration of Müller Automata","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Enumeration; Automaton; Combinatorics; Discrete mathematics; Set (abstract data type); Function (biology); Mathematics; Computer science; Theoretical computer science","score_opus":0.012557795738976621,"score_gpt":0.2317412304424569,"score_spread":0.21918343470348028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582270156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018117954,0.00018636353,0.9887275,0.0005008197,0.0015646275,0.00023636113,0.0000046829664,0.00013826722,0.008460188],"genre_scores_gemma":[0.399065,0.00008757808,0.5910888,0.008001523,0.00042651748,0.000015062198,0.000013630266,0.00008562617,0.0012163117],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699926,0.000045276563,0.00049432827,0.0011120795,0.000924926,0.00042411813],"domain_scores_gemma":[0.9973163,0.00048453506,0.00032356154,0.0016260804,0.00014860382,0.00010092361],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087666675,0.00040650342,0.00046115476,0.0006895697,0.00013676216,0.00023474805,0.0024727806,0.00025868017,0.000045712437],"category_scores_gemma":[0.000096555064,0.0003565011,0.00012110021,0.0004569862,0.00042213287,0.00043701785,0.00053170905,0.00047199617,0.00005617671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050885074,0.00005353372,0.0000058966025,0.000034162917,0.000010349616,0.000034571553,0.00040065538,0.012982782,0.00034959288,0.4180692,0.00017454562,0.5678796],"study_design_scores_gemma":[0.00030843524,0.00028602264,0.0000526183,0.00042254565,0.0000055362093,0.000041763175,7.404116e-8,0.39745724,0.0068305666,0.5924261,0.0016203488,0.0005487323],"about_ca_topic_score_codex":0.000006851527,"about_ca_topic_score_gemma":0.000006232785,"teacher_disagreement_score":0.5673309,"about_ca_system_score_codex":0.00014509531,"about_ca_system_score_gemma":0.0002542358,"threshold_uncertainty_score":0.9998887},"labels":[],"label_agreement":null},{"id":"W1583687157","doi":"10.1007/3-540-45452-7_23","title":"Constructing NFAs by Optimal Use of Positions in Regular Expressions","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Regular expression; Nondeterministic finite automaton; Computer science; Automaton; Quotient; Nondeterministic algorithm; Expression (computer science); Finite-state machine; Algorithm; Discrete mathematics; Combinatorics; Theoretical computer science; Mathematics; Automata theory; Programming language","score_opus":0.01848285626588725,"score_gpt":0.22802256862829434,"score_spread":0.2095397123624071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583687157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018099544,0.00039749497,0.9953608,0.00038600035,0.0005753466,0.00024313189,0.00003271319,0.00010251545,0.0010920537],"genre_scores_gemma":[0.21281387,0.00005716212,0.7860395,0.0005669252,0.00012359578,0.000008804946,0.000013000147,0.000035047993,0.00034211777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969962,0.0000575609,0.0006279307,0.0011081601,0.0006680497,0.0005420878],"domain_scores_gemma":[0.99737245,0.0007809698,0.00034099125,0.0012446551,0.00012890872,0.00013205022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004657366,0.0003945885,0.0005226464,0.0007761894,0.00016358233,0.0003341988,0.0022078224,0.0002832005,0.000052247004],"category_scores_gemma":[0.000092715476,0.0003730259,0.00012016182,0.000636405,0.000905444,0.0009347904,0.0011612029,0.0006648142,0.000008866363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009711776,0.000193917,0.00036428773,0.0000836914,0.000028050257,0.00028089012,0.0023192933,0.04653808,0.008233838,0.20785291,0.00043375365,0.7336616],"study_design_scores_gemma":[0.00046458477,0.00016380032,0.00008698125,0.001908831,0.000011149309,0.0002453773,0.000001919235,0.9080464,0.01448948,0.07247839,0.0011095068,0.0009935559],"about_ca_topic_score_codex":0.000038135047,"about_ca_topic_score_gemma":0.000011936627,"teacher_disagreement_score":0.8615083,"about_ca_system_score_codex":0.00018662034,"about_ca_system_score_gemma":0.0001613167,"threshold_uncertainty_score":0.99987215},"labels":[],"label_agreement":null},{"id":"W1592957478","doi":"10.1016/j.tcs.2009.02.006","title":"Periodicity, repetitions, and orbits of an automatic sequence","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Decidability; Sequence (biology); Mathematics; Lexicographical order; Simple (philosophy); Quotient; Closure (psychology); Combinatorics; Discrete mathematics","score_opus":0.010897308510883006,"score_gpt":0.2616924037423216,"score_spread":0.2507950952314386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592957478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5447168,0.000034778306,0.45308575,0.00079302833,0.000112318005,0.00009210124,0.0000015544645,0.00022152699,0.0009421636],"genre_scores_gemma":[0.7992152,0.000005021388,0.2000561,0.00068459904,0.00003238347,0.0000014140148,4.968316e-7,0.000002881683,0.000001928014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980543,0.00011409138,0.00029745733,0.0006061535,0.0005436991,0.00038425],"domain_scores_gemma":[0.9984839,0.0001371258,0.00008822846,0.00089545303,0.00012884442,0.00026647717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001408421,0.00015337752,0.00022551404,0.00017570012,0.00030882104,0.00034154594,0.0018340951,0.00004264034,0.000026194697],"category_scores_gemma":[0.00008138558,0.0001251654,0.000036321417,0.0008273093,0.0026053623,0.001164846,0.00046473293,0.00012412516,0.000010727647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014108455,0.00005512064,0.000014626032,0.000005507811,9.0272704e-7,0.000011085396,0.00037822325,0.0000081046555,0.0042655207,0.8477492,0.0000040123896,0.14750633],"study_design_scores_gemma":[0.00011213693,0.0004118939,0.0043580416,0.000048068203,0.0000027913063,0.00015372733,0.00000792835,0.5983232,0.0053606876,0.3910698,0.000007994084,0.00014373829],"about_ca_topic_score_codex":0.0000032768135,"about_ca_topic_score_gemma":2.2998587e-7,"teacher_disagreement_score":0.5983151,"about_ca_system_score_codex":0.000024790184,"about_ca_system_score_gemma":0.000104716564,"threshold_uncertainty_score":0.9599566},"labels":[],"label_agreement":null},{"id":"W1593046698","doi":"10.1007/978-3-642-18098-9_11","title":"State Complexity of Catenation Combined with Union and Intersection","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Intersection (aeronautics); State (computer science); Computer science; Combined operations; Composition (language); Algorithm; Engineering; Law; Political science","score_opus":0.021888749043671447,"score_gpt":0.2190697652432465,"score_spread":0.19718101619957507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593046698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004419302,0.00007759317,0.99335396,0.0001759205,0.00046581437,0.00023818576,0.0000038924545,0.00009395308,0.0011713897],"genre_scores_gemma":[0.90890145,0.000023209837,0.09076719,0.00016926556,0.000035786314,0.00000266836,0.000004682213,0.000015442069,0.000080292346],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981916,0.000042529387,0.00032059566,0.0007508436,0.0004274495,0.00026698908],"domain_scores_gemma":[0.99862653,0.00012929038,0.00032350118,0.00063424936,0.00020631355,0.00008014227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068062503,0.00028916355,0.00035403948,0.00054114824,0.00010880967,0.00013355291,0.0010195791,0.000112729285,0.000007956178],"category_scores_gemma":[0.000014888814,0.00022871797,0.000037834292,0.0003265493,0.0011846136,0.0005252248,0.0005813487,0.00031550383,0.0000031379402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056883022,0.000058235823,0.0002056125,0.00010060808,0.000023734303,0.000028591545,0.0032525903,0.0018374965,0.00060855545,0.21295771,0.0000055060727,0.7808645],"study_design_scores_gemma":[0.00047050987,0.00088734826,0.0024263812,0.0004692465,0.000008403782,0.000077646895,4.9372426e-7,0.23105592,0.0062056966,0.7578874,0.00005848312,0.00045245292],"about_ca_topic_score_codex":0.00012003501,"about_ca_topic_score_gemma":0.0002030172,"teacher_disagreement_score":0.9044822,"about_ca_system_score_codex":0.00010550512,"about_ca_system_score_gemma":0.00014387428,"threshold_uncertainty_score":0.9326848},"labels":[],"label_agreement":null},{"id":"W1593192935","doi":"10.37236/1763","title":"There Exist Binary Circular $5/2^+$ Power Free Words of Every Length","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Binary number; Power (physics); Discrete mathematics; Arithmetic","score_opus":0.005737579744329706,"score_gpt":0.2091109374382763,"score_spread":0.2033733576939466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593192935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8440346,0.023214966,0.12594739,0.0033227028,0.0011596022,0.00014424177,0.0000012583627,0.00006132038,0.002113907],"genre_scores_gemma":[0.99888694,0.0006566,0.00014471647,0.0001423957,0.000059055175,0.0000012082783,2.1932836e-7,0.000018840006,0.00009000946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795717,0.00015725764,0.0005129338,0.00015845677,0.00066753745,0.00054664095],"domain_scores_gemma":[0.998009,0.00017730233,0.000573698,0.0009443949,0.00021406061,0.00008152783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016430607,0.0001872896,0.00034112766,0.00014208602,0.00013045114,0.00005906828,0.0029767572,0.000080883256,0.000010741322],"category_scores_gemma":[0.00009230686,0.00012627368,0.00024197665,0.0006770786,0.00010784972,0.00045595848,0.00027762214,0.0007150414,0.0000070882134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022769615,0.00024013159,0.000055793967,0.0000108244985,0.0001062821,0.000041688712,0.0006367843,0.00024564873,0.0013051323,0.9964859,0.0003118057,0.0005372298],"study_design_scores_gemma":[0.0012569526,0.0008933551,0.0006229136,0.0000706694,0.00003015831,0.0003655373,0.00017909965,0.00010832126,0.0040606977,0.9909824,0.0012734822,0.00015640903],"about_ca_topic_score_codex":0.000010832783,"about_ca_topic_score_gemma":0.0000010792882,"teacher_disagreement_score":0.15485235,"about_ca_system_score_codex":0.000337224,"about_ca_system_score_gemma":0.00076753256,"threshold_uncertainty_score":0.5531605},"labels":[],"label_agreement":null},{"id":"W1596039687","doi":"10.1007/3-540-36390-4_2","title":"Cascade Decompositions are Bit-Vector Algorithms","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Automaton; Computer science; Algorithm; Bit array; Cascade; Computation; Bounded function; Theoretical computer science; Mathematics; Type (biology)","score_opus":0.01628224680208691,"score_gpt":0.23745818173092115,"score_spread":0.22117593492883425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596039687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007276218,0.0009868785,0.990497,0.0015239152,0.0023630136,0.0003261452,0.0000223378,0.0004350748,0.003772868],"genre_scores_gemma":[0.10460886,0.00021323346,0.885768,0.0054947985,0.0018498196,0.000031778432,0.000016101869,0.000119353215,0.0018980532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955918,0.000048715745,0.0005841841,0.0018283416,0.0010540806,0.0008928319],"domain_scores_gemma":[0.99671805,0.000537427,0.00038290487,0.0018712506,0.00019677976,0.0002935873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058422633,0.0006792181,0.00065240596,0.00096964854,0.0004660698,0.00083214813,0.0043794927,0.00040933889,0.00012276655],"category_scores_gemma":[0.000050780334,0.00062137726,0.0002346298,0.0008140183,0.0006932332,0.0007804965,0.0014747748,0.0010068679,0.00026480437],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034723744,0.00012256486,0.000038294882,0.000059858598,0.00003846624,0.0007775685,0.0010808598,0.010559851,0.00036289464,0.07834559,0.00046164898,0.90814894],"study_design_scores_gemma":[0.00032826862,0.00015433061,0.00034292685,0.00067648833,0.000015404104,0.0004952763,2.7886438e-7,0.81296957,0.0020824112,0.17720447,0.004492942,0.0012376349],"about_ca_topic_score_codex":0.00002253027,"about_ca_topic_score_gemma":0.00003013897,"teacher_disagreement_score":0.9069113,"about_ca_system_score_codex":0.00036206873,"about_ca_system_score_gemma":0.00021407967,"threshold_uncertainty_score":0.9996238},"labels":[],"label_agreement":null},{"id":"W1598379535","doi":"10.1007/978-3-540-76336-9_11","title":"Deterministic Caterpillar Expressions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Caterpillar; Determinism; Expression (computer science); Regular expression; Automaton; Markup language; Tree (set theory); Computer science; Programming language; Mathematics; Algebra over a field; Theoretical computer science; Combinatorics; Pure mathematics; Biology; World Wide Web; Physics; XML; Botany","score_opus":0.022281807377359526,"score_gpt":0.2639599130271646,"score_spread":0.24167810564980508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598379535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013316976,0.0004764674,0.987728,0.00022407617,0.002226327,0.00025346363,0.000005708788,0.00030312547,0.008649677],"genre_scores_gemma":[0.36256376,0.00007963209,0.63068515,0.0043081106,0.0010319347,0.000013058683,0.000009172627,0.00008918847,0.0012199968],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597085,0.000030662453,0.0005707757,0.0015795596,0.0009804195,0.0008677149],"domain_scores_gemma":[0.99662215,0.0006914022,0.0002710731,0.0019951598,0.00014865724,0.0002715434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010498125,0.0005723915,0.0005227765,0.0009612172,0.00033244197,0.00055057823,0.004491276,0.00038149115,0.000040082603],"category_scores_gemma":[0.00009613592,0.00049324357,0.00015188077,0.0005145994,0.0007566846,0.0004956237,0.0019282836,0.0007478679,0.00014693759],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004258348,0.00003093954,0.000017374246,0.00003502271,0.000008349463,0.0005377396,0.000708711,0.0024109124,0.00062532467,0.051310707,0.000039182694,0.9442715],"study_design_scores_gemma":[0.00038184214,0.00024746553,0.00017901137,0.00103603,0.000015099087,0.00041520313,3.0183693e-7,0.4539761,0.00497178,0.5274326,0.00971474,0.0016298273],"about_ca_topic_score_codex":0.000011816736,"about_ca_topic_score_gemma":0.000022864122,"teacher_disagreement_score":0.9426417,"about_ca_system_score_codex":0.00022183692,"about_ca_system_score_gemma":0.0004136887,"threshold_uncertainty_score":0.9997519},"labels":[],"label_agreement":null},{"id":"W1598706676","doi":"10.1007/3-540-44674-5_23","title":"State Complexity and Jacobsthal’s Function","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Intersection (aeronautics); Alphabet; State (computer science); Connection (principal bundle); Function (biology); Theoretical computer science; Algorithm; Mathematics","score_opus":0.023085554994154576,"score_gpt":0.23324748797773917,"score_spread":0.2101619329835846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598706676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056496664,0.0007581265,0.99003834,0.00052453636,0.001434536,0.0002468717,0.000005847607,0.00026064672,0.006166148],"genre_scores_gemma":[0.53853786,0.0005134304,0.44975328,0.0075875665,0.0011204478,0.00001850616,0.00002086942,0.000116680196,0.002331335],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967921,0.000037606314,0.00040665353,0.001449493,0.0007092403,0.0006049157],"domain_scores_gemma":[0.9979977,0.0003069238,0.00022774846,0.0011416428,0.00013234,0.00019366288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008173614,0.00047958177,0.00045921517,0.00056793896,0.00029263512,0.00064567407,0.0018721164,0.00020310869,0.00004216001],"category_scores_gemma":[0.00003162702,0.00043306832,0.00008323425,0.0004408139,0.0010182554,0.0007309874,0.0013574722,0.00062960456,0.000049436814],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070264605,0.000018367813,0.00007414824,0.000024502977,0.000009466708,0.00008432497,0.00035031792,0.0017012666,0.00007651917,0.0914232,0.000032144657,0.90619874],"study_design_scores_gemma":[0.00021459596,0.00015132884,0.0008675328,0.00015999748,0.0000057619122,0.00014309786,1.2641323e-7,0.26352507,0.00016286828,0.73037076,0.0038798912,0.00051897246],"about_ca_topic_score_codex":0.000040522136,"about_ca_topic_score_gemma":0.00007726091,"teacher_disagreement_score":0.90567976,"about_ca_system_score_codex":0.00015794786,"about_ca_system_score_gemma":0.00019267043,"threshold_uncertainty_score":0.9998121},"labels":[],"label_agreement":null},{"id":"W1599511149","doi":"10.1007/978-3-642-18098-9_14","title":"On Lazy Representations and Sturmian Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph; Representation (politics); Set (abstract data type); Computer science; Integer (computer science); Path (computing); Mathematics; Discrete mathematics","score_opus":0.018536103187688852,"score_gpt":0.2464878192117674,"score_spread":0.22795171602407854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599511149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000437079,0.0003275137,0.98365766,0.00044579606,0.0010528931,0.00024740398,0.0000045515526,0.00018538443,0.013641698],"genre_scores_gemma":[0.68758327,0.00020669152,0.30465278,0.005807439,0.00037064505,0.000022220756,0.000007932677,0.000072025825,0.0012770074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972838,0.000033696135,0.00031966664,0.0013583256,0.0005644872,0.0004400111],"domain_scores_gemma":[0.9976673,0.000502091,0.00017664014,0.0013967819,0.00009191084,0.00016527489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005477719,0.0003847161,0.00034033996,0.00075632875,0.00025934883,0.00040806798,0.002128823,0.00020276644,0.000026558684],"category_scores_gemma":[0.00006312623,0.00033114533,0.00008556941,0.0004049044,0.00070596754,0.00046498716,0.0009947849,0.0005503933,0.000044823966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031158736,0.00002060381,0.0000385313,0.000011511208,0.000007619878,0.00006421741,0.00085489644,0.00048733084,0.000044072312,0.5914788,0.000040968564,0.4069483],"study_design_scores_gemma":[0.0001665304,0.00015979621,0.0006648935,0.00020019157,0.0000052389837,0.000059582515,1.9236805e-7,0.030278776,0.00050463557,0.967142,0.00039062882,0.0004275264],"about_ca_topic_score_codex":0.000034340115,"about_ca_topic_score_gemma":0.00004173156,"teacher_disagreement_score":0.6871462,"about_ca_system_score_codex":0.000065392116,"about_ca_system_score_gemma":0.00014798448,"threshold_uncertainty_score":0.99991405},"labels":[],"label_agreement":null},{"id":"W1605990238","doi":"10.1007/978-3-540-76336-9_22","title":"Efficient Enumeration of Regular Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Enumeration; Lexicographical order; Domain (mathematical analysis); Mathematics; Computer science; Section (typography); Computation; Algorithm; Combinatorics","score_opus":0.01162829050439511,"score_gpt":0.24877875866560786,"score_spread":0.23715046816121274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605990238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008016668,0.00086552993,0.9928887,0.00015965146,0.00077796885,0.00020694555,0.0000033752315,0.00011860103,0.0041775513],"genre_scores_gemma":[0.49722952,0.00002073631,0.5011348,0.0008164908,0.00040868693,0.000003170258,0.000005750696,0.000032076357,0.0003487828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972935,0.000025548661,0.000469143,0.0008992423,0.0008911983,0.0004213682],"domain_scores_gemma":[0.99788505,0.00033864382,0.00029946445,0.0012055724,0.00017784895,0.00009339481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001304875,0.000323131,0.00039335276,0.00075191044,0.00011148682,0.00016140564,0.0021028998,0.00023350959,0.00002147806],"category_scores_gemma":[0.000062423256,0.00028551035,0.00011250584,0.0004892039,0.00049374904,0.00015275784,0.0007132309,0.00037430064,0.000022168335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037936002,0.000031389547,0.000014388465,0.0000402713,0.000007702281,0.00006733282,0.0008288131,0.046974372,0.0012316647,0.13267192,0.000010300379,0.81811804],"study_design_scores_gemma":[0.00024329218,0.0001560162,0.00022164338,0.00047802483,0.000008213835,0.000067624,5.5754714e-7,0.8839207,0.018783232,0.094898604,0.0006337203,0.0005883458],"about_ca_topic_score_codex":0.00001661048,"about_ca_topic_score_gemma":0.000014646773,"teacher_disagreement_score":0.83694637,"about_ca_system_score_codex":0.00013098517,"about_ca_system_score_gemma":0.00018621769,"threshold_uncertainty_score":0.9999597},"labels":[],"label_agreement":null},{"id":"W1614407559","doi":"10.1007/978-3-211-74280-8_19","title":"On the Continued Fraction Expansion of a Class of Numbers","year":2008,"lang":"en","type":"book-chapter","venue":"Developments in mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Irrational number; Mathematics; Continued fraction; Real number; Combinatorics; Rational number; Bounded function; Infinity; Fraction (chemistry); Constant (computer programming); Quotient; Dirichlet distribution; Analytic number theory; Class (philosophy); Discrete mathematics; Mathematical analysis; Arithmetic; Geometry","score_opus":0.023199445158452132,"score_gpt":0.2331547342704648,"score_spread":0.20995528911201267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1614407559","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026885614,0.0001401482,0.04926822,0.00014271951,0.00065539614,0.0009545719,0.000015992464,0.00010839496,0.9218289],"genre_scores_gemma":[0.32200533,0.0015884885,0.45957816,0.001060902,0.00009506335,0.00009805627,0.0000511624,0.0002486203,0.2152742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985064,0.00002234512,0.0006366319,0.00021021973,0.0004920596,0.0001323389],"domain_scores_gemma":[0.9981512,0.000524232,0.0006678718,0.0005586961,0.000076184406,0.000021839398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041863616,0.0002065441,0.0004152166,0.00016774498,0.000037570524,0.000012576837,0.0006855981,0.00017253215,0.00004463976],"category_scores_gemma":[0.00008694926,0.00014967866,0.00007641406,0.00007802154,0.000083343475,0.00007695031,0.00016950467,0.00022207257,0.000040399067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006217227,0.00007927428,0.000010400196,0.00015397574,0.000057844874,0.000013352116,0.003958356,0.000007876436,0.00013894933,0.9854264,0.0023454984,0.0078018033],"study_design_scores_gemma":[0.0008881824,0.000112294525,0.00050458964,0.005645423,0.000028139102,0.000046984598,0.0003056102,0.0056049656,0.00809477,0.9547244,0.023192903,0.00085176795],"about_ca_topic_score_codex":0.0000026566977,"about_ca_topic_score_gemma":0.0000015214492,"teacher_disagreement_score":0.7065548,"about_ca_system_score_codex":0.00007004868,"about_ca_system_score_gemma":0.00011174707,"threshold_uncertainty_score":0.6103718},"labels":[],"label_agreement":null},{"id":"W1627395571","doi":"10.1007/978-3-642-37064-9_27","title":"On the Number of Unbordered Factors","year":2013,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Sequence (biology); Morse code; Combinatorics; Mathematics; Discrete mathematics; Computer science; Biology; Genetics","score_opus":0.016682456486248436,"score_gpt":0.26190404839952536,"score_spread":0.24522159191327692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1627395571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33823538,0.000040156883,0.65888405,0.000986135,0.0014476081,0.00024866586,0.000002994773,0.0000831413,0.000071857474],"genre_scores_gemma":[0.8989546,0.000006504204,0.09986949,0.0010507506,0.00008617015,0.0000176746,0.0000016481291,0.000011580862,0.0000016001158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969224,0.00017329701,0.00042449005,0.0010961022,0.0008476273,0.0005361354],"domain_scores_gemma":[0.99530363,0.0018141993,0.00031261277,0.0023040671,0.00017353083,0.00009198418],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001007846,0.00038653184,0.00041543442,0.0002611286,0.00016886597,0.0005443353,0.006532645,0.00020717895,0.00006128947],"category_scores_gemma":[0.00031901678,0.0002345251,0.00013946717,0.0012826113,0.000652582,0.000287554,0.0039203917,0.0008612964,0.00004520961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009217912,0.00039948424,0.0070684957,0.00017258196,0.000051829207,0.000025972013,0.009941497,0.22125772,0.0014212431,0.22547396,0.00027198868,0.533906],"study_design_scores_gemma":[0.00007988156,0.00003264779,0.0041901064,0.00020003507,0.0000021553835,0.0000056882463,9.623328e-7,0.5510585,0.010456416,0.43368986,0.000011415596,0.00027238452],"about_ca_topic_score_codex":0.00020369582,"about_ca_topic_score_gemma":0.00000804878,"teacher_disagreement_score":0.5607192,"about_ca_system_score_codex":0.00010267407,"about_ca_system_score_gemma":0.00033452624,"threshold_uncertainty_score":0.9988425},"labels":[],"label_agreement":null},{"id":"W1634002241","doi":"10.37236/621","title":"Further Applications of a Power Series Method for Pattern Avoidance","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Mathematics; Morphism; Combinatorics; Combinatorics on words; Sigma; Series (stratigraphy); Class (philosophy); Binary number; Word (group theory); Algebraic combinatorics; Discrete mathematics; Algebraic number; Power series; Arithmetic; Computer science; Geometry","score_opus":0.009534080433971958,"score_gpt":0.24123411333055647,"score_spread":0.2317000328965845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634002241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044754706,0.0023336194,0.99191976,0.0005664947,0.00017398337,0.0001558124,0.0000011316051,0.00001676601,0.00035695665],"genre_scores_gemma":[0.9946303,0.00016751957,0.0049118265,0.000109819935,0.000030821055,0.000016488548,1.2194053e-7,0.000010988357,0.00012213492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989923,0.000104649174,0.00032449744,0.00009643887,0.0001934025,0.00028871262],"domain_scores_gemma":[0.99863863,0.00020446215,0.00047071447,0.00040127677,0.000248557,0.000036333702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014298462,0.000094968585,0.00019775641,0.00006418751,0.000072364026,0.000019911127,0.0012710594,0.00003640501,0.000009362131],"category_scores_gemma":[0.000025834386,0.000062893654,0.00012670264,0.00028063264,0.0000424429,0.00025381308,0.00007426975,0.00022895745,0.0000021722128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019616973,0.000104275605,0.000037867685,0.000009669582,0.000056536464,5.980955e-7,0.001656275,0.0000032438472,0.0005026062,0.9851894,0.00016064043,0.012259298],"study_design_scores_gemma":[0.00035231083,0.0005593053,0.00017241277,0.000013283945,0.00002341035,0.00011127603,0.00015532166,0.00052103435,0.0116859265,0.98085,0.0054729595,0.00008277752],"about_ca_topic_score_codex":0.0000044185585,"about_ca_topic_score_gemma":0.0000014459056,"teacher_disagreement_score":0.9901548,"about_ca_system_score_codex":0.000052823514,"about_ca_system_score_gemma":0.0001804908,"threshold_uncertainty_score":0.2564729},"labels":[],"label_agreement":null},{"id":"W164208013","doi":"","title":"Combinatorial Proofs of a Type of Binomial Identity.","year":2005,"lang":"ca","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical proof; Type (biology); Identity (music); Binomial coefficient; Combinatorial proof; Binomial (polynomial); Combinatorics; Discrete mathematics; Statistics; Geometry; Biology; Physics","score_opus":0.016133512960468648,"score_gpt":0.26702322381014104,"score_spread":0.2508897108496724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164208013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9730511,0.0018535325,0.00022950026,0.00035610588,0.019637886,0.00049902487,0.000023307965,0.00011336754,0.004236211],"genre_scores_gemma":[0.9985421,0.000095870266,0.00088158913,0.000070180395,0.00014445787,0.000007312298,0.0000070175297,0.00003928839,0.0002122279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964061,0.00028154821,0.0011402245,0.0006376547,0.00094489154,0.000589608],"domain_scores_gemma":[0.9967718,0.00027566464,0.000823068,0.0013374412,0.0005883816,0.00020364803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011497213,0.00039551876,0.00086201687,0.00029106505,0.00012667448,0.00013068027,0.0021522255,0.00031872012,0.0001807508],"category_scores_gemma":[0.000250293,0.00042103723,0.00029418975,0.0013762611,0.0003691247,0.0013454638,0.00087459345,0.0003644881,0.00019122678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012838723,0.001085134,0.0012814363,0.00018008696,0.00012470207,0.000011508054,0.0011866649,0.000018187506,0.0042768684,0.98276937,0.0022155829,0.006722095],"study_design_scores_gemma":[0.005305856,0.0014914874,0.0038082625,0.00038103305,0.00014091215,0.000020259553,0.000093782364,0.009754417,0.042192,0.931004,0.0051047895,0.0007032081],"about_ca_topic_score_codex":0.00011603419,"about_ca_topic_score_gemma":0.0000057125367,"teacher_disagreement_score":0.051765356,"about_ca_system_score_codex":0.00013758084,"about_ca_system_score_gemma":0.00049820845,"threshold_uncertainty_score":0.99982417},"labels":[],"label_agreement":null},{"id":"W1644292110","doi":"10.1016/j.tcs.2008.11.001","title":"A new characteristic property of rich words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Suffix; Property (philosophy); Prefix; Class (philosophy); Combinatorics; Mathematics; Pure mathematics; Computer science; Linguistics; Philosophy; Artificial intelligence; Biology","score_opus":0.01267596089827406,"score_gpt":0.22429627106657327,"score_spread":0.2116203101682992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644292110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10740822,0.00002588669,0.8887289,0.00062407576,0.000449101,0.00011645113,8.5804885e-7,0.00019241712,0.002454104],"genre_scores_gemma":[0.8123718,0.000006372523,0.18701732,0.00039712765,0.00011531219,0.0000023806374,3.0657853e-7,0.0000061701408,0.00008322442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774545,0.000079175734,0.00033244202,0.00060992653,0.0007255957,0.000507432],"domain_scores_gemma":[0.9982892,0.00016589656,0.00010087831,0.0009877163,0.0001417137,0.00031459602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008480889,0.00017724387,0.00027571592,0.00017528025,0.00028179926,0.00011773312,0.003040685,0.000044274184,0.000090771486],"category_scores_gemma":[0.00008939193,0.00011090897,0.00006740368,0.0013888868,0.0021928253,0.00065937423,0.0010695738,0.00015412834,0.000093755414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007673909,0.000058335027,0.000111487745,0.000007041554,0.0000032943808,0.000027054552,0.0010426324,0.000009039867,0.0026989991,0.93214965,0.00024745968,0.06363732],"study_design_scores_gemma":[0.0007647064,0.0007888239,0.01554941,0.00013343575,0.000010953733,0.00075821683,0.000011820317,0.66655767,0.0371165,0.27662382,0.00090186973,0.00078277953],"about_ca_topic_score_codex":0.000011524489,"about_ca_topic_score_gemma":1.401991e-7,"teacher_disagreement_score":0.70496356,"about_ca_system_score_codex":0.000033101707,"about_ca_system_score_gemma":0.00033845374,"threshold_uncertainty_score":0.8079556},"labels":[],"label_agreement":null},{"id":"W1645602948","doi":"10.1142/s0129054114400097","title":"SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Cardinality (data modeling); Complexity class; Abstract family of languages; Cone (formal languages); Class (philosophy); Descriptive complexity theory; Formal language","score_opus":0.019917248690145807,"score_gpt":0.3049048066592412,"score_spread":0.28498755796909536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1645602948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28552452,0.00003362627,0.712607,0.001008629,0.00058719196,0.000023839022,0.0000015242738,0.000008316048,0.0002053001],"genre_scores_gemma":[0.8204939,0.000008842979,0.17929588,0.00007238687,0.00012229652,2.1641743e-7,3.8343137e-7,0.0000018427828,0.0000042450824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985259,0.00005730514,0.00043398258,0.00014510904,0.000736371,0.00010133851],"domain_scores_gemma":[0.997933,0.00024190826,0.00057580427,0.0002497214,0.00093329477,0.000066303925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011969749,0.00007016123,0.00017296788,0.0004189791,0.00006709572,0.00016088446,0.00186896,0.000017842873,0.000007957616],"category_scores_gemma":[0.00020438137,0.000059992024,0.00006237602,0.00030676025,0.0007024145,0.0012229524,0.0003560897,0.00007513104,0.0000014473613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001362538,0.00014135674,0.0013461452,0.000012956597,0.00005137231,0.0000061382375,0.0006671724,0.0005499844,0.013344031,0.79452056,0.000083993116,0.18926267],"study_design_scores_gemma":[0.0014949645,0.00073018565,0.11323309,0.00037862326,0.000028665092,0.0009714073,0.00009074033,0.62439656,0.0451824,0.2116626,0.0015142645,0.0003164819],"about_ca_topic_score_codex":0.000016311753,"about_ca_topic_score_gemma":0.0000018356906,"teacher_disagreement_score":0.6238466,"about_ca_system_score_codex":0.00003100433,"about_ca_system_score_gemma":0.0001473835,"threshold_uncertainty_score":0.34730238},"labels":[],"label_agreement":null},{"id":"W1661074815","doi":"10.1007/s00233-015-9746-9","title":"Strongly productive ultrafilters on semigroups","year":2015,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Ultrafilter; Semilattice; Inverse semigroup; Semigroup; Commutative property; Special classes of semigroups; Bicyclic semigroup; Binary operation","score_opus":0.019055889483309343,"score_gpt":0.23717290279419495,"score_spread":0.21811701331088562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1661074815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5814592,0.0013592383,0.2785811,0.021442972,0.007895747,0.0020188151,0.00007777919,0.00475491,0.1024102],"genre_scores_gemma":[0.98768544,0.00000890037,0.008112479,0.0017858291,0.00033807248,0.000055350265,0.000021013524,0.000043456836,0.0019494366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99702036,0.00013359857,0.00034784974,0.0009278991,0.0006907552,0.0008795221],"domain_scores_gemma":[0.9977646,0.00013030402,0.00015868059,0.001401815,0.00013197798,0.00041264598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007214227,0.0003777031,0.0003255893,0.00019957725,0.00016434459,0.00022668118,0.001573297,0.00012884672,0.000018485154],"category_scores_gemma":[0.00016278622,0.00032825864,0.0001483945,0.0005849749,0.00011477469,0.0010367483,0.00035942794,0.00034600345,0.00061072235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015576772,0.00063579064,0.0027194782,0.000031028892,0.0001426622,0.0001370967,0.005844188,0.0013544937,0.0049238303,0.70852363,0.20821197,0.06732005],"study_design_scores_gemma":[0.009987153,0.0072877873,0.008073108,0.00064370065,0.00011401501,0.00084864366,0.017064579,0.09480965,0.13721117,0.24958591,0.46794787,0.006426417],"about_ca_topic_score_codex":0.000050944735,"about_ca_topic_score_gemma":0.0000133329495,"teacher_disagreement_score":0.45893773,"about_ca_system_score_codex":0.00020019177,"about_ca_system_score_gemma":0.000121392826,"threshold_uncertainty_score":0.999917},"labels":[],"label_agreement":null},{"id":"W1670403172","doi":"10.1142/s0129054116500088","title":"Remarks on Privileged Words","year":2016,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Linguistics; Context (archaeology); Word length; Computer science; Natural language processing; Arithmetic; Mathematics; History; Philosophy","score_opus":0.016328615167978063,"score_gpt":0.30530616625986967,"score_spread":0.2889775510918916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1670403172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022272928,0.000052505664,0.95848256,0.004853535,0.012456626,0.00010387296,0.0000131678635,0.000038513495,0.0017262837],"genre_scores_gemma":[0.8246572,0.000045541135,0.17401415,0.0003292661,0.0008967776,0.0000026990274,0.000002081989,0.000008682675,0.0000436077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996043,0.00009637603,0.000994577,0.00046707655,0.002152726,0.00024621858],"domain_scores_gemma":[0.994338,0.0004167826,0.0017153077,0.0009254476,0.002456433,0.00014808048],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0020314506,0.00022809644,0.0003636696,0.0013716558,0.00011481336,0.0007236882,0.00936234,0.000094355426,0.00003196828],"category_scores_gemma":[0.00027173193,0.00017293067,0.00028013214,0.00041715795,0.0005160014,0.0014201298,0.002506037,0.00043885113,0.000020785503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005411848,0.0004591957,0.00032280455,0.000025358697,0.00025860203,0.00008440564,0.0010280258,0.004572727,0.0030146646,0.50962406,0.0022020303,0.478354],"study_design_scores_gemma":[0.002176415,0.00096244295,0.018371359,0.0053266953,0.00004953126,0.0007944575,0.000025220434,0.20625253,0.021352222,0.7338787,0.00967108,0.0011393897],"about_ca_topic_score_codex":0.0000038175203,"about_ca_topic_score_gemma":7.9480833e-7,"teacher_disagreement_score":0.80238426,"about_ca_system_score_codex":0.00029787398,"about_ca_system_score_gemma":0.0013965003,"threshold_uncertainty_score":0.9959975},"labels":[],"label_agreement":null},{"id":"W1675101798","doi":"10.3233/fi-2014-1112","title":"Reconstructing Words from a σ-palindromic Language","year":2014,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Alphabet; Computation; Involution (esoterism); Mathematics; Combinatorics; Computer science; Algebra over a field; Discrete mathematics; Linguistics; Algorithm; Pure mathematics; Philosophy","score_opus":0.005768128546149364,"score_gpt":0.21212812442914294,"score_spread":0.20635999588299359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1675101798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7747845,0.000032084918,0.20082068,0.00022528463,0.00054787286,0.000105331506,0.000009424613,0.0003469696,0.02312784],"genre_scores_gemma":[0.92188144,0.0000022849858,0.076257095,0.0016048226,0.000110944675,0.000010199786,0.000016974383,0.000007844189,0.00010838679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891746,0.00004643285,0.00036783965,0.00017101984,0.00020722407,0.0002900452],"domain_scores_gemma":[0.998855,0.00021964575,0.00015346464,0.00065697334,0.0000129172495,0.00010202274],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038950605,0.00013900212,0.00018180833,0.00008418635,0.00012064096,0.00034844698,0.0008295349,0.000051582603,0.0002951652],"category_scores_gemma":[0.00006803982,0.00012290267,0.00006214501,0.00016668343,0.000046415655,0.0010037133,0.00031384354,0.00013617492,0.000907967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010061216,0.00005464457,0.0036507377,0.0000578907,0.00008353584,0.000008658676,0.029918876,0.00002668473,0.002182671,0.13921519,0.0023282305,0.82246286],"study_design_scores_gemma":[0.0018690629,0.0001591121,0.0023756756,0.0002659811,0.000025508762,0.00011085109,0.006833069,0.9180266,0.009150293,0.037442762,0.022817863,0.0009231873],"about_ca_topic_score_codex":0.000060315906,"about_ca_topic_score_gemma":0.0000034321895,"teacher_disagreement_score":0.9179999,"about_ca_system_score_codex":0.000042143864,"about_ca_system_score_gemma":0.000023216653,"threshold_uncertainty_score":0.99986994},"labels":[],"label_agreement":null},{"id":"W1683991801","doi":"10.1007/s00233-015-9725-1","title":"Growth degree classification for finitely generated semigroups of integer matrices","year":2015,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Integer (computer science); Degree (music); Finitely-generated abelian group; Product (mathematics); Norm (philosophy); Discrete mathematics; Geometry","score_opus":0.07655738515433512,"score_gpt":0.27468651099593133,"score_spread":0.1981291258415962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683991801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093485855,0.0014492968,0.89721316,0.0021390684,0.0009863153,0.00063837203,0.00006227772,0.0005326002,0.0034930606],"genre_scores_gemma":[0.95054674,0.0000476017,0.047949564,0.0005886895,0.00015759231,0.000104019615,0.00007729711,0.00003752428,0.00049096113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977926,0.000095764546,0.00058542535,0.00056474854,0.00041391482,0.0005475724],"domain_scores_gemma":[0.9978002,0.0003110311,0.00038038584,0.0007806686,0.00051190506,0.000215816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093673624,0.00027850422,0.00036821526,0.00026803924,0.00011240762,0.0001328065,0.0013411996,0.00018625292,0.000009931072],"category_scores_gemma":[0.000282232,0.00024409847,0.0001746523,0.0008177563,0.000090587775,0.00084834534,0.00028053534,0.00015108137,0.00005097486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013878406,0.0003541599,0.0048957393,0.00016447043,0.00011845676,0.000008747503,0.0019812454,0.00009549735,0.03245241,0.81021816,0.10171129,0.047861077],"study_design_scores_gemma":[0.0044413595,0.001486275,0.004745994,0.0002750401,0.00011392351,0.00010789288,0.0033444664,0.61128294,0.107914224,0.21759695,0.046914216,0.0017767206],"about_ca_topic_score_codex":0.00008709244,"about_ca_topic_score_gemma":0.000026193484,"teacher_disagreement_score":0.8570609,"about_ca_system_score_codex":0.00009154013,"about_ca_system_score_gemma":0.00014338068,"threshold_uncertainty_score":0.99540466},"labels":[],"label_agreement":null},{"id":"W1684681859","doi":"10.3233/fun-2002-52405","title":"One-Visit Caterpillar Tree Automata","year":2002,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Caterpillar; Tree (set theory); Automaton; Computer science; Mathematics; Theoretical computer science; Combinatorics; Biology; Botany; Larva","score_opus":0.02570031036777105,"score_gpt":0.21881751186003628,"score_spread":0.19311720149226524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1684681859","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19344997,0.0006087797,0.2837024,0.009265529,0.0019424226,0.0011708887,0.000049694765,0.0042374274,0.5055729],"genre_scores_gemma":[0.96218216,0.00007818404,0.031543363,0.004560407,0.00009418575,0.000035054276,0.000015217945,0.000018801295,0.0014726095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983229,0.00003451738,0.00048514985,0.00022112153,0.00045759662,0.000478735],"domain_scores_gemma":[0.99846756,0.00008051684,0.00014568573,0.0011005065,0.000031067953,0.00017468478],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002694629,0.00019678034,0.00023080583,0.00015083296,0.00019307909,0.0005316814,0.0014302968,0.0000697254,0.00076495216],"category_scores_gemma":[0.000026706819,0.00018512145,0.00008986813,0.0003422316,0.000065452965,0.0019969195,0.00051664957,0.00013505877,0.0056101596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067813294,0.000424874,0.00043785258,0.0001730465,0.0001301282,0.000025663863,0.01123347,0.000028562796,0.0005737647,0.23692144,0.06775298,0.68229145],"study_design_scores_gemma":[0.0016811953,0.00033693388,0.0034425047,0.00013924493,0.000027742468,0.00011025317,0.00039467297,0.792526,0.0027841183,0.009344134,0.18828651,0.0009267066],"about_ca_topic_score_codex":0.000009171502,"about_ca_topic_score_gemma":0.000001719869,"teacher_disagreement_score":0.7924974,"about_ca_system_score_codex":0.0000800569,"about_ca_system_score_gemma":0.00001423477,"threshold_uncertainty_score":0.9951641},"labels":[],"label_agreement":null},{"id":"W1722516136","doi":"10.3233/fi-2010-287","title":"Computing Maximal Error-detecting Capabilities and Distances of Regular Languages","year":2010,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Computer science; Programming language; Theoretical computer science","score_opus":0.007556075071810087,"score_gpt":0.24278347386891294,"score_spread":0.23522739879710286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1722516136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97273016,0.00008046011,0.022853645,0.00012639067,0.00019128699,0.000099840465,0.0000058864775,0.00012269047,0.003789628],"genre_scores_gemma":[0.9580797,0.0000021756423,0.04172292,0.00011284797,0.00003317812,0.000002718004,0.0000019205884,0.000004536635,0.00004003387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909925,0.00002086315,0.00034277397,0.00012561356,0.000195772,0.00021573945],"domain_scores_gemma":[0.99917835,0.00019368119,0.00017044727,0.0003674651,0.00003090934,0.000059150363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046773843,0.000111813744,0.00017352011,0.00006918251,0.00013355032,0.00016178493,0.0004207032,0.000040553303,0.00003134948],"category_scores_gemma":[0.00007799662,0.000093912124,0.000037131584,0.00011871854,0.00018986092,0.00075646985,0.00029885783,0.00015043451,0.000007818908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001948779,0.000095003976,0.012129006,0.0009882386,0.000080869424,0.0000088722645,0.059719943,0.00003804306,0.025838332,0.56817454,0.00034876703,0.3325589],"study_design_scores_gemma":[0.003052335,0.0008717963,0.073370606,0.0008185868,0.00006722026,0.0005147844,0.10925492,0.6007536,0.13020635,0.06268207,0.016244953,0.0021627771],"about_ca_topic_score_codex":0.00003263121,"about_ca_topic_score_gemma":0.000012875071,"teacher_disagreement_score":0.6007156,"about_ca_system_score_codex":0.000010464736,"about_ca_system_score_gemma":0.000016531356,"threshold_uncertainty_score":0.38296252},"labels":[],"label_agreement":null},{"id":"W1738437109","doi":"10.1007/3-540-36494-3_17","title":"Fast Algorithms for Extended Regular Expression Matching and Searching","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Regular expression; Complement (music); Intersection (aeronautics); Computer science; Expression (computer science); Algorithm; Matching (statistics); Extension (predicate logic); Pattern matching; Word (group theory); Upper and lower bounds; Mathematics; Artificial intelligence; Programming language","score_opus":0.01678256366001422,"score_gpt":0.2586254758790411,"score_spread":0.2418429122190269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1738437109","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024221727,0.0007613329,0.9963549,0.00048260763,0.0009966008,0.00046908826,0.000006735953,0.00015861375,0.0005279335],"genre_scores_gemma":[0.017230142,0.000051100953,0.98056835,0.0014275791,0.00031874535,0.000017693812,0.0000048431125,0.000046930985,0.0003346353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965725,0.00005296691,0.0003995481,0.0015765323,0.0007096393,0.0006887988],"domain_scores_gemma":[0.9977616,0.0006251469,0.0002152454,0.0010897252,0.000117190815,0.00019110889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015114977,0.0004712917,0.00047180697,0.0005428795,0.0004780894,0.0007997576,0.0020206908,0.00025031602,0.000005955805],"category_scores_gemma":[0.00006498423,0.00040807397,0.00011148081,0.000251477,0.0004414216,0.0007213127,0.0012024457,0.0005848061,0.0000041752105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004748687,0.000016927244,0.0000025178301,0.00006899007,0.000006561616,0.00003856972,0.0011507272,0.0031210613,0.0023557302,0.053420648,0.000021521499,0.939792],"study_design_scores_gemma":[0.00028759462,0.000104309016,0.00001950728,0.00058127235,0.0000044800663,0.00011267029,8.2822874e-7,0.31986374,0.005468904,0.67219216,0.00084660493,0.0005179259],"about_ca_topic_score_codex":0.000006615894,"about_ca_topic_score_gemma":0.0000039629886,"teacher_disagreement_score":0.9392741,"about_ca_system_score_codex":0.00012269766,"about_ca_system_score_gemma":0.0001659225,"threshold_uncertainty_score":0.9998371},"labels":[],"label_agreement":null},{"id":"W1738746856","doi":"","title":"Results on Transforming NFA into DFCA","year":2004,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Nondeterministic finite automaton; Deterministic finite automaton; Mathematics; Finite-state machine; Upper and lower bounds; Discrete mathematics; Combinatorics; Nondeterministic algorithm; Nested word; ω-automaton; Quantum finite automata; DFA minimization; Conjecture; Cover (algebra); Automaton; State (computer science); Automata theory; Algorithm; Computer science; Theoretical computer science","score_opus":0.011932914249501422,"score_gpt":0.2410837567690871,"score_spread":0.22915084251958567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1738746856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30129427,0.000060933526,0.5286955,0.00841585,0.0011851311,0.0007702321,0.000027708562,0.0011859649,0.15836434],"genre_scores_gemma":[0.96429867,0.0000133384565,0.031436667,0.0040092906,0.00005583893,0.000021999733,0.000016250915,0.0000094474835,0.00013847447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985578,0.00001566673,0.0004989434,0.00019404369,0.0003767012,0.00035680947],"domain_scores_gemma":[0.99901927,0.00008381771,0.000106591215,0.0006336354,0.00002276345,0.00013394539],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004004955,0.0001760569,0.00016463628,0.0001420352,0.00021211925,0.0002822794,0.0008632284,0.000058158825,0.000026001862],"category_scores_gemma":[0.0000381347,0.00014584683,0.00008082806,0.0002890322,0.00005461234,0.0015304806,0.00013233298,0.00016149222,0.0010719511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006562893,0.0001759285,0.00001020714,0.000086111686,0.000038646667,0.000020293144,0.029392902,0.0007948687,0.00061702216,0.7717733,0.0018821412,0.19514297],"study_design_scores_gemma":[0.01811233,0.0037486006,0.0015508357,0.0015317354,0.000049358183,0.00026329944,0.005931375,0.054729585,0.120529845,0.39097393,0.39959845,0.0029806478],"about_ca_topic_score_codex":0.000034032833,"about_ca_topic_score_gemma":0.0000055308183,"teacher_disagreement_score":0.6630044,"about_ca_system_score_codex":0.00015288247,"about_ca_system_score_gemma":0.000067966044,"threshold_uncertainty_score":0.99970585},"labels":[],"label_agreement":null},{"id":"W1752350786","doi":"10.55016/ojs/cdm.v13i1.62788","title":"Density dichotomy in random words","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Combinatorics; Word (group theory); Mathematics; Alphabet; Sigma; Rank (graph theory); Limit (mathematics); Physics; Linguistics; Computer science; Philosophy; Geometry","score_opus":0.008632125033444954,"score_gpt":0.27738556260323755,"score_spread":0.2687534375697926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1752350786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08843079,0.000041758703,0.90663624,0.0014702542,0.00020731833,0.00038658595,0.000026814521,0.00019829889,0.0026019246],"genre_scores_gemma":[0.95591515,0.0000036623462,0.043305784,0.0003903344,0.00011403175,0.00005174167,0.0000052494024,0.000009332416,0.00020470409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986783,0.00006941705,0.0003492101,0.00028993996,0.00021713675,0.00039597572],"domain_scores_gemma":[0.99854755,0.0002605622,0.00007732135,0.0007867387,0.00017501393,0.00015280479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007882061,0.00015406094,0.00028530564,0.00015686608,0.00018067751,0.0001725619,0.00076341414,0.00006708593,0.000045140827],"category_scores_gemma":[0.0006547309,0.00013113592,0.0000764556,0.0007256998,0.0000969571,0.0002586623,0.00035763197,0.00011564451,0.00047733943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018319524,0.00015516866,0.00027831725,0.000020290345,0.000023703295,0.00002168542,0.0034878582,0.000011909478,0.0016545765,0.9890803,0.0022901937,0.002957646],"study_design_scores_gemma":[0.0056112334,0.00029959134,0.005661219,0.0005329018,0.000052648673,0.00009710758,0.0005165644,0.2710859,0.023896042,0.6731094,0.017922128,0.0012152798],"about_ca_topic_score_codex":0.000013234902,"about_ca_topic_score_gemma":0.00003779595,"teacher_disagreement_score":0.8674844,"about_ca_system_score_codex":0.00010035648,"about_ca_system_score_gemma":0.000073268486,"threshold_uncertainty_score":0.61353916},"labels":[],"label_agreement":null},{"id":"W1764454094","doi":"10.1007/3-540-44693-1_48","title":"Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bounded function; Computer science; Order (exchange); Upper and lower bounds; Discrete mathematics; Mathematics","score_opus":0.007681388212035996,"score_gpt":0.22911991591952036,"score_spread":0.22143852770748437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764454094","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019865506,0.00089151843,0.9893469,0.0005156162,0.00040161164,0.00035074324,0.00001612662,0.0001935527,0.006297372],"genre_scores_gemma":[0.059753347,0.00016103804,0.9357308,0.0017404823,0.00030121187,0.000024642502,0.0000362863,0.0000928129,0.0021593347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615437,0.000044000608,0.0005824552,0.0013861884,0.0010717063,0.00076125236],"domain_scores_gemma":[0.9968829,0.0005000908,0.00045087235,0.0017012241,0.0003027287,0.000162169],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073016266,0.0006420746,0.0007915706,0.00037629495,0.00028786427,0.0005477867,0.002943911,0.00034723544,0.00011854251],"category_scores_gemma":[0.000070839924,0.00050742563,0.00012684951,0.0009037671,0.00089421566,0.0006449971,0.0008564376,0.00045086452,0.000019244006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012334016,0.00042293436,0.0006951387,0.00039836759,0.0002468116,0.0005661177,0.003181686,0.017073888,0.0020534731,0.73427033,0.0013699756,0.23959793],"study_design_scores_gemma":[0.0020644653,0.00039803353,0.00006122272,0.0011584101,0.000054046952,0.0006795711,0.0000015349553,0.3213322,0.0058616144,0.64749914,0.019044014,0.0018457766],"about_ca_topic_score_codex":0.0002351093,"about_ca_topic_score_gemma":0.00018986354,"teacher_disagreement_score":0.30425832,"about_ca_system_score_codex":0.0001816549,"about_ca_system_score_gemma":0.00045462674,"threshold_uncertainty_score":0.99973774},"labels":[],"label_agreement":null},{"id":"W1765943450","doi":"10.3968/j.pam.1925252820130502.643","title":"The Subclasses of Characterization on $\\Pi^*$-Regular Semigroups","year":2013,"lang":"en","type":"article","venue":"Progress in applied mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pi; Characterization (materials science); Mathematics; Discrete mathematics; Combinatorics; Computer science; Physics; Geometry","score_opus":0.009002251138495704,"score_gpt":0.22387205176140482,"score_spread":0.2148698006229091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765943450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77915776,0.00043205352,0.21028276,0.0015149644,0.0003451488,0.0020058395,0.0000045842226,0.00042914267,0.0058277566],"genre_scores_gemma":[0.94734883,0.000052723553,0.05208526,0.0000778523,0.000030673433,0.00031696705,0.0000048652987,0.000018187584,0.00006460964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988106,0.000022996557,0.00039145816,0.00021068468,0.00030924985,0.00025504717],"domain_scores_gemma":[0.99867743,0.00029123278,0.00025433637,0.0006960626,0.00004298172,0.00003792832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042540242,0.00014756818,0.00020292777,0.00007372352,0.00008292425,0.0001739158,0.0008917604,0.00006371765,0.000010216746],"category_scores_gemma":[0.000024030216,0.00009741021,0.000037681366,0.00031148666,0.00012760232,0.00014420539,0.00018636198,0.000109203094,0.00006620438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002544111,0.00019939833,0.00019167486,0.000085024636,0.000009740821,8.8340556e-7,0.0007672554,0.0000034889358,0.0056138095,0.836518,0.00006442336,0.15654378],"study_design_scores_gemma":[0.0009309061,0.00016556695,0.008896159,0.00043070072,0.00001670111,0.000013727622,0.0007027304,0.23758526,0.13032697,0.61758345,0.0026585844,0.0006892418],"about_ca_topic_score_codex":7.5655953e-7,"about_ca_topic_score_gemma":4.8627413e-7,"teacher_disagreement_score":0.23758177,"about_ca_system_score_codex":0.000022870305,"about_ca_system_score_gemma":0.000018021441,"threshold_uncertainty_score":0.39722732},"labels":[],"label_agreement":null},{"id":"W1768118166","doi":"10.1016/j.tcs.2014.04.016","title":"Theory of átomata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Regional Development Fund; Haridus- ja Teadusministeerium; Natural Sciences and Engineering Research Council of Canada; Eesti Teadusfondi","keywords":"Nondeterministic finite automaton; Deterministic finite automaton; Regular language; Deterministic automaton; Büchi automaton; Nondeterministic algorithm; Finite-state machine; Mathematics; Discrete mathematics; DFA minimization; Quotient; Automaton; Regular expression; Combinatorics; Two-way deterministic finite automaton; Computer science; Algorithm; Automata theory; Theoretical computer science; Programming language","score_opus":0.008109070715470214,"score_gpt":0.22572407714878318,"score_spread":0.21761500643331297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768118166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0393731,0.000020418298,0.95007545,0.00040468873,0.0004624536,0.00007467416,7.997906e-7,0.00025033185,0.009338075],"genre_scores_gemma":[0.85128456,0.0000014405433,0.14807418,0.0005424862,0.00008024972,0.0000021931883,2.600588e-7,0.00000599867,0.00000861605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977653,0.0002373028,0.00030210408,0.0005819786,0.00063893764,0.00047439514],"domain_scores_gemma":[0.99747825,0.00069720496,0.000097510485,0.0013803284,0.00014127884,0.00020543963],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0041513317,0.00015772459,0.00024128593,0.00018780076,0.00020488417,0.00018216862,0.00399438,0.000043459648,0.00006135212],"category_scores_gemma":[0.00020549426,0.00012041695,0.00007598566,0.0009792264,0.0032845521,0.0005897746,0.0013989311,0.00012388063,0.000087749504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035629885,0.00003551892,0.000021979386,0.0000063722596,0.000002184247,0.0000012923902,0.00016711866,0.000015938755,0.0014175312,0.86766183,0.000026310274,0.13064034],"study_design_scores_gemma":[0.0001168939,0.00012668944,0.0006389722,0.000020378151,0.0000022802326,0.00001867391,0.0000034829895,0.35247713,0.014066767,0.6322647,0.00013820002,0.00012586985],"about_ca_topic_score_codex":7.0170086e-7,"about_ca_topic_score_gemma":5.7868633e-8,"teacher_disagreement_score":0.81191146,"about_ca_system_score_codex":0.00001852634,"about_ca_system_score_gemma":0.00006479108,"threshold_uncertainty_score":0.9994279},"labels":[],"label_agreement":null},{"id":"W1768292","doi":"","title":"On the existence of Aperiodic Perfect Maps for 2 x 2 Windows.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Aperiodic graph; Mathematics; Combinatorics","score_opus":0.019856818305440532,"score_gpt":0.2191653776294581,"score_spread":0.19930855932401756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9774306,0.0006154789,0.0027285723,0.0031705226,0.0027658066,0.0007092076,0.00001220431,0.0002368977,0.012330742],"genre_scores_gemma":[0.99837285,0.000012206575,0.00065594533,0.00062749017,0.0000073259102,0.00004251104,8.533128e-7,0.000009045088,0.00027178752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990843,0.00006849553,0.00017030798,0.00024647443,0.00020988293,0.00022052317],"domain_scores_gemma":[0.9983961,0.0007099339,0.000091225826,0.00070955517,0.000050481427,0.000042689804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003638995,0.00011642837,0.00015403918,0.00004169087,0.00015733937,0.00006659274,0.0010251813,0.000042766475,0.000053366166],"category_scores_gemma":[0.00013794878,0.00007992737,0.00010171521,0.00022835271,0.00008292091,0.0001421971,0.00011284151,0.000093009745,0.00007222381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037000125,0.000078301615,0.000043430642,0.000010347578,0.000008862297,0.0000018528713,0.0004473208,0.0000034511947,0.000362592,0.9871777,0.008165914,0.0036965194],"study_design_scores_gemma":[0.0006075105,0.00038170503,0.0003119514,0.00004540884,0.0000062408035,0.0000070237857,0.000042281372,0.019168084,0.005082575,0.9697702,0.0044152313,0.00016181708],"about_ca_topic_score_codex":0.0000045137153,"about_ca_topic_score_gemma":2.466814e-7,"teacher_disagreement_score":0.020942267,"about_ca_system_score_codex":0.000020225736,"about_ca_system_score_gemma":0.000012333053,"threshold_uncertainty_score":0.32593435},"labels":[],"label_agreement":null},{"id":"W1768688475","doi":"10.1007/978-3-642-38771-5_23","title":"Subword Complexity and k-Synchronization","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sequence (biology); Synchronization (alternating current); Contrast (vision); Function (biology); Algorithm; Arithmetic; Discrete mathematics; Combinatorics; Theoretical computer science; Artificial intelligence; Mathematics; Telecommunications; Biology","score_opus":0.019010154914770146,"score_gpt":0.22842723487517438,"score_spread":0.20941707996040423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768688475","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025960323,0.00062162016,0.9932796,0.00087548327,0.00091848016,0.00030247925,0.0000030928525,0.00021542404,0.003524221],"genre_scores_gemma":[0.37867236,0.00013253841,0.61748374,0.0025018796,0.0005347412,0.000011325637,0.000011490902,0.000047622576,0.0006043002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972483,0.00003188257,0.0003681697,0.0012479692,0.00060038676,0.0005033088],"domain_scores_gemma":[0.99809086,0.0002877946,0.00020895177,0.0010857139,0.00016101125,0.00016563863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055919425,0.00041739095,0.0004109925,0.0004692517,0.0002547732,0.00077627605,0.0020652555,0.00023686817,0.00008818011],"category_scores_gemma":[0.00004634417,0.0003732354,0.00006001419,0.00038394597,0.0010421944,0.00081806397,0.0014653924,0.0004748742,0.00009713991],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010065974,0.000011224322,0.00004038298,0.000026988133,0.0000047055432,0.00001831837,0.00028209173,0.0008780434,0.00004352567,0.21233602,0.00004171688,0.786316],"study_design_scores_gemma":[0.00012281034,0.000059276466,0.00035082857,0.00014338801,0.0000029608775,0.00005373238,6.7172635e-8,0.5367782,0.00017897514,0.46109077,0.0008441552,0.00037480536],"about_ca_topic_score_codex":0.00003984297,"about_ca_topic_score_gemma":0.00003670439,"teacher_disagreement_score":0.7859412,"about_ca_system_score_codex":0.00016365502,"about_ca_system_score_gemma":0.00023489624,"threshold_uncertainty_score":0.99987197},"labels":[],"label_agreement":null},{"id":"W1813146539","doi":"10.1007/978-3-540-88282-4_43","title":"Length Codes, Products of Languages and Primality","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Primality test; Catenation; Computer science; Extension (predicate logic); Prime (order theory); Code (set theory); Decomposition; Programming language; Prefix code; Regular language; Algebra over a field; Discrete mathematics; Arithmetic; Mathematics; Theoretical computer science; Automaton; Algorithm; Pure mathematics; Combinatorics; Linear code; Set (abstract data type)","score_opus":0.012823321688631656,"score_gpt":0.24395722421437444,"score_spread":0.23113390252574278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813146539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025423705,0.0037084685,0.9898947,0.0005437144,0.00049402186,0.00029537603,0.000009942266,0.00014273218,0.0023686904],"genre_scores_gemma":[0.5718895,0.0005324941,0.42607376,0.00080815336,0.00033729427,0.000004406772,0.0000055243427,0.000030718908,0.00031812437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741113,0.000035922676,0.00038754108,0.0011444648,0.0006358601,0.00038504976],"domain_scores_gemma":[0.9979219,0.0003255293,0.00026587877,0.0012144723,0.0001780733,0.000094170835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007597581,0.00034651885,0.0005035759,0.000378427,0.00012937545,0.00013361537,0.0018733614,0.0001808329,0.0000054484976],"category_scores_gemma":[0.000113705195,0.0002953491,0.00005691279,0.00036373618,0.0010775828,0.000398717,0.0011649155,0.00040758733,0.0000053376134],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064864616,0.000050385755,0.00016607565,0.00017624463,0.000017150769,0.0001264051,0.0021844865,0.00068125175,0.0010400639,0.044411905,0.000090411624,0.95104915],"study_design_scores_gemma":[0.0021173826,0.0014995446,0.011533082,0.0032003385,0.00006538142,0.0022351982,0.0000032511339,0.44161803,0.11632422,0.4000572,0.016107598,0.005238796],"about_ca_topic_score_codex":0.000033295004,"about_ca_topic_score_gemma":0.000014362186,"teacher_disagreement_score":0.9458103,"about_ca_system_score_codex":0.00007234893,"about_ca_system_score_gemma":0.00035098733,"threshold_uncertainty_score":0.9999499},"labels":[],"label_agreement":null},{"id":"W1833516523","doi":"10.1007/978-3-642-38771-5_34","title":"Repetition Avoidance in Circular Factors","year":2013,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Repetition (rhetorical device); Alphabet; Exponent; Mathematics; Word length; Combinatorics; Variation (astronomy); Upper and lower bounds; Computer science; Geometry; Physics; Natural language processing; Linguistics; Mathematical analysis","score_opus":0.01386120211592238,"score_gpt":0.2395959528970629,"score_spread":0.22573475078114053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833516523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30116078,0.0003121242,0.69534403,0.00059643266,0.00205996,0.00032000575,0.0000020665946,0.00018461043,0.00001997698],"genre_scores_gemma":[0.8079208,0.000026054842,0.19118015,0.0006624047,0.00015630158,0.000033580814,0.000005555759,0.000014202275,9.06007e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956012,0.00018912405,0.0005745889,0.001981333,0.00082328287,0.0008305103],"domain_scores_gemma":[0.9968878,0.0004108546,0.00027162093,0.0021450496,0.00013541573,0.0001492335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013635949,0.0004736088,0.00051166036,0.000905959,0.00014868329,0.0010113326,0.004868519,0.00033321505,0.000016303973],"category_scores_gemma":[0.00023865505,0.00042633596,0.00012511325,0.0019095642,0.00040315912,0.00095250044,0.0037382771,0.001236946,0.000036103575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039643182,0.0002700077,0.018036122,0.00027674393,0.000012617165,0.0002025629,0.007636767,0.48770118,0.0044411896,0.0074531427,0.000031871503,0.47393382],"study_design_scores_gemma":[0.00015220797,0.00003276934,0.024294158,0.00041860828,0.0000014822887,0.000016122976,9.786586e-7,0.77478373,0.006760699,0.19300829,0.000026418293,0.00050451065],"about_ca_topic_score_codex":0.0004174273,"about_ca_topic_score_gemma":0.00006243255,"teacher_disagreement_score":0.50676006,"about_ca_system_score_codex":0.00042615892,"about_ca_system_score_gemma":0.0004347758,"threshold_uncertainty_score":0.99981886},"labels":[],"label_agreement":null},{"id":"W1834459590","doi":"","title":"What is a maximal error-detecting capability of a formal language?","year":2006,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Computer science; Class (philosophy); Set (abstract data type); Channel (broadcasting); Formal language; Error detection and correction; Theoretical computer science; Emphasis (telecommunications); Algorithm; Artificial intelligence; Programming language; Telecommunications","score_opus":0.009546469054599459,"score_gpt":0.24010113927292348,"score_spread":0.23055467021832401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834459590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8872601,0.0002252015,0.10807533,0.00028727684,0.00017087729,0.00007235084,0.0000012896235,0.00017138061,0.0037362315],"genre_scores_gemma":[0.98235047,0.0000013823924,0.016984532,0.00023474143,0.00003945707,0.0000034957025,6.073114e-7,0.0000042544116,0.00038108393],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991321,0.000029335575,0.000206292,0.00022018344,0.00016990061,0.00024221755],"domain_scores_gemma":[0.9993521,0.00006922247,0.00007003409,0.00044535173,0.00003361147,0.0000296917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038885511,0.00008590293,0.00012412299,0.000047315574,0.00005541793,0.00011261433,0.00042917012,0.000038579343,0.000106374086],"category_scores_gemma":[0.000011868872,0.00006963098,0.000075888944,0.00019064051,0.000039669,0.0013725332,0.00021615277,0.00006388075,0.0000202267],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003947144,0.00050173025,0.006135307,0.00021232302,0.000043045227,0.000054757522,0.019421896,0.00012648804,0.07668408,0.23454338,0.0015134512,0.66072404],"study_design_scores_gemma":[0.0012446678,0.00028705227,0.0321099,0.00011849606,0.000016152957,0.00013002561,0.00824973,0.28223628,0.61517954,0.058748882,0.00092028495,0.0007589503],"about_ca_topic_score_codex":0.0006163663,"about_ca_topic_score_gemma":0.0000559619,"teacher_disagreement_score":0.6599651,"about_ca_system_score_codex":0.000016623017,"about_ca_system_score_gemma":0.000019012085,"threshold_uncertainty_score":0.28394687},"labels":[],"label_agreement":null},{"id":"W1835137587","doi":"10.1007/978-3-642-04027-6_16","title":"On the Word Problem for ${\\it \\Sigma\\Pi}$ -Categories, and the Properties of Two-Way Communication","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Sigma; Word (group theory); Pi; Natural language processing; Artificial intelligence; Linguistics; Mathematics; Philosophy; Physics","score_opus":0.02236925122544508,"score_gpt":0.2297262105053634,"score_spread":0.20735695927991832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835137587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021954442,0.0019901793,0.9814664,0.01238626,0.00024044607,0.0011861726,0.0000024457586,0.000068720125,0.0024398195],"genre_scores_gemma":[0.8660037,0.0002330274,0.12664077,0.0062542967,0.00016794259,0.000084712236,0.000003351029,0.000030068308,0.0005821558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978795,0.000113676484,0.000451413,0.00067344407,0.0005337577,0.00034819703],"domain_scores_gemma":[0.9957939,0.0018259432,0.00036874277,0.0017642124,0.00019980191,0.000047413985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002439129,0.00034246678,0.0004137002,0.00019237112,0.00048415034,0.00047179314,0.0039469628,0.00012437251,0.0000031709699],"category_scores_gemma":[0.00012315996,0.00017333796,0.000102776794,0.00030663423,0.001990243,0.0002956594,0.0008782686,0.00049469166,0.0000019940937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002219438,0.0000139621925,7.788631e-7,0.000025012241,0.000008232519,6.014907e-7,0.0019223345,0.0020841544,0.000068672736,0.65987134,0.000040701252,0.33594203],"study_design_scores_gemma":[0.00044386246,0.000115310606,0.000008323093,0.0005322581,0.000009211967,0.00001439323,0.0000014477171,0.21334502,0.0017467712,0.78233093,0.0012193281,0.00023313267],"about_ca_topic_score_codex":0.000026669868,"about_ca_topic_score_gemma":0.000047451562,"teacher_disagreement_score":0.8657841,"about_ca_system_score_codex":0.00006610129,"about_ca_system_score_gemma":0.0001891067,"threshold_uncertainty_score":0.7334505},"labels":[],"label_agreement":null},{"id":"W1836835072","doi":"10.1023/a:1022091131450","title":"On 2-Symmetric Words in Nilpotent Groups","year":2002,"lang":"en","type":"article","venue":"Ukrainian Mathematical Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics","score_opus":0.02328301646311038,"score_gpt":0.23588537002776955,"score_spread":0.21260235356465917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836835072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42112464,0.0006356887,0.4740394,0.009593735,0.0010168848,0.0003497129,0.0000023083078,0.00034156104,0.09289607],"genre_scores_gemma":[0.9680341,0.000032692038,0.030082751,0.0013190644,0.00017535736,0.000005998979,1.5140384e-7,0.000017178336,0.00033274622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798,0.00014468007,0.0005232179,0.00027076554,0.00057692354,0.00050441147],"domain_scores_gemma":[0.99854386,0.000556555,0.00013106689,0.00045788346,0.00002958717,0.00028101922],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010613572,0.00019157461,0.00029188828,0.0005176965,0.00011724036,0.0004103475,0.0010274015,0.00008684773,0.00097038544],"category_scores_gemma":[0.0004241789,0.00014425015,0.00014399043,0.0008425098,0.00005324018,0.00033529726,0.00013450088,0.00057132693,0.0012597222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005372499,0.00065336213,0.000025554846,0.000022295755,0.00001852381,0.00057167484,0.006890027,0.000057547313,0.000045102795,0.85519,0.0011836261,0.13533694],"study_design_scores_gemma":[0.0009779314,0.00026027884,0.00056160474,0.0002527259,0.0000061169167,0.0014243047,0.00010730738,0.33420944,0.000044004733,0.65991503,0.0019041436,0.0003371248],"about_ca_topic_score_codex":3.6546837e-7,"about_ca_topic_score_gemma":2.3318691e-7,"teacher_disagreement_score":0.5469094,"about_ca_system_score_codex":0.00009624945,"about_ca_system_score_gemma":0.000014889156,"threshold_uncertainty_score":0.99994284},"labels":[],"label_agreement":null},{"id":"W1843502301","doi":"10.3968/j.sms.1923845220120101.007","title":"On the Construction of Normal Subgroups","year":2010,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sylow theorems; Mathematics; Normal subgroup; Character (mathematics); Extension (predicate logic); Group (periodic table); Pure mathematics; Fitting subgroup; Finite group; Key (lock); Algebra over a field; Locally finite group; Combinatorics; Computer science; Geometry; Physics","score_opus":0.039009304528157214,"score_gpt":0.31343841658814064,"score_spread":0.27442911205998344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843502301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9670164,0.00005128776,0.009475903,0.0022794544,0.0005415067,0.00010719835,4.8587043e-7,0.000037876744,0.02048989],"genre_scores_gemma":[0.9714014,0.0000101088435,0.02842146,0.00011876925,0.000021224347,0.000010085742,1.7350999e-8,0.0000012353071,0.000015682901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990984,0.000046789493,0.0002029993,0.00017205391,0.00030596263,0.00017375428],"domain_scores_gemma":[0.9981258,0.0015103638,0.00006973682,0.0002453433,0.000029366667,0.000019392528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001614954,0.00007029852,0.00013934681,0.00005469332,0.0001705982,0.00003626564,0.0008084799,0.000022798235,0.00005003303],"category_scores_gemma":[0.00077797077,0.000034945882,0.00003251536,0.00046178696,0.0018651169,0.00016816297,0.00023338947,0.00013011857,0.000023960078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.3436136e-7,0.00002718597,0.00018142269,0.000011051873,0.000003264136,8.431244e-7,0.00093089,0.0000034735838,0.00035719035,0.9961035,0.00007275872,0.0023077575],"study_design_scores_gemma":[0.000046953217,0.000058337286,0.00043977893,0.000041944848,0.0000012901926,0.000012173211,0.0013268392,0.0071231755,0.0021768159,0.98869145,0.000024988378,0.000056234327],"about_ca_topic_score_codex":0.0000023166158,"about_ca_topic_score_gemma":0.00000760514,"teacher_disagreement_score":0.020474209,"about_ca_system_score_codex":0.000006151102,"about_ca_system_score_gemma":0.000016891578,"threshold_uncertainty_score":0.6872101},"labels":[],"label_agreement":null},{"id":"W1848286548","doi":"10.48550/arxiv.0801.1097","title":"A Combinatorial Interpretation for Certain Relatives of the Conolly Sequence","year":2008,"lang":"en","type":"article","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Interpretation (philosophy); Sequence (biology); Integer (computer science); Parameterized complexity; Integer sequence; Recursion (computer science); Monotone polygon; Tree (set theory); Discrete mathematics; Generating function; Algorithm; Computer science; Biology","score_opus":0.04558555725837715,"score_gpt":0.2642845428738127,"score_spread":0.21869898561543555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848286548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9478572,0.00004631569,0.050086766,0.00042948013,0.0007304722,0.00018493002,0.0000033993315,0.00005469229,0.00060674985],"genre_scores_gemma":[0.99837774,0.000004584136,0.0012825299,0.00016099942,0.00003827327,0.00001756971,0.0000010568647,0.0000051994853,0.00011202923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99935013,0.000070841365,0.000175032,0.00017715587,0.000104544495,0.00012229879],"domain_scores_gemma":[0.9991632,0.0002682313,0.00013015604,0.0003464674,0.00006880351,0.000023115557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000180572,0.00007402041,0.000111005895,0.000025869698,0.0001271872,0.000011468281,0.0005915817,0.000039222065,0.0000035864598],"category_scores_gemma":[0.0001761907,0.000052696378,0.00007727259,0.00016952625,0.00013309444,0.00029246777,0.00011502723,0.000068746296,0.000008692922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007273107,0.00013016627,0.12868483,0.000038836864,0.00005567765,0.0000060952366,0.015340781,0.00010275455,0.047343303,0.8036726,0.000633223,0.0039190017],"study_design_scores_gemma":[0.003242734,0.0006615126,0.5025843,0.00027079083,0.000032290176,0.00006638396,0.00055113435,0.10148845,0.15758263,0.23035148,0.0025207135,0.0006476173],"about_ca_topic_score_codex":0.00001331619,"about_ca_topic_score_gemma":0.0000010170537,"teacher_disagreement_score":0.5733211,"about_ca_system_score_codex":0.00002279192,"about_ca_system_score_gemma":0.00006605287,"threshold_uncertainty_score":0.2148896},"labels":[],"label_agreement":null},{"id":"W1854120094","doi":"10.1142/s0129054111008131","title":"PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Catenation; Mathematics; Involution (esoterism); Palindrome; Word (group theory); Combinatorics; Combinatorics on words; Commutative property; Primitive root modulo n; Arithmetic; Discrete mathematics; Modulo; Geometry","score_opus":0.03143803747516207,"score_gpt":0.25822805487195344,"score_spread":0.22679001739679136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854120094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19226237,0.00009300173,0.80651015,0.00024719007,0.0004024286,0.000060696057,0.0000023303185,0.000009991801,0.0004118544],"genre_scores_gemma":[0.85434115,0.000026372447,0.1455,0.00005945518,0.00006273859,0.000002515885,1.9940006e-7,0.0000023045427,0.0000052751534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988238,0.000028864972,0.0004572693,0.00015463616,0.00043448032,0.00010093434],"domain_scores_gemma":[0.99778664,0.000074585056,0.00053852994,0.00024661937,0.0012915205,0.00006211094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065739657,0.00008066575,0.00015044241,0.00044600962,0.00007703044,0.00010256883,0.0021241494,0.000018266082,0.0000073608508],"category_scores_gemma":[0.00004200066,0.000059492773,0.000064065134,0.00039612147,0.00065925624,0.0014476628,0.00038872033,0.00007577674,0.0000015687762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028127699,0.00041864676,0.0010286968,0.000017768421,0.0001269999,0.000003687285,0.012861469,0.00012143065,0.059914384,0.54681677,0.000031675892,0.3786303],"study_design_scores_gemma":[0.0016069859,0.00091924454,0.054552726,0.00081181683,0.000037219776,0.001157137,0.0011609002,0.17619333,0.57829916,0.18347743,0.0011845938,0.0005994309],"about_ca_topic_score_codex":0.0000121193825,"about_ca_topic_score_gemma":9.662751e-7,"teacher_disagreement_score":0.6620788,"about_ca_system_score_codex":0.000031403684,"about_ca_system_score_gemma":0.00027094927,"threshold_uncertainty_score":0.39472336},"labels":[],"label_agreement":null},{"id":"W1854985511","doi":"10.1007/978-3-642-22321-1_15","title":"Enumeration and Decidable Properties of Automatic Sequences","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decidability; Enumeration; Recursively enumerable language; Class (philosophy); Computer science; Function (biology); Sequence (biology); Characterization (materials science); Combinatorics; Discrete mathematics; Mathematics; Algorithm; Artificial intelligence; Biology; Physics","score_opus":0.022701264572092743,"score_gpt":0.21484894919083253,"score_spread":0.1921476846187398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854985511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037984776,0.0016137837,0.9924045,0.00013541162,0.00040035817,0.00025474693,0.0000013497731,0.00012787242,0.0012634975],"genre_scores_gemma":[0.7988576,0.00007631896,0.20049092,0.00029161156,0.00007967922,0.000007289735,6.9043415e-7,0.000014314431,0.00018151001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979957,0.000029784158,0.0004161926,0.0007528182,0.00049400976,0.0003115402],"domain_scores_gemma":[0.99864846,0.00014168373,0.00027086987,0.0007249176,0.00013558847,0.000078463214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007002226,0.0002943659,0.00039455763,0.00043178696,0.00014088866,0.00025684963,0.0015392778,0.00016426417,0.000018187658],"category_scores_gemma":[0.0000560265,0.0002290454,0.000051883384,0.0002626605,0.0008005091,0.0007389735,0.00068918284,0.00024478463,0.000009939876],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034029438,0.000026785106,0.00010578781,0.00019672886,0.000014541789,0.000021176731,0.003351837,0.0011982985,0.0038793802,0.086029105,0.0000068333884,0.90516615],"study_design_scores_gemma":[0.00015150018,0.00019302631,0.0002266504,0.0011538576,0.000008694817,0.000084249215,4.3130737e-7,0.5004805,0.037410665,0.45966533,0.00013283077,0.0004923008],"about_ca_topic_score_codex":0.000051537143,"about_ca_topic_score_gemma":0.000028221242,"teacher_disagreement_score":0.9046738,"about_ca_system_score_codex":0.0000629116,"about_ca_system_score_gemma":0.00030685426,"threshold_uncertainty_score":0.93402},"labels":[],"label_agreement":null},{"id":"W1859305636","doi":"10.1016/j.ic.2017.08.014","title":"Syntactic complexity of suffix-free languages","year":2017,"lang":"en","type":"preprint","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowym Centrum Nauki; Narodowe Centrum Nauki","keywords":"Regular language; Cardinality (data modeling); Suffix; Semigroup; Alphabet; Discrete mathematics; Mathematics; Upper and lower bounds; State (computer science); Combinatorics; Automaton; Quotient; Computer science; Theoretical computer science; Algorithm; Linguistics","score_opus":0.032337632840797846,"score_gpt":0.2946075498334217,"score_spread":0.26226991699262386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1859305636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079639874,0.00019880256,0.9109529,0.0011368347,0.0005067182,0.00025706436,0.00004719714,0.00021489276,0.0070456862],"genre_scores_gemma":[0.97574633,0.00003777706,0.023885112,0.00016618294,0.00002914466,0.000007438762,0.00011336229,0.000003219237,0.000011442619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913406,0.00004427219,0.0003574011,0.00013282377,0.00023097312,0.000100446625],"domain_scores_gemma":[0.99846673,0.00006678093,0.00067988195,0.0005961899,0.00014722803,0.00004320098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002924918,0.00013159461,0.0002066762,0.00015478687,0.00012108692,0.00044273725,0.00075434113,0.00010660164,0.0000050246954],"category_scores_gemma":[0.00009385451,0.00012675508,0.000051230953,0.0000459073,0.000098202094,0.0012600437,0.0010160117,0.00016500104,0.0000145256345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015854563,0.00005392806,0.0002836765,0.00094545307,0.00006422475,0.000002886053,0.006828321,0.0029868064,0.00002914318,0.4489905,0.0019139443,0.53788525],"study_design_scores_gemma":[0.0005048102,0.000046713576,0.024054313,0.00021237857,0.00001597485,0.000019203277,0.00026062326,0.71149576,0.00034446354,0.26218173,0.00059111917,0.0002728956],"about_ca_topic_score_codex":0.00015090832,"about_ca_topic_score_gemma":0.000005915904,"teacher_disagreement_score":0.8961064,"about_ca_system_score_codex":0.00002165227,"about_ca_system_score_gemma":0.000071099035,"threshold_uncertainty_score":0.5168922},"labels":[],"label_agreement":null},{"id":"W1880858962","doi":"10.1007/3-540-45526-4_5","title":"Metric Lexical Analysis","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Linguistics; Computer science; Mathematics; Philosophy","score_opus":0.015200702678385558,"score_gpt":0.24701855855411545,"score_spread":0.2318178558757299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1880858962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007045348,0.00081434974,0.9831056,0.00054259587,0.0009953824,0.00017443845,0.000003937126,0.00027704798,0.014016224],"genre_scores_gemma":[0.44390336,0.00020681512,0.548317,0.0043276455,0.0010369387,0.000012066185,0.000017179304,0.000065726825,0.0021132154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955044,0.000045176927,0.0005637165,0.0018502797,0.0012536851,0.0007827787],"domain_scores_gemma":[0.99660885,0.000658389,0.00026923406,0.0020461138,0.00017042912,0.0002469839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011774447,0.00054982654,0.00080168294,0.0034770004,0.00023708084,0.00071029016,0.0048848097,0.00036077134,0.00013170739],"category_scores_gemma":[0.00009602646,0.000476067,0.00039214085,0.0050935354,0.00059608265,0.00058364164,0.0016170597,0.0007802922,0.00012465134],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027598796,0.000037091515,0.00015583212,0.000011442287,0.00009640253,0.00023998166,0.00020671307,0.027099885,0.00002216335,0.1058492,0.000035497553,0.866243],"study_design_scores_gemma":[0.00015580804,0.00009631777,0.00042473502,0.00007124893,0.00007589892,0.00006976071,7.412014e-8,0.7063438,0.0002572023,0.2882593,0.003530207,0.00071561884],"about_ca_topic_score_codex":0.000034776403,"about_ca_topic_score_gemma":0.00004839496,"teacher_disagreement_score":0.8655274,"about_ca_system_score_codex":0.0002790031,"about_ca_system_score_gemma":0.0003009293,"threshold_uncertainty_score":0.9997691},"labels":[],"label_agreement":null},{"id":"W1884582486","doi":"10.1007/3-540-45995-2_13","title":"Weakly Iterated Block Products of Finite Monoids","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Iterated function; Mathematics; Block (permutation group theory); Operand; Variety (cybernetics); Wreath product; Product (mathematics); Mathematical proof; Associative property; Discrete mathematics; Algebra over a field; Pure mathematics; Arithmetic; Combinatorics","score_opus":0.01492536362326868,"score_gpt":0.21454599110122854,"score_spread":0.19962062747795986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884582486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004759824,0.00094544527,0.99128324,0.0007533595,0.0016316077,0.00038318633,0.000010515926,0.00023723117,0.0042794393],"genre_scores_gemma":[0.6098331,0.0001409032,0.38500124,0.0016164035,0.0007481043,0.0000121179855,0.000009593642,0.00007853157,0.0025599569],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960083,0.000046884437,0.0007024186,0.0016262492,0.00095686276,0.00065929804],"domain_scores_gemma":[0.9965019,0.0004852325,0.00043873055,0.002020939,0.00040990784,0.00014326374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007845542,0.000574478,0.000673535,0.00092322304,0.00015561104,0.0003654076,0.003954803,0.00031558718,0.000037936486],"category_scores_gemma":[0.00015944651,0.00050902856,0.00013133138,0.0011694154,0.0007116317,0.00061250216,0.0012977765,0.00069241406,0.000069889546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013352629,0.0001719176,0.000059412756,0.00024320342,0.00004785985,0.0002582132,0.0027533455,0.052021272,0.0041312184,0.06379042,0.00027204494,0.87623775],"study_design_scores_gemma":[0.00031412998,0.00031646734,0.00010094878,0.0007646073,0.000012764079,0.000101589874,1.2923573e-7,0.8701005,0.019840492,0.10439326,0.003085092,0.00097003294],"about_ca_topic_score_codex":0.000012094853,"about_ca_topic_score_gemma":0.000004153747,"teacher_disagreement_score":0.8752677,"about_ca_system_score_codex":0.00012707699,"about_ca_system_score_gemma":0.00031171629,"threshold_uncertainty_score":0.99973613},"labels":[],"label_agreement":null},{"id":"W1884798717","doi":"10.37236/218","title":"Trees and Meta-Fibonacci Sequences","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fibonacci number; Recursion (computer science); Combinatorics; Mathematics; Interpretation (philosophy); Integer (computer science); Tree (set theory); Constraint (computer-aided design); Discrete mathematics; Algorithm; Computer science","score_opus":0.01110436457372468,"score_gpt":0.23296925799772986,"score_spread":0.22186489342400517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884798717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4904828,0.11040627,0.35375395,0.041494377,0.000833257,0.0002531595,8.324805e-7,0.00015626091,0.0026190802],"genre_scores_gemma":[0.9982116,0.00095061335,0.00016898611,0.0004811513,0.000040396226,5.732248e-7,5.288107e-8,0.0000036264614,0.00014297786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885887,0.00012145188,0.00025978664,0.0001033359,0.00031034986,0.00034619492],"domain_scores_gemma":[0.99916077,0.0001710341,0.0002589224,0.00025992777,0.00008917672,0.000060150036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012714311,0.000118795375,0.0002745753,0.00007312673,0.00012297294,0.00011999638,0.0010590173,0.000033083783,0.000005366494],"category_scores_gemma":[0.000035504043,0.00006450731,0.0001211142,0.0003051539,0.000042704254,0.00043166752,0.000053903164,0.00035410884,0.0000018884934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049382184,0.000034957287,0.00000980836,9.4038e-7,0.00014248875,0.000008508078,0.00017845104,0.000013209149,0.0002865151,0.9942255,0.00021955161,0.0048751403],"study_design_scores_gemma":[0.00023877833,0.0006055422,0.0004831292,0.00000292528,0.00022185242,0.00046223958,0.00003326746,0.00057802105,0.0013086874,0.9937408,0.0022399486,0.000084824904],"about_ca_topic_score_codex":0.0000024209146,"about_ca_topic_score_gemma":0.0000011631896,"teacher_disagreement_score":0.5077288,"about_ca_system_score_codex":0.000062889965,"about_ca_system_score_gemma":0.00016630595,"threshold_uncertainty_score":0.26305318},"labels":[],"label_agreement":null},{"id":"W188877664","doi":"10.1016/s0021-8693(03)00394-6","title":"The finite basis problem for quasivarieties and pseudovarieties generated by regular semigroups","year":2003,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Mathematics; Basis (linear algebra); Pure mathematics; Algebra over a field; Geometry","score_opus":0.006853080843443468,"score_gpt":0.20430173458437226,"score_spread":0.1974486537409288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188877664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13456507,0.01562667,0.8407715,0.007237767,0.00083712465,0.00033945905,0.000010723337,0.00007831567,0.0005333972],"genre_scores_gemma":[0.8386405,0.0018087177,0.15550573,0.0015942998,0.00027128606,0.000028698189,0.0000028603354,0.000047398542,0.0021004726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864995,0.00016230952,0.00045331765,0.00017179773,0.0002876108,0.00027503353],"domain_scores_gemma":[0.9982947,0.00068439974,0.00037717138,0.00028913675,0.00025314066,0.00010143695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016122842,0.00015420074,0.00022941543,0.00006655048,0.00038556938,0.0004993061,0.0005673019,0.00007680116,0.00000703436],"category_scores_gemma":[0.00026178383,0.000097439515,0.000111083,0.00021301514,0.00011898568,0.0005077542,0.00006437986,0.00017800265,0.000001528475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064547494,0.0000911885,0.00024964902,0.000046489193,0.00020690987,0.000013899888,0.0018082121,0.0000889527,0.007950402,0.8790637,0.090722986,0.01969303],"study_design_scores_gemma":[0.0018775453,0.0010173995,0.00023768048,0.00010730542,0.000080131525,0.00061931,0.0010730637,0.0150754955,0.05983078,0.6469766,0.27256244,0.0005422226],"about_ca_topic_score_codex":0.0000034083714,"about_ca_topic_score_gemma":0.0000014901603,"teacher_disagreement_score":0.70407546,"about_ca_system_score_codex":0.0000234337,"about_ca_system_score_gemma":0.0000994035,"threshold_uncertainty_score":0.481482},"labels":[],"label_agreement":null},{"id":"W1894891660","doi":"10.1007/978-3-642-28332-1_42","title":"k-Automatic Sets of Rational Numbers","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decidability; Closure (psychology); Computer science; Set (abstract data type); Rational number; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics; Programming language","score_opus":0.013988133444734424,"score_gpt":0.24152889745235093,"score_spread":0.2275407640076165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894891660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006658439,0.0006990022,0.9931928,0.0003053009,0.0014154273,0.0002288742,0.000006875356,0.00014824279,0.0033376338],"genre_scores_gemma":[0.4876402,0.000032149015,0.51074785,0.0010183126,0.0003424017,0.000007026325,0.000008827554,0.000033146374,0.00017009593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707264,0.00003631973,0.00055329385,0.00080575916,0.0010063866,0.00052561634],"domain_scores_gemma":[0.99756545,0.00055277406,0.00038396328,0.0011891987,0.00015871938,0.00014988641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009969263,0.00038726127,0.00048778666,0.0005480977,0.00012746501,0.00018478479,0.002774145,0.00023353704,0.00014353111],"category_scores_gemma":[0.00006093979,0.00034521913,0.00013867248,0.0004367418,0.0006418852,0.00075054925,0.00096164725,0.0004198941,0.00007758334],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013773135,0.000032751243,0.00006664552,0.00005826276,0.000012516614,0.000015865557,0.0007879031,0.002129524,0.00019864347,0.11496258,0.000040064573,0.88169384],"study_design_scores_gemma":[0.00022994225,0.0000810523,0.0005113403,0.00043148862,0.000010688699,0.00010893619,2.0146125e-7,0.62874985,0.0023100215,0.36624396,0.0007169949,0.00060553214],"about_ca_topic_score_codex":0.000011715357,"about_ca_topic_score_gemma":0.000010889184,"teacher_disagreement_score":0.8810883,"about_ca_system_score_codex":0.00014885211,"about_ca_system_score_gemma":0.00041407818,"threshold_uncertainty_score":0.9999},"labels":[],"label_agreement":null},{"id":"W1916296292","doi":"10.1002/rsa.20707","title":"The graph structure of a deterministic automaton chosen at random","year":2016,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Deterministic automaton; Alphabet; Digraph; Deterministic finite automaton; Two-way deterministic finite automaton; Büchi automaton; Strongly connected component; Automaton","score_opus":0.004889465677345986,"score_gpt":0.21578913220370488,"score_spread":0.2108996665263589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916296292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8482344,0.005073464,0.14178169,0.0012418828,0.001850422,0.0008733993,0.00016643408,0.00036556603,0.00041269689],"genre_scores_gemma":[0.9956208,0.00037214128,0.0036098852,0.00008912555,0.00012013291,0.000007766468,0.0000019140127,0.000015021626,0.00016321207],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983756,0.0001483892,0.00038007682,0.0004051668,0.00032219765,0.00036859527],"domain_scores_gemma":[0.9978803,0.0010961628,0.00022681624,0.0006223452,0.000055125805,0.00011927405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027901863,0.0002504755,0.00040964255,0.000070840026,0.00041315847,0.00013538227,0.0007460752,0.00009770867,0.00003026197],"category_scores_gemma":[0.00010446731,0.00011161503,0.00014663515,0.00016761948,0.0003272654,0.00018556188,0.00031594504,0.00008938413,0.0000016645367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006108747,0.000015395402,0.00032170955,0.000056967834,0.00016917224,0.00003207385,0.0007040192,0.000011047302,0.046794508,0.12186814,0.0006808422,0.82873523],"study_design_scores_gemma":[0.052144818,0.00044932612,0.024509666,0.00028814987,0.0001468236,0.0010862402,0.00013952986,0.032488726,0.09745535,0.7693929,0.020515487,0.0013829455],"about_ca_topic_score_codex":0.000013792353,"about_ca_topic_score_gemma":0.000012331773,"teacher_disagreement_score":0.8273523,"about_ca_system_score_codex":0.000018684905,"about_ca_system_score_gemma":0.00003056855,"threshold_uncertainty_score":0.45515287},"labels":[],"label_agreement":null},{"id":"W1923351770","doi":"10.37236/5583","title":"Words with many Palindrome Pair Factors","year":2015,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Palindrome; Property (philosophy); Conjecture; Mathematics; Class (philosophy); Combinatorics; Word (group theory); Product (mathematics); Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence; Geometry","score_opus":0.013935371001254302,"score_gpt":0.23112483982238996,"score_spread":0.21718946882113566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923351770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.568811,0.00964069,0.41608244,0.0021016363,0.0024495197,0.0002689191,0.0000028087625,0.00013453176,0.0005084384],"genre_scores_gemma":[0.9987909,0.0003793238,0.00018128239,0.000089571666,0.00017158352,0.000004001858,0.000002197686,0.00003761706,0.00034352436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967852,0.00034851834,0.0006214979,0.00030996464,0.0011093792,0.00082543463],"domain_scores_gemma":[0.99658835,0.0002651255,0.00124878,0.0012104829,0.00048985117,0.00019738924],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002927855,0.0004215525,0.0006763241,0.00021951062,0.00013557782,0.0002947223,0.004501489,0.0002244572,0.0000066834473],"category_scores_gemma":[0.00007096004,0.00023687663,0.00025793753,0.0005140296,0.000099445475,0.00030315344,0.00097399304,0.0028875356,0.000007949472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046990317,0.00020332818,0.000532307,0.00003844828,0.00040526214,0.00008493295,0.001839669,0.00072484114,0.000012634616,0.9930216,0.0017948666,0.0012951134],"study_design_scores_gemma":[0.0007013665,0.0009437081,0.0004011835,0.00015861512,0.00009952671,0.00047216713,0.0001953807,0.0021443688,0.00028696374,0.9895667,0.004659923,0.0003701221],"about_ca_topic_score_codex":0.000013301227,"about_ca_topic_score_gemma":0.0000024462931,"teacher_disagreement_score":0.42997986,"about_ca_system_score_codex":0.00075008394,"about_ca_system_score_gemma":0.0023309004,"threshold_uncertainty_score":0.99941283},"labels":[],"label_agreement":null},{"id":"W1927155547","doi":"10.1051/ita/2017004","title":"Interval exchanges, admissibility and branching Rauzy induction","year":2017,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Branching (polymer chemistry); Interval (graph theory); Mathematics; Mathematical economics; Chemistry; Combinatorics; Organic chemistry","score_opus":0.01511514287224976,"score_gpt":0.27387760225122476,"score_spread":0.258762459378975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927155547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118768536,0.00009938651,0.8705052,0.0016641385,0.00006833515,0.0003086741,0.0000099268245,0.00011907133,0.0084567005],"genre_scores_gemma":[0.97674555,0.0000805023,0.022683531,0.00031828298,0.00007771022,0.00005563242,0.0000044488806,0.0000051324528,0.000029218372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992644,0.000022367049,0.00026511916,0.00016156016,0.00011390575,0.00017263368],"domain_scores_gemma":[0.99878633,0.00010270147,0.00014515471,0.000771531,0.000034602563,0.00015965616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050779566,0.00011380239,0.00014119862,0.000039492104,0.00065557315,0.0006342535,0.00050958025,0.00007008232,0.000017949213],"category_scores_gemma":[0.00007373425,0.0000924456,0.000030345434,0.000048606704,0.00053244736,0.00069517654,0.0005164509,0.00015095332,0.000012165693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016801121,0.000017938575,0.000074120275,0.000029821136,0.000004688283,1.215031e-7,0.00056845794,6.439007e-7,0.00004892625,0.81590986,0.000033680568,0.18331006],"study_design_scores_gemma":[0.00032266325,0.0000460847,0.0053833663,0.000043617183,0.0000134772035,0.000038627008,0.00027028355,0.15985578,0.0003811594,0.82749045,0.005930897,0.0002235673],"about_ca_topic_score_codex":0.0000052782316,"about_ca_topic_score_gemma":0.0000011050953,"teacher_disagreement_score":0.85797703,"about_ca_system_score_codex":0.0000112790585,"about_ca_system_score_gemma":0.000015096835,"threshold_uncertainty_score":0.61161214},"labels":[],"label_agreement":null},{"id":"W193481530","doi":"10.1007/978-3-642-19391-0_5","title":"On Language Decompositions and Primality","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Concatenation (mathematics); Computer science; Primality test; Formal language; Prime (order theory); Abstract family of languages; Regular language; Inverse; Theoretical computer science; Algorithm; Arithmetic; Mathematics; Programming language; Combinatorics; Second-generation programming language; Fifth-generation programming language; Automaton","score_opus":0.012018288405341882,"score_gpt":0.23968593960206275,"score_spread":0.22766765119672086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193481530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011828393,0.00042836793,0.988022,0.0002993447,0.00062004325,0.00019541863,0.0000070140595,0.00018561688,0.009059298],"genre_scores_gemma":[0.65015805,0.000054210683,0.34480292,0.004241034,0.00028819605,0.000009606064,0.0000068392596,0.00003906918,0.00040008003],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775535,0.000031126303,0.00027464214,0.0010978266,0.0004366866,0.0004043671],"domain_scores_gemma":[0.9980858,0.0004174551,0.00014268562,0.0011456759,0.00006132023,0.0001470932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005733319,0.00035174598,0.00032777232,0.00044427617,0.00021244927,0.0003222367,0.0017935073,0.00018731675,0.00003804054],"category_scores_gemma":[0.000036090973,0.0003049156,0.00007248927,0.00022529048,0.0005421909,0.00035660889,0.0009867218,0.00050076685,0.000050917613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004462147,0.00003452298,0.000016584747,0.000020629224,0.00000713805,0.00009659588,0.0013078961,0.00029222702,0.00020018099,0.42524123,0.00002006725,0.57275844],"study_design_scores_gemma":[0.00022548367,0.00023669438,0.0005889433,0.00035448853,0.000007420676,0.00012568063,1.5934587e-7,0.054731134,0.0024154175,0.9403587,0.00030278382,0.0006530814],"about_ca_topic_score_codex":0.000024877741,"about_ca_topic_score_gemma":0.0000225544,"teacher_disagreement_score":0.6489752,"about_ca_system_score_codex":0.000105371095,"about_ca_system_score_gemma":0.00014342339,"threshold_uncertainty_score":0.9999403},"labels":[],"label_agreement":null},{"id":"W1938002898","doi":"10.5555/1231159.1231161","title":"Automata Recognizing No Words: A Statistical Approach","year":2006,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Deterministic finite automaton; Word (group theory); Mathematics; Nondeterministic finite automaton; Deterministic automaton; Probabilistic automaton; Automaton; Discrete mathematics; Probabilistic logic; Finite-state machine; Alphabet; Combinatorics; Algorithm; Computer science; Theoretical computer science; Automata theory; Statistics","score_opus":0.010080715382548922,"score_gpt":0.21558706600859373,"score_spread":0.2055063506260448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1938002898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014510105,0.000033778073,0.8069793,0.0001252161,0.00016595295,0.00006947443,0.00000369476,0.0006826091,0.19048895],"genre_scores_gemma":[0.24924725,0.0000020337427,0.7473288,0.00040932326,0.00014805162,0.000013262565,0.000017034085,0.000010756723,0.0028234664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988444,0.000052099393,0.0002028641,0.00037760695,0.00021644792,0.00030661124],"domain_scores_gemma":[0.99922794,0.00014534354,0.000039071077,0.00049047836,0.000033607666,0.00006354535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031499894,0.00011900712,0.00013297994,0.000058668735,0.000085282714,0.0002306703,0.0006392093,0.000046057827,0.000122073],"category_scores_gemma":[0.00003524417,0.00009628284,0.00003504608,0.00022823959,0.00004023229,0.00034355462,0.00022768337,0.00009076479,0.0006408453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023700543,0.00012924882,0.00008937566,0.00001288602,0.000005575166,0.000016316815,0.000050854956,0.000015193315,0.0002441206,0.91472065,0.029228738,0.05548468],"study_design_scores_gemma":[0.00043394457,0.00005310554,0.0027765625,0.00001575321,0.00000541638,0.000059267077,0.0000375019,0.89889586,0.0003820752,0.08153068,0.015444705,0.00036511375],"about_ca_topic_score_codex":0.00012934204,"about_ca_topic_score_gemma":0.0000031812585,"teacher_disagreement_score":0.89888066,"about_ca_system_score_codex":0.000021395239,"about_ca_system_score_gemma":0.000029877225,"threshold_uncertainty_score":0.8236983},"labels":[],"label_agreement":null},{"id":"W194250784","doi":"10.1007/978-0-387-21652-2_3","title":"Pisot and Salem Numbers","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Integer (computer science); Algebraic number; Class (philosophy); Combinatorics; Conjugate; Monic polynomial; Discrete mathematics; Polynomial; Computer science; Mathematical analysis","score_opus":0.013497119671924209,"score_gpt":0.18868054042207846,"score_spread":0.17518342075015425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194250784","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008830012,0.0006155346,0.019980006,0.00032189034,0.00021462303,0.00007093195,0.000002961614,0.00029842035,0.9784868],"genre_scores_gemma":[0.0009200537,0.00032346393,0.009602556,0.00094622263,0.0000975989,0.0000015619561,0.000002177297,0.000022506205,0.98808384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991246,0.0000057707202,0.00014937202,0.00039273227,0.0001682754,0.00015926789],"domain_scores_gemma":[0.9992501,0.00006161316,0.00006588387,0.0005189028,0.0000174512,0.000086063126],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000085104446,0.00020239005,0.00019771764,0.00006952529,0.00005035462,0.00012633676,0.00048959634,0.00015157575,0.0011995394],"category_scores_gemma":[0.000002623876,0.00017225159,0.00006257727,0.000016286227,0.000060176506,0.00015334868,0.0002840336,0.00015124617,0.0006580953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.6608717e-7,0.000002651489,0.0000020115417,0.000007846579,0.000012122859,0.000021909964,0.000052301784,1.19089606e-7,0.0000024021238,0.9400744,0.017221006,0.042602956],"study_design_scores_gemma":[0.0001422415,0.00003670999,0.000020992016,0.00006634489,0.00000951286,0.000091690774,0.0000028727645,0.0028286085,0.000018700432,0.27032697,0.7260359,0.00041943902],"about_ca_topic_score_codex":0.0000086164755,"about_ca_topic_score_gemma":0.0000031820025,"teacher_disagreement_score":0.7088149,"about_ca_system_score_codex":0.000015931217,"about_ca_system_score_gemma":0.000010591066,"threshold_uncertainty_score":0.9997135},"labels":[],"label_agreement":null},{"id":"W1943597037","doi":"10.3233/fi-2012-670","title":"State Complexity of Combined Operations with Union, Intersection, Star and Reversal","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Intersection (aeronautics); Star (game theory); State (computer science); Regular language; Mathematics; Combined operations; Computer science; Discrete mathematics; Combinatorics; Algorithm; Theoretical computer science; Automaton; Political science; Engineering","score_opus":0.019345864440645868,"score_gpt":0.23070205014580658,"score_spread":0.2113561857051607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943597037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80817986,0.00001941906,0.18977731,0.0003871201,0.00014785856,0.0001872426,0.000016733753,0.00008126486,0.0012031879],"genre_scores_gemma":[0.96863925,0.000005522299,0.030906996,0.00034866095,0.000010434765,0.00000735028,0.000013264282,0.0000039238907,0.0000645935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925095,0.000043800283,0.00027583283,0.000073437084,0.00016178329,0.00019422334],"domain_scores_gemma":[0.9994376,0.0000370129,0.0000815362,0.0002846658,0.00005808493,0.0001011003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035070186,0.00009614957,0.000135539,0.00007599552,0.000118487456,0.000094285286,0.00022788813,0.000017867173,0.0000504417],"category_scores_gemma":[0.000010853983,0.00007396863,0.000017034072,0.00017959463,0.00018632195,0.0018538296,0.00018021833,0.00007102406,0.000020508101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008529065,0.00044804846,0.019357873,0.00027107756,0.00020270563,0.000001364693,0.055099163,0.0001811028,0.0011715246,0.9098322,0.0037926827,0.009556958],"study_design_scores_gemma":[0.010760406,0.0045990106,0.34133312,0.00077584665,0.00014125102,0.0003672018,0.02384539,0.53434885,0.025328135,0.03203844,0.024114288,0.0023480477],"about_ca_topic_score_codex":0.00007235669,"about_ca_topic_score_gemma":0.00002236798,"teacher_disagreement_score":0.8777938,"about_ca_system_score_codex":0.000035504603,"about_ca_system_score_gemma":0.000027776283,"threshold_uncertainty_score":0.30163532},"labels":[],"label_agreement":null},{"id":"W1947634890","doi":"10.37236/5483","title":"Avoidability Index for Binary Patterns with Reversal","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Universities Space Research Association","keywords":"Index (typography); Binary number; Mathematics; Computer science; World Wide Web; Arithmetic","score_opus":0.007817291661901503,"score_gpt":0.23007325315529695,"score_spread":0.22225596149339544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1947634890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15617797,0.0015934301,0.8366438,0.0037162558,0.0012906431,0.00042277627,0.000008630678,0.000053344676,0.000093113915],"genre_scores_gemma":[0.99890494,0.00033426948,0.00014554571,0.00014558171,0.00025763724,0.000022098717,0.0000012895575,0.00003069003,0.00015791845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743265,0.00028815272,0.0005782856,0.0003453533,0.00061751145,0.000738041],"domain_scores_gemma":[0.9964358,0.0006756604,0.0011271969,0.0011577825,0.00049624615,0.00010730517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029451768,0.0003270903,0.00053820084,0.00014651456,0.00016881774,0.00015792777,0.0034619628,0.00019853722,0.0000054828774],"category_scores_gemma":[0.000094603085,0.00017293292,0.00030555518,0.00020625586,0.00009218165,0.00029392625,0.0007817279,0.0015272293,0.0000022025717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025929368,0.000267193,0.0014364097,0.00015006548,0.0003588656,0.000023005798,0.00042589396,0.00016958635,0.00008230736,0.9918585,0.0011920913,0.0037767943],"study_design_scores_gemma":[0.0012046268,0.0011844978,0.0010824292,0.00027738302,0.00007142211,0.00017074794,0.000035945483,0.0021106766,0.0004734279,0.9914491,0.0016543731,0.00028532973],"about_ca_topic_score_codex":0.000006373114,"about_ca_topic_score_gemma":0.0000032877665,"teacher_disagreement_score":0.842727,"about_ca_system_score_codex":0.0006945605,"about_ca_system_score_gemma":0.0017264943,"threshold_uncertainty_score":0.7052},"labels":[],"label_agreement":null},{"id":"W1953189605","doi":"10.1023/a:1025712521140","title":"Undecidability of the Free Adjoint Construction","year":2003,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Saint Mary's University","funders":"","keywords":"Undecidable problem; Abacus (architecture); Halting problem; Equivalence relation; Relation (database); Mathematics; Theory of computation; Equivalence (formal languages); Discrete mathematics; Combinatorics; Computer science; Decidability; Algorithm","score_opus":0.007395653299448827,"score_gpt":0.19286012096342933,"score_spread":0.1854644676639805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953189605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19491354,0.00011897308,0.77627015,0.00048787118,0.0012037917,0.0004325481,0.000003085038,0.00020051039,0.026369529],"genre_scores_gemma":[0.9915257,0.0000019325566,0.008242584,0.0001742446,0.000028554725,0.000010046888,4.7342394e-7,0.000005371043,0.000011071241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988893,0.00007709727,0.00024424584,0.00029987964,0.00028938302,0.00020007935],"domain_scores_gemma":[0.99862343,0.00012975236,0.000121513236,0.0010321216,0.00003464719,0.000058514204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019461886,0.00012706856,0.0001715329,0.000026383135,0.00012272011,0.000041178748,0.0010062727,0.00008375021,0.00006794806],"category_scores_gemma":[0.000107693115,0.00007705168,0.00008661631,0.00039329514,0.00021625086,0.00006670656,0.00023346633,0.00016163276,0.000004262519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024939086,0.000013092914,0.0002872505,0.0000063037182,0.00000797309,3.05649e-7,0.00006776239,0.000060479633,0.0035423147,0.9858996,0.00027406975,0.009838302],"study_design_scores_gemma":[0.00020199463,0.0000111427,0.013129895,3.8374608e-7,0.0000053996623,0.000020264715,0.000055494667,0.00011787158,0.04476125,0.9407144,0.0008867156,0.00009516151],"about_ca_topic_score_codex":0.000019077428,"about_ca_topic_score_gemma":0.0000032700657,"teacher_disagreement_score":0.7966122,"about_ca_system_score_codex":0.000048191734,"about_ca_system_score_gemma":0.00005831304,"threshold_uncertainty_score":0.3142076},"labels":[],"label_agreement":null},{"id":"W1960513303","doi":"10.1007/978-3-642-39310-5_18","title":"Shortest Repetition-Free Words Accepted by Automata","year":2013,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Repetition (rhetorical device); Automaton; Discrete mathematics; Combinatorics; Upper and lower bounds; Mathematics; Computer science; Arithmetic; Theoretical computer science; Linguistics","score_opus":0.010964330751629505,"score_gpt":0.2452820866756373,"score_spread":0.2343177559240078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960513303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02066504,0.0004988613,0.96944654,0.0035909642,0.003974117,0.000600592,0.00003205867,0.0010045035,0.0001873381],"genre_scores_gemma":[0.62364304,0.000041819872,0.37383568,0.0020031026,0.00033888945,0.00007416887,0.000029738154,0.000027732762,0.0000057928655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99381304,0.00018410565,0.0007728143,0.0026933723,0.0013849448,0.0011517295],"domain_scores_gemma":[0.992787,0.0006413925,0.00039095883,0.0056036147,0.00026202225,0.00031502062],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015572973,0.0007125015,0.00067224907,0.0007135857,0.00033728586,0.0025822383,0.014159046,0.00046661778,0.00011486397],"category_scores_gemma":[0.00044992377,0.0006454864,0.00017869103,0.002247863,0.0007638433,0.0013348818,0.01369022,0.0013795419,0.00009833783],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004120414,0.00026642266,0.00054439716,0.00008540411,0.000022936523,0.000075533935,0.0015047067,0.033493344,0.0017490537,0.0029387276,0.0033688361,0.9559465],"study_design_scores_gemma":[0.0003018566,0.00007191214,0.0016069002,0.0003234013,0.0000057311236,0.000049449834,6.887777e-7,0.84282345,0.004733683,0.14908491,0.00022365795,0.0007743727],"about_ca_topic_score_codex":0.0002493674,"about_ca_topic_score_gemma":0.00003412887,"teacher_disagreement_score":0.9551721,"about_ca_system_score_codex":0.0003443689,"about_ca_system_score_gemma":0.0006323516,"threshold_uncertainty_score":0.99959964},"labels":[],"label_agreement":null},{"id":"W196301943","doi":"10.1007/978-3-642-39310-5_16","title":"Syntactic Complexity of ${\\mathcal R}$ - and ${\\mathcal J}$ -Trivial Regular Languages","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cardinality (data modeling); Class (philosophy); Complexity class; Regular language; Discrete mathematics; Computer science; Combinatorics; Function (biology); Mathematics; Time complexity; Theoretical computer science; Artificial intelligence; Automaton","score_opus":0.019651194461230665,"score_gpt":0.24759844860240657,"score_spread":0.2279472541411759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196301943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004878031,0.001022825,0.9901007,0.00077607203,0.00073982857,0.00038127974,0.000011811421,0.0001758552,0.0019136191],"genre_scores_gemma":[0.67367536,0.00006371833,0.324882,0.0006625253,0.00040190772,0.000008348925,0.000006034076,0.000041670453,0.00025843247],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965589,0.0000652752,0.0005892716,0.0012871809,0.0009061753,0.0005931931],"domain_scores_gemma":[0.9972562,0.0005986898,0.00037336367,0.0013947902,0.0001701209,0.00020684312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083740306,0.0005208197,0.0007655868,0.0005773811,0.00017969614,0.00039827463,0.0025239016,0.00034650357,0.0000619412],"category_scores_gemma":[0.000114139606,0.00044794165,0.00013478966,0.0003665121,0.002116049,0.0007042228,0.0017678039,0.0006495967,0.000038590417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008807646,0.000058028912,0.000071916016,0.00016184934,0.000027292203,0.00012710338,0.00093119225,0.00034574803,0.0013463696,0.43851212,0.000048045462,0.55836153],"study_design_scores_gemma":[0.00042421522,0.00027264678,0.0011969866,0.0006652078,0.000019927182,0.00035254238,0.0000013480246,0.35933578,0.004232568,0.6321529,0.00044911224,0.00089673937],"about_ca_topic_score_codex":0.00009606558,"about_ca_topic_score_gemma":0.00003046147,"teacher_disagreement_score":0.6687973,"about_ca_system_score_codex":0.000115255134,"about_ca_system_score_gemma":0.00023888258,"threshold_uncertainty_score":0.9997972},"labels":[],"label_agreement":null},{"id":"W1963731267","doi":"10.1016/j.tcs.2009.09.037","title":"On a special class of primitive words","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Class (philosophy); Mathematics; Algebra over a field; Computer science; Linguistics; Combinatorics; Pure mathematics; Artificial intelligence; Philosophy","score_opus":0.007007482571960792,"score_gpt":0.2378683292514425,"score_spread":0.2308608466794817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963731267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10666211,0.000007640523,0.85265243,0.0011835241,0.0006205625,0.00012085478,0.0000013482249,0.00014660203,0.038604897],"genre_scores_gemma":[0.9483996,0.0000014999757,0.049559806,0.0016754924,0.0003498178,0.0000011884866,2.465904e-7,0.0000036088431,0.000008755367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778104,0.00008926036,0.00026991047,0.0006057144,0.00077567366,0.00047837605],"domain_scores_gemma":[0.99844456,0.00032760363,0.00008793807,0.0008243344,0.000121431745,0.00019415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010826553,0.00016875727,0.00023642852,0.00021006675,0.00018039506,0.00018400415,0.0025545647,0.000047915706,0.00006011049],"category_scores_gemma":[0.000099015066,0.00013144338,0.000083878665,0.0011094607,0.0018808283,0.00043978874,0.000422416,0.0001783085,0.00006600326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014445943,0.00010421056,0.0000025528066,0.0000014020189,0.0000015261215,0.0000098168985,0.0004364284,0.000047074802,0.0008417547,0.88295525,0.0001098036,0.11547576],"study_design_scores_gemma":[0.00023731674,0.0008385378,0.002133367,0.000047669626,0.000002366968,0.000017792287,0.000006309588,0.17519182,0.014562942,0.8066954,0.00007621372,0.0001902329],"about_ca_topic_score_codex":4.5537777e-7,"about_ca_topic_score_gemma":6.4940274e-8,"teacher_disagreement_score":0.84173745,"about_ca_system_score_codex":0.000049387207,"about_ca_system_score_gemma":0.000105666804,"threshold_uncertainty_score":0.692999},"labels":[],"label_agreement":null},{"id":"W1964707275","doi":"10.4204/eptcs.63.29","title":"The Critical Exponent is Computable for Automatic Sequences","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Tulane University","keywords":"Exponent; Infimum and supremum; Critical exponent; Mathematics; Constant (computer programming); Computation; Sequence (biology); Rational number; Discrete mathematics; Combinatorics; Computer science; Algorithm; Geometry","score_opus":0.013787653203243074,"score_gpt":0.2557944034789316,"score_spread":0.24200675027568855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964707275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058606204,0.00032528315,0.9335961,0.0033795168,0.0006404557,0.0005513324,0.000001021356,0.0003841674,0.0025159179],"genre_scores_gemma":[0.8931097,0.000021318743,0.10578585,0.00087118725,0.00008669771,0.00010356911,1.397167e-7,0.000012777717,0.000008812407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959944,0.000038043312,0.0004972695,0.0009880112,0.00069890684,0.0017834022],"domain_scores_gemma":[0.99811953,0.0007790917,0.00010609006,0.00048126368,0.0002932678,0.00022076422],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00411149,0.00027651634,0.00027973435,0.00019701892,0.0009718986,0.0008605607,0.0046542077,0.000078770194,0.000025991387],"category_scores_gemma":[0.00036542868,0.00018970566,0.000102794955,0.0013653118,0.0032475074,0.0012305839,0.0009185738,0.0003695397,0.000024398183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010311322,0.00007303542,0.000072283416,0.00001809917,0.00000480987,0.0000021139156,0.0016187677,0.000002189951,0.00020818377,0.9711426,0.000124576,0.026723063],"study_design_scores_gemma":[0.00014240421,0.00030296558,0.00018844244,0.00003627658,0.0000027567357,0.000039482307,0.000035592537,0.45447037,0.006285405,0.53809595,0.00022570966,0.00017462397],"about_ca_topic_score_codex":0.0000055935852,"about_ca_topic_score_gemma":8.028891e-7,"teacher_disagreement_score":0.8345035,"about_ca_system_score_codex":0.00024450026,"about_ca_system_score_gemma":0.00035688403,"threshold_uncertainty_score":0.9994651},"labels":[],"label_agreement":null},{"id":"W1964943343","doi":"10.1016/j.tcs.2004.12.024","title":"The Thue–Morse word contains circular <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>5</mml:mn><mml:mo>/</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msup></mml:math> power free words of every length","year":2005,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Word (group theory); Morse code; Mathematics; Scroll; Computer science; Geometry; Theology; Philosophy","score_opus":0.012849458332719037,"score_gpt":0.23156772215589969,"score_spread":0.21871826382318066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964943343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75552547,0.0026321318,0.03493507,0.0028721548,0.0062834765,0.00018652363,0.00048782225,0.00077167986,0.19630565],"genre_scores_gemma":[0.9783744,0.0009569347,0.011797578,0.0040680435,0.0029197459,0.00065680395,0.00026973448,0.00070549315,0.00025124793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9801861,0.0012510766,0.0033004736,0.004095531,0.0060749943,0.0050918427],"domain_scores_gemma":[0.9841675,0.0045141694,0.0026885306,0.005781773,0.0005770635,0.002270937],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.0073251873,0.001765839,0.00086531136,0.0009276203,0.00382525,0.004416766,0.010510419,0.0025357201,0.062206455],"category_scores_gemma":[0.0027967552,0.0026097768,0.0027928413,0.0033188644,0.010839832,0.0037491561,0.008562696,0.0031573968,0.0026791203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012020142,0.0006933162,0.000013195262,0.00056335516,0.001049556,0.0013517865,0.0042206245,0.0021244364,0.0022288433,0.9141551,0.060959417,0.011438303],"study_design_scores_gemma":[0.002332357,0.0023698187,0.00017836322,0.0013637794,0.00087187864,0.0022607818,0.001293427,0.5466937,0.43232977,0.0033498714,0.004616989,0.0023392509],"about_ca_topic_score_codex":0.0007417898,"about_ca_topic_score_gemma":0.00031360652,"teacher_disagreement_score":0.9108053,"about_ca_system_score_codex":0.000074693,"about_ca_system_score_gemma":0.0029739921,"threshold_uncertainty_score":0.99950874},"labels":[],"label_agreement":null},{"id":"W1965168466","doi":"10.1007/s002330010136","title":"Absolutely annihilator-flat monoids","year":2002,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Annihilator; Mathematics; Monoid; Flatness (cosmology); Pure mathematics; Ideal (ethics); Combinatorics; Algebra over a field; Philosophy; Physics","score_opus":0.013389941409006364,"score_gpt":0.20266833429842615,"score_spread":0.18927839288941978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965168466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25414795,0.016561335,0.47750387,0.029991645,0.0057238536,0.0011538275,0.000046689678,0.006419675,0.20845117],"genre_scores_gemma":[0.98022455,0.000102655344,0.009616624,0.0028594697,0.0001873691,0.000023129733,0.000004306974,0.000034252484,0.0069476375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99795246,0.000047441066,0.00031121622,0.00057135185,0.0003523663,0.00076517096],"domain_scores_gemma":[0.9984652,0.00008670966,0.00010235495,0.001097928,0.00004219041,0.00020563173],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024907698,0.00026146264,0.00024432482,0.0001361348,0.0002377442,0.00022680065,0.0013970269,0.00013791177,0.00030301325],"category_scores_gemma":[0.000026883,0.00024054565,0.00021523552,0.0004950675,0.00006867004,0.00094308297,0.00045480893,0.00022351195,0.0015209413],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076165866,0.00018436655,0.002205734,0.000028708093,0.000086654814,0.00012836291,0.0017782468,0.000048114252,0.006424782,0.41820863,0.39356104,0.17733775],"study_design_scores_gemma":[0.0012962039,0.00035348124,0.0027351556,0.000090752736,0.000025840516,0.00025030057,0.0003079703,0.37742317,0.010501048,0.056904353,0.5486128,0.0014989385],"about_ca_topic_score_codex":0.000021383968,"about_ca_topic_score_gemma":0.0000068606746,"teacher_disagreement_score":0.7260766,"about_ca_system_score_codex":0.00005593248,"about_ca_system_score_gemma":0.000011610331,"threshold_uncertainty_score":0.9992565},"labels":[],"label_agreement":null},{"id":"W1965205248","doi":"10.1016/j.disc.2007.03.009","title":"p-adic valuations and k-regular sequences","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016861409466790607,"score_gpt":0.26977123419743393,"score_spread":0.25290982473064333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965205248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111105554,0.00023287644,0.8823076,0.0004439069,0.00011068585,0.00010688136,0.0000020343173,0.00015513973,0.0055353413],"genre_scores_gemma":[0.73506635,0.000016511813,0.26430196,0.0002270054,0.000055844495,0.000005314624,0.0000024737465,0.000009607716,0.00031493435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991714,0.000018582283,0.00020372593,0.00017730956,0.00022582045,0.00020319952],"domain_scores_gemma":[0.9992459,0.0001857564,0.00007527816,0.00038562837,0.000030354293,0.000077127566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008724682,0.00009825181,0.000118229254,0.000067678295,0.0001202656,0.00013067461,0.0003727363,0.000037288948,0.000016886695],"category_scores_gemma":[0.000063930165,0.00007766321,0.00003443916,0.00019587029,0.00008356986,0.0002592469,0.00013170902,0.000056570552,0.000034088116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.9194956e-7,0.00002261455,0.00008937609,0.000033306136,0.000011870667,0.000009974209,0.0028911796,0.0000074744116,0.0011480405,0.98600686,0.00019012277,0.00958881],"study_design_scores_gemma":[0.00021878183,0.000053541487,0.0017523695,0.00008444456,0.000021194923,0.0000961022,0.0011065159,0.15088713,0.004358862,0.8399246,0.0011928058,0.00030368846],"about_ca_topic_score_codex":0.0000035446685,"about_ca_topic_score_gemma":0.0000030384444,"teacher_disagreement_score":0.6239608,"about_ca_system_score_codex":0.000012537802,"about_ca_system_score_gemma":0.000017966175,"threshold_uncertainty_score":0.31670138},"labels":[],"label_agreement":null},{"id":"W1965229141","doi":"10.3115/1072228.1072229","title":"Disambiguation of finite-state transducers","year":2002,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Transducer; Computer science; Finite state; State (computer science); Acoustics; Speech recognition; Algorithm; Physics","score_opus":0.01895701556607204,"score_gpt":0.2014175913445515,"score_spread":0.18246057577847946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965229141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074335575,0.000065829205,0.9088709,0.0006861088,0.00011042692,0.000045579673,0.0000013459546,0.00012689063,0.015757358],"genre_scores_gemma":[0.990745,0.000017487604,0.007999808,0.00018760018,0.0000068464924,0.000001598688,4.8215134e-7,0.0000023838645,0.0010387843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995706,0.000018114046,0.000110228,0.000109380584,0.00010436946,0.0000873038],"domain_scores_gemma":[0.99964476,0.00007115145,0.00002858057,0.00021583494,0.000015060439,0.000024606808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009208947,0.000043073404,0.000059472957,0.00003815065,0.00001930325,0.000019998703,0.00026640834,0.000012856928,0.0002759905],"category_scores_gemma":[0.000011618178,0.000035155113,0.000033015087,0.00016433536,0.000020094465,0.00022757768,0.000020096544,0.000023593051,0.00006708748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026821576,0.0001586656,0.00014200147,0.000022735872,0.000017216835,0.0000097504835,0.005934501,0.0013415464,0.0064450265,0.19371755,0.0022802802,0.789928],"study_design_scores_gemma":[0.00028261772,0.000063485815,0.00092115364,0.0000107363585,0.0000027049116,0.0000035703133,0.000042341035,0.9494417,0.027182411,0.0204806,0.0014357516,0.00013296385],"about_ca_topic_score_codex":0.000014136819,"about_ca_topic_score_gemma":0.0000021032959,"teacher_disagreement_score":0.9481001,"about_ca_system_score_codex":0.0000050238345,"about_ca_system_score_gemma":0.0000028677327,"threshold_uncertainty_score":0.30219024},"labels":[],"label_agreement":null},{"id":"W1965233852","doi":"10.1007/s00012-008-2054-4","title":"Centrality in Rees-Sushkevich varieties","year":2008,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Exponent; Center (category theory); Intersection (aeronautics); Discrete mathematics","score_opus":0.012981894218415547,"score_gpt":0.19305694504362014,"score_spread":0.18007505082520459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965233852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9297709,0.0003126272,0.044941362,0.0019454976,0.00044039407,0.00016480965,0.000006227501,0.0005207162,0.021897467],"genre_scores_gemma":[0.99551004,0.00009280334,0.003156311,0.00046937747,0.00003016604,0.0000014154293,0.0000045031115,0.000007124966,0.0007282309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99892503,0.00010179576,0.00015381363,0.00031209513,0.00019777636,0.00030946202],"domain_scores_gemma":[0.9992087,0.0000882165,0.00004886504,0.00054195966,0.000032453267,0.00007982438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001951226,0.000119409306,0.00015119763,0.00011699069,0.00012336764,0.00003979287,0.0007972379,0.000063605876,0.00007558992],"category_scores_gemma":[0.000024834533,0.00011859645,0.000057816593,0.0005312188,0.00010397137,0.0007202673,0.00021180794,0.00012688918,0.000059967755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009498243,0.00008777707,0.0116426125,0.000008235407,0.00001571354,0.0003997964,0.0047277473,0.000029227032,0.00019498702,0.9749964,0.004510471,0.0033775175],"study_design_scores_gemma":[0.0048168683,0.0003646016,0.5378727,0.00013275402,0.000032515476,0.00051372516,0.0023368164,0.035375338,0.011029819,0.26945445,0.13566132,0.002409134],"about_ca_topic_score_codex":0.00058711326,"about_ca_topic_score_gemma":0.000053026684,"teacher_disagreement_score":0.70554197,"about_ca_system_score_codex":0.000070490736,"about_ca_system_score_gemma":0.000071199385,"threshold_uncertainty_score":0.48362228},"labels":[],"label_agreement":null},{"id":"W1965531865","doi":"10.1142/s0129054105003364","title":"RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Acadia University","funders":"","keywords":"Decidability; Unary operation; Mathematics; Regular language; Context (archaeology); Set (abstract data type); Discrete mathematics; Context-free language; Combinatorics; Computer science; Automaton; Theoretical computer science; Programming language; Artificial intelligence; Rule-based machine translation","score_opus":0.01234376465392803,"score_gpt":0.30105796547958724,"score_spread":0.28871420082565924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965531865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5317529,0.00005002341,0.46692026,0.0006779559,0.0004730508,0.000034523502,0.000006340462,0.000006241436,0.00007871905],"genre_scores_gemma":[0.7320655,0.000016595206,0.26782253,0.000028274078,0.000062725085,4.6652465e-7,6.349688e-7,0.0000015478474,0.0000017238218],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99825263,0.000046719328,0.0007095843,0.00015379925,0.00073463115,0.00010261949],"domain_scores_gemma":[0.9968493,0.00036432478,0.0007028544,0.00025892648,0.0017547497,0.000069820715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006965253,0.00007633667,0.00019547186,0.0005223714,0.000071507726,0.00009467403,0.001671576,0.000022985123,0.000010780148],"category_scores_gemma":[0.00015180929,0.000067738416,0.0000808679,0.00059368333,0.00058664323,0.0016209458,0.00027360884,0.00007894742,5.903384e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009869665,0.0015598905,0.019562483,0.000046453915,0.0002412826,0.000010667882,0.005031153,0.012881447,0.09676436,0.40653208,0.0003857677,0.4568857],"study_design_scores_gemma":[0.0016175269,0.0008130339,0.46860865,0.0003821379,0.000036892023,0.00054800534,0.000093294606,0.33942437,0.1312885,0.055979203,0.0009031354,0.0003052276],"about_ca_topic_score_codex":0.00001868025,"about_ca_topic_score_gemma":0.0000054653065,"teacher_disagreement_score":0.4565805,"about_ca_system_score_codex":0.000060451883,"about_ca_system_score_gemma":0.0003836555,"threshold_uncertainty_score":0.3106232},"labels":[],"label_agreement":null},{"id":"W1965900383","doi":"10.1142/s0219498809003631","title":"FINITELY GENERATED LIMIT VARIETIES OF APERIODIC MONOIDS WITH CENTRAL IDEMPOTENTS","year":2009,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Aperiodic graph; Mathematics; Variety (cybernetics); Limit (mathematics); Finitely-generated abelian group; Pure mathematics; Monoid; Combinatorics; Mathematical analysis","score_opus":0.008782462088680417,"score_gpt":0.21014792739494234,"score_spread":0.20136546530626193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965900383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74170965,0.0018344222,0.25408733,0.0019065646,0.000040259747,0.00013167766,0.0000037380407,0.000026135755,0.00026024898],"genre_scores_gemma":[0.98938966,0.0003255278,0.00982715,0.00034602097,0.00006460541,0.0000030629988,0.0000011595846,0.0000037956506,0.000039026298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992494,0.000023082053,0.00030278403,0.00011179812,0.00017623072,0.00013672421],"domain_scores_gemma":[0.99924016,0.00004652456,0.00027270083,0.00016771333,0.00016964832,0.000103257255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013507804,0.00008692789,0.00016899672,0.000088618996,0.0000952688,0.00007835148,0.00035507424,0.000038783113,0.0000070620586],"category_scores_gemma":[0.0000110357205,0.00006221011,0.000041864998,0.00027755336,0.000036181475,0.00034713346,0.000027670809,0.000108074026,0.0000019989852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006490115,0.0005606479,0.00084788515,0.000033744087,0.00012973901,0.000015097986,0.0021852304,0.0004559971,0.053589307,0.83152753,0.0010601861,0.109529756],"study_design_scores_gemma":[0.00569747,0.0063327807,0.42470482,0.00046493943,0.00038074213,0.0017533381,0.0010382108,0.09208049,0.12973271,0.30621165,0.02996892,0.0016339137],"about_ca_topic_score_codex":0.0000012547864,"about_ca_topic_score_gemma":2.7921251e-7,"teacher_disagreement_score":0.5253158,"about_ca_system_score_codex":0.000009523424,"about_ca_system_score_gemma":0.00007189565,"threshold_uncertainty_score":0.25368544},"labels":[],"label_agreement":null},{"id":"W1966076725","doi":"10.4204/eptcs.31.21","title":"Nondeterministic State Complexity for Suffix-Free Regular Languages","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Deterministic finite automaton; Catenation; Regular language; Suffix; Upper and lower bounds; Discrete mathematics; Computer science; State (computer science); String (physics); Intersection (aeronautics); Automaton; Mathematics; Theoretical computer science; Algorithm; Automata theory","score_opus":0.006249754356745859,"score_gpt":0.2532547907464555,"score_spread":0.24700503638970966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966076725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37489903,0.00004127393,0.6203756,0.0014428825,0.0004974168,0.0004896202,0.0000052909872,0.0003829516,0.0018659421],"genre_scores_gemma":[0.8810781,0.0000036439083,0.11821585,0.00046067254,0.00015638054,0.000047990998,0.0000010292034,0.000016996777,0.000019311976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996326,0.000021253587,0.0004003629,0.0011169285,0.00062305795,0.0015123846],"domain_scores_gemma":[0.99825525,0.00030844865,0.00013044215,0.00081433926,0.00024977958,0.00024175567],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0032166557,0.00029261637,0.00032659157,0.00031995802,0.00038140785,0.0007035984,0.0055770613,0.00008983253,0.00001969063],"category_scores_gemma":[0.00054255355,0.00025600728,0.00009209058,0.0012209072,0.0027192943,0.0009312659,0.0013739981,0.000655103,0.000013045512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016200136,0.00007612072,0.00007172394,0.000021415848,0.0000033187584,0.0000050514464,0.00042058487,0.0000028130798,0.008724066,0.9739639,0.00008712539,0.01660766],"study_design_scores_gemma":[0.00044963422,0.00030725353,0.000524415,0.000021406204,0.0000028425143,0.00007450857,0.000011519867,0.28688186,0.014540321,0.6966116,0.0002968615,0.00027776457],"about_ca_topic_score_codex":0.0000041712633,"about_ca_topic_score_gemma":0.0000097754155,"teacher_disagreement_score":0.5061791,"about_ca_system_score_codex":0.00013116864,"about_ca_system_score_gemma":0.00032393445,"threshold_uncertainty_score":0.99999475},"labels":[],"label_agreement":null},{"id":"W1966285206","doi":"10.1016/j.comgeo.2004.12.005","title":"The Erdős–Nagy theorem and its ramifications","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical economics; Law and economics; Mathematics; Economics","score_opus":0.011067270117584294,"score_gpt":0.2451078317531823,"score_spread":0.234040561635598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966285206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12632264,0.0046383543,0.85137254,0.013581253,0.00033304404,0.00019202022,0.000008866375,0.00030561502,0.0032456901],"genre_scores_gemma":[0.9793065,0.00004296806,0.019210448,0.00080239325,0.0001286705,0.000010417105,0.0000068888307,0.00000625951,0.000485454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991344,0.000053770418,0.00017143242,0.00023407971,0.00022526782,0.00018104477],"domain_scores_gemma":[0.9986919,0.0008344328,0.00006417173,0.00024543307,0.00009530437,0.000068761816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040014795,0.00009012609,0.00007336829,0.000092180395,0.00043899266,0.00024038268,0.00057583314,0.000031328025,0.000017950526],"category_scores_gemma":[0.00008562131,0.00006555172,0.000034227745,0.00043781145,0.00007187997,0.00030757632,0.00019374347,0.000093607225,0.0001800196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001158105,0.000019495423,0.000042394506,0.0000020304778,0.000009894972,6.133896e-7,0.00011467886,0.0041903043,0.00004289766,0.8834665,0.0008819198,0.111228116],"study_design_scores_gemma":[0.00017910378,0.000015087273,0.01646139,0.000006106538,0.000003302635,0.000037091908,0.00003859487,0.76926017,0.00013373856,0.18781519,0.02591997,0.00013028437],"about_ca_topic_score_codex":6.6405306e-7,"about_ca_topic_score_gemma":5.941742e-7,"teacher_disagreement_score":0.85298383,"about_ca_system_score_codex":0.000021357419,"about_ca_system_score_gemma":0.000040381536,"threshold_uncertainty_score":0.3376421},"labels":[],"label_agreement":null},{"id":"W1966302050","doi":"10.1007/s00233-003-0008-x","title":"Equalizers and Flatness Properties of Acts, II","year":2004,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Flatness (cosmology); Functor; Homomorphism; Pure mathematics; Morphism; Annihilator; Monoid; Quotient; Commutative property; Torsion (gastropod); Algebra over a field","score_opus":0.011781330185247818,"score_gpt":0.20650251082271578,"score_spread":0.19472118063746796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966302050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94557416,0.0021070018,0.04772661,0.0023927207,0.00029623834,0.00018587055,0.0000035523692,0.00024635895,0.0014675074],"genre_scores_gemma":[0.994634,0.00005260557,0.0046418966,0.00039979364,0.000024326386,0.000008893875,0.0000011871941,0.000011375315,0.0002259521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989121,0.000026216128,0.00022868777,0.000290764,0.00021035461,0.00033188576],"domain_scores_gemma":[0.99931926,0.000021864473,0.00009541868,0.00044365475,0.000037500773,0.00008231509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024576872,0.00014566722,0.00020439242,0.0000809419,0.00016233383,0.00005506791,0.0005421682,0.000068066896,0.0000048960896],"category_scores_gemma":[0.000029937084,0.000115124974,0.00005537412,0.00021949092,0.00013174667,0.0005504595,0.0005253869,0.000086241256,0.000007993458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017585138,0.00011019774,0.00030750767,0.000100640544,0.000032976368,0.0000095375435,0.004272338,0.000089265704,0.13543652,0.84327173,0.00027475695,0.01607694],"study_design_scores_gemma":[0.0027619724,0.0007502434,0.0013691142,0.0007762358,0.000029369867,0.00015608479,0.0024983792,0.00660618,0.7975312,0.17028691,0.016210139,0.0010242041],"about_ca_topic_score_codex":0.000081425744,"about_ca_topic_score_gemma":0.000015346035,"teacher_disagreement_score":0.67298484,"about_ca_system_score_codex":0.000027066557,"about_ca_system_score_gemma":0.000049368067,"threshold_uncertainty_score":0.46946603},"labels":[],"label_agreement":null},{"id":"W1967306786","doi":"10.1016/j.tcs.2005.01.007","title":"Generalised fine and Wilf's theorem for arbitrary number of periods","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Word (group theory); Divisor (algebraic geometry); Combinatorics; Upper and lower bounds; Word length; Greatest common divisor; Discrete mathematics; Computer science; Geometry","score_opus":0.008713460936695415,"score_gpt":0.25609400636327656,"score_spread":0.24738054542658114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967306786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2709786,0.00005595673,0.7252318,0.0015225589,0.00017812329,0.00015783064,0.0000045322877,0.000109224835,0.0017613842],"genre_scores_gemma":[0.6200247,0.0000035891885,0.37920174,0.0006123652,0.00013397455,0.0000068060112,6.388904e-7,0.000006246191,0.000009982446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981535,0.00006813257,0.00030830925,0.00061071396,0.00038914967,0.00047017346],"domain_scores_gemma":[0.99854237,0.00034976014,0.00008388832,0.00068205554,0.00013430644,0.00020764457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001393395,0.0001840492,0.00026267784,0.000097513286,0.0002457608,0.00022615354,0.0016314631,0.000053257478,0.000057341036],"category_scores_gemma":[0.00005659481,0.00014292971,0.000080262645,0.00049477245,0.0027139275,0.00069339486,0.0006983348,0.00010521954,0.000013062728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011540487,0.000047470265,0.00005981379,0.0000113637,0.000003981191,0.0000016820619,0.00040738503,0.000022397584,0.0016776734,0.92228645,0.000055517285,0.07541474],"study_design_scores_gemma":[0.00037773835,0.00011447642,0.00054845365,0.000024140316,0.000005151427,0.00007604809,0.000004604096,0.5695231,0.014520489,0.4142174,0.00039030105,0.00019806296],"about_ca_topic_score_codex":0.0000019850372,"about_ca_topic_score_gemma":3.6338201e-7,"teacher_disagreement_score":0.56950074,"about_ca_system_score_codex":0.000021968455,"about_ca_system_score_gemma":0.00008496801,"threshold_uncertainty_score":0.9999579},"labels":[],"label_agreement":null},{"id":"W1967329424","doi":"10.1016/j.jcta.2009.07.010","title":"Extensions and restrictions of Wythoff's game preserving its <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"script\">P</mml:mi></mml:math> positions","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Fibonacci number; Morphism; Set (abstract data type); Computer science; Word (group theory); Discrete mathematics; Mathematics; Combinatorics; Programming language; Geometry","score_opus":0.013300653658497575,"score_gpt":0.23385288848705402,"score_spread":0.22055223482855643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967329424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98813504,0.00085300073,0.0041810153,0.001025122,0.0032920826,0.000060187656,0.000024626699,0.00009616742,0.0023327381],"genre_scores_gemma":[0.9950398,0.00041012684,0.0034708648,0.00034756536,0.00058808434,0.000012303896,0.0000053333024,0.000036369624,0.00008951629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975789,0.00025154444,0.0007888525,0.00032242385,0.00063195766,0.0004262945],"domain_scores_gemma":[0.9973971,0.0005539735,0.0008447862,0.0007062113,0.00024602187,0.0002518625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013237913,0.000251205,0.00031484704,0.00021163859,0.0005230972,0.0003898059,0.0009092735,0.00026278087,0.00004616735],"category_scores_gemma":[0.0005990387,0.00026616166,0.0003304795,0.00045626372,0.00020395695,0.0017271999,0.00045403544,0.0005071444,0.00002507985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003340062,0.00022847205,0.0000023637383,0.000043674896,0.00012844821,0.00020375676,0.0010442366,0.00015499885,0.008113847,0.9881948,0.0008808548,0.00067054573],"study_design_scores_gemma":[0.0027601314,0.003784367,0.0011257855,0.0011744124,0.0004331363,0.003992425,0.0015525619,0.26266593,0.020647297,0.6943496,0.006772112,0.00074225996],"about_ca_topic_score_codex":0.000023812549,"about_ca_topic_score_gemma":0.0000027472536,"teacher_disagreement_score":0.2938452,"about_ca_system_score_codex":0.000019503852,"about_ca_system_score_gemma":0.00030323685,"threshold_uncertainty_score":0.9999791},"labels":[],"label_agreement":null},{"id":"W1967372194","doi":"10.1016/j.tcs.2007.01.020","title":"On critical exponents in fixed points of non-erasing morphisms","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Morphism; Alphabet; Exponent; Eigenvalues and eigenvectors; Fixed point; Finite field; Degree (music); Combinatorics; Algebraic number; Discrete mathematics; Field (mathematics); Matrix (chemical analysis); Critical exponent; Pure mathematics; Mathematical analysis; Geometry; Scaling","score_opus":0.00930701070768034,"score_gpt":0.27711712124310667,"score_spread":0.2678101105354263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967372194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35948882,0.00000747323,0.63833386,0.00035997355,0.00045344047,0.00007732626,5.749371e-7,0.00005680392,0.0012217324],"genre_scores_gemma":[0.82484025,6.7586296e-7,0.1744444,0.00065873814,0.00004611855,0.0000013959863,2.2824135e-7,0.000006655982,0.0000015435221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971254,0.00009039305,0.00046589487,0.0006908529,0.0008664109,0.0007610406],"domain_scores_gemma":[0.99745643,0.001275682,0.00006700916,0.0008198802,0.00011691217,0.0002640947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038688288,0.00018840832,0.0002749678,0.00045481004,0.00015974547,0.00014827194,0.0022557538,0.00006840658,0.000036898782],"category_scores_gemma":[0.0003471618,0.00015979563,0.00006782463,0.0013451083,0.0024255349,0.00056725007,0.0007953026,0.00024484267,0.000054859884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022238071,0.00016750494,0.0001418661,0.0000076195533,0.0000011732009,0.000058857746,0.0004138983,0.000041734093,0.0063018734,0.9672902,0.000011042386,0.025541984],"study_design_scores_gemma":[0.00039927237,0.00031913482,0.011448901,0.0001645738,0.0000017767669,0.000032122203,0.000012923485,0.37910306,0.05112093,0.55715185,0.000003905645,0.00024151681],"about_ca_topic_score_codex":0.0000051008574,"about_ca_topic_score_gemma":4.9306766e-7,"teacher_disagreement_score":0.46535143,"about_ca_system_score_codex":0.000076348,"about_ca_system_score_gemma":0.0000679557,"threshold_uncertainty_score":0.8936984},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018292456120191078,"score_gpt":0.3058326623659386,"score_spread":0.2875402062457475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967415065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10524296,0.00006296281,0.88720584,0.0013765543,0.005212948,0.000038057286,0.0000017410853,0.00003317929,0.0008257553],"genre_scores_gemma":[0.75172365,0.000012266526,0.24768084,0.00019926573,0.00036572086,6.250648e-7,6.3467724e-7,0.0000029629034,0.0000140368575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777865,0.000044182343,0.0005656846,0.00014852844,0.0012155942,0.00024736082],"domain_scores_gemma":[0.9974961,0.00017230556,0.00061117735,0.0003941491,0.0011691232,0.00015713193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017543515,0.00009864806,0.00016216542,0.00059234095,0.00012471432,0.00041611725,0.00399689,0.000025405843,0.000026708776],"category_scores_gemma":[0.00013501335,0.00008424322,0.000109858185,0.0005937494,0.00034830812,0.0048055723,0.0005564748,0.00011522747,0.000025724668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010681468,0.00049199106,0.002455009,0.000005227435,0.00008727155,0.000010655811,0.0017603956,0.00044017113,0.004479889,0.7546342,0.001041152,0.23458338],"study_design_scores_gemma":[0.0035121122,0.0008298902,0.19222873,0.00048086303,0.000058575995,0.0041392334,0.00017318182,0.5240461,0.05156025,0.17086661,0.051030852,0.0010735512],"about_ca_topic_score_codex":0.0000064196597,"about_ca_topic_score_gemma":4.2887032e-7,"teacher_disagreement_score":0.6464807,"about_ca_system_score_codex":0.0001109977,"about_ca_system_score_gemma":0.00039668015,"threshold_uncertainty_score":0.7427283},"labels":[],"label_agreement":null},{"id":"W1967571653","doi":"10.4204/eptcs.151.10","title":"Maximally Atomic Languages","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quotient; Mathematics; Regular language; Combinatorics; Semigroup; Rank (graph theory); Discrete mathematics; Physics","score_opus":0.002605956503864343,"score_gpt":0.21704787553788799,"score_spread":0.21444191903402365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967571653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29696015,0.00007336809,0.6856353,0.0011146995,0.00019193625,0.00014910074,1.773804e-7,0.0004109047,0.015464357],"genre_scores_gemma":[0.95959115,0.000012162279,0.03923868,0.0009830659,0.00013892566,0.000013550996,2.4071173e-7,0.000012224483,0.000009999809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968207,0.00003496678,0.0003025438,0.00094860164,0.00060930464,0.0012839085],"domain_scores_gemma":[0.9990266,0.00015787152,0.0000839519,0.00043023835,0.000115924035,0.00018540745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032217843,0.00023111155,0.00025011617,0.00038657355,0.00022635904,0.0005740521,0.003697032,0.000071105314,0.000021047525],"category_scores_gemma":[0.00018587665,0.00019686432,0.00005984211,0.0017616488,0.0011633739,0.0010400724,0.0009998527,0.0004206399,0.00007330548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004855099,0.000038087437,0.00023703671,0.0000074038917,0.0000017935944,0.0000025031395,0.00028553364,0.0000063236484,0.0013149048,0.95649344,0.000030998177,0.041577138],"study_design_scores_gemma":[0.00025530654,0.00021707125,0.0009568033,0.0000316119,0.0000015770271,0.00006898239,0.000011482265,0.4480433,0.0059208153,0.5438238,0.00042397136,0.0002453089],"about_ca_topic_score_codex":0.0000034166778,"about_ca_topic_score_gemma":0.0000010223905,"teacher_disagreement_score":0.662631,"about_ca_system_score_codex":0.00021508339,"about_ca_system_score_gemma":0.00017237107,"threshold_uncertainty_score":0.8027894},"labels":[],"label_agreement":null},{"id":"W1968402392","doi":"10.1007/s00233-006-0663-9","title":"Null Extensions and Generalized Inflations of Brandt Semigroups","year":2007,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Carleton University","funders":"","keywords":"Semigroup; Mathematics; Null (SQL); Extension (predicate logic); Associative property; Pure mathematics; Inflation (cosmology); Bicyclic semigroup; Cancellative semigroup; Computer science","score_opus":0.0063943663237523065,"score_gpt":0.23113957568149976,"score_spread":0.22474520935774744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968402392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.670173,0.0012038695,0.32330993,0.0010232726,0.00043790732,0.00024267152,0.000012831095,0.00029801243,0.0032985255],"genre_scores_gemma":[0.968696,0.00009305272,0.029901192,0.0008115704,0.0000736845,0.0000071801187,0.00000951607,0.000019423587,0.00038835764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821854,0.000049858267,0.0004917546,0.00041838698,0.0002943962,0.0005270596],"domain_scores_gemma":[0.9984669,0.00033416614,0.0001831565,0.00072460604,0.000099096695,0.00019208557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078710157,0.00021028653,0.00030284998,0.00022105199,0.00020942932,0.000067559165,0.00054432044,0.00013006423,0.000030861684],"category_scores_gemma":[0.000080315294,0.00018975211,0.000118761316,0.0005316163,0.00013363178,0.0005458425,0.0003910327,0.0001595679,0.000017969389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052965916,0.00019001245,0.011724523,0.0000456762,0.000067454785,0.00004616233,0.0014199938,0.000059605398,0.09517289,0.82635957,0.0055999905,0.059261136],"study_design_scores_gemma":[0.009515871,0.0012867718,0.28338614,0.00068299694,0.00019037463,0.00093225046,0.0023586906,0.117705405,0.1337501,0.33197618,0.11474344,0.0034717696],"about_ca_topic_score_codex":0.00010424155,"about_ca_topic_score_gemma":0.00010645435,"teacher_disagreement_score":0.49438342,"about_ca_system_score_codex":0.000025187928,"about_ca_system_score_gemma":0.000033363507,"threshold_uncertainty_score":0.77378666},"labels":[],"label_agreement":null},{"id":"W1968405302","doi":"10.1016/j.tcs.2008.03.017","title":"On stabilizers of infinite words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Word (group theory); Monoid; Mathematics; Alphabet; Invertible matrix; Combinatorics on words; Free monoid; Characterization (materials science); Discrete mathematics; Pure mathematics; Linguistics","score_opus":0.012084624867511811,"score_gpt":0.2342318309442782,"score_spread":0.2221472060767664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968405302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.357702,0.000014217791,0.63638675,0.00022808785,0.00032829773,0.00007176993,0.0000010072245,0.00014016383,0.0051276986],"genre_scores_gemma":[0.9308144,0.0000054848206,0.0685846,0.00053809525,0.000040406838,0.0000026541813,1.8903498e-7,0.000005859996,0.000008336198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977759,0.00009371626,0.00029322522,0.0005650359,0.0008121852,0.00045994023],"domain_scores_gemma":[0.9979413,0.00057495217,0.00008318273,0.0010644048,0.00012578866,0.00021038497],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010901048,0.00016166731,0.0002282237,0.00023783187,0.00028532755,0.00007600969,0.0026084788,0.000041459327,0.00006695231],"category_scores_gemma":[0.00013055664,0.00012529832,0.00007916982,0.0013548255,0.0044131675,0.00046352978,0.0007684949,0.00016188278,0.00007766176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009131309,0.00007548977,0.000057294474,0.0000038333333,0.0000021505612,0.000014909837,0.00075287465,0.00018509512,0.0006810759,0.9839382,0.000051851308,0.014228101],"study_design_scores_gemma":[0.00038729407,0.0006611347,0.0023327218,0.000051966395,0.000002485331,0.00008854905,0.000010632249,0.38740706,0.021202905,0.5874238,0.000115350165,0.00031613433],"about_ca_topic_score_codex":0.000002125686,"about_ca_topic_score_gemma":7.196892e-8,"teacher_disagreement_score":0.57311237,"about_ca_system_score_codex":0.00003473994,"about_ca_system_score_gemma":0.00014091458,"threshold_uncertainty_score":0.99829626},"labels":[],"label_agreement":null},{"id":"W1968593409","doi":"10.1142/s0129054112400540","title":"DE BRUIJN SEQUENCES REVISITED","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"De Bruijn sequence; Combinatorics; Sequence (biology); Alphabet; Mathematics; Order (exchange); Word (group theory); Integer (computer science); Word length; Discrete mathematics; Computer science; Geometry","score_opus":0.019679544085339343,"score_gpt":0.31379569095218235,"score_spread":0.294116146866843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968593409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10744196,0.00015799797,0.8886831,0.0011413228,0.0019317332,0.000028783385,0.0000014187667,0.000018792052,0.00059490686],"genre_scores_gemma":[0.7499826,0.00001968848,0.24935545,0.00028129327,0.00034764563,4.3314168e-7,3.9620147e-7,0.0000020141474,0.000010460306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982931,0.000052113082,0.00044854014,0.000119360855,0.0008671318,0.00021973703],"domain_scores_gemma":[0.9978526,0.00017123786,0.000508518,0.00024981875,0.0010788258,0.00013899755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020025882,0.00007758915,0.00013211345,0.0005078358,0.000095251446,0.00035567503,0.003163331,0.000020999487,0.000027428901],"category_scores_gemma":[0.00015571732,0.000065364446,0.00008904225,0.0005896131,0.00028867947,0.0036380577,0.00031701956,0.00010174269,0.000011558176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010258205,0.00028172883,0.009005977,0.000007426595,0.000078173485,0.000015577056,0.0021703173,0.0012056169,0.016792893,0.70273894,0.00083773636,0.26685536],"study_design_scores_gemma":[0.0020658204,0.0008114073,0.24406134,0.0009020779,0.000060700182,0.006481129,0.00020469239,0.45418045,0.086545184,0.16762196,0.036037095,0.0010281471],"about_ca_topic_score_codex":0.000007463904,"about_ca_topic_score_gemma":1.873765e-7,"teacher_disagreement_score":0.64254063,"about_ca_system_score_codex":0.00012133778,"about_ca_system_score_gemma":0.00040458312,"threshold_uncertainty_score":0.5878309},"labels":[],"label_agreement":null},{"id":"W1968754294","doi":"10.1142/s012905410500342x","title":"A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Peano axioms; Arithmetic function; Concatenation (mathematics); Mathematics; Second-order arithmetic; Expressive power; Hierarchy; Class (philosophy); Analytical hierarchy; Discrete mathematics; Characterization (materials science); Property (philosophy); Axiom; Order (exchange); Algebra over a field; Arithmetic; Pure mathematics; Computer science; Theoretical computer science; Analytic hierarchy process","score_opus":0.008621856616376914,"score_gpt":0.27510471527781283,"score_spread":0.2664828586614359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968754294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26431763,0.000018825054,0.73068583,0.0040771333,0.00074495235,0.000042492404,0.000008468361,0.000007780967,0.00009686379],"genre_scores_gemma":[0.92605484,0.0000071507907,0.07348254,0.00025740016,0.00016478632,9.135289e-7,0.0000022681859,0.0000026459072,0.00002743718],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981812,0.000055078293,0.000539877,0.0001325611,0.0009784169,0.00011283768],"domain_scores_gemma":[0.9978631,0.00017445497,0.0006097142,0.0003045335,0.0009939553,0.000054238535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077437435,0.0000709874,0.00012327955,0.00032156872,0.00009398692,0.00016918012,0.0029465859,0.000021230871,0.000020703555],"category_scores_gemma":[0.00017002742,0.00005195893,0.00009992533,0.0006323509,0.0003916112,0.0015691916,0.00035342833,0.00010658392,0.000003728165],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008728871,0.0003830571,0.00033215046,0.000004652294,0.00005301203,0.0000019656702,0.002600732,0.00110615,0.47405782,0.24996729,0.00018997044,0.27129444],"study_design_scores_gemma":[0.0009501018,0.0002063887,0.018977491,0.00021076895,0.000021875525,0.00021044478,0.000055134,0.64044625,0.32516032,0.00919125,0.004334153,0.0002357939],"about_ca_topic_score_codex":0.0000051485526,"about_ca_topic_score_gemma":0.0000012800712,"teacher_disagreement_score":0.6617372,"about_ca_system_score_codex":0.00007151508,"about_ca_system_score_gemma":0.0003162503,"threshold_uncertainty_score":0.5475539},"labels":[],"label_agreement":null},{"id":"W1969137001","doi":"10.1090/s0002-9947-03-03333-6","title":"Non-trivial quadratic approximations to zero of a family of cubic Pisot numbers","year":2003,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Zero (linguistics); Combinatorics; Integer (computer science); Quadratic equation; Function (biology); Sequence (biology); Class (philosophy); Polynomial; Cubic function; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.01263798625731895,"score_gpt":0.25271071931063455,"score_spread":0.24007273305331558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969137001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22163925,0.000008165751,0.7768651,0.00023896758,0.000044715798,0.00023466874,0.000009758782,0.000029065506,0.00093031477],"genre_scores_gemma":[0.7724971,0.000004632366,0.22727503,0.00012275144,0.0000031300729,0.000020460036,1.5727049e-7,0.000008905624,0.00006779817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864197,0.00008704488,0.0005085415,0.00019136703,0.0003664726,0.0002046275],"domain_scores_gemma":[0.9984009,0.00034506596,0.00032074703,0.0007694621,0.00008446174,0.00007931525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004001658,0.00013646217,0.0004460816,0.000039987306,0.000098205324,0.000013841313,0.0007785336,0.000034522247,0.000033551038],"category_scores_gemma":[0.000055790864,0.00010002093,0.00048474027,0.0011497646,0.000493814,0.00012626055,0.000028985985,0.0001238707,0.00000985014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045754015,0.0045708087,0.00030607815,0.0015684277,0.00096789363,7.03771e-7,0.04611084,0.009056057,0.2648106,0.6524854,0.0025057981,0.01757169],"study_design_scores_gemma":[0.0019572885,0.001167797,0.003958757,0.0007526284,0.0005432009,0.000049078633,0.01318479,0.22390282,0.2507807,0.5022541,0.0002688713,0.0011799574],"about_ca_topic_score_codex":0.000073248826,"about_ca_topic_score_gemma":0.0000013945233,"teacher_disagreement_score":0.5508579,"about_ca_system_score_codex":0.000030398884,"about_ca_system_score_gemma":0.00008844054,"threshold_uncertainty_score":0.4078735},"labels":[],"label_agreement":null},{"id":"W1969770235","doi":"10.1016/j.tcs.2005.01.004","title":"Pattern avoidance: themes and variations","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Mathematics; Psychology; Artificial intelligence","score_opus":0.00609221224695569,"score_gpt":0.22810185740351413,"score_spread":0.22200964515655844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969770235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027830886,0.0000815842,0.96509826,0.0040340847,0.00024424214,0.00008247797,0.0000012164658,0.00025462732,0.0023726115],"genre_scores_gemma":[0.848543,0.000007996278,0.14956336,0.0016869056,0.00017762954,0.000004383024,2.4756415e-7,0.0000047584927,0.000011712493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983329,0.0000661776,0.00019096726,0.0005697252,0.0004131966,0.00042702095],"domain_scores_gemma":[0.9987742,0.00023642513,0.000045968245,0.0006616026,0.00007711947,0.00020473787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091266166,0.00014134569,0.0001364299,0.0001195292,0.00042966925,0.0005400221,0.0016297876,0.00003488096,0.000054191303],"category_scores_gemma":[0.000041930674,0.00011048779,0.000032868185,0.00055914646,0.0014880196,0.0009477434,0.0009896827,0.00013515119,0.00010093794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.0551284e-7,0.000022372345,0.000042517157,0.0000016531933,0.0000014056728,0.0000016832877,0.00047772264,0.000022796918,0.00025088864,0.72235787,0.000035042303,0.27678555],"study_design_scores_gemma":[0.00013876756,0.000052841406,0.00223518,0.000014007747,0.0000022943427,0.0000444626,0.000005548325,0.77280223,0.0017889892,0.22232182,0.00042597333,0.00016788524],"about_ca_topic_score_codex":0.0000020579018,"about_ca_topic_score_gemma":5.1426645e-7,"teacher_disagreement_score":0.82071215,"about_ca_system_score_codex":0.000029714825,"about_ca_system_score_gemma":0.00005377902,"threshold_uncertainty_score":0.548267},"labels":[],"label_agreement":null},{"id":"W1969781575","doi":"10.1515/integers-2012-0005","title":"On Abelian and Additive Complexity in Infinite Words","year":2012,"lang":"en","type":"article","venue":"Integers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Abelian group; Algebra over a field; Pure mathematics; Discrete mathematics","score_opus":0.03120104898078008,"score_gpt":0.26814006677263424,"score_spread":0.23693901779185417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969781575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9525162,0.00022501606,0.016939523,0.00081186544,0.00057296036,0.00011702987,0.000013604956,0.00015101195,0.028652819],"genre_scores_gemma":[0.9968188,0.0000073223705,0.0021663376,0.0009070963,0.00003465357,0.000005846614,0.0000013372197,0.0000040455393,0.000054573367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993816,0.000049837556,0.000098565775,0.00014602464,0.00009527645,0.00022866682],"domain_scores_gemma":[0.9994786,0.00020050541,0.000030476862,0.0001991292,0.000010552001,0.00008074834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002479367,0.00008239414,0.000093912604,0.00010553281,0.00003250508,0.000042775933,0.0002322426,0.00003338824,0.000047360623],"category_scores_gemma":[0.000053108517,0.000070242044,0.000019680614,0.00019161492,0.00008556689,0.0003241908,0.00010106095,0.00013264795,0.000092991635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013643567,0.000099436504,0.0034049859,0.0000054505736,0.000009552174,0.0000105322415,0.005532199,0.0000049385367,0.0001601536,0.86803305,0.0025997339,0.12012629],"study_design_scores_gemma":[0.0025710263,0.000617513,0.46560815,0.0006563081,0.00001207495,0.000088135144,0.0027762917,0.04659503,0.009241246,0.4216909,0.04851383,0.0016294783],"about_ca_topic_score_codex":0.00006883237,"about_ca_topic_score_gemma":0.000020176305,"teacher_disagreement_score":0.46220317,"about_ca_system_score_codex":0.000031442625,"about_ca_system_score_gemma":0.000009978332,"threshold_uncertainty_score":0.28643873},"labels":[],"label_agreement":null},{"id":"W1970242274","doi":"10.1142/9789812702616_0011","title":"RELATIVE REWRITING SYSTEMS","year":2004,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Rewriting; Computer science; Programming language","score_opus":0.01105188728677279,"score_gpt":0.21719763963132743,"score_spread":0.20614575234455465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970242274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014910241,0.00015596024,0.91040784,0.0005362249,0.00021184696,0.0000509257,2.0878848e-7,0.00037623232,0.073350534],"genre_scores_gemma":[0.9662186,0.0000022885233,0.032641727,0.00022798443,0.000044029355,0.0000036929007,2.5176593e-7,0.000003073406,0.00085833255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995106,0.000018124882,0.00009661237,0.00015151635,0.000097703705,0.00012548138],"domain_scores_gemma":[0.99963355,0.00004510504,0.000028513037,0.00023780955,0.000020207057,0.00003481698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018139876,0.000048439153,0.000059432088,0.000028833832,0.00006405502,0.00010187914,0.00030935009,0.000022691996,0.0000056221525],"category_scores_gemma":[0.000018628278,0.000038333153,0.000022115368,0.0001440726,0.00001304621,0.00047820996,0.00008989747,0.000050781284,0.00018183432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.4713801e-7,0.0000063270686,0.000015255522,0.000002294976,0.0000025942954,0.000008997391,0.00027285292,0.00021520558,0.0002085184,0.997412,0.00007632783,0.0017794704],"study_design_scores_gemma":[0.0016987973,0.00020870927,0.0018238496,0.00037991878,0.000008441366,0.00034786132,0.0019597134,0.13541266,0.011388965,0.8340454,0.011846736,0.00087892136],"about_ca_topic_score_codex":0.000062043124,"about_ca_topic_score_gemma":8.8315875e-7,"teacher_disagreement_score":0.95130837,"about_ca_system_score_codex":0.000027176051,"about_ca_system_score_gemma":0.000018689727,"threshold_uncertainty_score":0.23371729},"labels":[],"label_agreement":null},{"id":"W1971074104","doi":"10.5555/1756384.1756392","title":"The number of similarity relations and the number of minimal deterministic finite cover automata","year":2002,"lang":"en","type":"article","venue":"International Conference on Implementation and application of automata","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Deterministic finite automaton; Mathematics; Combinatorics; Unary operation; Quantum finite automata; Nondeterministic finite automaton; Upper and lower bounds; Discrete mathematics; Cover (algebra); Equivalence relation; Finite-state machine; DFA minimization; Integer (computer science); Automaton; Automata theory; Algorithm; Computer science; Theoretical computer science","score_opus":0.031051998932354417,"score_gpt":0.34425009039367155,"score_spread":0.3131980914613171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971074104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59294766,0.000109057364,0.30339324,0.030240089,0.0004478504,0.0019152836,0.00073224545,0.00024813606,0.0699664],"genre_scores_gemma":[0.99700224,0.00015862308,0.0023831495,0.0001595276,0.000014146251,0.000055011762,0.00002688616,0.000005268923,0.00019516784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986691,0.000092180744,0.0005502794,0.00021964253,0.0003649281,0.000103854414],"domain_scores_gemma":[0.9980217,0.0008060143,0.0005359912,0.00038953323,0.00021249439,0.0000342436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044527635,0.00011078166,0.00015970228,0.00004343432,0.00014335981,0.00008863881,0.0005764863,0.000037663922,0.00035547029],"category_scores_gemma":[0.000074333264,0.000077043704,0.000045473847,0.0001327844,0.00035920105,0.00024343636,0.00018628236,0.00007441983,0.000024555167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028358252,0.00006304561,0.0029431866,0.000013117156,0.00003741211,1.5775612e-7,0.00054381794,0.00000825184,0.00026488205,0.94211465,0.00053574523,0.0534474],"study_design_scores_gemma":[0.0025647867,0.000054110093,0.03875389,0.00004426944,0.000032223925,0.000024395553,0.0006017441,0.88269174,0.0016862106,0.07001762,0.0033670147,0.00016199388],"about_ca_topic_score_codex":0.00004988711,"about_ca_topic_score_gemma":0.0000062075324,"teacher_disagreement_score":0.8826835,"about_ca_system_score_codex":0.000013655525,"about_ca_system_score_gemma":0.000027745018,"threshold_uncertainty_score":0.38921502},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.007283888517623,"score_gpt":0.2653929551883784,"score_spread":0.2581090666707554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972572665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27706847,0.00048101234,0.71548635,0.005597116,0.0011073477,0.000076956094,0.000004316395,0.000018303514,0.00016013005],"genre_scores_gemma":[0.94590086,0.000026361298,0.053475175,0.00018824486,0.00036325664,0.0000021491965,6.051939e-7,0.00000324617,0.000040118637],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838525,0.000047089277,0.00042395762,0.00016532608,0.0008173523,0.00016099894],"domain_scores_gemma":[0.99768895,0.00043611016,0.0004451218,0.00047058077,0.0008679911,0.000091225396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010337917,0.00008633532,0.00013678172,0.000218878,0.0001918532,0.00077942765,0.0040126326,0.000019689369,0.000009338339],"category_scores_gemma":[0.0002512875,0.000059395275,0.000062482955,0.00032118347,0.0005567223,0.0018329156,0.0006452355,0.00011807343,0.000006890757],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050982067,0.00004136154,0.00084679655,0.0000040770324,0.00006375103,0.000014940959,0.0036529466,0.0000399107,0.0029466085,0.14468646,0.0018098408,0.8458882],"study_design_scores_gemma":[0.005686214,0.0011732259,0.21533386,0.0010133132,0.00007423422,0.0014777683,0.004908857,0.32293102,0.032127365,0.3806223,0.033364747,0.0012870972],"about_ca_topic_score_codex":0.00004763717,"about_ca_topic_score_gemma":0.0000070655515,"teacher_disagreement_score":0.8446011,"about_ca_system_score_codex":0.000051387167,"about_ca_system_score_gemma":0.00017440133,"threshold_uncertainty_score":0.75160384},"labels":[],"label_agreement":null},{"id":"W1972975178","doi":"10.1142/s0218196703001316","title":"PRODUCTS OF COMMUTATORS IN FREE GROUPS","year":2003,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Rank (graph theory); Word (group theory); Combinatorics; Product (mathematics); Free product; Free group; Algebraic number; Infinity; Group (periodic table); Mathematical proof; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.009058940401390424,"score_gpt":0.24511721116582721,"score_spread":0.23605827076443678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972975178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8102909,0.0006754272,0.18643881,0.0014447217,0.0008646365,0.0000331078,8.8271713e-7,0.000007172163,0.00024435492],"genre_scores_gemma":[0.979327,0.00004252712,0.02046422,0.00011211851,0.00004352525,3.7645046e-7,6.978699e-7,0.0000029533423,0.00000657974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991494,0.00008360022,0.00033771503,0.00008262167,0.00028007964,0.00006658093],"domain_scores_gemma":[0.9992302,0.00010254772,0.0002706423,0.00008442302,0.0002839238,0.000028283519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046809347,0.00005655366,0.00011328911,0.0002285871,0.000012990122,0.00005106634,0.00041802033,0.00002328343,0.000003492964],"category_scores_gemma":[0.00012929308,0.000051264476,0.00003010262,0.00016414742,0.000034150675,0.0005222669,0.000058361085,0.0000860018,7.522973e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037999675,0.00030042557,0.0062137544,0.000024214218,0.000089744884,0.00010325467,0.0025912102,0.0017226514,0.001701216,0.86577326,0.0007880416,0.120654225],"study_design_scores_gemma":[0.002334098,0.000279001,0.04015616,0.00022292088,0.000009727851,0.0009929123,0.00032877325,0.018412383,0.011432461,0.92481655,0.0008278504,0.0001871862],"about_ca_topic_score_codex":0.0000067521332,"about_ca_topic_score_gemma":0.0000016144115,"teacher_disagreement_score":0.16903612,"about_ca_system_score_codex":0.000024320421,"about_ca_system_score_gemma":0.000055393924,"threshold_uncertainty_score":0.20905048},"labels":[],"label_agreement":null},{"id":"W1973389329","doi":"10.1080/00927870500274853","title":"Strongly Flat and<i>PO</i>-Flat<i>S</i>-Posets","year":2005,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Windsor","keywords":"Monoid; Mathematics; Flatness (cosmology); Combinatorics; Semigroup; Partially ordered set; Torsion (gastropod); Algebra over a field; Discrete mathematics; Physics; Pure mathematics","score_opus":0.02184093062763629,"score_gpt":0.27574343331299533,"score_spread":0.253902502685359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973389329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78483534,0.024520222,0.08164994,0.05092475,0.0004428873,0.0008627274,0.000019462497,0.0013987509,0.055345908],"genre_scores_gemma":[0.90508366,0.00060952245,0.09332889,0.0007204247,0.000030750798,0.000031466072,0.000009178919,0.000010341839,0.00017577477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989261,0.00015398569,0.00028220372,0.00026231218,0.00012766889,0.0002477123],"domain_scores_gemma":[0.996662,0.00028359552,0.000072494164,0.0028718605,0.000033096178,0.00007693592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004341386,0.00012944042,0.00014821945,0.00014305949,0.00019988492,0.00014747916,0.002745849,0.00006454922,0.000021996953],"category_scores_gemma":[0.00004516274,0.00013134416,0.000037440233,0.00039060065,0.00016354043,0.0006638772,0.001511279,0.00026666978,0.00013224335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021605726,0.000090961046,0.0022371402,0.000006186603,0.000011532261,0.0000021355563,0.0013916108,0.00002923461,0.0009045796,0.7617649,0.0014925043,0.23206706],"study_design_scores_gemma":[0.0024941198,0.00014739051,0.048131626,0.0002583996,0.000027621472,0.00014857903,0.0004215258,0.40470612,0.007653791,0.17167597,0.3628911,0.0014437622],"about_ca_topic_score_codex":0.000020069754,"about_ca_topic_score_gemma":0.00009949213,"teacher_disagreement_score":0.5900889,"about_ca_system_score_codex":0.000052381092,"about_ca_system_score_gemma":0.00003876527,"threshold_uncertainty_score":0.5356059},"labels":[],"label_agreement":null},{"id":"W1973982376","doi":"10.1142/s0129054103002205","title":"EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Automaton; Deterministic context-free grammar; Computer science; Theoretical computer science; Finite-state machine; Discrete mathematics; Context-free language; Embedded pushdown automaton; Rule-based machine translation; Probabilistic automaton; Mathematics; Algorithm; Tree-adjoining grammar; Context-free grammar; Artificial intelligence","score_opus":0.018836019442561434,"score_gpt":0.310194326532439,"score_spread":0.2913583070898776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973982376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10337092,0.000028964287,0.8939032,0.0005559369,0.0017536728,0.00009551185,0.000008651081,0.000025597214,0.00025755222],"genre_scores_gemma":[0.62544894,0.0000012273678,0.37427145,0.0001828852,0.00008365961,0.0000025476052,0.0000017019481,0.000002973351,0.0000046177856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984316,0.0000528995,0.00045486857,0.0001945171,0.0007151154,0.00015098309],"domain_scores_gemma":[0.99640965,0.00044309653,0.0005356629,0.00021625526,0.0023210777,0.000074274365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013824445,0.00009257934,0.00014890904,0.00055015285,0.00011636353,0.00018848134,0.0014440927,0.000024889003,0.000015832502],"category_scores_gemma":[0.00040402391,0.00008049776,0.00012657138,0.00043844138,0.00023856515,0.00051219005,0.00007451292,0.0000754749,0.00000721586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009336929,0.0012526728,0.0006465871,0.000037787504,0.00021186224,0.00003616275,0.0017665536,0.13142827,0.015040203,0.500275,0.00063573977,0.34857574],"study_design_scores_gemma":[0.0010546611,0.00026349298,0.0012496136,0.00012271924,0.000011036067,0.000122009864,0.000047037083,0.94052285,0.042706396,0.012707709,0.0010451037,0.00014736556],"about_ca_topic_score_codex":0.0000029237208,"about_ca_topic_score_gemma":4.4976585e-7,"teacher_disagreement_score":0.8090946,"about_ca_system_score_codex":0.00007852052,"about_ca_system_score_gemma":0.00062600395,"threshold_uncertainty_score":0.32826033},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027416478122629866,"score_gpt":0.29959842707445417,"score_spread":0.2721819489518243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974278282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37667283,0.000009087501,0.62119114,0.0015320762,0.0004609324,0.000043874526,0.0000029975827,0.0000059218464,0.000081162856],"genre_scores_gemma":[0.8948772,0.0000060239045,0.10487968,0.00019758135,0.000031985383,4.2328676e-7,8.1917625e-7,0.0000019549775,0.0000043327373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986081,0.000043441014,0.00052470516,0.00012461431,0.0005921434,0.00010699597],"domain_scores_gemma":[0.99755085,0.0005681144,0.00039422914,0.00025144345,0.0011815068,0.00005385421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001794238,0.00007820583,0.00013026824,0.00039425053,0.00015139347,0.00020964733,0.001725573,0.000013129287,0.000008063984],"category_scores_gemma":[0.00017812586,0.000050416354,0.000054538377,0.0004265444,0.00077089557,0.0010128979,0.00024170298,0.00009785334,0.0000014809134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020667227,0.00014573909,0.00007909951,0.000002637096,0.00003544663,0.0000020370771,0.0015379103,0.012443107,0.0056418045,0.90184796,0.000050576225,0.078193],"study_design_scores_gemma":[0.00036459646,0.00028116413,0.018014923,0.00008731494,0.0000030002768,0.00007764246,0.00004719025,0.74656606,0.023754293,0.21069111,0.00003739253,0.00007533051],"about_ca_topic_score_codex":0.000016107988,"about_ca_topic_score_gemma":0.0000069238126,"teacher_disagreement_score":0.73412293,"about_ca_system_score_codex":0.00004468155,"about_ca_system_score_gemma":0.00018522012,"threshold_uncertainty_score":0.32065725},"labels":[],"label_agreement":null},{"id":"W1974623598","doi":"10.1016/j.ejc.2007.03.001","title":"On an involution of Christoffel words and Sturmian morphisms","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Modulo; Morphism; Christoffel symbols; Combinatorics on words; Involution (esoterism); Iterated function; Combinatorics; Automorphism; Endomorphism; Quotient; Palindrome; Discrete mathematics; Pure mathematics; Word (group theory)","score_opus":0.010255622208276069,"score_gpt":0.22606754202962095,"score_spread":0.2158119198213449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974623598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8044008,0.00043793782,0.19219065,0.0000845489,0.00069907936,0.000029426328,3.9892765e-7,0.000021697158,0.0021354647],"genre_scores_gemma":[0.9975116,0.00004274673,0.0022028815,0.00012533796,0.00007395655,3.700877e-8,2.5629777e-7,0.000011992295,0.000031176995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987132,0.000249668,0.00041830755,0.00012142755,0.00034077992,0.00015660461],"domain_scores_gemma":[0.9988918,0.00010866316,0.00043218362,0.00027877218,0.00012841875,0.00016019057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029372755,0.00010224948,0.00017255144,0.00021176322,0.000061833736,0.00004622481,0.0006240068,0.000020823578,0.00000192856],"category_scores_gemma":[0.00007596759,0.000086083885,0.00005108391,0.00027961738,0.000057231842,0.00038068453,0.00009987254,0.00022515899,0.0000040982827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008384487,0.0005253395,0.001576733,0.000024891962,0.00003220313,0.0005775406,0.0027422663,0.00006984456,0.0041418653,0.9210687,0.0009835572,0.06817321],"study_design_scores_gemma":[0.008941604,0.015789974,0.5179004,0.0008213779,0.00008884332,0.0015480116,0.0012618272,0.008252328,0.018415138,0.413789,0.011883499,0.001308001],"about_ca_topic_score_codex":0.0000010213695,"about_ca_topic_score_gemma":2.4955804e-7,"teacher_disagreement_score":0.5163237,"about_ca_system_score_codex":0.000038205824,"about_ca_system_score_gemma":0.000026159263,"threshold_uncertainty_score":0.3510399},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02073960704499473,"score_gpt":0.2991157101043507,"score_spread":0.27837610305935595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975431188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4097653,0.000047231337,0.5885081,0.0007698571,0.0005863124,0.000043084066,0.0000034493926,0.0000074218387,0.00026921323],"genre_scores_gemma":[0.76986986,0.000007760933,0.22999166,0.000052096486,0.00006493499,5.2829887e-7,6.4201623e-7,0.0000020543055,0.000010461444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997999,0.000043792348,0.0006930133,0.00014083179,0.0010054335,0.00011791194],"domain_scores_gemma":[0.99608034,0.00015709594,0.0009775478,0.00035075677,0.002368852,0.000065423665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080007955,0.00007920916,0.0002193946,0.0005171333,0.00004507205,0.0001131753,0.0032230148,0.000021183352,0.000051899893],"category_scores_gemma":[0.00009937956,0.0000662299,0.0001187199,0.00048114997,0.00091402396,0.0017143401,0.0004145841,0.00007769912,0.0000053980957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000097359225,0.00034172213,0.0019133904,0.00002169071,0.0001053912,0.0000067222672,0.0012268925,0.00084568124,0.05526073,0.8062221,0.0004358819,0.13361008],"study_design_scores_gemma":[0.0013064874,0.0006386149,0.17075406,0.00051100494,0.00002197445,0.0004321444,0.000221515,0.26518348,0.2313902,0.32860637,0.00061050215,0.00032366448],"about_ca_topic_score_codex":0.0000619545,"about_ca_topic_score_gemma":0.0000013855807,"teacher_disagreement_score":0.4776157,"about_ca_system_score_codex":0.000039639923,"about_ca_system_score_gemma":0.00022787211,"threshold_uncertainty_score":0.5989217},"labels":[],"label_agreement":null},{"id":"W1975841184","doi":"10.1016/j.ipl.2007.09.005","title":"A note on the Markoff condition and central words","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematics; Natural language processing; Theoretical computer science; Programming language","score_opus":0.005901160824610333,"score_gpt":0.22163953948542195,"score_spread":0.2157383786608116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975841184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21061125,0.000011190445,0.7759774,0.011211536,0.00015202354,0.000082819424,0.000001042888,0.00013262258,0.0018201409],"genre_scores_gemma":[0.9671886,0.0000012144926,0.0030984003,0.02965492,0.000039422503,0.0000035926214,0.000004825811,0.0000022362985,0.000006817941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936056,0.00001457662,0.00017267003,0.00007268322,0.00018640242,0.00019307733],"domain_scores_gemma":[0.9996065,0.00009128068,0.00011092195,0.00013206068,0.00002174163,0.00003751747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039661347,0.00007202821,0.00004600768,0.00008181885,0.00020116667,0.00039867655,0.00021527031,0.000025926505,0.0000058347155],"category_scores_gemma":[0.0000325636,0.000049684397,0.000015470649,0.0001732844,0.000050660597,0.0019398704,0.00003839514,0.00009690038,0.000025663645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021537111,0.0000133394615,0.00016197634,0.00005625524,0.0000056496483,0.0000043653235,0.012248494,0.00012595959,0.0024720686,0.051487267,0.0057529123,0.92765015],"study_design_scores_gemma":[0.0029005639,0.00022870187,0.19015642,0.0009466009,0.000031121286,0.00030749966,0.0027074493,0.59059286,0.0418591,0.021785466,0.14672722,0.0017570297],"about_ca_topic_score_codex":0.0000027089354,"about_ca_topic_score_gemma":4.0789882e-7,"teacher_disagreement_score":0.9258931,"about_ca_system_score_codex":0.000031205014,"about_ca_system_score_gemma":0.000016411204,"threshold_uncertainty_score":0.3844447},"labels":[],"label_agreement":null},{"id":"W1976140212","doi":"10.1007/978-3-642-00982-2_21","title":"Decision Problems for Convex Languages","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Regular polygon; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.013195413668358918,"score_gpt":0.2554913312474427,"score_spread":0.2422959175790838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976140212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004669947,0.0011842495,0.9933457,0.0006272122,0.0011835165,0.00061454275,0.000007589335,0.00026415547,0.0027263502],"genre_scores_gemma":[0.041050795,0.00007771016,0.9530948,0.0038440712,0.0007087401,0.000023230055,0.000010960761,0.000047001566,0.0011427185],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996742,0.000017302598,0.0004603335,0.0014166274,0.00072515913,0.00063859415],"domain_scores_gemma":[0.99715245,0.00092188636,0.00024052583,0.0013490163,0.00018950074,0.0001466249],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010359351,0.00046650585,0.00052305026,0.0005980495,0.00022285839,0.0005838198,0.0035232296,0.00030645274,0.000017332017],"category_scores_gemma":[0.0001139466,0.0003915961,0.00016835326,0.0003633957,0.00034368367,0.00051553454,0.0007141571,0.0004276025,0.00003818263],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039740103,0.000016908527,0.0000034681616,0.000024276238,0.0000042862093,0.000024762816,0.00028232302,0.0038953198,0.00013640577,0.04974829,0.000080121994,0.94577986],"study_design_scores_gemma":[0.00032951933,0.0002514177,0.000048158126,0.00051653525,0.000005628626,0.000056035136,1.3978575e-7,0.3226076,0.0011147254,0.66567785,0.008827044,0.00056537316],"about_ca_topic_score_codex":0.000006613474,"about_ca_topic_score_gemma":0.000023227176,"teacher_disagreement_score":0.9452145,"about_ca_system_score_codex":0.00015457305,"about_ca_system_score_gemma":0.00027330607,"threshold_uncertainty_score":0.9998536},"labels":[],"label_agreement":null},{"id":"W1976554601","doi":"10.1016/j.jcta.2013.09.002","title":"Lyndon words and Fibonacci numbers","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Fibonacci number; Combinatorics; Concatenation (mathematics); Word (group theory); Mathematics; Golden ratio; Upper and lower bounds; Closure (psychology); Aperiodic graph; Combinatorics on words; Word length; Discrete mathematics; Computer science; Geometry","score_opus":0.004193574610920123,"score_gpt":0.20143033041803673,"score_spread":0.1972367558071166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976554601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95987713,0.0011826684,0.017065631,0.0025921126,0.0108720735,0.00022594389,0.0000012304887,0.00011379697,0.008069388],"genre_scores_gemma":[0.99513316,0.00009683578,0.00373332,0.00023344399,0.00045196334,0.0000033977738,1.941077e-7,0.000011715373,0.00033597843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987324,0.00020811905,0.000394783,0.00014194193,0.00029561546,0.00022716001],"domain_scores_gemma":[0.9987417,0.00031238195,0.00033152566,0.0002859279,0.0001644654,0.00016402085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009956504,0.00014898586,0.00029270802,0.00010095216,0.00011075773,0.0003290883,0.0007019248,0.000074108364,0.00018081811],"category_scores_gemma":[0.00015408767,0.00011515897,0.00010047369,0.000201828,0.00011275875,0.0019600869,0.00021300418,0.00021941836,0.000018251778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007875705,0.000047861646,0.000117613316,0.00000889339,0.000040065326,0.000023735089,0.0009396133,0.0000014643697,0.00079543574,0.9784649,0.002519748,0.016961932],"study_design_scores_gemma":[0.0008641648,0.00039301487,0.0006193096,0.00004408561,0.000010482279,0.00035799405,0.00046145992,0.00011502642,0.0015457644,0.9857405,0.009692591,0.00015564864],"about_ca_topic_score_codex":0.000008335603,"about_ca_topic_score_gemma":2.437497e-7,"teacher_disagreement_score":0.035255995,"about_ca_system_score_codex":0.00003167418,"about_ca_system_score_gemma":0.00006490804,"threshold_uncertainty_score":0.46960464},"labels":[],"label_agreement":null},{"id":"W1977065097","doi":"10.1016/j.jda.2009.10.001","title":"On the generalized Berge sorting conjecture","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Direktion für Entwicklung und Zusammenarbeit; Mitacs; Canada Research Chairs","keywords":"Combinatorics; Conjecture; Sorting; Mathematics; String (physics); Algorithm","score_opus":0.011191178383329208,"score_gpt":0.24998249405102738,"score_spread":0.23879131566769818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977065097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27509734,0.0017707748,0.6742206,0.041932177,0.0016775109,0.00021741053,0.0000056443714,0.00012354237,0.0049549798],"genre_scores_gemma":[0.96559924,0.000052125535,0.028853893,0.0047996705,0.00052658905,8.3741384e-7,5.8658225e-7,0.000008844564,0.00015821478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870956,0.00011730774,0.00039597845,0.00013659011,0.0004073387,0.00023325428],"domain_scores_gemma":[0.9988814,0.00019365108,0.0004268987,0.00033791852,0.00006991569,0.00009020232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077946065,0.00013445792,0.0002149689,0.00007617098,0.00014692207,0.00018189297,0.0009772436,0.000047968064,0.000040116414],"category_scores_gemma":[0.000103510225,0.0000703791,0.00019762195,0.00021541883,0.000028598308,0.00032030427,0.00005399185,0.0003109289,0.000009353962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033561482,0.00010574303,0.000027983739,0.0000040660652,0.00010477461,0.00025149732,0.0012527942,0.00086633366,0.005194528,0.7742322,0.015308692,0.2026178],"study_design_scores_gemma":[0.0022170404,0.0019406633,0.0031390595,0.00026214446,0.000060962044,0.0010115481,0.0002394053,0.15932167,0.018259007,0.80479944,0.008115507,0.00063355535],"about_ca_topic_score_codex":0.0000025418274,"about_ca_topic_score_gemma":2.6845856e-7,"teacher_disagreement_score":0.6905019,"about_ca_system_score_codex":0.000025875233,"about_ca_system_score_gemma":0.0000437416,"threshold_uncertainty_score":0.28699765},"labels":[],"label_agreement":null},{"id":"W1977922362","doi":"10.1016/j.jmaa.2010.06.054","title":"A conjugacy criterion for pure <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mi>E</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math>-semigroups","year":2010,"lang":"lv","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Conjugacy class; Semigroup; Mathematics; Class (philosophy); Invariant (physics); Discrete mathematics; Pure mathematics; Artificial intelligence; Computer science; Mathematical physics","score_opus":0.015365472009557405,"score_gpt":0.2551968415981379,"score_spread":0.23983136958858048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977922362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8124434,0.0007282749,0.17839918,0.0022932931,0.00040232195,0.000101019854,0.00017760583,0.000085772175,0.0053691813],"genre_scores_gemma":[0.9725185,0.0005015124,0.024160383,0.0008854441,0.0011576195,0.00039699624,0.000112351496,0.00011918001,0.00014803263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953757,0.00013958075,0.0016678631,0.00081212353,0.0011537229,0.0008510094],"domain_scores_gemma":[0.99446696,0.0014164959,0.0017450997,0.0014112788,0.00027037913,0.0006897848],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021665005,0.0004574471,0.000530079,0.00039929268,0.0010453755,0.0013311689,0.0015338328,0.0006994384,0.005168741],"category_scores_gemma":[0.00055441493,0.0005568413,0.0015515945,0.0011017559,0.0006028285,0.0008932854,0.00067937607,0.0009580643,0.00041140424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011957955,0.00053137523,0.000011777654,0.000497777,0.0013285795,0.0000693199,0.0009893958,0.0001273097,0.005573632,0.9735325,0.0120821325,0.0051366393],"study_design_scores_gemma":[0.0014578962,0.000822536,0.00015459783,0.00070570636,0.00471944,0.001267204,0.0012516088,0.84021497,0.09190851,0.04645155,0.0100037865,0.0010422161],"about_ca_topic_score_codex":0.000057674486,"about_ca_topic_score_gemma":0.00010197381,"teacher_disagreement_score":0.9270809,"about_ca_system_score_codex":0.000013005608,"about_ca_system_score_gemma":0.00035179633,"threshold_uncertainty_score":0.99970555},"labels":[],"label_agreement":null},{"id":"W1978592724","doi":"10.1016/s0304-3975(02)00574-1","title":"Weak repetitions in Sturmian strings","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; String (physics); Quadratic equation; Combinatorics; Encoding (memory); Discrete mathematics; Algorithm; Computer science","score_opus":0.007899106622770134,"score_gpt":0.23426777702779686,"score_spread":0.22636867040502673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978592724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070305906,0.00003090373,0.8968337,0.00076117326,0.0005209872,0.0001318688,7.5111444e-7,0.00023511634,0.031179601],"genre_scores_gemma":[0.886992,0.0000037996647,0.11246513,0.00047327369,0.000034013472,0.0000068063487,2.3397905e-7,0.00000566931,0.000019090707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976884,0.00015820189,0.00028057516,0.0007266286,0.00051534444,0.00063081225],"domain_scores_gemma":[0.9984837,0.00022328069,0.000048201447,0.00093845674,0.000076304306,0.0002300185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020947428,0.000160263,0.00017762686,0.00028433348,0.00027226764,0.00039604836,0.0020369773,0.000046950645,0.0000699068],"category_scores_gemma":[0.00016104817,0.00013722948,0.000052505355,0.0017978814,0.0014772082,0.0007835573,0.00050429197,0.00022726107,0.000111908055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.903164e-7,0.000058772242,0.00013030857,0.000002320156,9.0029204e-7,0.000016404372,0.00019485388,0.000050743132,0.00036816087,0.98782337,0.000027927412,0.011325253],"study_design_scores_gemma":[0.00034706932,0.000108235734,0.004670815,0.00005175716,0.0000018117963,0.000102856415,0.00002833724,0.12584512,0.005238453,0.8620648,0.0012066162,0.0003341598],"about_ca_topic_score_codex":0.0000039161996,"about_ca_topic_score_gemma":0.0000018589767,"teacher_disagreement_score":0.8166861,"about_ca_system_score_codex":0.00007686179,"about_ca_system_score_gemma":0.00014160041,"threshold_uncertainty_score":0.5596056},"labels":[],"label_agreement":null},{"id":"W1978605527","doi":"10.1007/s00224-003-1109-3","title":"Nesting Until and Since in Linear Temporal Logic","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decidability; Linear temporal logic; Nesting (process); Characterization (materials science); Temporal logic; Hierarchy; Property (philosophy); Interval temporal logic; Class (philosophy); Mathematics; Computation tree logic; Algebraic number; Semigroup; Discrete mathematics; Substitution (logic); Computer science; Algebra over a field; Pure mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Programming language","score_opus":0.021368154774561464,"score_gpt":0.24649091455748412,"score_spread":0.22512275978292265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978605527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.631668,0.0010363739,0.36428162,0.000034872905,0.0005461259,0.00014149354,4.58818e-7,0.00014420055,0.00214691],"genre_scores_gemma":[0.9872039,0.0000022984177,0.012610087,0.000057937006,0.000044614124,0.0000011318504,4.032869e-7,0.000009375307,0.0000702282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822605,0.0006073053,0.0004283913,0.00030241915,0.00016348618,0.00027234224],"domain_scores_gemma":[0.9986304,0.000676189,0.00022996681,0.00036557633,0.000044138702,0.00005372175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033275147,0.00014196479,0.00030978865,0.00012456045,0.00008129835,0.00006451952,0.00042383565,0.000057635574,0.0000012671737],"category_scores_gemma":[0.00018939245,0.0001265154,0.00003316206,0.00033209962,0.00009558298,0.00015253155,0.00013623603,0.00012139107,0.0000060108277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034704992,0.000029236488,0.0045721107,0.00010070952,0.000005662133,0.000015901389,0.0011047256,0.0022216411,0.00048019463,0.9886429,0.000007871395,0.0028156242],"study_design_scores_gemma":[0.0011935526,0.00019266606,0.00718502,0.0013459835,0.000009707592,0.0003970311,0.0014562112,0.81273633,0.0013655099,0.17289007,0.00057405524,0.0006538462],"about_ca_topic_score_codex":0.000043161563,"about_ca_topic_score_gemma":0.0000010161104,"teacher_disagreement_score":0.8157528,"about_ca_system_score_codex":0.000021142809,"about_ca_system_score_gemma":0.000040544088,"threshold_uncertainty_score":0.5159148},"labels":[],"label_agreement":null},{"id":"W1978707564","doi":"10.1016/j.tcs.2012.04.011","title":"Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Suffix; Prefix; Regular language; Cardinality (data modeling); Mathematics; Combinatorics; Discrete mathematics; Conjecture; Upper and lower bounds; Computer science; Linguistics; Artificial intelligence; Automaton","score_opus":0.020163731806501314,"score_gpt":0.2615775143125849,"score_spread":0.24141378250608359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978707564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46932036,0.00031048057,0.52759427,0.0005915266,0.00036970017,0.00014314607,0.0000083514315,0.0002022778,0.001459909],"genre_scores_gemma":[0.890584,0.000008567746,0.10904553,0.0002275181,0.00011491271,0.0000031587597,6.70644e-7,0.000009397969,0.000006282673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974474,0.00018343348,0.00032994745,0.0005639564,0.00072166964,0.00075363973],"domain_scores_gemma":[0.9974046,0.00042227373,0.00013086022,0.0015094789,0.000120108896,0.00041272485],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015866605,0.0002334236,0.00033547197,0.00020083415,0.00027001122,0.00022434151,0.0027618653,0.00006783159,0.00005996203],"category_scores_gemma":[0.00020754365,0.00018309864,0.00006933842,0.0007866374,0.0050821365,0.001323844,0.002314207,0.0001891402,0.000021894453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005713192,0.00009534347,0.0008403189,0.000026589558,0.0000068938994,0.0000032387222,0.0010645861,0.0000020288921,0.0033382776,0.9802919,0.0000319789,0.014293135],"study_design_scores_gemma":[0.0008270251,0.0005136412,0.09061481,0.00015471742,0.00002707642,0.00028689875,0.00014604536,0.1431511,0.083146326,0.680051,0.00017924634,0.0009020601],"about_ca_topic_score_codex":0.000012632529,"about_ca_topic_score_gemma":5.199546e-7,"teacher_disagreement_score":0.4212636,"about_ca_system_score_codex":0.000038827657,"about_ca_system_score_gemma":0.000058179776,"threshold_uncertainty_score":0.99762547},"labels":[],"label_agreement":null},{"id":"W1979037305","doi":"10.1142/s0218196706003311","title":"THE SEMIGROUP OF CONJUGATES OF A WORD","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University; Royal Society","keywords":"Mathematics; Semigroup; Conjugacy class; Bicyclic semigroup; Alphabet; Monoid; Word (group theory); Cancellative semigroup; Free monoid; Class (philosophy); Syntactic monoid; Word problem (mathematics education); Combinatorics on words; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Arithmetic; Computer science; Linguistics; Artificial intelligence","score_opus":0.00472986314400044,"score_gpt":0.23381544225607148,"score_spread":0.22908557911207103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979037305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77119553,0.0007196825,0.22658223,0.00084587105,0.00039214903,0.000025892132,0.0000013849298,0.000006287402,0.00023095014],"genre_scores_gemma":[0.9947942,0.00005878908,0.004991772,0.00004444798,0.00009002872,3.358829e-7,0.0000010580026,0.0000023303496,0.000017034936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991256,0.000039158997,0.00040839246,0.00005871141,0.00031254784,0.000055572775],"domain_scores_gemma":[0.998686,0.0003140225,0.0005247211,0.00005595804,0.0004018166,0.000017477389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032803562,0.00005091552,0.00010459697,0.000090588386,0.000030576775,0.000064910804,0.00040898006,0.000018786397,0.0000019343624],"category_scores_gemma":[0.000026059175,0.000034708195,0.00005810738,0.00008370481,0.00006838972,0.00025921583,0.00006285407,0.000052854833,4.877678e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091993345,0.00014230052,0.003415773,0.000014501009,0.00016201974,0.000018561892,0.00070185144,0.0023330345,0.010875703,0.69156384,0.00096568896,0.28971472],"study_design_scores_gemma":[0.0014952398,0.00033530928,0.08489105,0.00023396606,0.000024965717,0.00039211087,0.00028503212,0.10307812,0.029310482,0.7785565,0.00123644,0.00016075585],"about_ca_topic_score_codex":0.000020883996,"about_ca_topic_score_gemma":0.0000028155291,"teacher_disagreement_score":0.28955397,"about_ca_system_score_codex":0.000010781332,"about_ca_system_score_gemma":0.000032376276,"threshold_uncertainty_score":0.14153591},"labels":[],"label_agreement":null},{"id":"W1979340931","doi":"10.1016/j.laa.2006.03.002","title":"Unitarily achievable zero patterns and traces of words in A and A","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Zero (linguistics); Combinatorics; Pure mathematics; Linguistics","score_opus":0.0064196656218465,"score_gpt":0.21743536230803434,"score_spread":0.21101569668618783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979340931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9272021,0.0012876701,0.0706015,0.00041603303,0.0000072980974,0.00016336751,0.0000126356745,0.000031750198,0.000277661],"genre_scores_gemma":[0.9962252,0.00016334024,0.0033848856,0.000069337635,0.000020598913,0.000034671713,0.000004925585,0.0000041326566,0.00009291062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994962,0.000015642257,0.00014159331,0.00019112107,0.000055336022,0.00010009842],"domain_scores_gemma":[0.99967664,0.000077942896,0.000041335556,0.000153237,0.000016353893,0.0000344809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010410877,0.00006763141,0.000101404956,0.00006665431,0.00005836821,0.000039656716,0.00012437745,0.0000345121,0.000002685107],"category_scores_gemma":[0.000004039202,0.00006044177,0.000009136372,0.00019190043,0.00003638712,0.00016120802,0.00008558933,0.000054696447,0.0000013813276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004899468,0.00017370979,0.015949646,0.00009507587,0.000009450069,0.0000016528863,0.0010932151,0.000025294114,0.004415303,0.9321198,0.0000662675,0.04604569],"study_design_scores_gemma":[0.0017927635,0.00021210728,0.44822916,0.00014454807,0.000031006064,0.00006635641,0.0005249223,0.24788736,0.008952795,0.27914357,0.0123325335,0.0006828736],"about_ca_topic_score_codex":0.00015396389,"about_ca_topic_score_gemma":0.000056598506,"teacher_disagreement_score":0.6529762,"about_ca_system_score_codex":0.0000025901822,"about_ca_system_score_gemma":0.000009692466,"threshold_uncertainty_score":0.24647437},"labels":[],"label_agreement":null},{"id":"W1979358057","doi":"10.1016/j.tcs.2008.06.009","title":"Rich, Sturmian, and trapezoidal words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics","score_opus":0.010044828997486724,"score_gpt":0.2248701033556216,"score_spread":0.21482527435813487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979358057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37073547,0.0000742274,0.62572336,0.00067454675,0.0003337678,0.00007737086,5.684583e-7,0.00025142223,0.0021292993],"genre_scores_gemma":[0.8955997,0.000020262589,0.10323611,0.0009941796,0.00011909391,0.000003803158,2.0999119e-7,0.000006633072,0.00002001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771255,0.000086632266,0.000224796,0.00075963506,0.0006262248,0.0005901696],"domain_scores_gemma":[0.99855494,0.00023135183,0.000047214606,0.00074644806,0.000081345526,0.00033869347],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009740757,0.00019307676,0.00021001977,0.00017472751,0.0006680042,0.00028842175,0.0020656951,0.000050957828,0.000024720715],"category_scores_gemma":[0.000045805507,0.00015138007,0.000045262503,0.0010433863,0.004305505,0.0008466484,0.0011172948,0.00019590573,0.00006159516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034864543,0.000039347196,0.00019896572,0.0000029600624,0.0000025721645,0.000050472427,0.0009970558,0.000009630706,0.0005536423,0.9568436,0.00007259386,0.041225653],"study_design_scores_gemma":[0.00060842966,0.0004144965,0.017629554,0.000033462067,0.0000062044764,0.0011951085,0.000025162304,0.5912363,0.0071993642,0.38044637,0.0005560029,0.0006495307],"about_ca_topic_score_codex":0.0000019391525,"about_ca_topic_score_gemma":2.100815e-7,"teacher_disagreement_score":0.5912267,"about_ca_system_score_codex":0.000028246646,"about_ca_system_score_gemma":0.00009982246,"threshold_uncertainty_score":0.9984042},"labels":[],"label_agreement":null},{"id":"W1979795169","doi":"10.1090/s0002-9947-2011-05379-1","title":"An effective lower bound for group complexity of finite semigroups and automata","year":2011,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Krohn–Rhodes theory; Mathematics; Prime (order theory); Special classes of semigroups; Semigroup; Finite group; Group (periodic table); Discrete mathematics; Finite-state machine; Prime factor; Algebraic number; Decomposition; Algebra over a field; Combinatorics; Pure mathematics; Algorithm","score_opus":0.026718420621851077,"score_gpt":0.2634378449982115,"score_spread":0.2367194243763604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979795169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24942288,0.000012427916,0.7498627,0.00009651795,0.00004317393,0.00032842788,0.000033907047,0.00007334876,0.00012662284],"genre_scores_gemma":[0.7923043,0.0000076723845,0.20751834,0.00010116184,0.000007476835,0.00004019768,6.358637e-7,0.00001045735,0.000009803153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989576,0.000099488854,0.00029553752,0.00025359314,0.00018774481,0.00020604554],"domain_scores_gemma":[0.9982676,0.00059749896,0.00025477583,0.0007417988,0.000059547998,0.00007881158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004708161,0.00014765843,0.00038188542,0.000021501746,0.00017134192,0.000022932469,0.00075262866,0.00004052738,0.000025806543],"category_scores_gemma":[0.00002621117,0.00010365919,0.000336056,0.0003142302,0.0015398156,0.00026408347,0.000046959027,0.000115703624,0.0000013855587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029120786,0.0061996845,0.0004428312,0.0015245521,0.0010224193,0.0000011521694,0.04115123,0.00012509832,0.03457937,0.7928,0.0002939582,0.12156847],"study_design_scores_gemma":[0.0008814189,0.0014902754,0.018042687,0.00012898321,0.00018344502,0.000019784899,0.0015598943,0.37079835,0.014342893,0.5921378,0.000039162365,0.00037530196],"about_ca_topic_score_codex":0.00008813613,"about_ca_topic_score_gemma":0.0000042016813,"teacher_disagreement_score":0.54288137,"about_ca_system_score_codex":0.00002047739,"about_ca_system_score_gemma":0.000015962414,"threshold_uncertainty_score":0.56735146},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03640076233099542,"score_gpt":0.30195530541704296,"score_spread":0.26555454308604753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980577621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35859564,0.000012975364,0.6363704,0.0035431262,0.0011511953,0.000037950693,0.000002875083,0.000007745337,0.0002780675],"genre_scores_gemma":[0.91064024,0.0000075191606,0.0889467,0.00030822528,0.000090855094,5.7489063e-7,3.9642418e-7,0.0000023869288,0.0000031018183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801356,0.00004386978,0.0005748803,0.00014730134,0.0010942491,0.00012614673],"domain_scores_gemma":[0.9974175,0.0003462192,0.0007314147,0.00038387685,0.0010651085,0.000055859313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012867198,0.0000868381,0.00015781978,0.00045702365,0.00011235637,0.00019057386,0.0040437886,0.000018903524,0.000021446298],"category_scores_gemma":[0.00017587145,0.0000598622,0.00011857341,0.00061465707,0.00092179596,0.00093395356,0.00035618167,0.00014209168,0.00000856442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010364247,0.00014527641,0.00008429526,0.0000018318358,0.000031697622,0.0000053176054,0.0006497346,0.008763928,0.0018456562,0.97439414,0.00004535182,0.014022384],"study_design_scores_gemma":[0.0010593276,0.0005105085,0.020517034,0.0003584225,0.000009362366,0.0003063214,0.000049636794,0.059120413,0.025700174,0.8918371,0.00035672594,0.00017492959],"about_ca_topic_score_codex":0.000017365675,"about_ca_topic_score_gemma":0.0000022851325,"teacher_disagreement_score":0.5520446,"about_ca_system_score_codex":0.00009108692,"about_ca_system_score_gemma":0.00048447048,"threshold_uncertainty_score":0.7514433},"labels":[],"label_agreement":null},{"id":"W1981471007","doi":"10.1016/j.aam.2011.11.002","title":"Toward a language theoretic proof of the four color theorem","year":2011,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Statement (logic); Parsing; Binary tree; Word (group theory); Simple (philosophy); Parse tree","score_opus":0.018778643605686242,"score_gpt":0.2382150284497964,"score_spread":0.21943638484411015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981471007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09477924,0.00087321526,0.7077821,0.00009063321,0.0003042747,0.0010059484,0.00000529092,0.00017439097,0.19498491],"genre_scores_gemma":[0.8368084,0.000019606787,0.16297495,0.00008812549,0.000011186732,0.00005401745,1.854125e-7,0.000011143953,0.000032397544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990134,0.000028014378,0.0003145997,0.00020311009,0.00022262392,0.0002182419],"domain_scores_gemma":[0.9987144,0.00026377253,0.00022051443,0.00075612485,0.000017365941,0.000027832095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046297384,0.00013886296,0.00022562996,0.000050035465,0.00003493428,0.00001554272,0.0013686079,0.000047063604,0.00002561142],"category_scores_gemma":[0.000071300594,0.000085123895,0.00005832217,0.00033955267,0.00020485923,0.00014241914,0.00033539016,0.000117286465,0.0000104262335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005135773,0.00011236336,0.000029859204,0.00015763553,0.000003896769,0.0000035698208,0.012943404,0.000017312794,0.0005381197,0.9730682,0.0000053431872,0.013115198],"study_design_scores_gemma":[0.00022221328,0.00002706194,0.00006934282,0.00008406681,0.000006682035,0.000012959313,0.0014211988,0.0064490805,0.059226923,0.93227315,0.00008157637,0.00012573395],"about_ca_topic_score_codex":0.000001421186,"about_ca_topic_score_gemma":0.0000039081447,"teacher_disagreement_score":0.74202913,"about_ca_system_score_codex":0.000018441415,"about_ca_system_score_gemma":0.000025676118,"threshold_uncertainty_score":0.34712517},"labels":[],"label_agreement":null},{"id":"W1981675591","doi":"10.1090/s0025-5718-01-01336-9","title":"Some computations on the spectra of Pisot and Salem numbers","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Computation; Line (geometry); Class (philosophy); Discrete mathematics; Algorithm; Geometry","score_opus":0.019167437485328242,"score_gpt":0.2511285033220414,"score_spread":0.23196106583671317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981675591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41982925,0.000051412106,0.5780194,0.00072027225,0.000057461224,0.00012875622,0.0000017241648,0.0000451617,0.0011466038],"genre_scores_gemma":[0.9196983,0.000018114635,0.0801311,0.00009912863,0.000021657781,0.0000029136213,0.0000018138633,0.000006529181,0.000020432764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992083,0.000043695618,0.00029727494,0.00012315968,0.00022976003,0.00009783419],"domain_scores_gemma":[0.99868417,0.0007641642,0.00023454543,0.00022829197,0.00006286217,0.000025997218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032373623,0.0000877691,0.00016279827,0.000082572355,0.00006295901,0.000039392122,0.0002784002,0.000025206728,0.0000053058907],"category_scores_gemma":[0.000041019674,0.00006473306,0.000042074647,0.00022085385,0.00008254088,0.0001614734,0.00006357091,0.000055490433,0.000009062497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023465077,0.00013447633,0.000045108533,0.000059819715,0.000018194645,0.0000012963461,0.0025252416,0.0042306823,0.00054024736,0.98675007,0.00019268774,0.005499835],"study_design_scores_gemma":[0.00015403125,0.0000696988,0.0011173558,0.00007099723,0.0000066612997,0.0000142149265,0.00020152508,0.4640875,0.0013883277,0.532809,0.000016831178,0.000063870786],"about_ca_topic_score_codex":0.000005894528,"about_ca_topic_score_gemma":8.8280177e-7,"teacher_disagreement_score":0.49986905,"about_ca_system_score_codex":0.00000972773,"about_ca_system_score_gemma":0.00001642742,"threshold_uncertainty_score":0.26397374},"labels":[],"label_agreement":null},{"id":"W1982010621","doi":"10.1007/s00236-006-0030-z","title":"On Abelian 2-avoidable binary patterns","year":2006,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Theory of computation; Binary number; Abelian group; Computer science; Mathematics; Combinatorics; Algorithm; Arithmetic","score_opus":0.00457864365006878,"score_gpt":0.19233578705940937,"score_spread":0.1877571434093406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982010621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80007297,0.000025051733,0.05108546,0.0024407313,0.0005223607,0.000288657,0.000014705925,0.0008117633,0.14473833],"genre_scores_gemma":[0.9937164,0.0000034625507,0.003795652,0.0019208629,0.000043111457,0.000013129284,0.000010234164,0.0000066937237,0.00049042475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904597,0.000017676182,0.0002685966,0.00012496016,0.00023846042,0.00030435916],"domain_scores_gemma":[0.9991037,0.00011881403,0.00008569308,0.0006097972,0.000021801912,0.000060183378],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018093073,0.00012682348,0.00012211404,0.00011276854,0.00012586698,0.00021749857,0.00077281316,0.000049594528,0.00010353771],"category_scores_gemma":[0.000017411336,0.00010185787,0.000049805763,0.00020254575,0.000021124772,0.0010584595,0.0001828047,0.00011198844,0.00082791504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118294065,0.00028681254,0.00066267897,0.000119978045,0.000024108322,0.000046098576,0.0012722188,0.00032279786,0.0010570384,0.84796965,0.1172798,0.030946985],"study_design_scores_gemma":[0.002405277,0.0011868158,0.04789502,0.0004997273,0.000024074254,0.0001617741,0.00040436297,0.568207,0.015306435,0.18305925,0.17890681,0.0019434388],"about_ca_topic_score_codex":0.000050895127,"about_ca_topic_score_gemma":0.0000024968488,"teacher_disagreement_score":0.6649104,"about_ca_system_score_codex":0.000029049277,"about_ca_system_score_gemma":0.000025451198,"threshold_uncertainty_score":0.99995005},"labels":[],"label_agreement":null},{"id":"W1982284230","doi":"10.1081/agb-120015672","title":"AXIOMATISABILITY OF WEAKLY FLAT, FLAT, AND PROJECTIVE<i>S</i>-ACTS","year":2002,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Wilfrid Laurier University","keywords":"Mathematics; Class (philosophy); Order (exchange); Pure mathematics; Projective test; Computer science; Artificial intelligence","score_opus":0.041138142201751014,"score_gpt":0.2761499688212992,"score_spread":0.2350118266195482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982284230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93438166,0.0068770396,0.016003806,0.0048680035,0.00014019322,0.0007008452,0.000010969173,0.000315964,0.03670151],"genre_scores_gemma":[0.9562476,0.00036344383,0.043195155,0.00008960479,0.0000056670706,0.000036288206,0.0000021373548,0.000006369053,0.00005370865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998934,0.00024066665,0.00031750873,0.00022972767,0.00011924226,0.00015890019],"domain_scores_gemma":[0.99672246,0.0004586916,0.00010717329,0.002614654,0.00005304038,0.000043955963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047730785,0.00010218128,0.00017840651,0.00012705135,0.00011417942,0.00005169898,0.001614468,0.000055525044,0.0000263807],"category_scores_gemma":[0.00015398022,0.000100606485,0.000033650904,0.0005863918,0.0003075209,0.0004359726,0.0010282703,0.00016620976,0.000019918487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029429016,0.0003200114,0.011959847,0.000055372053,0.000021719776,0.0000015077773,0.0061833933,0.0000034864797,0.0048026345,0.8648068,0.0004894593,0.11135284],"study_design_scores_gemma":[0.0014484623,0.00022970149,0.24599986,0.00035642646,0.000022568644,0.000083274426,0.00068886275,0.40282133,0.0150286,0.32128453,0.011150068,0.00088632794],"about_ca_topic_score_codex":0.00005025351,"about_ca_topic_score_gemma":0.000047124347,"teacher_disagreement_score":0.54352224,"about_ca_system_score_codex":0.000036163834,"about_ca_system_score_gemma":0.000018581697,"threshold_uncertainty_score":0.41026133},"labels":[],"label_agreement":null},{"id":"W1982678879","doi":"10.1016/j.ic.2008.06.007","title":"Detecting palindromes, patterns and borders in regular languages","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Word (group theory); Regular language; Automaton; Computer science; Combinatorics on words; Combinatorics; Matching (statistics); Mathematics; Artificial intelligence; Biology","score_opus":0.00515848780118209,"score_gpt":0.2469158703377372,"score_spread":0.24175738253655513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982678879","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63302577,0.000059149046,0.36603326,0.0004591754,0.00002415693,0.000054485092,4.770146e-7,0.00006746837,0.00027603254],"genre_scores_gemma":[0.9948283,0.000019266423,0.004422457,0.00071185036,0.0000062569366,0.0000013458634,0.0000075681082,8.864788e-7,0.0000021081714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996168,0.000019407535,0.00014782153,0.00006532842,0.00007472703,0.00007593101],"domain_scores_gemma":[0.99981827,0.000026871765,0.00005858481,0.000055899185,0.0000166718,0.000023697972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016422366,0.000050079907,0.000054216238,0.00011672975,0.00004715401,0.00016275197,0.00005898596,0.000025866828,8.8301726e-7],"category_scores_gemma":[0.000012939058,0.000048126476,0.000007050135,0.000113625916,0.0000066347593,0.0011150648,0.000022826747,0.000043316155,0.000002488974],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014741387,0.0000042140223,0.00095560605,0.00001027681,0.000001030185,0.0000013504211,0.0025623322,0.0003649391,0.000023085293,0.008036792,0.000011589571,0.98802733],"study_design_scores_gemma":[0.0005892296,0.00007536522,0.2671842,0.000050054456,0.0000014750127,0.000042873016,0.001407256,0.7173878,0.00023255934,0.012583486,0.0003005915,0.00014508545],"about_ca_topic_score_codex":0.00003095753,"about_ca_topic_score_gemma":0.0000058550254,"teacher_disagreement_score":0.9878822,"about_ca_system_score_codex":0.000008615622,"about_ca_system_score_gemma":0.000006949552,"threshold_uncertainty_score":0.19625407},"labels":[],"label_agreement":null},{"id":"W1982828667","doi":"10.1016/j.endm.2009.07.047","title":"Codings of rotations on two intervals are full","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Combinatorics on words; Binary number; Partition (number theory); Sequence (biology); Unit circle; Discrete mathematics; Arithmetic; Geometry; Word (group theory)","score_opus":0.013119776257716733,"score_gpt":0.2794030656433672,"score_spread":0.2662832893856505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982828667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38017762,0.00022951094,0.6155555,0.0016941804,0.00006487701,0.0002636362,0.0000053409835,0.00014272697,0.0018666073],"genre_scores_gemma":[0.9744403,0.000018360157,0.025212802,0.0002449451,0.00002064412,0.0000087738645,0.0000021663916,0.000009234668,0.000042788488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872893,0.000044977027,0.0003902439,0.00023163312,0.0002284608,0.00037575728],"domain_scores_gemma":[0.9987445,0.00038618976,0.00023899214,0.0005591199,0.000034113124,0.000037120026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044964073,0.00015348941,0.00027398643,0.00014150995,0.00004076988,0.00005473248,0.00074791204,0.000040449537,0.000019879115],"category_scores_gemma":[0.00021957513,0.00013203216,0.00008582798,0.00036370935,0.000038177153,0.00018738302,0.00007714575,0.00019679038,0.000023739098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006284936,0.00017673506,0.000032395063,0.00003268901,0.00001135272,0.0000038595667,0.0015710264,0.00024729996,0.0039125574,0.9849721,0.000059637874,0.008974058],"study_design_scores_gemma":[0.000480254,0.00046563047,0.00039347154,0.0003796476,0.000009078338,0.000014877266,0.00010545336,0.11858996,0.025760148,0.85350865,0.000058258356,0.00023457666],"about_ca_topic_score_codex":0.0000039833303,"about_ca_topic_score_gemma":0.000014756731,"teacher_disagreement_score":0.59426266,"about_ca_system_score_codex":0.000084763255,"about_ca_system_score_gemma":0.00004361148,"threshold_uncertainty_score":0.53841156},"labels":[],"label_agreement":null},{"id":"W1982921028","doi":"10.1016/j.disc.2008.01.028","title":"On the fractional chromatic number of monotone self-dual Boolean functions","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Monotone polygon; Chromatic scale; Dual (grammatical number); Discrete mathematics; Combinatorics; Boolean function","score_opus":0.01700502452972911,"score_gpt":0.2437170119604473,"score_spread":0.2267119874307182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982921028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49454296,0.000014874333,0.49293545,0.0006147312,0.0002717719,0.00020263002,0.000014575956,0.00020613134,0.011196891],"genre_scores_gemma":[0.9350844,0.000006151532,0.064027816,0.00023915342,0.0000815629,0.000028387143,0.0000051614816,0.000015893092,0.0005114714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989045,0.00004531135,0.00030047397,0.0001758183,0.00039879236,0.00017507639],"domain_scores_gemma":[0.9985103,0.0005291491,0.00018026441,0.00068523287,0.0000462437,0.00004883219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002509654,0.0001399123,0.00018356739,0.00004012767,0.00023717855,0.00003762987,0.00044435117,0.000043859724,0.00023302574],"category_scores_gemma":[0.000075339674,0.000089919085,0.00011037149,0.00022545102,0.00009080048,0.0001904016,0.000119139906,0.00013420235,0.00044557636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027742713,0.00034154844,0.000071079354,0.000056536042,0.00008547213,0.000010845447,0.0040802127,0.00016346919,0.00019260448,0.9882171,0.006615899,0.00016241721],"study_design_scores_gemma":[0.00039113633,0.00010869844,0.0012016068,0.00013791607,0.000042954594,0.0004474559,0.00071006705,0.55933404,0.0015543847,0.43464658,0.0010657441,0.00035941217],"about_ca_topic_score_codex":0.000004137795,"about_ca_topic_score_gemma":3.1842944e-7,"teacher_disagreement_score":0.55917054,"about_ca_system_score_codex":0.00002446431,"about_ca_system_score_gemma":0.00004194945,"threshold_uncertainty_score":0.57271314},"labels":[],"label_agreement":null},{"id":"W1983278039","doi":"10.1016/j.tcs.2004.03.002","title":"On the number of nonterminals in linear conjunctive grammars","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Terminal and nonterminal symbols; Indexed grammar; Mathematics; Context-sensitive grammar; Disjoint sets; Discrete mathematics; Combinatorics; Rule-based machine translation; Context-free grammar; Computer science; Natural language processing","score_opus":0.00953662867562726,"score_gpt":0.262570027593138,"score_spread":0.25303339891751075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983278039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37197983,0.000004476271,0.62386066,0.0013829244,0.00031205572,0.00012419067,9.59128e-7,0.00004908715,0.002285806],"genre_scores_gemma":[0.9560714,0.0000015943289,0.04257351,0.0013033609,0.000034091903,0.0000062447157,1.4789583e-7,0.0000050850654,0.0000045816305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981133,0.00011703892,0.00028487443,0.0004875602,0.0005774156,0.00041986268],"domain_scores_gemma":[0.9982009,0.0006856254,0.00008152941,0.0008218176,0.000105095794,0.00010502506],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018713743,0.00015317148,0.0002077678,0.00011592947,0.00014699892,0.00010851314,0.0025367034,0.00004027842,0.00004239397],"category_scores_gemma":[0.00015825575,0.00009377547,0.00006798595,0.0011198401,0.002869136,0.00033264264,0.0006650636,0.00021847805,0.00011145278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011074443,0.00009586157,0.000055781376,0.0000026526513,0.000001927471,0.000016312773,0.0005785733,0.00035700746,0.00023137261,0.9931764,0.000007464099,0.0054655564],"study_design_scores_gemma":[0.0003054267,0.0001521078,0.0011337096,0.00008420089,0.0000014581866,0.000032207765,0.000017534338,0.098600045,0.008064074,0.8914698,0.0000073944598,0.0001320889],"about_ca_topic_score_codex":0.00001366407,"about_ca_topic_score_gemma":8.071539e-7,"teacher_disagreement_score":0.58409154,"about_ca_system_score_codex":0.00006085512,"about_ca_system_score_gemma":0.00012057198,"threshold_uncertainty_score":0.9998445},"labels":[],"label_agreement":null},{"id":"W1983564337","doi":"10.1016/s0166-218x(00)00338-3","title":"On the robustness of primitive words","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Prefix; Morphism; Robustness (evolution); Arithmetic; Symbol (formal); Combinatorics; Theoretical computer science; Computer science; Linguistics; Programming language; Biology","score_opus":0.02056261474225464,"score_gpt":0.21674798330922246,"score_spread":0.19618536856696783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983564337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06059911,0.00003668659,0.8468603,0.0006087132,0.00009383892,0.00033627573,0.0000049007663,0.00014143958,0.09131877],"genre_scores_gemma":[0.9524718,0.0000090409085,0.047016352,0.00022798915,0.000028657738,0.00004091991,8.8192746e-7,0.000014551207,0.0001898343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990784,0.00001670043,0.00023428141,0.00018882666,0.00029042142,0.00019138065],"domain_scores_gemma":[0.99845845,0.00053825974,0.00015745794,0.00078600796,0.000023146697,0.000036664635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026558436,0.00013755633,0.00018980094,0.00004164764,0.00008181121,0.000054784545,0.0008916677,0.00004271503,0.0001222844],"category_scores_gemma":[0.000040995477,0.000082969804,0.00006444343,0.00024992862,0.00009381978,0.00007025081,0.00017788052,0.00010981783,0.00007819948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010976771,0.00007901248,2.4877934e-7,0.000028935758,0.000014460296,8.505992e-7,0.002401178,0.00021168112,0.0006060567,0.99262106,0.0009012014,0.0031342139],"study_design_scores_gemma":[0.0003711125,0.00007124404,0.0000338425,0.0001384717,0.00002403725,0.0000092253695,0.001649391,0.6443295,0.01826366,0.3344824,0.00026532135,0.00036178436],"about_ca_topic_score_codex":3.9159997e-7,"about_ca_topic_score_gemma":1.6498093e-7,"teacher_disagreement_score":0.89187264,"about_ca_system_score_codex":0.000012460575,"about_ca_system_score_gemma":0.0000059420604,"threshold_uncertainty_score":0.33834103},"labels":[],"label_agreement":null},{"id":"W198383578","doi":"10.1007/978-3-642-39310-5_22","title":"Finite Nondeterminism vs. DFAs with Multiple Initial States","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; Deterministic finite automaton; Automaton; Deterministic automaton; Upper and lower bounds; Computer science; Finite-state machine; Branching (polymer chemistry); Discrete mathematics; Combinatorics; Mathematics; Algorithm; Theoretical computer science; Automata theory","score_opus":0.012662829003552407,"score_gpt":0.2283965026510504,"score_spread":0.21573367364749801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198383578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057505857,0.00016513518,0.99359506,0.0005393397,0.0012781386,0.00048041748,0.000015536996,0.00033631705,0.0030149766],"genre_scores_gemma":[0.44318128,0.000044529017,0.5493173,0.005479563,0.0007750927,0.000042197033,0.00002591686,0.000100916564,0.0010332275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955833,0.00004694627,0.00056253816,0.0017868149,0.0010865153,0.000933867],"domain_scores_gemma":[0.9959618,0.0013470481,0.00036335987,0.0018078183,0.0002542555,0.00026575834],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005923054,0.0007516346,0.0006791179,0.0007457056,0.0003079656,0.0010874162,0.0040683523,0.00033166213,0.00009918623],"category_scores_gemma":[0.00007651901,0.0005851663,0.00012817576,0.00049530284,0.001080931,0.0011457832,0.0015659861,0.00088423956,0.00027172823],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028289325,0.00006890271,0.000115118455,0.000073346026,0.000031967105,0.0005378359,0.0021908546,0.029700262,0.000102259226,0.013975404,0.00013928555,0.9530365],"study_design_scores_gemma":[0.00059318205,0.000543511,0.0001676945,0.0004927139,0.0000095089645,0.00015198291,4.145925e-7,0.8607174,0.0019298502,0.13118449,0.0031509583,0.0010582837],"about_ca_topic_score_codex":0.00005757495,"about_ca_topic_score_gemma":0.00006614028,"teacher_disagreement_score":0.9519782,"about_ca_system_score_codex":0.00015738135,"about_ca_system_score_gemma":0.00050503435,"threshold_uncertainty_score":0.9999496},"labels":[],"label_agreement":null},{"id":"W1984007424","doi":"10.1007/pl00013319","title":"Even faster generalized LR parsing","year":2001,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parsing; LR parser; Parsing expression grammar; Computer science; Property (philosophy); Top-down parsing; Parser combinator; Constant (computer programming); Grammar; Theory of computation; Rule-based machine translation; Symbol (formal); Algorithm; Artificial intelligence; Natural language processing; Programming language; Context-free grammar; L-attributed grammar","score_opus":0.013972496769763204,"score_gpt":0.22945046893613433,"score_spread":0.21547797216637113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984007424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.559592,0.000071323855,0.32984674,0.003860339,0.0006257072,0.00026007995,0.0000023941834,0.0006537932,0.105087616],"genre_scores_gemma":[0.9622141,0.000021774342,0.033679143,0.0034769236,0.000064052096,0.000009047437,0.0000044662934,0.0000068798486,0.0005236041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990576,0.000026400245,0.00028853086,0.00010983395,0.00020997267,0.00030768447],"domain_scores_gemma":[0.9991853,0.00006440959,0.00008615831,0.0005465903,0.000028114817,0.00008942796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023594385,0.00011435683,0.00014072128,0.00007569585,0.00010830789,0.0002471168,0.00073087064,0.000046424917,0.0001358577],"category_scores_gemma":[0.000029086625,0.00009240111,0.000055513363,0.00022214167,0.000026682317,0.0016868247,0.00022979299,0.00008611847,0.00045545347],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003790629,0.00016808684,0.0010962901,0.00010486184,0.00011585867,0.0000752243,0.019905189,0.00013273682,0.0037241378,0.27891597,0.0523417,0.643382],"study_design_scores_gemma":[0.0013095462,0.00011296999,0.003368207,0.000109265726,0.000015953796,0.00039217994,0.00032951712,0.5096484,0.0020913635,0.022708356,0.45920095,0.0007132968],"about_ca_topic_score_codex":0.00000723215,"about_ca_topic_score_gemma":7.434633e-7,"teacher_disagreement_score":0.6426687,"about_ca_system_score_codex":0.000022653054,"about_ca_system_score_gemma":0.000026579626,"threshold_uncertainty_score":0.5854085},"labels":[],"label_agreement":null},{"id":"W1984639981","doi":"10.4153/cmb-2000-012-0","title":"Cyclotomic Schur Algebras and Blocks of Cyclic Defect","year":2000,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Schur algebra; Pure mathematics; Valuation (finance); Algebra over a field","score_opus":0.004662022834058795,"score_gpt":0.185368665746441,"score_spread":0.18070664291238223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984639981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95545155,0.00030806914,0.003856791,0.0030169948,0.00003391345,0.00019502251,0.0000075779303,0.00009625618,0.03703383],"genre_scores_gemma":[0.9899309,0.000017818244,0.0076054605,0.0009776824,0.000026519381,0.000011272249,0.0000011222492,0.000013490054,0.0014157135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989302,0.000050258288,0.00025080092,0.0002737104,0.00013721807,0.00035777112],"domain_scores_gemma":[0.9988474,0.00020137556,0.000037842514,0.00046491632,0.000018322175,0.00043008992],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029508874,0.00013765774,0.0002365581,0.000107743566,0.00008035014,0.00007311133,0.0004967144,0.00008029086,0.010132437],"category_scores_gemma":[0.00008510796,0.00012356181,0.000076126744,0.00015177288,0.00012675812,0.000046684472,0.00004786214,0.00010907919,0.002723001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057226016,0.000075177464,0.0001536893,0.00012642167,0.000051679956,0.00010967408,0.0007410144,0.0000084594585,0.00053112186,0.90488786,0.014365328,0.07894383],"study_design_scores_gemma":[0.0010642903,0.00019610862,0.003245287,0.00034532827,0.000057709894,0.00057875516,0.00009585933,0.014302031,0.0026793324,0.8285429,0.14790171,0.0009906892],"about_ca_topic_score_codex":0.00067335577,"about_ca_topic_score_gemma":0.000118559954,"teacher_disagreement_score":0.13353638,"about_ca_system_score_codex":0.000033980956,"about_ca_system_score_gemma":0.00008525686,"threshold_uncertainty_score":0.9980535},"labels":[],"label_agreement":null},{"id":"W1984900662","doi":"10.1016/j.tcs.2012.03.045","title":"A study of Jacobi–Perron boundary words for the generation of discrete planes","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Mathematics; Generalization; Simple (philosophy); Dimension (graph theory); Boundary (topology); Focus (optics); Social connectedness; Fraction (chemistry); Plane (geometry); Line (geometry); Complex plane; Duality (order theory); Combinatorics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.028766549078336763,"score_gpt":0.28509171070294637,"score_spread":0.2563251616246096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984900662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39302805,0.00009692049,0.60580087,0.00014457415,0.0005289431,0.00027611692,0.0000023325824,0.000029829023,0.0000923254],"genre_scores_gemma":[0.9721154,0.0000024131712,0.027526446,0.00010575972,0.00021998344,0.000019932237,7.7008656e-7,0.0000055405876,0.0000037792233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983325,0.00011549364,0.0003172195,0.00031203942,0.00053647166,0.00038624712],"domain_scores_gemma":[0.9983217,0.00055340433,0.0001280367,0.0007820099,0.0001144235,0.00010039943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002432961,0.00012882508,0.00020277772,0.00009350321,0.0003342271,0.00012926233,0.0018897705,0.000029136214,0.0000096868225],"category_scores_gemma":[0.00006249289,0.00007723414,0.00005971497,0.0005513344,0.0015280949,0.0006116095,0.0006243093,0.00008042766,0.0000027510075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013322376,0.0002220478,0.00038084737,0.000009927254,0.000010095024,3.9262216e-7,0.006220094,0.00019250641,0.0024930038,0.9695396,0.000034888202,0.020883303],"study_design_scores_gemma":[0.00060487905,0.0011844421,0.007941484,0.00003032214,0.000030817926,0.000024257102,0.00045680444,0.9386253,0.016780468,0.033950377,0.00011914506,0.0002517529],"about_ca_topic_score_codex":0.0000069829907,"about_ca_topic_score_gemma":0.0000016563395,"teacher_disagreement_score":0.93843275,"about_ca_system_score_codex":0.000017789302,"about_ca_system_score_gemma":0.00006061193,"threshold_uncertainty_score":0.5630329},"labels":[],"label_agreement":null},{"id":"W1986197414","doi":"10.1016/s0304-3975(03)00099-9","title":"Lyndon words, permutations and trees","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.007157902298393804,"score_gpt":0.23160806403191803,"score_spread":0.22445016173352422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986197414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08667138,0.00008140658,0.9039443,0.0006130493,0.00031754503,0.00008418306,6.5543884e-7,0.00019849656,0.0080889575],"genre_scores_gemma":[0.87088054,0.0000068965296,0.12852731,0.0005268582,0.000032123615,0.000004291493,2.1093346e-7,0.0000047865146,0.000016956035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983041,0.00011763088,0.0001748932,0.00058001897,0.00039135345,0.0004319908],"domain_scores_gemma":[0.9987844,0.0002782905,0.000037141224,0.0005897539,0.00006936124,0.00024104568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011581792,0.00014209907,0.0001423983,0.00014769132,0.00045279373,0.00053042197,0.001106643,0.000033225886,0.00005431369],"category_scores_gemma":[0.00011718781,0.000113215494,0.000035209567,0.00085652067,0.0021063425,0.000687151,0.0003947959,0.00011631641,0.000044425324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.3350034e-7,0.000025596451,0.00006363233,0.0000018527885,0.0000015513377,0.000006556457,0.0004856518,0.000018055707,0.00045326486,0.97130114,0.00003127664,0.02761056],"study_design_scores_gemma":[0.00019788883,0.000100553494,0.0021003282,0.000015906262,0.00000331756,0.00012804303,0.000025784731,0.32858056,0.0029933613,0.6652718,0.00036677477,0.00021567925],"about_ca_topic_score_codex":0.0000015065348,"about_ca_topic_score_gemma":4.88722e-7,"teacher_disagreement_score":0.7842092,"about_ca_system_score_codex":0.00002304536,"about_ca_system_score_gemma":0.00008056855,"threshold_uncertainty_score":0.7760906},"labels":[],"label_agreement":null},{"id":"W1986611537","doi":"10.1016/s0195-6698(03)00044-1","title":"The set of k-power free words over Σ is empty or perfect","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Alphabet; Combinatorics; Set (abstract data type); Natural number; Finite set; Power (physics); Power set; Discrete mathematics; Generating set of a group; Linguistics; Computer science; Mathematical analysis; Geometry","score_opus":0.014190143730028755,"score_gpt":0.23495079632413993,"score_spread":0.22076065259411118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986611537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8456863,0.0039664963,0.08542411,0.0015445234,0.006971479,0.00017350486,0.000008360607,0.00008204128,0.056143165],"genre_scores_gemma":[0.9978851,0.0001238318,0.0009335023,0.000265798,0.000052426214,1.6503229e-7,6.509133e-8,0.00001940152,0.0007197071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99784464,0.0007483322,0.000525628,0.00013394687,0.00051647983,0.00023097683],"domain_scores_gemma":[0.9979884,0.00037538522,0.000530248,0.0007751769,0.0002159453,0.00011484145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030541453,0.00014165253,0.00021926177,0.0000810459,0.00015602152,0.00014766818,0.0019324998,0.00002090282,0.00007250216],"category_scores_gemma":[0.00047272336,0.00008197034,0.00016364013,0.00045299067,0.00007681964,0.00030412117,0.00023126607,0.00030308584,0.000019124194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010126627,0.00029575516,0.002250783,0.00002925309,0.00018980737,0.0007526459,0.0059991353,0.000019761135,0.00042235744,0.8372387,0.13694738,0.015753137],"study_design_scores_gemma":[0.006357355,0.0038178489,0.023941519,0.00032690846,0.00008040119,0.0013264309,0.0009881655,0.00096864544,0.009099154,0.14467509,0.80756336,0.00085511274],"about_ca_topic_score_codex":4.1593447e-7,"about_ca_topic_score_gemma":1.2818391e-7,"teacher_disagreement_score":0.69256365,"about_ca_system_score_codex":0.0000335716,"about_ca_system_score_gemma":0.00010845063,"threshold_uncertainty_score":0.35910976},"labels":[],"label_agreement":null},{"id":"W1986652500","doi":"10.1016/j.tcs.2004.01.002","title":"Representing recursively enumerable languages by iterated deletion","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Recursively enumerable language; Iterated function; Decidability; Closure (psychology); Recursively enumerable set; Characterization (materials science); Mathematics; Maximal set; Discrete mathematics; Combinatorics; Algorithm; Computer science; Programming language; Set (abstract data type); Physics","score_opus":0.004844094767187674,"score_gpt":0.23947911913918926,"score_spread":0.2346350243720016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986652500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1324933,0.00010758577,0.86202806,0.0016245494,0.00030840756,0.00011080306,0.000002009935,0.00038483855,0.0029404196],"genre_scores_gemma":[0.8955535,0.0000060621373,0.10339807,0.00091383245,0.00008759813,0.00000524995,0.0000028784657,0.00000828327,0.000024486502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976304,0.000096830176,0.0002572385,0.0007953004,0.0005898597,0.0006303245],"domain_scores_gemma":[0.9986227,0.00014027947,0.00008388536,0.0007758854,0.00015854841,0.00021869387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013056999,0.00018031657,0.00017272172,0.0001401792,0.0004811829,0.00072572526,0.0021081108,0.00005563862,0.00003496659],"category_scores_gemma":[0.00012107531,0.00015246867,0.000056863624,0.0011782236,0.0011255392,0.0010824635,0.00074634916,0.00019952904,0.00012515669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033114648,0.000054269865,0.000019490662,0.000003734242,0.0000030172384,0.000021240581,0.0004764296,0.00021074669,0.015697652,0.95965165,0.00018275126,0.023675695],"study_design_scores_gemma":[0.00075200055,0.0002651132,0.0004801957,0.00013042788,0.0000069485723,0.0001636876,0.00004326766,0.25866705,0.18370567,0.5546453,0.0005353739,0.00060495693],"about_ca_topic_score_codex":0.000019662284,"about_ca_topic_score_gemma":2.360479e-7,"teacher_disagreement_score":0.7630602,"about_ca_system_score_codex":0.00008219075,"about_ca_system_score_gemma":0.000089689405,"threshold_uncertainty_score":0.69981855},"labels":[],"label_agreement":null},{"id":"W1987374824","doi":"10.1016/j.tcs.2005.03.036","title":"Palindromic factors of billiard words","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Dynamical billiards; Palindrome; Dimension (graph theory); Mathematics; Prefix; Fourth Dimension; Combinatorics; Pure mathematics; Physics; Geometry; Linguistics; Philosophy; Spacetime","score_opus":0.009619744018541267,"score_gpt":0.23842521909478898,"score_spread":0.2288054750762477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987374824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3814632,0.000024798117,0.6162395,0.0004573176,0.0003190973,0.00006653887,0.0000013709833,0.00014870832,0.001279493],"genre_scores_gemma":[0.8680679,0.000003748181,0.1315224,0.00028779337,0.00010079662,0.0000015926388,4.054497e-7,0.000006448749,0.00000886937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977563,0.000078213074,0.0003527598,0.0005980153,0.0006827653,0.0005319406],"domain_scores_gemma":[0.9982569,0.00028287934,0.000100564255,0.0010121258,0.00010814517,0.00023939137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012667443,0.00018528996,0.000259277,0.00022209118,0.00019145611,0.000190281,0.0032895498,0.000054442626,0.00008811366],"category_scores_gemma":[0.00006235651,0.00013536027,0.00009949879,0.0011055445,0.0024144792,0.00075512746,0.001021449,0.00015392335,0.00007952971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002409204,0.000057786896,0.00018740982,0.0000037398365,0.000003075499,0.0000021088786,0.0006394457,0.00015324076,0.0016394982,0.94383043,0.0000264045,0.053454477],"study_design_scores_gemma":[0.00029024694,0.00022949286,0.0044864863,0.000046753128,0.000005863434,0.000029750705,0.00001967068,0.7160932,0.080447316,0.19758935,0.000383412,0.00037848018],"about_ca_topic_score_codex":0.0000031529946,"about_ca_topic_score_gemma":3.5383977e-7,"teacher_disagreement_score":0.74624103,"about_ca_system_score_codex":0.000050225877,"about_ca_system_score_gemma":0.000103632796,"threshold_uncertainty_score":0.8896249},"labels":[],"label_agreement":null},{"id":"W1987543317","doi":"10.1016/j.jalgebra.2007.08.025","title":"The submonoid and rational subset membership problems for graph groups","year":2007,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Decidability; Combinatorics; Transitive relation; Finitely-generated abelian group; Graph; Discrete mathematics; Free group; Stallings theorem about ends of groups; Group (periodic table)","score_opus":0.01381376619524257,"score_gpt":0.2361503351207185,"score_spread":0.22233656892547593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987543317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44394654,0.0025414303,0.5469879,0.004973687,0.00093199173,0.0002255053,0.000002093575,0.000031863656,0.00035900908],"genre_scores_gemma":[0.98109376,0.000081021506,0.017895952,0.0004544975,0.0003986029,0.0000027605752,7.1365685e-7,0.0000074388363,0.00006525275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990269,0.000037316066,0.00035250466,0.00010209849,0.00024651372,0.00023466923],"domain_scores_gemma":[0.99864614,0.00068304536,0.0002862468,0.00015025956,0.000139994,0.00009428735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030733387,0.00008106392,0.00011830481,0.00006719531,0.00023450231,0.00020035262,0.0004837876,0.000037685884,0.0000041760554],"category_scores_gemma":[0.00007888087,0.00004978935,0.0000929497,0.00015986666,0.0000636952,0.000457932,0.000051940293,0.00012521718,0.0000013072548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006288529,0.00003705889,0.0011504041,0.000015984515,0.00005836005,0.000012658865,0.0006521744,0.000035062625,0.001314975,0.9723753,0.005785286,0.01849986],"study_design_scores_gemma":[0.0009196051,0.0003581453,0.021426989,0.00004112244,0.000018589442,0.00047431167,0.00017746829,0.0020946404,0.0027015042,0.9586848,0.012933281,0.00016954211],"about_ca_topic_score_codex":0.000001194841,"about_ca_topic_score_gemma":0.000014543964,"teacher_disagreement_score":0.5371472,"about_ca_system_score_codex":0.000016552554,"about_ca_system_score_gemma":0.000050401093,"threshold_uncertainty_score":0.20303507},"labels":[],"label_agreement":null},{"id":"W1987608226","doi":"10.1016/j.tcs.2006.07.020","title":"Incremental construction of minimal deterministic finite cover automata","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Deterministic finite automaton; Cover (algebra); DFA minimization; Deterministic automaton; Nondeterministic finite automaton; Automaton; Finite-state machine; Quantum finite automata; Regular language; ω-automaton; Büchi automaton; Two-way deterministic finite automaton; Computer science; Nested word; Algorithm; Mathematics; Discrete mathematics; Automata theory; Theoretical computer science","score_opus":0.005976703962465163,"score_gpt":0.2199071007742895,"score_spread":0.21393039681182432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987608226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23908252,0.00001127872,0.7554189,0.0001377303,0.0004880059,0.00009620809,0.0000061171,0.000183267,0.004575987],"genre_scores_gemma":[0.8042331,9.987046e-7,0.19551712,0.00013905953,0.00009293064,0.0000028419188,0.0000014344783,0.000005738808,0.0000067870214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977141,0.000091725306,0.00043012222,0.0005864743,0.00071143,0.00046612532],"domain_scores_gemma":[0.9984519,0.00038610137,0.00015065387,0.00076481607,0.00012168626,0.00012486547],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009782008,0.00018414065,0.00024088858,0.00020393931,0.00024040074,0.0002503019,0.0019238587,0.000052341653,0.00006939721],"category_scores_gemma":[0.000058147798,0.0001585357,0.000076305085,0.00082697795,0.003913573,0.0006729653,0.0009688875,0.00011495635,0.00007759108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000898094,0.000076951284,0.0001548839,0.0000098696955,0.000002530875,0.000010219362,0.000059419734,0.00012699045,0.0044360836,0.9734037,0.000058843805,0.021651542],"study_design_scores_gemma":[0.00033794684,0.00022429683,0.0029045588,0.000033563472,0.0000062583463,0.000094509145,0.000004901187,0.7235513,0.028247453,0.24433182,0.00005501642,0.00020838996],"about_ca_topic_score_codex":0.000008248891,"about_ca_topic_score_gemma":2.1109773e-7,"teacher_disagreement_score":0.72907186,"about_ca_system_score_codex":0.000048590846,"about_ca_system_score_gemma":0.00012253987,"threshold_uncertainty_score":0.9987972},"labels":[],"label_agreement":null},{"id":"W1987700418","doi":"10.1016/j.aam.2014.08.005","title":"On the asymptotic abelian complexity of morphic words","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Carnegie Mellon University; Williams College; National Science Foundation","keywords":"Morphism; Mathematics; Abelian group; Iterated function; Permutation (music); Factorization; Binary number; Combinatorics on words; Discrete mathematics; Combinatorics; Word (group theory); Arithmetic; Algorithm","score_opus":0.018564101112235377,"score_gpt":0.24585175278698648,"score_spread":0.2272876516747511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987700418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03412473,0.0001621934,0.89813554,0.0004549976,0.0001685621,0.00031138424,0.0000019442973,0.00012301421,0.06651764],"genre_scores_gemma":[0.8708634,0.00002020059,0.12873839,0.0003092778,0.000016968314,0.000024368857,4.7901193e-7,0.000008949481,0.000018002054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989883,0.0000301468,0.00030938868,0.0002031176,0.00026431083,0.00020474674],"domain_scores_gemma":[0.99776554,0.0012061009,0.00018331564,0.00080103305,0.000013497078,0.000030516896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775189,0.00013403164,0.00023586661,0.00006829154,0.00005704729,0.00002905322,0.0010153973,0.0000350411,0.000020107384],"category_scores_gemma":[0.0001118275,0.00008814909,0.00003763095,0.00033987046,0.00021155525,0.00009961376,0.00015802793,0.00013293058,0.000049439863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001744856,0.00009308869,0.000014018408,0.00006803259,0.000002473287,3.4761186e-7,0.000441056,0.00037059464,0.00016190718,0.98846024,0.000031667365,0.010354807],"study_design_scores_gemma":[0.0001548921,0.00003052729,0.00008529727,0.00007921184,0.0000023182167,0.0000018126653,0.000085944295,0.072652884,0.0023010394,0.9241037,0.0003996003,0.00010280471],"about_ca_topic_score_codex":0.0000011291812,"about_ca_topic_score_gemma":0.0000044904896,"teacher_disagreement_score":0.83673865,"about_ca_system_score_codex":0.00001750519,"about_ca_system_score_gemma":0.000010457921,"threshold_uncertainty_score":0.35946155},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02369577806896057,"score_gpt":0.28019506612564216,"score_spread":0.2564992880566816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988560957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25379166,0.00017713581,0.7431424,0.0014025528,0.0012015288,0.000039930495,0.0000037120674,0.000019793955,0.00022127718],"genre_scores_gemma":[0.867025,0.00004660935,0.13250837,0.00025666514,0.00012233171,7.022726e-7,0.0000011282496,0.0000027967967,0.00003639206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984963,0.00004732483,0.0004357657,0.0001850142,0.00070844113,0.00012718677],"domain_scores_gemma":[0.998478,0.000098300676,0.00025736814,0.0002390115,0.00083958067,0.000087764165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006767123,0.00008729793,0.00013227543,0.0004668607,0.00015551352,0.00044081945,0.0014656376,0.000016730708,0.000049801103],"category_scores_gemma":[0.00006087452,0.00007679475,0.000054439537,0.00040646462,0.00040645342,0.0025349811,0.00031566122,0.000107292675,0.000010373747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022050082,0.00045666657,0.0011858151,0.000011584554,0.0001253593,0.000056602465,0.0050518154,0.008758323,0.011380502,0.25491345,0.0009345284,0.7171033],"study_design_scores_gemma":[0.00073496666,0.00033127097,0.030349849,0.0000874015,0.000010648622,0.00063872995,0.00007886842,0.94260556,0.002690879,0.02115416,0.0011240048,0.00019364168],"about_ca_topic_score_codex":0.00001886329,"about_ca_topic_score_gemma":0.000003823117,"teacher_disagreement_score":0.93384725,"about_ca_system_score_codex":0.000056607547,"about_ca_system_score_gemma":0.00008977614,"threshold_uncertainty_score":0.4250832},"labels":[],"label_agreement":null},{"id":"W1989500448","doi":"10.1017/s0004972700021985","title":"Applications of Fox's derivation in determining the generators of a group","year":2000,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Corollary; Rank (graph theory); Group (periodic table); Quotient; Combinatorics; Set (abstract data type); Exponent; Inverse; Generating set of a group; Normal subgroup; Free group; Function (biology); Pure mathematics; Discrete mathematics; Geometry","score_opus":0.012149415538495275,"score_gpt":0.23323880290840102,"score_spread":0.22108938736990574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989500448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9265775,0.000032732838,0.06627827,0.005223773,0.000032295997,0.0006567303,0.000008561928,0.000037580456,0.0011525458],"genre_scores_gemma":[0.96044254,0.0000053399826,0.039043844,0.00015799845,0.000012825474,0.000033267144,6.592214e-7,0.000006203151,0.0002973033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989847,0.00007423409,0.00042988756,0.00013768197,0.00023216817,0.00014134338],"domain_scores_gemma":[0.99895054,0.0002513483,0.00019134724,0.0005528278,0.000034302928,0.000019619165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005528855,0.000087813096,0.00018667466,0.000011455956,0.000055185013,0.000014933906,0.0009485238,0.00006148307,0.00027922963],"category_scores_gemma":[0.000039389553,0.00005241002,0.00019220995,0.0002841199,0.00021374994,0.000029832097,0.0001202073,0.00009760723,0.000010982815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001766371,0.0020153313,0.0071075205,0.0013267731,0.00018468601,5.6513505e-7,0.015119309,0.000773262,0.012300183,0.7819162,0.022593778,0.15664472],"study_design_scores_gemma":[0.0035217921,0.00036964193,0.13572824,0.0015959182,0.00020149836,0.000032423843,0.002975593,0.05262634,0.12950349,0.60153157,0.07066268,0.0012508135],"about_ca_topic_score_codex":0.000017182443,"about_ca_topic_score_gemma":3.95833e-7,"teacher_disagreement_score":0.18038464,"about_ca_system_score_codex":0.000014495524,"about_ca_system_score_gemma":0.000013303043,"threshold_uncertainty_score":0.30573687},"labels":[],"label_agreement":null},{"id":"W1989650631","doi":"10.1016/j.jnt.2005.05.009","title":"Littlewood Pisot numbers","year":2005,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Unimodular matrix; Combinatorics; Integer (computer science); Polynomial; Unit disk; Algebraic number; Unit (ring theory); Unit circle; Limit point; Real number; Limit (mathematics); Sequence (biology); Degree (music); Discrete mathematics; Mathematical analysis","score_opus":0.006574619413747264,"score_gpt":0.23967466772785323,"score_spread":0.23310004831410597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989650631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2028972,0.0016615684,0.60984695,0.007675045,0.0030506703,0.00018595652,0.000020815869,0.00033767184,0.1743241],"genre_scores_gemma":[0.9333276,0.000050089006,0.06081141,0.0022847564,0.0010589393,0.0000016745151,7.3047164e-7,0.000021064789,0.002443716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985434,0.00020340935,0.0004691745,0.00015232273,0.00036544976,0.00026627895],"domain_scores_gemma":[0.9985075,0.0004253216,0.000375222,0.00040759018,0.00012185863,0.00016249786],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014243391,0.00014087188,0.0002385279,0.000088011264,0.00007467885,0.00012230453,0.0011539703,0.0000672712,0.0019693521],"category_scores_gemma":[0.00012504948,0.00011014062,0.00021084068,0.00022774578,0.00006453475,0.0010049022,0.00013804968,0.00028813328,0.00059765583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051972125,0.00026631987,0.00039053377,0.000011095277,0.0001148015,0.000119053235,0.0017708206,0.000066295834,0.00074125954,0.71077704,0.06961139,0.2160794],"study_design_scores_gemma":[0.0013763561,0.00016472566,0.0017016459,0.0001710326,0.00004084106,0.0038031687,0.00038490427,0.0016729411,0.0040908675,0.55300814,0.43309176,0.0004936524],"about_ca_topic_score_codex":0.0000011948142,"about_ca_topic_score_gemma":8.1074677e-7,"teacher_disagreement_score":0.7304304,"about_ca_system_score_codex":0.00006613368,"about_ca_system_score_gemma":0.00008493737,"threshold_uncertainty_score":0.998943},"labels":[],"label_agreement":null},{"id":"W1989809437","doi":"10.1007/s10469-006-0003-x","title":"The Word Problem for Polynilpotent Groups with a Single Primitive Defining Relation","year":2006,"lang":"en","type":"article","venue":"Algebra and Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decidability; Word problem (mathematics education); Word (group theory); Relation (database); Mathematics; Algebra over a field; Group (periodic table); Arithmetic; Discrete mathematics; Pure mathematics; Computer science; Geometry","score_opus":0.008830095110271812,"score_gpt":0.19235040427547537,"score_spread":0.18352030916520357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989809437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40658566,0.0018458666,0.5832445,0.0024707448,0.00010154348,0.00049589074,0.0000020846198,0.00022688835,0.005026818],"genre_scores_gemma":[0.9716708,0.000009056496,0.027803613,0.00027373602,0.000036741967,0.000042376385,0.000004625034,0.000006205074,0.00015285338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993316,0.00003139304,0.00011775681,0.00022054785,0.00009376437,0.00020497334],"domain_scores_gemma":[0.99943435,0.00027291328,0.00007814902,0.00016027574,0.000029424318,0.000024905994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022471766,0.00009025919,0.0000785434,0.000024323923,0.00033603286,0.0001848756,0.00017414607,0.000033939126,8.827119e-7],"category_scores_gemma":[0.000011203457,0.00005126106,0.000025930914,0.00012314622,0.000060882245,0.00020568256,0.000058824153,0.00005437911,0.0000036206993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001336151,0.000025976706,0.0003472148,0.000004697208,0.000006686775,0.000002226861,0.00019590266,0.000023761802,0.0003568925,0.95444804,0.00013780911,0.044437442],"study_design_scores_gemma":[0.0007272315,0.0005743089,0.03868086,0.00005620469,0.000020090223,0.00006144276,0.00020034196,0.010821538,0.0008390143,0.9448601,0.0028935499,0.0002653273],"about_ca_topic_score_codex":0.000014964069,"about_ca_topic_score_gemma":0.000018443403,"teacher_disagreement_score":0.5650851,"about_ca_system_score_codex":0.000015638838,"about_ca_system_score_gemma":0.000014687979,"threshold_uncertainty_score":0.2584527},"labels":[],"label_agreement":null},{"id":"W1990598022","doi":"10.1080/00207160108805105","title":"Morphisms preserving densities","year":2001,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Endomorphism; Mathematics; Morphism; Monoid; Ideal (ethics); Pure mathematics; Permutation (music); Confluence; Free monoid; Algebra over a field; Discrete mathematics","score_opus":0.0162750095180927,"score_gpt":0.25387399568813473,"score_spread":0.23759898617004205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990598022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10278955,0.00009928258,0.8929126,0.0015362869,0.001687773,0.000029655204,6.0849135e-7,0.000045399018,0.000898795],"genre_scores_gemma":[0.43659464,0.00006670757,0.5614217,0.0007057407,0.00097317103,7.9082395e-7,5.6506343e-7,0.000011417589,0.00022528978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860686,0.0000323761,0.0004934399,0.000097014075,0.0006345702,0.00013574486],"domain_scores_gemma":[0.99856484,0.00022207279,0.00040864997,0.00024631707,0.000490304,0.00006783061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004297685,0.000107778586,0.00018729574,0.000208098,0.000033786353,0.00030995917,0.0020129147,0.00003370011,0.0000454449],"category_scores_gemma":[0.000037611262,0.000087503664,0.00012851464,0.000103683844,0.00002757991,0.0007550882,0.00038885768,0.00012810151,0.000028559201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037304133,0.0008755162,0.000970875,0.00005685032,0.0007844625,0.0028650353,0.010236553,0.0060985517,0.0020102246,0.7952052,0.02570643,0.15515305],"study_design_scores_gemma":[0.00066959613,0.00013102175,0.00088406785,0.00032979334,0.000015044109,0.007229418,0.00011259424,0.70650005,0.0010300474,0.2711819,0.01168034,0.00023610686],"about_ca_topic_score_codex":0.0000017041863,"about_ca_topic_score_gemma":4.1091113e-7,"teacher_disagreement_score":0.7004015,"about_ca_system_score_codex":0.00004487861,"about_ca_system_score_gemma":0.00004398006,"threshold_uncertainty_score":0.374053},"labels":[],"label_agreement":null},{"id":"W1991636160","doi":"10.1016/s0304-3975(02)00070-1","title":"McNaughton families of languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Chomsky hierarchy; Rewriting; Abstract family of languages; Formal language; String (physics); Closure (psychology); Hierarchy; Recursively enumerable language; Class (philosophy); Cone (formal languages); Complexity class; Confluence; Computer science; Mathematics; Turing machine; Regular language; Language family; Context (archaeology); Automaton; Linguistics; Discrete mathematics; Theoretical computer science; Programming language; Artificial intelligence; Time complexity; Second-generation programming language","score_opus":0.005738167963395646,"score_gpt":0.23805565448284552,"score_spread":0.23231748651944986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991636160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11656452,0.00008055004,0.860915,0.00016441433,0.00031136483,0.00007081626,9.651942e-7,0.00015040723,0.021741971],"genre_scores_gemma":[0.8498205,0.0000062298477,0.14986965,0.00026008615,0.000025058105,0.0000018803917,1.7455035e-7,0.0000043044947,0.000012110168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982944,0.00011425657,0.0002299715,0.00045166077,0.0005112868,0.00039843126],"domain_scores_gemma":[0.99862105,0.00024202338,0.000065078115,0.00082219613,0.00011239016,0.00013723805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014029009,0.00013306586,0.00019013982,0.0001742817,0.0001601877,0.00013800288,0.0018838905,0.000035706507,0.000055704706],"category_scores_gemma":[0.00013183044,0.000101942795,0.000059751314,0.0010543572,0.0021768436,0.00046517042,0.0004307133,0.000100665486,0.00004177751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011918178,0.000037356134,0.00006336941,0.000005969165,0.0000020368875,0.000005456909,0.00037584023,0.000023152685,0.002951535,0.975213,0.000027428769,0.021293676],"study_design_scores_gemma":[0.00031837125,0.00025183012,0.0013124377,0.00004908321,0.0000052510386,0.0000772784,0.00009330523,0.11169977,0.2191929,0.66595095,0.00068209897,0.00036673894],"about_ca_topic_score_codex":0.000003036348,"about_ca_topic_score_gemma":1.9891667e-7,"teacher_disagreement_score":0.733256,"about_ca_system_score_codex":0.000019053563,"about_ca_system_score_gemma":0.000087720546,"threshold_uncertainty_score":0.8020671},"labels":[],"label_agreement":null},{"id":"W1992572359","doi":"10.1016/j.jsc.2009.04.004","title":"Corrigendum to: “On ordering free groups” [J. Symbolic Comput. 40 (2005) 1285–1290]","year":2009,"lang":"en","type":"erratum","venue":"Journal of Symbolic Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.016467723170452926,"score_gpt":0.25548833239834035,"score_spread":0.23902060922788743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992572359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009022537,0.0030773229,0.8451194,0.0050479495,0.12349852,0.0008653538,0.00003573729,0.000576514,0.012756646],"genre_scores_gemma":[0.5625531,0.003923729,0.20953111,0.036845542,0.08165942,0.000088604844,0.000672765,0.0012885986,0.10343709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9941519,0.00032169878,0.0018357061,0.00085496274,0.0018178129,0.001017901],"domain_scores_gemma":[0.99512213,0.00029220482,0.0020336097,0.0012001022,0.00068435987,0.00066761195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013786347,0.00085673673,0.001533423,0.001694956,0.00032883784,0.0007994471,0.003806634,0.0005861928,0.00004517748],"category_scores_gemma":[0.00030078457,0.0008045246,0.0005752639,0.00115035,0.00006355514,0.0007609796,0.00062611524,0.0019930927,0.00020953304],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052869957,0.00026332546,0.000009722224,0.00008979901,0.00014094979,0.0002595133,0.0012800393,0.0066418815,0.000073828065,0.0060345903,0.8755413,0.109612174],"study_design_scores_gemma":[0.0038542207,0.0038087792,0.019492816,0.005282515,0.00028983815,0.0025103823,0.000285924,0.3075384,0.00020440307,0.08501564,0.5684884,0.0032286872],"about_ca_topic_score_codex":0.000026914899,"about_ca_topic_score_gemma":0.000013688454,"teacher_disagreement_score":0.6355883,"about_ca_system_score_codex":0.00053850096,"about_ca_system_score_gemma":0.00071252906,"threshold_uncertainty_score":0.99944055},"labels":[],"label_agreement":null},{"id":"W1992893569","doi":"10.1080/00207160.2012.681305","title":"Composition and orbits of language operations: finiteness and upper bounds","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Closure (psychology); Mathematics; Complement (music); Suffix; Prefix; Equivalence (formal languages); Regular language; Natural number; Bounded function; Discrete mathematics; Set (abstract data type); Monoid; Equivalence relation; Combinatorics; Computer science; Linguistics; Automaton","score_opus":0.010947214938033701,"score_gpt":0.26872210716132505,"score_spread":0.25777489222329136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992893569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51005,0.0003864779,0.48887178,0.00024008316,0.0003511762,0.000023319099,0.0000021010364,0.000007242808,0.000067847664],"genre_scores_gemma":[0.75868875,0.000061676226,0.24088605,0.00015379071,0.0001960254,4.933526e-7,9.425427e-7,0.0000039109227,0.000008394399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999214,0.00003188475,0.0003450048,0.000057479763,0.0002702536,0.000081383994],"domain_scores_gemma":[0.9992705,0.00016603844,0.00018970224,0.000100083846,0.00021542257,0.000058254536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003640124,0.00007439618,0.0001541784,0.00014209672,0.00002808427,0.00013560249,0.00034375154,0.000027639897,0.00000721897],"category_scores_gemma":[0.00001735846,0.000059059435,0.000037682672,0.000053096912,0.000040460585,0.0007183312,0.00017146063,0.00006852906,0.0000016989884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024783898,0.001022232,0.00372371,0.00018037835,0.0004348883,0.000053914915,0.03854279,0.0005492991,0.013467805,0.8145592,0.00043866626,0.12700231],"study_design_scores_gemma":[0.003415492,0.0005074892,0.035504576,0.0017508529,0.00011620005,0.009680589,0.0012303775,0.8735586,0.019655058,0.052510753,0.001316112,0.0007539392],"about_ca_topic_score_codex":0.0000018164516,"about_ca_topic_score_gemma":1.8853275e-7,"teacher_disagreement_score":0.87300926,"about_ca_system_score_codex":0.000013855177,"about_ca_system_score_gemma":0.00001783934,"threshold_uncertainty_score":0.2408374},"labels":[],"label_agreement":null},{"id":"W1993054401","doi":"10.1007/s00026-009-0008-y","title":"Enumeration of Decomposable Combinatorial Structures with Restricted Patterns","year":2009,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Combinatorial analysis; Class (philosophy); Enumerative combinatorics; Focus (optics); Gravitational singularity; Discrete mathematics; Computer science","score_opus":0.01984716435851521,"score_gpt":0.27020818073847463,"score_spread":0.25036101637995944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993054401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95737666,0.00022838087,0.039776318,0.0006789339,0.00059028395,0.00016915407,0.000008192569,0.00010712164,0.0010649319],"genre_scores_gemma":[0.9986843,0.000058853155,0.0010275547,0.00016825888,0.000029188697,0.0000017835662,0.000008477907,0.0000069411053,0.000014666401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868685,0.00007925461,0.0003505973,0.00022487168,0.0004314149,0.00022699418],"domain_scores_gemma":[0.9985759,0.00011097529,0.00031654278,0.000547013,0.00037539715,0.00007414031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019328823,0.00014974375,0.0002929339,0.00014227883,0.00006207514,0.000049620696,0.0006918331,0.000079936246,0.000006473217],"category_scores_gemma":[0.000043141463,0.00012651322,0.000062886866,0.0005828922,0.000035590427,0.00041056576,0.00006330846,0.000111296045,0.0000011860171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036309884,0.00023990133,0.0015723046,0.000021634845,0.000021300932,0.000006369536,0.00019412198,0.00007086064,0.0012858541,0.99167055,0.0007007823,0.00417999],"study_design_scores_gemma":[0.0010161018,0.0014516765,0.04416514,0.000059920974,0.000009904683,0.000008170855,0.000022627535,0.0021377592,0.15152124,0.7989935,0.0003860578,0.00022788673],"about_ca_topic_score_codex":0.00003097885,"about_ca_topic_score_gemma":6.661933e-7,"teacher_disagreement_score":0.19267704,"about_ca_system_score_codex":0.000009362951,"about_ca_system_score_gemma":0.00007222716,"threshold_uncertainty_score":0.5159059},"labels":[],"label_agreement":null},{"id":"W1993527583","doi":"10.1007/s11047-010-9179-z","title":"A relation by palindromic subwords","year":2010,"lang":"en","type":"article","venue":"Natural Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Palindrome; Equivalence relation; Mathematics; Relation (database); Alphabet; Combinatorics; Equivalence class (music); Identity function; Idempotence; Combinatorics on words; Discrete mathematics; Pure mathematics; Word (group theory); Computer science; Genetics; Genome; Biology; Linguistics","score_opus":0.0033221391414186424,"score_gpt":0.21989578805717122,"score_spread":0.2165736489157526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993527583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92477024,0.00019963461,0.07087763,0.0004547903,0.0024297729,0.000065304586,5.066727e-7,0.00040029033,0.000801812],"genre_scores_gemma":[0.9729762,7.63085e-7,0.026382787,0.00033380554,0.00016287513,5.163123e-7,0.0000065313693,0.0000070514866,0.00012948185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991053,0.00003672811,0.00016686537,0.00027645612,0.00017904225,0.00023565452],"domain_scores_gemma":[0.9993552,0.00015291575,0.00008678049,0.00031656152,0.000037533904,0.000050994528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003793995,0.00010370736,0.00010010437,0.00005038936,0.00017384351,0.00015383838,0.0006147126,0.00008293434,0.000010298088],"category_scores_gemma":[0.00006403525,0.00009123687,0.000049294125,0.00024108445,0.000025036523,0.00030779775,0.00020993482,0.00054109434,0.00005357749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068753147,0.000058631205,0.004208725,0.000016179483,0.000022591496,0.000020933916,0.001092788,0.00007053722,0.24452034,0.20574412,0.0100348145,0.53420347],"study_design_scores_gemma":[0.00036170668,0.000024923655,0.017258015,0.000023101364,0.0000034071174,0.00008275538,0.000013478606,0.96294683,0.0066410843,0.00800477,0.0043315864,0.00030831472],"about_ca_topic_score_codex":0.000015964597,"about_ca_topic_score_gemma":0.0000033587735,"teacher_disagreement_score":0.9628763,"about_ca_system_score_codex":0.000016103253,"about_ca_system_score_gemma":0.000017851644,"threshold_uncertainty_score":0.37205315},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.019626468324232184,"score_gpt":0.3115234385093699,"score_spread":0.2918969701851377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993598446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029762989,0.000041211617,0.967342,0.0006098791,0.00194528,0.00013495385,0.00003526027,0.00003132327,0.000097065546],"genre_scores_gemma":[0.4162287,0.0000032109028,0.583382,0.00011463033,0.0002521708,0.0000032916132,0.0000021107132,0.000003752228,0.000010094727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832445,0.000026534213,0.00053429906,0.00024254473,0.00067191396,0.0002002672],"domain_scores_gemma":[0.99682206,0.00063362095,0.00059030025,0.000289866,0.0015703135,0.000093834526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010455672,0.00010474817,0.00017476229,0.00046865456,0.00016104123,0.00047160688,0.0026049868,0.00002704171,0.000017788727],"category_scores_gemma":[0.00018941988,0.000093959265,0.00013152987,0.00030493998,0.0002852047,0.0013826564,0.00016879152,0.00006669148,0.0000038048875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001196648,0.0003379331,0.00006251855,0.000008961214,0.00006025287,0.0000062987274,0.0010708723,0.015855601,0.0030703715,0.062348615,0.0004068219,0.9167598],"study_design_scores_gemma":[0.0007968201,0.00030316747,0.00020910666,0.00005241596,0.000007765319,0.00015170747,0.00005412672,0.9905261,0.004742849,0.0019137909,0.0011365281,0.00010565588],"about_ca_topic_score_codex":0.0000020703756,"about_ca_topic_score_gemma":2.3098838e-7,"teacher_disagreement_score":0.97467047,"about_ca_system_score_codex":0.00006829335,"about_ca_system_score_gemma":0.00015869369,"threshold_uncertainty_score":0.4840757},"labels":[],"label_agreement":null},{"id":"W1993691575","doi":"10.1142/s0218196711006194","title":"AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Alphabet; Rank (graph theory); Automaton; Combinatorics; Binary number; Construct (python library); Finite-state machine; Free product; Discrete mathematics; Free group; Order (exchange); Deterministic finite automaton; Quantum finite automata; Group (periodic table); Automata theory; Arithmetic; Algorithm; Theoretical computer science; Computer science","score_opus":0.017270216816107443,"score_gpt":0.25289321984143515,"score_spread":0.2356230030253277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993691575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6925459,0.00020606707,0.3061979,0.00021281387,0.0006025168,0.000031539144,0.0000031576712,0.000020264219,0.000179856],"genre_scores_gemma":[0.9434476,0.000045836372,0.05614133,0.00019727142,0.00015274448,8.033316e-7,0.0000027752978,0.000006012384,0.0000056113868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881566,0.00006808317,0.0004683778,0.00012845524,0.00042616483,0.00009327224],"domain_scores_gemma":[0.99890417,0.00010307695,0.0005085789,0.00012893649,0.00030038998,0.00005484767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004011136,0.00009462811,0.00016152977,0.00022270468,0.000037592497,0.00007348861,0.00077424303,0.000038388916,0.000021794762],"category_scores_gemma":[0.000047621274,0.00008203304,0.0000795404,0.00010891677,0.00004008922,0.0008180003,0.00022719006,0.00009363253,0.0000018300597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033861527,0.0009080849,0.008951004,0.000066601504,0.0009329773,0.00044477909,0.014500536,0.002418571,0.03302903,0.45553887,0.004020097,0.47885084],"study_design_scores_gemma":[0.00302246,0.0006407399,0.11554394,0.00024427872,0.00003592039,0.000689483,0.00018463211,0.58261174,0.005639523,0.29101852,0.000098551194,0.000270245],"about_ca_topic_score_codex":0.000017920762,"about_ca_topic_score_gemma":0.0000011926445,"teacher_disagreement_score":0.58019316,"about_ca_system_score_codex":0.000022776994,"about_ca_system_score_gemma":0.000050078357,"threshold_uncertainty_score":0.33452103},"labels":[],"label_agreement":null},{"id":"W1994084299","doi":"10.1016/j.tcs.2004.11.003","title":"The generative capacity of block-synchronized context-free grammars","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Language family; Tree-adjoining grammar; Rule-based machine translation; Nesting (process); Computer science; Mathematics; Block (permutation group theory); Context (archaeology); Generative grammar; Context-free language; Programming language; Discrete mathematics; Context-free grammar; Combinatorics; Artificial intelligence; Linguistics; Geography","score_opus":0.010678476020316978,"score_gpt":0.22125262563059822,"score_spread":0.21057414961028123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994084299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12522005,0.000092589435,0.869927,0.0031435345,0.0006261336,0.0001894711,0.000003302436,0.00014912526,0.0006487891],"genre_scores_gemma":[0.8546125,0.0000089268615,0.14468177,0.000594994,0.00008334865,0.000007591052,1.9582535e-7,0.000006358963,0.0000042897404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735034,0.00016383111,0.00039105958,0.0006131351,0.0008381631,0.00064345234],"domain_scores_gemma":[0.99704117,0.0005475386,0.00014222895,0.0017694515,0.00027688916,0.00022274753],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0022403572,0.0002119689,0.0002663188,0.00009361957,0.0008158079,0.0004139494,0.0058890367,0.000053777574,0.000008060428],"category_scores_gemma":[0.00027585131,0.00013262247,0.00011311484,0.0009971884,0.007648738,0.0005011946,0.001812523,0.00022428932,0.000024993078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007928015,0.000049873222,0.0000062963745,0.0000031727652,0.0000071189056,0.000005286259,0.0006937232,0.00024299936,0.002226927,0.97732776,0.00003730982,0.019391607],"study_design_scores_gemma":[0.0006438316,0.0001820549,0.00018787506,0.00002882737,0.000004433832,0.00004615688,0.000021750218,0.098349206,0.044241197,0.85601324,0.0000933127,0.00018810846],"about_ca_topic_score_codex":0.000023309687,"about_ca_topic_score_gemma":0.000007069569,"teacher_disagreement_score":0.72939247,"about_ca_system_score_codex":0.00010313015,"about_ca_system_score_gemma":0.00025918602,"threshold_uncertainty_score":0.9994896},"labels":[],"label_agreement":null},{"id":"W1994122595","doi":"10.1142/s0129054103002138","title":"COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unary operation; Mathematics; Combinatorics; Deterministic finite automaton; Upper and lower bounds; Alphabet; Discrete mathematics; Integer (computer science); Nondeterministic finite automaton; Quantum finite automata; Regular language; Automaton; Finite-state machine; Algorithm; Automata theory; Computer science; Theoretical computer science","score_opus":0.009420720844945022,"score_gpt":0.2876393450828633,"score_spread":0.2782186242379183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994122595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27298307,0.00006364044,0.7242616,0.0009913943,0.001149977,0.0000327773,0.0000027371111,0.000008717349,0.0005061388],"genre_scores_gemma":[0.8779517,0.000018410408,0.12178225,0.00016274818,0.00006297246,6.4938405e-7,7.292062e-7,0.0000031753718,0.000017353083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790365,0.000074401556,0.0006288887,0.00015822826,0.0010704075,0.00016440042],"domain_scores_gemma":[0.9968911,0.00042202973,0.000824215,0.00026121593,0.0015483616,0.000053102758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019224212,0.00009093989,0.00015633827,0.00021522079,0.00014670221,0.00028528404,0.002782609,0.000017134353,0.000032302178],"category_scores_gemma":[0.00021210575,0.000065914595,0.00009508502,0.00057318347,0.0004433037,0.0014523261,0.00021866975,0.000109118715,0.0000041737903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029448998,0.00052865007,0.009638851,0.000019178193,0.00026482082,0.000019775951,0.0051102014,0.008294003,0.03103008,0.8417147,0.0035357538,0.09981458],"study_design_scores_gemma":[0.0024362758,0.00040554284,0.015972907,0.00053286157,0.00005248146,0.0017649251,0.0008350748,0.693938,0.12056488,0.13697007,0.02584009,0.0006868625],"about_ca_topic_score_codex":0.0000145507,"about_ca_topic_score_gemma":5.124869e-7,"teacher_disagreement_score":0.7047446,"about_ca_system_score_codex":0.000057833728,"about_ca_system_score_gemma":0.00036300588,"threshold_uncertainty_score":0.51708263},"labels":[],"label_agreement":null},{"id":"W1994343490","doi":"10.1142/s0129054111008945","title":"SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Schema (genetic algorithms); Computer science; Tuple; Inverse; Regular language; Theoretical computer science; Mathematics; Algorithm; Programming language; Discrete mathematics; Automaton","score_opus":0.0348316647130958,"score_gpt":0.2930144194345859,"score_spread":0.2581827547214901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994343490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07451221,0.000070748305,0.9237387,0.00066337717,0.0007732,0.000066796216,0.0000015781023,0.0000139798685,0.000159405],"genre_scores_gemma":[0.5643983,0.000021147147,0.43536034,0.00012564087,0.00008681808,0.000001397974,6.4805744e-7,0.000001725032,0.0000039746838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988355,0.000021177875,0.00042106071,0.00016373544,0.00045220775,0.00010629285],"domain_scores_gemma":[0.9977031,0.0001005837,0.00044002596,0.00018978483,0.0014982128,0.00006832996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000921844,0.00006998107,0.000122043726,0.0004023785,0.00009798667,0.000175298,0.0014742882,0.000020971223,0.000009205584],"category_scores_gemma":[0.0001064597,0.000060880437,0.0000657459,0.00030433817,0.00022676324,0.0018601922,0.00020610758,0.000056906658,0.000001905293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054555305,0.00018853604,0.0010537623,0.000013227469,0.00008189601,0.0000073292663,0.0012231866,0.00015364934,0.005599864,0.7700448,0.00029987685,0.22127931],"study_design_scores_gemma":[0.0029161852,0.0012682057,0.0945101,0.0004985639,0.00004054992,0.0012671627,0.000076916884,0.55329436,0.0229702,0.31688225,0.00577367,0.0005018114],"about_ca_topic_score_codex":0.0000041132434,"about_ca_topic_score_gemma":4.475781e-7,"teacher_disagreement_score":0.5531407,"about_ca_system_score_codex":0.00003758584,"about_ca_system_score_gemma":0.00016400739,"threshold_uncertainty_score":0.2739619},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02362928073566646,"score_gpt":0.2931312758776484,"score_spread":0.269501995141982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994383533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20060815,0.00006407322,0.7958196,0.0029751617,0.0002989211,0.000057614754,0.000014609709,0.0000051251113,0.00015677908],"genre_scores_gemma":[0.8678965,0.000052712323,0.13189788,0.00010270799,0.00004291895,6.750583e-7,7.5004107e-7,0.0000015579978,0.00000432028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982924,0.00006162865,0.0007303647,0.000100762,0.0007186124,0.00009626817],"domain_scores_gemma":[0.9973412,0.00042518243,0.00075948745,0.00022771032,0.0011994716,0.00004695609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014716861,0.00007101161,0.00019426431,0.00038564316,0.00008649602,0.00011335158,0.0019775934,0.000012553436,0.000008947511],"category_scores_gemma":[0.000083843675,0.000049740956,0.00009518789,0.00041778947,0.0012003276,0.0016762345,0.00020985842,0.00008842015,0.0000010315367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000953148,0.0002713031,0.00045704746,0.000023155817,0.00014830739,0.0000020237271,0.012953534,0.037822016,0.0027847055,0.68831784,0.00014000207,0.25698477],"study_design_scores_gemma":[0.0015379424,0.00014037151,0.008499186,0.00011102908,0.0000129976015,0.00012802465,0.00006153894,0.90161705,0.009017411,0.07816547,0.00061813387,0.0000908293],"about_ca_topic_score_codex":0.000019389241,"about_ca_topic_score_gemma":0.0000059443496,"teacher_disagreement_score":0.86379504,"about_ca_system_score_codex":0.000028053124,"about_ca_system_score_gemma":0.00023599078,"threshold_uncertainty_score":0.44226575},"labels":[],"label_agreement":null},{"id":"W1994937806","doi":"10.1090/s0025-5718-2012-02532-4","title":"The Prouhet-Tarry-Escott problem for Gaussian integers","year":2012,"lang":"en","type":"preprint","venue":"Mathematics of Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Ideal (ethics); Gaussian; Combinatorics; Gaussian integer; Mathematics; Discrete mathematics; Gaussian elimination; Physics; Quantum mechanics","score_opus":0.023728592431746548,"score_gpt":0.2803132365579818,"score_spread":0.2565846441262353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994937806","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036752454,0.00035681514,0.9914428,0.0009134852,0.00072671275,0.0013748576,0.00001168724,0.00018068316,0.0013176913],"genre_scores_gemma":[0.39889663,0.000014987087,0.6005698,0.00003855613,0.00011569661,0.00020851629,0.000030332782,0.000030133202,0.00009536955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821556,0.00007427252,0.00070200564,0.00031360728,0.00037394583,0.00032061816],"domain_scores_gemma":[0.9972657,0.00079980673,0.00090804405,0.0007242053,0.00023583537,0.00006641594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014050291,0.00026312255,0.00037867675,0.00010060344,0.00017224648,0.00029404278,0.0013335531,0.00016486298,0.0000017989519],"category_scores_gemma":[0.00009281117,0.00018525535,0.0002020984,0.00013511532,0.00009227397,0.00020472343,0.00070079527,0.00024578394,0.000012376279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009336798,0.00027350508,0.000008686711,0.0024318458,0.00013371112,5.155847e-7,0.009051438,0.0054457593,0.00021817922,0.8852544,0.0018828408,0.09528979],"study_design_scores_gemma":[0.00013049682,0.000032907577,0.000023531913,0.00029173828,0.00002578204,0.000003883369,0.00012676722,0.41857934,0.00087006326,0.5794489,0.00030062877,0.00016598564],"about_ca_topic_score_codex":0.0000065463496,"about_ca_topic_score_gemma":0.0000023898335,"teacher_disagreement_score":0.4131336,"about_ca_system_score_codex":0.000058132347,"about_ca_system_score_gemma":0.00011855656,"threshold_uncertainty_score":0.7554494},"labels":[],"label_agreement":null},{"id":"W1995220817","doi":"10.1007/s00236-009-0090-y","title":"On the closure of pattern expressions languages under intersection with regular languages","year":2009,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Abstract family of languages; Intersection (aeronautics); Closure (psychology); Complement (music); Theory of computation; Language family; Cone (formal languages); Computer science; Second-generation programming language; Regular language; Mathematics; Linguistics; Programming language; Artificial intelligence; Fifth-generation programming language; Philosophy","score_opus":0.005861879333243367,"score_gpt":0.22553346134852395,"score_spread":0.2196715820152806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995220817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.871696,0.000034035107,0.09592893,0.0057476964,0.000052178217,0.00020011391,0.000004770813,0.00019111935,0.026145173],"genre_scores_gemma":[0.99673223,0.0000028307068,0.00094132614,0.0022203617,0.000016697482,0.000004460438,0.0000027507206,0.0000032186638,0.00007612431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993998,0.000034040935,0.00015897247,0.000077935656,0.00019889632,0.00013039247],"domain_scores_gemma":[0.99915713,0.0001557205,0.00010851993,0.0005237734,0.000025435305,0.000029405155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016110465,0.00009032618,0.00009814963,0.000056428056,0.00007030698,0.00006523928,0.00048594785,0.00003488502,0.00004469393],"category_scores_gemma":[0.000030234052,0.000046588855,0.00003594027,0.000111698304,0.000035484773,0.00041835647,0.000060072853,0.00010902343,0.000019161818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005774196,0.00029975025,0.00027484904,0.00009875704,0.00013486051,0.000023535722,0.03589805,0.00032216974,0.012271047,0.77165425,0.023588601,0.15537637],"study_design_scores_gemma":[0.006399761,0.00880624,0.16134357,0.0064112213,0.00021883035,0.0007447284,0.16571121,0.11088646,0.3887028,0.1353283,0.011792856,0.0036540353],"about_ca_topic_score_codex":0.000008902917,"about_ca_topic_score_gemma":0.0000025601191,"teacher_disagreement_score":0.63632596,"about_ca_system_score_codex":0.000011117611,"about_ca_system_score_gemma":0.00001355844,"threshold_uncertainty_score":0.18998383},"labels":[],"label_agreement":null},{"id":"W1995677215","doi":"10.1002/mana.200310338","title":"Lazard's Theorem for<i>S</i>‐posets","year":2005,"lang":"en","type":"article","venue":"Mathematische Nachrichten","topic":"semigroups and automata theory","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Flatness (cosmology); Functor; Pure mathematics; Tensor product; Indecomposable module; Flat module; Monoid; Property (philosophy); Quotient; Algebra over a field; Discrete mathematics; Finitely-generated abelian group; Projective module","score_opus":0.012549179343731624,"score_gpt":0.24527817056894996,"score_spread":0.23272899122521834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995677215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111183375,0.0008500571,0.95001686,0.0030153715,0.00022419,0.00045738215,0.000014359538,0.0007985224,0.033504937],"genre_scores_gemma":[0.6464138,0.000014447444,0.34966737,0.0013509837,0.00033028208,0.00011584003,0.0000071047325,0.00003496442,0.0020652143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985391,0.000049782062,0.00030445436,0.00040888175,0.00027478894,0.00042301766],"domain_scores_gemma":[0.9985712,0.00032111304,0.0001309582,0.0008017342,0.00006600278,0.000108981054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072366634,0.00021324007,0.00026659342,0.00009490905,0.00015854134,0.00019188508,0.0012301566,0.0000880527,0.000071612376],"category_scores_gemma":[0.00008658907,0.00017014336,0.00015307429,0.00025513745,0.000041653682,0.00062574213,0.00025722865,0.00011332253,0.00048437808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053489302,0.000111129295,0.0000202066,0.000036688416,0.000035810805,0.0000038092526,0.000981115,0.000029024024,0.0024665426,0.87998474,0.019966697,0.09635889],"study_design_scores_gemma":[0.0018257259,0.00017638758,0.00030011262,0.0001102944,0.00005152896,0.00018837242,0.000117347794,0.21037583,0.03371272,0.5018464,0.25030094,0.0009943582],"about_ca_topic_score_codex":0.0000022660836,"about_ca_topic_score_gemma":0.0000020355833,"teacher_disagreement_score":0.63529545,"about_ca_system_score_codex":0.000032663,"about_ca_system_score_gemma":0.00003501231,"threshold_uncertainty_score":0.6938245},"labels":[],"label_agreement":null},{"id":"W1995777777","doi":"10.1016/j.tcs.2007.07.034","title":"Transition complexity of language operations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transition (genetics); Computer science; Programming language; Theoretical computer science; Linguistics; Chemistry; Philosophy","score_opus":0.015023758854855974,"score_gpt":0.26985739425449723,"score_spread":0.25483363539964127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995777777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21795307,0.000014698478,0.77935743,0.00044762815,0.00019541135,0.00007471221,0.0000019165373,0.00012265067,0.0018324631],"genre_scores_gemma":[0.7664945,5.8823696e-7,0.23306644,0.0003796484,0.000052310148,7.5582955e-7,9.474874e-7,0.0000028598529,0.0000019127208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849486,0.000053664702,0.0002664843,0.00036019314,0.00046591522,0.00035885046],"domain_scores_gemma":[0.99895895,0.00013649008,0.000032996813,0.00059140986,0.00012619802,0.00015395271],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022034633,0.00010289214,0.00014752719,0.00016398935,0.00023113126,0.00012445562,0.0014705306,0.00003233461,0.000047031303],"category_scores_gemma":[0.000032231037,0.00008489464,0.000053633612,0.0009216372,0.0031738605,0.00054529216,0.00030443066,0.00010368922,0.00002364616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003649467,0.000054044955,0.0000038496896,0.0000041965704,0.0000015586852,0.000006895387,0.002073955,0.00013552053,0.012465857,0.96260977,0.0000049150844,0.022635773],"study_design_scores_gemma":[0.00019651194,0.00014114252,0.0018067331,0.000022156413,0.000003045383,0.00003824708,0.00006825585,0.7221876,0.09492436,0.18043993,0.000009210435,0.00016280607],"about_ca_topic_score_codex":0.000012095165,"about_ca_topic_score_gemma":0.0000031108145,"teacher_disagreement_score":0.7821698,"about_ca_system_score_codex":0.00002715727,"about_ca_system_score_gemma":0.000055819943,"threshold_uncertainty_score":0.99953896},"labels":[],"label_agreement":null},{"id":"W1996644214","doi":"10.1016/j.tcs.2009.05.002","title":"Operational state complexity of nested word automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Finite-state machine; Nested word; Quantum finite automata; Discrete mathematics; Mathematics; Automaton; Upper and lower bounds; Word (group theory); Constant (computer programming); Deterministic finite automaton; Combinatorics; State (computer science); Automata theory; Computer science; Theoretical computer science; Algorithm","score_opus":0.019453934358182844,"score_gpt":0.2631941083867752,"score_spread":0.24374017402859235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996644214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.133635,0.000015704658,0.86149853,0.0023902573,0.0002887552,0.000129295,0.000004049328,0.00028962188,0.0017487629],"genre_scores_gemma":[0.7929554,0.0000019566462,0.20591988,0.0010645142,0.000044682103,0.0000013408988,0.0000014979405,0.0000034649538,0.000007281242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754494,0.00012221307,0.00039415012,0.000612529,0.0008301284,0.0004960272],"domain_scores_gemma":[0.99827814,0.00016799544,0.00010112244,0.0009899883,0.00023317202,0.00022959439],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014597279,0.00018282981,0.00026372718,0.00018425695,0.00029271437,0.0003410987,0.0030742749,0.000035406785,0.000049893293],"category_scores_gemma":[0.00006147287,0.0001478519,0.0000683698,0.0012580793,0.0033579955,0.00093871617,0.0006662856,0.00014701276,0.000044109223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007015777,0.000103675986,0.000015237519,0.0000029533624,0.0000020832506,0.000006684172,0.00026829567,0.00015941674,0.002028051,0.9085039,0.000052486183,0.088850185],"study_design_scores_gemma":[0.00018408593,0.00016993782,0.008687686,0.000019393034,0.0000014103349,0.000027761198,0.0000019068655,0.51492286,0.0062884227,0.46952313,0.000034428525,0.0001389525],"about_ca_topic_score_codex":0.0000035354312,"about_ca_topic_score_gemma":2.8014054e-7,"teacher_disagreement_score":0.65932035,"about_ca_system_score_codex":0.000038058493,"about_ca_system_score_gemma":0.00016974827,"threshold_uncertainty_score":0.9993543},"labels":[],"label_agreement":null},{"id":"W1997031552","doi":"10.1016/j.jalgebra.2009.09.040","title":"Submonoids and rational subsets of groups with infinitely many ends","year":2009,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Pure mathematics","score_opus":0.00683257774827001,"score_gpt":0.20885056648383107,"score_spread":0.20201798873556107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997031552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94206095,0.00055731344,0.05565095,0.001127762,0.000084780266,0.000028168724,9.662018e-7,0.000012650206,0.00047647828],"genre_scores_gemma":[0.9832282,0.000049085178,0.016235007,0.00037483126,0.00008619132,2.1466113e-7,4.2120348e-7,0.0000034127697,0.00002261942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99913305,0.000036847854,0.0003123103,0.000095929354,0.00030212078,0.00011976647],"domain_scores_gemma":[0.9992449,0.00008681661,0.0003128815,0.00015045458,0.00012212232,0.00008279933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039513566,0.00008699813,0.00018728156,0.00014898297,0.00003861332,0.00006873025,0.0003437188,0.000035135236,0.000015637097],"category_scores_gemma":[0.000020405294,0.000061402476,0.000048306327,0.00019537318,0.00004648861,0.0006434221,0.000033352157,0.00012942104,0.0000017172159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020666816,0.0003239149,0.010002878,0.000026689657,0.00011180813,0.00024800102,0.0021997213,0.00009957651,0.012984193,0.8436404,0.0019131731,0.12824301],"study_design_scores_gemma":[0.0027548943,0.0031746873,0.79370534,0.00021823602,0.000047997924,0.0026068296,0.00017139068,0.0064511513,0.016918918,0.1720045,0.0015324092,0.00041365728],"about_ca_topic_score_codex":8.6850844e-7,"about_ca_topic_score_gemma":5.7263367e-7,"teacher_disagreement_score":0.78370243,"about_ca_system_score_codex":0.000011474438,"about_ca_system_score_gemma":0.000065720706,"threshold_uncertainty_score":0.25039202},"labels":[],"label_agreement":null},{"id":"W1997415583","doi":"10.1016/j.jcta.2011.07.005","title":"Binary bubble languages and cool-lex order","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Guelph; University of Victoria","funders":"","keywords":"Substring; Mathematics; Combinatorics; Lexicographical order; Binary number; String (physics); Discrete mathematics; Order (exchange); De Bruijn sequence; Set (abstract data type); Computer science; Arithmetic","score_opus":0.010322232063146836,"score_gpt":0.2343718908907133,"score_spread":0.22404965882756647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997415583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94575953,0.00402947,0.020768395,0.0005611595,0.009658907,0.00020062835,0.000004262553,0.00019492456,0.0188227],"genre_scores_gemma":[0.9897966,0.00014345162,0.009079728,0.00018831607,0.000356766,0.0000017191276,3.1161272e-7,0.000015086543,0.00041801692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988475,0.00021453778,0.00034198674,0.00014534219,0.00023889783,0.00021176258],"domain_scores_gemma":[0.9988852,0.00017109368,0.00030268202,0.000302601,0.0002090415,0.00012934227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011907272,0.00014884895,0.00028597616,0.000121433404,0.00011305136,0.00010989628,0.00070633134,0.00007605016,0.00013491126],"category_scores_gemma":[0.00016127212,0.00011432186,0.000074589065,0.0002507126,0.000143554,0.0011584561,0.00024855003,0.00020619843,0.000007935443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003570206,0.0001054057,0.00010860169,0.000012159039,0.000050399765,0.0001619455,0.0023052772,8.381462e-7,0.001081019,0.9903746,0.0007114349,0.0047312896],"study_design_scores_gemma":[0.0011989616,0.0011920689,0.0013675159,0.00006321981,0.000026360793,0.00061367435,0.0013261802,0.000056033565,0.006591406,0.97852254,0.008809183,0.00023282801],"about_ca_topic_score_codex":0.000006614,"about_ca_topic_score_gemma":3.1603037e-7,"teacher_disagreement_score":0.04403705,"about_ca_system_score_codex":0.000018344374,"about_ca_system_score_gemma":0.00008173148,"threshold_uncertainty_score":0.46619102},"labels":[],"label_agreement":null},{"id":"W1997591489","doi":"10.1016/j.ic.2014.08.005","title":"Conservative groupoids recognize only regular languages","year":2014,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Class (philosophy); Mathematics; Double groupoid; Hierarchy; Semigroup; Associative property; Regular language; Property (philosophy); Context (archaeology); Conservative extension; Pure mathematics; Algebra over a field; Computer science; Discrete mathematics; Theoretical computer science; Artificial intelligence; Automaton","score_opus":0.006634479812632228,"score_gpt":0.2306338532912243,"score_spread":0.22399937347859206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997591489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117409624,0.000023618026,0.8754151,0.0007868879,0.0001041487,0.000079352954,0.000001431042,0.00020687778,0.0059729535],"genre_scores_gemma":[0.9700907,0.000006728866,0.027303189,0.0024789863,0.000027831677,0.0000047348312,0.000036929814,0.0000024513067,0.000048483802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994359,0.000059224472,0.00019466424,0.00008798741,0.00012808455,0.00009413342],"domain_scores_gemma":[0.9995391,0.00010758213,0.000114369126,0.00011124198,0.00008539024,0.000042330714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003149592,0.00007357595,0.000079935584,0.00008636193,0.00009766868,0.00022304167,0.00013283649,0.000036372072,0.000005020051],"category_scores_gemma":[0.00005238532,0.000066959976,0.000018233613,0.00015396936,0.000026687498,0.0017098848,0.00005602771,0.000049661896,0.00007426072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031685909,0.0000064401224,0.00016617277,0.000014929733,0.000004946359,2.6381466e-7,0.0017572673,0.00012669245,0.000024247149,0.2095095,0.0008261736,0.78756016],"study_design_scores_gemma":[0.00067233015,0.00010394467,0.026475413,0.000031696043,0.0000042209554,0.000040190975,0.00057831506,0.90926826,0.000370318,0.046493262,0.01575716,0.00020486095],"about_ca_topic_score_codex":0.000019380828,"about_ca_topic_score_gemma":0.0000022734157,"teacher_disagreement_score":0.9091416,"about_ca_system_score_codex":0.0000111827085,"about_ca_system_score_gemma":0.00001965924,"threshold_uncertainty_score":0.27305487},"labels":[],"label_agreement":null},{"id":"W1999696434","doi":"10.1016/j.tcs.2005.07.016","title":"A generalization of repetition threshold","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Repetition (rhetorical device); Generalization; Alphabet; Mathematics; Word (group theory); Combinatorics on words; Combinatorics; Discrete mathematics; Existential quantification; Arithmetic; Linguistics; Geometry; Mathematical analysis","score_opus":0.00790752423281006,"score_gpt":0.23576885501357725,"score_spread":0.2278613307807672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999696434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083721265,0.00003116095,0.91113544,0.0009426612,0.00021574335,0.000072780735,6.601902e-7,0.00015823451,0.0037220502],"genre_scores_gemma":[0.7939142,0.0000047942467,0.20543034,0.0005154708,0.00012164603,0.0000022127954,6.247009e-7,0.0000035994024,0.0000071149757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846476,0.00004453942,0.0002580424,0.0004259476,0.00051287556,0.00029386123],"domain_scores_gemma":[0.9988902,0.000064612665,0.000079437865,0.00070484023,0.00014625677,0.0001146571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010870954,0.000103969986,0.00013491724,0.00015540613,0.00015427411,0.00014376495,0.0015520147,0.00003448339,0.00005583127],"category_scores_gemma":[0.00003139667,0.00008539558,0.00004870948,0.0008670666,0.0011889302,0.00081550353,0.0005219034,0.00007264252,0.000041326195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002042056,0.000041131017,0.000028910137,0.0000034375466,0.0000012073463,0.0000011879159,0.00020568629,0.00072730845,0.0048356466,0.95344484,0.000045682307,0.04066291],"study_design_scores_gemma":[0.00011167118,0.000073191986,0.00040428998,0.000018972234,0.0000017365433,0.000018891886,0.0000015972441,0.7647955,0.0430463,0.19128673,0.00013636387,0.00010480933],"about_ca_topic_score_codex":0.0000011657044,"about_ca_topic_score_gemma":2.6156115e-7,"teacher_disagreement_score":0.7640681,"about_ca_system_score_codex":0.000035184556,"about_ca_system_score_gemma":0.000058512647,"threshold_uncertainty_score":0.43806633},"labels":[],"label_agreement":null},{"id":"W1999769297","doi":"10.1007/s00208-006-0767-2","title":"Varieties of finite supersolvable groups with the M. Hall property","year":2006,"lang":"en","type":"article","venue":"Mathematische Annalen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Variety (cybernetics); Monoid; Prime (order theory); Abelian group; Decidability; Exponent; Combinatorics; Integer (computer science); Free product; Finitely-generated abelian group; Group (periodic table); Pure mathematics; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.009781479622519029,"score_gpt":0.18378348197055647,"score_spread":0.17400200234803745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999769297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11136109,0.0012015627,0.80551976,0.0070228837,0.00009738685,0.00057006744,0.000012366383,0.00041188888,0.07380298],"genre_scores_gemma":[0.96504873,0.000010468456,0.024362575,0.0002957433,0.00005994594,0.00003893461,0.0000033362028,0.000018025807,0.010162224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989643,0.00006136828,0.00019980546,0.00022813077,0.00030303444,0.00024332425],"domain_scores_gemma":[0.9989214,0.00018427458,0.000117275216,0.0006688248,0.0000804474,0.000027783266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046258417,0.00014939699,0.00020009813,0.00004531715,0.0001289187,0.0001211188,0.0009014335,0.000042292435,0.000054325512],"category_scores_gemma":[0.000016138698,0.00006591804,0.0000617268,0.00025952075,0.00013911365,0.0004044315,0.00017975506,0.00010581514,0.000055895383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001573478,0.00020577246,0.0003106578,0.00016100559,0.000056126002,0.000017682112,0.0035622895,0.00024761146,0.0021086715,0.9622574,0.0279438,0.00311327],"study_design_scores_gemma":[0.0026001986,0.0013537804,0.009904672,0.0007758448,0.00017047128,0.0004303398,0.0025408785,0.25541326,0.07193382,0.54356605,0.10918541,0.0021252912],"about_ca_topic_score_codex":0.00017462636,"about_ca_topic_score_gemma":0.000031590425,"teacher_disagreement_score":0.85368764,"about_ca_system_score_codex":0.000006293523,"about_ca_system_score_gemma":0.000035478555,"threshold_uncertainty_score":0.26880595},"labels":[],"label_agreement":null},{"id":"W2000137537","doi":"10.5539/cis.v6n2p134","title":"A Generic Tool for Teaching Compilers","year":2013,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Compiler; Programming language; Parsing; Compiler construction; Compiler correctness; Optimizing compiler; Automaton; Generality; Unification; Syntax; Theoretical computer science; Artificial intelligence","score_opus":0.010235786043284739,"score_gpt":0.22836915222298557,"score_spread":0.21813336617970083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000137537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08660264,0.000010436,0.91093963,0.00043509505,0.00036514673,0.00022512584,0.0000010472788,0.00012360424,0.0012972766],"genre_scores_gemma":[0.67689425,0.0000048258516,0.31962457,0.003368634,0.000056727084,0.000032822394,0.0000024088438,0.0000016960704,0.000014052154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917495,0.000012705581,0.00021007557,0.00016044891,0.00021087432,0.000230943],"domain_scores_gemma":[0.99937403,0.00007455978,0.00007667622,0.00025985326,0.00013273327,0.00008213087],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.000645285,0.0000809261,0.00008285534,0.00017979664,0.00042595025,0.0011015414,0.0007311918,0.000018804285,0.000005206658],"category_scores_gemma":[0.000028727767,0.000065187705,0.000024999808,0.00027966744,0.00016294575,0.014949217,0.00031689592,0.000055806675,0.00006582401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.722155e-7,0.0000069013986,0.00009867755,0.000013598141,0.0000015791126,5.458739e-8,0.0017831773,0.00016493189,0.00037194148,0.27875316,0.0035643387,0.7152411],"study_design_scores_gemma":[0.00018471187,0.000049399925,0.009145263,0.000008746402,6.6288504e-7,0.00001395332,0.000042336243,0.9707081,0.00021918336,0.0029277115,0.016578052,0.00012192935],"about_ca_topic_score_codex":0.000005976174,"about_ca_topic_score_gemma":3.061468e-8,"teacher_disagreement_score":0.97054315,"about_ca_system_score_codex":0.000019865704,"about_ca_system_score_gemma":0.000049212646,"threshold_uncertainty_score":0.9999354},"labels":[],"label_agreement":null},{"id":"W2000194783","doi":"10.1016/j.tcs.2013.07.005","title":"Linear circuits, two-variable logic and weakly blocked monoids","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Predicate (mathematical logic); Closure (psychology); Discrete mathematics; Class (philosophy); Algebraic number; Predicate logic; First-order logic; Variable (mathematics); Expressive power; Predicate variable; Electronic circuit; Algorithm; Arithmetic; Computer science; Zeroth-order logic; Theoretical computer science; Multimodal logic; Programming language","score_opus":0.00827689966408616,"score_gpt":0.2272841832801425,"score_spread":0.21900728361605634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000194783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09775909,0.00007792944,0.8949532,0.0013944879,0.00045885664,0.00023628646,0.0000010002402,0.00038745953,0.0047317217],"genre_scores_gemma":[0.76682824,0.000005373187,0.23132396,0.0016534048,0.0001370759,0.000013383663,4.709509e-7,0.000008589596,0.000029515311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725693,0.00012341808,0.00031064192,0.0009470259,0.0005683284,0.00079367147],"domain_scores_gemma":[0.9979327,0.00032796335,0.00007170355,0.0010276396,0.00020047362,0.00043953335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013911698,0.00025096824,0.0002735731,0.00017479644,0.00047647828,0.00089309603,0.0025642097,0.00006802982,0.00017159928],"category_scores_gemma":[0.000090837835,0.00019470055,0.00004719376,0.0011237544,0.0025739009,0.0012210753,0.001684428,0.00024555175,0.00032391635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.3130755e-7,0.000040138744,0.00003964911,0.000005751356,0.000003222221,0.000005595945,0.00016618363,0.00006914788,0.0050303116,0.94388366,0.000094162446,0.050661325],"study_design_scores_gemma":[0.00017130825,0.00010521989,0.00057884696,0.000016774236,0.0000026865812,0.000054480028,0.0000059053896,0.55054593,0.0019258679,0.44630742,0.00008502174,0.0002005043],"about_ca_topic_score_codex":0.000024907291,"about_ca_topic_score_gemma":1.5802742e-7,"teacher_disagreement_score":0.6690691,"about_ca_system_score_codex":0.00003762617,"about_ca_system_score_gemma":0.00010607939,"threshold_uncertainty_score":0.9483645},"labels":[],"label_agreement":null},{"id":"W2000227786","doi":"10.1007/s00233-008-9095-z","title":"The ideal retraction property for completely regular semigroups","year":2008,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Ideal (ethics); Property (philosophy); Algebra over a field; Minimal ideal; Regular semigroup; Pure mathematics; Semigroup; Arithmetic; Discrete mathematics; Maximal ideal; Special classes of semigroups","score_opus":0.022564038144710474,"score_gpt":0.23146566079528821,"score_spread":0.20890162265057774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000227786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057321638,0.0032193172,0.89915985,0.02355932,0.004319032,0.002470642,0.000045739525,0.0020276941,0.007876755],"genre_scores_gemma":[0.96393144,0.00037408638,0.023309283,0.0024323843,0.0006195159,0.00032090594,0.00004136233,0.00007531136,0.0088957185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99737,0.000111832465,0.0004754453,0.000641426,0.00050988933,0.00089140225],"domain_scores_gemma":[0.9977294,0.00051710726,0.00022650362,0.0012107202,0.00015854476,0.00015768729],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009573124,0.00029802514,0.00028466666,0.00007934113,0.0018019497,0.0002241988,0.0015905286,0.00017784687,0.0000087408835],"category_scores_gemma":[0.00015456967,0.00017341042,0.00025603,0.00040462165,0.00022413039,0.0008274533,0.0003210585,0.00031765684,0.00007948633],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014800082,0.00018120585,0.0011593679,0.000048285172,0.00011092211,0.000049870996,0.001081127,0.000054806707,0.012738108,0.36211354,0.50117105,0.1211437],"study_design_scores_gemma":[0.0008926384,0.0003793957,0.0026206227,0.000048797316,0.000014683453,0.0005555678,0.00034423976,0.07101753,0.0058073252,0.038621258,0.8791243,0.0005736428],"about_ca_topic_score_codex":0.00010796948,"about_ca_topic_score_gemma":0.00005837159,"teacher_disagreement_score":0.9066098,"about_ca_system_score_codex":0.00010887349,"about_ca_system_score_gemma":0.00009154705,"threshold_uncertainty_score":0.9994976},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2000777414","doi":"10.1016/s0304-3975(99)00020-1","title":"Efficient implementation of regular languages using reversed alternating finite automata","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Deterministic finite automaton; Finite-state machine; Nondeterministic finite automaton; Automaton; Computer science; Representation (politics); Regular language; Theoretical computer science; Quantum finite automata; Mathematics; Algorithm; Automata theory","score_opus":0.00972641191193077,"score_gpt":0.2902834371344849,"score_spread":0.28055702522255416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000777414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52428734,0.000014338095,0.47476283,0.000097683784,0.000108784465,0.000085615495,0.0000024691465,0.00011331745,0.0005276193],"genre_scores_gemma":[0.80864286,0.000001961565,0.19111615,0.00017169477,0.0000538724,0.0000015504335,8.0391044e-7,0.000006235053,0.000004858453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782544,0.00012256968,0.00036412533,0.0005369381,0.0007034539,0.0004474853],"domain_scores_gemma":[0.99865323,0.00020327859,0.000118873366,0.0007987797,0.00009573186,0.00013009139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001543309,0.00015335351,0.00019793044,0.00016723784,0.00025602413,0.00019440602,0.0017795358,0.00003182861,0.00026105117],"category_scores_gemma":[0.000030877643,0.00013159902,0.000066424494,0.0009144523,0.0009902357,0.00030079685,0.0004953887,0.00009565095,0.000028733337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046210316,0.000047827452,0.00005674055,0.000012372568,0.000005289167,0.000014803524,0.0009535726,0.014089417,0.0067924056,0.772479,0.0000071223226,0.20553681],"study_design_scores_gemma":[0.00030310772,0.00008568143,0.0009498731,0.000052219377,0.0000055083096,0.000027435603,0.000047207905,0.9624105,0.02307857,0.012862039,0.000015103577,0.00016272785],"about_ca_topic_score_codex":0.000032181026,"about_ca_topic_score_gemma":3.2426937e-7,"teacher_disagreement_score":0.9483211,"about_ca_system_score_codex":0.000052630407,"about_ca_system_score_gemma":0.000079828074,"threshold_uncertainty_score":0.53664523},"labels":[],"label_agreement":null},{"id":"W2001273190","doi":"10.1142/s0129054112400461","title":"STATE COMPLEXITY AND APPROXIMATION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Computational complexity theory; Computer science; Theoretical computer science; Quantum complexity theory; Mathematics; Algorithm; Quantum computer","score_opus":0.0314267423021446,"score_gpt":0.3057200336348058,"score_spread":0.2742932913326612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001273190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2381769,0.000056766236,0.7595593,0.0006750331,0.0013201003,0.000029815079,0.0000015043344,0.000011496722,0.00016909587],"genre_scores_gemma":[0.72747165,0.000012121071,0.27229202,0.000094520125,0.00012301198,3.717924e-7,4.724427e-7,0.0000015801843,0.000004251585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998619,0.000035993275,0.00038865444,0.00010812606,0.0007001318,0.00014807058],"domain_scores_gemma":[0.9983174,0.00011052983,0.00044872088,0.0001815565,0.000835674,0.00010609466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013420861,0.00006805473,0.0001154314,0.0003989813,0.0000916146,0.00025558885,0.0014420301,0.000012485663,0.000007576619],"category_scores_gemma":[0.00006916944,0.00005818746,0.00004364943,0.00032866825,0.000404693,0.0036737258,0.00035190905,0.00007546242,0.0000041639573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010754506,0.00024488746,0.004678679,0.000008076308,0.000048334743,0.0000030673632,0.0025993753,0.00045123356,0.00505609,0.629798,0.00015346929,0.35694802],"study_design_scores_gemma":[0.0012291985,0.0003014278,0.2666045,0.00016698257,0.0000159049,0.0012527974,0.000077173194,0.49257642,0.021308795,0.21300696,0.0030806107,0.00037920917],"about_ca_topic_score_codex":0.000005806207,"about_ca_topic_score_gemma":4.4971108e-7,"teacher_disagreement_score":0.49212518,"about_ca_system_score_codex":0.000053829477,"about_ca_system_score_gemma":0.00013324841,"threshold_uncertainty_score":0.26796746},"labels":[],"label_agreement":null},{"id":"W2001279658","doi":"10.1016/j.tcs.2006.02.003","title":"Synchronizing groups and automata","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Synchronizing; Mathematics; Combinatorics; Property (philosophy); Word (group theory); Permutation group; Discrete mathematics; Character (mathematics); Prime (order theory); Automaton; Cyclic permutation; Symmetric group; Computer science; Theoretical computer science; Topology (electrical circuits)","score_opus":0.004610918180651434,"score_gpt":0.20743109213955863,"score_spread":0.2028201739589072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001279658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14524841,0.00009315015,0.84830284,0.00085020764,0.0003581703,0.00008865991,7.877691e-7,0.00051882816,0.004538943],"genre_scores_gemma":[0.8525067,0.0000038535227,0.14690612,0.00040049912,0.00016322098,0.0000034465793,5.42331e-7,0.0000071949207,0.000008442998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775887,0.00007126134,0.0002463627,0.00076709554,0.0005456785,0.0006107295],"domain_scores_gemma":[0.9986297,0.00022716582,0.000056596506,0.0008279247,0.0000711271,0.00018752506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00132196,0.00018817482,0.00018810642,0.00015912272,0.0004971663,0.00082470593,0.0019529847,0.00004665354,0.00002195587],"category_scores_gemma":[0.000029883638,0.00015362097,0.000040555296,0.00073300477,0.0025702438,0.0010126814,0.0015616057,0.00014380028,0.000070429174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012719586,0.00003276433,0.00005379653,0.000005581176,0.0000012002713,0.000017663977,0.00008087698,0.000026445834,0.00086347666,0.95399153,0.000073714444,0.044851646],"study_design_scores_gemma":[0.00015745222,0.00006494814,0.0027658162,0.00001939424,0.0000020772213,0.00010772986,0.0000028030356,0.5767783,0.0016109874,0.41821113,0.00010195483,0.00017743422],"about_ca_topic_score_codex":0.000010477273,"about_ca_topic_score_gemma":4.5852718e-7,"teacher_disagreement_score":0.7072583,"about_ca_system_score_codex":0.000046543217,"about_ca_system_score_gemma":0.00006392507,"threshold_uncertainty_score":0.947017},"labels":[],"label_agreement":null},{"id":"W2001772188","doi":"10.1142/s0218196705002761","title":"ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS","year":2005,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Automaton; Decidability; Class (philosophy); Discrete mathematics; ω-automaton; Finite-state machine; Group (periodic table); Automata theory; Quantum finite automata; Theoretical computer science; Algorithm; Computer science; Artificial intelligence","score_opus":0.011680712921872874,"score_gpt":0.2636204136391523,"score_spread":0.2519397007172794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001772188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6408274,0.00011745474,0.35616064,0.0020990113,0.0004937038,0.00002936854,0.000001690866,0.00002215338,0.0002485196],"genre_scores_gemma":[0.9751537,0.000039891474,0.023687664,0.0007789836,0.00031554967,8.080965e-7,0.0000032400706,0.0000065741333,0.000013609996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987248,0.00005888066,0.00046433497,0.00014335912,0.00050449354,0.0001041166],"domain_scores_gemma":[0.99895424,0.00016762204,0.00044021916,0.00010254959,0.00027608356,0.00005926716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033891056,0.00010438284,0.00016431767,0.00026971122,0.000037650407,0.0001355481,0.0005467817,0.000041218973,0.000010967433],"category_scores_gemma":[0.000027225944,0.00008736652,0.00008551822,0.00010129127,0.0000336424,0.0007133456,0.00010830209,0.00011072908,0.0000072171906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007457103,0.0002060423,0.0002508739,0.000009534238,0.00013943632,0.00003640293,0.0012284031,0.004955966,0.0033043046,0.7239259,0.0011559697,0.2647126],"study_design_scores_gemma":[0.003025405,0.0007013214,0.018432125,0.00032797625,0.000029466315,0.00092491746,0.00011601084,0.6227397,0.008381891,0.34291196,0.0020581123,0.00035115704],"about_ca_topic_score_codex":0.0000029550197,"about_ca_topic_score_gemma":0.0000012176778,"teacher_disagreement_score":0.61778367,"about_ca_system_score_codex":0.000048300768,"about_ca_system_score_gemma":0.000033421227,"threshold_uncertainty_score":0.35627034},"labels":[],"label_agreement":null},{"id":"W2002514595","doi":"10.1016/j.jnt.2008.02.010","title":"Beta-expansions for infinite families of Pisot and Salem numbers","year":2008,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; BETA (programming language); Combinatorics; Discrete mathematics; Computer science","score_opus":0.01984462807691147,"score_gpt":0.2536320707184858,"score_spread":0.23378744264157433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002514595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86493355,0.0006102869,0.12926501,0.00040466292,0.0004908435,0.00013097847,0.00004369543,0.00004015025,0.00408081],"genre_scores_gemma":[0.9613135,0.0003289221,0.037458677,0.00038268854,0.00012405221,0.0000033183937,0.000001353667,0.000014559208,0.00037297083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988351,0.0001197074,0.0004926143,0.0001330987,0.0002332494,0.00018624334],"domain_scores_gemma":[0.9978719,0.0011439342,0.0004287877,0.00026802908,0.000180139,0.000107213986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083913736,0.00012666333,0.00033283423,0.00011594486,0.00011998865,0.000024233017,0.00048871455,0.000050643295,0.000092383016],"category_scores_gemma":[0.0001444916,0.00009809549,0.00018213928,0.00017518265,0.00020397213,0.00047415303,0.00011081177,0.000144744,0.000007392681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039408577,0.00057430763,0.013377496,0.00016648525,0.0005222678,0.00020283695,0.01600908,0.00010922141,0.0067735794,0.859014,0.041374013,0.061482668],"study_design_scores_gemma":[0.006110766,0.0012700913,0.045832828,0.0007283582,0.00021962152,0.009325274,0.004520577,0.0025746054,0.013915645,0.8231367,0.09123593,0.001129643],"about_ca_topic_score_codex":0.0000043432883,"about_ca_topic_score_gemma":0.0000011523138,"teacher_disagreement_score":0.0963799,"about_ca_system_score_codex":0.000014861241,"about_ca_system_score_gemma":0.00009285931,"threshold_uncertainty_score":0.4000218},"labels":[],"label_agreement":null},{"id":"W2002710427","doi":"10.5802/jtnb.476","title":"A contribution to infinite disjoint covering systems","year":2008,"lang":"lv","type":"article","venue":"Journal de Théorie des Nombres de Bordeaux","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Conjecture","score_opus":0.01683977683229061,"score_gpt":0.25032044485200905,"score_spread":0.23348066801971845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002710427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54418665,0.0042930483,0.44713828,0.00088263495,0.0019255,0.00029378317,0.000045463963,0.00015389343,0.001080745],"genre_scores_gemma":[0.98974025,0.0018570374,0.0051878905,0.0010592409,0.001436749,0.000023208315,0.000005278135,0.000053152682,0.0006371661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956255,0.0005518944,0.0010275769,0.0005268009,0.00072939444,0.0015388504],"domain_scores_gemma":[0.9965644,0.00041645716,0.0005441508,0.00071766006,0.00062392297,0.0011334422],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022222085,0.0004973667,0.0006869124,0.00038193792,0.0012839937,0.0014302494,0.0013624699,0.00026697005,0.000043715085],"category_scores_gemma":[0.0008072333,0.00047443248,0.00033456637,0.00086666824,0.00022332392,0.0011115018,0.0005164606,0.00093394663,0.00024114753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016501709,0.001575736,0.05702502,0.0008665644,0.0014409301,0.019290876,0.032812677,0.08846393,0.03149375,0.6799853,0.036186494,0.04920855],"study_design_scores_gemma":[0.0064475094,0.0035498675,0.17597237,0.004683644,0.00035505818,0.080391064,0.001598567,0.42015317,0.004536518,0.10080806,0.19781952,0.0036846441],"about_ca_topic_score_codex":0.00023319686,"about_ca_topic_score_gemma":0.000010843857,"teacher_disagreement_score":0.57917726,"about_ca_system_score_codex":0.0014233151,"about_ca_system_score_gemma":0.001132786,"threshold_uncertainty_score":0.99977076},"labels":[],"label_agreement":null},{"id":"W2002992445","doi":"10.1016/s0304-3975(02)00830-7","title":"On the complexity of intersecting finite state automata and NL versus NP","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Mathematics; Complexity class; Deterministic finite automaton; DFA minimization; Intersection (aeronautics); Finite-state machine; Class (philosophy); Time complexity; Computational complexity theory; Discrete mathematics; Combinatorics; Algorithm; State (computer science); Automaton; Quantum finite automata; Automata theory; Computer science; Theoretical computer science","score_opus":0.035858908373254124,"score_gpt":0.26059878692361255,"score_spread":0.22473987855035843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002992445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2702046,0.000013983593,0.7234456,0.0009070452,0.0005843398,0.00011787973,0.000002391792,0.00012395911,0.0046001724],"genre_scores_gemma":[0.96464455,0.0000028278305,0.034745228,0.000579506,0.00001586408,0.0000025984475,1.6556993e-7,0.000005787923,0.0000034578077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798006,0.0002771975,0.00026230369,0.0005348028,0.000514342,0.00043129973],"domain_scores_gemma":[0.9967025,0.0020530396,0.00010459841,0.00090570736,0.00009089861,0.00014325354],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026428795,0.00016956046,0.00019536151,0.000114937466,0.0003900608,0.0002931934,0.0017896611,0.000026963811,0.000036969705],"category_scores_gemma":[0.00053218193,0.00010927771,0.00004948242,0.0007433394,0.0060136183,0.0003378205,0.0008279098,0.00020754909,0.000021897815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016811115,0.000036830166,0.0000075398893,0.0000051745096,0.000004779614,0.0000057942384,0.00070154323,0.00008295719,0.00017245032,0.9905265,0.00002501723,0.008414629],"study_design_scores_gemma":[0.00030499062,0.0002920545,0.00018548967,0.000030818086,0.0000024017934,0.000024095398,0.00002538639,0.40992242,0.00474859,0.58429986,0.00003453628,0.0001293915],"about_ca_topic_score_codex":0.000004150019,"about_ca_topic_score_gemma":6.9895464e-7,"teacher_disagreement_score":0.69443995,"about_ca_system_score_codex":0.000028249728,"about_ca_system_score_gemma":0.00006222613,"threshold_uncertainty_score":0.99669147},"labels":[],"label_agreement":null},{"id":"W2003815520","doi":"10.1016/j.tcs.2010.11.021","title":"On the size of inverse semigroups given by generators","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Injective function; Mathematics; Semigroup; Permutation (music); Discrete mathematics; Generator (circuit theory); Regular semigroup; Inverse; Property (philosophy); Domain (mathematical analysis); Combinatorics; Cancellative semigroup; Set (abstract data type); Pure mathematics; Special classes of semigroups; Mathematical analysis; Computer science; Geometry","score_opus":0.004691432277483324,"score_gpt":0.20709051736514558,"score_spread":0.20239908508766224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003815520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6266443,0.000007758659,0.36727703,0.0025504874,0.00084645895,0.0001377867,0.0000045289926,0.00013404276,0.0023976143],"genre_scores_gemma":[0.9589969,0.000001738955,0.038481843,0.002404311,0.00008842556,0.000005809656,3.2845531e-7,0.000008018404,0.00001264858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977881,0.00013333213,0.0002689477,0.0005901167,0.00074580545,0.00047373498],"domain_scores_gemma":[0.99669844,0.0014887983,0.00010439477,0.0013673536,0.0001239274,0.00021705849],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002149288,0.00019228585,0.00019591881,0.00007897108,0.00035739684,0.00025475115,0.0041157543,0.00006765518,0.00017963644],"category_scores_gemma":[0.0003630685,0.00011732909,0.00008385018,0.0009670739,0.003944068,0.0003708317,0.0009547878,0.00039151733,0.00007955735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003685282,0.000058458267,0.00002087599,0.000002280688,0.0000031096733,0.0000027195622,0.00027635213,0.000016703178,0.042560145,0.9482414,0.0023636366,0.006450637],"study_design_scores_gemma":[0.00019694373,0.00022753209,0.00025793325,0.000019788728,0.000003940789,0.000020065556,0.0000119181905,0.3309947,0.15876585,0.50877345,0.00047064116,0.00025725036],"about_ca_topic_score_codex":0.0000047485096,"about_ca_topic_score_gemma":8.3708414e-7,"teacher_disagreement_score":0.43946794,"about_ca_system_score_codex":0.00001866007,"about_ca_system_score_gemma":0.000090375535,"threshold_uncertainty_score":0.9987666},"labels":[],"label_agreement":null},{"id":"W2004034154","doi":"10.1007/s00233-008-9057-5","title":"On finitely generated idempotent semigroups","year":2008,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Idempotence; Mathematics; Semigroup; Mathematical proof; Finitely-generated abelian group; Algebra over a field; Pure mathematics; Stallings theorem about ends of groups; Discrete mathematics","score_opus":0.016672583078270138,"score_gpt":0.2150343545220483,"score_spread":0.19836177144377817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004034154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7590099,0.00096646324,0.21773693,0.00402036,0.0017086412,0.00048068186,0.000026517038,0.0020128633,0.014037653],"genre_scores_gemma":[0.9834879,0.00012202876,0.007776684,0.00636519,0.00017129576,0.00004317088,0.000030461539,0.00004651819,0.0019567749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702543,0.0001298413,0.00047383812,0.00084031944,0.0006116899,0.00091888156],"domain_scores_gemma":[0.997872,0.00028357402,0.0001675517,0.0013113776,0.00008714935,0.00027833195],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038031174,0.00040864362,0.0003720074,0.00024339512,0.0005311405,0.00012289446,0.0015013629,0.0001899347,0.00010344655],"category_scores_gemma":[0.00010015859,0.00035803017,0.0002260732,0.0007757617,0.000097881035,0.00062304013,0.00042219108,0.00037089415,0.0010187558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074464995,0.0006218861,0.001992411,0.000026829011,0.00012341556,0.0008966658,0.001599164,0.0016298301,0.015235793,0.7254939,0.22417724,0.028128399],"study_design_scores_gemma":[0.0063430923,0.0029508257,0.017567005,0.00043132756,0.000058896418,0.0028898604,0.00055589096,0.44748428,0.10048715,0.20553999,0.21039465,0.0052970336],"about_ca_topic_score_codex":0.00005831247,"about_ca_topic_score_gemma":0.000014314212,"teacher_disagreement_score":0.5199539,"about_ca_system_score_codex":0.000102373146,"about_ca_system_score_gemma":0.00008555323,"threshold_uncertainty_score":0.99988717},"labels":[],"label_agreement":null},{"id":"W2004160537","doi":"10.1023/b:pacs.0000021270.99375.f5","title":"Infinite Strings Generated by Insertions","year":2004,"lang":"en","type":"article","venue":"Programming and Computer Software","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Countable set; Mathematics; Alphabet; String (physics); Discrete mathematics; Set (abstract data type); Combinatorics; Invariant (physics); Computer science","score_opus":0.009043573863573866,"score_gpt":0.20934985237426973,"score_spread":0.20030627851069585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004160537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18887132,0.0004496455,0.8090804,0.0003893573,0.00017256601,0.000099042874,0.000002942954,0.0009285897,0.0000061042483],"genre_scores_gemma":[0.6051568,0.00002297673,0.3939,0.00075282226,0.00007784887,0.000025770145,0.000022353835,0.000012448376,0.000028987715],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989531,0.000026498656,0.00017812221,0.00038782746,0.00014448173,0.00030998667],"domain_scores_gemma":[0.99940604,0.000046299992,0.000056818153,0.00030814947,0.00005009985,0.00013257025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012442493,0.00016191769,0.00014513366,0.00007202052,0.0002411217,0.00048389396,0.0004218368,0.00006346269,0.0000015556874],"category_scores_gemma":[0.000008977181,0.0001496842,0.00004404719,0.00033585902,0.00004181481,0.00035252396,0.00029146785,0.00013345746,0.000010963067],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002000683,0.000114566974,0.002345117,0.000023749368,0.000026550371,0.000016230615,0.0007293311,0.00010625482,0.00007736754,0.012493014,0.00065064686,0.9834152],"study_design_scores_gemma":[0.014615311,0.004025221,0.06107466,0.0015555597,0.0001667408,0.0014891481,0.00027386387,0.16462065,0.013015558,0.1309591,0.6003642,0.007839962],"about_ca_topic_score_codex":0.000089344336,"about_ca_topic_score_gemma":0.0000030227698,"teacher_disagreement_score":0.9755752,"about_ca_system_score_codex":0.00002449656,"about_ca_system_score_gemma":0.000027406111,"threshold_uncertainty_score":0.6103944},"labels":[],"label_agreement":null},{"id":"W2004699471","doi":"10.1007/s000120050183","title":"Decomposition of the lattice of pseudovarieties of finite semigroups induced by bands","year":2000,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Lattice (music); Combinatorics; Pure mathematics; Physics","score_opus":0.0057382286275087955,"score_gpt":0.2039287937165971,"score_spread":0.1981905650890883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004699471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909024,0.00009814174,0.004716054,0.00026004552,0.00007890612,0.00007827635,0.00003081817,0.000035977613,0.0037993595],"genre_scores_gemma":[0.99831706,0.000032609965,0.0012868135,0.0001231987,0.000008777224,7.0533525e-7,0.0000062750473,0.0000064037285,0.00021813736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991174,0.000107413965,0.00024454846,0.0001654633,0.00023534571,0.00012985052],"domain_scores_gemma":[0.9989291,0.0002369563,0.00019247673,0.0005348048,0.00007524975,0.000031422926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018141905,0.00010047436,0.00019036929,0.000064427404,0.00005107159,0.000012709134,0.0008355895,0.00007155201,0.00016167467],"category_scores_gemma":[0.000016023863,0.00008072209,0.00010160233,0.00049747137,0.00012944709,0.00035111434,0.000121494006,0.00007943892,0.0000036067036],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018166406,0.00058259914,0.0019187211,0.00018625354,0.00029486534,0.0000062305767,0.013595982,0.00043219866,0.34308985,0.5918477,0.005307089,0.042556804],"study_design_scores_gemma":[0.0018523404,0.0005019404,0.01529827,0.0003203906,0.0001303339,0.0000149954085,0.0008615252,0.017152619,0.934627,0.02545912,0.0032747367,0.00050671643],"about_ca_topic_score_codex":0.0003142397,"about_ca_topic_score_gemma":0.000006005342,"teacher_disagreement_score":0.5915372,"about_ca_system_score_codex":0.000015517227,"about_ca_system_score_gemma":0.000038876628,"threshold_uncertainty_score":0.32917514},"labels":[],"label_agreement":null},{"id":"W2005181510","doi":"10.1016/j.jcss.2003.04.001","title":"Subword histories and Parikh matrices","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decidability; Equivalence (formal languages); Sequence (biology); Type (biology); Word (group theory); Computer science; Mathematics; Discrete mathematics","score_opus":0.01107804895600222,"score_gpt":0.21512534690480742,"score_spread":0.2040472979488052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005181510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4006418,0.008880431,0.5838747,0.00054436154,0.0027915486,0.00009526719,4.867827e-7,0.000055900276,0.0031155173],"genre_scores_gemma":[0.9504158,0.000049661718,0.049325455,0.00007124713,0.00011035017,4.3317542e-7,1.2179629e-8,0.0000018862753,0.0000251587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890226,0.00013310705,0.0003246325,0.00017023996,0.00031223343,0.00015752701],"domain_scores_gemma":[0.99926674,0.00017409104,0.00027070186,0.000108673485,0.00007434964,0.00010546075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016091703,0.00009333878,0.00022827463,0.00015989407,0.00023849767,0.00047820824,0.00045441685,0.000027283908,0.0000012778121],"category_scores_gemma":[0.000011545561,0.00006091829,0.00003983407,0.00026914835,0.00014887622,0.000801656,0.00007826765,0.00006703436,9.49865e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004357337,0.000029078272,0.0089992685,0.00012032438,0.000023650617,0.000073356794,0.0023677885,0.00006361748,0.00009906599,0.95273113,0.0013792799,0.034109056],"study_design_scores_gemma":[0.006538895,0.008446256,0.07851058,0.0026015418,0.00022954197,0.06400061,0.014086431,0.43005013,0.003381457,0.12281425,0.26562133,0.0037189703],"about_ca_topic_score_codex":0.000004397205,"about_ca_topic_score_gemma":6.4390116e-7,"teacher_disagreement_score":0.8299169,"about_ca_system_score_codex":0.000018747127,"about_ca_system_score_gemma":0.00007531189,"threshold_uncertainty_score":0.4611373},"labels":[],"label_agreement":null},{"id":"W2005868985","doi":"10.1016/j.tcs.2010.10.007","title":"On the superimposition of Christoffel words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Superimposition; Mathematics; Conjecture; Root (linguistics); Existential quantification; Pure mathematics; Combinatorics; Arithmetic; Algebra over a field; Linguistics; Computer science; Artificial intelligence; Philosophy","score_opus":0.005362706332115055,"score_gpt":0.22263935071596114,"score_spread":0.21727664438384608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005868985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4485279,0.0000041298445,0.54589856,0.0015066917,0.00062329107,0.00008095845,8.784364e-7,0.00008562873,0.003271954],"genre_scores_gemma":[0.97013503,7.8968975e-7,0.028794372,0.0009692671,0.000087350345,0.0000046054297,2.3800254e-7,0.0000047708227,0.0000035916246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837476,0.000083284656,0.00019917102,0.0004115845,0.00059649715,0.00033469024],"domain_scores_gemma":[0.9979433,0.0006732836,0.000059854883,0.0011050372,0.000097070435,0.00012145232],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018705392,0.00012639698,0.0001337141,0.00010781582,0.00031993724,0.00021486139,0.003026662,0.000044547414,0.000104257255],"category_scores_gemma":[0.00012816525,0.00007500846,0.000064272295,0.0007850063,0.0032837654,0.000334767,0.00062211766,0.00030518268,0.0000617682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041807243,0.000047402136,0.000007129623,0.0000017975018,0.000001349366,0.0000020115372,0.0003044369,0.000011902453,0.030010885,0.95538896,0.000057928177,0.014162039],"study_design_scores_gemma":[0.00009755454,0.00019038911,0.0008426981,0.000018357066,0.0000018803845,0.000027025519,0.0000058444343,0.2975677,0.07193111,0.6291378,0.000051887684,0.00012776213],"about_ca_topic_score_codex":0.000002387512,"about_ca_topic_score_gemma":2.5037727e-7,"teacher_disagreement_score":0.5216071,"about_ca_system_score_codex":0.000013099969,"about_ca_system_score_gemma":0.00006837448,"threshold_uncertainty_score":0.99942875},"labels":[],"label_agreement":null},{"id":"W2006771561","doi":"10.1016/s0022-0000(03)00042-4","title":"Completeness results for graph isomorphism","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Graph isomorphism; Graph automorphism; Mathematics; Discrete mathematics; Isomorphism (crystallography); Graph; Line graph; Voltage graph","score_opus":0.028811575890706785,"score_gpt":0.24963177114746798,"score_spread":0.2208201952567612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006771561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038507313,0.0007060911,0.95744586,0.0003944921,0.0017594944,0.00010218176,0.0000031259005,0.000029764788,0.0010516584],"genre_scores_gemma":[0.8753679,0.000011739309,0.12429242,0.00015692535,0.00015008882,0.0000013671279,1.125506e-7,0.0000026162465,0.000016835724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852234,0.00014907439,0.0005463351,0.00022332114,0.00034139538,0.0002175095],"domain_scores_gemma":[0.9987392,0.0003829864,0.00041775662,0.00017079938,0.00017788752,0.00011141559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030367358,0.000109635075,0.00029748632,0.00020497899,0.0002977158,0.0003733103,0.00078734715,0.000032189728,4.142161e-7],"category_scores_gemma":[0.000025444946,0.000072804054,0.00010854624,0.00032694265,0.00013170524,0.000564154,0.000058944595,0.00006119031,0.0000012051132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020657952,0.000049738563,0.00030069394,0.00008657519,0.000031778436,0.000033891294,0.0008413321,0.0005749939,0.00026156649,0.97855616,0.004600868,0.0146417245],"study_design_scores_gemma":[0.010444626,0.006189441,0.008484251,0.0018866312,0.000085696105,0.015475576,0.0026357593,0.74228513,0.0035582313,0.14439417,0.06297674,0.0015837292],"about_ca_topic_score_codex":0.0000022375068,"about_ca_topic_score_gemma":3.8698073e-7,"teacher_disagreement_score":0.8368606,"about_ca_system_score_codex":0.000014450611,"about_ca_system_score_gemma":0.00008536407,"threshold_uncertainty_score":0.35998398},"labels":[],"label_agreement":null},{"id":"W2007236353","doi":"10.4153/cjm-2001-028-4","title":"Avoiding Patterns in the Abelian Sense","year":2001,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Abelian group; Generalization; Mathematics; Sense (electronics); Pure mathematics; Mathematical analysis","score_opus":0.021123877368364567,"score_gpt":0.22232226753243114,"score_spread":0.20119839016406657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007236353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8958009,0.00023696314,0.09984333,0.0025273012,0.0002466694,0.000056132587,0.0000017451873,0.0000071475306,0.001279792],"genre_scores_gemma":[0.9932363,0.000026051523,0.0058957213,0.000724373,0.000075133015,5.3865995e-7,1.2578828e-7,0.0000057630828,0.000035961915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991504,0.00010525248,0.0002920764,0.000061580235,0.00015999647,0.00023067117],"domain_scores_gemma":[0.9991256,0.0002497839,0.0001500488,0.00026003187,0.000044417386,0.0001701059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016329684,0.000074501,0.00012690583,0.00020639237,0.00011546696,0.00017196333,0.00073691766,0.000030710125,0.00002329871],"category_scores_gemma":[0.00016920624,0.000049456612,0.000055633267,0.0002594125,0.000021878115,0.00021039862,0.000014336425,0.00027735104,0.000017000302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044551334,0.00032187052,0.025546456,0.00022542826,0.00011165965,0.033279594,0.18458462,0.00066790066,0.0006058113,0.6610231,0.013664943,0.079964206],"study_design_scores_gemma":[0.003022791,0.0005993241,0.043530177,0.0037937642,0.00010140897,0.09901646,0.07145192,0.13134822,0.001434562,0.5773924,0.06651753,0.0017914322],"about_ca_topic_score_codex":0.00041840624,"about_ca_topic_score_gemma":0.0051273415,"teacher_disagreement_score":0.13068032,"about_ca_system_score_codex":0.00005341476,"about_ca_system_score_gemma":0.00020069227,"threshold_uncertainty_score":0.2861177},"labels":[],"label_agreement":null},{"id":"W2007245320","doi":"10.1016/j.tcs.2009.02.022","title":"On the intersection of regex languages with regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Regular language; Computer science; Regular expression; Intersection (aeronautics); Closure (psychology); Programming language; Pushdown automaton; Automaton; Language family; Semantics (computer science); Formal language; Nondeterministic finite automaton; Theoretical computer science; Class (philosophy); Discrete mathematics; Mathematics; Automata theory; Artificial intelligence; Linguistics","score_opus":0.004291568309149471,"score_gpt":0.2292128165166391,"score_spread":0.22492124820748963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007245320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2903946,0.000023990086,0.69850224,0.0024837826,0.00008614163,0.000103174985,5.6651055e-7,0.00014244916,0.008263047],"genre_scores_gemma":[0.9749957,9.1548077e-7,0.023610704,0.0013185396,0.0000532797,0.0000018757117,2.5433113e-7,0.0000038114465,0.000014964651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853003,0.000103086524,0.0001530087,0.00039671233,0.0005264116,0.00029074322],"domain_scores_gemma":[0.99854815,0.00031881657,0.00007465856,0.00089313637,0.00008606922,0.00007916055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010755634,0.00013139888,0.00014342686,0.00009265732,0.00018795163,0.00016705101,0.0018227744,0.000028867287,0.000026898471],"category_scores_gemma":[0.00007044591,0.0000693393,0.000044111788,0.00077605416,0.0013789551,0.00029044718,0.00021218321,0.00014588443,0.000016909124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012823648,0.00004092035,0.000004568702,0.000001926555,0.0000025499826,0.000010495295,0.0005116352,0.000054959935,0.0021001538,0.9587446,0.00007664695,0.038438756],"study_design_scores_gemma":[0.00030880395,0.0018574961,0.0032624989,0.00019375206,0.000007842901,0.00011741013,0.00021879771,0.19336368,0.1011025,0.6992236,0.00003724911,0.0003063716],"about_ca_topic_score_codex":0.0000028196632,"about_ca_topic_score_gemma":3.3987558e-7,"teacher_disagreement_score":0.68460107,"about_ca_system_score_codex":0.000029736917,"about_ca_system_score_gemma":0.000041841133,"threshold_uncertainty_score":0.50808173},"labels":[],"label_agreement":null},{"id":"W2007361403","doi":"10.1016/j.tcs.2007.04.037","title":"Every real number greater than 1 is a critical exponent","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponent; Mathematics; Combinatorics; Critical exponent; Discrete mathematics; Geometry; Scaling; Philosophy","score_opus":0.012511110645053121,"score_gpt":0.2786504745501137,"score_spread":0.2661393639050606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007361403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18273671,0.000009639105,0.7973473,0.0015143325,0.0008613186,0.000104882245,0.0000019152055,0.00038129615,0.01704258],"genre_scores_gemma":[0.880001,0.0000034639768,0.1172799,0.00236725,0.0002950034,0.0000041029343,4.301428e-7,0.000013234207,0.000035595935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995895,0.000105280444,0.0004359233,0.0011281176,0.0011734071,0.0012622165],"domain_scores_gemma":[0.9971552,0.00062399346,0.000056184836,0.0013404224,0.00021317163,0.00061104784],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0032808469,0.0002943118,0.0002828076,0.00018720538,0.0004991926,0.00064831594,0.0031096272,0.000102504564,0.00030998746],"category_scores_gemma":[0.00009509546,0.00023192892,0.00013553775,0.0011095507,0.0036719115,0.0010817844,0.0016947606,0.00027847328,0.0007142538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015517719,0.00007736812,0.0005875517,0.000006477015,0.0000040084233,0.00010473183,0.00087428914,0.000001425133,0.00059037464,0.9790004,0.00027035846,0.018467536],"study_design_scores_gemma":[0.00054503506,0.000365234,0.029857185,0.00010919256,0.00001541215,0.000591277,0.00006251618,0.20208448,0.039771456,0.725109,0.0004558741,0.0010333336],"about_ca_topic_score_codex":0.000014356688,"about_ca_topic_score_gemma":5.674798e-7,"teacher_disagreement_score":0.6972643,"about_ca_system_score_codex":0.000099840385,"about_ca_system_score_gemma":0.00010963538,"threshold_uncertainty_score":0.99903953},"labels":[],"label_agreement":null},{"id":"W2007370828","doi":"10.1016/s0304-3975(02)00326-2","title":"Alternating and empty alternating auxiliary stack automata","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Stack (abstract data type); PSPACE; Automaton; Polynomial hierarchy; Bounded function; Hierarchy; Constant (computer programming); Mathematics; Combinatorics; Discrete mathematics; Time complexity; Computer science; Theoretical computer science; Computational complexity theory; Algorithm; Programming language","score_opus":0.00864102512398008,"score_gpt":0.24640921420933193,"score_spread":0.23776818908535186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007370828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31863117,0.000051930325,0.673343,0.00033173178,0.0005720442,0.00010694755,0.0000012621427,0.0003551429,0.0066067516],"genre_scores_gemma":[0.7695608,0.000008334824,0.22968616,0.0006400176,0.00007836566,0.0000036664644,2.754105e-7,0.000010609234,0.0000117453565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680334,0.00021474886,0.00037187306,0.001022373,0.00080431555,0.00078334],"domain_scores_gemma":[0.9979049,0.00045043224,0.00011771453,0.0010244914,0.00013298531,0.00036950785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030691314,0.0002592708,0.0002520857,0.00018273044,0.00062779355,0.0009725239,0.0023554729,0.000051778414,0.00004491611],"category_scores_gemma":[0.00031254298,0.00021773187,0.000055615277,0.00073687395,0.0017974849,0.0012288082,0.0014277615,0.00025667337,0.00006192466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014482187,0.00003601172,0.00024664498,0.000007746173,0.0000040873965,0.000024155743,0.0003547943,0.0000657774,0.00089677545,0.9471145,0.000014970853,0.051233042],"study_design_scores_gemma":[0.00028103075,0.00009961783,0.0011279417,0.00004284066,0.000003099151,0.00015894762,0.000015495469,0.66217756,0.0066407025,0.32905045,0.00012123761,0.00028110627],"about_ca_topic_score_codex":0.000008550457,"about_ca_topic_score_gemma":3.1159982e-7,"teacher_disagreement_score":0.66211176,"about_ca_system_score_codex":0.000055413544,"about_ca_system_score_gemma":0.00013495961,"threshold_uncertainty_score":0.937807},"labels":[],"label_agreement":null},{"id":"W2007793103","doi":"10.1007/s00454-015-9681-2","title":"A $$d$$ d -dimensional Extension of Christoffel Words","year":2015,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Christoffel symbols; Mathematics; Pure mathematics; Arithmetic","score_opus":0.02211496332905167,"score_gpt":0.26556724424520894,"score_spread":0.24345228091615728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007793103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4292167,0.0006616969,0.5676159,0.0005152534,0.000519087,0.00010795335,0.000017538236,0.00015851122,0.001187328],"genre_scores_gemma":[0.9210882,0.0000013664336,0.07821077,0.00044173858,0.0000729363,0.000004634582,0.000053945783,0.000011313834,0.00011508115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812686,0.00007962315,0.00035619087,0.00039941422,0.0008009296,0.00023700518],"domain_scores_gemma":[0.9986807,0.00025277253,0.00017746685,0.00039630348,0.00030073736,0.00019203273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005709352,0.0001640813,0.00024235282,0.00030102665,0.00007248554,0.000053559204,0.00058923545,0.00006412756,0.000032531752],"category_scores_gemma":[0.00012826323,0.00014597712,0.000110511064,0.00084381254,0.000101265316,0.00039778673,0.00037552844,0.00012361057,0.000094095754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014839598,0.00056048983,0.0040892726,0.00007987982,0.00016337693,0.0001122417,0.0020842815,0.2708214,0.0019149148,0.6422879,0.020966632,0.056771204],"study_design_scores_gemma":[0.0011980475,0.0002228829,0.039776232,0.00008266731,0.000013273602,0.00010289353,0.00014247379,0.7733721,0.00056906976,0.18266118,0.0014473875,0.00041177444],"about_ca_topic_score_codex":0.000025027437,"about_ca_topic_score_gemma":4.2094e-7,"teacher_disagreement_score":0.5025507,"about_ca_system_score_codex":0.000043683598,"about_ca_system_score_gemma":0.00017719423,"threshold_uncertainty_score":0.5952774},"labels":[],"label_agreement":null},{"id":"W2008283002","doi":"10.1142/s0218196708004755","title":"COMBINATORIAL REES–SUSHKEVICH VARIETIES ARE FINITELY BASED","year":2008,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Variety (cybernetics); Finitely-generated abelian group; Pure mathematics; Simple (philosophy); Combinatorics; Algebra over a field","score_opus":0.01664893096638616,"score_gpt":0.24778814730120216,"score_spread":0.231139216334816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008283002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4685681,0.00018924302,0.5270657,0.0016668811,0.0021729767,0.00003301236,0.0000016342377,0.000034022352,0.0002684266],"genre_scores_gemma":[0.99047065,0.000034857032,0.008594949,0.0005620539,0.00031754622,8.1966726e-7,0.0000031195839,0.0000053878844,0.000010646337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988485,0.000070122725,0.00033840755,0.00012472876,0.00052562944,0.00009264298],"domain_scores_gemma":[0.9987527,0.00022556733,0.0003987022,0.0000771995,0.00048095675,0.00006487976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002630656,0.00009396018,0.00014692625,0.00020005832,0.0000904861,0.00014201357,0.00049128017,0.00004391437,0.000008610984],"category_scores_gemma":[0.000069649475,0.0000834139,0.00007224559,0.000119971926,0.000056509583,0.00057392835,0.000076675366,0.0001298987,0.00000464301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046129123,0.00079562725,0.020873023,0.00003649305,0.0004435275,0.0014664913,0.004010419,0.0084258765,0.0009073213,0.8197653,0.007106255,0.13570833],"study_design_scores_gemma":[0.0049714507,0.00071353157,0.1320991,0.00020523013,0.000028352995,0.002140453,0.00028296423,0.29569513,0.0023272773,0.5584704,0.0025966207,0.00046948594],"about_ca_topic_score_codex":0.000004906969,"about_ca_topic_score_gemma":4.0866797e-7,"teacher_disagreement_score":0.5219025,"about_ca_system_score_codex":0.000033474866,"about_ca_system_score_gemma":0.00009729691,"threshold_uncertainty_score":0.340152},"labels":[],"label_agreement":null},{"id":"W2008455956","doi":"10.1090/s0025-5718-02-01504-1","title":"Computational investigations of the Prouhet-Tarry-Escott Problem","year":2002,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Simon Fraser University; University of Pennsylvania","keywords":"Ideal (ethics); Mathematics; Applied mathematics","score_opus":0.021962969744656228,"score_gpt":0.2250022095139752,"score_spread":0.20303923976931898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008455956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111140564,0.00005759792,0.88490766,0.0010478487,0.000100364625,0.00034469625,0.0000053031363,0.00008021539,0.0023157322],"genre_scores_gemma":[0.6439588,9.660297e-7,0.3559149,0.000055014632,0.000009011827,0.00000733922,0.0000024055491,0.0000058593423,0.000045719808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876446,0.00006434042,0.0004944966,0.00014790035,0.00041478066,0.00011401421],"domain_scores_gemma":[0.99872327,0.00028374,0.0004585769,0.00030812228,0.0001926662,0.000033610897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027252364,0.00010376109,0.0001801819,0.00008876704,0.00008823517,0.0000388177,0.0005780128,0.00003957717,0.000014844987],"category_scores_gemma":[0.00006777286,0.0000783483,0.0000825722,0.00048057028,0.0001319118,0.0002511814,0.00014341934,0.00007370499,0.000014755382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.821953e-7,0.00040027453,0.00026236233,0.0003444122,0.000035054138,4.1937977e-7,0.0074840826,0.11638189,0.0010311262,0.8640355,0.0013691199,0.008655085],"study_design_scores_gemma":[0.00012689528,0.000022431268,0.00045487517,0.00008441613,0.0000065428726,0.000006267265,0.00003631337,0.61573577,0.0016352483,0.3818128,0.000022248058,0.000056175613],"about_ca_topic_score_codex":0.0000041498233,"about_ca_topic_score_gemma":7.9942004e-7,"teacher_disagreement_score":0.5328182,"about_ca_system_score_codex":0.000017109975,"about_ca_system_score_gemma":0.000032436492,"threshold_uncertainty_score":0.31949508},"labels":[],"label_agreement":null},{"id":"W2009123487","doi":"10.4153/cmb-2011-030-1","title":"Yet Another Solution to the Burnside Problem for Matrix Semigroups","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Pure mathematics; Matrix (chemical analysis); Kernel (algebra); Finitely-generated abelian group; Semigroup; Special classes of semigroups; Algebra over a field; Discrete mathematics","score_opus":0.025004083504398644,"score_gpt":0.22596609078330865,"score_spread":0.20096200727891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009123487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038488416,0.00009982342,0.93620586,0.03494317,0.00020847029,0.0012278017,0.000028374518,0.00020472064,0.023232942],"genre_scores_gemma":[0.5235138,0.0000035464702,0.4474768,0.01667588,0.00024510053,0.00059326255,0.00000683598,0.000078659716,0.011406138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986001,0.00005586824,0.00026618704,0.0003341398,0.00015954455,0.00058414426],"domain_scores_gemma":[0.9986345,0.00021585239,0.000054982956,0.00066593214,0.000061584986,0.00036714773],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00077013625,0.00016640383,0.00018132442,0.00010207967,0.00021394012,0.00012759735,0.0010232736,0.00008428697,0.0020238238],"category_scores_gemma":[0.00017631652,0.000116753254,0.000093884795,0.0001995424,0.0000523805,0.00006252584,0.00010176264,0.000103810955,0.006811808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049697705,0.00003087724,0.000005648349,0.00004255764,0.000014950269,0.000011373091,0.00234061,0.0000043698737,0.00013326478,0.795321,0.19801816,0.004072227],"study_design_scores_gemma":[0.00028962415,0.00013964485,0.00012653734,0.00012689004,0.000020547119,0.00007782247,0.00017228225,0.0095489,0.0010251005,0.42986196,0.5581661,0.00044459186],"about_ca_topic_score_codex":0.0011058204,"about_ca_topic_score_gemma":0.0011869008,"teacher_disagreement_score":0.51966494,"about_ca_system_score_codex":0.00009510209,"about_ca_system_score_gemma":0.00011439777,"threshold_uncertainty_score":0.99888843},"labels":[],"label_agreement":null},{"id":"W2010285287","doi":"10.1016/j.tcs.2007.10.039","title":"Words avoiding repetitions in arithmetic progressions","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arithmetic; Mathematics; Computer science","score_opus":0.009246700703768323,"score_gpt":0.2716644404241367,"score_spread":0.26241773972036836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010285287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09588682,0.000038456295,0.8962782,0.00074586074,0.0005483939,0.00015005414,5.506931e-7,0.00029894203,0.0060527134],"genre_scores_gemma":[0.803891,0.000002292669,0.19558047,0.00041272555,0.00008998375,0.0000060782295,3.9233973e-7,0.000006376018,0.00001068094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971893,0.0001279255,0.0003906525,0.00076154416,0.00065702165,0.0008735555],"domain_scores_gemma":[0.99794924,0.0006686568,0.0000661286,0.0009111599,0.0000922287,0.00031255727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060352026,0.00017383747,0.000190915,0.0005119378,0.00054971955,0.00039699004,0.0023447499,0.000060525657,0.000047650974],"category_scores_gemma":[0.00023650102,0.00014302788,0.000060747985,0.0027461501,0.0019869322,0.0007632925,0.0011071572,0.00039652243,0.000071315684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029793123,0.000088050605,0.00023542767,0.0000033435376,9.814146e-7,0.00006321996,0.00069291604,0.000024151253,0.000694681,0.9425159,0.000013604846,0.05566473],"study_design_scores_gemma":[0.00031257115,0.00014554446,0.008680483,0.00017425604,0.0000027974486,0.00014393224,0.00006742485,0.368288,0.005828637,0.6157913,0.00018774092,0.00037727362],"about_ca_topic_score_codex":0.00000362729,"about_ca_topic_score_gemma":0.0000036963456,"teacher_disagreement_score":0.7080042,"about_ca_system_score_codex":0.00010115082,"about_ca_system_score_gemma":0.00011137312,"threshold_uncertainty_score":0.73209345},"labels":[],"label_agreement":null},{"id":"W2011123341","doi":"10.1080/10236198.2013.876422","title":"A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences","year":2014,"lang":"en","type":"article","venue":"The Journal of Difference Equations and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Congruence (geometry); Mathematics; Automaton; Automation; Algebra over a field; Sequence (biology); Theoretical computer science; Discrete mathematics; Computer science; Pure mathematics","score_opus":0.08609220349401839,"score_gpt":0.31234321096492446,"score_spread":0.22625100747090607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011123341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42942706,0.0000942665,0.5695507,0.000340937,0.0000656015,0.0004893181,0.0000045014026,0.000016659493,0.000010953394],"genre_scores_gemma":[0.9905454,0.000016399075,0.009111379,0.0000352224,0.000078255354,0.00019953771,0.0000017217621,0.000004593617,0.000007472463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985077,0.00029958144,0.00069178536,0.00014032486,0.0002434462,0.000117178],"domain_scores_gemma":[0.9971667,0.0014692142,0.0006249017,0.0004238373,0.00026589035,0.00004943927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019857828,0.0001174763,0.00032644335,0.00012987104,0.00024610863,0.00009738849,0.0005743878,0.00003415289,0.0000042793927],"category_scores_gemma":[0.00018409219,0.00007415788,0.00007006628,0.00040334358,0.000095516814,0.000341499,0.000066741435,0.000096885895,6.8397947e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008737794,0.0010922853,0.00060279464,0.000073044575,0.00034346618,0.000008044282,0.0073260725,0.0017275369,0.005651146,0.87397337,0.00005579998,0.109137684],"study_design_scores_gemma":[0.0010320592,0.0004884555,0.001827256,0.00002087312,0.00043481498,0.00038208335,0.0013063696,0.90356416,0.0005100298,0.090253934,0.00004020483,0.00013979364],"about_ca_topic_score_codex":0.00006731938,"about_ca_topic_score_gemma":0.000058323774,"teacher_disagreement_score":0.9018366,"about_ca_system_score_codex":0.000021150661,"about_ca_system_score_gemma":0.00009268013,"threshold_uncertainty_score":0.30240703},"labels":[],"label_agreement":null},{"id":"W2011967700","doi":"10.1090/s0002-9939-2011-11018-9","title":"Monomials as sums of powers: The real binary case","year":2011,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Göran Gustafssons Stiftelser","keywords":"Algorithm; Artificial intelligence; Computer science; Annotation","score_opus":0.02588345380878841,"score_gpt":0.25720887769434336,"score_spread":0.23132542388555496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011967700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98377115,0.00012316805,0.0005592846,0.0013082066,0.00013247068,0.0005249967,0.000015307502,0.00007716249,0.013488233],"genre_scores_gemma":[0.9786537,0.00017750452,0.020238647,0.00054162816,0.00008208211,0.00002393956,1.5637977e-7,0.000035858637,0.00024646934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973735,0.000054602908,0.0009052763,0.00049833884,0.0006037747,0.0005644916],"domain_scores_gemma":[0.9965517,0.0005662165,0.0017291523,0.0006972847,0.00029403443,0.00016164036],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018321218,0.0003712067,0.000861359,0.000031876454,0.00030602474,0.00009873758,0.0026920594,0.00010731019,0.000118157805],"category_scores_gemma":[0.0003242728,0.00020793275,0.00093117886,0.0009770545,0.00312751,0.00036599726,0.0015917062,0.00038450988,0.000042962565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016440019,0.0014503631,0.0020597333,0.0015346298,0.0009810013,0.0000412657,0.14733918,0.000002266718,0.032927863,0.79434156,0.009773755,0.009383969],"study_design_scores_gemma":[0.0011663153,0.002436321,0.0052824523,0.0014945506,0.0010451863,0.0025894283,0.13795118,0.04899641,0.09553817,0.70168567,0.00030343776,0.0015109016],"about_ca_topic_score_codex":0.000786169,"about_ca_topic_score_gemma":5.46993e-7,"teacher_disagreement_score":0.09265593,"about_ca_system_score_codex":0.00006888162,"about_ca_system_score_gemma":0.00012247646,"threshold_uncertainty_score":0.9995854},"labels":[],"label_agreement":null},{"id":"W2012328641","doi":"10.4153/cmb-2014-025-1","title":"Combinatorially Factorizable Cryptic Inverse Semigroups","year":2014,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Monoid; Inverse semigroup; Semigroup; Inverse element; Inverse; Bicyclic semigroup; Pure mathematics; Combinatorics; Special classes of semigroups; Algebra over a field","score_opus":0.006134395475508231,"score_gpt":0.18036578869580105,"score_spread":0.17423139322029282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012328641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08909131,0.00008835928,0.61162025,0.021336803,0.0024904928,0.00077827513,0.000015690428,0.0011368862,0.27344194],"genre_scores_gemma":[0.96917623,0.0000027420206,0.022473121,0.004151644,0.00022194332,0.000028422048,0.000005787604,0.000035926743,0.0039041566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824566,0.00012192769,0.0003017602,0.00040080442,0.00027864776,0.0006512195],"domain_scores_gemma":[0.9977687,0.00038863855,0.00006605881,0.0008404536,0.00006181118,0.000874331],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006932338,0.00021633971,0.0002934352,0.00019735137,0.00018337769,0.00026872338,0.0011266083,0.00013941921,0.004591563],"category_scores_gemma":[0.00054871687,0.0001994827,0.00009182452,0.0003136461,0.000086803586,0.000114701375,0.00012822104,0.00020528259,0.023999698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.770389e-7,0.000028072052,0.000020688218,0.00003473094,0.000008945773,0.000021343843,0.00019600795,0.000004940154,0.000101219586,0.9574597,0.040804587,0.0013190124],"study_design_scores_gemma":[0.00043088262,0.000080561585,0.00007492235,0.0000770569,0.0000105803665,0.000030359106,0.000041825326,0.029929256,0.00028249086,0.580095,0.38851288,0.0004342187],"about_ca_topic_score_codex":0.0005537056,"about_ca_topic_score_gemma":0.00017272159,"teacher_disagreement_score":0.88008493,"about_ca_system_score_codex":0.00014824902,"about_ca_system_score_gemma":0.00016974966,"threshold_uncertainty_score":0.9963184},"labels":[],"label_agreement":null},{"id":"W2012995549","doi":"10.4153/cmb-2006-010-9","title":"A Dynamical Proof of Pisot's Theorem","year":2006,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algebraic number; Dual (grammatical number); Discrete mathematics; Pure mathematics; Combinatorics; Algebra over a field; Mathematical analysis","score_opus":0.0046600204106121736,"score_gpt":0.18555926847074344,"score_spread":0.18089924806013127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012995549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08892467,0.00018718402,0.71243316,0.015143108,0.00014904198,0.0005107353,0.000027889397,0.00022525134,0.18239893],"genre_scores_gemma":[0.97785795,3.2285004e-7,0.020404207,0.00042059974,0.00004451718,0.000014462636,0.000003270562,0.000013610994,0.0012410883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988181,0.000054441745,0.00030595102,0.00024223833,0.00019712164,0.00038214182],"domain_scores_gemma":[0.99894434,0.00018831427,0.0000624747,0.00051505497,0.000045067878,0.00024471752],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00035285758,0.00012953512,0.00022392355,0.000116012314,0.000056887526,0.00006195128,0.0007197444,0.00008158219,0.0022045954],"category_scores_gemma":[0.00010491543,0.000108729684,0.000084162464,0.00019178263,0.00014006296,0.00004244529,0.00007224988,0.00010438208,0.001245483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.558155e-7,0.000045919343,0.000014696945,0.000035594087,0.0000045508295,0.00002586381,0.00005157302,0.0000081245,0.00010991699,0.9906132,0.0066574602,0.0024321391],"study_design_scores_gemma":[0.0002078417,0.000046660807,0.00026753038,0.00008304798,0.000007339171,0.000059045837,0.000025694533,0.027861396,0.0017437795,0.9502238,0.019236319,0.0002375237],"about_ca_topic_score_codex":0.0009690625,"about_ca_topic_score_gemma":0.00041128162,"teacher_disagreement_score":0.88893324,"about_ca_system_score_codex":0.0000676271,"about_ca_system_score_gemma":0.00012962516,"threshold_uncertainty_score":0.99953216},"labels":[],"label_agreement":null},{"id":"W2012996826","doi":"10.1016/j.dam.2009.02.010","title":"There are <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si47.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-uniform cubefree binary morphisms for all <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si48.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi><mml:mo>≥</mml:mo><mml:mn>0</mml:mn></mml:math>","year":2009,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Mathematics; Binary number; Word (group theory); Discrete mathematics; Combinatorics; Algorithm; Arithmetic; Geometry","score_opus":0.018514275569914133,"score_gpt":0.24428564184295826,"score_spread":0.22577136627304412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012996826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95858157,0.0021201633,0.019070566,0.0013216378,0.0030545446,0.0006714016,0.002291537,0.0013960076,0.011492556],"genre_scores_gemma":[0.9462587,0.0019168749,0.037235066,0.004085892,0.003120088,0.0025508185,0.0027478996,0.0016063536,0.0004782678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98059076,0.00037554489,0.0047695492,0.004362621,0.0047643525,0.005137153],"domain_scores_gemma":[0.9826751,0.0029722431,0.0053610737,0.006515776,0.00043896126,0.0020368793],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0041466686,0.0031941957,0.0018701153,0.00083663396,0.00347646,0.0034742637,0.0067408495,0.003961094,0.00066015194],"category_scores_gemma":[0.0011919533,0.0040784683,0.0037657332,0.001984844,0.0022468881,0.002961275,0.004734178,0.0033697307,0.004881817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001669336,0.0016999743,0.000004877688,0.0036745304,0.0022122753,0.0016909216,0.005648503,0.0032699222,0.0056650364,0.96002316,0.010823989,0.0036174792],"study_design_scores_gemma":[0.0041165934,0.0025037914,0.00004584913,0.0032270316,0.0024643233,0.001829768,0.0039711837,0.9161697,0.03705799,0.01782824,0.0071384422,0.0036470664],"about_ca_topic_score_codex":0.00047064587,"about_ca_topic_score_gemma":0.00033746185,"teacher_disagreement_score":0.94219494,"about_ca_system_score_codex":0.0001421285,"about_ca_system_score_gemma":0.001753487,"threshold_uncertainty_score":0.99892956},"labels":[],"label_agreement":null},{"id":"W2013653818","doi":"10.1007/s00233-013-9542-3","title":"Semigroups embeddable in hyperplane face monoids","year":2013,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Hyperplane; Monoid; Semigroup; Decidability; Bicyclic semigroup; Free monoid; Cancellative semigroup; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.004423136839529797,"score_gpt":0.19632996394800034,"score_spread":0.19190682710847054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013653818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8419184,0.0019028537,0.119823866,0.0061872606,0.0011752452,0.0011430208,0.000014928623,0.0013718391,0.02646259],"genre_scores_gemma":[0.98396885,0.000055803328,0.01055119,0.0020004641,0.000081644575,0.00014162064,0.000016653854,0.000037091722,0.0031466594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971718,0.00010339875,0.0004896631,0.0007466187,0.00038856492,0.0010999147],"domain_scores_gemma":[0.99825746,0.00018555597,0.00011314043,0.0011626901,0.00005157938,0.00022959466],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044417047,0.0003560382,0.0004097998,0.00025940576,0.00014061987,0.00034594187,0.0016778385,0.00020063788,0.00026140077],"category_scores_gemma":[0.00004852624,0.00032339187,0.00012752324,0.00077246025,0.00006857971,0.0017432971,0.0006018654,0.00037053318,0.0017977831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003653441,0.0010820159,0.07930216,0.00017255056,0.00012940366,0.0002913893,0.006670984,0.001681443,0.065078504,0.35176802,0.22841743,0.26536956],"study_design_scores_gemma":[0.0038120674,0.0006335481,0.047287337,0.0003863824,0.000022849688,0.00044869634,0.005427777,0.6533849,0.024384394,0.18098742,0.07988074,0.0033439023],"about_ca_topic_score_codex":0.0009509575,"about_ca_topic_score_gemma":0.0001143749,"teacher_disagreement_score":0.6517035,"about_ca_system_score_codex":0.00011252366,"about_ca_system_score_gemma":0.000049508104,"threshold_uncertainty_score":0.9999218},"labels":[],"label_agreement":null},{"id":"W2013957001","doi":"10.1017/s0960129506005901","title":"Free compact 2-categories","year":2007,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Parsing; Symmetric monoidal category; Meaning (existential); Closed monoidal category; Enriched category; Monoidal category; Sentence; Mathematics; Computer science; Pure mathematics; Linguistics; Rule-based machine translation; Algebra over a field; Natural language processing; Functor; Epistemology; Philosophy","score_opus":0.013652521777377765,"score_gpt":0.2680591647508541,"score_spread":0.25440664297347637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013957001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066105075,0.00005035279,0.9298465,0.0004921433,0.00064147747,0.00013221917,0.0000011873013,0.00023342457,0.0024976102],"genre_scores_gemma":[0.7569553,7.0088754e-7,0.24248588,0.0004470846,0.0000948409,9.814136e-7,2.546793e-7,0.0000061696637,0.000008772951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972956,0.000034891615,0.00044960406,0.0006263118,0.0008204667,0.0007731222],"domain_scores_gemma":[0.9977895,0.00045636084,0.000093649105,0.0013596601,0.00007110162,0.00022975238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021142473,0.00021794083,0.00027057304,0.0003369357,0.0002232657,0.00053240394,0.0045232526,0.000053796095,0.0000439399],"category_scores_gemma":[0.00017772379,0.00016498221,0.00006142207,0.0014349542,0.00073677336,0.0008513307,0.0011649167,0.00022047704,0.000029472496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002584756,0.00004057209,0.0004318394,0.0000152368275,0.0000019209401,0.00005260887,0.0007048489,0.00015211111,0.0004202761,0.9341575,0.00020236874,0.06381815],"study_design_scores_gemma":[0.00020430528,0.0000288872,0.018706566,0.000022267588,0.0000010022861,0.00011691702,0.00001481369,0.17577904,0.0041085794,0.80069476,0.00011739459,0.00020545106],"about_ca_topic_score_codex":0.00001180553,"about_ca_topic_score_gemma":0.00000560538,"teacher_disagreement_score":0.69085026,"about_ca_system_score_codex":0.000101542595,"about_ca_system_score_gemma":0.00008224811,"threshold_uncertainty_score":0.84054035},"labels":[],"label_agreement":null},{"id":"W2015013677","doi":"10.1515/integ.2009.007","title":"Some new van der Waerden numbers and some van der Waerden-type numbers","year":2009,"lang":"en","type":"article","venue":"Integers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Van der Waerden's theorem; Mathematics; Combinatorics; Type (biology); Biology","score_opus":0.01030300779130207,"score_gpt":0.24600749331596056,"score_spread":0.23570448552465847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015013677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8368696,0.010143323,0.058603633,0.034336362,0.0073159738,0.0012767992,0.000014578145,0.0033189824,0.048120752],"genre_scores_gemma":[0.9774023,0.00015522815,0.0083695175,0.008283843,0.0005707687,0.000003890906,0.0000062631148,0.000037841473,0.005170314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782586,0.00007893552,0.00034391807,0.00070113805,0.0003897446,0.00066039636],"domain_scores_gemma":[0.99849683,0.00013758444,0.00012128267,0.0007800069,0.00006239998,0.0004019027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029509302,0.00034878982,0.0003389196,0.0001531668,0.00017100104,0.0003524708,0.0010680095,0.00017086105,0.00017036904],"category_scores_gemma":[0.000076071236,0.00031460155,0.00012658269,0.0003616785,0.00012524768,0.0014269886,0.00021511957,0.0003347589,0.0005155603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102196704,0.00026694953,0.0011553173,0.000047680758,0.0003367778,0.00041423057,0.010897171,0.0003278201,0.008966627,0.4526903,0.23042256,0.29437238],"study_design_scores_gemma":[0.0025693753,0.0006199539,0.0042302255,0.0002848806,0.00012223261,0.00043307038,0.0011050773,0.011319062,0.011683693,0.8832076,0.082249485,0.0021753462],"about_ca_topic_score_codex":0.00027787365,"about_ca_topic_score_gemma":0.000024391486,"teacher_disagreement_score":0.43051732,"about_ca_system_score_codex":0.00010554947,"about_ca_system_score_gemma":0.0001412187,"threshold_uncertainty_score":0.9999306},"labels":[],"label_agreement":null},{"id":"W2015046561","doi":"10.1007/s00026-006-0300-z","title":"A Symmetric Function Resolution of the Number of Permutations With Respect to Block-Stable Elements","year":2006,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Block (permutation group theory); Resolution (logic); Discrete mathematics","score_opus":0.019864034384045538,"score_gpt":0.2686542668971128,"score_spread":0.24879023251306726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015046561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9598592,0.00016027829,0.033378962,0.0005162829,0.00019750824,0.00018836049,0.000009599,0.000029630046,0.0056601865],"genre_scores_gemma":[0.99880093,0.000007649275,0.00080430513,0.000071186114,0.000009775351,0.0000062384565,0.000001563074,0.0000058471,0.00029252502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988878,0.00006971149,0.00031505805,0.00014747416,0.0004248978,0.0001550621],"domain_scores_gemma":[0.99865824,0.000098224824,0.00034967173,0.00044757596,0.00041849542,0.0000277934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040294082,0.00007918162,0.00015193106,0.0001479317,0.00006801031,0.0000152264365,0.00041155168,0.000032215,0.0000050675053],"category_scores_gemma":[0.00007225114,0.00005812716,0.000059265516,0.0020614674,0.00003829282,0.00016908618,0.00011394325,0.00005446192,0.000003228959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025526106,0.00030047353,0.011755498,0.000030437353,0.00002271024,5.315981e-7,0.00011873712,0.00067927345,0.0010383418,0.98265886,0.0028242404,0.00054538256],"study_design_scores_gemma":[0.0011090543,0.0008612096,0.29942942,0.0002211634,0.000054785327,0.000012522357,0.00014361012,0.007101293,0.102008216,0.58425474,0.004479904,0.0003240656],"about_ca_topic_score_codex":0.00016995422,"about_ca_topic_score_gemma":0.0000057568122,"teacher_disagreement_score":0.3984041,"about_ca_system_score_codex":0.000016375025,"about_ca_system_score_gemma":0.000059931615,"threshold_uncertainty_score":0.23703568},"labels":[],"label_agreement":null},{"id":"W2015132225","doi":"10.1080/0025570x.2002.11953932","title":"Unique Rook Circuits","year":2002,"lang":"en","type":"article","venue":"Mathematics Magazine","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Electronic circuit; Arithmetic; Electrical engineering","score_opus":0.023330487644711448,"score_gpt":0.21508899416680052,"score_spread":0.1917585065220891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015132225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009232134,0.00027923202,0.79716694,0.0013083785,0.00023749715,0.0001950895,0.000002490229,0.00075157057,0.19082665],"genre_scores_gemma":[0.6800952,0.000085953296,0.2850178,0.0015916987,0.00019175287,0.00004393564,0.0000034181014,0.000058422018,0.032911822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903065,0.000026424314,0.00023785561,0.00022703495,0.00022037755,0.00025765505],"domain_scores_gemma":[0.9988919,0.00011735899,0.00008610802,0.0007797992,0.000040184084,0.00008468434],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002576266,0.00014059595,0.00017790473,0.000080881124,0.0000662682,0.00013191221,0.00080671854,0.00005011778,0.0004658141],"category_scores_gemma":[0.000043348762,0.0001210129,0.00005887853,0.00028558087,0.000031511874,0.00026054116,0.00019270259,0.00009999749,0.0031323228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.7887203e-7,0.00032934503,0.0000148197705,0.00010255637,0.000025321431,0.000060690123,0.00211456,0.000013221611,0.005450794,0.9257857,0.02514353,0.040959246],"study_design_scores_gemma":[0.0005037707,0.00009088817,0.00025102936,0.00011748077,0.00001768319,0.00024207783,0.00003317781,0.599289,0.0042009666,0.365918,0.028789725,0.0005462015],"about_ca_topic_score_codex":5.2649443e-7,"about_ca_topic_score_gemma":7.1276725e-7,"teacher_disagreement_score":0.6708631,"about_ca_system_score_codex":0.000022256823,"about_ca_system_score_gemma":0.000006712351,"threshold_uncertainty_score":0.9976438},"labels":[],"label_agreement":null},{"id":"W2015360324","doi":"10.2168/lmcs-3(1:4)2007","title":"Logic Meets Algebra: the Case of Regular Languages","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Regular language; Automaton; Complement (music); Computer science; Algebraic number; Monoid; Formalism (music); Mathematics; Formal language; Discrete mathematics; Automata theory; Algebra over a field; Algebraic theory; Theoretical computer science; Algorithm; Pure mathematics","score_opus":0.04414340357003216,"score_gpt":0.3956531001013638,"score_spread":0.35150969653133163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015360324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050672013,0.0003745923,0.9466478,0.0007578526,0.00048848114,0.00014157117,4.0852362e-7,0.00010478844,0.0008124617],"genre_scores_gemma":[0.4096119,0.0000037226378,0.5896401,0.0006847001,0.00004993792,0.000002222941,5.349799e-8,0.000002428144,0.000004935421],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974781,0.0005197633,0.00044365195,0.0006688889,0.0003383188,0.00055125915],"domain_scores_gemma":[0.9964061,0.0021371958,0.00015413215,0.0010847764,0.000093050265,0.00012474925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014010745,0.0001632119,0.00026899195,0.00022069493,0.00020568966,0.00014375002,0.002927926,0.00007724176,0.000011084674],"category_scores_gemma":[0.0004058112,0.00009457077,0.00008142734,0.0021495074,0.0010059193,0.00039164608,0.001407548,0.00023946841,0.0000052212745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020216219,0.00004611862,0.000050472278,0.0000045639176,0.0000017364996,0.0008022348,0.0003877362,0.00013846629,0.0043079113,0.433153,0.000012361636,0.5610934],"study_design_scores_gemma":[0.00037645095,0.00032908807,0.014312971,0.00005789703,0.0000059883296,0.003426988,0.0002006044,0.40397203,0.05858261,0.51788205,0.0004167466,0.00043657844],"about_ca_topic_score_codex":0.00004544073,"about_ca_topic_score_gemma":0.000009237301,"teacher_disagreement_score":0.5606568,"about_ca_system_score_codex":0.00004153529,"about_ca_system_score_gemma":0.000042464973,"threshold_uncertainty_score":0.54408634},"labels":[],"label_agreement":null},{"id":"W2015787121","doi":"10.1016/j.tcs.2009.03.026","title":"Estimation of state complexity of combined operations","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; State (computer science); Alphabet; Upper and lower bounds; Mathematics; Regular language; Computational complexity theory; Combined operations; Algorithm; Theoretical computer science; Computer science; Discrete mathematics; Automaton; Linguistics","score_opus":0.01599258895503316,"score_gpt":0.26526173501559713,"score_spread":0.24926914606056397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015787121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24585542,0.0000069212037,0.75266325,0.000599116,0.000110944005,0.00009474002,0.0000025477957,0.00007270889,0.00059433625],"genre_scores_gemma":[0.74096024,0.000001061345,0.25884834,0.00017692037,0.000008218728,7.4175966e-7,9.105341e-7,0.0000017212999,0.0000018291357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846995,0.000081998645,0.00037039333,0.0003249145,0.00049570063,0.0002570737],"domain_scores_gemma":[0.9988218,0.00011497853,0.0000839898,0.0006766476,0.0001911487,0.00011144742],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010371936,0.00010972072,0.00022508948,0.00015408584,0.00015478372,0.0000999141,0.0016494322,0.000022741056,0.000017867056],"category_scores_gemma":[0.000065406675,0.000090273206,0.00005112573,0.0009375455,0.0027819467,0.00060505373,0.00031222362,0.000079941325,0.0000083628975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057490006,0.00010275285,0.000005243693,0.000004582229,0.0000016030959,8.8827716e-7,0.00038423465,0.0060205054,0.00390747,0.92640036,0.000006535473,0.063160054],"study_design_scores_gemma":[0.00011724728,0.00024542466,0.0019719917,0.000016963842,0.0000013526677,0.0000037071902,0.0000016177631,0.5649167,0.03478801,0.39787683,5.4769004e-7,0.000059622937],"about_ca_topic_score_codex":0.000004765456,"about_ca_topic_score_gemma":3.0217598e-7,"teacher_disagreement_score":0.5588962,"about_ca_system_score_codex":0.000019577452,"about_ca_system_score_gemma":0.00009445545,"threshold_uncertainty_score":0.99993193},"labels":[],"label_agreement":null},{"id":"W2015957628","doi":"10.1016/j.jda.2006.04.002","title":"Two-pattern strings II—frequency of occurrence and substring complexity","year":2007,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Combinatorics; Mathematics; Generalization; Fibonacci number; Prefix; Aperiodic graph; Discrete mathematics; Computer science; Data structure","score_opus":0.02468135140777174,"score_gpt":0.28292771750166096,"score_spread":0.25824636609388923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015957628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5491479,0.0007500787,0.44929412,0.00014013312,0.00032148213,0.000045404213,0.000011582793,0.000018641078,0.00027068166],"genre_scores_gemma":[0.9468218,0.000046654368,0.052932054,0.00006123711,0.00012599087,2.2787508e-7,9.244806e-7,0.0000050855374,0.0000060064112],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984053,0.000041403277,0.0006517951,0.0001840084,0.000429182,0.00028834806],"domain_scores_gemma":[0.99862605,0.00014335256,0.00062893395,0.00026599213,0.00016539464,0.00017029187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013123562,0.0001457987,0.00031530205,0.00018700099,0.000105997555,0.00006579646,0.00077650027,0.000041490224,0.000011714363],"category_scores_gemma":[0.000044721794,0.000118078984,0.000109882465,0.00028067856,0.0001507181,0.0007385282,0.00027131147,0.0002642381,9.80323e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041230676,0.0002980232,0.055641823,0.00014303977,0.00021354748,0.00047874745,0.0046933587,0.000054043518,0.0199038,0.05193778,0.00026661885,0.866328],"study_design_scores_gemma":[0.010325815,0.003780444,0.5702381,0.0020622096,0.00023406355,0.004863677,0.0026124069,0.065705374,0.16115262,0.17559402,0.0010202337,0.0024110177],"about_ca_topic_score_codex":0.00009199255,"about_ca_topic_score_gemma":0.000009483053,"teacher_disagreement_score":0.863917,"about_ca_system_score_codex":0.000032099346,"about_ca_system_score_gemma":0.000049151742,"threshold_uncertainty_score":0.48151213},"labels":[],"label_agreement":null},{"id":"W2016420891","doi":"10.1016/j.disc.2013.01.005","title":"The abelian complexity of the paperfolding word","year":2013,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Word (group theory); Abelian group; Linguistics; Computer science; Mathematics; Pure mathematics; Philosophy","score_opus":0.03825754995801239,"score_gpt":0.26032372811973836,"score_spread":0.22206617816172597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016420891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6650212,0.002461054,0.28507635,0.013464389,0.004547506,0.0032770396,0.00011113744,0.000773634,0.025267713],"genre_scores_gemma":[0.9366935,0.00011749762,0.06206676,0.00019085727,0.000113788934,0.00007952245,0.0000046299383,0.000039091625,0.0006943388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980888,0.00013631005,0.0005837614,0.0003408211,0.00051526405,0.00033503663],"domain_scores_gemma":[0.9959455,0.00044699095,0.0006648789,0.0027883358,0.00009419285,0.00006008226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000788391,0.0002904999,0.00038660943,0.000034328405,0.00039320096,0.00043238848,0.004576375,0.00014042301,0.00002236196],"category_scores_gemma":[0.00014777535,0.00014277748,0.00029417354,0.00020260278,0.00049370097,0.00010619931,0.004487689,0.0004966611,0.000039845665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8056255e-7,0.000037067555,0.000034707013,0.00032544107,0.00006892302,6.894387e-7,0.0026856577,0.0001542173,0.00023430142,0.989589,0.0010815554,0.005787757],"study_design_scores_gemma":[0.00006974909,0.0000076232413,0.0006265482,0.0005033515,0.000025973159,0.000005205719,0.00026474276,0.17824681,0.0013593753,0.81789804,0.00076647254,0.00022610866],"about_ca_topic_score_codex":0.00003513593,"about_ca_topic_score_gemma":0.000008416053,"teacher_disagreement_score":0.27167234,"about_ca_system_score_codex":0.00003665448,"about_ca_system_score_gemma":0.00007920352,"threshold_uncertainty_score":0.8504119},"labels":[],"label_agreement":null},{"id":"W2017099638","doi":"10.1145/1273920.1273939","title":"A larger decidable semiunification problem","year":2007,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decidability; Undecidable problem; Computer science; Discrete mathematics; Graph; Inference; Theoretical computer science; Combinatorics; Type inference; Constraint (computer-aided design); Mathematics; Artificial intelligence","score_opus":0.007097889225995919,"score_gpt":0.22805840718819353,"score_spread":0.22096051796219762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017099638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011248911,0.00003757291,0.9062102,0.0004370355,0.00007701325,0.00007854657,1.4054791e-7,0.00030928198,0.08160129],"genre_scores_gemma":[0.7572937,0.000002926308,0.2374087,0.00082469656,0.00003964016,0.0000052447754,0.0000012568537,0.0000045563706,0.0044192662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993626,0.000011564832,0.00012280107,0.00017931234,0.00012357348,0.00020018173],"domain_scores_gemma":[0.9994671,0.000065563974,0.000031691932,0.00034740544,0.000034510587,0.000053780434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075568905,0.00005342033,0.000050049308,0.000054139913,0.00006136762,0.000080656246,0.00040643758,0.000031191536,0.000073005736],"category_scores_gemma":[0.00000983251,0.00004211577,0.000022821425,0.00027410657,0.000010804678,0.00032486205,0.00007703347,0.000042030726,0.00023976684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013257537,0.000042681928,0.0004527308,0.0000033566023,0.0000031712852,0.000004883569,0.0001915361,0.000005337019,0.007806565,0.92086154,0.004995546,0.06563132],"study_design_scores_gemma":[0.000892965,0.00012269548,0.036542702,0.000044750803,0.000008109579,0.00009340083,0.00028468826,0.079200335,0.22925764,0.3342184,0.3184953,0.0008389887],"about_ca_topic_score_codex":0.00001597299,"about_ca_topic_score_gemma":0.00000926448,"teacher_disagreement_score":0.7460448,"about_ca_system_score_codex":0.000017669036,"about_ca_system_score_gemma":0.000016623191,"threshold_uncertainty_score":0.30817977},"labels":[],"label_agreement":null},{"id":"W2017325803","doi":"10.1016/j.jcta.2012.01.006","title":"Fixed points avoiding Abelian k-powers","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Abelian group; Mathematics; Invertible matrix; Fixed point; Decidability; Pure mathematics; Matrix (chemical analysis); Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.009556108663495173,"score_gpt":0.23177425499645135,"score_spread":0.22221814633295617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017325803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.767969,0.0036762315,0.1305271,0.0029306205,0.08198747,0.00031053345,0.0000053892786,0.00033309823,0.012260573],"genre_scores_gemma":[0.9937319,0.000048844842,0.0045206593,0.00027443928,0.0012468651,0.0000014276376,3.3088065e-7,0.000017431144,0.00015810595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979161,0.00053487293,0.0005238058,0.00012830208,0.00044706126,0.0004498328],"domain_scores_gemma":[0.99815345,0.00047992394,0.00051503215,0.0003975482,0.0001760616,0.00027796475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043210653,0.00018849704,0.00035137698,0.00017718408,0.0002271388,0.00018242639,0.0011083815,0.00009435278,0.00010404479],"category_scores_gemma":[0.0005119237,0.00015173668,0.00020390906,0.00033493765,0.00009425634,0.0027933335,0.0002268785,0.00040145632,0.000036065238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000151436,0.00011932612,0.00025374306,0.000008628982,0.000058226844,0.00002114434,0.0018386259,0.0000020323996,0.0021844988,0.99039346,0.0015124929,0.003456394],"study_design_scores_gemma":[0.0012804954,0.00047016644,0.00046483026,0.000092234026,0.000027900658,0.00045481333,0.00091411633,0.00003914376,0.016763855,0.9347939,0.044399377,0.00029914948],"about_ca_topic_score_codex":0.0000011640344,"about_ca_topic_score_gemma":6.074129e-8,"teacher_disagreement_score":0.2257629,"about_ca_system_score_codex":0.000078198165,"about_ca_system_score_gemma":0.00008537135,"threshold_uncertainty_score":0.6187642},"labels":[],"label_agreement":null},{"id":"W2018097087","doi":"10.48550/arxiv.0809.3410","title":"Christoffel words and Markoff triples","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Christoffel symbols; Mathematics; Pure mathematics","score_opus":0.03325846319665903,"score_gpt":0.2432918216625095,"score_spread":0.21003335846585047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018097087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96503663,0.0038722602,0.024188127,0.0008439484,0.0013781146,0.00023091481,0.000011616469,0.00047561058,0.00396278],"genre_scores_gemma":[0.9896117,0.0021830264,0.0058542527,0.00066209334,0.0003449552,0.0000393977,0.00001525997,0.000029252431,0.0012600486],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99804336,0.00010638358,0.00033385935,0.00088072056,0.00026002756,0.0003756489],"domain_scores_gemma":[0.99817365,0.00014513913,0.00020059492,0.0012880975,0.000041185987,0.0001513473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000335179,0.00034730005,0.00041573163,0.00014662059,0.00016782439,0.00015293407,0.001420422,0.00027575044,0.000025615482],"category_scores_gemma":[0.00006669249,0.00032036146,0.00013951348,0.00017664013,0.00015396674,0.00022060952,0.002472183,0.0005740328,0.00011556954],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010913126,0.00081035565,0.48028743,0.0011244031,0.00066250627,0.001514452,0.016443774,0.00027904843,0.0034526302,0.03477629,0.0789157,0.38162428],"study_design_scores_gemma":[0.0016487723,0.00016916968,0.86022896,0.0007394342,0.00007650696,0.00038609427,0.00021442132,0.030753504,0.0037180707,0.021396184,0.07806163,0.002607247],"about_ca_topic_score_codex":0.000069306814,"about_ca_topic_score_gemma":0.0000042263155,"teacher_disagreement_score":0.37994152,"about_ca_system_score_codex":0.000047403682,"about_ca_system_score_gemma":0.00012311104,"threshold_uncertainty_score":0.99992484},"labels":[],"label_agreement":null},{"id":"W2018331071","doi":"10.1142/s0218196704001979","title":"MONOIDS AND COMPUTATIONS","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Computation; Boolean circuit; Algebraic number; Point (geometry); Algebra over a field; Theoretical computer science; Discrete mathematics; Boolean function; Pure mathematics; Computer science; Algorithm","score_opus":0.008367005775459506,"score_gpt":0.25854745524928113,"score_spread":0.2501804494738216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018331071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42094263,0.00020990304,0.57621276,0.0022109146,0.0003148646,0.000018271028,5.7906055e-7,0.000014987968,0.00007506018],"genre_scores_gemma":[0.94787455,0.00006713259,0.05155872,0.00038627203,0.000103912855,4.4858172e-7,0.0000014920397,0.0000032114733,0.0000042470265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993363,0.000022301829,0.00024057945,0.000098430864,0.0002377901,0.00006460557],"domain_scores_gemma":[0.99940836,0.00007624709,0.00017824485,0.00004082188,0.00023542788,0.000060874758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016868186,0.00006524297,0.000090428366,0.00016755084,0.00005081729,0.0002075013,0.00024283037,0.000023909877,0.000001656857],"category_scores_gemma":[0.000020488782,0.000057843718,0.000031579435,0.00007901049,0.000038640148,0.00060819974,0.00008080162,0.00007701616,0.0000024956607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021912661,0.00010775888,0.0010573112,0.000007246731,0.00012046293,0.000092613474,0.0023268235,0.012254538,0.0009045498,0.6068761,0.00012557289,0.37610513],"study_design_scores_gemma":[0.0018683979,0.00024112625,0.04700223,0.00009710537,0.00001391501,0.001497639,0.00018197775,0.074348204,0.0008056658,0.87350327,0.00027778227,0.00016266046],"about_ca_topic_score_codex":0.000006831863,"about_ca_topic_score_gemma":7.988733e-7,"teacher_disagreement_score":0.52693194,"about_ca_system_score_codex":0.000027531254,"about_ca_system_score_gemma":0.000045685596,"threshold_uncertainty_score":0.23587984},"labels":[],"label_agreement":null},{"id":"W2018650645","doi":"10.1016/j.ic.2011.01.001","title":"An extension of the Lyndon–Schützenberger result to pseudoperiodic words","year":2011,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Extension (predicate logic); Computer science; Combinatorics; Linguistics; Mathematics; Mathematical economics; Philosophy; Programming language","score_opus":0.017044988781471898,"score_gpt":0.23565237675886666,"score_spread":0.21860738797739476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018650645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54909915,0.0000073789906,0.448903,0.00016300817,0.00019006983,0.00011592358,0.000001343049,0.00006130159,0.0014588118],"genre_scores_gemma":[0.98210526,0.0000024886526,0.016831301,0.0010327713,0.00000954422,0.0000044663097,0.000003889133,0.000001917724,0.000008364006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937516,0.000044217522,0.0002512665,0.000086369146,0.00016075245,0.00008225906],"domain_scores_gemma":[0.99945617,0.000017146645,0.00012311673,0.00024494197,0.000108393244,0.000050250354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025731884,0.00006296927,0.00006841336,0.000089086985,0.00010489725,0.00008364008,0.00026115472,0.000029245326,0.000007868763],"category_scores_gemma":[0.00002176472,0.000043652064,0.000021838028,0.00027752217,0.000025123036,0.0014472901,0.00009354176,0.000041305113,0.000024466615],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053499716,0.00007733053,0.0008508578,0.000033731783,0.000010303573,6.4608065e-7,0.056080338,0.0023736723,0.0018478812,0.10091355,0.0012215998,0.8365366],"study_design_scores_gemma":[0.0005295539,0.00021063238,0.21858779,0.000063049454,0.0000063516077,0.000025937057,0.0010505787,0.7626751,0.0056999023,0.009500639,0.0014371434,0.00021331603],"about_ca_topic_score_codex":0.000031346644,"about_ca_topic_score_gemma":0.0000018992357,"teacher_disagreement_score":0.83632326,"about_ca_system_score_codex":0.000008342722,"about_ca_system_score_gemma":0.000023239902,"threshold_uncertainty_score":0.17800795},"labels":[],"label_agreement":null},{"id":"W2018688081","doi":"10.1081/agb-100107954","title":"NOETHERIAN UNIQUE FACTORIZATION SEMIGROUP ALGEBRAS","year":2001,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Vrije Universiteit Brussel; Fonds Wetenschappelijk Onderzoek","keywords":"Mathematics; Noetherian; Semigroup; Pure mathematics; Algebra over a field; Factorization; Discrete mathematics; Algorithm","score_opus":0.03086573631311417,"score_gpt":0.28720599582075396,"score_spread":0.2563402595076398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018688081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08763877,0.0013907405,0.86976945,0.00845558,0.00035029234,0.0004187205,0.000004349863,0.0008197047,0.031152386],"genre_scores_gemma":[0.95430297,0.00084228703,0.04373905,0.00068281556,0.00002942516,0.000058537233,0.000034290762,0.000016990594,0.00029361004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867123,0.0003019438,0.00033163323,0.0002824031,0.0001517748,0.0002610399],"domain_scores_gemma":[0.9961624,0.0002872925,0.000106361884,0.0033101593,0.0000607067,0.00007307757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004886596,0.00014792834,0.00015625152,0.00020671806,0.0002032533,0.00015399228,0.003559603,0.00010250912,0.00006174395],"category_scores_gemma":[0.00009240098,0.0001527043,0.000050127983,0.0011063121,0.00011322106,0.00069754437,0.00087705266,0.00026525973,0.00012840882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019145095,0.00014490668,0.006591573,0.0000034159575,0.000007913195,0.000004262854,0.001143912,0.000018119146,0.0010523158,0.94727474,0.00028888098,0.04346802],"study_design_scores_gemma":[0.0011352872,0.000097649005,0.06640352,0.00018596066,0.000012352224,0.000100343095,0.00048363488,0.11127521,0.002612475,0.6275278,0.18912996,0.0010358407],"about_ca_topic_score_codex":0.00008549752,"about_ca_topic_score_gemma":0.00015536706,"teacher_disagreement_score":0.86666423,"about_ca_system_score_codex":0.000098311575,"about_ca_system_score_gemma":0.0000585202,"threshold_uncertainty_score":0.6614687},"labels":[],"label_agreement":null},{"id":"W2019028783","doi":"10.1016/j.jpaa.2012.04.014","title":"Effective dimension of finite semigroups","year":2012,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Injective function; Semigroup; Dimension (graph theory); Representation (politics); Pure mathematics; Field (mathematics); Algebra over a field; Krohn–Rhodes theory; Special classes of semigroups","score_opus":0.006271542740502673,"score_gpt":0.21539950457338816,"score_spread":0.20912796183288548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019028783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95156306,0.0016806072,0.04514354,0.00014639845,0.00027498393,0.00009599858,0.0000010257434,0.00001688729,0.001077523],"genre_scores_gemma":[0.995026,0.000044727512,0.004474396,0.0002148471,0.00021961512,0.0000017238752,3.1231636e-7,0.0000059952263,0.000012416694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992048,0.000038370024,0.00027453908,0.00009028687,0.00021163646,0.00018033192],"domain_scores_gemma":[0.99909157,0.00026329976,0.0003204579,0.00015728745,0.000047541504,0.00011984571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006467262,0.0001031648,0.00024922396,0.00009668727,0.0000461896,0.000028247503,0.00024966119,0.000057373734,0.000009412727],"category_scores_gemma":[0.000021480462,0.00007298746,0.000071574075,0.00015958975,0.000037975755,0.00036487047,0.00012245929,0.00016297164,0.0000059736412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009649185,0.00038797056,0.002819235,0.00010194124,0.00016669105,0.000017181934,0.0056374813,0.000060673694,0.1725794,0.618366,0.0024431385,0.19732381],"study_design_scores_gemma":[0.0053022355,0.0015472216,0.11168977,0.0006016087,0.00027649218,0.0010498,0.001605846,0.002661479,0.63788974,0.22535123,0.010820309,0.0012042703],"about_ca_topic_score_codex":5.665674e-7,"about_ca_topic_score_gemma":1.2091648e-7,"teacher_disagreement_score":0.46531034,"about_ca_system_score_codex":0.000010403551,"about_ca_system_score_gemma":0.0000136456365,"threshold_uncertainty_score":0.2976342},"labels":[],"label_agreement":null},{"id":"W2019168264","doi":"10.1016/j.dam.2011.10.029","title":"Sturmian graphs and integer representations over numeration systems","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Continued fraction; Graph; Integer (computer science); Discrete mathematics; Fraction (chemistry); Natural number; Combinatorics; Representation (politics); Path (computing); Arithmetic","score_opus":0.021773893499408177,"score_gpt":0.24163171360855865,"score_spread":0.21985782010915048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019168264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058717933,0.00009862131,0.8988587,0.000048978414,0.00018849269,0.00043523166,0.00000545925,0.00032115215,0.041325413],"genre_scores_gemma":[0.9257589,0.000014401969,0.073920146,0.0000902144,0.000017763292,0.00007277602,0.000006064166,0.000014930541,0.00010483518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991121,0.000015841682,0.00026152973,0.00026263567,0.00017990563,0.00016797446],"domain_scores_gemma":[0.9991532,0.0000722257,0.00012315703,0.0005546048,0.000025819209,0.00007097699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021942872,0.00013449683,0.00016433815,0.00007813257,0.00011204033,0.00017822096,0.0003292181,0.000052272928,0.000018247993],"category_scores_gemma":[0.000012982208,0.00010886276,0.00003443762,0.00017969393,0.000055602253,0.00028330064,0.00015359187,0.000081037346,0.0000339058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013485947,0.000034415818,0.000043772074,0.000045840377,0.00001843524,0.000002087515,0.005706529,0.0000045636184,0.0011194967,0.992047,0.0003185393,0.0006579563],"study_design_scores_gemma":[0.00048613673,0.000043656204,0.0016984501,0.00007962152,0.000043706998,0.000037232156,0.0037312403,0.13386653,0.0034190954,0.8558305,0.00029175586,0.00047208395],"about_ca_topic_score_codex":0.000024022176,"about_ca_topic_score_gemma":0.0000028518918,"teacher_disagreement_score":0.86704093,"about_ca_system_score_codex":0.00001021973,"about_ca_system_score_gemma":0.000011049712,"threshold_uncertainty_score":0.44392943},"labels":[],"label_agreement":null},{"id":"W2019689997","doi":"10.4153/cjm-2009-013-9","title":"On ℤ-Modules of Algebraic Integers","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Rank (graph theory); Integer (computer science); Algebraic number; Multiplicative function; Degree (music); Discrete mathematics","score_opus":0.010081722580178807,"score_gpt":0.21129462245947989,"score_spread":0.20121289987930108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019689997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72880685,0.00039495298,0.26298398,0.0021156932,0.00041983215,0.00007132006,0.0000042379183,0.00001682426,0.005186311],"genre_scores_gemma":[0.9629619,0.0000044053927,0.03654367,0.0004174823,0.000031484655,1.04316825e-7,1.2099751e-7,0.0000042155834,0.000036628215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926525,0.000020882964,0.00033024445,0.000061185376,0.0001618356,0.00016057274],"domain_scores_gemma":[0.998994,0.0001233924,0.0002692818,0.00026746857,0.00009329269,0.00025259386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040072875,0.00007843193,0.00019594043,0.00024774586,0.000035514957,0.00004728982,0.00071917055,0.000035492838,0.000028237062],"category_scores_gemma":[0.00019244044,0.00006195882,0.00008786235,0.00016055207,0.000039530183,0.000154706,0.0000073623933,0.00011825643,0.000011649886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010304235,0.000043748565,0.000013911421,0.00001918923,0.000017573953,0.00008187933,0.0018554624,0.000070008056,0.00043402112,0.9709568,0.0037164353,0.02278993],"study_design_scores_gemma":[0.00031256888,0.00055449404,0.0010576702,0.0005125061,0.000015514705,0.00036447475,0.0004362179,0.006254405,0.008087539,0.98159015,0.0006341437,0.00018031089],"about_ca_topic_score_codex":0.000036034962,"about_ca_topic_score_gemma":0.00012153305,"teacher_disagreement_score":0.23415503,"about_ca_system_score_codex":0.000046618232,"about_ca_system_score_gemma":0.00025864074,"threshold_uncertainty_score":0.25266072},"labels":[],"label_agreement":null},{"id":"W2020031747","doi":"10.1016/j.tcs.2014.01.033","title":"A note on abelian returns in rotation words","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Abelian group; Prefix; Mathematics; Rotation (mathematics); Connection (principal bundle); Set (abstract data type); Pure mathematics; Discrete mathematics; Computer science; Linguistics; Geometry","score_opus":0.006793204838155968,"score_gpt":0.24547315904204117,"score_spread":0.23867995420388521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020031747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11774575,0.000004928751,0.87387335,0.00180533,0.00054059736,0.00011450885,3.9355533e-7,0.00019909588,0.0057160533],"genre_scores_gemma":[0.9109939,0.000001496284,0.08702939,0.0018437316,0.000112458416,0.0000063779785,4.3202368e-7,0.000006652179,0.0000055680175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976314,0.00018602054,0.00026345951,0.0007260423,0.0006388682,0.00055421924],"domain_scores_gemma":[0.9983324,0.00044137432,0.000060171824,0.000906708,0.00006272435,0.00019661932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025103472,0.0001704207,0.0001856796,0.00024744755,0.00019414237,0.00038017042,0.0022252884,0.00005538165,0.000020145828],"category_scores_gemma":[0.00017867153,0.0001367716,0.0000466439,0.0014711497,0.0010265685,0.00056660286,0.0005150295,0.00023745607,0.00017567292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005525392,0.00004241133,0.000051584273,0.0000026881705,4.4466964e-7,0.0000050850085,0.00063618587,0.00024593322,0.0004649668,0.8785363,0.000011585271,0.1199973],"study_design_scores_gemma":[0.00018764842,0.00018219769,0.0028855486,0.000044673005,6.548871e-7,0.000007657186,0.0000033048755,0.6276092,0.0020957764,0.36674446,0.00009394335,0.00014490643],"about_ca_topic_score_codex":0.0000047395883,"about_ca_topic_score_gemma":0.0000024078201,"teacher_disagreement_score":0.7932481,"about_ca_system_score_codex":0.00007597997,"about_ca_system_score_gemma":0.000060879654,"threshold_uncertainty_score":0.5577384},"labels":[],"label_agreement":null},{"id":"W2020219845","doi":"10.1016/j.jnt.2013.04.004","title":"Approximation simultanée dʼun nombre v -adique et de son carré par des nombres algébriques","year":2013,"lang":"fr","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Humanities","score_opus":0.01702820851539581,"score_gpt":0.27741434571963036,"score_spread":0.26038613720423454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020219845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58445317,0.0065855817,0.38990515,0.0049137534,0.001633493,0.0003453603,0.000050490984,0.00011797494,0.01199504],"genre_scores_gemma":[0.9250061,0.00074950355,0.06806456,0.0024634385,0.0009951857,0.000016646822,0.0000065012573,0.00005966821,0.0026383854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957684,0.0018112696,0.0009495946,0.00032099764,0.00045458775,0.00069509837],"domain_scores_gemma":[0.9957065,0.0017216891,0.0009542063,0.00049956073,0.00071899424,0.0003990554],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038896808,0.00038608722,0.0005496862,0.00014983842,0.00022309841,0.00075382023,0.0011335727,0.0002932098,0.0020712367],"category_scores_gemma":[0.00070425356,0.0003367134,0.000374504,0.00032270877,0.00045952728,0.003461708,0.0002303147,0.00074545207,0.00033042495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014236993,0.0009411513,0.0037306058,0.0004939303,0.0004514967,0.00029795163,0.029953608,0.0014898428,0.0074132937,0.6042878,0.051763862,0.29903406],"study_design_scores_gemma":[0.0008812438,0.00031233698,0.01556621,0.0014134684,0.00009965845,0.0021615482,0.001092153,0.02795201,0.007010718,0.92104846,0.021866133,0.0005960382],"about_ca_topic_score_codex":0.0003328597,"about_ca_topic_score_gemma":0.000019683488,"teacher_disagreement_score":0.34055296,"about_ca_system_score_codex":0.00033570913,"about_ca_system_score_gemma":0.0005788542,"threshold_uncertainty_score":0.9999085},"labels":[],"label_agreement":null},{"id":"W2020437202","doi":"10.1145/876638.876642","title":"Definable relations and first-order query languages over strings","year":2003,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"semigroups and automata theory","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; String (physics); First-order logic; Mathematics; Query language; Predicate (mathematical logic); Regular language; Theoretical computer science; Discrete mathematics; Programming language; Database; Automaton","score_opus":0.007487091163718904,"score_gpt":0.22484196362902464,"score_spread":0.21735487246530574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020437202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9742234,0.0022282857,0.013326408,0.0066721323,0.00037168743,0.00004564207,6.587838e-7,0.000019275663,0.0031125138],"genre_scores_gemma":[0.9663825,0.000058477413,0.03179639,0.00050381647,0.000044375785,4.096021e-7,2.8644571e-8,0.0000045729944,0.0012094042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995526,0.00004387222,0.0001291241,0.00005803253,0.00012629687,0.000090039226],"domain_scores_gemma":[0.9991506,0.0001580687,0.0001387732,0.00047991754,0.00004073568,0.000031942523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003675387,0.00004636405,0.00007324709,0.000038906364,0.00011120719,0.0000745787,0.00077651517,0.000024285471,0.000028079096],"category_scores_gemma":[0.0007961386,0.000028039147,0.00004409561,0.0001555717,0.000020500838,0.0003306373,0.0002451471,0.00012345618,0.0000048855145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016996477,0.00021377251,0.10056128,0.000044409942,0.00016529374,0.00011067875,0.0046041477,0.0014522834,0.0041895816,0.7407504,0.13895409,0.008937067],"study_design_scores_gemma":[0.001710286,0.00018277421,0.23403938,0.00029845792,0.000074216776,0.0017578081,0.00072399905,0.0030969498,0.0063255765,0.5952015,0.15616126,0.0004278215],"about_ca_topic_score_codex":0.000009127526,"about_ca_topic_score_gemma":0.0000032064263,"teacher_disagreement_score":0.14554892,"about_ca_system_score_codex":0.000017527575,"about_ca_system_score_gemma":0.000036790894,"threshold_uncertainty_score":0.14429712},"labels":[],"label_agreement":null},{"id":"W2020610947","doi":"10.1007/s00010-004-2750-x","title":"On integer sequences whose first iterates are linear","year":2005,"lang":"en","type":"article","venue":"Aequationes Mathematicae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Iterated function; Sequence (biology); Lexicographical order; Integer (computer science); Integer sequence; Combinatorics; Discrete mathematics; Thue equation; Diophantine equation; Mathematical analysis; Diophantine set; Generating function; Computer science","score_opus":0.019160827690642,"score_gpt":0.25219457347890717,"score_spread":0.23303374578826516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020610947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11263698,0.0001919552,0.86569,0.014634001,0.0002537667,0.00030565608,0.0000069686466,0.0006370426,0.005643633],"genre_scores_gemma":[0.94302326,0.000010797807,0.054923337,0.0011635672,0.00013845105,0.000041793766,0.000005306551,0.000013101999,0.0006803685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885845,0.00004596591,0.00030077642,0.00029092754,0.0002933624,0.00021052791],"domain_scores_gemma":[0.99847853,0.00066867215,0.00016275496,0.0005505779,0.00007412161,0.000065333305],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037398038,0.00016133605,0.0001836165,0.0001021697,0.00016581097,0.00019649425,0.00062901585,0.000050377825,0.00022560987],"category_scores_gemma":[0.00026386627,0.00012273784,0.000064539876,0.00026188817,0.00004613459,0.00066380715,0.00009804679,0.00009273799,0.002492778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033873268,0.00017133483,0.000037507096,0.000045082077,0.000016026339,0.000006207154,0.0023414188,0.0008092044,0.00013856075,0.9872288,0.0017205415,0.007481932],"study_design_scores_gemma":[0.0002782588,0.0000788335,0.00027932823,0.00035362254,0.000009511796,0.000024616054,0.00017514563,0.66218257,0.0036889128,0.32867247,0.0039062146,0.0003505015],"about_ca_topic_score_codex":0.0000031782274,"about_ca_topic_score_gemma":0.00000897694,"teacher_disagreement_score":0.8303863,"about_ca_system_score_codex":0.00003551477,"about_ca_system_score_gemma":0.00001918457,"threshold_uncertainty_score":0.9982839},"labels":[],"label_agreement":null},{"id":"W2021056221","doi":"10.1142/s0129054108005863","title":"AVOIDING APPROXIMATE SQUARES","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alphabet; Mathematics; Combinatorics; Least-squares function approximation; Word (group theory); Variation (astronomy); Discrete mathematics; Algorithm; Statistics; Physics; Philosophy","score_opus":0.023775864139508048,"score_gpt":0.2867096296032943,"score_spread":0.2629337654637863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021056221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19217764,0.00005075161,0.80481166,0.00068609987,0.0018623414,0.000028820054,0.0000010749329,0.00002260478,0.00035898635],"genre_scores_gemma":[0.7921951,0.000033662527,0.20745613,0.00011991755,0.00017936232,5.407395e-7,3.8360037e-7,0.0000026581247,0.000012241425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980084,0.0000556969,0.00051728025,0.00017844787,0.0010822277,0.00015797971],"domain_scores_gemma":[0.9974987,0.00021726431,0.00053690735,0.000267734,0.0013939133,0.000085496315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013199003,0.00008736946,0.00015085853,0.0006420151,0.00028693787,0.00021942108,0.0035587158,0.0000189098,0.000013836995],"category_scores_gemma":[0.00017974507,0.00007504488,0.000105187486,0.00057488034,0.0004325925,0.0025779987,0.00040824208,0.00016098273,0.000009038295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003121475,0.0005525313,0.0024452775,0.000013050716,0.00014289684,0.0002606563,0.00616888,0.010293415,0.025506416,0.6721443,0.0012223048,0.28121907],"study_design_scores_gemma":[0.0015745512,0.000495749,0.028601842,0.00035744996,0.000014230165,0.008646909,0.00012730644,0.81172377,0.06856101,0.07535564,0.0040275976,0.0005139205],"about_ca_topic_score_codex":0.0000057741363,"about_ca_topic_score_gemma":2.7191248e-7,"teacher_disagreement_score":0.8014304,"about_ca_system_score_codex":0.00007570533,"about_ca_system_score_gemma":0.00041237092,"threshold_uncertainty_score":0.6613039},"labels":[],"label_agreement":null},{"id":"W2021596745","doi":"10.1016/j.tcs.2012.04.001","title":"Algorithmic decomposition of shuffle on words","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Sublinear function; Property (philosophy); Decomposition; Mathematics; Time complexity; Combinatorics; Computational complexity theory; Discrete mathematics; Polynomial; Efficient algorithm; Word (group theory); Algorithm","score_opus":0.008221397840494565,"score_gpt":0.2671597439217456,"score_spread":0.258938346081251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021596745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14172594,0.000036734258,0.85315615,0.0002939755,0.0007862233,0.00009267854,0.0000012381685,0.00014674,0.0037603292],"genre_scores_gemma":[0.8532317,0.0000020406771,0.14612262,0.0004566155,0.0001735115,0.0000035988758,5.105106e-7,0.000005579034,0.0000038042665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803275,0.000102878155,0.00025166624,0.00038863823,0.00063614245,0.0005879511],"domain_scores_gemma":[0.99852616,0.00026812073,0.000080727914,0.0007785533,0.0000813466,0.00026509652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016731679,0.00015221846,0.00018915196,0.00020278111,0.00020151328,0.0001224644,0.0018727221,0.000044141332,0.000049167124],"category_scores_gemma":[0.00003370647,0.00012058949,0.000069780646,0.0008973389,0.0013948932,0.00085020065,0.00064094074,0.0001403786,0.0001227522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049522305,0.00012949081,0.00006388071,0.0000040464533,0.0000022878655,0.0000013733463,0.00042504666,0.000035615984,0.002154207,0.93085563,0.000030242298,0.0662932],"study_design_scores_gemma":[0.00035277766,0.0005217643,0.0058032605,0.00008659088,0.000006993764,0.00007091297,0.000014901676,0.6282875,0.102491535,0.2618064,0.00015863351,0.00039870443],"about_ca_topic_score_codex":0.0000017178886,"about_ca_topic_score_gemma":3.3971432e-8,"teacher_disagreement_score":0.7115058,"about_ca_system_score_codex":0.000049840768,"about_ca_system_score_gemma":0.000046556557,"threshold_uncertainty_score":0.51395416},"labels":[],"label_agreement":null},{"id":"W2021707702","doi":"10.1007/s00605-011-0305-5","title":"Free lattice-ordered groups and the space of left orderings","year":2011,"lang":"de","type":"article","venue":"Monatshefte für Mathematik","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Uncountable set; Mathematics; Combinatorics; Cantor set; Free group; Group (periodic table); Lattice (music); Space (punctuation); Discrete mathematics; Countable set; Physics; Computer science","score_opus":0.018470188455333773,"score_gpt":0.22404076591570182,"score_spread":0.20557057746036805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021707702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.674719,0.055094324,0.19710843,0.010171272,0.0050067715,0.0034008487,0.00019004046,0.0009912972,0.053318024],"genre_scores_gemma":[0.95066637,0.0011965594,0.045501236,0.00049671164,0.000223888,0.000036521185,0.000003839536,0.00009601628,0.0017788421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689895,0.0002847615,0.00084781833,0.00071775273,0.0006195348,0.00063116895],"domain_scores_gemma":[0.99594593,0.0008103558,0.0006900177,0.0022222677,0.00015964275,0.00017181065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018260913,0.00051328965,0.00085261493,0.00016284772,0.00027903367,0.0002113024,0.0025002712,0.00020986317,0.00048590897],"category_scores_gemma":[0.00040135963,0.00035890818,0.00024730354,0.0003828367,0.0010199466,0.0005316647,0.0018582206,0.0004005256,0.00015305234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001227791,0.00029476167,0.0002106772,0.0005675976,0.00027004268,0.000034689423,0.04751529,0.0000028777265,0.00033893998,0.9414433,0.002603074,0.0065959543],"study_design_scores_gemma":[0.004147541,0.00024275288,0.0028895705,0.00058532524,0.00031827673,0.0001345254,0.0019383751,0.05734813,0.0047147963,0.92174125,0.0050815432,0.0008578984],"about_ca_topic_score_codex":0.0002888667,"about_ca_topic_score_gemma":0.000024203337,"teacher_disagreement_score":0.2759474,"about_ca_system_score_codex":0.000026380834,"about_ca_system_score_gemma":0.000068436486,"threshold_uncertainty_score":0.9998863},"labels":[],"label_agreement":null},{"id":"W2021881883","doi":"10.2478/s12175-014-0242-6","title":"Hooked extended Langford sequences of small and large defects","year":2014,"lang":"en","type":"article","venue":"Mathematica Slovaca","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Mod","score_opus":0.012255135887185459,"score_gpt":0.22295197456331636,"score_spread":0.2106968386761309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021881883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5765029,0.00023053077,0.41677573,0.00015092027,0.000059249556,0.000108190456,0.0000017935516,0.00014850653,0.0060221427],"genre_scores_gemma":[0.92732,0.000008953313,0.07231692,0.00017371612,0.000021568545,0.0000089421965,8.127408e-7,0.000008101197,0.00014100684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915737,0.00006141223,0.00020476016,0.00021847486,0.0001479585,0.0002100082],"domain_scores_gemma":[0.9990737,0.00026695943,0.00010686207,0.0004578408,0.000028980598,0.00006566595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004823518,0.00011360465,0.00023068908,0.00006247181,0.000053529104,0.000053265507,0.00047859031,0.000047221733,0.00002804078],"category_scores_gemma":[0.00010474534,0.00008703267,0.000048270005,0.00012813225,0.000051203628,0.0001307231,0.0002153392,0.00005975204,0.000043975466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022456154,0.00008664882,0.00012957932,0.00021898307,0.000013373386,0.0000040248055,0.001293161,9.895786e-7,0.0071006976,0.98016095,0.00018444748,0.010804885],"study_design_scores_gemma":[0.0008213458,0.00021094982,0.0030471394,0.0002648814,0.000029736651,0.00006262323,0.0002590491,0.08865754,0.033731543,0.8696992,0.0028026868,0.00041330906],"about_ca_topic_score_codex":0.0000027961603,"about_ca_topic_score_gemma":0.0000021863455,"teacher_disagreement_score":0.35081705,"about_ca_system_score_codex":0.0000057111383,"about_ca_system_score_gemma":0.000012807613,"threshold_uncertainty_score":0.35490894},"labels":[],"label_agreement":null},{"id":"W2022357851","doi":"10.1016/j.aam.2010.05.001","title":"Recurrent words with constant Abelian complexity","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Abelian group; Constant (computer programming); Pure mathematics; Combinatorics; Computer science","score_opus":0.013277789470530175,"score_gpt":0.25981982579151397,"score_spread":0.2465420363209838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022357851","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056255925,0.0003295632,0.8668379,0.00021431826,0.0005392327,0.00051382114,0.000007139243,0.00039143325,0.07491067],"genre_scores_gemma":[0.46355897,0.000037391714,0.53624,0.00008458962,0.000021912965,0.000034272216,0.0000014878215,0.0000095228115,0.000011867371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885446,0.000008145204,0.00028242156,0.000303603,0.0002565056,0.00029486028],"domain_scores_gemma":[0.99884194,0.00022962411,0.00014742932,0.0006872864,0.000020361986,0.00007334867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032634492,0.00017472699,0.0002444078,0.00008002068,0.00006990949,0.00007421972,0.0007677258,0.000047665668,0.000024845362],"category_scores_gemma":[0.000022455491,0.00013094136,0.000023053926,0.00036946873,0.00023985526,0.00023805484,0.00015949315,0.00029562012,0.000043860342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005073933,0.0001346843,0.00006723715,0.00006677052,0.0000026111368,0.0000062355903,0.000610526,0.000012802885,0.00064003404,0.95021796,0.000018299781,0.04821778],"study_design_scores_gemma":[0.000586358,0.00005627226,0.00013749937,0.000110806766,0.0000047949734,0.000039469684,0.0003339402,0.018858543,0.0022800278,0.9706246,0.006611752,0.0003559026],"about_ca_topic_score_codex":0.0000014781867,"about_ca_topic_score_gemma":0.00011888408,"teacher_disagreement_score":0.40730307,"about_ca_system_score_codex":0.000019586421,"about_ca_system_score_gemma":0.000034813747,"threshold_uncertainty_score":0.5339634},"labels":[],"label_agreement":null},{"id":"W2022733343","doi":"10.1007/s002330010029","title":"Semigroups Generated by Similarity Orbits","year":2000,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Statistics Canada; Dalhousie University","funders":"","keywords":"Mathematics; Similarity (geometry); Algebra over a field; Pure mathematics; Artificial intelligence; Computer science","score_opus":0.00469261697358755,"score_gpt":0.1999972166823348,"score_spread":0.19530459970874725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022733343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83231646,0.0033217347,0.102565885,0.011245564,0.0013643834,0.00086012913,0.00020764967,0.0040497007,0.044068523],"genre_scores_gemma":[0.9676393,0.00025745374,0.0073785507,0.011291435,0.00019304905,0.00004998333,0.00010471503,0.00006174972,0.013023736],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969185,0.00015273332,0.0004697516,0.0009015084,0.0005227825,0.0010347198],"domain_scores_gemma":[0.99814564,0.0001222127,0.0000981664,0.0012614764,0.00006471799,0.00030778436],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005185819,0.00040994736,0.00039518852,0.000098228666,0.00037638785,0.00033960707,0.0017617834,0.00024239786,0.0010792647],"category_scores_gemma":[0.000028644215,0.0003825513,0.00018642112,0.0007608983,0.00009881546,0.0010616401,0.00028588343,0.00036803418,0.00093739055],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005117976,0.00040302257,0.00135662,0.000029761673,0.00010071221,0.000099251636,0.00064336625,0.00015545558,0.048885923,0.05645817,0.62354755,0.26826897],"study_design_scores_gemma":[0.0017536577,0.0003249266,0.0013774647,0.00008211222,0.000031740583,0.00022040604,0.00014009437,0.1286222,0.09840943,0.017520413,0.74972117,0.0017963856],"about_ca_topic_score_codex":0.00013773073,"about_ca_topic_score_gemma":0.000026931642,"teacher_disagreement_score":0.26647258,"about_ca_system_score_codex":0.00008429004,"about_ca_system_score_gemma":0.000055980352,"threshold_uncertainty_score":0.9998626},"labels":[],"label_agreement":null},{"id":"W2023034313","doi":"10.1016/j.jcta.2005.01.006","title":"A simple proof that a word of length n has at most <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:math> distinct squares","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Word (group theory); Simple (philosophy); Scroll; Mathematics; Computer science; Theology; Philosophy; Geometry","score_opus":0.015236540240838172,"score_gpt":0.2316709412900469,"score_spread":0.21643440104920872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023034313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902675,0.0008065588,0.0017560864,0.0005571657,0.003306941,0.00006829729,0.000056671146,0.0001147101,0.0030660753],"genre_scores_gemma":[0.99623257,0.0001347515,0.0017275441,0.00032975248,0.0012838109,0.00004690642,0.000024878926,0.00010268023,0.000117096475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960573,0.00034774403,0.0010792818,0.0005099871,0.0012405453,0.0007651788],"domain_scores_gemma":[0.99584115,0.000978724,0.0015855706,0.0010596237,0.00018569201,0.0003492604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021911059,0.00041906396,0.00044224245,0.00019326626,0.0006899423,0.0006217165,0.0017447157,0.0004023496,0.0005696763],"category_scores_gemma":[0.0006672453,0.0004679765,0.0006551644,0.00047115964,0.00061087083,0.0017506848,0.0010595976,0.00063396373,0.000095664356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015986019,0.000313839,0.000017858563,0.00015426787,0.0003222938,0.00025100054,0.0020862292,0.0002317893,0.0010329426,0.98239267,0.006491491,0.0051069926],"study_design_scores_gemma":[0.007125124,0.005421069,0.00031687054,0.0014946343,0.00064268836,0.0027841008,0.0026748255,0.13026951,0.4665495,0.2800707,0.10079089,0.0018601172],"about_ca_topic_score_codex":0.00005476865,"about_ca_topic_score_gemma":0.000048914277,"teacher_disagreement_score":0.702322,"about_ca_system_score_codex":0.00004480095,"about_ca_system_score_gemma":0.0005714325,"threshold_uncertainty_score":0.9997772},"labels":[],"label_agreement":null},{"id":"W2023568492","doi":"10.4204/eptcs.63.25","title":"Fife's Theorem for (7/3)-Powers","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Automaton; Characterization (materials science); Binary number; Power (physics); Cellular automaton; Mathematics; Discrete mathematics; Finite-state machine; Computer science; Algebra over a field; Pure mathematics; Arithmetic; Theoretical computer science; Algorithm; Physics; Quantum mechanics","score_opus":0.009762890928154543,"score_gpt":0.22897538780698515,"score_spread":0.2192124968788306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023568492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053880338,0.00009349964,0.92978704,0.0004583516,0.00045694812,0.00047707552,8.345862e-7,0.0003948057,0.014451084],"genre_scores_gemma":[0.89160025,0.000010500018,0.10757016,0.00063573406,0.00009360118,0.00006157918,3.1455775e-7,0.000016107682,0.000011754181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963723,0.000021820118,0.00038137197,0.0011136647,0.0005159248,0.001594934],"domain_scores_gemma":[0.99880576,0.00018195392,0.000112337504,0.00045610717,0.0002235171,0.00022034362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033960012,0.00027908076,0.00028212383,0.00037988543,0.0003151077,0.00033913497,0.0042529125,0.00009255108,0.000039343005],"category_scores_gemma":[0.00019329228,0.00023506997,0.000105559935,0.0016870203,0.0017520541,0.0013303423,0.0008045879,0.00035437007,0.000024093719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026415699,0.00008578274,0.00009295299,0.000010662541,0.0000043295113,0.000002477681,0.001504877,0.0000016283136,0.00059696904,0.97411895,0.000062025516,0.02349293],"study_design_scores_gemma":[0.0003614472,0.0004976527,0.00035739006,0.000032262942,0.000003221465,0.000043116102,0.000030285708,0.19345638,0.015452163,0.78921497,0.00025359684,0.00029750605],"about_ca_topic_score_codex":0.0000026207076,"about_ca_topic_score_gemma":6.095812e-7,"teacher_disagreement_score":0.8377199,"about_ca_system_score_codex":0.00023245066,"about_ca_system_score_gemma":0.00027785246,"threshold_uncertainty_score":0.95858747},"labels":[],"label_agreement":null},{"id":"W2023679149","doi":"10.1007/s00012-004-1895-8","title":"Results on the equivalence problem for finite groups","year":2005,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Equivalence (formal languages); Nilpotent; Dihedral group; Nilpotent group; Algebra over a field; Polynomial; Pure mathematics; Group (periodic table); Discrete mathematics; Mathematical analysis","score_opus":0.019179097369652797,"score_gpt":0.22526006977170318,"score_spread":0.2060809724020504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023679149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08217806,0.00028618908,0.7135929,0.11639286,0.0008251008,0.0018977515,0.00021029625,0.0015881521,0.0830287],"genre_scores_gemma":[0.9768723,0.000028627357,0.01725847,0.003632503,0.0001902299,0.000018828378,0.000011002003,0.000014533577,0.0019734607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886036,0.00006822529,0.00017196195,0.0003784013,0.00020398716,0.00031705096],"domain_scores_gemma":[0.9979874,0.0010510635,0.000099488934,0.0007414745,0.00005504971,0.000065563356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005005416,0.0001403876,0.00010694505,0.000072849456,0.00022489746,0.00012566372,0.0013350024,0.000041575706,0.000026385995],"category_scores_gemma":[0.00010158398,0.00009884985,0.00009106962,0.00029683195,0.00007131441,0.0005372608,0.00019500035,0.0001084765,0.00012621694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029193588,0.000036549274,0.0000027471258,0.0000044649137,0.000013456465,0.0000040812606,0.0010882736,0.0002074833,0.00014153603,0.95658135,0.016276015,0.025614873],"study_design_scores_gemma":[0.0027326404,0.0006473146,0.00037847378,0.00018224379,0.000034649573,0.000016693592,0.00063004124,0.18427445,0.011723462,0.2045169,0.59401315,0.00084998325],"about_ca_topic_score_codex":0.000020421854,"about_ca_topic_score_gemma":0.000012918146,"teacher_disagreement_score":0.89469427,"about_ca_system_score_codex":0.000051422343,"about_ca_system_score_gemma":0.00003699435,"threshold_uncertainty_score":0.403098},"labels":[],"label_agreement":null},{"id":"W2023927275","doi":"10.1016/j.ejc.2012.03.016","title":"A bijection between words and multisets of necklaces","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Bijection; Lexicographical order; Mathematics; Combinatorics; Permutation (music); Order (exchange); Set (abstract data type); Inverse; Word (group theory); Discrete mathematics; Computer science","score_opus":0.014712648348581674,"score_gpt":0.22803322308592308,"score_spread":0.2133205747373414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023927275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9159407,0.001397243,0.08018676,0.00009925819,0.0008466764,0.00002678738,6.3934107e-7,0.000020516336,0.0014814303],"genre_scores_gemma":[0.99671793,0.00007649016,0.0029915278,0.000022461223,0.00014857794,6.617074e-8,1.4433697e-7,0.000009178808,0.00003364487],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998941,0.00029043414,0.00033206504,0.00006695629,0.00022160231,0.00014794628],"domain_scores_gemma":[0.9990975,0.0001225819,0.0003984096,0.00016298919,0.00008698069,0.00013149175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016016645,0.000080847814,0.00017424184,0.00013567478,0.00004688181,0.000043381027,0.00039727063,0.000015022967,0.0000023963828],"category_scores_gemma":[0.00007446158,0.00006617353,0.000051244617,0.00024671972,0.000035164954,0.00060333824,0.00014216913,0.00014499175,0.000005151369],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045167188,0.0008964003,0.34917417,0.00015100854,0.00024429004,0.00014718279,0.015584943,0.000027927947,0.0047175516,0.25016606,0.002807115,0.37603816],"study_design_scores_gemma":[0.0026298505,0.0013746663,0.9548888,0.00026941855,0.00007933614,0.00045121132,0.0003781932,0.0008932279,0.0077013504,0.015740372,0.015151131,0.00044242543],"about_ca_topic_score_codex":7.9103637e-7,"about_ca_topic_score_gemma":1.9992179e-8,"teacher_disagreement_score":0.6057146,"about_ca_system_score_codex":0.000015687467,"about_ca_system_score_gemma":0.000014508245,"threshold_uncertainty_score":0.26984784},"labels":[],"label_agreement":null},{"id":"W2023968242","doi":"10.1090/s0002-9939-08-09319-2","title":"On patterns occurring in binary algebraic numbers","year":2008,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Algorithm; Annotation; Computer science; Semantics (computer science); Artificial intelligence; Database; Programming language","score_opus":0.01126064086272584,"score_gpt":0.23126106091550425,"score_spread":0.2200004200527784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023968242","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945835,0.000008271908,0.0025772036,0.0006880108,0.000032776374,0.00013342561,0.000001347885,0.00009627149,0.0018792009],"genre_scores_gemma":[0.98580337,0.000012599212,0.01282397,0.0012738695,0.000018646586,0.000015053484,8.066442e-8,0.000012028349,0.000040386985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987538,0.000009804508,0.00027976974,0.00028060956,0.00037693966,0.000299089],"domain_scores_gemma":[0.999205,0.00020577732,0.0002600459,0.00022612582,0.00003923263,0.00006383093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003101006,0.00015087632,0.00030466588,0.000030452089,0.000107001135,0.000029554583,0.0011682847,0.00003056151,0.000012751933],"category_scores_gemma":[0.00011325463,0.000102329745,0.00024289238,0.00063581835,0.00034545513,0.00021308783,0.00043939357,0.00021708941,0.00001852377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033295968,0.0014276621,0.09685505,0.0006595537,0.00012995367,0.000009528529,0.029487524,0.000049402868,0.0139600355,0.83903766,0.01260038,0.0057499437],"study_design_scores_gemma":[0.0012644005,0.00060265156,0.14993665,0.0012914813,0.000032967924,0.00018461463,0.0057941386,0.10538166,0.021021504,0.71316576,0.00014525508,0.0011789228],"about_ca_topic_score_codex":0.000023127317,"about_ca_topic_score_gemma":1.7733011e-7,"teacher_disagreement_score":0.12587191,"about_ca_system_score_codex":0.000058155983,"about_ca_system_score_gemma":0.000019403897,"threshold_uncertainty_score":0.4172886},"labels":[],"label_agreement":null},{"id":"W2024425953","doi":"10.1007/s00233-006-0604-7","title":"The Intersection of Pseudovarieties of Central Simple Semigroups","year":2006,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Intersection (aeronautics); Mathematics; Simple (philosophy); Algebra over a field; Pure mathematics; Epistemology; Geography; Philosophy","score_opus":0.0034993091593057374,"score_gpt":0.19209007598552735,"score_spread":0.1885907668262216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024425953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6656157,0.001020087,0.32355878,0.0009244781,0.0011330871,0.00029525472,0.000023200097,0.0002579301,0.0071714884],"genre_scores_gemma":[0.99745697,0.00001960206,0.0019865553,0.00007196233,0.00008237296,0.000009277448,0.0000093032395,0.000013270954,0.00035071291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998302,0.00007532791,0.00051566004,0.0002681587,0.0003372942,0.0005015832],"domain_scores_gemma":[0.9985963,0.00025575975,0.0003122535,0.0006971372,0.000092255614,0.000046299923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004264768,0.00016964837,0.00023608487,0.000064215885,0.00018363688,0.00006942943,0.000963974,0.00008539361,0.000013361291],"category_scores_gemma":[0.00003686071,0.00012297832,0.00018430127,0.00039757817,0.00021244207,0.00037583165,0.00030733467,0.00012936757,0.0000056828153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034158114,0.00011435717,0.007593885,0.00003855284,0.00003836676,0.000002627387,0.0005883642,0.00020038051,0.025420934,0.93192255,0.015900634,0.018145174],"study_design_scores_gemma":[0.0012761285,0.0006275647,0.049141254,0.00014689029,0.00004427422,0.00008661898,0.0038444444,0.06754415,0.2625308,0.57767886,0.036338173,0.00074085384],"about_ca_topic_score_codex":0.00078431185,"about_ca_topic_score_gemma":0.0002898314,"teacher_disagreement_score":0.35424373,"about_ca_system_score_codex":0.000054619723,"about_ca_system_score_gemma":0.00004606224,"threshold_uncertainty_score":0.501491},"labels":[],"label_agreement":null},{"id":"W2025521996","doi":"10.1016/j.tcs.2004.02.032","title":"On the state complexity of reversals of regular languages","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Regular language; Variety (cybernetics); Finite-state machine; State (computer science); Deterministic finite automaton; Nondeterministic finite automaton; Mathematics; Automaton; Finite state; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automata theory","score_opus":0.015218119819853127,"score_gpt":0.2520598938413013,"score_spread":0.23684177402144815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025521996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36019823,0.000020948872,0.6369161,0.0013978134,0.000108302615,0.00010168704,0.0000037546524,0.000056248176,0.0011969456],"genre_scores_gemma":[0.93624747,0.000002596685,0.06321209,0.00051019795,0.000017363624,0.0000015332039,2.2709936e-7,0.0000041444177,0.0000043918167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982391,0.00012274072,0.00028425344,0.0003689864,0.00067395,0.00031098162],"domain_scores_gemma":[0.9981025,0.0004408742,0.00013653733,0.0010909475,0.00013776097,0.00009139721],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019238228,0.00012590397,0.00021982231,0.000105834624,0.00014776207,0.00007219854,0.0027759927,0.000024245941,0.000029437893],"category_scores_gemma":[0.00013659007,0.00007637068,0.000074955664,0.00083398254,0.0061559076,0.00023209878,0.0007255087,0.00012363476,0.00001746413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068590193,0.00006278033,0.0000034893872,0.000008168926,0.0000039487886,0.000004388206,0.00078231166,0.00048714736,0.0038980613,0.9905009,0.000019960042,0.00422193],"study_design_scores_gemma":[0.00015786475,0.00020630784,0.0005871889,0.00006880288,0.0000020364018,0.000008685327,0.000017086415,0.025346603,0.12557815,0.8479343,0.000004775947,0.00008821042],"about_ca_topic_score_codex":0.000016793021,"about_ca_topic_score_gemma":4.58066e-7,"teacher_disagreement_score":0.5760492,"about_ca_system_score_codex":0.000028690532,"about_ca_system_score_gemma":0.00007819841,"threshold_uncertainty_score":0.9965488},"labels":[],"label_agreement":null},{"id":"W2025524923","doi":"10.2178/bsl/1246453975","title":"Enumerating Types of Boolean Functions","year":2009,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Boolean function; Maximum satisfiability problem; Boolean data type; Boolean expression; Variable (mathematics); Computer science; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.010236405667975979,"score_gpt":0.2189480889604182,"score_spread":0.20871168329244222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025524923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48431432,0.0048725507,0.2319921,0.023696894,0.0010893599,0.00058414676,0.000021424732,0.00077159243,0.25265762],"genre_scores_gemma":[0.9856303,0.00001660747,0.012988598,0.00071707665,0.00005135721,0.0000017953698,0.0000015022447,0.0000032220435,0.00058958586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927944,0.000037668528,0.00023319267,0.00016871911,0.00013551483,0.00014549382],"domain_scores_gemma":[0.99938107,0.000068517445,0.00012609166,0.00033701537,0.000052725805,0.000034588218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022723565,0.000082214305,0.00017705376,0.00005923102,0.000049915103,0.000017494303,0.00040891414,0.000041335647,0.00021363625],"category_scores_gemma":[0.00005727138,0.000068655085,0.00006604453,0.00014552107,0.000041233034,0.000029918025,0.00006499214,0.00006334458,0.000090660316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099201325,0.00028549397,0.00021837298,0.00003066168,0.000029632567,0.000008522117,0.0008498561,0.00035937002,0.016318316,0.76856947,0.018638628,0.19468176],"study_design_scores_gemma":[0.0035458768,0.004167876,0.10539529,0.0008205381,0.00014204533,0.00026430332,0.0014049885,0.021878975,0.11111357,0.41409376,0.33489615,0.0022766544],"about_ca_topic_score_codex":0.000024264926,"about_ca_topic_score_gemma":2.6367175e-7,"teacher_disagreement_score":0.50131595,"about_ca_system_score_codex":0.000006421884,"about_ca_system_score_gemma":0.000018072453,"threshold_uncertainty_score":0.2799673},"labels":[],"label_agreement":null},{"id":"W2025639547","doi":"10.1016/j.tcs.2006.05.034","title":"Progressive solutions to a parallel automata equation","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Component (thermodynamics); Automaton; Block (permutation group theory); Mathematics; Action (physics); Cellular automaton; Computer science; Algorithm; Applied mathematics; Theoretical computer science; Combinatorics; Physics; Thermodynamics","score_opus":0.015572417817744736,"score_gpt":0.25212270200388376,"score_spread":0.23655028418613902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025639547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015780475,0.00003442011,0.9756262,0.0034105198,0.00044252395,0.0002915042,0.000002134227,0.00067237526,0.0037398671],"genre_scores_gemma":[0.6704886,3.1587322e-7,0.3288004,0.0005216739,0.00014197276,0.000024173583,0.0000014811919,0.000005790874,0.00001557577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972091,0.00010040722,0.00030134423,0.0007924669,0.00078630913,0.00081042154],"domain_scores_gemma":[0.9982631,0.00018972746,0.00007334132,0.0010235664,0.00018569616,0.00026456962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014317344,0.00018992822,0.00017753473,0.0002485072,0.0006491585,0.00073044165,0.0027040746,0.000047398036,0.000034877994],"category_scores_gemma":[0.000073866395,0.00015720639,0.00006343817,0.0016249197,0.0012931392,0.0008720757,0.0015218197,0.00012505068,0.00036925336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035506143,0.000088976194,0.00001098255,0.000002521781,0.0000015103012,0.000016839535,0.00014929728,0.001188303,0.00055328093,0.97291327,0.00040963796,0.024661813],"study_design_scores_gemma":[0.00014167874,0.00011366201,0.0012713526,0.000020215679,0.0000021486385,0.000041467963,0.0000025573624,0.602191,0.00076334685,0.39512876,0.00014705889,0.00017679327],"about_ca_topic_score_codex":0.000010895599,"about_ca_topic_score_gemma":6.684763e-7,"teacher_disagreement_score":0.65470815,"about_ca_system_score_codex":0.000085491585,"about_ca_system_score_gemma":0.00013845076,"threshold_uncertainty_score":0.70436656},"labels":[],"label_agreement":null},{"id":"W2025689196","doi":"10.1142/s0129054105003352","title":"NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Acadia University","funders":"","keywords":"Unary operation; Nondeterministic algorithm; RADIUS; Mathematics; Uniqueness; Regular language; Diophantine equation; Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Theoretical computer science; Automaton; Artificial intelligence","score_opus":0.009417357858932295,"score_gpt":0.28444976987275594,"score_spread":0.27503241201382367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025689196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39574277,0.000066149725,0.6019495,0.001303026,0.0006797813,0.00003059498,0.0000013735757,0.000007636864,0.00021912798],"genre_scores_gemma":[0.79416525,0.00003398503,0.20549098,0.00014162155,0.0001567918,4.6707956e-7,3.2712268e-7,0.0000024347323,0.000008124654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838006,0.000026876978,0.00055849424,0.00016877179,0.0007419979,0.00012377316],"domain_scores_gemma":[0.9979014,0.00015360353,0.0005903274,0.00025918207,0.001011151,0.0000843788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092186616,0.000085939406,0.00017758503,0.0005989269,0.00007415248,0.00016788334,0.0023589795,0.000023207795,0.000009234563],"category_scores_gemma":[0.000048053284,0.00007509118,0.000072774565,0.00043948213,0.00045306564,0.0021556155,0.00039932216,0.000092926166,0.0000024593755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030849314,0.0004331762,0.003629134,0.000018169398,0.00011495071,0.000025574831,0.0024638567,0.008119054,0.041971497,0.28309515,0.00034812128,0.65975046],"study_design_scores_gemma":[0.0017307727,0.0005894617,0.11061036,0.00046915686,0.00002426619,0.0017107793,0.000062610015,0.7276304,0.104083896,0.049711075,0.002981706,0.0003955156],"about_ca_topic_score_codex":0.0000097818565,"about_ca_topic_score_gemma":0.0000014976335,"teacher_disagreement_score":0.71951133,"about_ca_system_score_codex":0.000057848403,"about_ca_system_score_gemma":0.0003124852,"threshold_uncertainty_score":0.43836102},"labels":[],"label_agreement":null},{"id":"W2026211688","doi":"10.1007/s000120200005","title":"Solid varieties of arbitrary type","year":2002,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Arity; Variety (cybernetics); Idempotence; Type (biology); Pure mathematics; Normalization (sociology); Nilpotent; Algebra over a field; Discrete mathematics","score_opus":0.014085530876595632,"score_gpt":0.21931905253514666,"score_spread":0.20523352165855102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026211688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62493294,0.0031584082,0.116582446,0.00405979,0.00209827,0.00034154704,0.000021880465,0.0014710731,0.24733365],"genre_scores_gemma":[0.9933169,0.00008998903,0.004935791,0.00038286395,0.00003052387,3.6115262e-7,0.0000018671138,0.000007134862,0.0012345591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993807,0.000035255,0.00011261565,0.00017260671,0.00014305126,0.00015575199],"domain_scores_gemma":[0.99935055,0.00006737507,0.00006047097,0.00042230982,0.000049697588,0.000049620037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007438585,0.00008345212,0.00012222731,0.00008690496,0.000047226986,0.000029938275,0.0006291838,0.00004592284,0.00037430596],"category_scores_gemma":[0.000014813151,0.00008005347,0.00004980676,0.00036277514,0.00007532948,0.00045283083,0.00014773308,0.00006834012,0.000096277065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028060144,0.000049177732,0.00008547411,0.000008659109,0.000027692347,0.000026564656,0.0015932745,0.000007318532,0.001308997,0.98227876,0.009125769,0.0054854844],"study_design_scores_gemma":[0.0023270722,0.001140131,0.0043791533,0.00015195309,0.00010756272,0.0001430275,0.0017912308,0.18104228,0.106510736,0.55138785,0.14926285,0.001756179],"about_ca_topic_score_codex":0.000040251536,"about_ca_topic_score_gemma":0.0000014395808,"teacher_disagreement_score":0.43089095,"about_ca_system_score_codex":0.000012512467,"about_ca_system_score_gemma":0.000015893593,"threshold_uncertainty_score":0.40983877},"labels":[],"label_agreement":null},{"id":"W2026951311","doi":"10.1016/j.tcs.2009.02.024","title":"Decimations of languages and state complexity","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Context-free language; Context (archaeology); Transformation (genetics); Mathematics; State (computer science); Regular language; Arithmetic; Combinatorics; Upper and lower bounds; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Algorithm; Theoretical computer science; Rule-based machine translation","score_opus":0.01166234300292262,"score_gpt":0.2812288733793871,"score_spread":0.2695665303764645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026951311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20639803,0.000043833246,0.7904781,0.0008841127,0.000059652368,0.000059179027,0.0000019005018,0.000104915256,0.0019702544],"genre_scores_gemma":[0.79670894,0.000004048054,0.20285113,0.0004157734,0.000015132273,5.034241e-7,2.6424502e-7,0.0000015225922,0.0000026652442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882704,0.000053481024,0.00018869215,0.00033194487,0.00033081498,0.00026805434],"domain_scores_gemma":[0.99907124,0.00015989285,0.000055728848,0.0004888224,0.00008930593,0.00013501619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079301914,0.00009572164,0.00015111372,0.000118539596,0.00017509285,0.00016897754,0.0011304802,0.000017304848,0.00001308124],"category_scores_gemma":[0.000046360346,0.000075422526,0.000027321139,0.00057089,0.0021646174,0.00046798695,0.00038491457,0.00007440976,0.000008315677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015956474,0.000029671452,0.000024444884,0.0000024638518,9.4680087e-7,0.000002636519,0.00040848684,0.000015646741,0.0013451236,0.90239197,0.0000116115325,0.09576538],"study_design_scores_gemma":[0.000103317936,0.00013156867,0.014078431,0.000015981586,0.0000014240602,0.000023245126,0.0000073045885,0.2761584,0.0060887,0.7032858,0.0000113091455,0.00009452967],"about_ca_topic_score_codex":0.0000025060115,"about_ca_topic_score_gemma":2.63461e-7,"teacher_disagreement_score":0.59031093,"about_ca_system_score_codex":0.000011600851,"about_ca_system_score_gemma":0.00003796341,"threshold_uncertainty_score":0.7975623},"labels":[],"label_agreement":null},{"id":"W2027264688","doi":"10.1145/2213977.2213998","title":"Short proofs for the determinant identities","year":2012,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Mathematical proof; Polynomial; Combinatorics; Degree (music); Diagonal; Proof complexity; Corollary; Identity (music); Finite field; Discrete mathematics; Arithmetic; Identity matrix; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.027559932434384985,"score_gpt":0.2718317100569432,"score_spread":0.2442717776225582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027264688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022872841,0.00055238267,0.97208357,0.00042568753,0.00077772327,0.00022595121,8.6233155e-7,0.00014765945,0.0029133041],"genre_scores_gemma":[0.9868079,0.0000070912865,0.009695312,0.00037993953,0.00015461557,0.000064096435,2.7347625e-7,0.000003932974,0.0028868348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952734,0.000010205371,0.000077153214,0.000084495245,0.00008628233,0.00021451582],"domain_scores_gemma":[0.9994671,0.00016161619,0.000012769768,0.00031053205,0.000016187416,0.000031827378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036331013,0.000052316904,0.00004972591,0.000015842968,0.00012154635,0.0001088753,0.0005428755,0.00001576593,0.00001526298],"category_scores_gemma":[0.000013936354,0.00002739579,0.0000452879,0.000051053095,0.000025376548,0.00050033495,0.00013746746,0.000023977826,0.000028408504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013417609,0.00003016931,0.0013977552,0.000010215446,0.000010820627,5.8168524e-7,0.0007136046,0.0000013133299,0.0003223447,0.68922794,0.008112758,0.30017117],"study_design_scores_gemma":[0.0006874519,0.00025491108,0.13396458,0.000056473928,0.000080345664,0.00031585226,0.0015006781,0.28718728,0.12458033,0.16920781,0.280872,0.0012922945],"about_ca_topic_score_codex":0.0000031327647,"about_ca_topic_score_gemma":0.0000017514931,"teacher_disagreement_score":0.9639351,"about_ca_system_score_codex":0.0000067147867,"about_ca_system_score_gemma":0.0000069359985,"threshold_uncertainty_score":0.111716785},"labels":[],"label_agreement":null},{"id":"W2028475750","doi":"10.1016/j.tcs.2012.04.002","title":"One-reversal counter machines and multihead automata: Revisited","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Google (Canada)","funders":"","keywords":"Pushdown automaton; Deterministic pushdown automaton; Deterministic context-free grammar; Computer science; Nested word; Finite-state machine; Embedded pushdown automaton; Deterministic finite automaton; Counterexample; Theoretical computer science; Automaton; Algorithm; Discrete mathematics; Automata theory; Mathematics; Quantum finite automata; Programming language; Nondeterministic finite automaton; Parsing; Context-free grammar","score_opus":0.011368968874612733,"score_gpt":0.2533445139941322,"score_spread":0.2419755451195195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028475750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123787545,0.0003497544,0.8712418,0.0010936658,0.00083950994,0.00017894365,0.000003895723,0.0005233115,0.0019815809],"genre_scores_gemma":[0.86952263,0.000018285444,0.12879914,0.0013547807,0.00027888673,0.0000046144305,0.0000010671461,0.000009972935,0.000010627482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974232,0.00013921689,0.00028488733,0.0006411425,0.0006620061,0.0008495742],"domain_scores_gemma":[0.9981168,0.00031328024,0.00007423782,0.0009149391,0.00010366765,0.00047706865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022578128,0.00022924082,0.00027325883,0.00018117973,0.00040327138,0.0005623359,0.0017933283,0.0000649301,0.000046931047],"category_scores_gemma":[0.00009083032,0.00018829304,0.000055565997,0.000765424,0.0021753733,0.0019754502,0.0016014775,0.00020623897,0.00013812781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052434057,0.00008740765,0.00052926433,0.000013165273,0.000005093814,0.0000030484302,0.00054590555,0.0000022872482,0.000997527,0.9257851,0.00013645928,0.07188948],"study_design_scores_gemma":[0.0005075761,0.00014445014,0.019741738,0.0000870498,0.000012980641,0.00013437055,0.0000073050755,0.9189241,0.00181479,0.05732867,0.00081120705,0.00048579276],"about_ca_topic_score_codex":0.0000052980085,"about_ca_topic_score_gemma":1.6368239e-7,"teacher_disagreement_score":0.91892177,"about_ca_system_score_codex":0.00004543667,"about_ca_system_score_gemma":0.000041590243,"threshold_uncertainty_score":0.8015253},"labels":[],"label_agreement":null},{"id":"W2029049420","doi":"10.1007/s00493-003-0034-z","title":"The Fixing Block Method in Combinatorics on Words","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Combinatorics on words; Algebraic combinatorics; Discrete mathematics; Word (group theory); Geometry","score_opus":0.010670412091314195,"score_gpt":0.25678029379713985,"score_spread":0.24610988170582565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029049420","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18760014,0.009217522,0.3099651,0.011842103,0.024787733,0.0022286652,0.000003862938,0.0024930458,0.45186183],"genre_scores_gemma":[0.9963992,0.000060481787,0.0023977265,0.00034144393,0.000014154847,0.000030703966,2.5751845e-7,0.000015893007,0.0007400927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980888,0.00042551212,0.00027633397,0.00039554675,0.0003450864,0.00046875427],"domain_scores_gemma":[0.99764395,0.0011643538,0.00009542445,0.00095241563,0.000045967176,0.00009790464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014564932,0.00018373087,0.00020037501,0.000112617185,0.00033639217,0.00020781526,0.001242652,0.00008091307,0.000004801991],"category_scores_gemma":[0.00033211737,0.00013582617,0.000073252166,0.0011656139,0.000035785335,0.00016701226,0.00017630469,0.00034485688,0.00006479686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022678098,0.00013349814,0.00038502362,0.000003237431,0.0000056006047,0.000021120462,0.00022203533,0.000025369125,0.00003240023,0.99120915,0.0013872558,0.006573059],"study_design_scores_gemma":[0.0008227819,0.00015402255,0.0012750978,0.000032568707,0.0000034117504,0.000021495876,0.00009340549,0.006852446,0.0031136726,0.8901946,0.09712864,0.00030785886],"about_ca_topic_score_codex":0.000008315211,"about_ca_topic_score_gemma":0.0000010861187,"teacher_disagreement_score":0.8087991,"about_ca_system_score_codex":0.0001560271,"about_ca_system_score_gemma":0.00006713246,"threshold_uncertainty_score":0.553883},"labels":[],"label_agreement":null},{"id":"W2029413222","doi":"10.1016/j.tcs.2003.10.010","title":"From cascade decompositions to bit-vector algorithms","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Algorithm; Automaton; Cascade; Mathematics; Computation; Bit array; Bounded function; Computer science; Theoretical computer science; Type (biology)","score_opus":0.008736864146077434,"score_gpt":0.25412173965813795,"score_spread":0.2453848755120605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029413222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06665913,0.000032525615,0.9270729,0.0015474216,0.0012123906,0.00016913001,0.000007876346,0.00035813233,0.002940527],"genre_scores_gemma":[0.6044055,9.816744e-7,0.39388463,0.0015444453,0.00013852959,0.00000862472,8.148078e-7,0.0000077230015,0.000008709451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705774,0.00018496905,0.0002999785,0.0010064333,0.00069546583,0.0007554468],"domain_scores_gemma":[0.9975503,0.00042712208,0.000049728293,0.0012039084,0.00013241709,0.0006365112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011183461,0.0002369235,0.0002422832,0.00023234184,0.00054611027,0.0007171903,0.0028792303,0.000060289767,0.00017083711],"category_scores_gemma":[0.000117430776,0.0001990617,0.000088118075,0.0017036421,0.0010715182,0.0006731192,0.00080680015,0.00020118264,0.00058676227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018301803,0.000065654844,0.0000077871355,0.0000010474611,0.000004357768,0.000021891145,0.000606858,0.00009860751,0.0051736403,0.97867495,0.00021148422,0.015131875],"study_design_scores_gemma":[0.00026907632,0.00022151067,0.000823294,0.000041164465,0.0000071828167,0.00009575277,0.000021063322,0.37198964,0.059559096,0.56522137,0.0012386753,0.00051220594],"about_ca_topic_score_codex":0.000015224838,"about_ca_topic_score_gemma":7.831805e-7,"teacher_disagreement_score":0.5377464,"about_ca_system_score_codex":0.00008768708,"about_ca_system_score_gemma":0.00013918964,"threshold_uncertainty_score":0.81175005},"labels":[],"label_agreement":null},{"id":"W2029618677","doi":"10.4204/eptcs.31.8","title":"State Complexity of Catenation Combined with Star and Reversal","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Combined operations; State (computer science); Continuation; Star (game theory); Computer science; Algorithm; Mathematics; Political science; Chemistry; Programming language; Law","score_opus":0.005197979451632736,"score_gpt":0.21173049403493127,"score_spread":0.20653251458329855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029618677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85664177,0.000013903303,0.14167838,0.0008136101,0.00009722924,0.00018775943,7.135545e-7,0.00009448456,0.0004721262],"genre_scores_gemma":[0.94130033,0.000005915893,0.058537673,0.00012179972,0.000018479295,0.000006138125,3.50797e-7,0.0000067568653,0.000002545519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979643,0.000017206672,0.00025938565,0.0006052356,0.0005085904,0.0006452794],"domain_scores_gemma":[0.9991655,0.00009110605,0.0001220896,0.00025582392,0.00023320792,0.00013227902],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018636846,0.00016590873,0.0002262254,0.00023972426,0.00015232242,0.00021001087,0.0013732836,0.000043565982,0.0000068468153],"category_scores_gemma":[0.00006934484,0.00012718767,0.000020073165,0.0011682835,0.0037350617,0.0009086076,0.00051036687,0.00045353192,0.000001642722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003739704,0.000057504512,0.0005316274,0.000014708739,0.0000029257483,0.0000017297082,0.00061026576,0.0000029310554,0.011220737,0.9823444,0.0000041277176,0.0051716696],"study_design_scores_gemma":[0.00050122174,0.0007566999,0.0071442304,0.000029490016,0.0000023996297,0.00005288274,0.00001200992,0.31974393,0.024771625,0.64678586,0.000015528887,0.0001841356],"about_ca_topic_score_codex":0.000010147692,"about_ca_topic_score_gemma":0.000011804051,"teacher_disagreement_score":0.33555853,"about_ca_system_score_codex":0.00006354681,"about_ca_system_score_gemma":0.00020754438,"threshold_uncertainty_score":0.99897623},"labels":[],"label_agreement":null},{"id":"W2030468605","doi":"10.4153/cmb-2011-168-5","title":"The Smallest Pisot Element in the Field of Formal Power Series Over a Finite Field","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Finite field; Field (mathematics); Formal power series; Power series; Laurent series; Degree (music); Element (criminal law); Combinatorics; Polynomial; Minimal polynomial (linear algebra); Series (stratigraphy); Discrete mathematics; Finite set; Sequence (biology); Pure mathematics; Matrix polynomial; Mathematical analysis; Homogeneous polynomial","score_opus":0.01127131150733368,"score_gpt":0.21334530479339608,"score_spread":0.2020739932860624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030468605","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28276062,0.0006150933,0.13299666,0.1552992,0.00071034563,0.0018096119,0.0000285389,0.00013640468,0.42564353],"genre_scores_gemma":[0.9902163,0.000008074113,0.0024707704,0.0068343505,0.000016391763,0.00003323658,4.116028e-7,0.0000056772997,0.0004147499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896437,0.00006637104,0.00028091503,0.00013801131,0.00016459293,0.00038573117],"domain_scores_gemma":[0.99807346,0.0011848112,0.00005657042,0.00055638776,0.000022091512,0.000106685824],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000744959,0.00010503503,0.0001272289,0.000052983934,0.00012578796,0.00007308138,0.001051431,0.00005917357,0.0034168882],"category_scores_gemma":[0.00040562666,0.000060123257,0.00006136814,0.0001322506,0.00006449215,0.000061184495,0.00010766953,0.00015496215,0.00026016505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008880105,0.000029441631,0.000120038974,0.000017214412,0.0000082670895,0.00003348012,0.003280127,5.504565e-7,0.0000040557015,0.9746387,0.019385427,0.0024737993],"study_design_scores_gemma":[0.0008195146,0.0011357351,0.006308028,0.00031410516,0.00002180813,0.00009857521,0.0040660873,0.0039552376,0.0022936764,0.63956004,0.34070703,0.0007201248],"about_ca_topic_score_codex":0.0013569861,"about_ca_topic_score_gemma":0.0039265323,"teacher_disagreement_score":0.70745575,"about_ca_system_score_codex":0.000018742301,"about_ca_system_score_gemma":0.000076022116,"threshold_uncertainty_score":0.9974941},"labels":[],"label_agreement":null},{"id":"W2030592198","doi":"10.4153/cmb-2001-011-9","title":"Some Semigroup Laws in Groups","year":2001,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Semigroup; Cancellative semigroup; Commutative property; Simple (philosophy); Pure mathematics; Group (periodic table); Law; Discrete mathematics; Political science","score_opus":0.00979554580465301,"score_gpt":0.20501031271253842,"score_spread":0.19521476690788542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030592198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6998896,0.0014389916,0.07990205,0.07409014,0.00076926954,0.00104207,0.000018673087,0.00085220416,0.14199702],"genre_scores_gemma":[0.9822262,0.00003777754,0.007795565,0.006734717,0.00020770694,0.000048734903,0.000004422436,0.000029766972,0.0029151333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830204,0.00007386995,0.00032915772,0.00038535756,0.00020967278,0.00069989334],"domain_scores_gemma":[0.9985106,0.00021364188,0.0000423423,0.0006444763,0.000021107655,0.00056785747],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005548938,0.00018520564,0.00025930844,0.00024440276,0.00008660598,0.00015845858,0.0009723396,0.00011765296,0.00310732],"category_scores_gemma":[0.00015397262,0.00017378264,0.000072893214,0.0003718378,0.00006943191,0.00016302054,0.00010926951,0.00021793641,0.01287417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001333318,0.000043084572,0.00014335748,0.000018576573,0.000004299656,0.0004460922,0.00027054595,0.0000052375844,0.00004072447,0.9854753,0.0099608535,0.0035905987],"study_design_scores_gemma":[0.0004601614,0.0000425639,0.0011390558,0.00013645427,0.0000043343407,0.00025578798,0.000112048845,0.011559698,0.00007700561,0.8013336,0.1843955,0.0004837461],"about_ca_topic_score_codex":0.0010530878,"about_ca_topic_score_gemma":0.0018196837,"teacher_disagreement_score":0.2823366,"about_ca_system_score_codex":0.00017811291,"about_ca_system_score_gemma":0.0001095345,"threshold_uncertainty_score":0.997804},"labels":[],"label_agreement":null},{"id":"W2031779562","doi":"10.1142/s0218196710005686","title":"WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Operand; Iterated function; Bracketing (phenomenology); Product (mathematics); Block (permutation group theory); Wreath product; Discrete mathematics; Order (exchange); Bounded function; Arithmetic; Combinatorics","score_opus":0.0204166035587952,"score_gpt":0.28292010656889227,"score_spread":0.26250350301009706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031779562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7756835,0.00011498932,0.21807027,0.005593717,0.00033245236,0.00009564195,0.0000025966306,0.000021709538,0.00008509436],"genre_scores_gemma":[0.9605591,0.000019503703,0.03861538,0.0005842254,0.00020225189,0.0000026302525,0.000002525391,0.000003314413,0.000011048908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993277,0.000025564004,0.00022185348,0.00015915312,0.00019413968,0.000071590635],"domain_scores_gemma":[0.99920356,0.00007543722,0.00015292231,0.000067103494,0.00041157144,0.0000893972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023194162,0.00007513103,0.000098835524,0.00015260545,0.00006776869,0.00028299313,0.00023945622,0.000027515207,0.0000025337604],"category_scores_gemma":[0.00003700848,0.00006422617,0.000014113003,0.00011850657,0.00005956888,0.00036292884,0.00012396742,0.00012343787,0.0000024042592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045390334,0.00014479856,0.0015983434,0.000019711633,0.00009204198,0.00002641238,0.001396301,0.00018049746,0.038971823,0.6154293,0.00047254053,0.34162286],"study_design_scores_gemma":[0.0015391754,0.0004804037,0.19181672,0.00009990349,0.000031184874,0.003876461,0.00015987219,0.088499926,0.0051301634,0.70050246,0.0074053057,0.000458402],"about_ca_topic_score_codex":0.0000047920157,"about_ca_topic_score_gemma":0.0000031774978,"teacher_disagreement_score":0.34116447,"about_ca_system_score_codex":0.000008087809,"about_ca_system_score_gemma":0.000027869597,"threshold_uncertainty_score":0.27289093},"labels":[],"label_agreement":null},{"id":"W2032099069","doi":"10.1016/j.tcs.2007.10.032","title":"Shuffle operations on discrete paths","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematics; Algorithm; Theoretical computer science; Combinatorics","score_opus":0.008344515457987482,"score_gpt":0.26066202948367323,"score_spread":0.25231751402568575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032099069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07134015,0.00000997094,0.9158853,0.0011233758,0.00072487164,0.00012274216,0.0000013953544,0.00033064923,0.010461534],"genre_scores_gemma":[0.8802437,0.0000015043672,0.117572024,0.0019737524,0.00017186046,0.0000030865617,7.0917235e-7,0.0000072611924,0.000026108311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974995,0.000064362204,0.0002778908,0.00072438456,0.0007307305,0.00070309464],"domain_scores_gemma":[0.9981165,0.00033251697,0.00003138221,0.0010683378,0.00011007849,0.00034117937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027408735,0.00018396298,0.00016052907,0.00021325283,0.0006197656,0.00057512004,0.002682504,0.00004827473,0.000055167537],"category_scores_gemma":[0.00008739924,0.00013851687,0.000067692876,0.0011067895,0.0017302976,0.00071646046,0.0008437128,0.00020935904,0.0002456009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045102424,0.0000481573,0.000012061759,0.0000010668159,0.0000015684931,0.000020849544,0.00029176142,0.00025184333,0.0010128707,0.9434442,0.00004341518,0.05486773],"study_design_scores_gemma":[0.00023440087,0.00038510276,0.0024782603,0.000034551267,0.0000027120532,0.00004557413,0.000015501926,0.76290476,0.02448308,0.20869102,0.0003649761,0.0003600569],"about_ca_topic_score_codex":0.0000033717458,"about_ca_topic_score_gemma":9.1495474e-7,"teacher_disagreement_score":0.8089035,"about_ca_system_score_codex":0.00006232165,"about_ca_system_score_gemma":0.00008384293,"threshold_uncertainty_score":0.63753533},"labels":[],"label_agreement":null},{"id":"W2032976034","doi":"10.1007/s00224-010-9302-7","title":"On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isomorphism (crystallography); Equivalence (formal languages); Mathematics; Complexity class; Expression (computer science); Class (philosophy); Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Time complexity; Computer science; Crystal structure; Crystallography","score_opus":0.02611519222703439,"score_gpt":0.24483667776386567,"score_spread":0.21872148553683127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032976034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83550316,0.00008902168,0.16213939,0.000058514015,0.00031789212,0.00025259584,0.000012900376,0.000036945967,0.0015895795],"genre_scores_gemma":[0.99772024,0.0000017239937,0.0021823603,0.000036142443,0.000033204073,0.0000017885386,8.349019e-7,0.000007551663,0.000016155675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984314,0.00042658884,0.00043074889,0.00023436817,0.00030172872,0.00017519058],"domain_scores_gemma":[0.9961195,0.0024708589,0.00061523,0.0005902889,0.00016221254,0.000041920393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020994756,0.00014062408,0.00036000556,0.00007692471,0.00011370328,0.00002322398,0.0007947605,0.00006100388,0.0000051284555],"category_scores_gemma":[0.00015542805,0.00009292871,0.00006864349,0.00014081229,0.0007059678,0.00011624164,0.00037529864,0.0001835003,0.0000014450193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002675638,0.00005023857,0.00004978733,0.00008507204,0.000015679314,7.723444e-7,0.003216624,0.000055413304,0.15181714,0.8433841,0.000018260838,0.0012801861],"study_design_scores_gemma":[0.0006827368,0.0005443803,0.010924595,0.002288007,0.000020501026,0.000059234928,0.0012850957,0.087690726,0.52888876,0.36731133,0.000009287915,0.00029535088],"about_ca_topic_score_codex":0.000027579494,"about_ca_topic_score_gemma":3.717084e-7,"teacher_disagreement_score":0.47607276,"about_ca_system_score_codex":0.000008092299,"about_ca_system_score_gemma":0.000028323835,"threshold_uncertainty_score":0.3789523},"labels":[],"label_agreement":null},{"id":"W2033362178","doi":"10.1007/s00605-014-0721-4","title":"Acyclic, connected and tree sets","year":2014,"lang":"de","type":"article","venue":"Monatshefte für Mathematik","topic":"semigroups and automata theory","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Word (group theory); Alphabet; Extension (predicate logic); Discrete mathematics; Tree (set theory); Graph; Directed acyclic graph; Set (abstract data type); Computer science","score_opus":0.011750389798368873,"score_gpt":0.24962506048315322,"score_spread":0.23787467068478435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033362178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5926505,0.023668358,0.32125857,0.010496751,0.005247765,0.0018487802,0.00010755455,0.002500888,0.042220846],"genre_scores_gemma":[0.97403914,0.00050536636,0.02111167,0.0016808298,0.0005009941,0.000046626577,0.00002363895,0.00009850398,0.001993232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965859,0.0003326373,0.0007061632,0.0010191497,0.00056961726,0.0007865537],"domain_scores_gemma":[0.9967486,0.0009486159,0.000390283,0.0014502929,0.00010594201,0.0003562418],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009305643,0.00057303044,0.0007488887,0.00021678359,0.0003356208,0.0006342402,0.0012646433,0.00027357927,0.0002676099],"category_scores_gemma":[0.0003802663,0.00051648,0.0001739364,0.00043038072,0.00025605524,0.00055755937,0.0008417828,0.0003714219,0.0014652878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029930949,0.00041908113,0.00025895363,0.00057747087,0.0002368558,0.000073439995,0.0065971757,0.000015370362,0.002830313,0.53399825,0.017674496,0.43728864],"study_design_scores_gemma":[0.0018577017,0.0003383873,0.0064601335,0.0005464586,0.00016152477,0.00013657896,0.00019928272,0.5721883,0.0029756213,0.34398362,0.06982147,0.001330893],"about_ca_topic_score_codex":0.000031248637,"about_ca_topic_score_gemma":0.000008487086,"teacher_disagreement_score":0.57217294,"about_ca_system_score_codex":0.000046795216,"about_ca_system_score_gemma":0.000048125235,"threshold_uncertainty_score":0.9997287},"labels":[],"label_agreement":null},{"id":"W2033885916","doi":"10.1142/s0218196704001992","title":"PROFINITE TOPOLOGIES IN FREE PRODUCTS OF GROUPS","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Profinite group; Free product; Separable space; Quotient; Finitely-generated abelian group; Combinatorics; Topological group; Normal subgroup; Class (philosophy); Product (mathematics); Group (periodic table); Discrete mathematics; Pure mathematics; Topology (electrical circuits); Computer science","score_opus":0.011986014680431324,"score_gpt":0.2587075825680769,"score_spread":0.2467215678876456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033885916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7408437,0.00045927172,0.25204524,0.0058227736,0.00069498114,0.000037195678,9.786546e-7,0.000010630716,0.0000852279],"genre_scores_gemma":[0.97190416,0.000054771535,0.027825154,0.00011830642,0.000088682136,6.325883e-7,9.189167e-7,0.000002332766,0.0000050448743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992488,0.000029103725,0.00031080164,0.000089734465,0.00025541265,0.00006617194],"domain_scores_gemma":[0.99931556,0.000063086736,0.00025567214,0.00007218107,0.000273446,0.000020064466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028354538,0.00005444633,0.00010577539,0.00022369549,0.000011712843,0.000049840182,0.00046547086,0.000025069323,0.0000013742156],"category_scores_gemma":[0.000102813254,0.000046842604,0.00002788535,0.00013975166,0.00004442855,0.00059519307,0.00011082758,0.00007906512,8.011204e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005786601,0.00022746723,0.0019019581,0.00002539571,0.000063370164,0.00012011193,0.0025348354,0.0055659097,0.0025302712,0.86466193,0.00015130642,0.12215959],"study_design_scores_gemma":[0.0013046403,0.00021209946,0.03409672,0.00014830274,0.0000036983572,0.00031343766,0.00017514486,0.002874677,0.007819365,0.95292205,0.000050968625,0.00007890526],"about_ca_topic_score_codex":0.000015966907,"about_ca_topic_score_gemma":0.0000027119454,"teacher_disagreement_score":0.23106048,"about_ca_system_score_codex":0.000031347256,"about_ca_system_score_gemma":0.00006580126,"threshold_uncertainty_score":0.1910186},"labels":[],"label_agreement":null},{"id":"W2034376971","doi":"10.1142/s0218196706002998","title":"SUBVARIETIES OF THE VARIETY GENERATED BY THE FIVE-ELEMENT BRANDT SEMIGROUP","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subvariety; Mathematics; Semigroup; Variety (cybernetics); Element (criminal law); Pure mathematics; Set (abstract data type); Algebra over a field; Discrete mathematics; Computer science; Statistics","score_opus":0.004614855934500324,"score_gpt":0.21672886526042498,"score_spread":0.21211400932592467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034376971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6080452,0.000493778,0.38744456,0.003163848,0.00063620793,0.00005072243,0.000005240814,0.000009298306,0.00015111834],"genre_scores_gemma":[0.99766755,0.000027903086,0.0016632276,0.0004045792,0.00014027349,9.916298e-7,0.000004544648,0.000003504272,0.000087399254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890625,0.00009479594,0.00036961975,0.00008977067,0.00046360388,0.000075973396],"domain_scores_gemma":[0.99899304,0.00014499911,0.00041395408,0.00008938665,0.00033966717,0.000018959658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003754261,0.00007721133,0.0000991179,0.000046592137,0.00008748824,0.0001612061,0.00064631295,0.000027465085,0.00000685281],"category_scores_gemma":[0.000015709875,0.00004371741,0.000076033386,0.00012269558,0.0000721013,0.00028330216,0.000120181925,0.000102720034,6.269218e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015888944,0.0005254154,0.0088918125,0.000027028644,0.00060200365,0.000022250846,0.0047015697,0.030115858,0.03291823,0.71811134,0.059061818,0.14486378],"study_design_scores_gemma":[0.0032388987,0.00036093057,0.10618634,0.00018029356,0.00007949906,0.00071852334,0.0005146829,0.44575453,0.058078196,0.37750253,0.0069923652,0.0003932163],"about_ca_topic_score_codex":0.00007129233,"about_ca_topic_score_gemma":0.0000050708963,"teacher_disagreement_score":0.41563866,"about_ca_system_score_codex":0.000025996065,"about_ca_system_score_gemma":0.000044968427,"threshold_uncertainty_score":0.17827442},"labels":[],"label_agreement":null},{"id":"W2034920294","doi":"10.1016/j.jcss.2005.08.003","title":"The many faces of a translation","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Translation (biology); Computer science; Artificial intelligence; Chemistry","score_opus":0.016951275936972193,"score_gpt":0.24134541833644,"score_spread":0.2243941423994678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034920294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23479119,0.0039670216,0.7581116,0.0016397631,0.0005652769,0.00005161119,3.2288207e-7,0.00001542846,0.0008577895],"genre_scores_gemma":[0.9640056,0.00004961408,0.03574709,0.000031572454,0.00015569731,2.3720105e-7,8.806892e-9,9.515811e-7,0.000009244797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903244,0.000086150016,0.00036310696,0.000084672436,0.0003310674,0.00010257652],"domain_scores_gemma":[0.99926156,0.00023476423,0.00029897568,0.0000966534,0.00006870492,0.000039317132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017088683,0.0000539864,0.0001401146,0.00007828042,0.00019675447,0.00022438205,0.0006984555,0.00001626261,4.7917706e-7],"category_scores_gemma":[0.0000028302973,0.00002749415,0.000055294062,0.00018590776,0.0001233005,0.0005811664,0.00004355754,0.00004609579,9.1235574e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067507212,0.000023140896,0.00059569464,0.000036774898,0.00002158736,0.000004451954,0.0025842744,0.001364373,0.00051409536,0.18962346,0.00040050244,0.8048249],"study_design_scores_gemma":[0.00038446835,0.00043337184,0.005457585,0.00023812683,0.000009296696,0.0006737324,0.0007265724,0.9827002,0.0011421194,0.0023795157,0.005741257,0.00011369819],"about_ca_topic_score_codex":0.0000019305282,"about_ca_topic_score_gemma":0.0000011332912,"teacher_disagreement_score":0.9813359,"about_ca_system_score_codex":0.0000075472904,"about_ca_system_score_gemma":0.000039782233,"threshold_uncertainty_score":0.21637213},"labels":[],"label_agreement":null},{"id":"W2035311548","doi":"10.1007/978-3-642-14455-4_38","title":"The Averaging Trick and the Černý Conjecture","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Conjecture; Artificial intelligence; Discrete mathematics; Mathematics","score_opus":0.006640741697130185,"score_gpt":0.20873273415921692,"score_spread":0.20209199246208673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035311548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017044641,0.0025321837,0.9850511,0.0070078387,0.002429937,0.00042045728,0.000002020959,0.00014080145,0.0022452234],"genre_scores_gemma":[0.7353433,0.0012737004,0.23910733,0.017997647,0.0030225497,0.000057734727,0.00000608813,0.00013925336,0.003052416],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702436,0.00008178972,0.00040254174,0.0010916102,0.00078262575,0.0006170592],"domain_scores_gemma":[0.99477214,0.0029597536,0.00028213018,0.0017583184,0.00010961196,0.00011801991],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002504603,0.00046408083,0.00042912798,0.00023849076,0.0011777412,0.0017077508,0.004687987,0.000286619,0.000008312414],"category_scores_gemma":[0.00018514409,0.0002363548,0.00013249471,0.00038967727,0.002954116,0.00034009205,0.0019753368,0.0016578771,0.000024034185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008889745,0.000004532661,0.000009461252,0.000009091184,0.000011126711,0.000030073164,0.0011670032,0.0004982986,0.00005607141,0.30318266,0.000022494301,0.6950003],"study_design_scores_gemma":[0.00060226733,0.000042913383,0.000065788365,0.00010966625,0.0000095886335,0.00024159744,4.4486384e-7,0.25944677,0.00044177592,0.7228123,0.015803296,0.0004235724],"about_ca_topic_score_codex":0.000022072021,"about_ca_topic_score_gemma":0.00006597314,"teacher_disagreement_score":0.7459438,"about_ca_system_score_codex":0.000068694506,"about_ca_system_score_gemma":0.00027496082,"threshold_uncertainty_score":0.99975926},"labels":[],"label_agreement":null},{"id":"W2036162092","doi":"10.1016/s0304-3975(00)00063-3","title":"Repetitions in Sturmian strings","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Fibonacci number; Sequence (biology); Prefix; Reduction (mathematics); String (physics); Combinatorics; Discrete mathematics; Simple (philosophy); Integer (computer science); Exponent; Algorithm; Computer science","score_opus":0.005278285371736694,"score_gpt":0.2255655579966955,"score_spread":0.2202872726249588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036162092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36520708,0.000028423674,0.60246193,0.002006044,0.00030608778,0.00015907468,0.0000014724952,0.00040024272,0.029429639],"genre_scores_gemma":[0.93607914,0.00000799625,0.062946886,0.0008467969,0.00006725506,0.000006165971,4.1647328e-7,0.0000051670268,0.000040171693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979266,0.00008363991,0.00025839725,0.00067770097,0.00048253228,0.00057115476],"domain_scores_gemma":[0.99868953,0.00015076259,0.000027697839,0.0008801266,0.000046909325,0.00020498667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012439043,0.00014276634,0.00015949423,0.00021023465,0.00025089318,0.00038917203,0.0024754866,0.000041118892,0.00039367753],"category_scores_gemma":[0.000030901232,0.000121733974,0.00004777043,0.0015977904,0.0014976886,0.00086212397,0.00044006042,0.00020186612,0.00030751043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021906314,0.000047431746,0.000043270273,0.0000014832035,6.289216e-7,0.00002290631,0.00023811651,0.00009909276,0.00012771769,0.83931863,0.000023448132,0.16007507],"study_design_scores_gemma":[0.00031843924,0.00011433127,0.010560203,0.00005631097,0.0000015365052,0.000080400576,0.00000820141,0.42752287,0.0015168036,0.5585725,0.0009395908,0.00030885663],"about_ca_topic_score_codex":0.000008418067,"about_ca_topic_score_gemma":0.0000018085777,"teacher_disagreement_score":0.57087207,"about_ca_system_score_codex":0.000059428177,"about_ca_system_score_gemma":0.0000818873,"threshold_uncertainty_score":0.5518296},"labels":[],"label_agreement":null},{"id":"W2036328331","doi":"10.1016/j.disc.2004.12.004","title":"Self-generating sets, integers with missing blocks, and substitutions","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Sequence (biology); Discrete mathematics; Integer sequence; Enumeration; Generating function; Computer science","score_opus":0.010716206607207889,"score_gpt":0.23314440528652391,"score_spread":0.222428198679316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036328331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14031477,0.00034807413,0.8539552,0.0011413663,0.00004433641,0.00013509214,0.0000033559575,0.00038745167,0.0036703453],"genre_scores_gemma":[0.3762154,0.000010477417,0.62351954,0.00013856914,0.000035958314,0.0000051934726,0.0000019876065,0.000008858896,0.00006400719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918836,0.000020619163,0.00019211574,0.00021765068,0.00016645077,0.0002147936],"domain_scores_gemma":[0.9993427,0.000089897214,0.00008599469,0.0003627052,0.00003001365,0.00008871146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022681821,0.00014184194,0.00014884006,0.000051045765,0.0002362084,0.00028346144,0.0002912073,0.00003601557,0.000008610849],"category_scores_gemma":[0.000024884732,0.00010333866,0.00002765291,0.00016386858,0.00006335569,0.0003631868,0.0001151893,0.00009618557,0.00001149766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027368444,0.00018616997,0.00017184232,0.00024543892,0.00010604819,0.00003197223,0.021775387,0.00081272476,0.0027067757,0.9272926,0.00052326976,0.046145026],"study_design_scores_gemma":[0.00021552264,0.000030947805,0.000022144652,0.00013602481,0.000024762257,0.00015653837,0.00048061172,0.98746264,0.0026008512,0.0071596093,0.0014628783,0.00024747907],"about_ca_topic_score_codex":0.0000024528515,"about_ca_topic_score_gemma":0.0000051659945,"teacher_disagreement_score":0.98664993,"about_ca_system_score_codex":0.000026930284,"about_ca_system_score_gemma":0.000037352016,"threshold_uncertainty_score":0.4214028},"labels":[],"label_agreement":null},{"id":"W2036576396","doi":"10.1016/j.disc.2014.01.002","title":"Extremal words in morphic subshifts","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Word (group theory); Lexicographical order; Mathematics; Morphism; Closure (psychology); Combinatorics; Alphabet; Simple (philosophy); Binary number; Discrete mathematics; Arithmetic; Linguistics","score_opus":0.012280867258995631,"score_gpt":0.230111695002526,"score_spread":0.21783082774353038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036576396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24687438,0.000056427754,0.7404718,0.00045463204,0.00015914987,0.00011385743,0.0000012326523,0.00019998742,0.011668561],"genre_scores_gemma":[0.9236497,0.000003993739,0.0758699,0.00018010491,0.000048689195,0.0000123714135,0.0000018534608,0.000014489082,0.00021889055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988501,0.000060920604,0.00028706546,0.0002551419,0.00024600877,0.0003007566],"domain_scores_gemma":[0.9988983,0.00019634199,0.000089334804,0.0007284802,0.000015837775,0.00007166432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065721944,0.0001486552,0.00021978148,0.00010690183,0.000045722103,0.00013146698,0.0008373614,0.000057584784,0.000034594963],"category_scores_gemma":[0.000106791864,0.00012260725,0.00006208915,0.0003169497,0.00004125802,0.00027181505,0.00022177622,0.00012048537,0.00015027997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012197419,0.00007261696,0.000414805,0.00006335947,0.0000054879924,0.000012636132,0.003014541,0.00006619939,0.00038033037,0.987441,0.00014690652,0.00838087],"study_design_scores_gemma":[0.00027704687,0.000030874504,0.0015226186,0.00010821872,0.00000391261,0.000016197615,0.00014763363,0.6607182,0.00055315235,0.3358607,0.0005199931,0.00024145251],"about_ca_topic_score_codex":0.000006404028,"about_ca_topic_score_gemma":0.00000959811,"teacher_disagreement_score":0.67677534,"about_ca_system_score_codex":0.000019719797,"about_ca_system_score_gemma":0.00001506862,"threshold_uncertainty_score":0.49997786},"labels":[],"label_agreement":null},{"id":"W2037269616","doi":"10.1016/j.aim.2007.12.001","title":"Möbius functions and semigroup representation theory II: Character formulas and multiplicities","year":2008,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Semigroup; Character (mathematics); Idempotence; Irreducible representation; Pure mathematics; Representation theory; Special classes of semigroups; Bicyclic semigroup; Inverse; Representation (politics); Combinatorics","score_opus":0.014742891250432528,"score_gpt":0.2537533366990527,"score_spread":0.23901044544862018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037269616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7613825,0.0024184585,0.2321034,0.0001300141,0.00017235904,0.00020732517,0.000004032475,0.00014937,0.0034325153],"genre_scores_gemma":[0.9285338,0.0022524865,0.06739808,0.00017106648,0.000053404234,0.00004558065,0.0000038412577,0.000013969641,0.001527797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991927,0.00003552506,0.0002322256,0.00023857744,0.0001315323,0.0001694087],"domain_scores_gemma":[0.9990718,0.00045675095,0.00009641217,0.00031073243,0.00002343527,0.000040865692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024231062,0.000120806944,0.00017041499,0.000092823946,0.00021817531,0.000040135583,0.00017677585,0.000041132873,0.000008318299],"category_scores_gemma":[0.0000886089,0.00010274165,0.000022513877,0.00015859907,0.00013573987,0.0012372297,0.0002057088,0.000091744485,0.0000058992555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013973189,0.00020941584,0.004775105,0.0001837354,0.000019936735,0.000032452106,0.027432548,0.000073394316,0.0012284204,0.84502804,0.00009529466,0.120907694],"study_design_scores_gemma":[0.00088261574,0.000116062074,0.01282021,0.00018030564,0.000013758947,0.00047444328,0.003212629,0.083934724,0.0015436887,0.8928415,0.0035356337,0.000444418],"about_ca_topic_score_codex":0.0000029348269,"about_ca_topic_score_gemma":0.0000049327723,"teacher_disagreement_score":0.16715126,"about_ca_system_score_codex":0.000013806857,"about_ca_system_score_gemma":0.000008014988,"threshold_uncertainty_score":0.4189683},"labels":[],"label_agreement":null},{"id":"W2037840685","doi":"10.1142/s0218196706003177","title":"COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semigroup; Type (biology); Pure mathematics; Discrete mathematics; Algebra over a field","score_opus":0.02678779521546516,"score_gpt":0.2609105961594294,"score_spread":0.23412280094396426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037840685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75843865,0.00017232989,0.23723386,0.0031179676,0.00070526206,0.000053273154,0.0000069816942,0.000036342797,0.0002353488],"genre_scores_gemma":[0.9864493,0.000020060874,0.012509481,0.00077430235,0.00020331742,9.194568e-7,0.00001600657,0.000008261948,0.000018335159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983806,0.0000939683,0.00058150117,0.00021232494,0.0005549034,0.00017668624],"domain_scores_gemma":[0.9987238,0.00012325367,0.00048311029,0.00010793421,0.00049453217,0.00006736913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038917278,0.00015554053,0.0002555025,0.0002931988,0.00010032583,0.00022227458,0.00063651125,0.00006343795,0.000009805527],"category_scores_gemma":[0.00002637614,0.00014542343,0.00007556893,0.00023433266,0.00018300637,0.0005549995,0.0001928422,0.00024364471,0.0000030255167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030409175,0.000631224,0.019161308,0.00002912995,0.00013361424,0.00033071448,0.0019771308,0.008700761,0.0009568371,0.93270606,0.0017199859,0.033349168],"study_design_scores_gemma":[0.0012320121,0.00019964184,0.38137493,0.00011352728,0.000009444737,0.00040407173,0.00022989702,0.13573293,0.00062448555,0.47959754,0.00024793998,0.00023357947],"about_ca_topic_score_codex":0.00055046804,"about_ca_topic_score_gemma":0.00049135595,"teacher_disagreement_score":0.4531085,"about_ca_system_score_codex":0.00011275699,"about_ca_system_score_gemma":0.00008258164,"threshold_uncertainty_score":0.59301955},"labels":[],"label_agreement":null},{"id":"W2037872771","doi":"10.1016/s0304-3975(00)00292-9","title":"Minimal cover-automata for finite languages","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Deterministic automaton; Deterministic finite automaton; Nondeterministic finite automaton; Cover (algebra); Two-way deterministic finite automaton; Büchi automaton; DFA minimization; ω-automaton; Regular language; Quantum finite automata; Finite-state machine; Nested word; Automaton; Mathematics; Discrete mathematics; Computer science; Timed automaton; Automata theory; Theoretical computer science; Algorithm","score_opus":0.010884254074289303,"score_gpt":0.26593739130814764,"score_spread":0.25505313723385836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037872771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029225051,0.0000495616,0.9620371,0.0015657269,0.0005254345,0.00022419606,0.000006470128,0.0005192121,0.0058472394],"genre_scores_gemma":[0.8030336,0.000007879313,0.19523467,0.0014162095,0.00021368198,0.000016175174,0.0000019844292,0.000010196141,0.00006560934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975528,0.00006496729,0.00027293785,0.00079259067,0.00056016375,0.0007565017],"domain_scores_gemma":[0.9976035,0.00086048286,0.00007285747,0.0010579762,0.00014383151,0.0002613954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015068192,0.00021145096,0.00023099243,0.0001799845,0.0004246264,0.0006097996,0.0032868288,0.000059071685,0.00006933901],"category_scores_gemma":[0.00019152407,0.00017144783,0.00010364672,0.00094470434,0.0015353422,0.00085612544,0.0010153783,0.00012131582,0.00020136763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000144020405,0.00006331205,0.00003169626,0.0000065455793,0.000003567015,0.000018702722,0.00021504392,0.00009821014,0.00067214324,0.93053234,0.00032408003,0.06801994],"study_design_scores_gemma":[0.00043704847,0.00029259638,0.00040942372,0.000025309837,0.0000046759783,0.000078838486,0.000011528627,0.8375713,0.0038180843,0.15381944,0.003249617,0.00028212127],"about_ca_topic_score_codex":0.0000020261168,"about_ca_topic_score_gemma":1.914381e-7,"teacher_disagreement_score":0.8374731,"about_ca_system_score_codex":0.000040405874,"about_ca_system_score_gemma":0.000102881575,"threshold_uncertainty_score":0.69914395},"labels":[],"label_agreement":null},{"id":"W2039091701","doi":"10.1016/s0304-3975(02)00746-6","title":"A note on differentiable palindromes","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differentiable function; Mathematics; Palindrome; Combinatorics; Discrete mathematics; Pure mathematics; Genetics; Biology; Genome","score_opus":0.008319133653806859,"score_gpt":0.23765318785784942,"score_spread":0.22933405420404257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039091701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05164478,0.000017941624,0.9303739,0.0004661736,0.00069504697,0.00011063468,7.775889e-7,0.00030277905,0.016387964],"genre_scores_gemma":[0.8970323,0.0000024217804,0.10169086,0.0011714885,0.000049332706,0.000005479137,2.6117038e-7,0.000008056417,0.000039786344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738014,0.00016058901,0.0002264075,0.00080196204,0.0007316899,0.00069922826],"domain_scores_gemma":[0.9980504,0.00035666284,0.00005359531,0.0011674677,0.00007957273,0.00029232516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013662459,0.0002120783,0.0002137611,0.00019247041,0.0004332968,0.00055319886,0.002387494,0.000052622934,0.0001350072],"category_scores_gemma":[0.00013267306,0.00015877603,0.00007903724,0.0010333488,0.0014466812,0.00047625013,0.00048107014,0.00020281196,0.00035805392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024095157,0.000080125166,0.000021514088,0.0000028938223,0.0000020280204,0.00001320011,0.00016028018,0.000049028127,0.00052937557,0.98395985,0.000067215646,0.015112066],"study_design_scores_gemma":[0.00028555584,0.00027689527,0.0006077848,0.000035314784,0.0000031238903,0.000060098464,0.0000036460872,0.26809615,0.024006648,0.70548147,0.0008257706,0.00031752512],"about_ca_topic_score_codex":9.1754026e-7,"about_ca_topic_score_gemma":1.0273598e-7,"teacher_disagreement_score":0.8453875,"about_ca_system_score_codex":0.000049900635,"about_ca_system_score_gemma":0.00010099093,"threshold_uncertainty_score":0.6474699},"labels":[],"label_agreement":null},{"id":"W2039338734","doi":"10.1016/j.jnt.2006.02.003","title":"Comments on the spectra of Pisot numbers","year":2006,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Spectral line; Pure mathematics; Combinatorics; Physics","score_opus":0.008628768251949219,"score_gpt":0.22663085071578523,"score_spread":0.218002082463836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039338734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6823556,0.00029790463,0.09764181,0.0070623616,0.0017528641,0.00021996119,0.000027206968,0.00007979785,0.21056248],"genre_scores_gemma":[0.9947698,0.000009959766,0.0031292823,0.0012494116,0.00022584382,0.0000010053479,5.5502056e-7,0.000010583518,0.0006035236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985946,0.00028293635,0.000439561,0.00010316467,0.00039728856,0.00018248167],"domain_scores_gemma":[0.9980008,0.00095287047,0.0005120115,0.00040794985,0.0000803641,0.000046021145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014668201,0.0001160366,0.00020911489,0.000058880727,0.00007387643,0.00005587659,0.0010779374,0.00003905604,0.0007627667],"category_scores_gemma":[0.00006322838,0.00006936467,0.00018225577,0.00019786418,0.0001006477,0.00023335166,0.00008557279,0.00023752125,0.000076108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004175003,0.00022038273,0.0005860853,0.0000055529154,0.000047647387,0.000034338085,0.00027583653,0.00003631676,0.0008615758,0.9387403,0.05579159,0.0033586144],"study_design_scores_gemma":[0.0006357853,0.0001685107,0.0062059104,0.00016579562,0.00002158664,0.00035036102,0.00026190834,0.0003219531,0.010887155,0.9635706,0.017236453,0.00017397833],"about_ca_topic_score_codex":0.000011307397,"about_ca_topic_score_gemma":0.0000011128263,"teacher_disagreement_score":0.31241423,"about_ca_system_score_codex":0.00003910126,"about_ca_system_score_gemma":0.00003885351,"threshold_uncertainty_score":0.83517605},"labels":[],"label_agreement":null},{"id":"W2039994929","doi":"10.1080/00927870701451375","title":"Complete Congruences on the Lattice of Rees–Sushkevich Varieties","year":2007,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Aperiodic graph; Mathematics; Congruence relation; Lattice (music); Endomorphism; Simple (philosophy); Exponent; Pure mathematics; Congruence (geometry); Combinatorics; Geometry","score_opus":0.05609291627475321,"score_gpt":0.30326775666361144,"score_spread":0.24717484038885823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039994929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48493007,0.0065815677,0.19976644,0.061142758,0.00082417065,0.0012249132,0.000028038821,0.00057933404,0.24492273],"genre_scores_gemma":[0.9784935,0.000121926634,0.020355674,0.00093165925,0.000009499022,0.0000122504125,0.0000037179736,0.0000048214647,0.000066938635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989624,0.00022761126,0.00031763248,0.00014324719,0.00017789284,0.00017118479],"domain_scores_gemma":[0.99403006,0.0028374332,0.00013140915,0.002897729,0.00007682194,0.000026569516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017737424,0.00008490398,0.00012675617,0.00010725405,0.0002001016,0.000057316698,0.0041519934,0.000040040402,0.000020295893],"category_scores_gemma":[0.00019865436,0.00006221643,0.000038342485,0.0005996808,0.00040494237,0.00016692668,0.000750719,0.00023194122,0.000038667753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023710215,0.00006557886,0.0008562782,0.0000035556525,0.0000067347123,5.920354e-7,0.0009592376,0.000005561485,0.00022093499,0.9915828,0.00022064167,0.0060757115],"study_design_scores_gemma":[0.0005055874,0.00016745643,0.093389854,0.00023136323,0.000014191096,0.00001610815,0.0022740792,0.032820974,0.0035131543,0.82203424,0.044599533,0.0004334632],"about_ca_topic_score_codex":0.000089887195,"about_ca_topic_score_gemma":0.00015555092,"teacher_disagreement_score":0.49356344,"about_ca_system_score_codex":0.000024160734,"about_ca_system_score_gemma":0.0000341728,"threshold_uncertainty_score":0.7715506},"labels":[],"label_agreement":null},{"id":"W2040106564","doi":"10.3233/fi-2011-519","title":"Transformations Between Different Models of Unranked Bottom-Up Tree Automata","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; Queen's University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Nondeterministic algorithm; Automaton; Tree (set theory); Tree automaton; Computer science; Theoretical computer science; Nondeterministic finite automaton; Computation; State (computer science); Deterministic automaton; Mathematics; Combinatorics; Automata theory; Algorithm","score_opus":0.0559662170445804,"score_gpt":0.2406667216710299,"score_spread":0.1847005046264495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040106564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24870697,0.000028427918,0.70870316,0.00017700074,0.00028614135,0.0004186519,0.00007487225,0.0004289982,0.041175798],"genre_scores_gemma":[0.9792048,0.000022188433,0.020345017,0.00021907079,0.00002016841,0.00003685747,0.000038590482,0.000011462649,0.000101865175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979833,0.000050960483,0.00092711434,0.0001735287,0.00045874738,0.00040640184],"domain_scores_gemma":[0.99848014,0.000113447764,0.00026525787,0.0009140334,0.00005567982,0.0001714362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033174612,0.0002460668,0.00039215075,0.00023393225,0.00013910951,0.00010583677,0.0014325931,0.00009110749,0.0001472676],"category_scores_gemma":[0.000010676383,0.00019841448,0.00016079989,0.00031948282,0.00011144969,0.0029413742,0.0002487264,0.00017459794,0.00012800805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032240485,0.00038363913,0.0011555029,0.00039883313,0.00027081277,0.0000024588417,0.0698547,0.000036891266,0.0003652754,0.7702101,0.0022200516,0.15506952],"study_design_scores_gemma":[0.004348758,0.0007747734,0.029386517,0.00035906793,0.00016883799,0.000032850938,0.0026187357,0.7322903,0.0296408,0.19731848,0.0018188593,0.0012419992],"about_ca_topic_score_codex":0.000033061544,"about_ca_topic_score_gemma":0.0000041969524,"teacher_disagreement_score":0.73225343,"about_ca_system_score_codex":0.00005302585,"about_ca_system_score_gemma":0.000051912702,"threshold_uncertainty_score":0.80911076},"labels":[],"label_agreement":null},{"id":"W2040684427","doi":"10.1142/s0218196710005650","title":"A PROFINITE APPROACH TO STABLE PAIRS","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Aperiodic graph; Mathematics; Decidability; Pure mathematics; Idempotence; Profinite group; Combinatorics; Algebra over a field; Discrete mathematics; Group (periodic table)","score_opus":0.010339373780069298,"score_gpt":0.25179290970645424,"score_spread":0.24145353592638494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040684427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3926823,0.000020997088,0.60455054,0.001009796,0.0007743485,0.000039163482,7.975332e-7,0.000018772089,0.00090329064],"genre_scores_gemma":[0.88557625,0.0000037754776,0.11371665,0.0004782634,0.00019160696,0.0000015781595,0.0000016008757,0.000003850672,0.000026455797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991961,0.00002624326,0.00023858303,0.00011755456,0.0003346662,0.00008684103],"domain_scores_gemma":[0.99928117,0.00006999845,0.00016407866,0.00007076579,0.00032599462,0.00008800122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036769957,0.00006749656,0.000092103255,0.00019683434,0.000037889487,0.00024162121,0.00049068464,0.00002888395,0.0000050137874],"category_scores_gemma":[0.00004427283,0.000056359135,0.00003967392,0.00011886004,0.000018317513,0.0005398307,0.000103768056,0.00014541608,0.0000071286877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063861735,0.0003122376,0.0015926923,0.000011895913,0.00013533796,0.000042935077,0.003276993,0.0021235775,0.012399522,0.5669824,0.0021272018,0.41093135],"study_design_scores_gemma":[0.0024636928,0.0005912811,0.060997587,0.000119260956,0.000026778906,0.0024400696,0.00050519477,0.54622304,0.006869798,0.3692866,0.009878741,0.0005979333],"about_ca_topic_score_codex":0.000004299786,"about_ca_topic_score_gemma":7.3141416e-7,"teacher_disagreement_score":0.5440995,"about_ca_system_score_codex":0.000012721345,"about_ca_system_score_gemma":0.000047109912,"threshold_uncertainty_score":0.2329959},"labels":[],"label_agreement":null},{"id":"W2041354954","doi":"10.1007/s00224-005-1263-x","title":"Algebraic Results on Quantum Automata","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Sherbrooke; University of Waterloo","funders":"","keywords":"Class (philosophy); Automaton; Construct (python library); Quantum finite automata; Algebraic number; Computer science; Algebraic theory; Quantum; Algebra over a field; Cellular automaton; Quantum cellular automaton; Regular language; Theoretical computer science; Boolean function; Discrete mathematics; Mathematics; Automata theory; Pure mathematics; Programming language; Algorithm; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.018560839364263417,"score_gpt":0.2465511724309238,"score_spread":0.2279903330666604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041354954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5343831,0.0006139514,0.43589327,0.00085926306,0.0022158336,0.00041536984,0.000015401076,0.0016361941,0.023967614],"genre_scores_gemma":[0.99616414,0.000003171245,0.0028432459,0.00023190965,0.00036892932,0.000002314441,0.0000034869215,0.00001937619,0.00036340026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974395,0.00054240634,0.00071440125,0.00047384325,0.00043888346,0.00039095012],"domain_scores_gemma":[0.99699736,0.0011307725,0.00043446055,0.0012687542,0.00007329636,0.00009534602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035084821,0.00022297763,0.00039206742,0.00018866871,0.0001485586,0.00012309437,0.0015290765,0.00008326391,0.0000039430147],"category_scores_gemma":[0.00014235567,0.0001908805,0.00010896716,0.00031649854,0.00009295484,0.00022901883,0.00027974116,0.00016168824,0.0002360228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003634782,0.00009206709,0.000005319902,0.000042722902,0.00002575907,0.000005658167,0.0015421937,0.0046121525,0.00047236463,0.9538585,0.0015296516,0.037777256],"study_design_scores_gemma":[0.0012370938,0.00031572906,0.00083579414,0.0006718183,0.000009837233,0.000082599654,0.00022084899,0.95599717,0.0027365081,0.032142926,0.0053288243,0.0004208511],"about_ca_topic_score_codex":0.0000141075625,"about_ca_topic_score_gemma":3.327004e-7,"teacher_disagreement_score":0.951385,"about_ca_system_score_codex":0.00005271844,"about_ca_system_score_gemma":0.000045697725,"threshold_uncertainty_score":0.7783881},"labels":[],"label_agreement":null},{"id":"W2041550783","doi":"10.1007/s00233-006-0644-z","title":"Sequentially Injective Hull of Acts Over Idempotent Semigroups","year":2006,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wilfrid Laurier University","keywords":"Monomorphism; Injective function; Mathematics; Idempotence; Semigroup; Hull; Pure mathematics; Algebra over a field; Combinatorics","score_opus":0.0036107636998750255,"score_gpt":0.20272450411826548,"score_spread":0.19911374041839044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041550783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6156162,0.0014378137,0.3492473,0.00144678,0.0014865438,0.0007210638,0.000064037835,0.00094994804,0.02903028],"genre_scores_gemma":[0.9899068,0.000020912805,0.008269204,0.0006794841,0.00017876246,0.0000230271,0.000026479156,0.000037640944,0.00085772923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970733,0.00012437692,0.0006572322,0.0007066957,0.0006351606,0.0008032627],"domain_scores_gemma":[0.99808806,0.00018715972,0.0003851091,0.0010697903,0.00013441313,0.00013543887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005626616,0.0003669446,0.0004596466,0.00024661433,0.00016193533,0.00013243177,0.0013613312,0.00019937618,0.00006929944],"category_scores_gemma":[0.000045372624,0.00033909542,0.0002948693,0.0006903054,0.0001437277,0.0009768109,0.00066134124,0.00026243262,0.00007189964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004855143,0.00046261612,0.008558997,0.00007800879,0.00011520703,0.000083510364,0.0006909668,0.00059201923,0.117650576,0.8374812,0.024839336,0.009398995],"study_design_scores_gemma":[0.004271687,0.0011371472,0.09273869,0.00053039764,0.00012690757,0.00030689675,0.0008344971,0.054506976,0.31849858,0.46259215,0.06165019,0.00280586],"about_ca_topic_score_codex":0.0007858255,"about_ca_topic_score_gemma":0.00019088209,"teacher_disagreement_score":0.37488905,"about_ca_system_score_codex":0.00013309593,"about_ca_system_score_gemma":0.000108213026,"threshold_uncertainty_score":0.9999061},"labels":[],"label_agreement":null},{"id":"W2041801901","doi":"10.1016/j.tcs.2007.11.020","title":"Another proof of Soittola’s theorem","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Mathematical proof; Formal power series; Analytic proof; Power series; Discrete mathematics; Algebraic number; Formal proof; Series (stratigraphy); Algebra over a field; Pure mathematics; Calculus (dental); Mathematical analysis","score_opus":0.008936159004620844,"score_gpt":0.24335869651830644,"score_spread":0.23442253751368558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041801901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055653185,0.000039764418,0.9288365,0.00036989045,0.00046582104,0.00015059694,6.6768945e-7,0.00018433928,0.0142992195],"genre_scores_gemma":[0.8549079,8.576239e-7,0.14437146,0.0006006652,0.00009338582,0.0000015742597,1.5987634e-7,0.0000090224485,0.00001497994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997348,0.00007472023,0.00041300472,0.00063838845,0.0008174499,0.0007084268],"domain_scores_gemma":[0.99795395,0.00039367835,0.0001269454,0.0011272623,0.00020048651,0.00019765556],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00462957,0.0001911243,0.00025359646,0.00026246093,0.00019981613,0.0001622497,0.0033432855,0.00006283854,0.000060059672],"category_scores_gemma":[0.00008277923,0.0001437942,0.000092401766,0.0013717205,0.0036203198,0.00061953225,0.0010129093,0.00016439543,0.000028507471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000097933935,0.000076923956,0.00006272303,0.0000071307595,0.0000033665774,0.000010530021,0.00044735998,0.000018416373,0.0038537453,0.8942394,0.000031635995,0.10123896],"study_design_scores_gemma":[0.00025321977,0.0002496668,0.0016827978,0.00004230985,0.000003831125,0.000055599412,0.000014797805,0.1398483,0.24601656,0.6113389,0.00022257835,0.00027144534],"about_ca_topic_score_codex":0.0000026834798,"about_ca_topic_score_gemma":4.0135598e-7,"teacher_disagreement_score":0.7992547,"about_ca_system_score_codex":0.000039868617,"about_ca_system_score_gemma":0.00011299476,"threshold_uncertainty_score":0.99909127},"labels":[],"label_agreement":null},{"id":"W2043257491","doi":"10.1007/s11225-005-5057-6","title":"An application of a Theorem of Ash to finite covers","year":2004,"lang":"en","type":"article","venue":"Studia Logica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Semigroup; Inverse semigroup; Unary operation; Pure mathematics; Special classes of semigroups; Group (periodic table); Structured program theorem; Cancellative semigroup; Krohn–Rhodes theory; Subalgebra; Discrete mathematics; Algebra over a field","score_opus":0.011128717335233984,"score_gpt":0.25238099070918846,"score_spread":0.24125227337395447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043257491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22642353,0.00004619307,0.7664732,0.00030232768,0.00005336184,0.00019516678,0.0000073389733,0.000068869034,0.006430048],"genre_scores_gemma":[0.9832416,0.0000062857425,0.016457569,0.00025741494,0.000014815451,0.000013510398,0.0000013281539,0.0000026572727,0.000004819461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999403,0.000026417129,0.00014127791,0.0001898376,0.00013447991,0.00010498061],"domain_scores_gemma":[0.99932516,0.00006987057,0.00008071484,0.00043372178,0.00004871062,0.000041803058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021737222,0.00006204668,0.00012842701,0.00004346441,0.000031293497,0.00000990414,0.0005337832,0.000024706036,0.0000051297475],"category_scores_gemma":[0.000031055035,0.000048530783,0.000034011708,0.00030161283,0.000048611706,0.00009203005,0.00011871408,0.000029747194,0.000020887472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008821563,0.00015597399,0.00032902873,0.000006146962,0.000010188746,0.0000011931343,0.0015208502,0.0029917418,0.018683119,0.96017283,0.000036063677,0.016084043],"study_design_scores_gemma":[0.0016995643,0.0022829631,0.08471957,0.00007141485,0.000026516216,0.0000057923594,0.0011070739,0.0043075737,0.091820136,0.8096621,0.0037337285,0.0005635691],"about_ca_topic_score_codex":0.000028519928,"about_ca_topic_score_gemma":0.0000042836123,"teacher_disagreement_score":0.75681806,"about_ca_system_score_codex":0.000013476377,"about_ca_system_score_gemma":0.000030576346,"threshold_uncertainty_score":0.19790278},"labels":[],"label_agreement":null},{"id":"W2043304636","doi":"10.1016/j.tcs.2007.04.004","title":"On a zeta function associated with automata and codes","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Simplicity; Automaton; Function (biology); Riemann zeta function; Zero (linguistics); Discrete mathematics; Word (group theory); Combinatorics; Cellular automaton; Pure mathematics; Algorithm; Computer science; Physics; Theoretical computer science; Geometry; Quantum mechanics","score_opus":0.006311545731731295,"score_gpt":0.2193332548910603,"score_spread":0.213021709159329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043304636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26299307,0.000010374423,0.7329441,0.0002700611,0.00020178503,0.000087725304,8.87307e-7,0.00035328788,0.0031387093],"genre_scores_gemma":[0.9744553,0.0000012101143,0.024338607,0.001140888,0.00004301542,0.0000018667962,9.1157506e-7,0.000007532408,0.0000106910675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782825,0.000071237046,0.00019042751,0.0006675488,0.000684835,0.0005577084],"domain_scores_gemma":[0.99818146,0.00075952563,0.00007146532,0.00062753505,0.000107863154,0.00025216112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002984756,0.00017954262,0.00017891788,0.00019527451,0.00040679448,0.00042186028,0.0011227701,0.000053086307,0.00001345032],"category_scores_gemma":[0.00012022508,0.00012462119,0.000026123726,0.0010125027,0.0020486533,0.00055334036,0.0005018029,0.00017413731,0.000026216474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027678743,0.000068702604,0.0000663062,0.0000020572377,0.0000059438257,0.00001972599,0.00014215212,0.000028880362,0.0002793631,0.9551342,0.0000482678,0.044176713],"study_design_scores_gemma":[0.00062945246,0.0014082919,0.026752038,0.000104840925,0.0000103556295,0.00007101745,0.000010382235,0.59732765,0.0023025298,0.37098387,0.000044029748,0.00035557488],"about_ca_topic_score_codex":0.00000179335,"about_ca_topic_score_gemma":0.0000012592976,"teacher_disagreement_score":0.7114622,"about_ca_system_score_codex":0.00005103793,"about_ca_system_score_gemma":0.000054505897,"threshold_uncertainty_score":0.75483483},"labels":[],"label_agreement":null},{"id":"W2044138171","doi":"10.1016/j.jcta.2005.08.004","title":"Möbius functions and semigroup representation theory","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Semilattice; Mathematics; Semigroup; Inverse semigroup; Krohn–Rhodes theory; Pure mathematics; Algebra over a field; Representation (politics); Bicyclic semigroup; Inverse; Product (mathematics); Representation theory; Eigenvalues and eigenvectors; Matrix (chemical analysis); Special classes of semigroups","score_opus":0.008332151884208635,"score_gpt":0.23615552530717582,"score_spread":0.22782337342296718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044138171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61023116,0.0048472243,0.34110758,0.0054486594,0.017621772,0.0004016895,0.000008812221,0.00035915605,0.019973952],"genre_scores_gemma":[0.9926629,0.00015459537,0.0041869506,0.00027345534,0.0013249367,0.0000039205424,9.702038e-7,0.0000159732,0.0013762646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826974,0.0004769414,0.00049856916,0.0001974248,0.0003387531,0.00021858621],"domain_scores_gemma":[0.99823874,0.0006087192,0.0004242888,0.00038157956,0.0002023468,0.00014435172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021909892,0.00016264846,0.0002904573,0.00016739653,0.00020928886,0.00023367537,0.00056532153,0.00008599357,0.00008271622],"category_scores_gemma":[0.00031740262,0.00013358502,0.00013093207,0.00029309624,0.00014427157,0.0021390182,0.00018466465,0.00026785143,0.00001378385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029304513,0.00008434226,0.00006322345,0.0000055072883,0.00005949918,0.00001843848,0.00097539346,0.000029549905,0.0012757524,0.95275766,0.0011863834,0.043251198],"study_design_scores_gemma":[0.0011159932,0.00042628252,0.0003760233,0.000037569993,0.000036336165,0.0006016986,0.00089889456,0.00020967002,0.003410579,0.96172625,0.030982502,0.00017818136],"about_ca_topic_score_codex":0.000001475261,"about_ca_topic_score_gemma":5.311766e-7,"teacher_disagreement_score":0.38243178,"about_ca_system_score_codex":0.000053580417,"about_ca_system_score_gemma":0.00007433712,"threshold_uncertainty_score":0.5447439},"labels":[],"label_agreement":null},{"id":"W2044722214","doi":"10.1137/s0097539700369156","title":"The Efficiency of Resolution and Davis--Putnam Procedures","year":2002,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pigeonhole principle; Mathematical proof; Resolution (logic); Mathematics; Class (philosophy); True quantified Boolean formula; Combinatorics; Discrete mathematics; Upper and lower bounds; Simple (philosophy); Conjunctive normal form; Binary logarithm; Satisfiability; Algorithm; Computer science","score_opus":0.012382062135946685,"score_gpt":0.2277696652962964,"score_spread":0.2153876031603497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044722214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7292856,0.005335193,0.25785762,0.0027683466,0.0009110674,0.00014355335,5.290106e-7,0.000119917604,0.0035781797],"genre_scores_gemma":[0.99560064,0.00014320787,0.0038938483,0.00015895929,0.00015175522,2.6200223e-7,5.1853732e-8,0.000005049134,0.00004623051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891907,0.00010317315,0.00029172297,0.00016030454,0.00028236755,0.00024336234],"domain_scores_gemma":[0.9990555,0.00034931046,0.00024857177,0.00021396998,0.00006506935,0.0000675827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008886337,0.0000923079,0.00011201738,0.00007197296,0.00064180925,0.00022847274,0.00056900765,0.000027882224,0.0000031342195],"category_scores_gemma":[0.00017548827,0.00005844015,0.000048997546,0.00022477467,0.00007551815,0.00015331367,0.00015386005,0.0002292147,0.0000065885433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002267501,0.00027090524,0.00082648726,0.00006487774,0.00004760146,0.00006215707,0.004542011,0.004651112,0.0028400433,0.20481427,0.00630003,0.7755578],"study_design_scores_gemma":[0.00036755373,0.00031331886,0.0033753666,0.00025449562,0.0000045540996,0.000640563,0.00012452071,0.9855584,0.00096439454,0.0064678267,0.0017807494,0.00014825402],"about_ca_topic_score_codex":0.0000010033435,"about_ca_topic_score_gemma":3.361247e-7,"teacher_disagreement_score":0.98090726,"about_ca_system_score_codex":0.000020448548,"about_ca_system_score_gemma":0.000019792988,"threshold_uncertainty_score":0.49363425},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009870597442700342,"score_gpt":0.29530844546629664,"score_spread":0.2854378480235963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046033718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17555076,0.000049078204,0.8225799,0.00038255236,0.0009837509,0.00004840969,0.000002961615,0.000014100689,0.00038845188],"genre_scores_gemma":[0.6478011,0.000009047689,0.35205284,0.00004968327,0.00006584531,4.7294995e-7,0.0000010052338,0.0000027651342,0.000017229779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978506,0.00008688815,0.00069065386,0.00019082638,0.0010373787,0.00014368122],"domain_scores_gemma":[0.99660206,0.0001973282,0.00084037404,0.0003450682,0.0019345642,0.000080635094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014835024,0.00009876275,0.00021160801,0.000568913,0.00008627393,0.00015381255,0.0024077462,0.00002910886,0.000029806672],"category_scores_gemma":[0.00015584014,0.00008794754,0.00012437609,0.0005697915,0.0003704482,0.0017942284,0.00020685245,0.00009416793,0.000009472639],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004245389,0.0008694023,0.0010681237,0.000018477285,0.00021586777,0.000025753856,0.001228986,0.012692018,0.25275642,0.6150313,0.000422914,0.11562826],"study_design_scores_gemma":[0.0013562812,0.000687817,0.011583237,0.000427276,0.000029388395,0.0010213039,0.000024940624,0.3706021,0.5291335,0.08227029,0.0025203563,0.00034348483],"about_ca_topic_score_codex":0.0000041078533,"about_ca_topic_score_gemma":3.0307163e-7,"teacher_disagreement_score":0.53276104,"about_ca_system_score_codex":0.00007891784,"about_ca_system_score_gemma":0.00042510114,"threshold_uncertainty_score":0.44742316},"labels":[],"label_agreement":null},{"id":"W2048141197","doi":"10.1016/s0022-4049(03)00124-5","title":"On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties","year":2003,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Assertion; Mathematics; Vertex (graph theory); Rank (graph theory); Combinatorics; Basis (linear algebra); Contrast (vision); Computer science; Geometry; Artificial intelligence; Graph","score_opus":0.011406011668432357,"score_gpt":0.2214527526548045,"score_spread":0.21004674098637213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048141197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.846721,0.0013374165,0.15025224,0.0008393485,0.00011416538,0.00027471827,0.00000381916,0.000014123975,0.00044319718],"genre_scores_gemma":[0.9933343,0.00025694465,0.0059607755,0.00038802682,0.000029314695,0.0000074495947,5.05705e-7,0.000006373268,0.000016345979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924743,0.00006874633,0.00027363532,0.0001384087,0.00015279437,0.0001190074],"domain_scores_gemma":[0.99876374,0.0007342525,0.0002444985,0.0001408124,0.00005600621,0.000060678547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010912664,0.000108894645,0.0002446621,0.00007245642,0.00012703637,0.00012941034,0.00016624946,0.00005393088,0.0000035274113],"category_scores_gemma":[0.00008060405,0.00006450947,0.00004503309,0.00009347365,0.00013144941,0.0002451494,0.000030505236,0.000118206146,2.0469041e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001874208,0.0000617015,0.000058484173,0.00006141423,0.000048344966,0.0000010528827,0.002011236,0.0001248218,0.0023036613,0.9718995,0.0001647663,0.023077583],"study_design_scores_gemma":[0.0040527615,0.0006328153,0.0012800654,0.000104083636,0.00006908356,0.00006758312,0.00065481843,0.013808075,0.008348484,0.9700446,0.0007537696,0.00018387048],"about_ca_topic_score_codex":0.0000010551402,"about_ca_topic_score_gemma":0.0000013971002,"teacher_disagreement_score":0.14661328,"about_ca_system_score_codex":0.0000037468074,"about_ca_system_score_gemma":0.000022562868,"threshold_uncertainty_score":0.26306197},"labels":[],"label_agreement":null},{"id":"W2048480664","doi":"10.1006/jabr.1999.8227","title":"Hereditary Semigroup Algebras","year":2000,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Monoid; Bicyclic semigroup; Semigroup; Noetherian; Pure mathematics; Cancellative semigroup; Ideal (ethics); Nilpotent; Prime ideal; Algebra over a field; Prime (order theory); Combinatorics","score_opus":0.006227633009707522,"score_gpt":0.21030926056730118,"score_spread":0.20408162755759365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048480664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95957935,0.002170808,0.024447095,0.0027370846,0.001078039,0.000064156404,0.000001694847,0.00011655835,0.009805242],"genre_scores_gemma":[0.970444,0.00020767807,0.024966292,0.0022110008,0.0009759122,0.0000010531552,7.31848e-7,0.000018479186,0.0011748151],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986144,0.00007755017,0.00046749765,0.00016154352,0.00041850828,0.00026053312],"domain_scores_gemma":[0.999037,0.00011539492,0.000208714,0.00038455098,0.000080768135,0.0001735287],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057282764,0.00013784645,0.00024644728,0.00012386871,0.00007605641,0.00012623907,0.0011985812,0.00006688055,0.0010807627],"category_scores_gemma":[0.000026208407,0.00010815635,0.00018765955,0.00030034638,0.00004286633,0.0010972224,0.00007216029,0.00026729124,0.00024153045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006466692,0.00034411572,0.0004944512,0.00002387853,0.00018081033,0.0016257885,0.001561047,0.00016100451,0.002267607,0.10148675,0.10219208,0.7895978],"study_design_scores_gemma":[0.0044244956,0.0022172523,0.034563795,0.0005492513,0.00012158105,0.017786924,0.00041076166,0.015516553,0.017386908,0.5645304,0.34086302,0.0016290562],"about_ca_topic_score_codex":0.000005290578,"about_ca_topic_score_gemma":7.2692615e-7,"teacher_disagreement_score":0.78796875,"about_ca_system_score_codex":0.000034155077,"about_ca_system_score_gemma":0.00007929849,"threshold_uncertainty_score":0.9998324},"labels":[],"label_agreement":null},{"id":"W2048893100","doi":"10.1007/s00233-013-9471-1","title":"Endomorphism monoids in varieties of commutative semigroups","year":2013,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Endomorphism; Mathematics; Semigroup; Subcategory; Morphism; Commutative property; Pure mathematics; Monoid; Constant (computer programming); Special classes of semigroups; Cardinality (data modeling); Discrete mathematics; Identity (music); Algebra over a field","score_opus":0.004363033903384853,"score_gpt":0.19292513508695525,"score_spread":0.1885621011835704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048893100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78690404,0.0018364561,0.18819895,0.0042772945,0.00076554215,0.0011549756,0.000024383755,0.00055739615,0.016280953],"genre_scores_gemma":[0.98779887,0.000044775643,0.0108695915,0.0006996998,0.000027311979,0.000108106295,0.000010183343,0.000022441205,0.0004190462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782467,0.00016961587,0.00057888444,0.000437081,0.00035792508,0.00063182623],"domain_scores_gemma":[0.998233,0.00043679102,0.00022731918,0.0008781315,0.00010576836,0.000118951095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047957432,0.0002766482,0.00045300036,0.00026886168,0.00009085665,0.000108728345,0.0013992889,0.00014416207,0.0001423216],"category_scores_gemma":[0.00007029609,0.00025143745,0.00013463736,0.0006553561,0.00020074881,0.0011807838,0.00060577213,0.00030878696,0.00016264839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002123492,0.00041718254,0.015975818,0.000079624224,0.00007237722,0.00003542835,0.009662995,0.00017079916,0.025873322,0.89320064,0.014489602,0.040000957],"study_design_scores_gemma":[0.0030075465,0.00066014734,0.03988256,0.000268341,0.000019354597,0.00009450133,0.0068998896,0.11570651,0.053016115,0.7739979,0.0051264544,0.0013206479],"about_ca_topic_score_codex":0.0012663294,"about_ca_topic_score_gemma":0.0000784738,"teacher_disagreement_score":0.2008948,"about_ca_system_score_codex":0.00007167595,"about_ca_system_score_gemma":0.000051694617,"threshold_uncertainty_score":0.9999938},"labels":[],"label_agreement":null},{"id":"W2049256457","doi":"10.1007/s11083-012-9256-2","title":"A Hierarchy of Chains Embeddable into the Lexicographic Power $\\boldsymbol{({\\mathbb{R}}^\\omega,\\prec_{\\rm lex})}$","year":2012,"lang":"en","type":"article","venue":"Order","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Lexicographical order; Combinatorics; Mathematics; Hierarchy; Omega; Tree (set theory); Order (exchange); Transfinite number; Sequence (biology); Branching (polymer chemistry); Chain (unit); Discrete mathematics; Binary tree; Physics","score_opus":0.008076845308624325,"score_gpt":0.23371086798086937,"score_spread":0.22563402267224505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049256457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7722297,0.0064484198,0.1754568,0.0036505403,0.001954273,0.0005671481,0.0000067302763,0.0005555956,0.03913083],"genre_scores_gemma":[0.98938555,0.00005611066,0.0082307,0.00086329086,0.00012303205,0.000036656256,0.0000021424553,0.000021446198,0.0012810648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981568,0.00014466327,0.0003216284,0.0003307249,0.00041422792,0.0006319431],"domain_scores_gemma":[0.9982178,0.00019739066,0.00014473357,0.0011956132,0.00008733278,0.00015709423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009700066,0.0002322908,0.00026749837,0.00018877798,0.00021328604,0.000114769915,0.0013899978,0.0001100563,0.00014244951],"category_scores_gemma":[0.00007220374,0.00015606981,0.00014996946,0.0012158024,0.00022129863,0.0008010779,0.00036034596,0.00023525048,0.0001386252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021928641,0.00066123763,0.005768611,0.00005997877,0.00015199948,0.000006783841,0.028483003,0.00003212883,0.006676928,0.877507,0.0073038545,0.07332656],"study_design_scores_gemma":[0.004545553,0.0010992265,0.11912669,0.00054285437,0.00017353412,0.00028221527,0.005070451,0.054028604,0.03582866,0.19722477,0.5781327,0.003944732],"about_ca_topic_score_codex":0.00008955581,"about_ca_topic_score_gemma":0.0000082074675,"teacher_disagreement_score":0.68028224,"about_ca_system_score_codex":0.000023092256,"about_ca_system_score_gemma":0.000067868954,"threshold_uncertainty_score":0.63643426},"labels":[],"label_agreement":null},{"id":"W2049709665","doi":"10.1016/j.tcs.2009.04.016","title":"On the uniqueness of shuffle on words and finite languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Uniqueness; Factorization; Regular language; Mathematics; Decomposition; Finite set; Combinatorics; Discrete mathematics; Combinatorics on words; Computer science; Word (group theory); Theoretical computer science; Algorithm; Automaton","score_opus":0.007427173008570303,"score_gpt":0.24655547753011023,"score_spread":0.23912830452153994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049709665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35841572,0.000029666062,0.629904,0.004162289,0.00012905528,0.00010934558,0.0000012554597,0.00011039312,0.007138284],"genre_scores_gemma":[0.9863322,0.0000044729404,0.009900233,0.0037140811,0.00003554278,0.0000016086407,1.4896634e-7,0.0000030211836,0.000008718916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986059,0.00011836472,0.00015372915,0.00039646172,0.00043871495,0.0002868385],"domain_scores_gemma":[0.9979524,0.0011007186,0.000052108648,0.0007484716,0.000047035894,0.00009928096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013042033,0.00012882131,0.00014481627,0.0001104078,0.00020877075,0.00018698472,0.0016800719,0.00003120169,0.000019628098],"category_scores_gemma":[0.0001312095,0.000074460375,0.000034857592,0.0006339111,0.001495266,0.00019014506,0.00031067876,0.00014578369,0.000014802419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075216735,0.00004347911,0.000004961287,0.0000016977258,0.0000010863471,0.000005203328,0.00045310974,0.00009445748,0.0004784882,0.9413275,0.00002544947,0.057557005],"study_design_scores_gemma":[0.00011904787,0.000625531,0.0017047836,0.0000717702,0.0000018447591,0.0000098477585,0.0000193792,0.22861695,0.01770925,0.7509594,0.000023993543,0.00013820254],"about_ca_topic_score_codex":0.0000013233933,"about_ca_topic_score_gemma":8.639165e-8,"teacher_disagreement_score":0.62791646,"about_ca_system_score_codex":0.00001370032,"about_ca_system_score_gemma":0.00003500173,"threshold_uncertainty_score":0.550937},"labels":[],"label_agreement":null},{"id":"W2050304496","doi":"10.1016/s1570-8667(03)00037-6","title":"Two-pattern strings I—A recognition algorithm","year":2003,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Generalization; Class (philosophy); Computer science; String searching algorithm; Algorithm; Pattern matching; Mathematics; Combinatorics; Pattern recognition (psychology); Discrete mathematics; Artificial intelligence; Data structure","score_opus":0.015317200453146392,"score_gpt":0.2522856864990134,"score_spread":0.236968486045867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050304496","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009614921,0.0005800009,0.9861228,0.00029259096,0.0011759459,0.00007482169,0.000010474016,0.00007548642,0.002052974],"genre_scores_gemma":[0.335132,0.00021287489,0.66291827,0.00081360014,0.0007140455,0.0000047773306,0.000005158068,0.000037817215,0.00016142064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982071,0.00016564674,0.0005635534,0.00022826738,0.0005064476,0.0003289734],"domain_scores_gemma":[0.9986531,0.00011462629,0.00049494545,0.00031891195,0.0002216199,0.00019679354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009890546,0.00018535575,0.00029164995,0.00020654072,0.00009948444,0.0002203222,0.0007133694,0.00006178779,0.00006363472],"category_scores_gemma":[0.00007680534,0.00014980714,0.00021455334,0.00034114602,0.000042451895,0.0011582217,0.00007718161,0.0003185424,0.00004888415],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002951822,0.00007098546,0.00008233024,0.0000073527804,0.00006333524,0.00018297763,0.0002849147,0.000019594481,0.00050664775,0.0017233344,0.00086722884,0.99618834],"study_design_scores_gemma":[0.01768884,0.004174317,0.004897258,0.0013820141,0.00041122496,0.015978958,0.002920694,0.4178474,0.14696994,0.32983866,0.05391895,0.0039717336],"about_ca_topic_score_codex":0.000014531877,"about_ca_topic_score_gemma":8.0542384e-7,"teacher_disagreement_score":0.9922166,"about_ca_system_score_codex":0.00005721191,"about_ca_system_score_gemma":0.00008929708,"threshold_uncertainty_score":0.61089575},"labels":[],"label_agreement":null},{"id":"W2050895508","doi":"10.1142/s1005386706000563","title":"Green's Relations on the Monoid of Regular Hypersubstitutions","year":2006,"lang":"en","type":"article","venue":"Algebra Colloquium","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Semigroup; Galois connection; Monoid; Free monoid; Type (biology); Syntactic monoid; Connection (principal bundle); Pure mathematics; Bicyclic semigroup; Combinatorics; Lattice (music); Discrete mathematics; Algebra over a field","score_opus":0.007327646450769529,"score_gpt":0.18685431453004278,"score_spread":0.17952666807927325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050895508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8001899,0.0004121533,0.11593969,0.018597197,0.00071403704,0.00049669755,0.000021213433,0.00041779788,0.06321129],"genre_scores_gemma":[0.99406725,0.00000312303,0.002891896,0.00036749482,0.000074426884,0.00002168594,0.000003783951,0.000006965567,0.0025633592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990955,0.00007147246,0.00020666128,0.00021567747,0.0002295555,0.00018115251],"domain_scores_gemma":[0.9988176,0.00024407485,0.00009352111,0.0007564121,0.000057138703,0.00003124686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025269168,0.00010241153,0.00011125791,0.000082130886,0.00025442173,0.00004808253,0.00069562887,0.000049757127,0.000046306388],"category_scores_gemma":[0.000033127657,0.00007355439,0.0000905703,0.00055605016,0.00013350853,0.00021266803,0.00010912934,0.00009780981,0.0001258081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020784403,0.000055106833,0.00014743648,0.0000017714402,0.000008980419,0.0000030445858,0.0000722148,0.00020307057,0.0018980554,0.9889534,0.0081219645,0.0005328665],"study_design_scores_gemma":[0.0008373854,0.00023395201,0.039681878,0.00008613859,0.00005353197,0.00003499052,0.0002051059,0.037680764,0.031144232,0.84431726,0.045142934,0.0005818275],"about_ca_topic_score_codex":0.00017126351,"about_ca_topic_score_gemma":0.000021045595,"teacher_disagreement_score":0.19387734,"about_ca_system_score_codex":0.000029062012,"about_ca_system_score_gemma":0.000054339907,"threshold_uncertainty_score":0.2999461},"labels":[],"label_agreement":null},{"id":"W2051714857","doi":"10.1007/s00493-006-0015-0","title":"COLORING SUBGRAPHS OF THE RADO GRAPH","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"semigroups and automata theory","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Countable set; Homogeneous; Element (criminal law); Graph; Binary number; Discrete mathematics; Class (philosophy); Arithmetic; Computer science","score_opus":0.003797364287851082,"score_gpt":0.17083807351288774,"score_spread":0.16704070922503667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051714857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93165994,0.001650384,0.027844299,0.0010881108,0.0030797191,0.0002983906,0.0000024303183,0.00041516338,0.033961583],"genre_scores_gemma":[0.9991861,0.000007391084,0.0005396258,0.00005514658,0.000017113893,0.0000061480678,2.6974004e-7,0.0000052206383,0.00018298473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992375,0.00004995389,0.00016265151,0.00017231437,0.00020369205,0.0001738879],"domain_scores_gemma":[0.99913543,0.00008508583,0.000095007665,0.0006173902,0.000041600266,0.000025483883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016931175,0.000081754784,0.000115942974,0.000058972822,0.000114211434,0.00003532634,0.0010943896,0.00003397547,0.0000052671558],"category_scores_gemma":[0.000014203892,0.000057411326,0.00010306231,0.0007997203,0.00006626483,0.00012897911,0.0002557133,0.00008123028,0.000006759581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.82803e-7,0.00006801966,0.0047441935,0.0000061079,0.0000039742054,0.0000018502319,0.000044871187,0.000008122217,0.0012402491,0.99118894,0.0018020711,0.00089082966],"study_design_scores_gemma":[0.00044087856,0.000052402967,0.074314035,0.000027168377,0.0000074000636,0.0000088321885,0.000014703556,0.0013306077,0.03370021,0.8786252,0.011302058,0.00017646591],"about_ca_topic_score_codex":0.00004947462,"about_ca_topic_score_gemma":0.0000011867567,"teacher_disagreement_score":0.11256369,"about_ca_system_score_codex":0.000018761184,"about_ca_system_score_gemma":0.000022348717,"threshold_uncertainty_score":0.2341166},"labels":[],"label_agreement":null},{"id":"W2052564373","doi":"10.1142/s179304210700081x","title":"A POLYNOMIAL ANALOGUE TO THE STERN SEQUENCE","year":2007,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stern; Mathematics; Sequence (biology); Stirling number; Polynomial; Stirling numbers of the first kind; Stirling numbers of the second kind; Chebyshev polynomials; Mathematical proof; Simple (philosophy); Generating function; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.017536288150535276,"score_gpt":0.30942672289841205,"score_spread":0.2918904347478768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052564373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1613082,0.00007920645,0.8208603,0.006721915,0.0041353786,0.00007783604,0.000031718155,0.00004269918,0.006742697],"genre_scores_gemma":[0.98708296,0.0000059035915,0.006810161,0.00453269,0.0011009235,0.000001109529,0.0000016590426,0.000008018128,0.00045659684],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985513,0.00009812951,0.0004168566,0.00013540487,0.0005987815,0.00019953474],"domain_scores_gemma":[0.9983756,0.0006401607,0.00027442595,0.00026239903,0.0003265547,0.00012086492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025647148,0.00010233808,0.00011897467,0.00014103619,0.000056917364,0.0001811993,0.0027069529,0.00003584698,0.00030796035],"category_scores_gemma":[0.00021704836,0.00006674889,0.000132341,0.00018031712,0.000054899327,0.00045254652,0.00028218687,0.00020895417,0.0002363218],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054675445,0.00023094972,0.0024624062,0.0000036686238,0.00046921213,0.0015444368,0.005520459,0.0002720707,0.0062900484,0.2626161,0.09350816,0.6265357],"study_design_scores_gemma":[0.0019986983,0.00035574194,0.030406987,0.00038160358,0.000043445358,0.011960178,0.0014147973,0.0019269154,0.011691629,0.14153409,0.79749554,0.0007903482],"about_ca_topic_score_codex":0.000012366967,"about_ca_topic_score_gemma":0.000012184191,"teacher_disagreement_score":0.8257747,"about_ca_system_score_codex":0.000100591664,"about_ca_system_score_gemma":0.00008063812,"threshold_uncertainty_score":0.50302374},"labels":[],"label_agreement":null},{"id":"W2052579883","doi":"10.4171/ggd/221","title":"From automatic structures to automatic groups","year":2014,"lang":"en","type":"preprint","venue":"Groups Geometry and Dynamics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Royal Society Te Apārangi; Royal Society; Marsden Fund; National Science Foundation","keywords":"Cayley graph; Decidability; Graph; Voltage graph; Mathematics; Invariant (physics); Computer science; Nilpotent group; Discrete mathematics; Nilpotent; Combinatorics; Line graph","score_opus":0.007822427442506628,"score_gpt":0.23113212779522774,"score_spread":0.2233097003527211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052579883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5124172,0.00033471195,0.4835148,0.00047978017,0.0017425489,0.00036557677,0.00014069966,0.0008305129,0.00017419092],"genre_scores_gemma":[0.86667365,0.000035281053,0.13086508,0.0013327447,0.0005686184,0.00007018686,0.00030325152,0.00006762433,0.0000835775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956857,0.00026190918,0.000873799,0.0016566702,0.00071417686,0.00080776546],"domain_scores_gemma":[0.9957216,0.00066078233,0.00046898526,0.002529534,0.000090146605,0.0005289816],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00079400255,0.00085833843,0.001133601,0.0007525581,0.00029276966,0.0012061207,0.0028471889,0.00069314055,0.00010178145],"category_scores_gemma":[0.00022550816,0.00080221845,0.00025996764,0.0007467657,0.00013630168,0.00038561077,0.004875756,0.000966137,0.00012649652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014568983,0.00019350169,0.0014400135,0.0014015619,0.00046214368,0.000111931266,0.0041408795,0.005730763,0.000084062194,0.33440363,0.0019562512,0.65006065],"study_design_scores_gemma":[0.000237527,0.000071732306,0.011562672,0.00022899504,0.000055213604,0.000029034034,0.0001232458,0.6661531,0.000014226575,0.32070372,0.0001077764,0.0007127804],"about_ca_topic_score_codex":0.00026201922,"about_ca_topic_score_gemma":0.000051562416,"teacher_disagreement_score":0.6604223,"about_ca_system_score_codex":0.00022195671,"about_ca_system_score_gemma":0.00009808946,"threshold_uncertainty_score":0.9998307},"labels":[],"label_agreement":null},{"id":"W2052869910","doi":"10.1016/j.disc.2014.12.010","title":"Maximal bifix decoding","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Università degli Studi di Salerno; Agence Nationale de la Recherche","keywords":"Mathematics; Decoding methods; Generalization; Class (philosophy); Tree (set theory); Combinatorics; Discrete mathematics; Interval (graph theory); Natural number; Algorithm; Computer science; Artificial intelligence","score_opus":0.04140851047828288,"score_gpt":0.26999016780454593,"score_spread":0.22858165732626307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052869910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046695225,0.00011173018,0.92340386,0.0004671204,0.00029796406,0.00009900363,0.0000026535001,0.00037917285,0.028543252],"genre_scores_gemma":[0.5548227,0.0000042715606,0.44421273,0.00024372876,0.00008424392,0.000010261293,0.0000029447729,0.000019084031,0.0006000095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990471,0.000024698862,0.00021062685,0.0001973815,0.00027434572,0.00024581855],"domain_scores_gemma":[0.9990665,0.00007940511,0.00008296027,0.00058158487,0.000041386236,0.00014820954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004752888,0.00012324935,0.0001580914,0.000059923233,0.00005784999,0.00020031432,0.0007686439,0.000040829724,0.000017351294],"category_scores_gemma":[0.00010925369,0.00009817124,0.000057889603,0.00020078226,0.00003362778,0.00035166653,0.00029859215,0.00007414736,0.00033891556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013263342,0.00004583789,0.00006505791,0.000032175052,0.0000126790965,0.00002298341,0.0037398164,0.00002534317,0.0002652416,0.9867445,0.002676247,0.0063687526],"study_design_scores_gemma":[0.00032664737,0.000055385535,0.00004655733,0.000057918318,0.000009626758,0.00007691492,0.00084569183,0.5178431,0.0022312878,0.4747143,0.0034863667,0.00030614538],"about_ca_topic_score_codex":0.0000030243843,"about_ca_topic_score_gemma":6.3061077e-7,"teacher_disagreement_score":0.5178178,"about_ca_system_score_codex":0.000028042557,"about_ca_system_score_gemma":0.000037561535,"threshold_uncertainty_score":0.4356187},"labels":[],"label_agreement":null},{"id":"W2053528079","doi":"10.1016/s0024-3795(99)00229-3","title":"On transitive linear semigroups","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Prince Edward Island","funders":"","keywords":"Transitive relation; Mathematics; Transitive reduction; Class (philosophy); Pure mathematics; Special classes of semigroups; Vector space; Transitive closure; Semigroup; Discrete mathematics; Combinatorics; Computer science","score_opus":0.00748363400812683,"score_gpt":0.2303781849741506,"score_spread":0.22289455096602379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053528079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3497328,0.0011678071,0.613738,0.0053985645,0.000091755195,0.0011119425,0.000084199564,0.0010160059,0.027658958],"genre_scores_gemma":[0.98681533,0.00030552913,0.007681992,0.0026052734,0.00022872233,0.00016265026,0.000026123786,0.00001921264,0.0021551442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909747,0.000028882605,0.00016232452,0.0003814556,0.00013244005,0.0001974452],"domain_scores_gemma":[0.9992929,0.00013750921,0.000029365401,0.00039300835,0.000032784377,0.0001144486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010738715,0.00013321872,0.00012468737,0.00005070573,0.000211341,0.000051614512,0.00036395196,0.00006468066,0.0002111345],"category_scores_gemma":[0.0000062555864,0.000117753065,0.000047464855,0.00030273525,0.0000364285,0.0002077921,0.000032820994,0.0001328819,0.0007356719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007146412,0.00012528623,0.000004415642,0.000009689663,0.000015130477,0.000002392746,0.00055540266,0.000070057205,0.0011208635,0.8527012,0.00044724674,0.14494121],"study_design_scores_gemma":[0.0013576833,0.00038452045,0.0017425243,0.00007677794,0.00004517149,0.000080835394,0.000108063316,0.54359317,0.017954057,0.14358377,0.2900255,0.0010479551],"about_ca_topic_score_codex":0.000004207033,"about_ca_topic_score_gemma":9.934455e-7,"teacher_disagreement_score":0.7091174,"about_ca_system_score_codex":0.000008464556,"about_ca_system_score_gemma":0.000017396253,"threshold_uncertainty_score":0.945582},"labels":[],"label_agreement":null},{"id":"W2053695139","doi":"10.1016/j.tcs.2008.08.039","title":"Long binary patterns are Abelian 2-avoidable","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Abelian group; Binary number; Mathematics; Combinatorics; Arithmetic","score_opus":0.012199145243238898,"score_gpt":0.2253280155162436,"score_spread":0.2131288702730047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053695139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34773287,0.00004584915,0.64925945,0.0008067181,0.00058356946,0.000111075824,0.000002065069,0.00040921883,0.0010492102],"genre_scores_gemma":[0.95542777,0.000018048271,0.042863432,0.0014443004,0.00017697932,0.000008506238,8.682394e-7,0.000013251113,0.000046848636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967954,0.0001230346,0.00031398179,0.0009774995,0.0008912217,0.00089885603],"domain_scores_gemma":[0.9977271,0.00021325456,0.00010598886,0.0013698596,0.0001593068,0.0004244705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010890703,0.0002610859,0.00028133116,0.000261165,0.00096607284,0.0003651164,0.0039783223,0.00006922598,0.00010022792],"category_scores_gemma":[0.00005166983,0.0002124203,0.00009890709,0.0013910726,0.0025810627,0.0011828581,0.0017585034,0.00026671923,0.0003381007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055131813,0.00014281552,0.0041785534,0.000013153628,0.0000050734743,0.0004413783,0.0005675992,0.00016040413,0.0005369695,0.97953284,0.00030089178,0.014114829],"study_design_scores_gemma":[0.0005443452,0.000408305,0.10319013,0.00014792565,0.0000062469653,0.0009111988,0.00002441815,0.7904336,0.009453232,0.09378197,0.0002620273,0.00083661237],"about_ca_topic_score_codex":0.000008452433,"about_ca_topic_score_gemma":7.720811e-7,"teacher_disagreement_score":0.88575083,"about_ca_system_score_codex":0.00007210369,"about_ca_system_score_gemma":0.00014082355,"threshold_uncertainty_score":0.9510034},"labels":[],"label_agreement":null},{"id":"W2054220885","doi":"10.1016/j.tcs.2007.04.015","title":"State complexity of combined operations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"State (computer science); Intersection (aeronautics); Combined operations; Star (game theory); Computer science; Theoretical computer science; Computational complexity theory; Mathematics; Algorithm; Engineering; Political science","score_opus":0.018968664395800354,"score_gpt":0.26799451307674566,"score_spread":0.2490258486809453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054220885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19675387,0.000009147967,0.8000614,0.00041988766,0.00034958727,0.00010719646,0.0000021381347,0.00015583952,0.0021409052],"genre_scores_gemma":[0.76299536,0.0000010423154,0.23661594,0.0003457542,0.00002954592,0.0000010057207,6.294954e-7,0.0000040170644,0.000006706471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791265,0.000069004054,0.0003924806,0.0004758928,0.00062222726,0.0005277745],"domain_scores_gemma":[0.99833775,0.0002449325,0.00005867234,0.00086914975,0.00024654294,0.00024296036],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030492335,0.00014176258,0.00021364058,0.00020388541,0.00032040596,0.00019881841,0.0025008835,0.000029596129,0.000041224685],"category_scores_gemma":[0.00006453324,0.00011566416,0.000060123974,0.0012609392,0.005257633,0.00060713536,0.0009846165,0.00013591352,0.000039404604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007947692,0.000082493214,0.000045087923,0.000004007342,0.0000027379306,0.000006588264,0.000432065,0.0001687269,0.0035100644,0.9760783,0.000012663968,0.01964937],"study_design_scores_gemma":[0.00022357581,0.00020100732,0.0046849037,0.000015804757,0.000001736867,0.000016522868,0.0000073263886,0.4982521,0.040576465,0.4558494,0.000018815046,0.00015231324],"about_ca_topic_score_codex":0.00001057412,"about_ca_topic_score_gemma":0.0000034482446,"teacher_disagreement_score":0.5662415,"about_ca_system_score_codex":0.00003669326,"about_ca_system_score_gemma":0.00010320257,"threshold_uncertainty_score":0.99744946},"labels":[],"label_agreement":null},{"id":"W2055930907","doi":"10.1142/s0129054112400503","title":"CHANNEL SYNTHESIS FOR FINITE TRANSDUCERS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Undecidable problem; Transducer; Communication source; Computer science; Channel (broadcasting); Encoder; Encoding (memory); ENCODE; Binary number; Relation (database); Algorithm; Topology (electrical circuits); Theoretical computer science; Decidability; Acoustics; Mathematics; Telecommunications; Physics; Arithmetic; Artificial intelligence","score_opus":0.02610543362871547,"score_gpt":0.2999545621229074,"score_spread":0.2738491284941919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055930907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022015626,0.00006159761,0.9721703,0.0017219699,0.00380723,0.000062076295,0.0000063853918,0.000015993484,0.00013883042],"genre_scores_gemma":[0.8023758,0.000012080646,0.19704814,0.00016170554,0.00038769006,0.0000034932254,4.9366326e-7,0.000003396697,0.000007190026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847853,0.000027983184,0.00044936463,0.00013283893,0.00069525663,0.0002160462],"domain_scores_gemma":[0.99749625,0.00063662755,0.00042851092,0.00022494086,0.0010961316,0.0001175385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015737497,0.00008637951,0.0001517731,0.0005479519,0.00011074746,0.0002025195,0.002671693,0.000022279888,0.00001203589],"category_scores_gemma":[0.00025496312,0.0000745925,0.0001482446,0.00038782306,0.00021866836,0.0028897428,0.00014510883,0.00006566791,0.0000050738217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060749786,0.0007811263,0.00057231,0.000026518604,0.00025154292,0.0000061007136,0.0053610443,0.013126247,0.0094544,0.40418786,0.0010151396,0.56515694],"study_design_scores_gemma":[0.0015430872,0.0004851968,0.014338878,0.00037748183,0.00006013518,0.00047378286,0.0001482175,0.8144838,0.10186805,0.053375166,0.012258522,0.0005876617],"about_ca_topic_score_codex":0.000002739365,"about_ca_topic_score_gemma":2.735501e-7,"teacher_disagreement_score":0.80135757,"about_ca_system_score_codex":0.00007307856,"about_ca_system_score_gemma":0.00024506846,"threshold_uncertainty_score":0.49647146},"labels":[],"label_agreement":null},{"id":"W2056533610","doi":"10.1016/j.aam.2014.10.006","title":"Some properties of a Rudin–Shapiro-like sequence","year":2014,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Combinatorics; Sequence (biology); Generating function; Function (biology); Mathematics; Binary number; Arithmetic; Mathematical analysis; Bounded function; Chemistry; Biology","score_opus":0.03021710125596875,"score_gpt":0.2654711575106826,"score_spread":0.23525405625471388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056533610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043833695,0.01654345,0.9261746,0.0003195023,0.0014461706,0.0017625886,0.000022860715,0.0007146375,0.009182515],"genre_scores_gemma":[0.65105635,0.0012591386,0.34706149,0.00019492209,0.00012597122,0.00021425454,0.000003913036,0.000032942306,0.000051002324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773663,0.0000301515,0.0007858523,0.0006109163,0.00046425773,0.00037216232],"domain_scores_gemma":[0.99746025,0.00022250542,0.00066816824,0.0015427041,0.00004599169,0.00006038248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006252821,0.0003818792,0.0007685331,0.00023977915,0.000043463766,0.00008245518,0.0023140917,0.00020735306,0.0000028028317],"category_scores_gemma":[0.000095671676,0.0003188185,0.000102902966,0.0002592147,0.0002350265,0.0002839322,0.0019216626,0.000437118,0.000030282268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000458829,0.00014347567,0.000006603568,0.0033231045,0.000012940372,0.0000041890057,0.0015809626,0.003501743,0.004783002,0.970995,0.000021926513,0.015622465],"study_design_scores_gemma":[0.00019540463,0.000019228752,0.000003228176,0.0011367421,0.000009065213,0.000006900278,0.000110116234,0.082007356,0.013818183,0.9014482,0.00084958435,0.00039600945],"about_ca_topic_score_codex":0.000005746062,"about_ca_topic_score_gemma":0.0000031783495,"teacher_disagreement_score":0.6072227,"about_ca_system_score_codex":0.000093870614,"about_ca_system_score_gemma":0.0001530242,"threshold_uncertainty_score":0.9999264},"labels":[],"label_agreement":null},{"id":"W2057158872","doi":"10.1016/j.jda.2012.04.015","title":"Cool-lex order and k-ary Catalan structures","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Victoria; University of Manitoba","funders":"","keywords":"Catalan number; Combinatorics; Lexicographical order; Mathematics; Complement (music); Order (exchange); Precomputation; Binary tree; Sequence (biology); Discrete mathematics; Algorithm; Computer science","score_opus":0.009989566069584637,"score_gpt":0.24947602503031416,"score_spread":0.2394864589607295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057158872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49957383,0.01678923,0.47595897,0.002033303,0.0035414412,0.00018419814,0.000026407684,0.00011588056,0.0017767316],"genre_scores_gemma":[0.9158961,0.00014212013,0.08264777,0.00046393348,0.0007258674,7.5395644e-7,0.000002003048,0.000012994389,0.00010844164],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989598,0.000059378617,0.0002902506,0.00011310502,0.00029539835,0.00028209214],"domain_scores_gemma":[0.9990754,0.00007698145,0.00023952396,0.00023531944,0.00008621712,0.00028654933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004608349,0.00012982047,0.00021103825,0.00010250843,0.00008272307,0.00012831074,0.0004986039,0.000053058207,0.000037095462],"category_scores_gemma":[0.00005529296,0.00008920331,0.00006559188,0.00018006214,0.000061829036,0.0011762806,0.0001802679,0.00020230093,0.0000050423964],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013071753,0.00033270792,0.015008277,0.00013265832,0.0006469358,0.00036160267,0.014026135,0.00010945477,0.0073982035,0.15044148,0.026246617,0.7851652],"study_design_scores_gemma":[0.010045601,0.00228288,0.5909029,0.0004978566,0.0003969978,0.019171752,0.0034823744,0.07578347,0.024965638,0.14756182,0.121639654,0.0032690463],"about_ca_topic_score_codex":0.0000126729765,"about_ca_topic_score_gemma":5.6699594e-7,"teacher_disagreement_score":0.7818962,"about_ca_system_score_codex":0.00001783541,"about_ca_system_score_gemma":0.00004749183,"threshold_uncertainty_score":0.36376056},"labels":[],"label_agreement":null},{"id":"W2057559629","doi":"10.1006/jcss.2002.1855","title":"Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Deterministic context-free grammar; Embedded pushdown automaton; Deterministic pushdown automaton; Unary operation; Pushdown automaton; Mathematics; Discrete mathematics; Deterministic finite automaton; Nested word; Context-free language; Context-free grammar; Combinatorics; Quantum finite automata; Nondeterministic finite automaton; Automata theory; Finite-state machine; Computer science; Automaton; Rule-based machine translation; Algorithm; Tree-adjoining grammar; Theoretical computer science; Artificial intelligence","score_opus":0.031997160919846224,"score_gpt":0.21991453948585216,"score_spread":0.18791737856600593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057559629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.746488,0.008745558,0.23661552,0.00452645,0.0023266922,0.00017669125,0.000010667445,0.00010969795,0.0010007718],"genre_scores_gemma":[0.95354176,0.00012543291,0.045746874,0.00032183327,0.00020949314,9.321118e-7,1.8056768e-7,0.000004554314,0.00004893577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810356,0.0001840741,0.0004913705,0.0003485882,0.00058494764,0.00028747675],"domain_scores_gemma":[0.99879664,0.00024018077,0.00032658814,0.00027139345,0.00011631954,0.0002489006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015932466,0.00019160754,0.000394347,0.00022991256,0.00049423095,0.0009493258,0.0009083036,0.000058785383,0.000007608391],"category_scores_gemma":[0.000018205254,0.00013771401,0.00007146029,0.00026730882,0.0007680142,0.0014173042,0.0005081228,0.00016056641,0.000002610309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054432687,0.00027947046,0.013689396,0.00032781984,0.00013082555,0.0004973299,0.0038438002,0.00008162112,0.00027378366,0.8133156,0.024477845,0.14302811],"study_design_scores_gemma":[0.0019211159,0.0016582038,0.046225708,0.0006342327,0.000031021875,0.012229454,0.00082846323,0.8940174,0.000024638795,0.037977234,0.003946462,0.0005060409],"about_ca_topic_score_codex":0.000023653514,"about_ca_topic_score_gemma":0.0000055487503,"teacher_disagreement_score":0.8939358,"about_ca_system_score_codex":0.00003093233,"about_ca_system_score_gemma":0.000046366313,"threshold_uncertainty_score":0.9154371},"labels":[],"label_agreement":null},{"id":"W2058703803","doi":"10.1142/s0218196711006169","title":"LIMIT VARIETIES GENERATED BY COMPLETELY 0-SIMPLE SEMIGROUPS","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Limit (mathematics); Semigroup; Simple (philosophy); Abelian group; Variety (cybernetics); Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.024250728931586245,"score_gpt":0.24278746655137284,"score_spread":0.2185367376197866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058703803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38317275,0.0003167592,0.615191,0.00035545285,0.0005408568,0.000028706958,0.0000037161726,0.000032727392,0.00035807208],"genre_scores_gemma":[0.9813482,0.000064097505,0.017798377,0.0006199143,0.00012620712,9.692287e-7,0.000011569227,0.0000068975583,0.000023729606],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892634,0.000065684726,0.00038216406,0.0001427593,0.00036748886,0.00011553343],"domain_scores_gemma":[0.9990091,0.00008666966,0.00033133803,0.000078025034,0.00041581405,0.000079094294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027176717,0.00010817142,0.00014501534,0.00015047214,0.00006192189,0.00019315236,0.00058158656,0.000042527736,0.00003300722],"category_scores_gemma":[0.00002313048,0.00009484461,0.000060063023,0.00010860581,0.000046676945,0.0007181111,0.000117151474,0.00011615239,0.0000075221596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025352073,0.00064794446,0.005132785,0.000021693368,0.0008024128,0.0002846533,0.011368748,0.00056439586,0.017360419,0.4595378,0.034599826,0.4694258],"study_design_scores_gemma":[0.0029846765,0.0011008111,0.039042987,0.00009953245,0.000056272915,0.0019167858,0.0006245541,0.26287928,0.022020508,0.66143227,0.0071289763,0.0007133531],"about_ca_topic_score_codex":0.000025027492,"about_ca_topic_score_gemma":0.0000013523072,"teacher_disagreement_score":0.59817547,"about_ca_system_score_codex":0.000028553935,"about_ca_system_score_gemma":0.00003805663,"threshold_uncertainty_score":0.3867651},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00849638401482924,"score_gpt":0.28992859198748816,"score_spread":0.28143220797265894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060731856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46630555,0.000073713905,0.5319072,0.0008839816,0.0007262428,0.000030032947,0.0000040470754,0.0000064287187,0.00006278723],"genre_scores_gemma":[0.9062451,0.00004114415,0.09348793,0.00014935902,0.000068445974,5.575228e-7,7.6961356e-7,0.0000026937387,0.000003975176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981932,0.000032219887,0.00058718846,0.00018425762,0.00085201144,0.00015109137],"domain_scores_gemma":[0.9979435,0.00038563806,0.0005596354,0.00019328002,0.0008506482,0.00006725573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009125499,0.00009066392,0.00017295712,0.0008470195,0.00007024715,0.00013429788,0.0015664581,0.000027631968,0.000009469271],"category_scores_gemma":[0.00022246418,0.00008388985,0.00006165041,0.00066922745,0.00035501667,0.0018382312,0.00031736912,0.00014926655,0.000001923909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012713547,0.0013499323,0.00953675,0.00003283526,0.000115116716,0.00022947376,0.0066667963,0.32770982,0.022568932,0.53186476,0.000059897022,0.09973857],"study_design_scores_gemma":[0.005008093,0.0012339104,0.17450328,0.0012390807,0.000016007427,0.0013635413,0.00036744183,0.6573185,0.012566671,0.14406927,0.0017511827,0.00056302245],"about_ca_topic_score_codex":0.00002234677,"about_ca_topic_score_gemma":0.0000064905475,"teacher_disagreement_score":0.43993956,"about_ca_system_score_codex":0.000105307685,"about_ca_system_score_gemma":0.00046853372,"threshold_uncertainty_score":0.34209287},"labels":[],"label_agreement":null},{"id":"W2061015906","doi":"10.1142/s0129054102001461","title":"SHUFFLE DECOMPOSITIONS OF REGULAR 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":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Prince Edward Island","funders":"","keywords":"Undecidable problem; Closure (psychology); Regular language; Equivalence (formal languages); Quotient; Decomposition; Mathematics; Context-free language; Abstract family of languages; Discrete mathematics; Context (archaeology); Computer science; Combinatorics; Decidability; Theoretical computer science; Automaton; Programming language; Rule-based machine translation; Natural language processing","score_opus":0.013496929104036635,"score_gpt":0.2898611299835407,"score_spread":0.27636420087950403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061015906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11265409,0.00015296497,0.8834867,0.0016559515,0.0010434181,0.00003516528,0.0000042243414,0.000016180045,0.0009512967],"genre_scores_gemma":[0.76315296,0.000024344836,0.23660149,0.0000875176,0.00010786611,4.5364266e-7,5.4913005e-7,0.0000023018288,0.000022546366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829316,0.000036048255,0.00054068945,0.00014584245,0.00086286647,0.00012138142],"domain_scores_gemma":[0.9975571,0.00016214684,0.00058385084,0.00032316742,0.001304204,0.00006954689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061135716,0.00007598498,0.00015925485,0.0006139447,0.000081679245,0.00015791281,0.0028619883,0.000020185153,0.00006590666],"category_scores_gemma":[0.00007585286,0.000067413675,0.00011616786,0.0005656933,0.0003546831,0.0015832332,0.00029006612,0.00008285399,0.000008938781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011138674,0.00080944615,0.000953524,0.00001483048,0.00016163728,0.000050667055,0.002602369,0.005843768,0.051758323,0.5976181,0.0021874206,0.3379888],"study_design_scores_gemma":[0.0018166581,0.000833056,0.027947081,0.0005755881,0.00004147326,0.0017470288,0.00017598724,0.76959693,0.13013537,0.06140414,0.00523096,0.00049569894],"about_ca_topic_score_codex":0.0000074394625,"about_ca_topic_score_gemma":8.648648e-7,"teacher_disagreement_score":0.7637532,"about_ca_system_score_codex":0.000052047802,"about_ca_system_score_gemma":0.00009781468,"threshold_uncertainty_score":0.5318334},"labels":[],"label_agreement":null},{"id":"W2061212999","doi":"10.4204/eptcs.31.17","title":"Operational State Complexity of Deterministic Unranked Tree Automata","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Tree (set theory); Tree automaton; Intersection (aeronautics); String (physics); State (computer science); Upper and lower bounds; Regular language; Time complexity","score_opus":0.00859781140142239,"score_gpt":0.2449642404551377,"score_spread":0.23636642905371533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061212999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6318951,0.000014461846,0.36354664,0.00084073696,0.0004088162,0.00024699725,0.000002607625,0.0002242972,0.002820351],"genre_scores_gemma":[0.92921597,0.000003832606,0.07042558,0.00025890436,0.00006409037,0.000014353825,9.0109944e-7,0.0000103312195,0.0000060644643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967659,0.000029447667,0.000525453,0.0008613959,0.0008184655,0.0009993209],"domain_scores_gemma":[0.9986825,0.00019111685,0.00015276458,0.0005077517,0.00027426105,0.00019162688],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026403116,0.00024487163,0.0003282412,0.0003436772,0.0002495948,0.00038890942,0.0037393803,0.000072093484,0.000036106027],"category_scores_gemma":[0.00023178787,0.00021244453,0.00006752757,0.0015453761,0.00434154,0.0010787777,0.0009827763,0.0006229508,0.000015523881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012598402,0.00011612828,0.00017912217,0.000013389126,0.0000032456965,0.0000034195837,0.00039612167,0.0000096144195,0.020330263,0.9580761,0.000012371782,0.02084763],"study_design_scores_gemma":[0.00030758075,0.00021078711,0.0033373497,0.000019869009,0.00000181936,0.00006431004,0.00000345079,0.4972716,0.017069433,0.4815019,0.000036562516,0.00017533684],"about_ca_topic_score_codex":0.0000059832996,"about_ca_topic_score_gemma":0.000009909456,"teacher_disagreement_score":0.49726197,"about_ca_system_score_codex":0.000102365935,"about_ca_system_score_gemma":0.00051580847,"threshold_uncertainty_score":0.9983681},"labels":[],"label_agreement":null},{"id":"W2061265323","doi":"10.1016/j.tcs.2009.01.004","title":"Nondeterministic state complexity of nested word automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Nested word; Word (group theory); Discrete mathematics; Deterministic finite automaton; Intersection (aeronautics); Mathematics; Upper and lower bounds; Combinatorics; Automaton; Finite-state machine; Automata theory; Computer science; Quantum finite automata; Theoretical computer science; Algorithm","score_opus":0.01999266988656173,"score_gpt":0.26671292319203743,"score_spread":0.2467202533054757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061265323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16453011,0.000014486244,0.83140564,0.0009713907,0.00037594084,0.00015060087,0.000004199971,0.0003976738,0.0021499305],"genre_scores_gemma":[0.85175496,0.0000022985241,0.14745915,0.0007244733,0.000043153967,0.0000015594211,8.9317933e-7,0.000005467889,0.00000803866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712074,0.00013823641,0.00048177192,0.0007484919,0.0008336797,0.00067706686],"domain_scores_gemma":[0.9976262,0.00026125737,0.00016090144,0.0014561219,0.00019103845,0.00030451067],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015019388,0.00023847804,0.00036806575,0.0002392499,0.00027263572,0.00032584523,0.0039931987,0.000044653087,0.00003269198],"category_scores_gemma":[0.000088735884,0.00019584961,0.00009173799,0.0014824254,0.0045460337,0.0007285162,0.0008587042,0.00018059683,0.00005496908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009147183,0.00011092662,0.000011619952,0.0000064554947,0.0000021338305,0.00001996737,0.00029488516,0.00004146715,0.0017524516,0.8395352,0.000024687923,0.1581911],"study_design_scores_gemma":[0.00021114969,0.00030251857,0.006593481,0.00003476009,0.0000028949205,0.000047610756,0.0000024099381,0.48172045,0.0053657433,0.5055069,0.000025955555,0.00018616942],"about_ca_topic_score_codex":0.0000029817622,"about_ca_topic_score_gemma":2.7096425e-7,"teacher_disagreement_score":0.68722486,"about_ca_system_score_codex":0.000041950472,"about_ca_system_score_gemma":0.00015486559,"threshold_uncertainty_score":0.99816304},"labels":[],"label_agreement":null},{"id":"W2061476943","doi":"10.1016/j.ipl.2005.05.029","title":"Periodic and Sturmian languages","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Bounded function; Mathematics; Complexity class; Discrete mathematics; Function (biology); Regular language; Computational complexity theory; Combinatorics; Formal language; Time complexity; Computer science; Theoretical computer science; Algorithm","score_opus":0.0027857875453301253,"score_gpt":0.1951722247371072,"score_spread":0.1923864371917771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061476943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48055187,0.00022889108,0.5084435,0.0063193757,0.0000829063,0.00007153922,0.0000013649312,0.00041224487,0.003888361],"genre_scores_gemma":[0.9839853,0.0000011056461,0.010192209,0.0057517155,0.000036540885,0.0000044767244,0.0000065625613,0.0000021626506,0.000019926489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995495,0.000008800157,0.0001377704,0.00006878027,0.00012004063,0.00011508854],"domain_scores_gemma":[0.99976915,0.000010903328,0.000074980584,0.000105277846,0.000019148845,0.000020561249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109317494,0.00006296661,0.000051391606,0.000083786384,0.00013063765,0.00057416863,0.00017510555,0.000019927125,0.0000025677436],"category_scores_gemma":[0.0000066295815,0.000054417273,0.0000114603545,0.00012337613,0.00003597974,0.0027514892,0.000045875768,0.000047445392,0.00002602073],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036774074,0.00001756079,0.002476579,0.0001894933,0.0000054963375,0.000009707541,0.008272735,0.00027521918,0.0065606167,0.031665273,0.009910366,0.94061327],"study_design_scores_gemma":[0.0036903261,0.00013326682,0.28714046,0.0005660541,0.000035106885,0.0006536842,0.004435701,0.4216867,0.021176765,0.01409297,0.24382919,0.0025597613],"about_ca_topic_score_codex":0.000021763128,"about_ca_topic_score_gemma":9.671189e-7,"teacher_disagreement_score":0.9380535,"about_ca_system_score_codex":0.000012484237,"about_ca_system_score_gemma":0.000013993628,"threshold_uncertainty_score":0.55367213},"labels":[],"label_agreement":null},{"id":"W2061477093","doi":"10.1007/s00233-013-9483-x","title":"On commutation semigroups of dihedral groups","year":2013,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; Dalhousie University","funders":"","keywords":"Mathematics; Commutation; Semigroup; Dihedral group; Mathematical proof; Order (exchange); Group (periodic table); Combinatorics; Pure mathematics; Algebra over a field; Discrete mathematics; Geometry; Physics; Quantum mechanics","score_opus":0.004984641046770753,"score_gpt":0.20453359973385857,"score_spread":0.1995489586870878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061477093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80157125,0.00026132452,0.1820723,0.002796853,0.0007658987,0.0006280107,0.0000137648385,0.0006110021,0.0112796165],"genre_scores_gemma":[0.9910574,0.000014594642,0.006818045,0.0015699003,0.00005813497,0.00006709696,0.000024360439,0.000028505756,0.00036196157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778825,0.00012225403,0.000508771,0.0004823964,0.00049698836,0.0006013583],"domain_scores_gemma":[0.9979282,0.00040475838,0.00026369546,0.0011276832,0.00011624109,0.00015940887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003514234,0.00029113548,0.00035176738,0.00021583744,0.00016820955,0.00015416423,0.0013692996,0.00014214574,0.00018869551],"category_scores_gemma":[0.00007477965,0.00025376515,0.00018574696,0.000518279,0.000114329756,0.0011695063,0.00038701665,0.00025257876,0.00055513676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014275366,0.00026856433,0.0017351337,0.000051563104,0.00004198995,0.0000074999175,0.0009925027,0.00013586538,0.012932207,0.9151765,0.02293749,0.04570638],"study_design_scores_gemma":[0.0021810348,0.0012997242,0.027542638,0.00030506347,0.000034578494,0.00008077898,0.0013766296,0.1307167,0.03767392,0.79474336,0.002768961,0.0012766045],"about_ca_topic_score_codex":0.00021219908,"about_ca_topic_score_gemma":0.000017600449,"teacher_disagreement_score":0.18948618,"about_ca_system_score_codex":0.000064139764,"about_ca_system_score_gemma":0.000030633517,"threshold_uncertainty_score":0.9999915},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014411216565540718,"score_gpt":0.25365818394005857,"score_spread":0.23924696737451784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062377295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04719476,0.00021967187,0.9453818,0.0043379567,0.0021606206,0.000057757043,5.8677733e-7,0.00001112602,0.0006356815],"genre_scores_gemma":[0.9522575,0.00007530387,0.047225412,0.00028620017,0.00013437864,9.165996e-7,1.01906e-7,0.0000019752904,0.000018179953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865174,0.0000699046,0.00037733678,0.00012359413,0.0006575418,0.00011988502],"domain_scores_gemma":[0.9979682,0.0005277852,0.00046447263,0.00027024932,0.0007213804,0.000047931106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020407874,0.00006922822,0.000106710024,0.00018732212,0.0003143021,0.00048475896,0.003371925,0.000013298497,0.000005265541],"category_scores_gemma":[0.00014548094,0.000035566267,0.00007245093,0.0003378291,0.0010172263,0.0010564139,0.000447903,0.00012774636,0.0000029279788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025826332,0.000030460518,0.00028812914,0.0000010192772,0.000047399055,0.0000071015415,0.0028760915,0.00012680661,0.000119746044,0.8155006,0.00014062037,0.1808362],"study_design_scores_gemma":[0.0033543273,0.00028640393,0.03927005,0.00014448061,0.00003061924,0.002138756,0.00023624134,0.40994057,0.0042455094,0.5306881,0.009382836,0.00028209673],"about_ca_topic_score_codex":0.000013898436,"about_ca_topic_score_gemma":0.0000016295913,"teacher_disagreement_score":0.9050628,"about_ca_system_score_codex":0.000030000165,"about_ca_system_score_gemma":0.00020519737,"threshold_uncertainty_score":0.6265932},"labels":[],"label_agreement":null},{"id":"W2062558109","doi":"10.4171/owr/2010/37","title":"Mini-Workshop: Combinatorics on Words","year":2011,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algebraic combinatorics; Combinatorics; Computer science; Mathematics","score_opus":0.03434793924279032,"score_gpt":0.23462574342155315,"score_spread":0.20027780417876284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062558109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48604146,0.00047200115,0.08037023,0.00058926275,0.0070533766,0.00048692618,0.0000019872434,0.0016287555,0.423356],"genre_scores_gemma":[0.99007934,0.00000971077,0.0055658314,0.0004604649,0.00006440304,0.000019916886,0.0000030076942,0.000019334659,0.0037779843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981662,0.000055821558,0.00041087382,0.0005832903,0.00039772072,0.00038609508],"domain_scores_gemma":[0.9979732,0.00008169122,0.00024364491,0.0014771181,0.000056302553,0.00016805786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060082175,0.00020497285,0.00021479983,0.00010990574,0.00012867637,0.00009656143,0.00059167686,0.000112512666,0.00013019421],"category_scores_gemma":[0.00009844027,0.00017938486,0.000108669075,0.00040377365,0.00004886569,0.0003314432,0.00025394448,0.00020224764,0.00012878393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001852084,0.0010648937,0.01181451,0.000029872279,0.000072012495,0.0075886515,0.0046103676,0.000013162613,0.0002783315,0.83903265,0.028952561,0.106524475],"study_design_scores_gemma":[0.0008635039,0.00068573543,0.064986534,0.00024551904,0.000048644324,0.0032233428,0.0003484994,0.0044246507,0.028062936,0.7576286,0.13741812,0.0020638916],"about_ca_topic_score_codex":0.000033547632,"about_ca_topic_score_gemma":0.000002715061,"teacher_disagreement_score":0.5040379,"about_ca_system_score_codex":0.00004658837,"about_ca_system_score_gemma":0.000053213214,"threshold_uncertainty_score":0.7315103},"labels":[],"label_agreement":null},{"id":"W2063737596","doi":"10.1016/j.tcs.2011.12.048","title":"State complexity of the concatenation of regular tree languages","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Regular language; Pumping lemma for regular languages; String (physics); Tree (set theory); Mathematics; Automaton; Combinatorics; State (computer science); Discrete mathematics; Formal language; Time complexity; Finite-state machine; Upper and lower bounds; Computer science; Algorithm; Theoretical computer science","score_opus":0.02546993447421071,"score_gpt":0.24267921759233238,"score_spread":0.21720928311812168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063737596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3355234,0.000021184793,0.6600895,0.00019176997,0.0002073238,0.0001039337,0.0000029254768,0.000056974623,0.003802967],"genre_scores_gemma":[0.9266494,0.0000014111243,0.0732014,0.00012225311,0.000013270113,0.0000013051765,1.9065342e-7,0.000003438728,0.0000073352116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984975,0.00014042645,0.0002831703,0.00030811544,0.0005190862,0.00025173964],"domain_scores_gemma":[0.99858475,0.000102854654,0.00014327111,0.0009026813,0.00019254629,0.00007392839],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012286961,0.00010320665,0.00018061762,0.00008614764,0.00012021052,0.000036594858,0.0028598255,0.000024875428,0.000029635965],"category_scores_gemma":[0.00005942092,0.00006375085,0.00007261916,0.00078320253,0.0062485314,0.0003229742,0.000984444,0.00008600278,0.0000054697753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004767891,0.000050777173,0.00012688035,0.000008479967,0.0000033357057,0.0000012444115,0.0015041406,0.000010911659,0.005134425,0.9719865,0.000008579405,0.02116],"study_design_scores_gemma":[0.0001454599,0.00010808052,0.031209253,0.00003218106,0.0000037392572,0.000010017978,0.000022097274,0.13755997,0.25972563,0.57108486,0.000004647856,0.000094049305],"about_ca_topic_score_codex":0.000022675284,"about_ca_topic_score_gemma":0.0000018125447,"teacher_disagreement_score":0.59112597,"about_ca_system_score_codex":0.00001678177,"about_ca_system_score_gemma":0.000063868385,"threshold_uncertainty_score":0.9964559},"labels":[],"label_agreement":null},{"id":"W2063791259","doi":"10.1016/j.jpaa.2011.02.015","title":"Characterizations of Morita equivalent inverse semigroups","year":2011,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Morita equivalence; Semigroup; Inverse semigroup; Unitary state; Inverse; Pure mathematics; Equivalence (formal languages); Morita therapy; Bicyclic semigroup; Special classes of semigroups; Algebra over a field; Discrete mathematics","score_opus":0.021370342456618542,"score_gpt":0.21771284861544976,"score_spread":0.19634250615883123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063791259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9347177,0.00022026344,0.06120858,0.00021538229,0.0002577685,0.00008131469,0.0000039897277,0.00002519086,0.0032698151],"genre_scores_gemma":[0.9892169,0.00009677423,0.010289618,0.0002456938,0.00010674363,0.0000015022331,8.05386e-7,0.000006439347,0.00003549523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917984,0.000020007288,0.00036293038,0.00011467833,0.0001874711,0.00013509403],"domain_scores_gemma":[0.9992207,0.000033825087,0.00037246762,0.0002045512,0.000065502674,0.00010289566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030025968,0.000097817894,0.00021847077,0.00011698354,0.000046918987,0.00003221271,0.0004411953,0.000049466023,0.000047428017],"category_scores_gemma":[0.000009608254,0.00007638235,0.00006782052,0.00017746336,0.000051237934,0.0003352089,0.00013551618,0.00012841122,0.0000051950037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037288526,0.0002858749,0.0008670378,0.00006244798,0.000106568004,0.00003640955,0.0060017733,0.0000046290893,0.11547972,0.84930044,0.0014726961,0.026345082],"study_design_scores_gemma":[0.0048719486,0.0015107715,0.094953425,0.0005349595,0.00031936227,0.001139961,0.0037218514,0.0035467544,0.32343364,0.55757403,0.006980669,0.0014125872],"about_ca_topic_score_codex":0.0000013507411,"about_ca_topic_score_gemma":6.2504483e-7,"teacher_disagreement_score":0.2917264,"about_ca_system_score_codex":0.000008033228,"about_ca_system_score_gemma":0.000035725676,"threshold_uncertainty_score":0.31147817},"labels":[],"label_agreement":null},{"id":"W2063858816","doi":"10.1142/s021819670400202x","title":"ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia","keywords":"Mathematics; Idempotence; Aperiodic graph; Semigroup; Wreath product; Iterated function; Combinatorics; Pure mathematics; Product (mathematics); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.009276668163932947,"score_gpt":0.2518130665495769,"score_spread":0.24253639838564398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063858816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6330695,0.00025203632,0.36274874,0.0029949828,0.0007684371,0.00003917947,0.0000023838174,0.000033333028,0.00009137031],"genre_scores_gemma":[0.98822474,0.00009474719,0.00856549,0.0028537377,0.00022557269,0.00000133521,0.000006251928,0.0000094058805,0.000018720491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985697,0.000050800387,0.0004530896,0.00021377577,0.0005672601,0.00014536512],"domain_scores_gemma":[0.998929,0.000108744935,0.00036549752,0.000112861846,0.00037371265,0.00011013019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031382218,0.0001496509,0.00017828346,0.0002835784,0.000084272295,0.00034468254,0.0006065567,0.00006149554,0.000015971362],"category_scores_gemma":[0.000043787513,0.00012842883,0.000102353755,0.00018130036,0.000044466007,0.0007405177,0.00009137594,0.00018221162,0.000023805793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031308402,0.0008128884,0.0011577269,0.000023925904,0.00063535664,0.0008117178,0.008374622,0.029873105,0.020939866,0.59327173,0.0041695414,0.33961645],"study_design_scores_gemma":[0.006805506,0.0014269096,0.020671312,0.0005922991,0.00004948848,0.0025417907,0.00033780455,0.10033991,0.025094677,0.8403169,0.0010636118,0.00075980806],"about_ca_topic_score_codex":0.000013374511,"about_ca_topic_score_gemma":0.0000014059358,"teacher_disagreement_score":0.3551552,"about_ca_system_score_codex":0.00009678778,"about_ca_system_score_gemma":0.00008605809,"threshold_uncertainty_score":0.5237176},"labels":[],"label_agreement":null},{"id":"W2064603234","doi":"10.4236/ojdm.2013.31002","title":"Counting Types of Runs in Classes of Arborescent Words","year":2013,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Alphabet; Combinatorics; Word (group theory); Context (archaeology); Type (biology); Root (linguistics); Tree (set theory); Point (geometry); Set (abstract data type); Computer science; Geometry; Biology; Linguistics","score_opus":0.01700377759767581,"score_gpt":0.2718911566169423,"score_spread":0.2548873790192665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064603234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91921496,0.00032027383,0.070286326,0.00059218437,0.00019083747,0.00029663835,0.0000030795572,0.0000074932373,0.009088211],"genre_scores_gemma":[0.8736917,0.00003448068,0.12617765,0.000025945796,0.000017941755,0.0000013708806,1.6227531e-7,0.0000070409633,0.000043696557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867886,0.000039686416,0.000770577,0.00007707423,0.00029654393,0.00013723844],"domain_scores_gemma":[0.9983921,0.00019165318,0.0009125042,0.00029215388,0.00016473948,0.000046866517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008758828,0.000089932364,0.00040091405,0.000110525005,0.000017990827,0.00013086422,0.0014484883,0.000031809715,0.00006735649],"category_scores_gemma":[0.00013328595,0.00006336476,0.00007160869,0.00021624345,0.000049777012,0.0007056844,0.00034582193,0.00011451165,0.0000053230424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057579105,0.0016741201,0.010199805,0.0015805312,0.00036680675,0.00006721201,0.02447677,0.0008732325,0.053542364,0.86304444,0.0024038327,0.04171329],"study_design_scores_gemma":[0.0042454596,0.0017266414,0.031212548,0.011114099,0.00015969806,0.00033036203,0.0135611165,0.22346537,0.11315125,0.59882104,0.0010853625,0.0011270388],"about_ca_topic_score_codex":0.000030400144,"about_ca_topic_score_gemma":0.0000057445045,"teacher_disagreement_score":0.26422343,"about_ca_system_score_codex":0.000013494281,"about_ca_system_score_gemma":0.00007996259,"threshold_uncertainty_score":0.26916757},"labels":[],"label_agreement":null},{"id":"W2065040823","doi":"10.1016/j.ipl.2006.11.008","title":"On the context-freeness of the set of words containing overlaps","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Context (archaeology); Set (abstract data type); Computer science; Theoretical computer science; Algorithm; Mathematics; Programming language; History","score_opus":0.007714664186438252,"score_gpt":0.20165906239308723,"score_spread":0.19394439820664897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065040823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81705785,0.000027987386,0.17326683,0.007326742,0.00018617835,0.0001417929,0.000006191686,0.00006091907,0.0019254967],"genre_scores_gemma":[0.9931129,2.3404256e-7,0.00038547142,0.006463107,0.000018886816,0.0000059987947,0.000002448476,0.0000025684812,0.000008339967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915123,0.000041333842,0.00033523142,0.000060915652,0.00029661198,0.00011466849],"domain_scores_gemma":[0.99901116,0.00015910249,0.00043547212,0.00031627304,0.00006854677,0.000009458524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004054901,0.00007780268,0.000097155724,0.00005687291,0.0001304552,0.00011136146,0.00072794425,0.000025380352,0.000004225625],"category_scores_gemma":[0.000056370587,0.000043658212,0.000047187255,0.00029223703,0.00010591043,0.0010417991,0.00009161472,0.00008537281,0.0000037935167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052763175,0.000038379472,0.0022967332,0.00028397358,0.00002647884,8.7504105e-7,0.021006908,0.007142534,0.008679784,0.7228658,0.010402664,0.22720312],"study_design_scores_gemma":[0.004805098,0.00033216228,0.07859274,0.0037862035,0.000065151835,0.00006921647,0.01064535,0.5074171,0.28886464,0.07851486,0.025398642,0.0015088839],"about_ca_topic_score_codex":0.00005054431,"about_ca_topic_score_gemma":0.0000020225789,"teacher_disagreement_score":0.64435095,"about_ca_system_score_codex":0.00002003622,"about_ca_system_score_gemma":0.00004369545,"threshold_uncertainty_score":0.17803302},"labels":[],"label_agreement":null},{"id":"W2066620717","doi":"10.1016/j.ic.2008.03.018","title":"State complexity of basic language operations combined with reversal","year":2008,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Computer science; Theoretical computer science; Programming language; Algorithm","score_opus":0.016258325271429355,"score_gpt":0.2311490287129097,"score_spread":0.21489070344148037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066620717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4893164,0.00000777783,0.509967,0.00015041146,0.000025458929,0.00007533073,0.0000042309644,0.000060316917,0.0003930109],"genre_scores_gemma":[0.973356,0.00000657996,0.02628871,0.00028121762,0.0000040920427,0.0000033687759,0.000043002907,0.0000016338093,0.000015407408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950826,0.000026616439,0.0001949103,0.000060783546,0.00014088796,0.000068553636],"domain_scores_gemma":[0.9996806,0.00002541674,0.00007821442,0.000100341145,0.0000830298,0.000032393527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009571309,0.000059310954,0.0000840947,0.0000829308,0.00011651736,0.000051478586,0.00009987493,0.000014826395,0.000004475038],"category_scores_gemma":[0.0000069605835,0.000049102597,0.0000124599,0.00018041323,0.000083161925,0.0013916094,0.000036721274,0.000038972375,0.000010605143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024223879,0.0002640479,0.003188106,0.00023624283,0.0000975445,0.000018754565,0.124978095,0.07889218,0.0009974986,0.5077166,0.0019037096,0.281465],"study_design_scores_gemma":[0.0010832625,0.00023738196,0.033810254,0.000021068887,0.0000032289963,0.000060236747,0.00045889575,0.9603531,0.0012294076,0.0024836052,0.00012831583,0.00013125705],"about_ca_topic_score_codex":0.00006149166,"about_ca_topic_score_gemma":0.000010335215,"teacher_disagreement_score":0.8814609,"about_ca_system_score_codex":0.000009605185,"about_ca_system_score_gemma":0.000038754693,"threshold_uncertainty_score":0.20023458},"labels":[],"label_agreement":null},{"id":"W2066849493","doi":"10.1016/j.tcs.2010.11.009","title":"Block insertion and deletion on trajectories","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Block (permutation group theory); Arithmetic; Mathematics; Algorithm; Combinatorics; Computer science","score_opus":0.005196956732381941,"score_gpt":0.21990452062673832,"score_spread":0.21470756389435638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066849493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5770255,0.0000041288677,0.4193518,0.0008918184,0.00071951794,0.00006754393,4.0935575e-7,0.0001983175,0.0017410173],"genre_scores_gemma":[0.9529441,0.0000022416143,0.046194185,0.0007095274,0.00013246003,0.0000036602648,3.5527464e-7,0.0000047297867,0.000008726599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985212,0.000047601596,0.00014832633,0.0005345087,0.0004194476,0.000328902],"domain_scores_gemma":[0.99894285,0.00019263427,0.000037800502,0.00056332175,0.000078158526,0.00018520585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009846534,0.00013299314,0.0001149031,0.00013542037,0.00034465748,0.00042898057,0.0010413296,0.000053222175,0.00001876633],"category_scores_gemma":[0.00007851227,0.00010317984,0.000027522152,0.0005274569,0.0017557208,0.00054423,0.00038783133,0.0002473171,0.00007765981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045527277,0.000030645653,0.000041436582,0.0000021145552,8.6229716e-7,0.000003095619,0.00015232946,0.000008080601,0.013085245,0.9418389,0.0000358479,0.0447969],"study_design_scores_gemma":[0.00026507775,0.00042073804,0.011050617,0.000023647392,0.0000032531584,0.00012336316,0.000005086708,0.51129645,0.034638967,0.4412446,0.00060889265,0.0003192938],"about_ca_topic_score_codex":0.0000013542536,"about_ca_topic_score_gemma":8.924398e-7,"teacher_disagreement_score":0.5112884,"about_ca_system_score_codex":0.000014103212,"about_ca_system_score_gemma":0.00004235019,"threshold_uncertainty_score":0.6469026},"labels":[],"label_agreement":null},{"id":"W2067003407","doi":"10.1142/s1793042110002958","title":"THE TRANSCENDENCE OF SERIES RELATED TO STERN'S DIATOMIC SEQUENCE","year":2010,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stern; Sequence (biology); Transcendence (philosophy); Transcendental number; Mathematics; Series (stratigraphy); Power series; Generating function; Function (biology); Pure mathematics; Combinatorics; Mathematical analysis; Philosophy; Epistemology","score_opus":0.006925113414609191,"score_gpt":0.2767197288227818,"score_spread":0.2697946154081726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067003407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9505919,0.00008510964,0.036345262,0.0050826264,0.005124528,0.00008383805,0.000034808396,0.000039532122,0.0026123507],"genre_scores_gemma":[0.99442,0.000037833634,0.0046533383,0.000267655,0.00011775364,0.0000020483842,6.6858235e-7,0.000007794949,0.0004929032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985997,0.000121210316,0.0004851047,0.0001215697,0.00053023564,0.00014214951],"domain_scores_gemma":[0.9981632,0.00067580835,0.00036406177,0.00029000928,0.00042379933,0.00008309964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001351103,0.00009734607,0.00013518512,0.00007757036,0.00006071557,0.00012608296,0.0025596318,0.00004773309,0.00025534225],"category_scores_gemma":[0.0002826464,0.0000650642,0.0001286514,0.00013673947,0.00015580397,0.00068354997,0.00013650965,0.00031546515,0.000050361752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013447943,0.000050906358,0.00088155625,0.0000028175543,0.00012628392,0.0000821141,0.0017195354,0.00003509754,0.0436093,0.89452124,0.0006348471,0.058201823],"study_design_scores_gemma":[0.00070067623,0.00014332385,0.0074651507,0.000200094,0.000018313493,0.0036209265,0.0004511408,0.0007844921,0.040988747,0.92011607,0.025231475,0.00027960865],"about_ca_topic_score_codex":0.00000447541,"about_ca_topic_score_gemma":0.000006384708,"teacher_disagreement_score":0.057922218,"about_ca_system_score_codex":0.000028979754,"about_ca_system_score_gemma":0.00011294331,"threshold_uncertainty_score":0.47564754},"labels":[],"label_agreement":null},{"id":"W2070037875","doi":"10.1016/j.ejc.2005.11.005","title":"Dejean’s conjecture and Sturmian words","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of Tehran","keywords":"Conjecture; Mathematics; Alphabet; Repetition (rhetorical device); Combinatorics; Word (group theory); Combinatorics on words; Quadratic equation; Discrete mathematics; Geometry; Linguistics","score_opus":0.00414040258297324,"score_gpt":0.17869109342052547,"score_spread":0.17455069083755223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070037875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73051894,0.0038754102,0.24100736,0.0015460411,0.0020132894,0.00007070748,0.0000014320767,0.00010799478,0.020858843],"genre_scores_gemma":[0.9966867,0.000042875192,0.0026858647,0.00018084564,0.00017585588,7.8574374e-8,2.8969947e-7,0.000014043734,0.00021346941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988542,0.00026437463,0.00033233425,0.00012388152,0.00025631423,0.00016885225],"domain_scores_gemma":[0.99921,0.00008249593,0.00028046715,0.00023249735,0.000094419214,0.000100108635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095207314,0.00011820978,0.00017173939,0.000113096954,0.00008391722,0.00018998535,0.0006752803,0.000018464474,0.0000041758367],"category_scores_gemma":[0.000033626722,0.00009357301,0.000061980485,0.00023273646,0.000042138876,0.00031304077,0.00015467571,0.00024116169,0.000011199446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009231665,0.00013845986,0.0031072823,0.00001544988,0.000026197255,0.0013687644,0.0005041011,0.000041734664,0.00046525116,0.9569021,0.011887856,0.025533613],"study_design_scores_gemma":[0.0055885985,0.0018631188,0.1684633,0.00026753487,0.00006713536,0.004135505,0.00024197095,0.0021171502,0.0024882692,0.58594435,0.22781795,0.0010051341],"about_ca_topic_score_codex":0.0000013902235,"about_ca_topic_score_gemma":3.351616e-7,"teacher_disagreement_score":0.37095773,"about_ca_system_score_codex":0.000024998877,"about_ca_system_score_gemma":0.00003129319,"threshold_uncertainty_score":0.38157967},"labels":[],"label_agreement":null},{"id":"W2071685823","doi":"10.1007/s002360000037","title":"Efficiently building a parse tree from a regular expression","year":2000,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Parse tree; Parsing; Computer science; String (physics); Theory of computation; Tree (set theory); Regular expression; Representation (politics); Time complexity; Parsing expression grammar; Rule-based machine translation; Context (archaeology); Theoretical computer science; S-attributed grammar; Algorithm; Artificial intelligence; Context-free grammar; L-attributed grammar; Mathematics; Programming language; Combinatorics","score_opus":0.005874499761680074,"score_gpt":0.20309901389285406,"score_spread":0.19722451413117398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071685823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.916049,0.000059764352,0.063829556,0.0004145597,0.000143947,0.00015270902,0.000006173874,0.00041525465,0.018929036],"genre_scores_gemma":[0.9343826,0.000012887642,0.06448846,0.0008451972,0.0000467446,0.000013251264,0.000007370376,0.0000073263145,0.00019614829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988283,0.00003486835,0.00033426457,0.00018309956,0.00030902438,0.0003104743],"domain_scores_gemma":[0.998804,0.0001407363,0.000086614564,0.00083574705,0.000018289888,0.00011465584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022213178,0.00014500479,0.0001677138,0.00007011356,0.00014508757,0.00025736084,0.0010464472,0.00006607582,0.0004719384],"category_scores_gemma":[0.00003556237,0.00011521944,0.000069968424,0.00023597541,0.000037144437,0.0013897397,0.00020059802,0.000114208495,0.00048158006],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003801852,0.00016499948,0.000051382005,0.000035599387,0.000035306937,0.000029616103,0.012803109,0.000253675,0.02544765,0.022015782,0.015847227,0.9232776],"study_design_scores_gemma":[0.0014761004,0.00014443274,0.0019677873,0.00045172844,0.000020402911,0.00004784707,0.0003342541,0.7297812,0.06331852,0.022391582,0.17927754,0.0007886083],"about_ca_topic_score_codex":0.000014437778,"about_ca_topic_score_gemma":4.6960076e-7,"teacher_disagreement_score":0.92248905,"about_ca_system_score_codex":0.000022861324,"about_ca_system_score_gemma":0.0000259382,"threshold_uncertainty_score":0.6189898},"labels":[],"label_agreement":null},{"id":"W2071784365","doi":"10.1007/s00224-004-1190-2","title":"Complete Classifications for the Communication Complexity of Regular Languages","year":2004,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Linguistics; Philosophy","score_opus":0.0637492406813639,"score_gpt":0.2897090998430529,"score_spread":0.22595985916168898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071784365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032452885,0.001654883,0.9636715,0.00070798706,0.0001847493,0.0004661553,0.00002537531,0.00012879907,0.000707642],"genre_scores_gemma":[0.97386926,0.0000075534736,0.025961516,0.000046023553,0.000044628272,0.000011724545,0.000011571287,0.000009631177,0.000038100134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864316,0.0003398659,0.00047726984,0.00017637831,0.00019813182,0.00016521201],"domain_scores_gemma":[0.9964063,0.0015582953,0.0005058712,0.0013112477,0.00019004675,0.00002824622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002386243,0.00010978935,0.00027689262,0.00007031137,0.00027606156,0.000049650473,0.0016663821,0.00004169313,0.0000015132838],"category_scores_gemma":[0.00009135563,0.00008122697,0.00010796416,0.00024176571,0.0004810205,0.00009832564,0.00020814856,0.00008251884,0.0000032934652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006701514,0.000044342458,0.000012939759,0.000085242486,0.000039355862,1.0793508e-7,0.0023865516,0.004291133,0.0028498573,0.9868461,0.00006758969,0.0033700643],"study_design_scores_gemma":[0.0013534141,0.00016013483,0.0064277095,0.0007643943,0.000060768234,0.000040789837,0.005934454,0.2886851,0.005566822,0.6891312,0.0015385594,0.00033660725],"about_ca_topic_score_codex":0.00011244074,"about_ca_topic_score_gemma":0.000003428082,"teacher_disagreement_score":0.9414164,"about_ca_system_score_codex":0.00003121764,"about_ca_system_score_gemma":0.00003883582,"threshold_uncertainty_score":0.33123398},"labels":[],"label_agreement":null},{"id":"W2072220447","doi":"10.1016/j.tcs.2014.07.015","title":"On the maximality of languages with combined types of code properties","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; St. Mary's University; Western University","funders":"","keywords":"Decidability; Property (philosophy); Mathematics; Formal language; Regular language; Suffix; Code (set theory); Type (biology); Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; Programming language; Linguistics","score_opus":0.009412736562524896,"score_gpt":0.21528818336526637,"score_spread":0.20587544680274147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072220447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49012366,0.000011328073,0.5061413,0.0008210305,0.00005921598,0.00009448811,0.0000011024281,0.00005516016,0.0026926908],"genre_scores_gemma":[0.9848905,5.472348e-7,0.0146821225,0.00039711074,0.000016422484,0.0000029465898,1.2243156e-7,0.000004051643,0.0000061378387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986155,0.00016362537,0.0001854082,0.00029616442,0.0005127342,0.00022656062],"domain_scores_gemma":[0.9983676,0.00050005916,0.000095247924,0.0008363552,0.00014105214,0.00005970756],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001649176,0.000108790926,0.00019090636,0.00006161507,0.0001234614,0.000073137686,0.001965637,0.00002131311,0.000018331797],"category_scores_gemma":[0.00013012787,0.000051923394,0.000034333218,0.00047028984,0.0034071556,0.00015953465,0.00042874273,0.000091727336,0.000008441045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026804106,0.000058078887,0.000044631637,0.000013043284,0.0000041495855,6.527188e-7,0.00036827428,0.00015741093,0.0020698966,0.9912017,0.000010988872,0.006044393],"study_design_scores_gemma":[0.0002738118,0.0013204437,0.0019267249,0.00013694025,0.0000061980113,0.000009062263,0.000027611932,0.56358016,0.13580205,0.296742,0.000015112986,0.00015989393],"about_ca_topic_score_codex":0.0000054110014,"about_ca_topic_score_gemma":4.6800756e-7,"teacher_disagreement_score":0.6944597,"about_ca_system_score_codex":0.000008663019,"about_ca_system_score_gemma":0.00004678064,"threshold_uncertainty_score":0.999305},"labels":[],"label_agreement":null},{"id":"W2072229649","doi":"10.1007/s11511-011-0065-z","title":"Markoff–Lagrange spectrum and extremal numbers","year":2011,"lang":"en","type":"article","venue":"Acta Mathematica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Irrational number; Bijection; Zero (linguistics); Integer (computer science); Real number; Geometry","score_opus":0.024796783038986494,"score_gpt":0.20577983862229546,"score_spread":0.18098305558330896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072229649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39904118,0.0003138151,0.25124922,0.006217671,0.0004602318,0.0005985262,0.000006635413,0.001294536,0.3408182],"genre_scores_gemma":[0.9271697,0.000013793648,0.07217668,0.00035788552,0.000032726763,0.000007506042,3.823526e-7,0.0000119832675,0.00022933699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991619,0.000030522795,0.0001641338,0.00026637063,0.00014351596,0.00023358349],"domain_scores_gemma":[0.999238,0.00009625304,0.00006700237,0.00046780263,0.000008725148,0.00012218297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019727682,0.00012974768,0.0001679562,0.00003852311,0.00006324781,0.00008494289,0.00056918967,0.00004092266,0.00028124783],"category_scores_gemma":[0.00003661745,0.00010510189,0.0000435389,0.00012985243,0.000059652248,0.00041406738,0.00024679178,0.00007725319,0.0001881651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009474896,0.0001314948,0.00025009227,0.000106493724,0.000037573987,0.000061931816,0.009389058,1.1062719e-8,0.0012811844,0.97716147,0.003757588,0.00781363],"study_design_scores_gemma":[0.0006701046,0.00019089003,0.008276336,0.00012626329,0.000042231295,0.00040252286,0.0004831424,0.0213066,0.00647747,0.95668983,0.0045921546,0.00074243936],"about_ca_topic_score_codex":0.000009553105,"about_ca_topic_score_gemma":0.000002114541,"teacher_disagreement_score":0.52812856,"about_ca_system_score_codex":0.000007557061,"about_ca_system_score_gemma":0.000011475517,"threshold_uncertainty_score":0.42859307},"labels":[],"label_agreement":null},{"id":"W2072322452","doi":"10.1016/j.tcs.2004.12.027","title":"Constructing divisions into power groups","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Constructive; Modulo; Conjecture; Mathematics; Group (periodic table); Constructive proof; Algebra over a field; Semigroup; Class (philosophy); Group theory; Algebraic number; Block (permutation group theory); Power (physics); Pure mathematics; Discrete mathematics; Computer science; Combinatorics; Programming language; Artificial intelligence; Mathematical analysis","score_opus":0.005845672047779444,"score_gpt":0.23981276081340724,"score_spread":0.2339670887656278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072322452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11556062,0.00003543568,0.869072,0.0031776952,0.00066904764,0.00009732644,8.0694525e-7,0.00046219924,0.010924867],"genre_scores_gemma":[0.67376953,0.0000011604153,0.32494769,0.0011267976,0.0001393016,0.0000028522393,3.344678e-7,0.000006572353,0.000005752505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972365,0.00010178753,0.0003405163,0.0008465074,0.00075140677,0.0007232917],"domain_scores_gemma":[0.9978914,0.0003952364,0.0000799537,0.0011128354,0.00014237469,0.00037818128],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001698442,0.0002196637,0.00022484151,0.0002197479,0.00068209646,0.0007023729,0.0034944285,0.00005786944,0.00015228137],"category_scores_gemma":[0.00012556296,0.00017661408,0.000088323,0.0012089793,0.0032757649,0.0014454349,0.0021566623,0.00025694087,0.00035833917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013420857,0.00003460618,0.000049151888,0.0000015531626,0.0000021407845,0.000008082262,0.0006083983,0.000034136647,0.00035503897,0.8127884,0.00005133043,0.18606581],"study_design_scores_gemma":[0.00021300679,0.0001113406,0.00043486478,0.000032173117,0.000002856164,0.00015205327,0.00004668923,0.58239937,0.004695157,0.4110888,0.0004914408,0.00033223355],"about_ca_topic_score_codex":0.0000024119568,"about_ca_topic_score_gemma":8.6245353e-7,"teacher_disagreement_score":0.5823652,"about_ca_system_score_codex":0.000116128525,"about_ca_system_score_gemma":0.00010245475,"threshold_uncertainty_score":0.99943674},"labels":[],"label_agreement":null},{"id":"W2072570893","doi":"10.1051/ita/2011112","title":"Multi-dimensional sets recognizable in all abstract numeration systems","year":2011,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Arithmetic; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.03686374755198837,"score_gpt":0.2659644655075115,"score_spread":0.22910071795552314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072570893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037064813,0.000138447,0.9481109,0.00019017678,0.00010151462,0.00073455245,0.000023001478,0.00018651849,0.013450116],"genre_scores_gemma":[0.8879453,0.000028661416,0.11141091,0.00037531467,0.00001842961,0.00015896957,0.000025905598,0.000007541525,0.000028960369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990158,0.000023134113,0.00045309358,0.00014731793,0.00013894857,0.00022170393],"domain_scores_gemma":[0.99925977,0.00012488251,0.00010311444,0.00034383882,0.000049481892,0.000118908916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046003377,0.00012273747,0.00014411652,0.000082838495,0.00010189927,0.00013354747,0.00030930658,0.000084570296,0.000049029462],"category_scores_gemma":[0.000016535208,0.00010252416,0.000028398248,0.000177948,0.00014365886,0.0004328425,0.00012853702,0.00013636526,0.00011707504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023788202,0.0001063515,0.000038761693,0.000026379485,0.0000067132314,7.438997e-7,0.0008918543,0.00009673366,0.00008141463,0.9901055,0.00009132668,0.008551834],"study_design_scores_gemma":[0.00034046549,0.000027240409,0.001134959,0.00003523066,0.000006645372,0.000026761874,0.00020538703,0.8885929,0.00021376605,0.10766876,0.0015495011,0.00019837334],"about_ca_topic_score_codex":0.000018001174,"about_ca_topic_score_gemma":0.0000014800472,"teacher_disagreement_score":0.88849616,"about_ca_system_score_codex":0.000018640794,"about_ca_system_score_gemma":0.00002434094,"threshold_uncertainty_score":0.41808137},"labels":[],"label_agreement":null},{"id":"W2073003100","doi":"10.1007/s002330010066","title":"Tensor products and preservation of limits, for acts over monoids","year":2001,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Functor; Mathematics; Limit (mathematics); Monoid; Pure mathematics; Flatness (cosmology); Tensor product; Algebra over a field; Mathematical analysis","score_opus":0.016759434268917513,"score_gpt":0.24257169445265764,"score_spread":0.22581226018374012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073003100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9055508,0.00096440315,0.0862738,0.004954156,0.00034800093,0.00070707675,0.000014503672,0.00021312817,0.00097412785],"genre_scores_gemma":[0.97960675,0.00010736175,0.018260054,0.00045439487,0.00010193699,0.00004218054,0.000011053079,0.000016790862,0.0013994721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988817,0.000024325569,0.00022676811,0.00036576737,0.00017304337,0.00032840346],"domain_scores_gemma":[0.9990641,0.00013241057,0.00012651121,0.0005085789,0.00010581506,0.000062621555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030783057,0.00013430913,0.00017917855,0.00008280099,0.000086123495,0.000064300206,0.00042379624,0.00007315851,0.0000048670126],"category_scores_gemma":[0.00015669725,0.00011713062,0.000046147044,0.00028889749,0.000043171443,0.00089867646,0.00015564551,0.00006198246,0.0000029912035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018127907,0.00039749334,0.049813993,0.0003833902,0.00009935563,0.0000080977325,0.0021254786,0.000065886314,0.14791581,0.6358727,0.033948522,0.12918797],"study_design_scores_gemma":[0.003556015,0.0012999346,0.18101123,0.0002855737,0.0000601913,0.00009554046,0.00045586342,0.20588362,0.15816534,0.1302629,0.31773132,0.0011924835],"about_ca_topic_score_codex":0.000023943872,"about_ca_topic_score_gemma":0.0000100912575,"teacher_disagreement_score":0.5056098,"about_ca_system_score_codex":0.000016025135,"about_ca_system_score_gemma":0.000027938984,"threshold_uncertainty_score":0.47764483},"labels":[],"label_agreement":null},{"id":"W2073231246","doi":"10.1016/j.disc.2011.01.011","title":"Coding discretizations of continuous functions","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Discretization; Subsequence; Coding (social sciences); Sequence (biology); Limit (mathematics); Discrete mathematics; Applied mathematics; Algorithm; Mathematical analysis; Statistics","score_opus":0.0264572524158426,"score_gpt":0.2299051483951956,"score_spread":0.203447895979353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073231246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013776,0.000032660424,0.9460108,0.000054151566,0.00014293347,0.000107504566,0.000012787336,0.00016167552,0.03970148],"genre_scores_gemma":[0.863613,0.0000065047097,0.1357724,0.00003189618,0.000016234162,0.000011021101,0.000005097543,0.000011416345,0.00053241604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992121,0.00002325485,0.00029317717,0.00015461103,0.00015450403,0.00016239265],"domain_scores_gemma":[0.99908024,0.0000891762,0.00016003753,0.00055504596,0.000061556835,0.000053947668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018946263,0.00010315474,0.00018315365,0.000074881,0.00008632967,0.00003693981,0.0005215731,0.000036388203,0.000108815286],"category_scores_gemma":[0.00006848456,0.000084119856,0.0000796622,0.00026634944,0.0000750277,0.00024738378,0.00016357754,0.000057425004,0.00005080675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.1854466e-7,0.000081867256,0.00025387233,0.000040553256,0.000020375,0.0000021435396,0.0052336897,0.0000034882232,0.0007550475,0.99239296,0.00024965534,0.0009655324],"study_design_scores_gemma":[0.0008863554,0.00031461267,0.004307447,0.00048816213,0.00015233913,0.00009398737,0.008224853,0.24411194,0.02794068,0.7111332,0.0013268465,0.0010195787],"about_ca_topic_score_codex":0.0000087575045,"about_ca_topic_score_gemma":0.0000017065876,"teacher_disagreement_score":0.849837,"about_ca_system_score_codex":0.000008104359,"about_ca_system_score_gemma":0.000018677616,"threshold_uncertainty_score":0.3430308},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009884880501276559,"score_gpt":0.2769687651552374,"score_spread":0.2670838846539608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073495011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77801967,0.00002019512,0.21676578,0.0033091,0.0016542544,0.00006337473,0.000004675146,0.000009248428,0.00015372272],"genre_scores_gemma":[0.94957894,0.000003338092,0.050016135,0.00018008417,0.0001832204,8.3403523e-7,4.5721254e-7,0.0000030729311,0.00003393469],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984976,0.000064510634,0.00055719505,0.00015174097,0.00058934925,0.00013959578],"domain_scores_gemma":[0.9976817,0.0004791261,0.0006104179,0.00042470839,0.0007540943,0.00004995419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021620567,0.000082487866,0.00016829744,0.0005411503,0.000075080265,0.0002177626,0.0051678848,0.00002632347,0.000037133526],"category_scores_gemma":[0.0005531813,0.00005438738,0.00008381386,0.0006179709,0.00047452445,0.001320189,0.000576056,0.00019879911,0.00000463643],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018400252,0.0005215862,0.002231265,0.000016280483,0.00013628167,0.00013020218,0.00969018,0.0009586442,0.38471094,0.37879807,0.0026083826,0.22001418],"study_design_scores_gemma":[0.0059036077,0.0009036319,0.11373544,0.00072422303,0.000034166624,0.0019660275,0.00044743944,0.53165084,0.26359385,0.07794864,0.0024208713,0.0006712669],"about_ca_topic_score_codex":0.00005235769,"about_ca_topic_score_gemma":0.000033658383,"teacher_disagreement_score":0.5306922,"about_ca_system_score_codex":0.000042163912,"about_ca_system_score_gemma":0.00041460677,"threshold_uncertainty_score":0.9603301},"labels":[],"label_agreement":null},{"id":"W2073577522","doi":"10.1016/s0304-3975(02)00543-1","title":"On the closure properties of linear conjunctive languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Indexed grammar; Context-sensitive grammar; Closure (psychology); Context-free grammar; Definite clause grammar; Mathematics; L-attributed grammar; Phrase structure grammar; Rule-based machine translation; Computer science; Discrete mathematics; Tree-adjoining grammar; Context-free language; Artificial intelligence","score_opus":0.011894322274946273,"score_gpt":0.22842020011947572,"score_spread":0.21652587784452945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073577522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3813448,0.00008828882,0.6068668,0.001059737,0.00032064487,0.00018404146,0.000001107611,0.0001222329,0.0100123435],"genre_scores_gemma":[0.9843962,0.0000020128502,0.014447411,0.0010923172,0.000034006964,0.000005326043,7.0612046e-8,0.0000053031104,0.000017316881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982727,0.00023935123,0.00019050934,0.0004067606,0.0005555918,0.00033507549],"domain_scores_gemma":[0.9984198,0.00043316188,0.00006757813,0.00084128155,0.00014918484,0.00008897691],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018206042,0.00014077034,0.00016408083,0.00008237274,0.00030408564,0.00012508879,0.001884906,0.00003384102,0.00004620772],"category_scores_gemma":[0.0003557782,0.000073614894,0.00006240495,0.00056272873,0.002940669,0.00024506135,0.0003404131,0.00016634216,0.00005627842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054290326,0.000046788962,0.000013442377,0.000004386122,0.0000040597074,0.000003044898,0.000803558,0.000054013344,0.0026606822,0.9944043,0.00004046284,0.0019598207],"study_design_scores_gemma":[0.00024066475,0.00042820862,0.00023880343,0.00010366065,0.0000053683393,0.000031772743,0.00012708991,0.14638175,0.3350444,0.51701236,0.0001293548,0.0002565565],"about_ca_topic_score_codex":0.0000018873018,"about_ca_topic_score_gemma":1.3059274e-7,"teacher_disagreement_score":0.6030514,"about_ca_system_score_codex":0.00001866226,"about_ca_system_score_gemma":0.00009651094,"threshold_uncertainty_score":0.9997727},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029569320463496206,"score_gpt":0.2988042262286668,"score_spread":0.2692349057651706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074221742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46445036,0.000027324055,0.5347907,0.00020490689,0.00041334576,0.000019677202,0.0000036154959,0.000004705409,0.00008536787],"genre_scores_gemma":[0.90394676,0.000037529087,0.09593567,0.00002925218,0.00004093069,2.0297425e-7,7.84653e-7,0.0000018031602,0.0000070483384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986169,0.000051824845,0.00051519775,0.00012114521,0.0006135324,0.00008144152],"domain_scores_gemma":[0.99764335,0.00017734343,0.00073979114,0.00017970434,0.0012138461,0.000045939207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000759491,0.00006534955,0.00016702357,0.0005483414,0.000060190814,0.000043959626,0.0011928674,0.000014336922,0.0000068494805],"category_scores_gemma":[0.00009083493,0.00005721477,0.00006228087,0.00038949598,0.000925938,0.0011846455,0.0002861537,0.00007319982,5.8705905e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012893001,0.0010287139,0.019637663,0.00008302794,0.00031750614,0.000065599546,0.017062297,0.016503135,0.102121234,0.41946146,0.00030190276,0.42328852],"study_design_scores_gemma":[0.0018222029,0.0012009435,0.35011128,0.0005765039,0.000019187162,0.0014403356,0.00025434335,0.42792147,0.14103736,0.07494493,0.00035406047,0.00031738012],"about_ca_topic_score_codex":0.00004869755,"about_ca_topic_score_gemma":0.0000042208976,"teacher_disagreement_score":0.43949643,"about_ca_system_score_codex":0.000037710357,"about_ca_system_score_gemma":0.00019986172,"threshold_uncertainty_score":0.34116572},"labels":[],"label_agreement":null},{"id":"W2074534086","doi":"10.1016/j.jalgebra.2011.02.048","title":"Representation theory of finite semigroups over semirings","year":2011,"lang":"en","type":"preprint","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Semiring; Semigroup; Representation (politics); Mathematics; Simple (philosophy); Character (mathematics); Field (mathematics); Finite field; Commutative property; Unit (ring theory); Algebra over a field; Pure mathematics; Discrete mathematics","score_opus":0.02836510203245792,"score_gpt":0.2623783498689101,"score_spread":0.2340132478364522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074534086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5794429,0.0022782122,0.4117826,0.0002327966,0.0024259624,0.00019151681,0.000010281949,0.00007760919,0.0035580704],"genre_scores_gemma":[0.9776127,0.0003949478,0.020991934,0.00029336472,0.00040013195,0.000003405033,0.0000035634448,0.000029403507,0.00027057418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997368,0.00031267392,0.0010979895,0.00035346198,0.0006220079,0.0002458589],"domain_scores_gemma":[0.9955301,0.0005928268,0.0023947852,0.0010023955,0.00034659603,0.00013328962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019879246,0.00027417997,0.00068320875,0.00042155755,0.000042978274,0.000120745426,0.0021037888,0.00026584746,0.00017047343],"category_scores_gemma":[0.00030447275,0.00022915872,0.00052992924,0.00027716305,0.00009990556,0.000650827,0.0012818985,0.0008470265,0.000013614677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004821509,0.0008836765,0.005426701,0.000874274,0.0016647772,0.0005636863,0.024972174,0.002107021,0.013526562,0.8048115,0.015772844,0.12891467],"study_design_scores_gemma":[0.0006276069,0.0002130782,0.01508211,0.00093584677,0.00012075154,0.00018021086,0.00016424409,0.002925681,0.025688417,0.9532263,0.0004323331,0.00040337752],"about_ca_topic_score_codex":0.000022110964,"about_ca_topic_score_gemma":7.8834086e-7,"teacher_disagreement_score":0.39816973,"about_ca_system_score_codex":0.000058908197,"about_ca_system_score_gemma":0.00020856154,"threshold_uncertainty_score":0.9344821},"labels":[],"label_agreement":null},{"id":"W2075116123","doi":"10.1016/j.tcs.2011.02.002","title":"The search for a reduction in combinatory logic equivalent to <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>λ</mml:mi><mml:mi>β</mml:mi></mml:math>-reduction","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Scroll; Reduction (mathematics); Algorithm; Mathematics; Computer science; Artificial intelligence; Theology; Philosophy; Geometry","score_opus":0.025986079673782147,"score_gpt":0.2623358634728863,"score_spread":0.23634978379910415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075116123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8478743,0.000093080824,0.14658007,0.00085107604,0.0022435493,0.00011074381,0.0000092599585,0.0001733189,0.0020646472],"genre_scores_gemma":[0.98044944,0.000044048782,0.018278554,0.0005689879,0.00040514403,0.00017540684,0.000009975579,0.000049968145,0.0000184782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582696,0.00022808988,0.000602639,0.0010875486,0.0011248856,0.0011298928],"domain_scores_gemma":[0.9973094,0.00053311815,0.0002484826,0.001366276,0.00013824341,0.00040447197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003514007,0.0003044896,0.00018589302,0.00023046082,0.0010952334,0.00074815814,0.0026147922,0.00026133118,0.00010292532],"category_scores_gemma":[0.00023809848,0.0003199649,0.0002798388,0.0009481368,0.0022967844,0.00091811916,0.0018684024,0.00050190213,0.00033634834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018223895,0.00018872415,0.0000025494605,0.000062161715,0.000028912607,0.000041986863,0.0019902575,0.00057329156,0.0017772208,0.9859428,0.00050171895,0.008708167],"study_design_scores_gemma":[0.00047333073,0.0010524823,0.0001327576,0.0001966072,0.000033034972,0.00031448033,0.00026846354,0.8303697,0.074406065,0.092205,0.00015944258,0.00038861873],"about_ca_topic_score_codex":0.00007514981,"about_ca_topic_score_gemma":0.000009336399,"teacher_disagreement_score":0.8937378,"about_ca_system_score_codex":0.000039307535,"about_ca_system_score_gemma":0.00038594852,"threshold_uncertainty_score":0.99992526},"labels":[],"label_agreement":null},{"id":"W2075422800","doi":"10.1016/s1631-073x(02)00005-5","title":"Approximation simultanée d'un nombre et de son carré","year":2003,"lang":"fr","type":"article","venue":"Comptes Rendus Mathématique","topic":"semigroups and automata theory","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Humanities","score_opus":0.0205988820774089,"score_gpt":0.2677177943406581,"score_spread":0.24711891226324922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075422800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10137138,0.0142388,0.8437382,0.0042206775,0.0020738111,0.0005703446,0.000047867896,0.00058170274,0.03315721],"genre_scores_gemma":[0.8109759,0.0008006819,0.18188196,0.0023970406,0.00021936513,0.0000730833,0.000035579957,0.000083096915,0.0035333065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602705,0.0013440296,0.00065386016,0.00071152963,0.00038834452,0.000875177],"domain_scores_gemma":[0.99728763,0.00078670244,0.00036403144,0.0010801518,0.00017778903,0.00030366753],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018606379,0.00049810467,0.00051756186,0.00014947024,0.00027976854,0.0006479839,0.0009804494,0.0004096431,0.0010583542],"category_scores_gemma":[0.00043703988,0.00052732835,0.00020117093,0.00057361065,0.00017031185,0.0010013125,0.00025282928,0.0006616232,0.0008392689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054492607,0.00034805454,0.0002826024,0.00029394607,0.000059025693,0.00007950761,0.005801817,0.002067928,0.0020090945,0.94100225,0.01007765,0.03797265],"study_design_scores_gemma":[0.0012278543,0.0002134985,0.0029573292,0.00086568756,0.0000737236,0.0007332528,0.00051009096,0.6008012,0.02964288,0.22442596,0.13726524,0.0012832494],"about_ca_topic_score_codex":0.00012174754,"about_ca_topic_score_gemma":0.0000115496505,"teacher_disagreement_score":0.71657634,"about_ca_system_score_codex":0.0002808817,"about_ca_system_score_gemma":0.000500138,"threshold_uncertainty_score":0.99993867},"labels":[],"label_agreement":null},{"id":"W2075877008","doi":"10.1142/s0129054110007386","title":"ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Communication complexity; Logarithm; Regular language; Time complexity; Constant (computer programming); Cover (algebra); Probabilistic logic; Mathematics; Computer science; Theoretical computer science; Computational complexity theory; Formal language; Range (aeronautics); Discrete mathematics; Algorithm; Automaton; Artificial intelligence; Programming language","score_opus":0.02129091006112265,"score_gpt":0.31408380027596616,"score_spread":0.2927928902148435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075877008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45800003,0.000010118157,0.53719294,0.0030806165,0.0009834777,0.00005352204,0.0000035561145,0.000008679304,0.00066707045],"genre_scores_gemma":[0.8778037,0.000005081415,0.12193681,0.00016976552,0.000073363844,8.5442747e-7,8.7675477e-7,0.0000023978873,0.0000071551704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984205,0.00005770737,0.00047202996,0.0001238471,0.00082726945,0.00009866574],"domain_scores_gemma":[0.9967601,0.0005843932,0.0007351503,0.00066840305,0.001205566,0.000046415847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015346089,0.000076062024,0.00013891608,0.00031497164,0.00013873576,0.00019258201,0.0049109547,0.000021904338,0.000026749034],"category_scores_gemma":[0.00028435982,0.000053051746,0.000088662804,0.00035737143,0.0011538174,0.0007359395,0.00041351482,0.00020173818,0.0000049758028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008019262,0.00013798696,0.00010492201,0.0000029746893,0.000025075282,0.0000032983303,0.000620753,0.00030950093,0.02016709,0.9466775,0.00021874801,0.03172413],"study_design_scores_gemma":[0.00083936506,0.00050028344,0.061194185,0.0003478669,0.000019071793,0.00041926693,0.00013457389,0.40015575,0.06670451,0.46859232,0.0008282706,0.00026453254],"about_ca_topic_score_codex":0.000013678652,"about_ca_topic_score_gemma":0.0000046792857,"teacher_disagreement_score":0.4780852,"about_ca_system_score_codex":0.00002606245,"about_ca_system_score_gemma":0.00020915005,"threshold_uncertainty_score":0.91258574},"labels":[],"label_agreement":null},{"id":"W2075936685","doi":"10.1142/s0129054104002352","title":"IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic finite automaton; Mathematics; Pairwise comparison; Upper and lower bounds; Quantum finite automata; Finite-state machine; Regular language; DFA minimization; Discrete mathematics; Automaton; Finite set; Nondeterministic finite automaton; Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm; Statistics","score_opus":0.015615832947582784,"score_gpt":0.31805585924589436,"score_spread":0.30244002629831157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075936685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2905454,0.0000117455975,0.704482,0.0030993256,0.0010445801,0.00004430696,0.0000033404685,0.000018109631,0.0007511399],"genre_scores_gemma":[0.8839644,0.000007769985,0.11554535,0.00031928465,0.0001479243,8.833516e-7,5.7324525e-7,0.0000033723527,0.000010453018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820423,0.000037705606,0.0005350542,0.00016246944,0.0009164812,0.00014407582],"domain_scores_gemma":[0.99736494,0.00043549904,0.0007456368,0.00039964003,0.0010031025,0.000051210613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012593002,0.00009372413,0.0001469748,0.00029755555,0.00013095238,0.00033438287,0.0038407801,0.000021721913,0.000028016466],"category_scores_gemma":[0.00029142553,0.00006448875,0.000113772,0.0005368698,0.0003962793,0.0013120004,0.00042159832,0.00013702114,0.0000091386255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023376064,0.00040039272,0.00058880745,0.000008480725,0.00010962383,0.000019199579,0.0023982788,0.011371469,0.015441517,0.8231219,0.00013106741,0.14638588],"study_design_scores_gemma":[0.0038481168,0.0010285596,0.046511885,0.0012521347,0.000040260165,0.0012093566,0.00054086634,0.6081579,0.13937482,0.19563188,0.001710347,0.00069391617],"about_ca_topic_score_codex":0.00002293213,"about_ca_topic_score_gemma":0.0000014337733,"teacher_disagreement_score":0.62749004,"about_ca_system_score_codex":0.00008529568,"about_ca_system_score_gemma":0.00042126435,"threshold_uncertainty_score":0.7137189},"labels":[],"label_agreement":null},{"id":"W2076116808","doi":"10.1007/s00233-009-9144-2","title":"Flatness properties of diagonal acts over monoids","year":2009,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Monoid; Flatness (cosmology); Mathematics; Diagonal; Pure mathematics; Projective test; Algebra over a field; Discrete mathematics; Geometry; Physics","score_opus":0.00943579455960058,"score_gpt":0.2115320754355206,"score_spread":0.20209628087592002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076116808","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96340346,0.0013961904,0.028490167,0.0020652195,0.0004614277,0.00021660513,0.000005283466,0.00034910397,0.0036125463],"genre_scores_gemma":[0.9960985,0.000022987586,0.0022702895,0.0010172583,0.00007149694,0.0000071251275,0.0000024418334,0.0000100809575,0.0004997829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985539,0.000042387765,0.00028923337,0.0003379025,0.0003302296,0.00044638274],"domain_scores_gemma":[0.9990596,0.00003617188,0.00011796089,0.0006368454,0.00005165986,0.000097716606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024681244,0.00018648096,0.00024772476,0.0001016294,0.00009272727,0.00008129767,0.0009432198,0.0000909842,0.000021467846],"category_scores_gemma":[0.000032181586,0.00014773503,0.000119308024,0.00030685138,0.00006829272,0.00074007554,0.00020876374,0.00012852161,0.000028797904],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054182463,0.00037756196,0.0022010512,0.000059321577,0.00004732031,0.000026478765,0.002193629,0.000098168646,0.28373367,0.58152974,0.006369777,0.12330913],"study_design_scores_gemma":[0.0018961469,0.0009172707,0.052032672,0.0005205673,0.000031912223,0.0000855142,0.0005645334,0.07916454,0.7264303,0.1174504,0.019484637,0.0014215057],"about_ca_topic_score_codex":0.000025966507,"about_ca_topic_score_gemma":0.000005649378,"teacher_disagreement_score":0.46407932,"about_ca_system_score_codex":0.000029527324,"about_ca_system_score_gemma":0.000048832877,"threshold_uncertainty_score":0.60244596},"labels":[],"label_agreement":null},{"id":"W2076752886","doi":"10.1016/s0012-365x(02)00372-2","title":"No iterated morphism generates any Arshon sequence of odd order","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Morphism; Iterated function; Mathematics; Sequence (biology); Order (exchange); Combinatorics; Discrete mathematics","score_opus":0.03221271644476364,"score_gpt":0.24233306495041634,"score_spread":0.2101203485056527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076752886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35968947,0.0010261947,0.6102834,0.0007238338,0.00065942405,0.0005100469,0.00007020638,0.0006695175,0.026367944],"genre_scores_gemma":[0.7031513,0.000088808876,0.29307133,0.00035715156,0.0000831003,0.000018388606,0.000014093432,0.00003475413,0.0031810908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870497,0.00004433864,0.00039821683,0.0002755754,0.00029148886,0.00028543474],"domain_scores_gemma":[0.9986778,0.00010906064,0.00020021228,0.0007598262,0.00017489608,0.000078189514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023187787,0.00019382792,0.0002789372,0.00008055697,0.00007190554,0.00012932783,0.00080391066,0.000068822905,0.00027125116],"category_scores_gemma":[0.00010176045,0.00015465432,0.0000714465,0.00047656507,0.000086030115,0.00036419136,0.00018386771,0.00009989984,0.00030941403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059301547,0.0006454502,0.00018316855,0.0006278805,0.00016434374,0.00012197429,0.0140087735,0.00061759725,0.2430698,0.71847177,0.009424387,0.01265895],"study_design_scores_gemma":[0.00021171336,0.00006471523,0.000023797716,0.00014056951,0.000012331115,0.00003393367,0.000057001722,0.96313274,0.0167917,0.0182961,0.00095656305,0.00027884022],"about_ca_topic_score_codex":0.000006450341,"about_ca_topic_score_gemma":5.6237786e-7,"teacher_disagreement_score":0.9625151,"about_ca_system_score_codex":0.000018467177,"about_ca_system_score_gemma":0.000014913307,"threshold_uncertainty_score":0.630662},"labels":[],"label_agreement":null},{"id":"W2076959711","doi":"10.1016/j.tcs.2010.07.005","title":"Equations on palindromes and circular words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Bijection; Mathematics; Palindrome; Translation (biology); Combinatorics; Boundary (topology); Pure mathematics; Plane (geometry); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.008528305360565884,"score_gpt":0.24131079689579749,"score_spread":0.2327824915352316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076959711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22876331,0.000010144929,0.76670367,0.001408561,0.0006795375,0.00008209072,8.2461986e-7,0.00019280039,0.00215908],"genre_scores_gemma":[0.92459655,0.0000016474778,0.074326485,0.000952296,0.00010629683,0.000004768154,3.5467528e-7,0.0000054855086,0.000006133305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982316,0.000054788903,0.00016821147,0.00062260433,0.00051263964,0.0004101474],"domain_scores_gemma":[0.9982633,0.00047509678,0.00003974715,0.0008896861,0.000069029404,0.0002631404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013625899,0.00014522762,0.00013969047,0.00017506738,0.00043601272,0.0005615404,0.0017073052,0.000052999338,0.00005096004],"category_scores_gemma":[0.00016112557,0.00011365641,0.000038751412,0.0007030473,0.0023503255,0.00047580074,0.00070375804,0.0002873648,0.000088385736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001046168,0.000032258322,0.000030301635,0.0000020179461,0.0000015689477,0.00000757588,0.0002566384,0.000011904468,0.0023401643,0.93042463,0.000008577993,0.06688331],"study_design_scores_gemma":[0.00013168357,0.00011298758,0.001693963,0.000012589448,0.0000022256268,0.00004562109,0.000004547526,0.48762414,0.0035151674,0.5065577,0.00011988482,0.00017948588],"about_ca_topic_score_codex":0.0000015313208,"about_ca_topic_score_gemma":3.6041513e-7,"teacher_disagreement_score":0.6958332,"about_ca_system_score_codex":0.000012319761,"about_ca_system_score_gemma":0.0000667101,"threshold_uncertainty_score":0.8659872},"labels":[],"label_agreement":null},{"id":"W2077111268","doi":"10.4153/cjm-2007-009-3","title":"On Two Exponents of Approximation Related to a Real Number and Its Square","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Infimum and supremum; Real number; Exponent; Zero (linguistics); Combinatorics; Interval (graph theory); Discrete mathematics","score_opus":0.014640423563506377,"score_gpt":0.2580859016855078,"score_spread":0.24344547812200146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077111268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9599977,0.000034087774,0.03664322,0.00022224737,0.00014065125,0.0000827411,0.0000025654965,0.00000721914,0.0028695825],"genre_scores_gemma":[0.97502804,0.0000032804023,0.024789715,0.0000824189,0.000015902198,3.6168794e-7,3.0656176e-7,0.0000073104966,0.000072664036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914026,0.000022266113,0.00040307397,0.00007565367,0.00018721112,0.00017154416],"domain_scores_gemma":[0.99895996,0.00013865503,0.00025529868,0.00016369518,0.00012592187,0.00035644614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008875247,0.00007606381,0.00016486323,0.0002044155,0.00004455699,0.000037788137,0.00029350133,0.00003992992,0.000020924113],"category_scores_gemma":[0.0001530207,0.00006543542,0.0000370973,0.00021192178,0.000016475584,0.00016592872,0.000017723432,0.00009556376,0.000017660966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008726593,0.00008340166,0.00080464897,0.00013440032,0.000044851102,0.00019481168,0.015630169,0.00013810936,0.0017684691,0.97008586,0.00095805264,0.010148482],"study_design_scores_gemma":[0.0038496465,0.0012198592,0.01945721,0.0037897534,0.00009705717,0.0034127375,0.0045139077,0.07664198,0.029036436,0.85613894,0.00076153787,0.001080911],"about_ca_topic_score_codex":0.000108563196,"about_ca_topic_score_gemma":0.00034887248,"teacher_disagreement_score":0.113946915,"about_ca_system_score_codex":0.000059325677,"about_ca_system_score_gemma":0.00012548885,"threshold_uncertainty_score":0.2668379},"labels":[],"label_agreement":null},{"id":"W2077168540","doi":"10.1051/ita:2007042","title":"On Critical exponents in fixed points of<i>k</i>-uniform binary morphisms","year":2007,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Sketch; Bounded function; Binary number; Fixed point; Extension (predicate logic); Exponent; Discrete mathematics; Critical exponent; Combinatorics; Pure mathematics; Mathematical analysis; Algorithm; Arithmetic; Geometry; Computer science; Scaling","score_opus":0.00819716597446658,"score_gpt":0.2613758560435292,"score_spread":0.25317869006906263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077168540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0857165,0.00003290912,0.903037,0.0006255218,0.00004325932,0.0002878643,0.000013010218,0.00007001616,0.0101738935],"genre_scores_gemma":[0.9381771,0.000018769759,0.061006635,0.00071788015,0.000019290137,0.00003745906,0.000007745443,0.0000069675475,0.000008125782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987093,0.00002129814,0.00058135286,0.00014392265,0.00023924783,0.00030484563],"domain_scores_gemma":[0.9983678,0.0008642768,0.000083903935,0.00047873025,0.00004619371,0.00015908702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081166497,0.00013661713,0.00019419787,0.00017676405,0.000094671675,0.00005487303,0.0004634895,0.000091176364,0.00003345492],"category_scores_gemma":[0.000090362155,0.00011453373,0.00004883583,0.000359567,0.00048159066,0.00026023446,0.00021515443,0.00017553373,0.00004374582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010775286,0.00015487226,0.000031904496,0.000032715106,0.0000034434856,0.000001715444,0.00039871607,0.00001716084,0.00018756084,0.98806465,0.000049059177,0.011047408],"study_design_scores_gemma":[0.00038182593,0.00011728002,0.00081605103,0.000062291416,0.0000055030855,0.000015206094,0.0002492251,0.09917749,0.0015664352,0.8969374,0.0004904338,0.00018091101],"about_ca_topic_score_codex":0.0000018166431,"about_ca_topic_score_gemma":3.738097e-7,"teacher_disagreement_score":0.8524606,"about_ca_system_score_codex":0.000022533577,"about_ca_system_score_gemma":0.000018663097,"threshold_uncertainty_score":0.46705502},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008635601422458672,"score_gpt":0.28601269267096646,"score_spread":0.2773770912485078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077220764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34173205,0.00006511209,0.65246713,0.0017161819,0.0037126213,0.00004488883,0.0000033815083,0.000018794311,0.00023986922],"genre_scores_gemma":[0.79100126,0.000034082746,0.20866086,0.00008635032,0.00020844577,6.589054e-7,4.74147e-7,0.0000019271245,0.000005938294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837697,0.00002535186,0.00044387134,0.00019979179,0.0008106646,0.00014335218],"domain_scores_gemma":[0.9977621,0.0002314543,0.000534521,0.00025252902,0.001117452,0.00010196145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011190267,0.00009106497,0.00014174038,0.00056417333,0.00012343684,0.0006552318,0.002878756,0.00002504658,0.000021316875],"category_scores_gemma":[0.0001309832,0.000074953314,0.000060389866,0.00047180982,0.0005354435,0.002684236,0.00044882367,0.00018275196,0.000004676676],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014411337,0.00021742051,0.0071065435,0.000011242495,0.000055319673,0.000030249392,0.0007333723,0.00017907892,0.034686595,0.25545987,0.00094418577,0.7005617],"study_design_scores_gemma":[0.00266887,0.00088875234,0.24017699,0.00037372363,0.000051127758,0.0046409653,0.00011307041,0.46190494,0.08112489,0.18461761,0.022434644,0.0010043974],"about_ca_topic_score_codex":0.000015776479,"about_ca_topic_score_gemma":0.0000039387933,"teacher_disagreement_score":0.6995573,"about_ca_system_score_codex":0.000020626321,"about_ca_system_score_gemma":0.00033138832,"threshold_uncertainty_score":0.63184154},"labels":[],"label_agreement":null},{"id":"W2077507544","doi":"10.1515/integ.2011.059","title":"On Some Conjectures Concerning Stern's Sequence and Its Twist","year":2011,"lang":"en","type":"preprint","venue":"Integers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stern; Sequence (biology); Twist; Value (mathematics); Mathematics; Combinatorics; Binary number; Computer science; Arithmetic; Geometry; Biology; Statistics; Genetics; History","score_opus":0.055814729536462195,"score_gpt":0.27818102930257754,"score_spread":0.22236629976611536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077507544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9380371,0.0046215686,0.0345347,0.00082711474,0.0048403325,0.0006290874,0.000068074805,0.0010440965,0.015397915],"genre_scores_gemma":[0.9970273,0.00008364412,0.0008158577,0.0016339605,0.00008977201,0.000024012625,0.000005413669,0.000020446158,0.00029961052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983728,0.00008249235,0.0002372638,0.00077028037,0.00023505792,0.00030209013],"domain_scores_gemma":[0.9987025,0.00021947769,0.0002111047,0.00068616297,0.000058981714,0.00012172646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027530207,0.0003216404,0.00032707021,0.00012426564,0.00007465331,0.0002863828,0.0013624256,0.00021767688,0.00004656858],"category_scores_gemma":[0.00009299591,0.00027515605,0.00009111244,0.00005596892,0.00012956934,0.00023605689,0.0012238435,0.0007020473,0.00009311511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027409636,0.000035939815,0.000041579166,0.00017323165,0.000106675645,0.00021560506,0.005765786,0.00038741922,0.0033518285,0.96273476,0.0013897389,0.025770014],"study_design_scores_gemma":[0.00070605497,0.0003810661,0.00041090444,0.0022026044,0.000045846402,0.00013285824,0.00025008986,0.06677852,0.056284424,0.8686471,0.002330994,0.0018295422],"about_ca_topic_score_codex":0.00014438631,"about_ca_topic_score_gemma":0.000003840863,"teacher_disagreement_score":0.094087675,"about_ca_system_score_codex":0.000075517346,"about_ca_system_score_gemma":0.00010546798,"threshold_uncertainty_score":0.9999701},"labels":[],"label_agreement":null},{"id":"W2077566826","doi":"10.1145/369836.369849","title":"Half century of automata theory","year":2000,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Citation; Computer science; Automaton; World Wide Web; Information retrieval; Theoretical computer science","score_opus":0.01063045978310218,"score_gpt":0.23367709942396253,"score_spread":0.22304663964086036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077566826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91523594,0.0015720841,0.018930595,0.0035360437,0.0008106833,0.00035740403,0.000014673437,0.0011652721,0.05837731],"genre_scores_gemma":[0.98467,0.00024633156,0.012474272,0.0014541687,0.00009707579,0.0000067998676,0.000004612078,0.000016636035,0.0010301385],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874985,0.00013290472,0.00026981437,0.0003198178,0.00023943695,0.00028815755],"domain_scores_gemma":[0.9976091,0.0003480752,0.000087003296,0.001841734,0.000022917673,0.00009121189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884149,0.0001489776,0.00020908074,0.00006919215,0.00006498163,0.00006618565,0.0022201447,0.000068397516,0.00090928475],"category_scores_gemma":[0.000102162616,0.00012340954,0.000105981846,0.00029258645,0.00006677312,0.000478373,0.00030693185,0.00010780176,0.000414409],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018710973,0.00012228334,0.00012915298,0.000015090018,0.000025420408,0.00001995826,0.0013402218,0.000027981816,0.0025953513,0.1116217,0.0034337165,0.8806504],"study_design_scores_gemma":[0.002278295,0.00047904096,0.012806086,0.00021732257,0.00004965119,0.00014503559,0.0005265187,0.018397728,0.041208297,0.4882295,0.43435755,0.0013049636],"about_ca_topic_score_codex":0.000079225814,"about_ca_topic_score_gemma":0.0000025757943,"teacher_disagreement_score":0.8793455,"about_ca_system_score_codex":0.0000160219,"about_ca_system_score_gemma":0.000046388068,"threshold_uncertainty_score":0.9956031},"labels":[],"label_agreement":null},{"id":"W2077748761","doi":"10.1016/j.ic.2006.09.003","title":"Subword conditions and subword histories","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decidability; Computer science; Automaton; Characterization (materials science); Sequence (biology); Word (group theory); Event (particle physics); Inference; Natural language processing; Artificial intelligence; Theoretical computer science; Linguistics","score_opus":0.0045984480673415705,"score_gpt":0.20736270920620134,"score_spread":0.20276426113885976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077748761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21598513,0.000111658104,0.77827966,0.0011246139,0.00020967788,0.00009528724,0.0000047684084,0.00023110649,0.003958092],"genre_scores_gemma":[0.99329877,0.000008667033,0.006183512,0.0003754803,0.000023772342,0.000006265742,0.000060592243,0.0000016584776,0.00004128394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954754,0.000016467538,0.0001829474,0.00007281417,0.00009844534,0.00008180056],"domain_scores_gemma":[0.99971324,0.000047280413,0.00008422385,0.00006903197,0.000056469613,0.000029750914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009932659,0.00006381014,0.0000613439,0.00009910224,0.00016211584,0.0002550544,0.000066446475,0.000028444987,0.0000040504146],"category_scores_gemma":[0.000006790083,0.000062259234,0.000011579176,0.0001303168,0.00004071295,0.0018831148,0.000040253646,0.000036510024,0.000015502426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027724031,0.000011205958,0.0006813312,0.000019776713,0.000003121689,6.465817e-7,0.0011108618,0.00046468465,0.000044779783,0.88458794,0.0025363045,0.11053656],"study_design_scores_gemma":[0.0009027613,0.000079601814,0.1322023,0.000023446924,0.000008877641,0.00008390478,0.00035020823,0.6078436,0.00026649196,0.20350012,0.054388188,0.00035050616],"about_ca_topic_score_codex":0.000053900545,"about_ca_topic_score_gemma":0.0000069866874,"teacher_disagreement_score":0.77731365,"about_ca_system_score_codex":0.000017890796,"about_ca_system_score_gemma":0.000018981329,"threshold_uncertainty_score":0.25388578},"labels":[],"label_agreement":null},{"id":"W2078594408","doi":"10.1016/j.jnt.2006.06.001","title":"Summation of series defined by counting blocks of digits","year":2006,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Series (stratigraphy); Integer (computer science); Base (topology); Combinatorics; Arithmetic; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.00428322637736832,"score_gpt":0.20377535364454075,"score_spread":0.19949212726717241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078594408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8962336,0.00046565942,0.092517465,0.0001932423,0.00030615643,0.00004818239,0.000027570506,0.000027625669,0.010180462],"genre_scores_gemma":[0.9930009,0.0000127315025,0.006397363,0.000040829327,0.000080528895,4.7190417e-7,0.0000027371639,0.000007045224,0.00045736693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880415,0.000095782554,0.0005909143,0.000080034944,0.00030485645,0.00012428775],"domain_scores_gemma":[0.9983264,0.0003561075,0.00087383133,0.00018789333,0.00022721951,0.000028550738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097526965,0.00008771482,0.00024836566,0.00006542808,0.00003401278,0.000039804174,0.00043868276,0.000045162495,0.00011548385],"category_scores_gemma":[0.00010360174,0.000070832284,0.00010546028,0.00018515078,0.00007509552,0.0006965053,0.00006568838,0.000092479626,0.000003950928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016385653,0.0005813418,0.009003212,0.00014737785,0.00013887741,0.000030680607,0.0011807451,0.0002954301,0.076203644,0.8353239,0.044186216,0.03274471],"study_design_scores_gemma":[0.0011762199,0.0002489687,0.0067140106,0.0005099159,0.00005377594,0.0005855891,0.00042018355,0.0014245518,0.1890541,0.7863141,0.013161934,0.00033666342],"about_ca_topic_score_codex":0.000011717701,"about_ca_topic_score_gemma":0.000001236097,"teacher_disagreement_score":0.112850465,"about_ca_system_score_codex":0.00001750901,"about_ca_system_score_gemma":0.00004662248,"threshold_uncertainty_score":0.28884566},"labels":[],"label_agreement":null},{"id":"W2078614146","doi":"10.1007/s00233-005-0506-0","title":"Levi’s Commutator Theorems for Cancellative Semigroups","year":2005,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Commutator; Mathematics; Mathematical proof; Conjecture; Cancellative semigroup; Pure mathematics; Algebra over a field; Discrete mathematics; Semigroup","score_opus":0.008527195923852666,"score_gpt":0.24261879206204526,"score_spread":0.23409159613819258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078614146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05635301,0.0027941996,0.90604544,0.013427321,0.0012926701,0.0013379592,0.000118146556,0.0013761352,0.017255133],"genre_scores_gemma":[0.9483429,0.00005393938,0.044406515,0.004482487,0.00046512447,0.00016251621,0.000032786713,0.00005596928,0.0019977505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99740475,0.0000941173,0.00046690248,0.00070788566,0.00035055162,0.00097576977],"domain_scores_gemma":[0.9977696,0.00051975314,0.00022083521,0.0011437053,0.00012154808,0.0002245818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071296917,0.00038468704,0.00041134507,0.00014104134,0.00042194716,0.00023393834,0.0016918984,0.00016325706,0.00007088884],"category_scores_gemma":[0.00006908225,0.00034157062,0.00027418396,0.00039699374,0.00014741467,0.000976983,0.00041789506,0.00024871217,0.00016919163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004587075,0.0001633846,0.0005830331,0.00003811998,0.00008402709,0.0000068558866,0.0029338463,0.0002620994,0.0058226357,0.7708812,0.060732387,0.15844657],"study_design_scores_gemma":[0.0022718986,0.0004179931,0.00067067245,0.00014081773,0.00002949097,0.00009180056,0.0014208428,0.1866752,0.03353619,0.14585377,0.6275625,0.0013287694],"about_ca_topic_score_codex":0.00006244648,"about_ca_topic_score_gemma":0.00014561076,"teacher_disagreement_score":0.8919899,"about_ca_system_score_codex":0.00019329255,"about_ca_system_score_gemma":0.00009278241,"threshold_uncertainty_score":0.9999036},"labels":[],"label_agreement":null},{"id":"W2079567772","doi":"10.1016/j.tcs.2014.11.015","title":"Descriptional complexity of unambiguous input-driven pushdown automata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Pushdown automaton; Deterministic pushdown automaton; Nondeterministic algorithm; Embedded pushdown automaton; Discrete mathematics; Homomorphism; Büchi automaton; Two-way deterministic finite automaton; Nested word; Nondeterministic finite automaton; Deterministic automaton; Mathematics; Deterministic context-free grammar; Combinatorics; Automaton; Computer science; Theoretical computer science; Automata theory; Quantum finite automata; Rule-based machine translation; Context-free grammar; Artificial intelligence","score_opus":0.02080017538274525,"score_gpt":0.24438166321694996,"score_spread":0.2235814878342047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079567772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08036755,0.0000101067435,0.9130487,0.0010798757,0.0006746016,0.00012103572,0.000004537454,0.0003677439,0.004325851],"genre_scores_gemma":[0.75350386,0.0000014749909,0.24580984,0.0005684405,0.00009789076,0.000003589004,0.0000025385732,0.0000074472537,0.000004924559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680066,0.0002379035,0.0004557879,0.00080553663,0.0010595337,0.0006405648],"domain_scores_gemma":[0.99754965,0.00029012072,0.00015498606,0.0014281463,0.0002646989,0.00031237537],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022217303,0.00023543672,0.0003589584,0.00024942268,0.00036865383,0.00030995999,0.0042932928,0.00006690416,0.000073312105],"category_scores_gemma":[0.00015639608,0.00019567374,0.00011147454,0.0011303572,0.006976736,0.00078997895,0.00189884,0.00020515439,0.00010345535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073060505,0.00011145352,0.000074625954,0.000011972935,0.0000045211727,0.0000031224513,0.00020156972,0.00018574671,0.0028691285,0.9624186,0.000051026742,0.034060907],"study_design_scores_gemma":[0.00020875946,0.00022306618,0.0039700246,0.00002798042,0.0000030092522,0.00003761056,0.0000021462963,0.5841883,0.0024866965,0.40855286,0.00013395402,0.00016564071],"about_ca_topic_score_codex":0.000010846136,"about_ca_topic_score_gemma":7.8249576e-7,"teacher_disagreement_score":0.6731363,"about_ca_system_score_codex":0.00005888588,"about_ca_system_score_gemma":0.00013378527,"threshold_uncertainty_score":0.9957257},"labels":[],"label_agreement":null},{"id":"W2079923544","doi":"10.1016/j.disc.2009.06.004","title":"Avoiding squares and overlaps over the natural numbers","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Natural number; Combinatorics; Discrete mathematics; Natural (archaeology); Geography","score_opus":0.00740418815523247,"score_gpt":0.23990761968987745,"score_spread":0.23250343153464498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079923544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8470048,0.0012383586,0.13860042,0.002460756,0.0003656257,0.00027799464,0.0000044620665,0.00036981518,0.009677775],"genre_scores_gemma":[0.9869852,0.000022579618,0.011952719,0.00076489965,0.000046368124,0.0000024484675,0.0000010851954,0.000006849211,0.00021783654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916834,0.000050504703,0.00016525413,0.0001846326,0.00021833957,0.00021294813],"domain_scores_gemma":[0.9991435,0.00028692553,0.00008007006,0.0004291149,0.000014875437,0.00004555131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041098834,0.00013167478,0.00013387158,0.000029392666,0.00026870813,0.00030013276,0.00053809024,0.000032583714,0.000010117782],"category_scores_gemma":[0.00009246508,0.000078886755,0.000056907626,0.0001449418,0.000053798998,0.00032237972,0.00013632499,0.000194219,0.000015009599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012948911,0.000020840176,0.00003065871,0.0000214037,0.000011800597,0.00000819306,0.0059360107,0.0000058768937,0.0009384969,0.982063,0.0011131335,0.009849291],"study_design_scores_gemma":[0.0004057645,0.000071859344,0.0075933645,0.00018067127,0.00002526607,0.00016533908,0.002087635,0.32896167,0.0015348054,0.65686786,0.0016295868,0.00047619504],"about_ca_topic_score_codex":0.000003959028,"about_ca_topic_score_gemma":9.498296e-7,"teacher_disagreement_score":0.3289558,"about_ca_system_score_codex":0.000013151729,"about_ca_system_score_gemma":0.000009595471,"threshold_uncertainty_score":0.32169086},"labels":[],"label_agreement":null},{"id":"W2079999463","doi":"10.1006/jnth.2001.2669","title":"Transcendence of Sturmian or Morphic Continued Fractions","year":2001,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Mathematics; Quotient; Sequence (biology); Continued fraction; Transcendental number; Morphism; Combinatorics; Pure mathematics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.020115378591276493,"score_gpt":0.2793692237711556,"score_spread":0.2592538451798791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079999463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4640451,0.00042767473,0.525942,0.0016111317,0.0015062317,0.0001738521,0.00025074632,0.0000934234,0.005949799],"genre_scores_gemma":[0.99315774,0.00010132251,0.0057099867,0.00031837184,0.00015018976,0.0000014601542,0.0000025318752,0.000008175614,0.0005502134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868107,0.00021043974,0.00048696302,0.00011836074,0.00032137177,0.00018180904],"domain_scores_gemma":[0.99835,0.000563365,0.00047188805,0.0003302348,0.00018064868,0.00010382792],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010380597,0.000109430686,0.0002690321,0.00010365881,0.00006303789,0.000044720382,0.0008462911,0.000059977876,0.0015287633],"category_scores_gemma":[0.00015018987,0.00007671757,0.00017507521,0.0003469557,0.00008883717,0.00065685774,0.000038950675,0.00025774338,0.00003239099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025748021,0.003232919,0.010587972,0.00016825665,0.0011331065,0.003964684,0.009908964,0.00044042527,0.044457965,0.4840855,0.15210453,0.28734088],"study_design_scores_gemma":[0.0061689243,0.0012605852,0.05874361,0.0012538406,0.00029478068,0.02337908,0.0030550882,0.002482839,0.014204758,0.62398976,0.26392326,0.0012434681],"about_ca_topic_score_codex":0.000006010034,"about_ca_topic_score_gemma":0.0000049133782,"teacher_disagreement_score":0.52911264,"about_ca_system_score_codex":0.00002437456,"about_ca_system_score_gemma":0.00010580727,"threshold_uncertainty_score":0.999384},"labels":[],"label_agreement":null},{"id":"W2080845342","doi":"10.1017/s0004972709000616","title":"COMBINATORIAL REES–SUSHKEVICH VARIETIES THAT ARE CROSS, FINITELY GENERATED, OR SMALL","year":2009,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subvariety; Mathematics; Variety (cybernetics); Combinatorics; Finitely-generated abelian group; Set (abstract data type); Generating set of a group; Lattice (music); Discrete mathematics; Pure mathematics; Computer science; Geometry","score_opus":0.045881738060110366,"score_gpt":0.2660268186568844,"score_spread":0.220145080596774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080845342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6781291,0.0003910585,0.12470703,0.17061587,0.0046206773,0.0029566186,0.000109946224,0.0019789832,0.016490722],"genre_scores_gemma":[0.9185855,0.00002042714,0.063903965,0.002831254,0.00027014763,0.000018658093,0.0000030520923,0.000029308843,0.014337682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794656,0.000149938,0.00048979814,0.00040555242,0.000527373,0.00048078984],"domain_scores_gemma":[0.9979661,0.00036069963,0.0003431114,0.0010814387,0.000117667645,0.00013099724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086085143,0.00028747506,0.0004358969,0.000015398107,0.00028585506,0.0003142011,0.0020878292,0.00024781516,0.000638208],"category_scores_gemma":[0.00024155532,0.00017571042,0.00046717652,0.00028726883,0.00031266906,0.00007191129,0.00038886818,0.0003450624,0.00014273348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000504549,0.0007238528,0.000501634,0.0002991601,0.00011964317,0.000013670124,0.0016800925,0.000082936334,0.00068221113,0.77232623,0.22251052,0.001009593],"study_design_scores_gemma":[0.0023471697,0.0004081987,0.012583675,0.0005552957,0.00010121419,0.00011517195,0.00064649753,0.0038843325,0.026562946,0.8762961,0.07545524,0.0010441727],"about_ca_topic_score_codex":0.000013193661,"about_ca_topic_score_gemma":3.7992115e-7,"teacher_disagreement_score":0.2404564,"about_ca_system_score_codex":0.00004630283,"about_ca_system_score_gemma":0.000056560082,"threshold_uncertainty_score":0.71652627},"labels":[],"label_agreement":null},{"id":"W2081090714","doi":"10.1051/ita:2005038","title":"On Christoffel classes","year":2005,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Mathematics; Computer science; Arithmetic; Pure mathematics","score_opus":0.005503843000699254,"score_gpt":0.23442778575729287,"score_spread":0.2289239427565936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081090714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006741637,0.000058917652,0.9391026,0.0020927368,0.000022560504,0.00021748942,0.000008072863,0.00019912187,0.05155685],"genre_scores_gemma":[0.9373593,0.000057705205,0.05960417,0.0026825026,0.00009500223,0.000100951176,0.0000070634746,0.000007072133,0.00008624723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992388,0.000014640767,0.00027446912,0.00012062162,0.000154842,0.0001966281],"domain_scores_gemma":[0.9990338,0.00027958257,0.00006466123,0.00046394003,0.000028127894,0.00012986477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020570176,0.00011523552,0.00011531772,0.00005801428,0.00018373801,0.0001698735,0.00043363732,0.000057829136,0.000053439555],"category_scores_gemma":[0.000020374828,0.00009010233,0.000038894155,0.00016341338,0.00025650123,0.00026425126,0.00014754306,0.00012808469,0.0002950218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011789435,0.000045295874,0.0000020710893,0.000008115573,0.000003789432,9.159692e-8,0.00019236462,0.00004843458,0.000018603145,0.914645,0.0008548173,0.08418024],"study_design_scores_gemma":[0.00019650931,0.000045766792,0.000053158823,0.000012974041,0.000005668462,0.00001331621,0.00007989478,0.3142241,0.00037123734,0.6091459,0.07568579,0.0001657413],"about_ca_topic_score_codex":3.2852932e-7,"about_ca_topic_score_gemma":1.5277749e-7,"teacher_disagreement_score":0.93061763,"about_ca_system_score_codex":0.000017008872,"about_ca_system_score_gemma":0.000016817796,"threshold_uncertainty_score":0.3792007},"labels":[],"label_agreement":null},{"id":"W2081745941","doi":"10.1016/j.tcs.2012.03.043","title":"Lower bounds for the size of deterministic unranked tree automata","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; Automaton; Deterministic finite automaton; Deterministic automaton; Mathematics; Combinatorics; Upper and lower bounds; Tree (set theory); Discrete mathematics; Regular language; Computer science; Automata theory; Theoretical computer science","score_opus":0.013030139263550754,"score_gpt":0.2616167939493669,"score_spread":0.24858665468581612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081745941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03175521,0.00009147677,0.96363866,0.00087139447,0.0017585088,0.00029452782,0.0000048496668,0.0001871513,0.0013982154],"genre_scores_gemma":[0.8989343,0.0000032037806,0.10014303,0.00064279325,0.00022759239,0.00002066695,2.9289924e-7,0.000010127199,0.000018010038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976399,0.000090979076,0.0003643415,0.00045588345,0.0006339855,0.0008149029],"domain_scores_gemma":[0.99475694,0.0033062494,0.00012532582,0.0014196782,0.00015026139,0.00024152565],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003072004,0.00020364656,0.00026114186,0.00008136944,0.0004877332,0.00029162504,0.003988701,0.000054130185,0.00003599824],"category_scores_gemma":[0.00040150233,0.00012645382,0.00014076672,0.0007860729,0.0036139365,0.0007454467,0.0010462314,0.00012343675,0.000028176251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001462426,0.00010526474,0.000031532792,0.000011631285,0.0000067941132,0.000001125983,0.000435096,0.000012815042,0.00089780905,0.9310525,0.0000978453,0.06733297],"study_design_scores_gemma":[0.00046886457,0.00037056865,0.004936528,0.00003499812,0.000023859882,0.00005285732,0.000013982091,0.8153443,0.005059329,0.17255011,0.00086306315,0.00028153986],"about_ca_topic_score_codex":0.0000019639242,"about_ca_topic_score_gemma":2.706909e-7,"teacher_disagreement_score":0.8671791,"about_ca_system_score_codex":0.000035354635,"about_ca_system_score_gemma":0.000113959446,"threshold_uncertainty_score":0.99909765},"labels":[],"label_agreement":null},{"id":"W2082135431","doi":"10.1016/j.ipl.2004.09.007","title":"Pattern expressions and pattern automata","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Automaton; Computer science; Regular expression; Theoretical computer science; Mathematics; Programming language","score_opus":0.006898938926469907,"score_gpt":0.20985433685877816,"score_spread":0.20295539793230827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082135431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103637286,0.000030099332,0.88636786,0.008937798,0.0001360999,0.000077986086,0.0000031081813,0.0004430478,0.00036673207],"genre_scores_gemma":[0.97474885,0.0000046534365,0.008028676,0.017151205,0.000032559008,0.000015800202,0.000008817954,0.000005689535,0.0000037605985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903786,0.000015045515,0.0002697429,0.00014725067,0.00030968495,0.00022041178],"domain_scores_gemma":[0.9994185,0.000020017524,0.00015391632,0.00028098308,0.00005016525,0.00007643843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020511409,0.00012724327,0.000096609445,0.00013482037,0.0002262716,0.0006443151,0.00043326808,0.00004209051,0.0000054764755],"category_scores_gemma":[0.000023643544,0.000110232904,0.000024095332,0.00017064436,0.00004891772,0.004966747,0.00018305027,0.00010838456,0.00007734294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.622065e-7,0.000016114069,0.00021700512,0.00008619431,0.000004514358,0.0000053668596,0.0058452105,0.0003093192,0.0017612682,0.000666184,0.0009272202,0.99016064],"study_design_scores_gemma":[0.0142663075,0.0003387222,0.09071013,0.0044206865,0.00007369049,0.0013846215,0.0029102988,0.72245115,0.043168608,0.027583364,0.0876664,0.005026033],"about_ca_topic_score_codex":0.000026494563,"about_ca_topic_score_gemma":8.5242664e-7,"teacher_disagreement_score":0.9851346,"about_ca_system_score_codex":0.000045794794,"about_ca_system_score_gemma":0.00004751646,"threshold_uncertainty_score":0.6213145},"labels":[],"label_agreement":null},{"id":"W2082407347","doi":"10.1016/j.tcs.2010.06.016","title":"On the number of episturmian palindromes","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Euler's totient function; Palindrome; Mathematics; Alphabet; Combinatorics; Function (biology); Euler's formula; Prefix; Enumeration; Generalization; Discrete mathematics; Mathematical analysis","score_opus":0.006382837415070408,"score_gpt":0.2457086827320534,"score_spread":0.239325845316983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082407347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5510503,0.0000023050663,0.43280444,0.002966761,0.0008902505,0.00009771559,0.0000011973142,0.00011291952,0.0120741],"genre_scores_gemma":[0.948618,6.357677e-7,0.050171927,0.0011142325,0.00007517732,0.0000039740066,1.4676779e-7,0.000005331943,0.000010599272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816567,0.00009103844,0.00022640458,0.0004640852,0.0006560693,0.0003967389],"domain_scores_gemma":[0.9973132,0.000990643,0.00007860664,0.0013575766,0.00011162416,0.00014833009],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020512247,0.00014439542,0.00016442564,0.000072343326,0.00031141628,0.00023043121,0.0039608837,0.000048783033,0.00026276396],"category_scores_gemma":[0.000203341,0.00008204583,0.000076102275,0.0008195802,0.003973593,0.00027534403,0.00082838914,0.00037978173,0.00020463012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023366833,0.00004562374,0.00007242685,0.0000020375169,0.0000021487065,0.000004080688,0.00020105817,0.000004773267,0.0017908205,0.97977054,0.00006667542,0.018037476],"study_design_scores_gemma":[0.000090797665,0.00006446606,0.0027763818,0.000016451902,0.0000017850181,0.000057990223,0.000004349193,0.11570573,0.015383087,0.8656895,0.00007422769,0.0001351877],"about_ca_topic_score_codex":0.000002971814,"about_ca_topic_score_gemma":3.645132e-7,"teacher_disagreement_score":0.39756766,"about_ca_system_score_codex":0.000009856174,"about_ca_system_score_gemma":0.00008305298,"threshold_uncertainty_score":0.99873704},"labels":[],"label_agreement":null},{"id":"W2082599205","doi":"10.2478/s11533-010-0080-x","title":"Finite basis problem for 2-testable monoids","year":2010,"lang":"en","type":"article","venue":"Open Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Basis (linear algebra); Mathematics; Computer science; Algebra over a field; Pure mathematics; Geometry","score_opus":0.02438132521933019,"score_gpt":0.2764024682013677,"score_spread":0.25202114298203754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082599205","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076731425,0.000012348635,0.96095693,0.0007535526,0.00024440244,0.00088565523,0.000013242431,0.00015077772,0.029309925],"genre_scores_gemma":[0.02804896,0.0000028657782,0.96737254,0.00026277,0.00004855209,0.00016683269,0.000003888008,0.000020135736,0.004073477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910414,0.000012583335,0.00023799438,0.0002527218,0.0001310478,0.00026149218],"domain_scores_gemma":[0.9984596,0.00045237428,0.00011731575,0.00082449423,0.000068973095,0.000077246776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080270146,0.00012538431,0.00019787198,0.000040510564,0.00015681787,0.0007108634,0.0021276425,0.00006301392,0.000111397756],"category_scores_gemma":[0.0001370305,0.000103191596,0.000055363293,0.00017872077,0.00002696045,0.0006388258,0.00062736863,0.00011390154,0.00014163779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018039427,0.00018769717,0.000023759723,0.000100971745,0.000014076424,0.0000020434743,0.0010655719,0.000023306562,0.0048528383,0.96583855,0.0062819417,0.021607427],"study_design_scores_gemma":[0.00039209583,0.000063101106,0.000017721217,0.000047149337,0.000010924798,0.000013434119,0.00008003236,0.28569588,0.012547295,0.6701015,0.030774012,0.00025679372],"about_ca_topic_score_codex":0.000010025559,"about_ca_topic_score_gemma":0.000009391034,"teacher_disagreement_score":0.295737,"about_ca_system_score_codex":0.000008239652,"about_ca_system_score_gemma":0.000056656845,"threshold_uncertainty_score":0.6854872},"labels":[],"label_agreement":null},{"id":"W2082624313","doi":"10.2478/s11533-010-0014-7","title":"The isomorphism relation between tree-automatic Structures","year":2010,"lang":"en","type":"article","venue":"Open Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Commutative property; Isomorphism (crystallography); Nilpotent; Class (philosophy); Axiom; Relation (database); Tree (set theory)","score_opus":0.021309936758154693,"score_gpt":0.2735118164798898,"score_spread":0.25220187972173513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082624313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4918553,0.000104082814,0.4379117,0.00602424,0.001595851,0.0016087366,0.0000113126525,0.0006417809,0.060247026],"genre_scores_gemma":[0.6918947,0.0000057101624,0.30659565,0.00016481386,0.00012885538,0.000029165203,0.0000047877784,0.00002223691,0.0011540528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988672,0.000051446612,0.00033847053,0.00021080785,0.00030103014,0.00023105029],"domain_scores_gemma":[0.9978067,0.00072081335,0.00022248794,0.0011374756,0.000041520365,0.00007097347],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010180762,0.00014126119,0.00019185783,0.000034997087,0.00044995348,0.0012220227,0.0032298139,0.000081441234,0.00006940927],"category_scores_gemma":[0.00017720758,0.00008746043,0.000050680857,0.00020252781,0.00008274727,0.00056122616,0.00075103244,0.00025336977,0.00019056874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.465043e-7,0.000020262129,0.00011842837,0.0000138969635,0.000017929633,0.00000203304,0.00090647663,0.0000015334731,0.00091174315,0.90084547,0.0017545467,0.09540733],"study_design_scores_gemma":[0.00021140507,0.0000242289,0.0072532445,0.000025968426,0.0000158754,0.000026352436,0.00009540186,0.07756539,0.0014553806,0.9073355,0.0058010225,0.00019024065],"about_ca_topic_score_codex":0.00001024425,"about_ca_topic_score_gemma":0.000019981493,"teacher_disagreement_score":0.20003942,"about_ca_system_score_codex":0.000012374692,"about_ca_system_score_gemma":0.000044274428,"threshold_uncertainty_score":0.9998148},"labels":[],"label_agreement":null},{"id":"W2083006134","doi":"10.1016/j.tcs.2013.03.001","title":"Infinite ternary square-free words concatenated from permutations of a single word","year":2013,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Ternary operation; Square-free integer; Morphism; Combinatorics; Word (group theory); Square (algebra); Mathematics; Factorization; Discrete mathematics; Arithmetic; Computer science; Algorithm; Geometry","score_opus":0.0166314847851349,"score_gpt":0.24482904076071738,"score_spread":0.22819755597558247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083006134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32333577,0.00011039889,0.67167807,0.0010756607,0.0014364171,0.00035007574,0.000060254122,0.00039986937,0.0015534735],"genre_scores_gemma":[0.8244915,0.0000093521685,0.1747582,0.00046038837,0.00019050577,0.000032306685,0.000021314916,0.00002312043,0.000013331907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952427,0.00029508426,0.00086635235,0.0015600607,0.0012498118,0.0007859679],"domain_scores_gemma":[0.99418116,0.0009827453,0.00046596062,0.0034688907,0.0004943648,0.00040690828],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011188524,0.00051794207,0.00071184506,0.0004995292,0.00027456536,0.0010525022,0.010176478,0.00027230708,0.000231855],"category_scores_gemma":[0.00027635356,0.0004409312,0.00023477283,0.0012676702,0.004730262,0.0007875411,0.012576336,0.0007267772,0.000102722785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011878479,0.00025894336,0.000106114305,0.000045624467,0.00003798324,0.000029491825,0.0027551705,0.00079011044,0.004605883,0.963147,0.00026705916,0.027944775],"study_design_scores_gemma":[0.00025404396,0.00011605739,0.0018017122,0.00027002118,0.000016097025,0.000010778651,0.000018633857,0.45673552,0.003298793,0.53706163,0.000035273755,0.0003814342],"about_ca_topic_score_codex":0.00013403299,"about_ca_topic_score_gemma":0.0000019211507,"teacher_disagreement_score":0.50115573,"about_ca_system_score_codex":0.00013110971,"about_ca_system_score_gemma":0.0003737189,"threshold_uncertainty_score":0.9999845},"labels":[],"label_agreement":null},{"id":"W2083734106","doi":"10.2168/lmcs-8(2:8)2012","title":"Width and size of regular resolution proofs","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Resolution (logic); Mathematical proof; Set (abstract data type); Mathematics; Contrast (vision); Discrete mathematics; Computer science; Combinatorics; Geometry; Programming language; Artificial intelligence","score_opus":0.045881018830954245,"score_gpt":0.36079444825693907,"score_spread":0.3149134294259848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083734106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05960877,0.0004175795,0.93879044,0.0002169525,0.0004896184,0.00011552641,2.4823024e-7,0.00006920421,0.00029168208],"genre_scores_gemma":[0.3725104,0.000006591537,0.6272467,0.00017955853,0.000046611825,0.0000037477132,3.3524387e-8,0.0000018112127,0.0000045540455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979984,0.00044157132,0.0002963246,0.00045887943,0.00033574374,0.0004690776],"domain_scores_gemma":[0.9982251,0.00090176566,0.00010825678,0.0005496114,0.00005492057,0.00016035412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065520187,0.00011863941,0.00022753874,0.000100844896,0.00010004055,0.00008583034,0.0011439222,0.000062355226,0.0000048909865],"category_scores_gemma":[0.0004461749,0.00008876089,0.00003425078,0.0011648491,0.00064507924,0.0009377563,0.0011022544,0.0001373968,0.0000020268062],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037385691,0.000103817314,0.0022700902,0.00001447763,0.0000014809493,0.0000027359238,0.00053744804,0.00009430807,0.014213135,0.24954444,0.000013444869,0.7332009],"study_design_scores_gemma":[0.00027146933,0.0002079538,0.2103188,0.00006204665,0.0000026486437,0.0000685896,0.000007371647,0.5319167,0.021530012,0.23499338,0.00035876135,0.00026228165],"about_ca_topic_score_codex":0.0000059410813,"about_ca_topic_score_gemma":1.8560844e-7,"teacher_disagreement_score":0.7329386,"about_ca_system_score_codex":0.00003429247,"about_ca_system_score_gemma":0.000032336608,"threshold_uncertainty_score":0.36195642},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02637070741872171,"score_gpt":0.3423945622337794,"score_spread":0.3160238548150577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083735143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3509693,0.000012325089,0.64728135,0.0003126385,0.001082198,0.000057324658,7.320129e-7,0.000007524959,0.00027659198],"genre_scores_gemma":[0.7733172,0.0000037925404,0.2265732,0.000041667423,0.000053248805,0.0000010540944,1.5781481e-7,0.0000023053317,0.000007349495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975227,0.00010807824,0.00070479384,0.0001794959,0.0013232558,0.00016166121],"domain_scores_gemma":[0.99673617,0.00027438844,0.00079888396,0.00039143296,0.0017052323,0.00009387257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017431756,0.00008719952,0.00018660605,0.0005686728,0.000119492535,0.00017996396,0.0021985555,0.000021428694,0.000021011665],"category_scores_gemma":[0.00034852372,0.00007135206,0.000089179266,0.0006029476,0.0002578607,0.0032028153,0.00036781686,0.00012830576,0.00000250341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004110778,0.0033490388,0.0021735567,0.000008345903,0.00017871973,0.000074965195,0.005135695,0.0043559386,0.019275373,0.91703564,0.00041380376,0.047957793],"study_design_scores_gemma":[0.013570419,0.009559941,0.10047321,0.0011988636,0.00018024261,0.0077434042,0.0046205265,0.43559173,0.17595302,0.23711698,0.012444829,0.0015468526],"about_ca_topic_score_codex":0.0000054224056,"about_ca_topic_score_gemma":0.0000010030378,"teacher_disagreement_score":0.6799187,"about_ca_system_score_codex":0.00005013187,"about_ca_system_score_gemma":0.0005836465,"threshold_uncertainty_score":0.40855},"labels":[],"label_agreement":null},{"id":"W2083770519","doi":"10.1016/s0304-3975(03)00090-2","title":"The ring of k-regular sequences, II","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":227,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ring (chemistry); Mathematics; State (computer science); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm","score_opus":0.007250582662101844,"score_gpt":0.22411700245009575,"score_spread":0.2168664197879939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083770519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06710277,0.00017092645,0.9233615,0.0005763442,0.0006494941,0.000101031445,4.2882758e-7,0.00012213302,0.00791537],"genre_scores_gemma":[0.90238583,0.000009474594,0.09736092,0.00018470612,0.000032610205,0.0000033526103,6.353857e-8,0.0000044799335,0.000018590548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781114,0.00017347369,0.00029650467,0.0004808563,0.00068913045,0.0005488676],"domain_scores_gemma":[0.9980484,0.0004313071,0.00009462692,0.0011208002,0.000144865,0.00015998769],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003444177,0.00014255666,0.0001651167,0.00008337495,0.0010744322,0.00028112918,0.0033735516,0.000034570672,0.000017576147],"category_scores_gemma":[0.00018456671,0.00008803337,0.00007025162,0.0011010166,0.004385062,0.00048184715,0.0009340388,0.00014124578,0.000017675355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012288667,0.000021255317,0.000015652253,0.000002514642,0.0000026369328,0.0000031730735,0.00023134454,0.000067974106,0.0017972857,0.9692131,0.000019222252,0.0286246],"study_design_scores_gemma":[0.00012619345,0.00014539278,0.00019745328,0.000026213844,0.000002594456,0.00005489817,0.000015626265,0.20039515,0.050678577,0.74712306,0.001073825,0.00016101351],"about_ca_topic_score_codex":0.0000020714622,"about_ca_topic_score_gemma":2.5927534e-7,"teacher_disagreement_score":0.83528304,"about_ca_system_score_codex":0.000032246433,"about_ca_system_score_gemma":0.00013261741,"threshold_uncertainty_score":0.99832445},"labels":[],"label_agreement":null},{"id":"W2083810917","doi":"10.1016/j.tcs.2011.06.021","title":"Finite state complexity","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite-state machine; Upper and lower bounds; Turing machine; Descriptive complexity theory; Deterministic finite automaton; Prefix; Finite set; State (computer science); Kolmogorov complexity; Finite state; Complexity class; Discrete mathematics; Time complexity; Algorithm","score_opus":0.0383737367207392,"score_gpt":0.24576939112310286,"score_spread":0.20739565440236366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083810917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026988598,0.000015035423,0.9552984,0.00022084764,0.0006266588,0.00010842536,0.000002245898,0.0004974395,0.016242316],"genre_scores_gemma":[0.72668695,0.0000021421508,0.27240872,0.0008380239,0.0000422223,0.0000032964224,3.1691397e-7,0.0000061566516,0.000012189591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751294,0.000117228905,0.00028226693,0.0007650885,0.00059963897,0.0007228495],"domain_scores_gemma":[0.9980124,0.00020531694,0.00007380329,0.0012139453,0.00014405652,0.00035045223],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016010731,0.0002018242,0.00020840805,0.00018085186,0.00041109865,0.00032700453,0.0040383483,0.00003458292,0.00021431067],"category_scores_gemma":[0.00006232904,0.00016094891,0.00007330882,0.0011101273,0.0045892186,0.00096650963,0.0017336634,0.0001929252,0.00040918385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000543659,0.000064840686,0.00003925251,0.0000029757227,0.0000027122219,0.00004042682,0.0011713154,0.000013639867,0.00009565852,0.95842344,0.000031346703,0.040108956],"study_design_scores_gemma":[0.00010853955,0.00011581095,0.0018492792,0.000010258553,0.0000014007148,0.00003933788,0.0000033324234,0.38127702,0.003928782,0.6124152,0.00006906161,0.0001819911],"about_ca_topic_score_codex":0.000010404755,"about_ca_topic_score_gemma":6.233664e-7,"teacher_disagreement_score":0.6996983,"about_ca_system_score_codex":0.00003630147,"about_ca_system_score_gemma":0.000094637886,"threshold_uncertainty_score":0.9981197},"labels":[],"label_agreement":null},{"id":"W2083924351","doi":"10.1016/j.jpaa.2009.12.014","title":"A combinatorial property of ideals in free profinite monoids","year":2010,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Profinite group; Property (philosophy); Pure mathematics; Group (periodic table); Epistemology","score_opus":0.007533398024884377,"score_gpt":0.215091121964385,"score_spread":0.20755772393950064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083924351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933967,0.00023794708,0.0019894615,0.0012033348,0.00083373784,0.0001324846,0.0000017588502,0.000014061919,0.0021905007],"genre_scores_gemma":[0.99469227,0.000022223376,0.0048864856,0.00012951499,0.0002325915,0.0000032205173,1.8414988e-7,0.0000059975678,0.000027499582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907875,0.000025530973,0.00039789663,0.00012079991,0.00022524089,0.00015176335],"domain_scores_gemma":[0.99925286,0.000069059395,0.00028173273,0.00025587864,0.00006088305,0.00007960014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077014137,0.000095276824,0.0002655942,0.00012686563,0.0000275959,0.00005834439,0.00062531134,0.00008911064,0.000010205501],"category_scores_gemma":[0.00004210069,0.000058871974,0.00004947678,0.00020231426,0.000058479378,0.00026221917,0.00012680881,0.00037621232,0.0000016039621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043328782,0.00016231758,0.00045180426,0.000034996458,0.000018333843,0.000023539662,0.00071723067,0.0000025710656,0.08381639,0.8769673,0.0014245677,0.036337607],"study_design_scores_gemma":[0.002602633,0.00026551943,0.0038653552,0.00007815091,0.0000131376,0.00012870939,0.00011863042,0.00043719486,0.045312617,0.9438112,0.003172718,0.00019417584],"about_ca_topic_score_codex":0.000005194496,"about_ca_topic_score_gemma":0.0000043986893,"teacher_disagreement_score":0.06684384,"about_ca_system_score_codex":0.00000574255,"about_ca_system_score_gemma":0.00007112583,"threshold_uncertainty_score":0.24007294},"labels":[],"label_agreement":null},{"id":"W2084344766","doi":"10.1007/s00153-009-0136-4","title":"The equivalence of theories that characterize ALogTime","year":2009,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Word problem (mathematics education); Permutation (music); Equivalence (formal languages); Combinatorics; Equivalence relation; Discrete mathematics; Characterization (materials science); Algebra over a field; Pure mathematics; Arithmetic","score_opus":0.0286124315755724,"score_gpt":0.26472884710453476,"score_spread":0.23611641552896237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084344766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008680558,0.00010233231,0.98146605,0.0026415314,0.00007887293,0.0003156372,0.000019206966,0.00011275724,0.0065830504],"genre_scores_gemma":[0.92487925,0.000027691858,0.07422457,0.0005923012,0.0000358253,0.00003058875,0.000003928363,0.000005776469,0.0002000447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899656,0.00006661223,0.00024088279,0.00020800649,0.0001865102,0.00030143105],"domain_scores_gemma":[0.9971134,0.0021250336,0.00012520658,0.00055203703,0.000029302033,0.000055037814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006006666,0.00012388747,0.00020982439,0.000027072087,0.00017249989,0.00007870739,0.0011409471,0.000028162565,0.0000158684],"category_scores_gemma":[0.00027759076,0.00006721191,0.00013470938,0.00008371836,0.00023664733,0.00016532328,0.00015619626,0.00007288333,0.00003348697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000124004455,0.00005569137,0.0000026950584,0.000022193106,0.000007710444,0.0000012933908,0.00035773008,6.1717185e-7,0.0041082785,0.9777141,0.00009095071,0.017626291],"study_design_scores_gemma":[0.00011432488,0.00023283031,0.000978505,0.000038509632,0.000005885836,0.000013673077,0.00003238772,0.008292907,0.0034794726,0.9863716,0.00034800108,0.000091944275],"about_ca_topic_score_codex":3.0959555e-7,"about_ca_topic_score_gemma":1.2129307e-7,"teacher_disagreement_score":0.91619873,"about_ca_system_score_codex":0.000005483748,"about_ca_system_score_gemma":0.000016184315,"threshold_uncertainty_score":0.27408224},"labels":[],"label_agreement":null},{"id":"W2084532813","doi":"10.1016/j.ic.2009.03.004","title":"Variants of codes and indecomposable languages","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Catenation; Extension (predicate logic); Indecomposable module; Computer science; Prefix code; Regular language; Code (set theory); Prime (order theory); Decomposition; Mathematics; Programming language; Discrete mathematics; Algebra over a field; Pure mathematics; Automaton; Combinatorics; Theoretical computer science; Algorithm; Decoding methods; Linear code; Set (abstract data type)","score_opus":0.005621339309925413,"score_gpt":0.243609034690517,"score_spread":0.23798769538059159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084532813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35719565,0.00008023336,0.63969415,0.00032799577,0.000030064899,0.000053702894,0.0000017804142,0.00006202335,0.0025544344],"genre_scores_gemma":[0.98474014,0.000016386948,0.014799779,0.00042575822,0.000004779459,4.83381e-7,0.000008005588,5.01074e-7,0.000004195832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968946,0.000013175781,0.00013608857,0.000042849682,0.00007010207,0.00004832384],"domain_scores_gemma":[0.99978757,0.000029146619,0.000076638695,0.000050870858,0.000033970573,0.00002180283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012271461,0.000038321916,0.000058513153,0.000068951995,0.000037765727,0.000088432585,0.0000597375,0.000019678184,0.000001477111],"category_scores_gemma":[0.000008430462,0.000034214332,0.000006646528,0.000084228595,0.000012421324,0.0010853305,0.000021961723,0.000021799198,0.0000031368595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003867475,0.0000121655485,0.00020086998,0.000016417285,0.0000034612183,3.2235903e-7,0.0025034063,0.00037899773,0.0002604195,0.17260355,0.00015962384,0.8238569],"study_design_scores_gemma":[0.0005219078,0.00012628037,0.18284059,0.000029529527,0.0000030285619,0.000029402963,0.00035952515,0.7708479,0.0009381083,0.04382916,0.000366495,0.00010803054],"about_ca_topic_score_codex":0.000007607128,"about_ca_topic_score_gemma":3.0200889e-7,"teacher_disagreement_score":0.8237489,"about_ca_system_score_codex":0.0000030642323,"about_ca_system_score_gemma":0.000008298304,"threshold_uncertainty_score":0.139522},"labels":[],"label_agreement":null},{"id":"W2084593271","doi":"10.1016/j.jcta.2003.12.004","title":"Polynomial versus exponential growth in repetition-free binary words","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Exponential growth; Binary number; Mathematics; Exponential function; Polynomial; Repetition (rhetorical device); Combinatorics; Discrete mathematics; Exponential polynomial; Arithmetic; Mathematical analysis","score_opus":0.007989040553793911,"score_gpt":0.22204206467397514,"score_spread":0.21405302412018123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084593271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9482509,0.0005239435,0.010721421,0.0029951187,0.034551486,0.00017299644,0.0000054278826,0.00011502948,0.0026637027],"genre_scores_gemma":[0.9950374,0.00007679139,0.0034386273,0.00008669975,0.0012967676,0.000003858262,0.000001018907,0.000017607295,0.0000412483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796164,0.00028105822,0.000678625,0.00022816515,0.00051162473,0.0003388616],"domain_scores_gemma":[0.9984447,0.00028904778,0.00044317255,0.0005137648,0.00016341323,0.0001459294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001618246,0.00020840605,0.0003889628,0.0003276009,0.00012513473,0.00018358437,0.0016745651,0.00012531372,0.00005073114],"category_scores_gemma":[0.00052915816,0.00018828621,0.00021107367,0.0005122453,0.0001504883,0.0018392802,0.00039980546,0.0004018925,0.000009745196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003150994,0.00027585283,0.00003373059,0.000010035473,0.00004501676,0.00039912105,0.0010111128,0.00005738287,0.0012397143,0.9922506,0.0008150358,0.0007113837],"study_design_scores_gemma":[0.010952404,0.0017186885,0.000495674,0.00013663643,0.000018074472,0.00023859338,0.0004136752,0.000017595456,0.007108821,0.97651803,0.0021048172,0.00027696782],"about_ca_topic_score_codex":0.000018979195,"about_ca_topic_score_gemma":0.0000037634668,"teacher_disagreement_score":0.046786506,"about_ca_system_score_codex":0.00020994946,"about_ca_system_score_gemma":0.0003078594,"threshold_uncertainty_score":0.76780885},"labels":[],"label_agreement":null},{"id":"W2084661883","doi":"10.1016/j.tcs.2009.02.025","title":"State complexity of power","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Combinatorics; Nondeterministic algorithm; Alphabet; Regular language; Nondeterministic finite automaton; Deterministic finite automaton; State (computer science); Upper and lower bounds; Mathematics; Finite-state machine; Function (biology); Discrete mathematics; Time complexity; Constant (computer programming); Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.014499479140722055,"score_gpt":0.25283446374698176,"score_spread":0.2383349846062597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084661883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12442635,0.000020780957,0.86792445,0.0012025035,0.00027414045,0.0000851934,0.0000017290461,0.0001950934,0.0058697495],"genre_scores_gemma":[0.84513146,0.0000015137848,0.15390222,0.0009349496,0.000021432734,5.5526795e-7,2.1912852e-7,0.0000028433822,0.000004806181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979284,0.000080905986,0.00030406343,0.00053034764,0.0006576062,0.00049867533],"domain_scores_gemma":[0.9984318,0.0001203853,0.000090856025,0.0009751833,0.00016612008,0.00021562616],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013259596,0.0001529611,0.00023526655,0.00016055269,0.00018917053,0.00019212674,0.0029505931,0.000028162707,0.00005419795],"category_scores_gemma":[0.00004366805,0.000120651646,0.00007282802,0.0010567193,0.0038818654,0.00062966644,0.0005948455,0.00013231841,0.00004602071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049501987,0.00007492788,0.00001227856,0.0000018089833,0.0000014692683,0.000006338805,0.00035976485,0.000031889987,0.0026267355,0.9495188,0.00003544216,0.047325592],"study_design_scores_gemma":[0.000138035,0.00032059936,0.006693724,0.00001682772,0.0000011480345,0.00002151973,0.000002612713,0.18661354,0.016494147,0.78951335,0.00003492491,0.00014956291],"about_ca_topic_score_codex":0.0000016263698,"about_ca_topic_score_gemma":8.405154e-8,"teacher_disagreement_score":0.7207051,"about_ca_system_score_codex":0.000027206554,"about_ca_system_score_gemma":0.00008314677,"threshold_uncertainty_score":0.998829},"labels":[],"label_agreement":null},{"id":"W2084802325","doi":"10.1016/j.ejc.2007.01.002","title":"Characterizations of finite and infinite episturmian words via lexicographic orderings","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Lexicographical order; Mathematics; Alphabet; Finite set; Combinatorics on words; Order (exchange); Characterization (materials science); Combinatorics; Skew; Set (abstract data type); Infinite set; Infinite product; Discrete mathematics; Word (group theory); Mathematical analysis; Linguistics; Computer science","score_opus":0.007909369142483323,"score_gpt":0.2068976660720896,"score_spread":0.19898829692960626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084802325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41181797,0.00030656508,0.5852535,0.00017660075,0.0005486418,0.0000336109,8.975306e-7,0.00002829285,0.0018339751],"genre_scores_gemma":[0.9961649,0.00015414094,0.0034160062,0.00014921045,0.00005777286,8.8122654e-8,6.705132e-7,0.000015887847,0.00004128496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99867934,0.000157931,0.0005909636,0.000120299395,0.00026362564,0.0001878401],"domain_scores_gemma":[0.9985613,0.0002084985,0.0005986927,0.00025956472,0.0002244014,0.00014750163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019616678,0.00012214191,0.0002127126,0.0003803049,0.00008324228,0.0000785744,0.0006310712,0.000022619648,0.00000454665],"category_scores_gemma":[0.00011935258,0.000109956425,0.000078333345,0.0007907544,0.00008476929,0.00042180537,0.00017869251,0.00023128984,0.000003824329],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009945275,0.00084410806,0.056258924,0.0001742046,0.00020195107,0.0014152044,0.008661625,0.00009701849,0.018593328,0.6758038,0.0002939135,0.23755649],"study_design_scores_gemma":[0.003475758,0.002100559,0.8830508,0.00051694055,0.00007446441,0.0009824977,0.00022196115,0.0035977084,0.005277405,0.066260576,0.033595577,0.0008457743],"about_ca_topic_score_codex":7.311901e-7,"about_ca_topic_score_gemma":2.0442177e-7,"teacher_disagreement_score":0.8267919,"about_ca_system_score_codex":0.000011625001,"about_ca_system_score_gemma":0.000026808728,"threshold_uncertainty_score":0.4483893},"labels":[],"label_agreement":null},{"id":"W2084807618","doi":"10.1016/j.tcs.2004.02.031","title":"Deletion along trajectories","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decidability; Closure (psychology); Regular language; Mathematical proof; Formal language; Mathematics; Inverse; Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Algorithm; Automaton","score_opus":0.007075571221615482,"score_gpt":0.22688505009427937,"score_spread":0.2198094788726639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084807618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13854805,0.000027716129,0.8572507,0.0011809217,0.0007137838,0.000087595006,5.418952e-7,0.00043085893,0.001759823],"genre_scores_gemma":[0.81869006,0.0000026698242,0.18052146,0.0006395421,0.00013332361,0.000004247673,4.3821115e-7,0.0000057639554,0.000002482293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785435,0.000051841704,0.00023200594,0.00064912275,0.0006474686,0.00056518294],"domain_scores_gemma":[0.99869287,0.00011738501,0.000049725342,0.0007856656,0.00012048531,0.00023386064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011720358,0.00016886124,0.0001619385,0.00015634808,0.00045216782,0.0005168209,0.002413506,0.000046419344,0.000021598587],"category_scores_gemma":[0.000060615857,0.00013626787,0.000064537766,0.0011784802,0.0021383131,0.0010933902,0.00068454706,0.00015575135,0.00014882963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022745426,0.000039212835,0.000023764243,0.0000026675557,0.0000016707488,0.000015488811,0.000436292,0.000302515,0.0009995847,0.96897906,0.000008234859,0.029189236],"study_design_scores_gemma":[0.00028632293,0.00016508531,0.0017141255,0.000027671791,0.0000024951974,0.000097615506,0.000008667348,0.07683683,0.019865103,0.90066636,0.00008286837,0.00024686198],"about_ca_topic_score_codex":0.000010764918,"about_ca_topic_score_gemma":9.0752314e-7,"teacher_disagreement_score":0.68014205,"about_ca_system_score_codex":0.00009549736,"about_ca_system_score_gemma":0.00016762067,"threshold_uncertainty_score":0.7878704},"labels":[],"label_agreement":null},{"id":"W2084869467","doi":"10.1016/j.tcs.2009.02.035","title":"State complexity of unique rational operations","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; State (computer science); Regular language; Theoretical computer science; Computational complexity theory; Time complexity; Algorithm; Automaton","score_opus":0.019159765986843016,"score_gpt":0.2675043142512131,"score_spread":0.2483445482643701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084869467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073187135,0.000010247721,0.92211354,0.0023536512,0.00017108445,0.00010820223,0.0000035776102,0.00014109988,0.0019114899],"genre_scores_gemma":[0.73409116,0.0000015965519,0.2650262,0.0008396356,0.000030952222,0.0000012706676,0.0000011452709,0.0000019294812,0.0000060598218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983115,0.00010590929,0.00029451636,0.0004251085,0.0005338583,0.00032909436],"domain_scores_gemma":[0.99878216,0.00011333923,0.000046908157,0.00065562414,0.00023870394,0.00016328414],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011474842,0.00012413874,0.00017382667,0.00014296343,0.00029866843,0.00024065687,0.0019637726,0.000025337751,0.000045181052],"category_scores_gemma":[0.00004958958,0.00010125302,0.00005137741,0.0008929608,0.002826462,0.000768399,0.00036898034,0.00011797093,0.000023357421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029606015,0.00007215558,0.000007673122,0.0000014985948,0.00000140301,0.0000025796307,0.00028784666,0.00097122765,0.004035764,0.9760846,0.000024643801,0.018507667],"study_design_scores_gemma":[0.000082919236,0.00012619962,0.0023695654,0.000008872354,8.0550916e-7,0.000012634084,0.0000014647602,0.48168477,0.01325023,0.502366,0.000011988219,0.00008455592],"about_ca_topic_score_codex":0.0000035543467,"about_ca_topic_score_gemma":7.569776e-7,"teacher_disagreement_score":0.66090405,"about_ca_system_score_codex":0.000030700066,"about_ca_system_score_gemma":0.00017625437,"threshold_uncertainty_score":0.9998873},"labels":[],"label_agreement":null},{"id":"W2085042840","doi":"10.1142/s0129054105003200","title":"THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Hierarchy; Conjecture; Mathematics; Upper and lower bounds; Polynomial; Combinatorics; Polynomial hierarchy; Discrete mathematics; Time complexity; Mathematical analysis","score_opus":0.018719036039273374,"score_gpt":0.28599908382975253,"score_spread":0.26728004779047915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085042840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26489317,0.0002502306,0.63153476,0.09944663,0.0029181913,0.00014471733,0.000005024648,0.000016609885,0.00079065195],"genre_scores_gemma":[0.9823413,0.00005727626,0.015787758,0.0011901475,0.0005625481,0.0000020779369,1.5595609e-7,0.0000028899822,0.000055875273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981487,0.00014551444,0.00043645842,0.00015006673,0.000960851,0.00015841897],"domain_scores_gemma":[0.9963133,0.0022112932,0.0004513563,0.00038435782,0.00058733777,0.000052381853],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029756923,0.00009374538,0.00011420358,0.00021097742,0.0006100114,0.0010613607,0.0044223596,0.0000148225,0.000007245902],"category_scores_gemma":[0.00030348732,0.000041928142,0.00008929728,0.0003400475,0.0016420273,0.0010257422,0.000539423,0.0001916625,0.000006299542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064959386,0.000029914354,0.00006111552,4.40149e-7,0.00003949051,0.0000020816008,0.0012925373,0.0011913549,0.0002557133,0.5761297,0.0011498854,0.41978282],"study_design_scores_gemma":[0.0028376651,0.00039812629,0.04490463,0.0001889713,0.000022381633,0.0009993726,0.00024479302,0.783146,0.006258903,0.08796944,0.07271885,0.00031086305],"about_ca_topic_score_codex":0.000011515404,"about_ca_topic_score_gemma":0.000011891939,"teacher_disagreement_score":0.78195465,"about_ca_system_score_codex":0.000054083677,"about_ca_system_score_gemma":0.0002951878,"threshold_uncertainty_score":0.9999756},"labels":[],"label_agreement":null},{"id":"W2085182681","doi":"10.4153/cmb-2004-033-2","title":"Combinatorics of Words and Semigroup Algebras Which Are Sums of Locally Nilpotent Subalgebras","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Semigroup; Nilpotent; Locally nilpotent; Construct (python library); Pure mathematics; Algebra over a field; Nilpotent group; Discrete mathematics","score_opus":0.006508806281306019,"score_gpt":0.1886395039348699,"score_spread":0.18213069765356388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085182681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87828225,0.00066574465,0.10688662,0.008307788,0.00016430616,0.0003891391,0.000025271285,0.00009936654,0.005179522],"genre_scores_gemma":[0.9928849,0.000018583367,0.006501493,0.00042204143,0.000016279448,0.000008774904,0.0000022053127,0.000018398974,0.0001273626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983788,0.000053544263,0.0004832983,0.0003315524,0.0003292949,0.00042348908],"domain_scores_gemma":[0.99833703,0.00020902358,0.00018319677,0.0005998943,0.0001468568,0.00052397023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051584403,0.00020133912,0.00044083808,0.00017522016,0.00007031717,0.000055851742,0.0007097232,0.00014215535,0.00032531674],"category_scores_gemma":[0.00031426252,0.00018502187,0.00007315888,0.00046979415,0.00018832837,0.00006875076,0.00014846234,0.00017011093,0.00019841104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028136583,0.00007639838,0.00025717623,0.00022508715,0.000021980637,0.00003732342,0.0006062515,0.000014701582,0.00019188628,0.9970563,0.00073934725,0.0007707449],"study_design_scores_gemma":[0.001074034,0.00021743221,0.0028954018,0.0007430486,0.00003376556,0.00011397477,0.0005070091,0.0016266063,0.0059596607,0.98433596,0.0019906324,0.00050246087],"about_ca_topic_score_codex":0.0010476242,"about_ca_topic_score_gemma":0.00082816795,"teacher_disagreement_score":0.11460261,"about_ca_system_score_codex":0.00011167122,"about_ca_system_score_gemma":0.00028032725,"threshold_uncertainty_score":0.7544973},"labels":[],"label_agreement":null},{"id":"W2086306425","doi":"10.1016/j.tcs.2007.09.015","title":"Palindrome positions in ternary square-free words","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Palindrome; Ternary operation; Mathematics; Sequence (biology); Word (group theory); Combinatorics; Integer (computer science); Position (finance); Arbitrariness; Word length; Binary number; Square (algebra); Arithmetic; Discrete mathematics; Computer science; Linguistics; Natural language processing; Philosophy; Geometry","score_opus":0.006775379402386871,"score_gpt":0.24749328958025793,"score_spread":0.24071791017787106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086306425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16269656,0.00003861354,0.8297199,0.0013179056,0.0006034872,0.0001293512,0.0000018490956,0.00025878527,0.0052335737],"genre_scores_gemma":[0.8504594,0.0000023852342,0.14843456,0.00096149265,0.00012024995,0.0000037984373,7.27328e-7,0.000007998352,0.000009376441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705565,0.00008799327,0.0004085539,0.00077356107,0.0007691082,0.0009051256],"domain_scores_gemma":[0.9976005,0.00043553524,0.00006302374,0.001493041,0.00008119595,0.00032669344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003497219,0.00020352559,0.00021709918,0.0004922066,0.0002886843,0.00037639012,0.004725721,0.00007221957,0.00005293725],"category_scores_gemma":[0.00008981115,0.00017518381,0.00007465605,0.0021690412,0.0018593026,0.00089552876,0.0019712488,0.0002911948,0.00010245858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007086755,0.00010874769,0.00036319974,0.000003831093,0.0000016196574,0.0001568161,0.00054235396,0.000047286932,0.0005849893,0.96551347,0.00003277788,0.032637842],"study_design_scores_gemma":[0.0004535237,0.00022602172,0.026042439,0.00007791218,0.0000023881225,0.0002103697,0.00002331153,0.279915,0.002826999,0.6897845,0.00008100528,0.0003565113],"about_ca_topic_score_codex":0.0000114835675,"about_ca_topic_score_gemma":0.0000045368415,"teacher_disagreement_score":0.68776286,"about_ca_system_score_codex":0.00010785132,"about_ca_system_score_gemma":0.000091313756,"threshold_uncertainty_score":0.87816447},"labels":[],"label_agreement":null},{"id":"W2086380781","doi":"10.1142/s0129054107005078","title":"ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Computer science; Decidability; Delegation; Property (philosophy); Nondeterministic finite automaton; Deterministic finite automaton; Finite-state machine; Automaton; Theoretical computer science; Büchi automaton; Discrete mathematics; Deterministic automaton; Programming language; Mathematics; Automata theory","score_opus":0.02257258117667414,"score_gpt":0.31746810412455884,"score_spread":0.2948955229478847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086380781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23422536,0.000016005353,0.7628941,0.0010744062,0.0014862875,0.00006651556,0.0000024423757,0.000006255473,0.000228602],"genre_scores_gemma":[0.8439761,0.0000032946432,0.15562077,0.0002574048,0.00012678692,8.716782e-7,2.8543118e-7,0.0000024124665,0.000012078034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980704,0.000024762416,0.0006130249,0.00015506067,0.0009777617,0.00015895565],"domain_scores_gemma":[0.9958905,0.0011688822,0.0007318599,0.00032515623,0.0018201404,0.00006344772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028729585,0.00008127848,0.00014000727,0.0004630613,0.00011304855,0.00014621663,0.0036753893,0.00002002651,0.000009246107],"category_scores_gemma":[0.00034740526,0.00005575993,0.0001313491,0.0005117958,0.00046304413,0.0009143201,0.00020800895,0.00009243684,0.000003054075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024535397,0.000110556146,0.00014340486,0.0000034282991,0.000028792561,0.0000032241646,0.00039498383,0.00077611307,0.0030927672,0.941723,0.00023076878,0.053468406],"study_design_scores_gemma":[0.0016467934,0.0016744139,0.02483654,0.00061488175,0.000025425594,0.00044194967,0.00016394598,0.25040388,0.17842978,0.5373617,0.003989152,0.00041154915],"about_ca_topic_score_codex":0.0000065181566,"about_ca_topic_score_gemma":0.0000022352037,"teacher_disagreement_score":0.60975075,"about_ca_system_score_codex":0.000067044646,"about_ca_system_score_gemma":0.00027088306,"threshold_uncertainty_score":0.6829849},"labels":[],"label_agreement":null},{"id":"W2086603341","doi":"10.1016/j.tcs.2010.11.025","title":"Complexity and palindromic defect of infinite words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Palindrome; Conjecture; Mathematics; State (computer science); Combinatorics; Palindromic sequence; Algorithm; CRISPR; Genetics","score_opus":0.011621170060287709,"score_gpt":0.24605559810753605,"score_spread":0.23443442804724834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086603341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5358285,0.000015077778,0.46221548,0.00021296302,0.00037926328,0.000065278036,0.0000015240172,0.00009252226,0.0011894007],"genre_scores_gemma":[0.83296055,0.0000022275249,0.16677126,0.000203921,0.000053737745,0.000001738734,2.604075e-7,0.000004608704,0.0000016806056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982381,0.00009711148,0.00026842798,0.0005512868,0.00043799297,0.00040707894],"domain_scores_gemma":[0.99822235,0.00046753392,0.00008663142,0.0008864077,0.00010191962,0.00023514008],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022074906,0.00015607041,0.00023725613,0.00017127165,0.00027781157,0.00023498773,0.0019985344,0.00005788209,0.000047802983],"category_scores_gemma":[0.00012902643,0.00012427328,0.00006856245,0.00075426005,0.0063062985,0.00046795834,0.0013558563,0.00034471846,0.000020132626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036573756,0.000032431955,0.00031342296,0.000007138083,0.0000027957908,0.0000036419015,0.00037321047,0.0000035344067,0.0072410265,0.95904493,0.000005484543,0.03296871],"study_design_scores_gemma":[0.00023227463,0.00014743522,0.010787835,0.000020675103,0.000004524972,0.000096629185,0.0000058057617,0.34283558,0.010152434,0.63545054,0.00006167044,0.00020460102],"about_ca_topic_score_codex":0.000006454591,"about_ca_topic_score_gemma":0.000001874016,"teacher_disagreement_score":0.34283206,"about_ca_system_score_codex":0.0000086348655,"about_ca_system_score_gemma":0.00007871383,"threshold_uncertainty_score":0.996398},"labels":[],"label_agreement":null},{"id":"W2086666778","doi":"10.1016/j.tcs.2005.01.005","title":"Avoiding large squares in infinite binary words","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; Mathematics; Construct (python library); Word (group theory); Least-squares function approximation; Combinatorics; Discrete mathematics; Arithmetic; Statistics; Computer science; Geometry","score_opus":0.00866029022211975,"score_gpt":0.24990594008600098,"score_spread":0.24124564986388122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086666778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27200627,0.0000979742,0.72255915,0.0019770307,0.00035118277,0.00010379187,0.0000012002538,0.0002823213,0.0026210814],"genre_scores_gemma":[0.91543865,0.000008857488,0.08280522,0.0015352656,0.00018385056,0.0000066556754,5.6710417e-7,0.00000877936,0.000012147846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970724,0.0002536063,0.00031960424,0.000783981,0.0006414636,0.0009289578],"domain_scores_gemma":[0.99827206,0.0005197166,0.00006293163,0.0008355838,0.00006610026,0.00024361342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042318827,0.0002143559,0.00023137368,0.0004500268,0.00051061134,0.00048470774,0.0030417533,0.000063931606,0.000073481875],"category_scores_gemma":[0.00014810012,0.0001813615,0.00006622683,0.0020028257,0.0011272872,0.0014833756,0.0017419697,0.00046012056,0.00023445272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046991436,0.00009594837,0.00017307265,0.0000040119044,0.0000011908357,0.00003166969,0.0012985776,0.0004572649,0.0005506898,0.934413,0.000046243087,0.06292361],"study_design_scores_gemma":[0.00034871453,0.00010268275,0.0022371835,0.00007131768,0.0000013173648,0.000044990826,0.000033288434,0.8903909,0.0025386594,0.10295266,0.0009847207,0.000293589],"about_ca_topic_score_codex":0.0000022758065,"about_ca_topic_score_gemma":0.0000020502794,"teacher_disagreement_score":0.8899336,"about_ca_system_score_codex":0.00009954232,"about_ca_system_score_gemma":0.00010321931,"threshold_uncertainty_score":0.73957074},"labels":[],"label_agreement":null},{"id":"W2087362034","doi":"10.1016/s0022-4049(98)00145-5","title":"Tensor products of semilattices with zero, revisited","year":2000,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Zero (linguistics); Tensor (intrinsic definition); Tensor product; Pure mathematics; Tensor product of Hilbert spaces; Algebra over a field; Tensor contraction; Linguistics","score_opus":0.007308643815852981,"score_gpt":0.20547951336395145,"score_spread":0.19817086954809848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087362034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99228024,0.0012198756,0.0031179865,0.000799912,0.000032393018,0.000096112,0.0000014166362,0.00002218451,0.0024298711],"genre_scores_gemma":[0.9850313,0.00015081631,0.014225975,0.00030743246,0.00011849363,8.978373e-7,4.1732022e-7,0.0000070309184,0.00015763025],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991483,0.00002041551,0.0002973323,0.00015303097,0.00024317483,0.00013772219],"domain_scores_gemma":[0.9992939,0.00004788008,0.00027674632,0.0002216735,0.00008775144,0.00007200782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032848658,0.00010738173,0.0002667155,0.00007383156,0.000045685563,0.0000645504,0.0003559327,0.000037218048,0.000044338114],"category_scores_gemma":[0.000007712542,0.000066866945,0.00003318196,0.0002819562,0.00005263925,0.000265959,0.000032336065,0.00013800531,0.0000050407675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005054996,0.00051667116,0.0013610353,0.00047317866,0.0003991887,0.00017828279,0.0039164047,0.00015113565,0.09089022,0.3037163,0.013466533,0.58442557],"study_design_scores_gemma":[0.013542907,0.005649044,0.08977128,0.0032827456,0.00086665584,0.0070517687,0.0015207148,0.0034403712,0.3803511,0.3693308,0.12204847,0.00314418],"about_ca_topic_score_codex":4.8688986e-7,"about_ca_topic_score_gemma":1.3112728e-7,"teacher_disagreement_score":0.58128136,"about_ca_system_score_codex":0.0000049108717,"about_ca_system_score_gemma":0.00003609513,"threshold_uncertainty_score":0.27267548},"labels":[],"label_agreement":null},{"id":"W2087402722","doi":"10.1007/978-3-642-31606-7_16","title":"Automatic Theorem-Proving in Combinatorics on Words","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Shuffling; Combinatorics on words; Computer science; Automaton; Function (biology); Combinatorics; Computation; Discrete mathematics; Extremal combinatorics; Algorithm; Mathematics; Theoretical computer science; Word (group theory); Programming language","score_opus":0.0130593615674536,"score_gpt":0.23081741752669982,"score_spread":0.21775805595924622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087402722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016361241,0.00084083417,0.9860671,0.00043892075,0.0029632617,0.0004419532,0.0000024195583,0.00034664164,0.0072627575],"genre_scores_gemma":[0.9211064,0.000046757286,0.076348856,0.0018234676,0.00038497883,0.00001600967,0.0000032806854,0.000059410148,0.00021085163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957533,0.0000851469,0.0006331262,0.001369625,0.0011448862,0.0010139121],"domain_scores_gemma":[0.9964769,0.0010481384,0.00032458766,0.0018588108,0.00008524586,0.00020633922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002109795,0.000641082,0.00065822434,0.001293522,0.00019717848,0.0005200974,0.0042743073,0.0003808712,0.000051337673],"category_scores_gemma":[0.00014142797,0.0005586326,0.00013459875,0.00097261864,0.0005305105,0.00077816274,0.001504726,0.001171679,0.00012897297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019978443,0.00005451053,0.00008246871,0.000035761394,0.0000039483707,0.00006329798,0.0009195184,0.0016292345,0.000025042262,0.35105076,0.000007630353,0.64612585],"study_design_scores_gemma":[0.00025565995,0.0001243481,0.00035720711,0.0006907714,0.0000039925603,0.000037624643,3.4358416e-7,0.44743586,0.00040545096,0.5497663,0.0003160461,0.0006064064],"about_ca_topic_score_codex":0.000017928634,"about_ca_topic_score_gemma":0.0000217697,"teacher_disagreement_score":0.91947025,"about_ca_system_score_codex":0.0005805534,"about_ca_system_score_gemma":0.00035959927,"threshold_uncertainty_score":0.99968654},"labels":[],"label_agreement":null},{"id":"W2087404611","doi":"10.1016/s0304-3975(98)00047-4","title":"Alternating finite automata and star-free languages","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Star (game theory); Automaton; Two-way deterministic finite automaton; Deterministic automaton; Regular language; Regular expression; Nondeterministic finite automaton; Mathematics; Class (philosophy); Finite-state machine; Construct (python library); Discrete mathematics; Representation (politics); Loop (graph theory); Deterministic finite automaton; Computer science; Combinatorics; Automata theory; Algorithm; Theoretical computer science; Programming language; Mathematical analysis; Artificial intelligence","score_opus":0.005757112725756986,"score_gpt":0.23699416293092448,"score_spread":0.2312370502051675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087404611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44819155,0.00009845735,0.53960586,0.0014356463,0.00020584426,0.00010922917,0.0000044220164,0.0005894561,0.009759554],"genre_scores_gemma":[0.8286527,0.000017943856,0.1701826,0.0009869811,0.0001082931,0.000003139214,5.383069e-7,0.0000075716766,0.000040227824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782777,0.00009169729,0.00022963954,0.00071351125,0.0005769333,0.00056043576],"domain_scores_gemma":[0.9979806,0.00041346182,0.000043870095,0.0012555798,0.000051628398,0.00025485802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012869926,0.00018431911,0.0001833182,0.0001230701,0.00039121998,0.00072389015,0.0033442448,0.00003912292,0.00020722808],"category_scores_gemma":[0.00010808095,0.00014829534,0.000038620947,0.0006192748,0.001749554,0.00088574766,0.0014302589,0.00016453082,0.000106192674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028974666,0.000022106287,0.000033155247,0.0000045353186,0.000002235384,0.000026150658,0.00037818606,0.00004633442,0.00016653833,0.7462762,0.000042648902,0.25299904],"study_design_scores_gemma":[0.00028941163,0.00011386005,0.0018155404,0.000035517667,0.0000025963764,0.00007068544,0.000008153709,0.804341,0.0012432717,0.19162868,0.0002321156,0.00021914467],"about_ca_topic_score_codex":0.000009487589,"about_ca_topic_score_gemma":4.855254e-7,"teacher_disagreement_score":0.8042947,"about_ca_system_score_codex":0.00002301905,"about_ca_system_score_gemma":0.000046050034,"threshold_uncertainty_score":0.69804895},"labels":[],"label_agreement":null},{"id":"W2088999425","doi":"10.1016/j.tcs.2009.02.043","title":"State-complexity hierarchies of uniform languages of alphabet-size length","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Waterloo","funders":"","keywords":"Alphabet; Regular language; Mathematics; Hierarchy; Combinatorics; Class (philosophy); State (computer science); Formal language; Discrete mathematics; Simple (philosophy); Complexity class; Chomsky hierarchy; Set (abstract data type); Finite-state machine; Automaton; Computer science; Time complexity; Theoretical computer science; Algorithm; Linguistics; Programming language; Artificial intelligence","score_opus":0.010043604494926939,"score_gpt":0.2575917261567074,"score_spread":0.24754812166178045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088999425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38296854,0.000051973788,0.61217946,0.0005053939,0.00013390205,0.000105101295,0.0000064215296,0.00013700152,0.003912222],"genre_scores_gemma":[0.8025662,0.000007646106,0.19710043,0.0002834275,0.000029913925,7.7695876e-7,4.740192e-7,0.000003838709,0.0000073179067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977651,0.00010319128,0.0004293023,0.00048386247,0.0007246008,0.000493929],"domain_scores_gemma":[0.998036,0.00048400296,0.00016501405,0.0009570786,0.00018227902,0.00017561803],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014049587,0.00018580409,0.00035866234,0.000190432,0.00014912187,0.00010364536,0.0028972405,0.00003675827,0.000038010257],"category_scores_gemma":[0.00012795691,0.00014330595,0.00009525497,0.0010825555,0.0040618954,0.00061067846,0.00063567056,0.00015180523,0.000008363469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001061081,0.000083204424,0.00003774038,0.000012096026,0.0000041101234,0.000005340661,0.0008535667,0.00006236409,0.0048966543,0.90743977,0.000015807329,0.086578764],"study_design_scores_gemma":[0.00024527824,0.00052247616,0.010655633,0.000051576593,0.0000038464113,0.000018214132,0.000024224477,0.14310841,0.07539335,0.76976085,0.000018700268,0.00019741467],"about_ca_topic_score_codex":0.000009672808,"about_ca_topic_score_gemma":5.276596e-7,"teacher_disagreement_score":0.41959766,"about_ca_system_score_codex":0.0000314486,"about_ca_system_score_gemma":0.0001312463,"threshold_uncertainty_score":0.99864846},"labels":[],"label_agreement":null},{"id":"W2089081951","doi":"10.1016/j.tcs.2011.08.007","title":"Palindromic complexity of codings of rotations","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Computer science; Artificial intelligence; Algorithm; Biology","score_opus":0.04530645399952978,"score_gpt":0.2533063429209016,"score_spread":0.2079998889213718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089081951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24778628,0.000009435732,0.7475253,0.00008089298,0.00019389733,0.00008203982,0.0000030003137,0.000067980174,0.0042512105],"genre_scores_gemma":[0.73344344,0.0000012632455,0.2664631,0.00007423343,0.000011739265,0.0000015298588,2.6838535e-7,0.0000030209674,0.000001398288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984372,0.00007366702,0.00037161316,0.0003765428,0.00044014622,0.0003007902],"domain_scores_gemma":[0.9985831,0.0001577039,0.00016119232,0.0007520706,0.00021486892,0.00013105944],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011571296,0.000114699316,0.00024083766,0.00017360026,0.00012786144,0.00003846844,0.0024945654,0.00003296528,0.00009637618],"category_scores_gemma":[0.00005614645,0.000094883704,0.00007463139,0.00090064004,0.006426867,0.00042481566,0.000780057,0.00009216076,0.000017532815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051132088,0.00008960621,0.00014076162,0.000010206547,0.0000035776673,0.0000018838982,0.0015707072,0.0000058960177,0.00345947,0.98868924,0.0000069018465,0.0060166144],"study_design_scores_gemma":[0.00015265355,0.00018451747,0.008269714,0.00003386264,0.0000042933702,0.000016740645,0.000015720276,0.20465963,0.08489694,0.7016452,0.0000028887862,0.00011786294],"about_ca_topic_score_codex":0.000016558773,"about_ca_topic_score_gemma":3.9055487e-7,"teacher_disagreement_score":0.4856572,"about_ca_system_score_codex":0.000015416286,"about_ca_system_score_gemma":0.000088073226,"threshold_uncertainty_score":0.9962771},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03211804920181332,"score_gpt":0.3122282846005669,"score_spread":0.28011023539875357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089455626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40334675,0.0000698458,0.59354055,0.0014928924,0.0013858295,0.00007134617,0.000009481128,0.00001302628,0.00007025867],"genre_scores_gemma":[0.80161035,0.000024508208,0.19812803,0.00011595037,0.00010232247,0.0000012726955,0.0000037556113,0.0000035823537,0.000010255429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978066,0.00007412477,0.0007539628,0.00017087112,0.0009999283,0.00019450195],"domain_scores_gemma":[0.9963664,0.0001947973,0.0005904261,0.0002653165,0.0024479376,0.00013512498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001579767,0.00011614643,0.00021715918,0.0006853878,0.00015463697,0.00024150603,0.0017728718,0.00002015831,0.000016770076],"category_scores_gemma":[0.00014623285,0.0001022432,0.00007270243,0.0005806124,0.00076994294,0.0039683273,0.0003833986,0.000110870795,0.0000039110496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029710593,0.0006154487,0.0067697857,0.000016574815,0.00015392127,0.0000047890608,0.004397068,0.0074734753,0.018595329,0.9208919,0.00018274583,0.040869284],"study_design_scores_gemma":[0.0028610993,0.00044734558,0.18449408,0.00020543368,0.00003540411,0.00043182322,0.00012418925,0.6918846,0.033982944,0.08460457,0.0005031788,0.0004253527],"about_ca_topic_score_codex":0.000092419396,"about_ca_topic_score_gemma":0.0000115027615,"teacher_disagreement_score":0.8362873,"about_ca_system_score_codex":0.0000997401,"about_ca_system_score_gemma":0.0003857812,"threshold_uncertainty_score":0.41693565},"labels":[],"label_agreement":null},{"id":"W2089487135","doi":"10.1090/s0002-9939-09-10126-0","title":"An automata theoretic approach to the generalized word problem in graphs of groups","year":2009,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Quasiconvex function; Mathematics; Chordal graph; Combinatorics; Word problem (mathematics education); Decidability; Vertex (graph theory); Discrete mathematics; Graph; Regular polygon; Arithmetic","score_opus":0.009655529450554501,"score_gpt":0.23989920257874073,"score_spread":0.23024367312818622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089487135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95697695,0.00003393019,0.032495856,0.004911362,0.00002360656,0.0007724333,0.0000030961,0.00016124157,0.004621522],"genre_scores_gemma":[0.7762963,0.0000119089755,0.22260718,0.0010014839,0.000017713084,0.000035989422,2.7480792e-7,0.000011074627,0.00001803588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808544,0.000043314936,0.00051786617,0.00039340815,0.0005705025,0.0003894987],"domain_scores_gemma":[0.9986354,0.000118577576,0.00044825385,0.0005774067,0.00011834704,0.00010198407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015290414,0.00021420937,0.0005024023,0.000048887017,0.00010393118,0.000096095115,0.0030560724,0.000045054454,0.0000032594528],"category_scores_gemma":[0.00010194955,0.00011506142,0.00030059347,0.0017062242,0.00051993364,0.00027513635,0.00036406735,0.00020881354,0.0000026852117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012723534,0.00051924423,0.00017863263,0.00009617957,0.000020726948,5.9029787e-8,0.008904366,0.000040054907,0.008115406,0.9739333,0.00076940487,0.007409898],"study_design_scores_gemma":[0.00028684566,0.00022811732,0.0058656298,0.00011050685,0.000022795715,0.000012544247,0.0021389897,0.104949966,0.0033832071,0.88274795,0.000031228785,0.00022222528],"about_ca_topic_score_codex":0.0000144567575,"about_ca_topic_score_gemma":1.4630564e-7,"teacher_disagreement_score":0.19011132,"about_ca_system_score_codex":0.000034687095,"about_ca_system_score_gemma":0.000025551237,"threshold_uncertainty_score":0.56789935},"labels":[],"label_agreement":null},{"id":"W2090113296","doi":"10.1016/j.aam.2014.11.001","title":"Factor complexity of S-adic words generated by the Arnoux–Rauzy–Poincaré algorithm","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Agence Nationale de la Recherche","keywords":"Piecewise linear function; Upper and lower bounds; Fraction (chemistry); Convergence (economics); Factor (programming language); Piecewise; Euclidean algorithm","score_opus":0.016324273096377247,"score_gpt":0.2521384388042421,"score_spread":0.23581416570786484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090113296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010620618,0.0006557984,0.9799784,0.000105557796,0.00016927184,0.00027032653,0.000017616241,0.00012836039,0.0080540795],"genre_scores_gemma":[0.52412415,0.00010024957,0.47535902,0.00024371923,0.00004913058,0.000043117965,0.000007782437,0.000019494819,0.000053331947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854136,0.00004876919,0.0004701193,0.00029849287,0.0003356521,0.00030559162],"domain_scores_gemma":[0.9982744,0.0005341897,0.00028678478,0.00082067976,0.00002970631,0.000054271837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051373,0.00020616372,0.00036120447,0.00006313428,0.00008886415,0.000055407192,0.0012365816,0.000063518666,0.000019771744],"category_scores_gemma":[0.000048306574,0.00014332529,0.00005197078,0.0004510678,0.00030643484,0.00019224542,0.00023866982,0.00017777205,0.000024687079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025698598,0.00019700444,0.000024956591,0.000111360816,0.000011206536,8.4626544e-7,0.0015381983,0.00014266938,0.003233349,0.7640827,0.00033554804,0.23031959],"study_design_scores_gemma":[0.0005014693,0.000044408363,0.00007285094,0.000056736448,0.000007222858,0.000008478662,0.00025924382,0.33885074,0.01999618,0.63326496,0.00664106,0.0002966498],"about_ca_topic_score_codex":0.0000051291804,"about_ca_topic_score_gemma":0.0000067604774,"teacher_disagreement_score":0.51350355,"about_ca_system_score_codex":0.000031135547,"about_ca_system_score_gemma":0.000020791145,"threshold_uncertainty_score":0.5844636},"labels":[],"label_agreement":null},{"id":"W2090562519","doi":"10.1016/j.tcs.2008.02.051","title":"Extension of Brzozowski’s derivation calculus of rational expressions to series over the free partially commutative monoids","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Noncommutative geometry; Extension (predicate logic); Mathematics; Power series; Commutative property; Formal power series; Series (stratigraphy); Expression (computer science); Pure mathematics; Finitely-generated abelian group; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.015476486358449839,"score_gpt":0.25462773357631596,"score_spread":0.23915124721786613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090562519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3921421,0.0000139388685,0.60691583,0.000515014,0.000120092496,0.00011122631,0.0000052934433,0.000022442064,0.00015407371],"genre_scores_gemma":[0.9005087,0.0000036544868,0.099213816,0.00023259364,0.000027017928,0.0000059028184,9.1144875e-7,0.0000039274223,0.0000034611062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811393,0.00017674557,0.000418797,0.0003203113,0.00073951995,0.00023071082],"domain_scores_gemma":[0.99779224,0.0005456636,0.00017542922,0.000991015,0.00039220258,0.00010344724],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00097082276,0.00012067245,0.0002302948,0.00011980138,0.00029981916,0.00003136925,0.0021353797,0.000035173907,0.000021111266],"category_scores_gemma":[0.00025087837,0.000078448014,0.00006697725,0.0009171533,0.003453444,0.00053988595,0.001353654,0.00009535681,0.0000027331848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023010256,0.0000711956,0.000078871046,0.0000064127225,0.000003947375,0.0000020206128,0.0035302287,0.0015133377,0.046680525,0.9456406,0.00008431305,0.0023654941],"study_design_scores_gemma":[0.0003258031,0.000498209,0.03893642,0.00012292272,0.000006410864,0.00003978331,0.000065534274,0.4253268,0.32824713,0.20622137,0.000026313824,0.00018331187],"about_ca_topic_score_codex":0.000013370917,"about_ca_topic_score_gemma":0.0000012266393,"teacher_disagreement_score":0.7394193,"about_ca_system_score_codex":0.000018309516,"about_ca_system_score_gemma":0.00016413337,"threshold_uncertainty_score":0.9992586},"labels":[],"label_agreement":null},{"id":"W2090639626","doi":"10.1080/00207160701779541","title":"On the definition of stochastic λ-transducers","year":2008,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transducer; Automaton; Probabilistic logic; Computer science; Probabilistic automaton; Stochastic process; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Acoustics; Statistics","score_opus":0.032405734837814476,"score_gpt":0.24453514536068305,"score_spread":0.21212941052286857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090639626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15605107,0.000021263097,0.84166515,0.0010472683,0.0007312679,0.000036394777,0.000001785496,0.000012546337,0.00043324928],"genre_scores_gemma":[0.8707324,0.000010833658,0.12869474,0.00039876314,0.00015008177,7.0006354e-7,3.6051165e-7,0.0000053111544,0.000006762973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987244,0.000039126706,0.00044983882,0.00006895546,0.00063639245,0.000081296625],"domain_scores_gemma":[0.9982126,0.00076340925,0.00045315328,0.0001959212,0.00034141165,0.000033515564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036172773,0.00008512747,0.00015608109,0.0001418364,0.0000387195,0.000039991828,0.0012905122,0.00002455778,0.000023184126],"category_scores_gemma":[0.000061004113,0.000053861142,0.00013675046,0.0000923406,0.00006585022,0.00019876448,0.000077192184,0.0001297018,0.000014647225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011821712,0.00023722595,0.000004645,0.000008026844,0.00011761273,0.000053431184,0.002608434,0.002005297,0.00029546107,0.9903802,0.0015052807,0.0027725198],"study_design_scores_gemma":[0.0006894433,0.00034009482,0.000371817,0.00041484355,0.000015978407,0.0022373728,0.00006795652,0.18311477,0.0018955419,0.8106187,0.00008227036,0.0001512405],"about_ca_topic_score_codex":6.264774e-7,"about_ca_topic_score_gemma":7.357128e-8,"teacher_disagreement_score":0.7146814,"about_ca_system_score_codex":0.000027841998,"about_ca_system_score_gemma":0.0000564516,"threshold_uncertainty_score":0.23981142},"labels":[],"label_agreement":null},{"id":"W2090863119","doi":"10.1016/j.tcs.2007.07.032","title":"On the existence of regular approximations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; McGill University","funders":"","keywords":"Closure (psychology); Measure (data warehouse); Degree (music); Mathematics; Context (archaeology); Automaton; Regular language; Approximations of π; Discrete mathematics; Approximation algorithm; Combinatorics; Applied mathematics; Computer science; Theoretical computer science","score_opus":0.011196178193247025,"score_gpt":0.24015798834140104,"score_spread":0.228961810148154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090863119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08468639,0.000012076906,0.90327984,0.0012482873,0.00026317296,0.00012748747,6.312699e-7,0.00010998898,0.010272113],"genre_scores_gemma":[0.87341243,8.042912e-7,0.12573792,0.00079266046,0.00004117155,0.0000024783546,1.438407e-7,0.000003797622,0.000008573641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980178,0.00007935988,0.0002855017,0.00043054466,0.0007544246,0.00043237145],"domain_scores_gemma":[0.997174,0.0012149442,0.00009442886,0.0012377255,0.00014754018,0.0001313651],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0045272494,0.00012442267,0.00013904387,0.0001454509,0.00036688085,0.00015618827,0.0033462928,0.000032967684,0.00003146287],"category_scores_gemma":[0.00021002647,0.000074834395,0.00006454038,0.0013439173,0.0034133878,0.0003241293,0.00067187345,0.0001527766,0.000046399025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037184138,0.000045347013,0.0000041451226,0.0000028773834,0.0000016885456,0.0000034436996,0.00033601763,0.00003293422,0.0011103887,0.97714746,0.000042027736,0.021269955],"study_design_scores_gemma":[0.00006604084,0.00011813284,0.0006490831,0.000029437266,0.0000015544497,0.000016933218,0.000016966978,0.21987201,0.026708324,0.75238466,0.00003690557,0.00009993112],"about_ca_topic_score_codex":0.000001209476,"about_ca_topic_score_gemma":1.4470335e-7,"teacher_disagreement_score":0.78872603,"about_ca_system_score_codex":0.000028988203,"about_ca_system_score_gemma":0.00005116002,"threshold_uncertainty_score":0.99929875},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Unary operation; Involution (esoterism); Mathematics; Alphabet; Combinatorics; Existential quantification; Discrete mathematics; Biology; Linguistics","score_opus":0.014145822113634738,"score_gpt":0.2763654520099963,"score_spread":0.26221962989636155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091155243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26191843,0.00004371596,0.7355516,0.0006125645,0.0016597173,0.000027946873,0.0000014298364,0.000014426529,0.0001701606],"genre_scores_gemma":[0.84627676,0.0000106232055,0.1532409,0.00015582511,0.00030486623,6.940107e-7,8.4575817e-7,0.0000028339623,0.000006641426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982775,0.00003541147,0.0003789543,0.00012552648,0.000992811,0.00018981389],"domain_scores_gemma":[0.9979419,0.00010178033,0.00048716812,0.00026114954,0.0010911627,0.00011679951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009908243,0.00008391883,0.00012028756,0.0005118478,0.000091044036,0.00019653547,0.0022847832,0.000018234603,0.000014807264],"category_scores_gemma":[0.000037717473,0.00006420534,0.000060228587,0.0004735529,0.00023589478,0.004186811,0.00029599856,0.00009898035,0.0000078024705],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051787767,0.0009318251,0.08307901,0.0000161321,0.00018782199,0.000032585816,0.0036522888,0.003865652,0.007442463,0.5724582,0.00053700595,0.3277452],"study_design_scores_gemma":[0.0023730963,0.0012313143,0.71618354,0.0007085524,0.00004544651,0.00409846,0.00021298502,0.21355756,0.030627707,0.024539933,0.0056766835,0.0007447479],"about_ca_topic_score_codex":0.0000094122715,"about_ca_topic_score_gemma":0.0000010748051,"teacher_disagreement_score":0.6331045,"about_ca_system_score_codex":0.00010139555,"about_ca_system_score_gemma":0.0002764423,"threshold_uncertainty_score":0.42457336},"labels":[],"label_agreement":null},{"id":"W2091665273","doi":"10.1142/s0218196711006947","title":"ON ITERATED MAL'CEV PRODUCTS WITH A PSEUDOVARIETY OF GROUPS","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Mathematics; Iterated function; Pure mathematics; Algebra over a field; Combinatorics; Mathematical analysis","score_opus":0.014421554238940155,"score_gpt":0.22727958137694076,"score_spread":0.21285802713800062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091665273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7217369,0.000042262294,0.27728993,0.00030186455,0.0003232762,0.000037483536,0.0000010550059,0.000013336994,0.00025388246],"genre_scores_gemma":[0.97205895,0.000009645031,0.027639113,0.00020715629,0.000067530425,6.7697846e-7,0.0000019201414,0.0000047204007,0.000010309142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911076,0.00004253724,0.0002899377,0.00012665495,0.00035823212,0.00007185369],"domain_scores_gemma":[0.9988262,0.00006677366,0.00037848565,0.00007966799,0.00060890545,0.00003998849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023088351,0.00008303903,0.0001231887,0.00017518572,0.000024004257,0.000065790635,0.000358768,0.000024793348,0.00000970884],"category_scores_gemma":[0.000027316784,0.0000605007,0.00003189208,0.00015322742,0.000040967545,0.0005071827,0.00004863569,0.000090690955,0.0000021704025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008786336,0.0006901948,0.002513023,0.00003611051,0.00045629774,0.00024848903,0.009782487,0.0009619334,0.0039014246,0.8606389,0.00049646274,0.11939602],"study_design_scores_gemma":[0.0059695565,0.005411785,0.19636005,0.00096016296,0.00008036986,0.0036232264,0.00051010336,0.12584475,0.051446237,0.608948,0.00016256457,0.000683218],"about_ca_topic_score_codex":0.000007395912,"about_ca_topic_score_gemma":5.473408e-7,"teacher_disagreement_score":0.25169095,"about_ca_system_score_codex":0.000017052615,"about_ca_system_score_gemma":0.000050990773,"threshold_uncertainty_score":0.2467147},"labels":[],"label_agreement":null},{"id":"W2091741450","doi":"10.1016/j.jcss.2008.02.007","title":"Lower bounds for the transition complexity of NFAs","year":2008,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Nondeterministic algorithm; Constant (computer programming); State (computer science); Combinatorics; Mathematics; Discrete mathematics; Computer science; Algorithm","score_opus":0.052486422567526995,"score_gpt":0.2577307109255387,"score_spread":0.20524428835801167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091741450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17981726,0.0005968251,0.81778973,0.0007031865,0.000877215,0.00007314525,0.0000014836344,0.00001087751,0.00013030144],"genre_scores_gemma":[0.967194,0.000022526405,0.03244943,0.00011737779,0.00020836454,8.1835805e-7,5.209866e-8,0.0000015554133,0.0000058446744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898714,0.00006978457,0.00036876064,0.00011416487,0.00033631863,0.0001238335],"domain_scores_gemma":[0.9990952,0.00029459357,0.0002861966,0.00012916012,0.00014803807,0.000046822443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014123023,0.00007067327,0.00021585014,0.00008520385,0.0003756047,0.00010906043,0.0007135019,0.000021258582,0.0000010439329],"category_scores_gemma":[0.000004618203,0.000038068367,0.00011407454,0.00020626932,0.00047275692,0.00045064537,0.000046447523,0.0000516507,3.5134082e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012559608,0.0003159893,0.0011487395,0.0004331206,0.00019234479,0.00008487396,0.018604372,0.0048129046,0.0015484958,0.8983545,0.0077539366,0.066625185],"study_design_scores_gemma":[0.0008818351,0.0014944911,0.011469659,0.0002865457,0.0000244627,0.0034208032,0.0006709407,0.96945304,0.000684248,0.010174617,0.0012594147,0.00017997238],"about_ca_topic_score_codex":0.000006947138,"about_ca_topic_score_gemma":7.1726316e-7,"teacher_disagreement_score":0.9646401,"about_ca_system_score_codex":0.00001033876,"about_ca_system_score_gemma":0.00007518877,"threshold_uncertainty_score":0.28888857},"labels":[],"label_agreement":null},{"id":"W2091767797","doi":"10.1080/00927872.2010.509748","title":"Representation Extension and Amalgamation in Pomonoids","year":2011,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monoid; Flatness (cosmology); Semigroup; Pure mathematics; Extension (predicate logic); Bicyclic semigroup; Algebra over a field; Computer science","score_opus":0.08203625130470472,"score_gpt":0.30504607997179606,"score_spread":0.22300982866709135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091767797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93410945,0.0013944772,0.05275215,0.001360135,0.0000889756,0.00026453816,6.117694e-7,0.00014978583,0.009879851],"genre_scores_gemma":[0.929641,0.00040805453,0.06975743,0.00013141644,0.000003341225,0.000031114945,0.0000055575774,0.0000041391168,0.00001791048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992347,0.00018719965,0.00022241539,0.00018739875,0.00006545452,0.00010286432],"domain_scores_gemma":[0.99817127,0.0001320546,0.00006010951,0.0015857345,0.000026373518,0.000024439245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004396321,0.000060676448,0.000087306384,0.0002089838,0.000063888845,0.000040446324,0.00087697204,0.00004242336,0.000007698521],"category_scores_gemma":[0.00007752172,0.00006325785,0.000013655299,0.0005227709,0.00007107892,0.00057025795,0.000572278,0.00012153832,0.000016333406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004579065,0.00016413387,0.026687797,0.000005233784,0.0000025160743,0.0000033423646,0.007031149,0.0000048765764,0.0013548415,0.81767964,0.000052831525,0.14700907],"study_design_scores_gemma":[0.00031903601,0.000020041685,0.71180993,0.00005137439,0.0000016041906,0.00000959746,0.0002941942,0.09371846,0.0010144997,0.1925338,0.00010993513,0.00011754715],"about_ca_topic_score_codex":0.00017316313,"about_ca_topic_score_gemma":0.000103749466,"teacher_disagreement_score":0.68512213,"about_ca_system_score_codex":0.000027607017,"about_ca_system_score_gemma":0.000013046751,"threshold_uncertainty_score":0.25795802},"labels":[],"label_agreement":null},{"id":"W2092385955","doi":"10.1007/s10485-008-9147-2","title":"The Universal Covering of an Inverse Semigroup","year":2008,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Instituto Superior Técnico; Tobacco Settlement Endowment Trust","keywords":"Mathematics; Inverse semigroup; Morphism; Inverse; Decidability; Covering space; Semigroup; Unitary state; Pure mathematics; Inverse element; Group (periodic table); Topos theory; Discrete mathematics; Special classes of semigroups; Geometry","score_opus":0.010015702500567386,"score_gpt":0.20216501215902485,"score_spread":0.19214930965845747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092385955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8098675,0.000111658854,0.18186839,0.00013168766,0.00035437586,0.0001738773,0.0000015031836,0.00026760658,0.0072233896],"genre_scores_gemma":[0.99739695,0.000031455304,0.0022899685,0.00015046619,0.00007050615,0.000004014689,0.000002695749,0.000008205086,0.000045745644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899507,0.00003384678,0.00017731223,0.00026627575,0.0002708156,0.00025667754],"domain_scores_gemma":[0.9990954,0.00015088209,0.00009035075,0.00053545815,0.000025099805,0.00010285047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011447539,0.00013130957,0.00015046755,0.00003480398,0.00032407325,0.00004340583,0.001062044,0.00006821665,0.000012295043],"category_scores_gemma":[0.000011872196,0.00008663711,0.000050744027,0.00028247086,0.00019970877,0.00018111293,0.00023348811,0.0001486479,0.00000795521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013075226,0.000011902692,0.000043485557,0.0000029416753,0.000012139057,0.000016484675,0.00046926038,0.00027079368,0.0054084607,0.9801366,0.0005031303,0.013111767],"study_design_scores_gemma":[0.0008805557,0.00014879314,0.013026314,0.0000011013218,0.000014866943,0.0001838123,0.0006002702,0.01995456,0.034953084,0.9166646,0.013069313,0.00050272024],"about_ca_topic_score_codex":0.000070571434,"about_ca_topic_score_gemma":0.000008457367,"teacher_disagreement_score":0.18752943,"about_ca_system_score_codex":0.000037496317,"about_ca_system_score_gemma":0.000044184988,"threshold_uncertainty_score":0.35329586},"labels":[],"label_agreement":null},{"id":"W2092435018","doi":"10.1112/blms/bdm030","title":"The complexity of the equivalence problem for nonsolvable groups","year":2007,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Equivalence (formal languages); Cardinality (data modeling); Combinatorics; Discrete mathematics; Nilpotent group; Nilpotent","score_opus":0.02737374476136478,"score_gpt":0.25231730437640193,"score_spread":0.22494355961503715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092435018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043410577,0.00055711105,0.8940819,0.04818112,0.00057097303,0.002545699,0.000028896415,0.0001625453,0.010461159],"genre_scores_gemma":[0.7011508,0.00003878419,0.2943141,0.0015869851,0.00011563506,0.000048521943,6.3943196e-7,0.000032999105,0.002711556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814224,0.00010607865,0.0005554764,0.00023907042,0.00052863045,0.00042852163],"domain_scores_gemma":[0.99628955,0.0019518945,0.0003997906,0.0011864181,0.00012050016,0.000051869178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003430388,0.00015880498,0.00026846176,0.000006144888,0.0005142674,0.00005789826,0.002971766,0.00008495608,0.00005098078],"category_scores_gemma":[0.00024975205,0.00007094165,0.00062884646,0.00024520775,0.0012659895,0.000034004155,0.0010587245,0.00019531349,0.000012846026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012868112,0.0001519059,0.00004142558,0.00028021008,0.0000376189,8.915904e-8,0.0007165326,0.000017834845,0.0016683269,0.97538984,0.020104814,0.0015785418],"study_design_scores_gemma":[0.00048958923,0.00006461568,0.0007096403,0.00024275346,0.000032129486,0.00001241197,0.00030817333,0.012546191,0.023503145,0.9381925,0.023728978,0.00016991186],"about_ca_topic_score_codex":0.000013873464,"about_ca_topic_score_gemma":0.0000019142494,"teacher_disagreement_score":0.65774024,"about_ca_system_score_codex":0.000036199024,"about_ca_system_score_gemma":0.000037857204,"threshold_uncertainty_score":0.552233},"labels":[],"label_agreement":null},{"id":"W2094091116","doi":"10.4153/cmb-2010-028-7","title":"Pisot Numbers from {0, 1}-Polynomials","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Polynomial; Algebraic number; Limit point; Unit (ring theory); Unit disk; Real number; Limit (mathematics); Sequence (biology); Discrete mathematics; Mathematical analysis","score_opus":0.006932058332731388,"score_gpt":0.1987675174161305,"score_spread":0.1918354590833991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094091116","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17336284,0.0005741832,0.30603674,0.14948311,0.00074711227,0.0007562814,0.00008637666,0.0010827057,0.36787066],"genre_scores_gemma":[0.946042,0.000004008774,0.0382406,0.013625737,0.00016808532,0.00000860709,0.0000069956245,0.00001490492,0.0018890805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865943,0.0000549551,0.0002649951,0.00034592763,0.00018302319,0.00049167254],"domain_scores_gemma":[0.9983677,0.00022135378,0.000048726295,0.00067211565,0.000023828492,0.00066624413],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002697796,0.00016571626,0.00024097362,0.00009194542,0.00011596194,0.00022126807,0.0009448763,0.00009936268,0.008436296],"category_scores_gemma":[0.00016709974,0.00015227745,0.000084832616,0.00015457101,0.000050374914,0.00007743649,0.000042417807,0.00013384601,0.021584539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019788563,0.000046203844,0.000014918616,0.0000065594636,0.000014096959,0.00012446298,0.00047129454,0.000002864167,0.00028098148,0.82784057,0.14270665,0.028489435],"study_design_scores_gemma":[0.00032812386,0.000057408117,0.0008860633,0.00008313231,0.000010918407,0.0000355197,0.0000628873,0.0034237164,0.00087899785,0.78105485,0.21270292,0.00047545103],"about_ca_topic_score_codex":0.0018380596,"about_ca_topic_score_gemma":0.00030634092,"teacher_disagreement_score":0.77267915,"about_ca_system_score_codex":0.00010361667,"about_ca_system_score_gemma":0.00013359988,"threshold_uncertainty_score":0.99247015},"labels":[],"label_agreement":null},{"id":"W2094709030","doi":"10.1142/s0218196701000711","title":"ON THE ROOT OF LANGUAGES","year":2001,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università degli Studi di Milano; McMaster University","keywords":"Root (linguistics); Mathematics; Undecidable problem; Decidability; Context (archaeology); Regular language; Context-free language; Discrete mathematics; Linguistics; Automaton; Computer science; Natural language processing; Rule-based machine translation; Theoretical computer science","score_opus":0.009275104858219805,"score_gpt":0.2694619149082258,"score_spread":0.260186810050006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094709030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76839185,0.00012262764,0.2276249,0.002974947,0.00023722654,0.000016286209,4.3781992e-7,0.000006241067,0.000625462],"genre_scores_gemma":[0.9982521,0.00002395891,0.0012718261,0.00035022586,0.00008163269,2.6027848e-7,4.6540703e-7,0.0000018212304,0.000017714192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999432,0.00003687491,0.00017730353,0.000050219533,0.00026299528,0.00004056015],"domain_scores_gemma":[0.9993047,0.00025532555,0.00020206609,0.000050044895,0.00016930995,0.00001851701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023312248,0.000040148803,0.0000616014,0.000087213266,0.000021606505,0.000059517384,0.00035449382,0.000013145634,0.000012596748],"category_scores_gemma":[0.00004385384,0.000025160907,0.00003720416,0.00006573257,0.000022547849,0.00018654982,0.000041695967,0.000057572397,0.0000025536635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004293606,0.00008001215,0.0010968262,0.0000022238037,0.00008207893,0.00005684622,0.0008630273,0.0012161497,0.0009767177,0.77848977,0.0008440092,0.2162494],"study_design_scores_gemma":[0.00126631,0.0006029076,0.09000791,0.00023072417,0.000017142971,0.0011795646,0.0005384254,0.09632489,0.0063002245,0.8022301,0.0011172332,0.00018458074],"about_ca_topic_score_codex":0.0000036086462,"about_ca_topic_score_gemma":7.908728e-7,"teacher_disagreement_score":0.22986022,"about_ca_system_score_codex":0.000009466243,"about_ca_system_score_gemma":0.000015776413,"threshold_uncertainty_score":0.102603205},"labels":[],"label_agreement":null},{"id":"W2096032355","doi":"10.1007/s11083-010-9142-8","title":"Small Semigroups Generating Varieties with Continuum Many Subvarieties","year":2010,"lang":"en","type":"article","venue":"Order","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Mount Saint Vincent University","funders":"","keywords":"Mathematics; Isomorphism (crystallography); Semigroup; Variety (cybernetics); Monoid; Pure mathematics; Order (exchange); Algebra over a field","score_opus":0.008059683917308876,"score_gpt":0.1874648852515281,"score_spread":0.17940520133421922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096032355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48904067,0.000092930255,0.5025849,0.00068389886,0.00062296144,0.00010433001,0.0000015053084,0.0003977029,0.0064711086],"genre_scores_gemma":[0.7921987,0.000005144416,0.20186655,0.0010589403,0.00027235315,0.000027450906,0.00000467034,0.000026646178,0.0045395107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988359,0.00004005005,0.00017623103,0.0003818448,0.00020727678,0.00035867555],"domain_scores_gemma":[0.99892503,0.00009787528,0.00008646578,0.0006670134,0.000140178,0.000083414256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034424217,0.00019301829,0.00017746094,0.00005731739,0.00023040002,0.00044436436,0.000719004,0.00010175641,0.00014728362],"category_scores_gemma":[0.000042768417,0.00014660727,0.00003754556,0.00027082113,0.0001259793,0.00036937185,0.00022474337,0.0003291535,0.00007865522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000206786,0.00013282352,0.0062104533,0.0000416566,0.00007279451,0.000069771726,0.0042928085,0.000072449686,0.07916385,0.8729131,0.0059019094,0.031107657],"study_design_scores_gemma":[0.005502611,0.0012098076,0.035546575,0.00019638687,0.00013746404,0.0012607495,0.0022956962,0.3641842,0.16660316,0.114016116,0.3035894,0.005457829],"about_ca_topic_score_codex":0.00006399545,"about_ca_topic_score_gemma":0.00031411723,"teacher_disagreement_score":0.758897,"about_ca_system_score_codex":0.000007278597,"about_ca_system_score_gemma":0.000069099005,"threshold_uncertainty_score":0.5978471},"labels":[],"label_agreement":null},{"id":"W2096361394","doi":"10.1142/s0129054114400267","title":"ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Queen's University","funders":"Russian Foundation for Basic Research","keywords":"Bijection, injection and surjection; Abelian group; Connection (principal bundle); Combinatorics on words; Mathematics; Alphabet; Combinatorics; Lattice (music); Word (group theory); Discrete mathematics; Bijection; Geometry; Linguistics","score_opus":0.017819204113933944,"score_gpt":0.28490041943164074,"score_spread":0.2670812153177068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096361394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45115906,0.0000034912691,0.5474225,0.0005478325,0.00042510577,0.000043164364,0.0000013853294,0.000009357908,0.00038807603],"genre_scores_gemma":[0.8546105,0.000002128503,0.14515808,0.00015238652,0.00006448149,0.000001090327,5.9056333e-7,0.000004332972,0.0000063981174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976786,0.00012504376,0.00062045915,0.00019597643,0.0012369952,0.000142957],"domain_scores_gemma":[0.99619627,0.0007314658,0.0010413898,0.00059407257,0.0013685883,0.000068211244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021585869,0.000109109045,0.00021685028,0.00035561953,0.00010002489,0.00017996396,0.0037275425,0.000021442413,0.000045987963],"category_scores_gemma":[0.00017409193,0.00006754723,0.000083072584,0.0006169645,0.00065251114,0.0011701699,0.00023615894,0.000112273345,0.000003819381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020393247,0.00025117144,0.00057323056,0.000009060273,0.0000509463,0.0000019876638,0.0012853462,0.0019655086,0.0015820739,0.8991667,0.0000463251,0.095047235],"study_design_scores_gemma":[0.0008880012,0.0010612953,0.020028787,0.0005346657,0.000018975416,0.0002702897,0.0001059384,0.74364,0.013380185,0.21959884,0.00026815763,0.00020482758],"about_ca_topic_score_codex":0.000066836554,"about_ca_topic_score_gemma":0.0000052905984,"teacher_disagreement_score":0.74167454,"about_ca_system_score_codex":0.000039247152,"about_ca_system_score_gemma":0.0003433725,"threshold_uncertainty_score":0.6926763},"labels":[],"label_agreement":null},{"id":"W2096648167","doi":"10.1016/j.jcss.2004.07.004","title":"First-order expressibility of languages with neutral letters or: The Crane Beach conjecture","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Conjecture; First-order logic; Predicate (mathematical logic); Iterated function; Mathematics; Alphabet; Order (exchange); Logarithm; Discrete mathematics; Combinatorics; Computer science; Linguistics; Programming language; Philosophy","score_opus":0.009808816728811886,"score_gpt":0.23353575833276194,"score_spread":0.22372694160395004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096648167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61064494,0.00051813474,0.3866712,0.0017682154,0.00024154197,0.000072681636,8.5084673e-7,0.000016795113,0.00006564418],"genre_scores_gemma":[0.9675555,0.000007549832,0.032059155,0.00023359564,0.00013571895,7.1643046e-7,4.8860468e-8,0.000002352841,0.0000053484373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988326,0.00010278174,0.00034082454,0.00017895816,0.00037875483,0.00016608209],"domain_scores_gemma":[0.9990651,0.00022296236,0.0003383517,0.000223452,0.000088046014,0.00006207427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011288888,0.000110806184,0.00026335815,0.00008121323,0.00020638783,0.00022199478,0.0009603208,0.000025753176,0.0000013185187],"category_scores_gemma":[0.0000071882514,0.00004195422,0.000056371522,0.00033602543,0.0003167563,0.0004752486,0.00009348962,0.00011302758,2.7407583e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070531125,0.001014969,0.04369876,0.0029154674,0.0008289976,0.0025630384,0.0995777,0.46122816,0.01064019,0.2914666,0.004671352,0.080689475],"study_design_scores_gemma":[0.025068436,0.023830041,0.32711855,0.016974887,0.0004966006,0.0864942,0.03219717,0.4280897,0.03330499,0.017072307,0.005176315,0.0041768127],"about_ca_topic_score_codex":0.000030083138,"about_ca_topic_score_gemma":0.000014225635,"teacher_disagreement_score":0.35691056,"about_ca_system_score_codex":0.000016691321,"about_ca_system_score_gemma":0.00010337587,"threshold_uncertainty_score":0.21407008},"labels":[],"label_agreement":null},{"id":"W2097354710","doi":"10.1142/s0218196704001967","title":"THE GLOBALS OF SOME SUBPSEUDOVARIETIES OF $\\mathsf{DA}$","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Universidade do Porto; McGill University","keywords":"Mathematics; Semidirect product; Combinatorics; Pure mathematics; Group (periodic table); Physics","score_opus":0.0087214518467257,"score_gpt":0.25861110264183396,"score_spread":0.24988965079510825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097354710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70780855,0.0008861513,0.28851846,0.0020385527,0.0006222273,0.000029658651,0.000002060343,0.000007694467,0.00008664056],"genre_scores_gemma":[0.992406,0.00015392622,0.007252844,0.00009922997,0.00007953872,3.3369992e-7,6.791642e-7,0.0000024710596,0.000004944575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898994,0.000032983906,0.0004216025,0.00006659189,0.0004234943,0.00006541432],"domain_scores_gemma":[0.9987555,0.00016571862,0.0005284037,0.00007153574,0.00045026696,0.00002853806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003761781,0.000059839087,0.00012192972,0.000091337446,0.000040070034,0.00009677702,0.00054376235,0.000023934495,0.0000013359552],"category_scores_gemma":[0.000047088975,0.000041143987,0.00007098802,0.000086611115,0.00009402009,0.00046383834,0.000090967806,0.000059437287,8.587296e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004273316,0.000064383625,0.00021664336,0.000007807858,0.000107006665,0.000009654748,0.00082537736,0.0033199643,0.0019781878,0.9343948,0.00007949827,0.05895397],"study_design_scores_gemma":[0.0008567258,0.00021709148,0.013778628,0.0001098636,0.000011467752,0.00022052131,0.00019766725,0.006852691,0.010121714,0.96741724,0.00014528741,0.000071111164],"about_ca_topic_score_codex":0.000012431278,"about_ca_topic_score_gemma":8.207076e-7,"teacher_disagreement_score":0.28459746,"about_ca_system_score_codex":0.000023605326,"about_ca_system_score_gemma":0.00007912965,"threshold_uncertainty_score":0.16778031},"labels":[],"label_agreement":null},{"id":"W2097650550","doi":"10.1080/17459730902916545","title":"Interlocking and Euclidean rhythms","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics and Music","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Interdisciplinary Research in Music Media and Technology; McGill University","funders":"Queensland University of Technology","keywords":"Interlocking; Alternation (linguistics); Euclidean geometry; Mathematics; Rhythm; Euclidean distance; Combinatorics; Computer science; Geometry; Engineering","score_opus":0.01542097981143119,"score_gpt":0.22870632866087492,"score_spread":0.21328534884944372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097650550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8365244,0.0007742555,0.16095981,0.00071472424,0.00015650182,0.00003415945,3.5834603e-7,0.00001675372,0.00081901666],"genre_scores_gemma":[0.92385375,0.00008431855,0.07535116,0.00059989025,0.000083783285,1.107641e-7,3.1533393e-8,0.0000025462057,0.000024401026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994904,0.000009601618,0.00023821363,0.000062826315,0.00011183565,0.000087137574],"domain_scores_gemma":[0.9995199,0.000070099944,0.00020053305,0.000110246365,0.000036123278,0.00006312101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004363289,0.000063590356,0.00015398736,0.00007173809,0.00003899509,0.0001307873,0.00015681071,0.00002060349,0.0000032853065],"category_scores_gemma":[0.000033236214,0.000044575834,0.00003323822,0.000046474623,0.000016728574,0.00022349248,0.00005348796,0.0000839391,8.703518e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003718514,0.00015597606,0.00003416776,0.00007729463,0.00003405674,0.000113224014,0.009774187,0.0000047549747,0.0048056315,0.5464362,0.001547838,0.43701297],"study_design_scores_gemma":[0.0016411032,0.0012961243,0.0027569293,0.001226005,0.00007187822,0.008735504,0.0014318064,0.08189606,0.002663747,0.88719165,0.010556454,0.0005327661],"about_ca_topic_score_codex":5.500669e-7,"about_ca_topic_score_gemma":2.2992687e-7,"teacher_disagreement_score":0.4364802,"about_ca_system_score_codex":0.000004992997,"about_ca_system_score_gemma":0.000009239954,"threshold_uncertainty_score":0.18177497},"labels":[],"label_agreement":null},{"id":"W2097880459","doi":"10.1142/s0129054112400035","title":"STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Hierarchy; Finite-state machine; State (computer science); Turing machine; Encoding (memory); Mathematics; Time hierarchy theorem; Computable function; Deterministic finite automaton; Computational complexity theory; Finite state; Theoretical computer science; Discrete mathematics; Computer science; Algorithm; Universal Turing machine; Computation; Artificial intelligence","score_opus":0.03892250258857448,"score_gpt":0.3235433376829667,"score_spread":0.28462083509439223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097880459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09359268,0.00005277895,0.90136874,0.0012571469,0.0034676497,0.0000902144,0.000016598053,0.000022814822,0.00013137265],"genre_scores_gemma":[0.6479993,0.000010304447,0.35148722,0.00024793737,0.00022290887,0.0000019234747,0.0000011907363,0.000003750879,0.000025478686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978562,0.000049839407,0.00064785965,0.00018191276,0.0009567586,0.00030745874],"domain_scores_gemma":[0.9960831,0.00095084414,0.000674171,0.00031824724,0.0017993748,0.0001742556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001979737,0.000117584736,0.00019934602,0.00046666912,0.00016431979,0.00036094646,0.0032959967,0.000018099969,0.000019723899],"category_scores_gemma":[0.0003939997,0.00010247159,0.00014842297,0.0005011373,0.0005107099,0.0034364273,0.0004304009,0.00011644949,0.000009217802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010863141,0.0010125306,0.0030645682,0.000028337463,0.00022628417,0.000018691084,0.005840024,0.011389717,0.0059051663,0.50972015,0.0015683973,0.46111754],"study_design_scores_gemma":[0.0023220077,0.00066444813,0.04732715,0.00020572168,0.000021466129,0.0005794817,0.00004803929,0.5352207,0.021352837,0.37303832,0.018655587,0.0005642602],"about_ca_topic_score_codex":0.000008027862,"about_ca_topic_score_gemma":0.0000013114853,"teacher_disagreement_score":0.5544066,"about_ca_system_score_codex":0.00011227127,"about_ca_system_score_gemma":0.00037704076,"threshold_uncertainty_score":0.6124837},"labels":[],"label_agreement":null},{"id":"W2097927392","doi":"10.1142/s0218196710005674","title":"A STRUCTURAL APPROACH TO THE LOCALITY OF PSEUDOVARIETIES OF THE FORM LH ⓜ V","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monoid; Locality; Extension (predicate logic); Pure mathematics; Combinatorics; Algebra over a field; Linguistics","score_opus":0.009443461778471886,"score_gpt":0.24565702684049587,"score_spread":0.23621356506202398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097927392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72396374,0.000023097995,0.2737847,0.0013703215,0.0006770193,0.000041706306,0.0000019794297,0.0000031306197,0.00013430836],"genre_scores_gemma":[0.9892321,0.0000018949806,0.010454832,0.00020440777,0.00009780481,5.648941e-7,5.1780455e-7,0.0000019868128,0.0000058671126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991479,0.00003902062,0.00029653445,0.00006763627,0.0003961681,0.00005276628],"domain_scores_gemma":[0.9990459,0.00009769583,0.00034211282,0.00010719419,0.00038167537,0.000025397527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038777574,0.000053516746,0.00009455004,0.000059709935,0.00004279448,0.00006289396,0.000794939,0.000023758708,0.000002355825],"category_scores_gemma":[0.00005091098,0.00002830111,0.00006822149,0.000110170135,0.00007831247,0.00023497149,0.00016068782,0.00012615381,2.609449e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007847922,0.00010027415,0.0038268522,0.000022242237,0.0001636157,0.0000016184819,0.007853784,0.0059097856,0.0061997487,0.80668336,0.00042902527,0.16873123],"study_design_scores_gemma":[0.0007637381,0.00017383695,0.2523196,0.00006512892,0.000023807657,0.00054127164,0.0006013974,0.33498007,0.010348557,0.39975953,0.00028534082,0.00013771172],"about_ca_topic_score_codex":0.000017803995,"about_ca_topic_score_gemma":0.000003850713,"teacher_disagreement_score":0.40692383,"about_ca_system_score_codex":0.0000082882425,"about_ca_system_score_gemma":0.000046052734,"threshold_uncertainty_score":0.14772077},"labels":[],"label_agreement":null},{"id":"W2098375093","doi":"10.1007/978-3-642-27654-5_30","title":"State Complexity of Kleene-Star Operations on Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Star (game theory); Iterated function; String (physics); Computer science; State (computer science); Tree (set theory); Algorithm; Regular language; Discrete mathematics; Extension (predicate logic); Combinatorics; Mathematics; Theoretical computer science; Automaton","score_opus":0.03429629418638434,"score_gpt":0.25736712697763525,"score_spread":0.2230708327912509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098375093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016825782,0.0004393586,0.9942375,0.00052743417,0.0010567943,0.00028769937,0.000031429376,0.00013992486,0.0015973207],"genre_scores_gemma":[0.6531889,0.0000663399,0.34474024,0.0013405951,0.0003169319,0.000007097797,0.000011780629,0.00003514266,0.0002930056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969483,0.000053878273,0.0005494703,0.0009847556,0.00087237486,0.00059124833],"domain_scores_gemma":[0.99747336,0.00037397916,0.00021691715,0.0015759214,0.0001855305,0.00017429743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008577609,0.00045516773,0.00055284903,0.0006374713,0.00023139818,0.00025375953,0.0030451962,0.00017140823,0.00005449467],"category_scores_gemma":[0.000046693895,0.00038780316,0.00014053896,0.0004366417,0.0012621443,0.000616916,0.0010093228,0.00053735764,0.00005901516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009077325,0.00010749552,0.000034579494,0.00003594091,0.00001978756,0.000023601599,0.0015313315,0.050469667,0.0011567252,0.37347004,0.000024357334,0.5731174],"study_design_scores_gemma":[0.00031367215,0.0003329407,0.0010412049,0.00042775503,0.000009997239,0.000030866522,3.025468e-7,0.5768172,0.011443514,0.407793,0.0009914135,0.0007981334],"about_ca_topic_score_codex":0.00005946179,"about_ca_topic_score_gemma":0.00015899795,"teacher_disagreement_score":0.6515063,"about_ca_system_score_codex":0.00015758132,"about_ca_system_score_gemma":0.0002971461,"threshold_uncertainty_score":0.99985737},"labels":[],"label_agreement":null},{"id":"W2098447376","doi":"10.5802/jtnb.457","title":"On the binary expansions of algebraic numbers","year":2009,"lang":"lv","type":"article","venue":"Journal de Théorie des Nombres de Bordeaux","topic":"semigroups and automata theory","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Mathematics; Algebraic number; Binary number; Degree (music); Series (stratigraphy); Number theory; Discrete mathematics; Combinatorics; Arithmetic; Mathematical analysis","score_opus":0.013772224113300193,"score_gpt":0.25912966391925685,"score_spread":0.24535743980595665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098447376","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9466113,0.003370627,0.024453253,0.013400394,0.0009784142,0.00023197538,0.000021907277,0.00010370102,0.010828428],"genre_scores_gemma":[0.98878175,0.0012397442,0.0042416584,0.004565042,0.00043446064,0.0000041170438,0.000001611675,0.000032154017,0.00069947744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964404,0.0006900954,0.0007764891,0.00039485664,0.0006742732,0.0010238647],"domain_scores_gemma":[0.9965534,0.0011627021,0.00058333576,0.001001835,0.00023334287,0.00046538853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021688044,0.0004201016,0.00047565394,0.00025502619,0.0008665613,0.0005275395,0.0022221932,0.00022244117,0.00028575282],"category_scores_gemma":[0.00050705875,0.0002971841,0.00045829982,0.00083300035,0.00039511782,0.0005648353,0.00021791858,0.001144111,0.00008323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025777167,0.0008698172,0.0005887564,0.000048595823,0.00020105904,0.0008473509,0.0066543375,0.0016986936,0.010056615,0.8737998,0.039052743,0.06592444],"study_design_scores_gemma":[0.0008837205,0.0018781213,0.029301122,0.0008889544,0.00011169284,0.001919394,0.0012236881,0.020978348,0.00270344,0.9363779,0.003184601,0.00054906],"about_ca_topic_score_codex":0.000048762347,"about_ca_topic_score_gemma":0.000005365046,"teacher_disagreement_score":0.06537538,"about_ca_system_score_codex":0.00032037098,"about_ca_system_score_gemma":0.0008777873,"threshold_uncertainty_score":0.999948},"labels":[],"label_agreement":null},{"id":"W2098464356","doi":"10.1016/j.aam.2008.03.005","title":"A connection between palindromic and factor complexity using return words","year":2008,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Combinatorics; Word (group theory); Connection (principal bundle); Function (biology); Set (abstract data type); Word length; Factor (programming language); Discrete mathematics; Geometry; Linguistics","score_opus":0.0587870870588243,"score_gpt":0.291506953157473,"score_spread":0.2327198660986487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098464356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5780462,0.00025263237,0.42029423,0.000015611795,0.000056462137,0.00014276647,0.0000034294837,0.00009578248,0.0010928483],"genre_scores_gemma":[0.7249524,0.000077695804,0.27489218,0.000030402683,0.000027206064,0.0000061443975,0.000001347583,0.000008241642,0.0000043978484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905926,0.000015404075,0.0002872317,0.00026238407,0.00016381175,0.00021189386],"domain_scores_gemma":[0.99916697,0.0003039921,0.00014496318,0.00032214163,0.000010497111,0.00005142606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017238628,0.00014293169,0.00027690112,0.00008473865,0.00012437512,0.00003488203,0.00030261686,0.000058753227,0.000005665586],"category_scores_gemma":[0.000026004636,0.00013148595,0.00002338594,0.00024133346,0.00014544142,0.0002953865,0.00015532038,0.00013346055,0.000006018549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008274116,0.00014469196,0.008934851,0.00029076613,0.0000184841,0.00002297371,0.0065618325,0.00012908672,0.0025490867,0.9443688,0.000008341971,0.03696284],"study_design_scores_gemma":[0.00093591295,0.000047158683,0.004304689,0.00014189926,0.000011530418,0.00016173074,0.00058714976,0.12907523,0.0061740433,0.85751855,0.0004805299,0.000561589],"about_ca_topic_score_codex":0.000004030897,"about_ca_topic_score_gemma":0.000004922497,"teacher_disagreement_score":0.14690615,"about_ca_system_score_codex":0.000044697343,"about_ca_system_score_gemma":0.000018121927,"threshold_uncertainty_score":0.53618413},"labels":[],"label_agreement":null},{"id":"W2098631512","doi":"10.1142/s1005386707000119","title":"Generalized Inflations of Completely Simple Semigroups","year":2007,"lang":"en","type":"article","venue":"Algebra Colloquium","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Carleton University","funders":"","keywords":"Mathematics; Simple (philosophy); Semigroup; Pure mathematics; Associative property; Null (SQL); Inflation (cosmology); Computer science; Theoretical physics","score_opus":0.013907936285853377,"score_gpt":0.2513397610490686,"score_spread":0.2374318247632152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098631512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6961473,0.00015580193,0.29841903,0.00031287863,0.00040937314,0.0001897942,0.0000106354,0.00025774795,0.0040974314],"genre_scores_gemma":[0.97261095,0.0000079776955,0.026320774,0.00069908705,0.00010362173,0.000007510381,0.000012967748,0.000014353635,0.00022277114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984227,0.00005950355,0.00047245563,0.00031422742,0.0003297965,0.00040133315],"domain_scores_gemma":[0.99850136,0.0003208475,0.00018805731,0.0007379976,0.00012204914,0.00012968488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073800527,0.00016097969,0.0002601824,0.00017720346,0.0001411549,0.000065155786,0.0008885204,0.000080593425,0.000095796684],"category_scores_gemma":[0.00005994255,0.00015649176,0.00012512138,0.0007975169,0.000089334826,0.00039364552,0.0002955465,0.00010142709,0.000055855166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022283723,0.00011900975,0.0023466325,0.000017417386,0.000044550383,0.00002515513,0.00056705234,0.000077382785,0.036426194,0.9444138,0.005823954,0.010116587],"study_design_scores_gemma":[0.0053826356,0.00089767,0.17625163,0.00011265939,0.00009582818,0.00016442235,0.00043543233,0.076852344,0.18370657,0.40574068,0.14822696,0.0021331725],"about_ca_topic_score_codex":0.00009138017,"about_ca_topic_score_gemma":0.00005924763,"teacher_disagreement_score":0.5386731,"about_ca_system_score_codex":0.000036195557,"about_ca_system_score_gemma":0.00006518584,"threshold_uncertainty_score":0.63815486},"labels":[],"label_agreement":null},{"id":"W2099027386","doi":"10.1109/cdc.1988.194536","title":"A combinatorial approach to nonlinear functional expansions: an introduction with an example","year":2003,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Nonlinear system; Theoretical computer science; Applied mathematics; Mathematical optimization; Mathematics; Physics","score_opus":0.028402911276217822,"score_gpt":0.22381410156300216,"score_spread":0.19541119028678433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099027386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13825983,0.0000052000296,0.857293,0.0002098998,0.00088156865,0.0001694869,7.0511584e-7,0.00031021453,0.0028700987],"genre_scores_gemma":[0.5614469,4.5334315e-7,0.43679205,0.00057863037,0.00084303546,0.000043214768,0.000032806285,0.000015856456,0.00024707353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987032,0.000121843994,0.00012927891,0.0005610932,0.00027341873,0.000211213],"domain_scores_gemma":[0.9989648,0.000024025587,0.00002956227,0.0007102578,0.00008837237,0.00018297737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043152893,0.00012215869,0.00011164923,0.00008790304,0.00016129695,0.00015607488,0.0003132061,0.000043004897,0.00006846145],"category_scores_gemma":[0.000019491661,0.00009184668,0.000019494171,0.0004092197,0.000026719877,0.00092414836,0.000045686123,0.00008754836,0.000029411072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026649852,0.0004956795,0.000028033308,0.0000019575948,0.0000060774682,9.160568e-7,0.00039412949,0.00067289657,0.0008838447,0.9942665,0.0009341521,0.00228913],"study_design_scores_gemma":[0.006918183,0.007886306,0.0034537902,0.000021728982,0.000047831556,0.0008498712,0.005753144,0.44898638,0.030447945,0.191513,0.3014019,0.0027199208],"about_ca_topic_score_codex":0.00007414521,"about_ca_topic_score_gemma":0.000008266626,"teacher_disagreement_score":0.8027535,"about_ca_system_score_codex":0.000026138652,"about_ca_system_score_gemma":0.000070435824,"threshold_uncertainty_score":0.3745399},"labels":[],"label_agreement":null},{"id":"W2099119688","doi":"10.1007/978-3-319-09698-8_4","title":"State Complexity of Deletion","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Regular language; Upper and lower bounds; State (computer science); Finite-state machine; Computer science; Deterministic finite automaton; Automaton; Matching (statistics); Time complexity; Computational complexity theory; Combinatorics; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics","score_opus":0.022515380925277356,"score_gpt":0.23972131822434914,"score_spread":0.21720593729907178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099119688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040704434,0.00018008128,0.99541,0.0003659483,0.0009923637,0.00020364854,0.0000070028,0.00014246139,0.0022914198],"genre_scores_gemma":[0.53011787,0.000035496185,0.46800688,0.0012375466,0.0002562846,0.000003893135,0.000007334379,0.00003286173,0.00030184028],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705654,0.00004885247,0.00054540933,0.0010453606,0.00082915777,0.0004746827],"domain_scores_gemma":[0.9974786,0.00034940397,0.00041420342,0.00141761,0.00022005616,0.00012011934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011667979,0.00038160544,0.0005557589,0.0005754874,0.00012886804,0.00019852226,0.0031296106,0.00017574806,0.00002539525],"category_scores_gemma":[0.0000537479,0.00034263884,0.00013052644,0.00039464902,0.0013556493,0.00029768187,0.0011590276,0.00045826135,0.00003914148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000420526,0.000017836137,0.000022056549,0.00005322695,0.0000073921237,0.0000159257,0.0003678365,0.007545054,0.00037648494,0.24187966,0.00002131272,0.74968904],"study_design_scores_gemma":[0.00014366987,0.00011675758,0.00018114538,0.00022602701,0.000003110192,0.00002554526,3.373434e-8,0.4027389,0.0029145714,0.5925473,0.00076447707,0.00033845508],"about_ca_topic_score_codex":0.000032248452,"about_ca_topic_score_gemma":0.00003940785,"teacher_disagreement_score":0.74935055,"about_ca_system_score_codex":0.00012962114,"about_ca_system_score_gemma":0.00023911108,"threshold_uncertainty_score":0.99990255},"labels":[],"label_agreement":null},{"id":"W2100901057","doi":"10.1109/ismvl.2011.36","title":"Maximal Centralizing Monoids and their Relation to Minimal Clones","year":2011,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Monoid; Unary operation; Mathematics; Set (abstract data type); Relation (database); Free monoid; Syntactic monoid; Combinatorics; Constant (computer programming); Element (criminal law); Discrete mathematics; Maximal element; Focus (optics); Pure mathematics; Algebra over a field; Computer science","score_opus":0.027630243592160087,"score_gpt":0.21098950346698908,"score_spread":0.18335925987482898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100901057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6847064,0.000061265055,0.30738622,0.00027151426,0.0001124527,0.000060743736,5.4546706e-7,0.00015710585,0.0072437623],"genre_scores_gemma":[0.925125,0.0000046216496,0.074338436,0.00034448673,0.000022722115,0.0000028897882,3.616471e-7,0.000003930966,0.00015756114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99946946,0.000021071404,0.00009764421,0.00019802433,0.00005171147,0.00016208713],"domain_scores_gemma":[0.99966675,0.000026217838,0.000020213824,0.00019703279,0.000013207283,0.0000766037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013717446,0.000074301235,0.0000680435,0.00004567632,0.000058671896,0.00005674559,0.0002279813,0.000029372217,0.00003785085],"category_scores_gemma":[0.000007817927,0.000054332966,0.000019364581,0.000103552105,0.000015303347,0.00035319052,0.0001574453,0.000035180314,0.00003698758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001935686,0.000052271487,0.008181174,0.00000754249,0.000012518243,0.000008110744,0.013671186,0.0000029743753,0.010636994,0.8418525,0.0007029123,0.12485245],"study_design_scores_gemma":[0.00059797155,0.0004246214,0.7188082,0.000049231767,0.000007850972,0.000085274405,0.0013918863,0.091232374,0.088644296,0.09270249,0.005312644,0.0007431675],"about_ca_topic_score_codex":0.000046439356,"about_ca_topic_score_gemma":0.0000029097848,"teacher_disagreement_score":0.74915004,"about_ca_system_score_codex":0.0000069611588,"about_ca_system_score_gemma":0.0000064971964,"threshold_uncertainty_score":0.2215634},"labels":[],"label_agreement":null},{"id":"W2101596584","doi":"10.1051/ita:2008006","title":"Least Periods of Factors of Infinite Words","year":2008,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Fibonacci number; Word (group theory); Mathematics; Mathematical proof; Set (abstract data type); Integer (computer science); Combinatorics; Product (mathematics); Factor (programming language); Infinite set; Discrete mathematics; Arithmetic; Computer science","score_opus":0.011671359484466765,"score_gpt":0.23001026543767186,"score_spread":0.2183389059532051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101596584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.295137,0.00005740681,0.69570106,0.00008084098,0.000016374144,0.0001583111,0.000022546476,0.00004628684,0.00878014],"genre_scores_gemma":[0.9758405,0.0000716287,0.023966188,0.00006181607,0.0000121370895,0.000018870476,0.0000058902096,0.0000042999463,0.000018635803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915725,0.000015400323,0.0004444275,0.000079556004,0.00016580829,0.00013758514],"domain_scores_gemma":[0.9990806,0.00019994301,0.00015803867,0.00041072606,0.00006247734,0.00008823881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015958666,0.00009953547,0.00019545273,0.00007619703,0.00010721512,0.000021377138,0.00039527274,0.000054317712,0.00003295302],"category_scores_gemma":[0.000023936256,0.00007727805,0.00005813694,0.00028251254,0.00082242873,0.00019080107,0.00017936357,0.000082905906,0.000006582413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015299154,0.000045326844,0.00039178843,0.000035304136,0.0000083326195,8.693307e-8,0.002465325,0.000017464807,0.00012805198,0.9907274,0.000023407727,0.006155956],"study_design_scores_gemma":[0.001148038,0.0003665215,0.014669688,0.00012993604,0.00005423957,0.0000984431,0.0036502548,0.32127962,0.014060367,0.62890786,0.014834069,0.0008009843],"about_ca_topic_score_codex":0.0000025523464,"about_ca_topic_score_gemma":1.0790886e-7,"teacher_disagreement_score":0.6807035,"about_ca_system_score_codex":0.0000051712072,"about_ca_system_score_gemma":0.000032755415,"threshold_uncertainty_score":0.31513074},"labels":[],"label_agreement":null},{"id":"W2101621888","doi":"10.1007/978-3-642-37064-9_28","title":"Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences","year":2013,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Sequence (biology); Factorization; Combinatorics; Mathematics; Generating function; Bounded function; Function (biology); Word (group theory); Discrete mathematics; Algorithm; Biology; Genetics; Geometry","score_opus":0.014585523774755393,"score_gpt":0.26000766732399133,"score_spread":0.24542214354923594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101621888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39650396,0.0011090748,0.5998612,0.0009877821,0.0009912312,0.00040759676,0.0000023237594,0.00012375313,0.000013068622],"genre_scores_gemma":[0.7215967,0.0001442557,0.27762303,0.0004616871,0.00011604093,0.000045163175,0.000001762372,0.00001040452,9.657242e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601173,0.00022864697,0.0005732523,0.0018002602,0.0006520484,0.00073403586],"domain_scores_gemma":[0.9976708,0.0007694998,0.00027226674,0.0009893104,0.00009750441,0.00020056035],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016175094,0.0005016444,0.00060650124,0.00081808347,0.00015828792,0.0016108435,0.002341794,0.00027416536,0.0000064771075],"category_scores_gemma":[0.00022908341,0.00038307824,0.00005428893,0.001395519,0.0009100753,0.000921573,0.004581937,0.0010518999,0.0000055154906],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002553947,0.00005277682,0.0021231677,0.00013290333,0.0000058044957,0.00004064589,0.008603122,0.0042908317,0.00014605942,0.00068250595,0.0000038026947,0.9839158],"study_design_scores_gemma":[0.00023574363,0.00011556705,0.019080516,0.0010024776,0.000003729142,0.000051807096,0.000005235683,0.89679897,0.00062134233,0.0816107,0.0000076478755,0.00046626673],"about_ca_topic_score_codex":0.00030692705,"about_ca_topic_score_gemma":0.000123639,"teacher_disagreement_score":0.9834496,"about_ca_system_score_codex":0.00020919387,"about_ca_system_score_gemma":0.00044052323,"threshold_uncertainty_score":0.99986213},"labels":[],"label_agreement":null},{"id":"W2102041446","doi":"10.1090/s0002-9939-08-09737-2","title":"Transcendence of power series for some number theoretic functions","year":2008,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Transcendence (philosophy); Series (stratigraphy); Power (physics); Power series; Mathematics; Philosophy; Mathematical analysis; Epistemology; Physics; Geology","score_opus":0.010890729639968401,"score_gpt":0.23246953181101346,"score_spread":0.22157880217104506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102041446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.910397,0.00003140502,0.08406566,0.0021409367,0.00007335289,0.00035465308,0.000013128126,0.00012328663,0.0028006076],"genre_scores_gemma":[0.9345819,0.000027637203,0.06477506,0.0002615498,0.000021450875,0.00003503119,1.3579795e-7,0.000012283358,0.00028498445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989288,0.0000066533908,0.0003044816,0.00021576096,0.00031024922,0.00023405295],"domain_scores_gemma":[0.99903667,0.0002075203,0.00032712615,0.00021757158,0.00015829944,0.000052832238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032120888,0.00013248951,0.00033645798,0.000011522363,0.00016408636,0.000019695004,0.0009167298,0.000028016268,0.000025855146],"category_scores_gemma":[0.00012368806,0.00008580271,0.00043546615,0.0003982527,0.0013358936,0.00038106253,0.00015101286,0.00009914243,0.000006677906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014414702,0.00015409844,0.00050950586,0.00021084445,0.000053148844,7.063781e-8,0.0045574047,0.0000013033928,0.011905301,0.97999376,0.002278499,0.00032163935],"study_design_scores_gemma":[0.00030158306,0.00023700263,0.002181167,0.00012446479,0.000050597973,0.00011331968,0.0030662331,0.004285827,0.045539435,0.9435998,0.00024113768,0.00025943524],"about_ca_topic_score_codex":0.0000022725947,"about_ca_topic_score_gemma":1.7199287e-8,"teacher_disagreement_score":0.036393974,"about_ca_system_score_codex":0.000018196004,"about_ca_system_score_gemma":0.000033391527,"threshold_uncertainty_score":0.49221557},"labels":[],"label_agreement":null},{"id":"W2104755092","doi":"10.1142/s0218196705002463","title":"UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS","year":2005,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Alphabet; Set (abstract data type); Word (group theory); Automaton; Discrete mathematics; Finite set; Set theory; Theoretical computer science; Computer science; Linguistics","score_opus":0.00804054867491937,"score_gpt":0.2612491853130127,"score_spread":0.25320863663809334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104755092","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7834022,0.0006353057,0.21315637,0.0020748011,0.00032142785,0.000037993075,0.000002026788,0.000013324857,0.0003565655],"genre_scores_gemma":[0.97266704,0.00010049889,0.026780827,0.00029513065,0.000114376184,5.4181214e-7,0.0000015484145,0.0000040880605,0.00003592642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990995,0.00003957025,0.00034482672,0.00010898733,0.00032228726,0.00008480687],"domain_scores_gemma":[0.9991453,0.00013543628,0.00031853165,0.000059163056,0.0002814719,0.000060041704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033986723,0.00007624152,0.00013590185,0.00017222602,0.000039196548,0.00012402365,0.00030732583,0.000032104745,0.000010929353],"category_scores_gemma":[0.000027654982,0.00006660946,0.000038085956,0.00010140096,0.000041984673,0.0007718568,0.00010476807,0.00008729187,0.0000022629342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008459593,0.00021651,0.0029920079,0.000024086141,0.0002036014,0.00004227752,0.002851692,0.0055633765,0.0038663666,0.11422587,0.0011261968,0.86880344],"study_design_scores_gemma":[0.0038010986,0.0007417074,0.050106257,0.00045391623,0.000049581413,0.00197856,0.0006197356,0.64577633,0.015958173,0.27456117,0.005487597,0.00046590788],"about_ca_topic_score_codex":0.000008963757,"about_ca_topic_score_gemma":0.0000024541366,"teacher_disagreement_score":0.8683375,"about_ca_system_score_codex":0.000028163819,"about_ca_system_score_gemma":0.000049132945,"threshold_uncertainty_score":0.27162546},"labels":[],"label_agreement":null},{"id":"W2105217716","doi":"10.1007/978-3-642-23211-4_10","title":"Approximate Bit Vectors for Fast Unification","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Manitoba","funders":"","keywords":"Unification; Bit (key); Computer science; Bit array; Algorithm; Parsing; Theoretical computer science; Artificial intelligence; Programming language; Type (biology)","score_opus":0.022249397841903044,"score_gpt":0.23346618057427146,"score_spread":0.2112167827323684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105217716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007194186,0.0002530465,0.993728,0.00028920185,0.0017354133,0.00057253754,0.000011113665,0.00028900997,0.003049765],"genre_scores_gemma":[0.16445123,0.000063209365,0.8317308,0.0015022692,0.00077531533,0.00006980541,0.000028078302,0.000090914495,0.0012883708],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691474,0.000023437171,0.000456065,0.0014574382,0.00052416534,0.0006241519],"domain_scores_gemma":[0.997404,0.00036045926,0.00032531327,0.001556231,0.00020988357,0.00014412857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094604905,0.00046942814,0.00043144275,0.000682576,0.0002569433,0.00042102166,0.0036467488,0.00028841966,0.00002113547],"category_scores_gemma":[0.00005837561,0.00041674997,0.00015244908,0.00044645098,0.0005091096,0.0005983316,0.000777385,0.00039310087,0.00004519123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005568899,0.000026552545,0.000009902774,0.0000520488,0.000008895804,0.000008807004,0.00079689553,0.0010824201,0.00047099823,0.29430977,0.000030816,0.70319736],"study_design_scores_gemma":[0.00022453719,0.00016147636,0.00011040318,0.0002248736,0.000009116317,0.000031670894,1.8288965e-7,0.3999041,0.0043185595,0.5916918,0.0026517268,0.0006715856],"about_ca_topic_score_codex":0.000014044179,"about_ca_topic_score_gemma":0.0000111838835,"teacher_disagreement_score":0.70252573,"about_ca_system_score_codex":0.00017446109,"about_ca_system_score_gemma":0.00029156086,"threshold_uncertainty_score":0.99982846},"labels":[],"label_agreement":null},{"id":"W2106154414","doi":"","title":"Nondeterministic Bimachines and Rational Relations with Finite Codomain","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nondeterministic algorithm; Mathematics; Rational function; Finite set; Discrete mathematics; Pure mathematics","score_opus":0.004265870775491289,"score_gpt":0.19047498247860684,"score_spread":0.18620911170311555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106154414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22149079,0.000043910673,0.7529937,0.0009885493,0.000104484,0.00023391619,0.000027748914,0.00021806288,0.023898847],"genre_scores_gemma":[0.9467951,0.0000016345871,0.051987782,0.00058000226,0.000035043347,0.000020716032,0.00003943763,0.0000052641362,0.0005350071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925065,0.000019153013,0.00025603172,0.00011459711,0.00019704513,0.00016251691],"domain_scores_gemma":[0.99933934,0.00025128026,0.000096132746,0.00023934027,0.000024175113,0.00004975518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015309514,0.00011056938,0.000103155464,0.00008996767,0.00020693093,0.00029573555,0.00021936836,0.00002666477,0.00006354435],"category_scores_gemma":[0.0000179917,0.000083518375,0.00001886275,0.00017013059,0.00009107975,0.00095791975,0.00010486841,0.00006916084,0.00011650598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018744095,0.00010185117,0.014153647,0.00005818313,0.00003118681,0.000015792615,0.0014468135,0.0009962101,0.0001720677,0.9690583,0.0052640815,0.008683139],"study_design_scores_gemma":[0.001547573,0.00029140565,0.06650646,0.000086815664,0.000024100615,0.00019582162,0.00021594572,0.84928495,0.0001914368,0.06132163,0.019828081,0.0005058026],"about_ca_topic_score_codex":0.000014226537,"about_ca_topic_score_gemma":0.000009301702,"teacher_disagreement_score":0.90773666,"about_ca_system_score_codex":0.000021670898,"about_ca_system_score_gemma":0.00003948146,"threshold_uncertainty_score":0.34057805},"labels":[],"label_agreement":null},{"id":"W2106865935","doi":"10.1007/978-3-642-22012-8_27","title":"Generic Expression Hardness Results for Primitive Positive Formula Comparison","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Trichotomy (philosophy); Equivalence (formal languages); Expression (computer science); Computer science; Containment (computer programming); Algorithm; Mathematics; Discrete mathematics; Programming language","score_opus":0.03159664891861386,"score_gpt":0.2631389996122832,"score_spread":0.23154235069366935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106865935","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014148305,0.00044289822,0.9904579,0.00023443103,0.0023927775,0.0008910766,0.00006768303,0.00023684248,0.0051349453],"genre_scores_gemma":[0.26636106,0.000041775496,0.7302884,0.0015637594,0.00072659337,0.000064144086,0.0000654549,0.000076085504,0.00081275165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955034,0.000053644333,0.0007806178,0.0020268108,0.0007822762,0.0008532459],"domain_scores_gemma":[0.9964338,0.0007736129,0.00061985897,0.001544104,0.0004103245,0.00021829116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010875422,0.0006754889,0.0007764956,0.0006503821,0.0004198884,0.0004518929,0.0037526377,0.00042338143,0.000007265726],"category_scores_gemma":[0.00012944454,0.0005770266,0.00023121583,0.00040415843,0.0005785592,0.00086545694,0.001624892,0.0006044929,0.000027550917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014891404,0.00013209318,0.00001444278,0.00007726561,0.000029658895,0.00006441492,0.005959451,0.0034827618,0.0022837385,0.07671693,0.00047474366,0.91061556],"study_design_scores_gemma":[0.0014465146,0.0008210384,0.00036094387,0.00148714,0.00002744912,0.000073511124,0.0000012744281,0.5377485,0.08714848,0.36525208,0.0039202566,0.0017128132],"about_ca_topic_score_codex":0.000017093884,"about_ca_topic_score_gemma":0.000015357347,"teacher_disagreement_score":0.90890276,"about_ca_system_score_codex":0.00028587776,"about_ca_system_score_gemma":0.00039570557,"threshold_uncertainty_score":0.9996681},"labels":[],"label_agreement":null},{"id":"W2106875872","doi":"10.1016/j.tcs.2012.10.055","title":"Quotient complexity of ideal languages","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ideal (ethics); Mathematics; Regular language; Concatenation (mathematics); Quotient; Discrete mathematics; Intersection (aeronautics); Generator (circuit theory); Combinatorics; Computer science; Theoretical computer science; Automaton","score_opus":0.020154317981563488,"score_gpt":0.2752687244087085,"score_spread":0.255114406427145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106875872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17338133,0.00010826214,0.8200517,0.00035208656,0.0005355542,0.000083656014,0.0000020961513,0.00016534512,0.0053199627],"genre_scores_gemma":[0.8462151,0.0000016572644,0.15330851,0.00033795479,0.00012612411,0.0000019461588,4.9640147e-7,0.000004553586,0.0000036511144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979595,0.00010867428,0.0002693826,0.0003573462,0.00065437134,0.00065074116],"domain_scores_gemma":[0.99848825,0.00019310837,0.000089087276,0.0008196132,0.00010594253,0.00030397833],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018520412,0.0001452273,0.00021641153,0.00014314048,0.00018943404,0.000110103676,0.0022351593,0.00003585509,0.0000701701],"category_scores_gemma":[0.000059956477,0.00011192818,0.00007127107,0.00079040916,0.004125306,0.0007969238,0.0012721347,0.00012330414,0.00007176956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002608973,0.00009671571,0.00032793824,0.000007382233,0.0000026313219,0.000001646009,0.0007420077,0.000013985659,0.001302712,0.98034334,0.00004830283,0.01711073],"study_design_scores_gemma":[0.0003918339,0.00030382499,0.03709153,0.00006062439,0.000009358866,0.000106219515,0.000075744945,0.38156492,0.054096926,0.52553254,0.0002441883,0.0005222572],"about_ca_topic_score_codex":0.0000081559965,"about_ca_topic_score_gemma":1.7512123e-7,"teacher_disagreement_score":0.6728338,"about_ca_system_score_codex":0.000034272947,"about_ca_system_score_gemma":0.00005270355,"threshold_uncertainty_score":0.99858487},"labels":[],"label_agreement":null},{"id":"W2107000858","doi":"10.1007/s00224-007-9049-y","title":"Incremental Branching Programs","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"McGill University","keywords":"Branching (polymer chemistry); Nondeterministic algorithm; Computation; Computer science; Exponential function; Mathematics; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.0161668605177624,"score_gpt":0.24632149893553537,"score_spread":0.23015463841777298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107000858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44522122,0.00024968834,0.54941255,0.000008242777,0.00064878195,0.00014963133,2.776744e-7,0.0002675007,0.0040421262],"genre_scores_gemma":[0.9913541,6.087948e-7,0.00832228,0.00005392043,0.00019480291,0.0000010953229,0.0000013565681,0.000012805017,0.000059004695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828196,0.00022621137,0.00050515763,0.00027396777,0.0003326663,0.00038006756],"domain_scores_gemma":[0.9986639,0.0004161691,0.00028364765,0.00050068623,0.000056602166,0.000079000434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058563943,0.00014759315,0.0002661666,0.0001250242,0.00013462422,0.00011043805,0.0009376023,0.000053797885,0.000002781981],"category_scores_gemma":[0.00002981814,0.00013149828,0.00008309248,0.000301298,0.0000834101,0.00020334321,0.00027428978,0.00011877393,0.00001951748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011805546,0.000069330265,0.00088821753,0.00008340345,0.000031202744,0.000011385925,0.002548819,0.00014237683,0.0049103354,0.8191488,0.0000318494,0.17212252],"study_design_scores_gemma":[0.0062596677,0.0018574917,0.04637728,0.0059200088,0.00010316494,0.001558831,0.013452378,0.57751554,0.0842743,0.25320756,0.005634184,0.0038395943],"about_ca_topic_score_codex":0.000035036202,"about_ca_topic_score_gemma":8.5301593e-7,"teacher_disagreement_score":0.57737315,"about_ca_system_score_codex":0.000038392816,"about_ca_system_score_gemma":0.000021157828,"threshold_uncertainty_score":0.5362344},"labels":[],"label_agreement":null},{"id":"W2107552967","doi":"10.1016/j.tcs.2011.12.028","title":"State complexity of union and intersection of star on regular languages","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Intersection (aeronautics); Regular language; State (computer science); Star (game theory); Component (thermodynamics); Mathematics; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automaton","score_opus":0.02220350129067516,"score_gpt":0.24425759313541612,"score_spread":0.22205409184474095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107552967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52583677,0.000010589778,0.47277483,0.000047028887,0.000099545745,0.00005107714,0.0000018185957,0.0000415251,0.0011368248],"genre_scores_gemma":[0.9253359,0.0000029028768,0.07457474,0.000068527086,0.000011187392,7.1515956e-7,2.6937528e-7,0.000003296515,0.0000024939031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878514,0.00012891128,0.00021715609,0.00033935427,0.00032356713,0.00020588186],"domain_scores_gemma":[0.9990951,0.00009630438,0.0001033623,0.000512801,0.0001010703,0.00009139671],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012233792,0.00010142826,0.00017526142,0.00016154858,0.00007637047,0.000032951717,0.0008958162,0.00002350872,0.000019383451],"category_scores_gemma":[0.000029452747,0.000078826066,0.00003259275,0.0004299714,0.0037365814,0.000298262,0.0005342745,0.000083018414,0.0000030972246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016100597,0.00006184958,0.000053607677,0.000013601643,0.0000031832417,0.00000266171,0.001825299,0.0000055437326,0.0034765734,0.96755576,0.0000034695438,0.026982378],"study_design_scores_gemma":[0.00020094575,0.00080720615,0.0134948,0.00008299405,0.0000033425058,0.00001609428,0.00006483164,0.15425365,0.16333136,0.6676072,0.000003953664,0.00013363552],"about_ca_topic_score_codex":0.00002834286,"about_ca_topic_score_gemma":9.991927e-7,"teacher_disagreement_score":0.39949912,"about_ca_system_score_codex":0.000017153909,"about_ca_system_score_gemma":0.000027759335,"threshold_uncertainty_score":0.9989747},"labels":[],"label_agreement":null},{"id":"W2107671423","doi":"10.1515/integers-2012-0006","title":"Approximations of Additive Squares in Infinite Words","year":2012,"lang":"en","type":"article","venue":"Integers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Word (group theory); Least-squares function approximation; Algebra over a field; Applied mathematics; Pure mathematics; Statistics; Geometry","score_opus":0.013048876581785144,"score_gpt":0.2491160081136246,"score_spread":0.23606713153183947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107671423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.529211,0.0005591427,0.41861638,0.0008198252,0.0008139549,0.00023564309,0.000027021188,0.0002038213,0.04951324],"genre_scores_gemma":[0.99230796,0.0000043420405,0.007487821,0.0001009818,0.00002689691,0.000013156106,0.0000018571519,0.0000032677601,0.00005371783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99947345,0.00004157501,0.00013023675,0.00008816469,0.00010001691,0.00016657525],"domain_scores_gemma":[0.99948716,0.0001789882,0.000056099245,0.00021467126,0.000023971053,0.000039097024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023541527,0.000058028676,0.00008968049,0.00013433144,0.000015822048,0.000015949767,0.0003078535,0.000029525487,0.000042345848],"category_scores_gemma":[0.00007975861,0.000050856605,0.000033946824,0.0003230093,0.000047344027,0.00047234303,0.000078018216,0.00007755665,0.00004017757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071778677,0.00020375458,0.0055444175,0.000019483854,0.000019289748,0.0000031063557,0.019697927,0.00007450692,0.0011821457,0.8416662,0.0027395755,0.12884237],"study_design_scores_gemma":[0.003721523,0.0006251911,0.24544868,0.0015000543,0.000046447265,0.00009038827,0.025717305,0.22264832,0.20074412,0.19552207,0.10126046,0.0026754302],"about_ca_topic_score_codex":0.000035721947,"about_ca_topic_score_gemma":0.0000057119937,"teacher_disagreement_score":0.64614415,"about_ca_system_score_codex":0.000022093507,"about_ca_system_score_gemma":0.000019192168,"threshold_uncertainty_score":0.20738722},"labels":[],"label_agreement":null},{"id":"W2108918469","doi":"10.1016/j.jcta.2003.12.005","title":"A class of prototiles with doubly generated level semigroups","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Class (philosophy); Mathematics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.013825378483179678,"score_gpt":0.2232447927371347,"score_spread":0.20941941425395502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108918469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8790151,0.00034284525,0.11540579,0.0007660658,0.0031063952,0.0004464345,0.00000896656,0.000092851595,0.0008155599],"genre_scores_gemma":[0.98233324,0.000025430503,0.017091408,0.00009284453,0.0003493188,0.000009371458,8.080514e-7,0.000021050746,0.000076496544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807656,0.00021018283,0.0006623954,0.00019625085,0.0005742189,0.00028040577],"domain_scores_gemma":[0.99787366,0.00014063247,0.0008391932,0.00044617156,0.0005597594,0.00014057037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013061448,0.00022876852,0.00051140215,0.00018050367,0.000108266846,0.0001332601,0.0011263456,0.000105294836,0.000019406189],"category_scores_gemma":[0.000102959326,0.00015917057,0.00015347653,0.0005255757,0.00022049388,0.0012430827,0.0001464427,0.00029442308,0.0000028456534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010631215,0.00025664203,0.00005523262,0.00003167551,0.00012264453,0.00010220055,0.0011091442,0.00055880955,0.008626031,0.98637223,0.000104149454,0.0015981207],"study_design_scores_gemma":[0.0050584394,0.0030334927,0.0003809521,0.00031417958,0.00004007936,0.0008325269,0.00037810212,0.000046963534,0.13329326,0.85269177,0.0036200597,0.0003101639],"about_ca_topic_score_codex":0.000008576454,"about_ca_topic_score_gemma":0.0000018865456,"teacher_disagreement_score":0.13368043,"about_ca_system_score_codex":0.000081479775,"about_ca_system_score_gemma":0.00045062165,"threshold_uncertainty_score":0.6490787},"labels":[],"label_agreement":null},{"id":"W2109036808","doi":"10.1016/j.tcs.2008.12.054","title":"State complexity of basic operations on suffix-free regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Catenation; Regular language; Suffix; Deterministic finite automaton; State (computer science); Abstract family of languages; Regular expression; Computer science; Nondeterministic finite automaton; Automaton; Cone (formal languages); Finite-state machine; Combined operations; Deterministic automaton; Pumping lemma for regular languages; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Programming language; Automata theory; Second-generation programming language; Fifth-generation programming language; Linguistics","score_opus":0.015094532963450848,"score_gpt":0.26196869014037016,"score_spread":0.24687415717691932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109036808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21224388,0.000029202385,0.78084654,0.0031267458,0.00018548107,0.00013896334,0.000007851463,0.00021863081,0.0032027215],"genre_scores_gemma":[0.8748524,0.0000030514652,0.12369119,0.0013780418,0.000053645643,0.000001622272,0.0000011767567,0.0000043989626,0.000014431224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977987,0.00013648967,0.0003029054,0.0005939807,0.0007103673,0.00045759496],"domain_scores_gemma":[0.99776995,0.00016549052,0.000056842262,0.0016528036,0.00015882416,0.00019611421],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012540601,0.00017882632,0.00024544107,0.00019091579,0.00030322635,0.00027039973,0.003610773,0.000033914013,0.000039111226],"category_scores_gemma":[0.000120212346,0.00014031833,0.00007313582,0.00094403944,0.0027871525,0.0005152381,0.0006524608,0.0001616464,0.00003857333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067561286,0.000120865625,0.0000052124806,0.000003033605,0.0000022256963,0.000010016334,0.00040360805,0.00056814856,0.0031754223,0.965611,0.00009160969,0.030002149],"study_design_scores_gemma":[0.0002494635,0.0005065933,0.003124386,0.000037278718,0.0000024463316,0.00001700142,0.000009239863,0.34577355,0.035135075,0.61494064,0.000022589273,0.00018173546],"about_ca_topic_score_codex":0.0000063524767,"about_ca_topic_score_gemma":9.94709e-7,"teacher_disagreement_score":0.66260856,"about_ca_system_score_codex":0.00003704624,"about_ca_system_score_gemma":0.00009048989,"threshold_uncertainty_score":0.9999267},"labels":[],"label_agreement":null},{"id":"W2109787457","doi":"10.3233/fi-2009-0008","title":"Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Prefix; Computer science; Regular language; State (computer science); Theoretical computer science; Programming language; Arithmetic; Mathematics; Automaton; Linguistics","score_opus":0.028182085055141262,"score_gpt":0.28112743774300314,"score_spread":0.2529453526878619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109787457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26177803,0.00006835662,0.7284241,0.0017201325,0.00020176765,0.00089373236,0.00027518478,0.00027394952,0.006364768],"genre_scores_gemma":[0.86801946,0.000004728909,0.13016099,0.0013993838,0.000027547076,0.000031364074,0.000045372373,0.0000060008865,0.0003051525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890965,0.000024628298,0.00045848754,0.00013629351,0.00022079224,0.00025016148],"domain_scores_gemma":[0.99879795,0.00009415905,0.00011621604,0.0008507189,0.00006572893,0.00007522966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002980712,0.00013145606,0.00021339866,0.00009159611,0.0001336529,0.00016893072,0.000989921,0.000030431618,0.000039130085],"category_scores_gemma":[0.000085179454,0.00011390911,0.000077660756,0.00015370858,0.00010514044,0.00082296523,0.00017296155,0.00005874732,0.00002665941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034755252,0.0002726824,0.00006462984,0.00026048825,0.00005773559,0.0000041361436,0.008692528,0.00038853305,0.0033821922,0.9101135,0.0075992364,0.06912958],"study_design_scores_gemma":[0.0037277106,0.0019318806,0.0092970515,0.00026358294,0.000055951,0.000058450565,0.0016751713,0.68123025,0.030654136,0.2614016,0.008819663,0.0008845738],"about_ca_topic_score_codex":0.000008405586,"about_ca_topic_score_gemma":0.0000061830697,"teacher_disagreement_score":0.6808417,"about_ca_system_score_codex":0.000032679545,"about_ca_system_score_gemma":0.00005255685,"threshold_uncertainty_score":0.46450785},"labels":[],"label_agreement":null},{"id":"W2109887555","doi":"10.1017/s0004972714000197","title":"THE MINIMAL GROWTH OF A -REGULAR SEQUENCE","year":2014,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Multiplicative function; Sequence (biology); Combinatorics; Constant (computer programming); Discrete mathematics; Mathematical analysis","score_opus":0.018353452857412137,"score_gpt":0.2389289914033845,"score_spread":0.22057553854597237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109887555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45524064,0.00015574878,0.31303254,0.21644843,0.0008112327,0.0014997979,0.000031284784,0.00043753395,0.012342798],"genre_scores_gemma":[0.9248968,0.0000056168637,0.07172911,0.00039786834,0.000046810394,0.000011205797,2.5565538e-7,0.00001119879,0.0029011697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854475,0.00015392339,0.00039975482,0.00020112218,0.0004196642,0.00028078165],"domain_scores_gemma":[0.9979848,0.00072305236,0.00025133722,0.00089953135,0.00007987423,0.0000613864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013597213,0.00013516916,0.00023426802,0.0000061037254,0.00017087664,0.000053358814,0.0021319748,0.00007974518,0.000088720386],"category_scores_gemma":[0.000344072,0.00007036151,0.00039406048,0.0001674763,0.00060789724,0.00003115106,0.00043597302,0.00014720086,0.000051832496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027147883,0.00007587012,0.000068649264,0.0001578134,0.000040560426,2.0207403e-7,0.00060242333,0.000004511645,0.0041306415,0.9462682,0.047544304,0.0011040982],"study_design_scores_gemma":[0.0005695926,0.0001599373,0.0027052253,0.00038894816,0.000060250677,0.000042210166,0.0004592869,0.013265565,0.07727116,0.86332315,0.041373067,0.00038157892],"about_ca_topic_score_codex":0.000013886089,"about_ca_topic_score_gemma":1.2204728e-7,"teacher_disagreement_score":0.46965614,"about_ca_system_score_codex":0.000016153215,"about_ca_system_score_gemma":0.000019406083,"threshold_uncertainty_score":0.3961775},"labels":[],"label_agreement":null},{"id":"W2111476730","doi":"10.1142/s0129054113400248","title":"GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–2012","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Generosity; Diligence; Wife; Computer science; Friendship; Sociology; Conversation; Law; Psychology; Political science; Social science","score_opus":0.012607172487750945,"score_gpt":0.2786848954411714,"score_spread":0.26607772295342047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111476730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105798475,0.000036051926,0.86537033,0.024805004,0.003401745,0.00016502517,0.0000017854986,0.00002514369,0.00039645558],"genre_scores_gemma":[0.8893818,0.0000052980704,0.109156236,0.0009815142,0.00039347177,0.0000058019264,6.5193404e-7,0.000004498156,0.000070684604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976406,0.0000651265,0.0005756701,0.00022542,0.0012640285,0.00022915791],"domain_scores_gemma":[0.99675554,0.00022170806,0.00043986048,0.0004656947,0.0019713414,0.00014588445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012458016,0.00011344714,0.00015416171,0.0005300515,0.0001964085,0.0008548025,0.004954802,0.000024084125,0.00006766598],"category_scores_gemma":[0.00014198545,0.00007769434,0.000103843755,0.0008538635,0.00025566563,0.0034136088,0.00063453434,0.00014505313,0.00009364136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001437798,0.00046581536,0.0014559445,0.000008975588,0.00014483163,0.000015067813,0.0042783227,0.01025487,0.015353031,0.23193581,0.020319412,0.71575356],"study_design_scores_gemma":[0.0012627128,0.00073106814,0.13806185,0.00037338134,0.000023588807,0.0010079728,0.00016271423,0.7309295,0.014135838,0.053874105,0.058832157,0.0006050981],"about_ca_topic_score_codex":0.000031065356,"about_ca_topic_score_gemma":0.0000045911943,"teacher_disagreement_score":0.78358334,"about_ca_system_score_codex":0.0000897804,"about_ca_system_score_gemma":0.00036839012,"threshold_uncertainty_score":0.9207337},"labels":[],"label_agreement":null},{"id":"W2112448133","doi":"10.1007/978-3-642-38771-5_14","title":"Extremal Words in the Shift Orbit Closure of a Morphic Sequence","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Lexicographical order; Morphism; Word (group theory); Closure (psychology); Combinatorics; Alphabet; Mathematics; Sequence (biology); Omega; Orbit (dynamics); Binary number; Simple (philosophy); Arithmetic; Discrete mathematics; Physics; Geometry; Linguistics; Quantum mechanics; Philosophy","score_opus":0.023976390785037844,"score_gpt":0.24207488351782636,"score_spread":0.2180984927327885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112448133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004635906,0.00083294447,0.9882907,0.0013471091,0.00089205516,0.00065021584,0.000006888915,0.00009571233,0.0032484676],"genre_scores_gemma":[0.90092164,0.000034883447,0.0967811,0.0017825954,0.00026667432,0.000032285683,0.0000026722444,0.000026779633,0.0001513697],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586374,0.00011543908,0.000705995,0.0013173507,0.0012820772,0.000715411],"domain_scores_gemma":[0.9963454,0.0009189973,0.00039532926,0.0021105339,0.00012911738,0.00010060078],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001953088,0.00053716305,0.0006222842,0.00074334315,0.00014034685,0.00045299172,0.007165935,0.0003391394,0.00007667213],"category_scores_gemma":[0.00009474458,0.0003759933,0.00016912253,0.0011135634,0.0011105295,0.00075425685,0.0012418175,0.0010777031,0.000054546028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011247297,0.00012151209,0.0008752762,0.00015723122,0.00002009706,0.00047347986,0.008673324,0.014690912,0.00056640495,0.33359233,0.000083890765,0.6407343],"study_design_scores_gemma":[0.00032980726,0.00022107162,0.002029906,0.0009400191,0.000008980963,0.00019016609,0.0000015818669,0.3465902,0.00059649674,0.6476688,0.0006262303,0.00079676404],"about_ca_topic_score_codex":0.00012178452,"about_ca_topic_score_gemma":0.00011826729,"teacher_disagreement_score":0.8962857,"about_ca_system_score_codex":0.00014060257,"about_ca_system_score_gemma":0.00048141202,"threshold_uncertainty_score":0.9998692},"labels":[],"label_agreement":null},{"id":"W2114449751","doi":"10.1112/jlms/jdn083","title":"Rational codes and free profinite monoids","year":2009,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Profinite group; Closure (psychology); Finitely-generated abelian group; Free product; Pure mathematics; Discrete mathematics; Group (periodic table); Law; Physics; Political science","score_opus":0.010372184524660271,"score_gpt":0.23310519290175175,"score_spread":0.22273300837709148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114449751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29517236,0.000589907,0.66978294,0.03297111,0.00022423214,0.00017170305,0.000003092644,0.000049712722,0.0010349381],"genre_scores_gemma":[0.71989036,0.00006341329,0.27607775,0.0033859455,0.00023101989,0.0000014388146,1.547848e-7,0.000006925932,0.0003429807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901867,0.000060237286,0.0003200289,0.000090159825,0.00037402558,0.00013686458],"domain_scores_gemma":[0.99907064,0.00024658893,0.00022571496,0.00030786864,0.0000750907,0.000074084666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276122,0.00008984962,0.00018766541,0.000013441969,0.00012610172,0.00013755361,0.0008712219,0.000052887473,0.000014780359],"category_scores_gemma":[0.00016359116,0.000048758597,0.00023085506,0.0001333117,0.00007527513,0.00030524982,0.00017064206,0.00021828843,0.000004116635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010348999,0.00023315007,0.00019738899,0.000044979515,0.00006770181,0.00000579101,0.002222072,0.00004400923,0.0065474003,0.95978075,0.020693699,0.010152728],"study_design_scores_gemma":[0.0004438992,0.00009131291,0.003481108,0.000073719086,0.000017016228,0.00019632292,0.000060298342,0.035693068,0.0019365578,0.9575313,0.0003912229,0.00008418423],"about_ca_topic_score_codex":1.9132943e-7,"about_ca_topic_score_gemma":5.098929e-8,"teacher_disagreement_score":0.42471802,"about_ca_system_score_codex":0.000023863158,"about_ca_system_score_gemma":0.00003969957,"threshold_uncertainty_score":0.1988318},"labels":[],"label_agreement":null},{"id":"W2114920334","doi":"10.46298/dmtcs.282","title":"Sums of Digits, Overlaps, and Palindromes","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Palindrome; Combinatorics; Word (group theory); Base (topology); Symbol (formal); Arithmetic; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.007898847532994717,"score_gpt":0.23463548952621338,"score_spread":0.22673664199321866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114920334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26000607,0.0001025901,0.73013103,0.00037702103,0.00013361788,0.00017693588,0.000006767503,0.00016404022,0.008901941],"genre_scores_gemma":[0.80170757,0.000028777202,0.19802648,0.00016254438,0.000029759036,0.0000037707878,8.4899904e-7,0.0000098005985,0.00003045569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976628,0.000056183973,0.00045622344,0.0006034436,0.0007227789,0.0004985996],"domain_scores_gemma":[0.9981664,0.00038678973,0.00010941001,0.0010047627,0.00008560355,0.00024706],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011425534,0.00023296359,0.0003692225,0.0001328452,0.00022883326,0.00046199097,0.0019945893,0.000057410245,0.00017934963],"category_scores_gemma":[0.00006309705,0.00017375617,0.000085894346,0.00072320015,0.0027163725,0.00071611203,0.00072542997,0.00013298706,0.000040616593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024527867,0.000047753743,0.00002830031,0.000037949983,0.000006621374,0.000006377419,0.0010754956,0.00001111296,0.0004270931,0.95479304,0.000018720977,0.04354508],"study_design_scores_gemma":[0.00017613964,0.00012747783,0.00033180875,0.000098482706,0.000007667528,0.00007165282,0.000028842296,0.4661273,0.0030961582,0.5296078,0.000096030286,0.00023068296],"about_ca_topic_score_codex":0.000002284074,"about_ca_topic_score_gemma":1.6075333e-7,"teacher_disagreement_score":0.5417015,"about_ca_system_score_codex":0.000014252177,"about_ca_system_score_gemma":0.000057423033,"threshold_uncertainty_score":0.9999977},"labels":[],"label_agreement":null},{"id":"W2115974696","doi":"","title":"A GENERALIZATION OF COBHAM'S THEOREM FOR REGULAR SEQUENCES","year":2005,"lang":"en","type":"article","venue":"Séminaire Lotharingien de Combinatoire [electronic only]","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Sequence (biology); Generalization; Mathematics; Combinatorics; Discrete mathematics; State (computer science); Algorithm; Mathematical analysis","score_opus":0.006126340661898675,"score_gpt":0.2345454554971801,"score_spread":0.2284191148352814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115974696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5533764,0.0028683478,0.43845212,0.0024067387,0.00022711857,0.00064455235,0.0000073999654,0.00052845705,0.0014888943],"genre_scores_gemma":[0.9870228,0.00009588815,0.011536484,0.0002959533,0.00008089343,0.00006462124,0.000014979609,0.000037902064,0.0008504365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766916,0.00011147726,0.0004277694,0.00058061886,0.0003145674,0.000896414],"domain_scores_gemma":[0.99848074,0.0001467475,0.0002703247,0.0008366557,0.0001547983,0.000110712426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009189739,0.00027796245,0.00036213608,0.00018819504,0.00022088287,0.00011454768,0.0015305924,0.00014984126,0.000018875508],"category_scores_gemma":[0.00008967946,0.00027170876,0.00019561005,0.000514254,0.00015855166,0.000626519,0.00023126241,0.00018116992,0.000010172831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016853524,0.00014642064,0.00045770544,0.00005589053,0.000038424532,0.0000030809347,0.0005822118,0.0003260702,0.0028319454,0.91253245,0.00042587414,0.082583055],"study_design_scores_gemma":[0.0016344709,0.00077665923,0.0011552605,0.00016580819,0.000049274964,0.00018670021,0.00009247173,0.23541902,0.104122825,0.64022845,0.015500086,0.0006689949],"about_ca_topic_score_codex":0.000041176525,"about_ca_topic_score_gemma":0.000050943585,"teacher_disagreement_score":0.4336465,"about_ca_system_score_codex":0.0003941915,"about_ca_system_score_gemma":0.000613554,"threshold_uncertainty_score":0.99997354},"labels":[],"label_agreement":null},{"id":"W2117110932","doi":"10.1016/j.jalgebra.2007.06.039","title":"Function fields in positive characteristic: Expansions and Cobham's theorem","year":2008,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Generalization; Extension (predicate logic); Rational function; Pure mathematics; Function (biology); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.00895996210807634,"score_gpt":0.20858952057490174,"score_spread":0.1996295584668254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117110932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93510795,0.00023504964,0.06306696,0.00087452587,0.00036107717,0.00003093474,6.108498e-7,0.000016840326,0.00030604613],"genre_scores_gemma":[0.9971725,0.00013300752,0.0019796921,0.00057846267,0.0000969963,5.292688e-7,3.3504685e-7,0.0000033954293,0.000035123554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993763,0.00006123973,0.00022583867,0.00009267177,0.00013538684,0.00010858789],"domain_scores_gemma":[0.99947953,0.00013853064,0.00014367088,0.00011677274,0.00005850238,0.00006297326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027444,0.00006630296,0.00014088496,0.000119617784,0.00006559992,0.000035082994,0.00018904767,0.000044866596,0.000019195195],"category_scores_gemma":[0.000043250755,0.000050758517,0.000041181494,0.00013105886,0.000041393443,0.0004682202,0.00005879565,0.00017932846,0.0000046205673],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005910065,0.0009313765,0.026394587,0.00004611068,0.00022129777,0.0037497184,0.028892385,0.00006775008,0.025155285,0.6634148,0.009636877,0.24089885],"study_design_scores_gemma":[0.0012615256,0.0008937871,0.87247896,0.00018853917,0.0000184375,0.0033546994,0.00031727497,0.0063427226,0.0027583856,0.111498654,0.00062419917,0.00026282296],"about_ca_topic_score_codex":0.0000049505725,"about_ca_topic_score_gemma":0.0000015488429,"teacher_disagreement_score":0.84608436,"about_ca_system_score_codex":0.000016148895,"about_ca_system_score_gemma":0.000041179275,"threshold_uncertainty_score":0.20698722},"labels":[],"label_agreement":null},{"id":"W2117973853","doi":"10.37236/951","title":"A Characterization of Balanced Episturmian Sequences","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Aperiodic graph; Alphabet; Generalization; Mathematics; Conjecture; Combinatorics; Characterization (materials science); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.005130220948648043,"score_gpt":0.22026096969268613,"score_spread":0.2151307487440381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117973853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5950762,0.0004479365,0.4033513,0.0004907775,0.00035489057,0.000041279574,2.0659327e-7,0.000013169275,0.00022423729],"genre_scores_gemma":[0.9994723,0.00023333513,0.00007142794,0.000091926835,0.00006166884,3.321599e-7,3.776327e-7,0.0000051568127,0.00006342582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877644,0.00007811707,0.0004000563,0.00007549116,0.0003389647,0.00033093974],"domain_scores_gemma":[0.99877125,0.0001484537,0.000600258,0.00024943496,0.0001871946,0.00004341269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023115997,0.00008392768,0.00018340393,0.00009643068,0.0000667537,0.00003122505,0.0010618553,0.000037933263,0.0000028548227],"category_scores_gemma":[0.000045629396,0.000054356085,0.000075684846,0.0005038321,0.000051217656,0.00031317928,0.00005526996,0.0002804298,0.0000017447236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015635764,0.00003951416,0.00017687386,0.0000053943595,0.000024517934,0.000006093691,0.0004751417,0.00000388697,0.061669998,0.9341195,0.000011089827,0.0034523443],"study_design_scores_gemma":[0.00054088567,0.00058083894,0.006512554,0.000043933553,0.000017995118,0.00027250915,0.000093777904,0.0007464217,0.12269132,0.8670471,0.0013288668,0.00012380118],"about_ca_topic_score_codex":0.0000027279082,"about_ca_topic_score_gemma":0.0000012514643,"teacher_disagreement_score":0.40439615,"about_ca_system_score_codex":0.000117973934,"about_ca_system_score_gemma":0.00023338011,"threshold_uncertainty_score":0.22165768},"labels":[],"label_agreement":null},{"id":"W2117977979","doi":"10.1007/s10231-006-0008-z","title":"Sturmian morphisms, the braid group B 4, Christoffel words and bases of F 2","year":2006,"lang":"en","type":"article","venue":"Annali di Matematica Pura ed Applicata (1923 -)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Morphism; Basis (linear algebra); Free group; Group (periodic table); Rank (graph theory); Braid group; Monoid; Free monoid; Automorphism; Combinatorics; Pure mathematics; Abelian group; Christoffel symbols; Algebra over a field","score_opus":0.00701646514828947,"score_gpt":0.2142175822928445,"score_spread":0.20720111714455502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117977979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58396745,0.006277704,0.37637427,0.017266793,0.00051006733,0.0031137336,0.00026514076,0.0012117,0.011013118],"genre_scores_gemma":[0.9939737,0.00007118728,0.0046897223,0.00065424445,0.00014154156,0.00018142807,0.000034297078,0.000028922239,0.00022496536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977551,0.00012854637,0.0006469792,0.0005549403,0.00047280188,0.00044160508],"domain_scores_gemma":[0.99754286,0.0004180802,0.00034258445,0.0015300512,0.00005721727,0.00010922683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007983508,0.00030588175,0.00046130965,0.000091391805,0.00024638063,0.00026470528,0.0016162017,0.00009294376,0.000052664076],"category_scores_gemma":[0.000033475582,0.00020484216,0.000108601365,0.00047566474,0.0003373847,0.00041272855,0.00057133794,0.00016751773,0.00008203082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018510218,0.00037799147,0.0005685023,0.00057782617,0.00007294759,0.00001565048,0.00046575832,0.000012335447,0.014584815,0.9303749,0.045643166,0.0072875675],"study_design_scores_gemma":[0.0034812083,0.0006425505,0.063030474,0.00135092,0.00036022536,0.00067509525,0.0015625805,0.06858402,0.06481308,0.629774,0.16232823,0.0033976277],"about_ca_topic_score_codex":0.00023750092,"about_ca_topic_score_gemma":0.000014858935,"teacher_disagreement_score":0.41000623,"about_ca_system_score_codex":0.000016168435,"about_ca_system_score_gemma":0.000024243629,"threshold_uncertainty_score":0.8353221},"labels":[],"label_agreement":null},{"id":"W2118432320","doi":"10.1080/17459730902819566","title":"Structural properties of Euclidean rhythms","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics and Music","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Euclidean geometry; Euclidean distance; Rhythm; Euclidean algorithm; Euclidean distance matrix; Mathematics; Euclidean group; Combinatorics; Non-Euclidean geometry; Algorithm; Pure mathematics; Geometry; Affine space; Physics","score_opus":0.028429372577182182,"score_gpt":0.22218797355503817,"score_spread":0.193758600977856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118432320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98899317,0.0006312588,0.0097085545,0.00031075758,0.00011486011,0.000032607422,4.6574453e-7,0.000008173476,0.00020016589],"genre_scores_gemma":[0.9670337,0.00002087716,0.03272572,0.00015083385,0.000052859974,9.271305e-8,2.6379727e-8,0.0000019437657,0.00001398225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993602,0.000011056591,0.0003255706,0.00005087397,0.00016884404,0.00008345038],"domain_scores_gemma":[0.9993905,0.000025945666,0.0003242585,0.0001384211,0.000077140925,0.000043769443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030724367,0.000064682914,0.00019574494,0.000064362386,0.000030031813,0.000050484647,0.00023480823,0.000020615595,0.000005724735],"category_scores_gemma":[0.000035151825,0.00003934545,0.00005532431,0.00006981091,0.00002765286,0.00022228829,0.0000385688,0.000067471985,7.928182e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020955928,0.00030698968,0.00006967168,0.0004557525,0.00010650086,0.00007682017,0.023330383,0.0000813678,0.15681507,0.5913198,0.0015432155,0.22587346],"study_design_scores_gemma":[0.0022282382,0.0019519054,0.0044421162,0.0019813334,0.00011205059,0.0048129894,0.0023802195,0.123177595,0.08872818,0.76832026,0.0011790197,0.00068607985],"about_ca_topic_score_codex":7.6828326e-7,"about_ca_topic_score_gemma":2.0225932e-7,"teacher_disagreement_score":0.22518738,"about_ca_system_score_codex":0.00000486034,"about_ca_system_score_gemma":0.000020626976,"threshold_uncertainty_score":0.16044608},"labels":[],"label_agreement":null},{"id":"W2118804107","doi":"10.1002/rsa.20095","title":"The Boolean functions computed by random Boolean formulas or how to grow the right function","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","funders":"","keywords":"Boolean function; Probabilistic logic; Monotone polygon; Function (biology); Mathematics; Discrete mathematics; Convergence (economics); Combinatorics; Computer science; Theoretical computer science; Statistics","score_opus":0.005735867594603812,"score_gpt":0.21022642284365153,"score_spread":0.20449055524904772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118804107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009840072,0.0025516252,0.96869767,0.01591392,0.0014298195,0.00086176937,0.000047412363,0.00028207627,0.00037561305],"genre_scores_gemma":[0.9787627,0.0002481798,0.009639323,0.00428581,0.0017576681,0.00010777926,0.00004129086,0.00004553047,0.00511173],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99813384,0.00018212212,0.00030317943,0.0004985362,0.0003861628,0.00049616146],"domain_scores_gemma":[0.99817,0.0007650291,0.00013535113,0.0006633154,0.000075148106,0.00019115137],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00064860366,0.00031471156,0.00032665225,0.00006644808,0.0017006682,0.0010634427,0.0008283405,0.000090411486,0.000042007407],"category_scores_gemma":[0.00006372493,0.0001421723,0.00015085615,0.000356632,0.00014362313,0.0004595741,0.000244015,0.00027158883,0.000013406158],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010096064,0.00003322105,0.000012493202,0.000010185353,0.00017316944,0.0000063067237,0.0006313059,0.0004731664,0.00057826546,0.023946762,0.11492398,0.85820156],"study_design_scores_gemma":[0.011445871,0.000276114,0.0010959811,0.000024730727,0.000073592084,0.00015261091,0.00026064058,0.1873209,0.0010781301,0.012892882,0.784905,0.00047352168],"about_ca_topic_score_codex":0.00002649121,"about_ca_topic_score_gemma":0.00006509832,"teacher_disagreement_score":0.9689226,"about_ca_system_score_codex":0.00003202417,"about_ca_system_score_gemma":0.000033226017,"threshold_uncertainty_score":0.99997354},"labels":[],"label_agreement":null},{"id":"W2120230527","doi":"10.2178/jsl/1208359065","title":"Generic complexity of undecidable problems","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Undecidable problem; Construct (python library); Decidability; Word problem (mathematics education); Mathematics; Halting problem; Discrete mathematics; Computational complexity theory; Computer science; Algorithm; Turing machine; Arithmetic; Programming language","score_opus":0.0957049011215074,"score_gpt":0.2547248305775202,"score_spread":0.15901992945601282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120230527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8038255,0.0016056307,0.18820235,0.00094615115,0.00051618094,0.00010587196,0.0000016282933,0.000047572255,0.004749129],"genre_scores_gemma":[0.9701329,0.00017932807,0.029150639,0.0003094271,0.00011364348,8.239768e-7,2.1118069e-7,0.00000512532,0.00010793518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877685,0.00007231987,0.0004944059,0.000116082636,0.00034344502,0.000196864],"domain_scores_gemma":[0.9988649,0.00006349067,0.00051596895,0.0002905584,0.00017131928,0.000093765935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046906772,0.000099917605,0.00033450712,0.00014067916,0.000079644204,0.00002258908,0.0009091055,0.000046483252,0.000042285377],"category_scores_gemma":[0.000033793593,0.00007061166,0.0001382131,0.0003776617,0.00017440964,0.00033754332,0.00013007494,0.00014487814,0.00001491281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045914567,0.0014434224,0.010344682,0.0001762381,0.00025311855,0.0006075805,0.0051875366,0.004631308,0.066886745,0.87976116,0.013382961,0.01727933],"study_design_scores_gemma":[0.002074842,0.0013470872,0.103386596,0.00018855366,0.000036068188,0.007488539,0.00016811864,0.018758003,0.016451072,0.84418213,0.005385057,0.00053395063],"about_ca_topic_score_codex":0.0000154919,"about_ca_topic_score_gemma":9.076315e-7,"teacher_disagreement_score":0.16630739,"about_ca_system_score_codex":0.000035660138,"about_ca_system_score_gemma":0.000120850826,"threshold_uncertainty_score":0.28794602},"labels":[],"label_agreement":null},{"id":"W2123245038","doi":"10.1007/978-1-4612-1388-8_12","title":"Multiparty Communication Complexity of Finite Monoids","year":2000,"lang":"en","type":"book-chapter","venue":"Birkhäuser Boston eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Algebraic number; Monoid; Extension (predicate logic); Computer science; Bounded function; Communication complexity; Discrete mathematics; Mathematics; Theoretical computer science; Programming language","score_opus":0.05070096997711134,"score_gpt":0.24293958032864224,"score_spread":0.1922386103515309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123245038","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055677415,0.00065430027,0.007626334,0.00013821055,0.00018878396,0.00031851628,0.00008398286,0.0003854466,0.99004763],"genre_scores_gemma":[0.3447935,0.00062911306,0.05950507,0.0016998515,0.00023293511,0.00007117306,0.00024190465,0.00027242294,0.59255403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981852,0.0000744188,0.0005939557,0.0004932804,0.00037987504,0.0002732681],"domain_scores_gemma":[0.99674135,0.00022129354,0.0004505361,0.0023753673,0.0000994211,0.00011202267],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003259076,0.0003746395,0.00048037284,0.00020575109,0.00015460102,0.000080884194,0.0019732944,0.00035200044,0.00032975886],"category_scores_gemma":[0.000011594846,0.00038375251,0.00025740702,0.00002769468,0.0005173915,0.00014886382,0.0005868723,0.00041886544,0.0002526369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017326887,0.000022041053,0.0000033480626,0.0000324485,0.00003796945,0.000008645521,0.0005681533,0.000009206753,0.000094579,0.94877666,0.0008826716,0.049546964],"study_design_scores_gemma":[0.00057358143,0.00012141394,0.00013726368,0.00042941622,0.00004784399,0.000018086528,0.000009890046,0.0069010216,0.0029381954,0.7061944,0.28188655,0.0007423502],"about_ca_topic_score_codex":0.00009619993,"about_ca_topic_score_gemma":0.0000407254,"teacher_disagreement_score":0.39749363,"about_ca_system_score_codex":0.000039712813,"about_ca_system_score_gemma":0.00010230693,"threshold_uncertainty_score":0.9998614},"labels":[],"label_agreement":null},{"id":"W2123754314","doi":"10.1007/s00373-010-0937-6","title":"Enumerative Properties of Rooted Circuit Maps","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Planar graph; Combinatorics; Mathematics; Chordal graph; 1-planar graph; Planar; Pathwidth; Outerplanar graph; Indifference graph; Discrete mathematics; Planar straight-line graph; Vertex (graph theory); Graph; Computer science; Line graph","score_opus":0.011269198459668003,"score_gpt":0.18570217661450686,"score_spread":0.17443297815483885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123754314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994256,0.00057156134,0.0029040615,0.00012153142,0.0006199621,0.00009062823,0.0000024793305,0.000103372826,0.001330369],"genre_scores_gemma":[0.99952435,0.000033349817,0.00028329747,0.000056267025,0.0000064272685,0.0000069699113,7.4884923e-7,0.0000050177637,0.000083573796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935913,0.000024861669,0.00013921261,0.00018834085,0.00014520616,0.00014325578],"domain_scores_gemma":[0.9994479,0.000026365993,0.00006755247,0.00031675913,0.00008305741,0.00005838689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016881932,0.00009574915,0.0001388548,0.000078004756,0.00009392356,0.00006570112,0.0003637235,0.0000585305,0.000003019319],"category_scores_gemma":[0.00002160698,0.00007568443,0.0000392741,0.00032277522,0.000092351336,0.00020635284,0.000121698315,0.00015134542,0.000002499415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013222474,0.00005416655,0.0012059219,0.000015525098,0.00000921491,0.0000022094223,0.0006074647,1.3439916e-7,0.017846875,0.9738108,0.00009724982,0.0063491343],"study_design_scores_gemma":[0.00035879845,0.00010140587,0.0044801724,0.000022154461,0.0000062654926,0.00001590764,0.00007848249,0.001248117,0.041340075,0.9510482,0.0011180238,0.00018239881],"about_ca_topic_score_codex":0.000026359101,"about_ca_topic_score_gemma":0.0000031142538,"teacher_disagreement_score":0.0234932,"about_ca_system_score_codex":0.0000029806706,"about_ca_system_score_gemma":0.000025094492,"threshold_uncertainty_score":0.30863217},"labels":[],"label_agreement":null},{"id":"W2123879058","doi":"10.1109/isit.2006.262113","title":"On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type","year":2006,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Cover (algebra); Presentation (obstetrics); FTCS scheme; Mathematics; Type (biology); Automaton; Discrete mathematics; Computer science; Theoretical computer science; Ordinary differential equation; Differential equation; Mathematical analysis; Engineering","score_opus":0.014173927031049418,"score_gpt":0.21521488661426388,"score_spread":0.20104095958321447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123879058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64189804,0.00035684358,0.13770671,0.00135016,0.001230524,0.000557983,0.00003383767,0.00023499386,0.2166309],"genre_scores_gemma":[0.9978439,0.0000018168836,0.0004638127,0.000084136314,0.000016815375,0.0000020256734,0.0000020538218,0.0000033729752,0.0015820398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993296,0.000056236473,0.00019603965,0.0001369048,0.0001668502,0.00011435795],"domain_scores_gemma":[0.99885756,0.0005420316,0.00010605475,0.0004075121,0.000071004,0.000015867341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033117976,0.00006869649,0.00012624271,0.0000529121,0.000027883189,0.000028561148,0.00042668535,0.000029830775,0.00005537514],"category_scores_gemma":[0.0000457021,0.000041880066,0.000034342862,0.00032157844,0.00007718859,0.00007182719,0.000051113788,0.000039155904,0.000019082632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055046944,0.000041460255,0.00005839516,0.000013534376,0.000008119588,0.0000012792707,0.000062823274,0.0024277512,0.007063629,0.9860853,0.0038793704,0.00035281884],"study_design_scores_gemma":[0.0012251029,0.00090299465,0.0012579694,0.00037729452,0.00002248638,0.000021144648,0.0010867424,0.773077,0.13900785,0.07811685,0.0043814383,0.0005230871],"about_ca_topic_score_codex":0.00043198606,"about_ca_topic_score_gemma":0.0000039693105,"teacher_disagreement_score":0.90796846,"about_ca_system_score_codex":0.000009401661,"about_ca_system_score_gemma":0.000052668995,"threshold_uncertainty_score":0.17078196},"labels":[],"label_agreement":null},{"id":"W2124322517","doi":"10.1112/s0010437x1200022x","title":"Quivers of monoids with basic algebras","year":2012,"lang":"en","type":"article","venue":"Compositio Mathematica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; City University of New York","keywords":"Quiver; Mathematics; Monoid; Semigroup; Algebraically closed field; Pure mathematics; Bicyclic semigroup; Cartan matrix; Field (mathematics); Representation theory; Class (philosophy); Computation; Group (periodic table); Algebra over a field; Algebra representation; Non-associative algebra","score_opus":0.01029314512718816,"score_gpt":0.21637504301014132,"score_spread":0.20608189788295317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124322517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43963715,0.00017588185,0.5442023,0.0002229871,0.00009508105,0.00014689629,0.000002440526,0.00017717827,0.015340075],"genre_scores_gemma":[0.8950369,0.0000019338163,0.10473625,0.00011344141,0.00002879469,0.000008595873,0.0000012903926,0.000009026546,0.00006378951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991902,0.000038265665,0.00017943421,0.00013565531,0.00020896769,0.00024744714],"domain_scores_gemma":[0.99909186,0.00014231124,0.00010160854,0.0005276108,0.000036611527,0.00009996942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022051448,0.0001150958,0.00019603613,0.00006569837,0.000058004538,0.000035975034,0.00052987423,0.000029874922,0.0000638009],"category_scores_gemma":[0.000007125089,0.00008667702,0.00004968524,0.00019759625,0.00007996024,0.00045020567,0.0001293862,0.00005814076,0.00011455919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068699824,0.00029254484,0.0003863406,0.000099448815,0.000041380732,0.0000039039724,0.0030275662,0.0000075183502,0.0071555357,0.9861283,0.00064416404,0.0022064582],"study_design_scores_gemma":[0.0038266238,0.0016064985,0.022293607,0.0017060611,0.00031582237,0.0010887935,0.0021257277,0.09918141,0.48875436,0.37347838,0.0029849245,0.0026377966],"about_ca_topic_score_codex":0.0000027779652,"about_ca_topic_score_gemma":1.4163369e-7,"teacher_disagreement_score":0.6126499,"about_ca_system_score_codex":0.00001747556,"about_ca_system_score_gemma":0.000018270894,"threshold_uncertainty_score":0.3534586},"labels":[],"label_agreement":null},{"id":"W2125204297","doi":"10.1016/j.tcs.2010.12.034","title":"Two infinite families of polyominoes that tile the plane by translation in two distinct ways","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Tile; Plane (geometry); Focus (optics); Mathematics; Translation (biology); Fibonacci number; Combinatorics; Fractal; Geometry; Mathematical analysis; Physics; Optics","score_opus":0.012861044561188799,"score_gpt":0.2507726794940887,"score_spread":0.2379116349328999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125204297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5131374,0.000036986756,0.48303866,0.00051903113,0.000434598,0.00013200207,0.000008289898,0.00008137882,0.0026116697],"genre_scores_gemma":[0.97142994,0.0000040083114,0.028228527,0.000257074,0.00006286063,0.0000060118323,0.0000025007844,0.000006417252,0.0000026525372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980521,0.00010233373,0.000309518,0.0004925856,0.00059115916,0.00045231252],"domain_scores_gemma":[0.997856,0.0010517791,0.00009669365,0.00082825957,0.000052499345,0.000114772],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018367748,0.00018014152,0.00021806374,0.00015877896,0.00022188165,0.00024106793,0.0026496474,0.00003580355,0.00003882198],"category_scores_gemma":[0.000059283266,0.00011503184,0.000056613095,0.0008510781,0.0031560773,0.00057452463,0.00046969054,0.00032723998,0.000017473943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008476261,0.000049954073,0.0008246307,0.0000044889216,0.000001728252,0.0000027790777,0.0012573916,0.000034040106,0.013986133,0.9160037,0.00002107701,0.06780559],"study_design_scores_gemma":[0.0007295259,0.00012026039,0.008485807,0.000041296254,0.0000057005,0.00003831585,0.000053900032,0.6675478,0.054421358,0.26800773,0.00022746073,0.0003208294],"about_ca_topic_score_codex":0.000067475834,"about_ca_topic_score_gemma":0.000038278213,"teacher_disagreement_score":0.6675138,"about_ca_system_score_codex":0.0000130023745,"about_ca_system_score_gemma":0.000066538254,"threshold_uncertainty_score":0.9995568},"labels":[],"label_agreement":null},{"id":"W2125388232","doi":"10.1109/icsmc.1993.384935","title":"On modelling non-stationary random environments using switching techniques","year":2002,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Automaton; Markov chain; Computer science; Learning automata; Continuous-time Markov chain; Stochastic matrix; Stationary distribution; State (computer science); Chain (unit); Theoretical computer science; Stochastic process; Markov process; Artificial intelligence; Markov model; Mathematics; Algorithm; Markov property; Machine learning","score_opus":0.02515297446667359,"score_gpt":0.2244084694841082,"score_spread":0.19925549501743461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125388232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040332925,0.000034645676,0.95556754,0.00007951166,0.000061665494,0.00009898047,3.3740633e-7,0.00013775376,0.0036866437],"genre_scores_gemma":[0.76974064,0.000019932539,0.22948518,0.0004943907,0.000025625593,0.0000045113843,5.1029025e-7,0.0000075015682,0.00022167152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922407,0.000028180084,0.00014696509,0.00024377453,0.00019366016,0.00016334311],"domain_scores_gemma":[0.9995103,0.000102878366,0.00004717841,0.00029459118,0.0000043617856,0.00004067584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017942868,0.00010041515,0.00009531943,0.00007828671,0.00013537682,0.00007289399,0.00031934565,0.000034550394,0.00007364177],"category_scores_gemma":[0.000003880719,0.000085409,0.000041179315,0.000085767955,0.000010367976,0.00043422007,0.00008851946,0.00007966151,0.0000689562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003241763,0.0005248743,0.000086364984,0.000023015682,0.000054723274,0.00008328638,0.0029849934,0.49974146,0.07935723,0.12301557,0.0010905399,0.29300553],"study_design_scores_gemma":[0.0002246319,0.000020637233,0.00000535574,0.000023519138,0.000001807846,0.0000064444816,0.00000830651,0.97026306,0.012009854,0.017183082,0.00013948568,0.000113800466],"about_ca_topic_score_codex":0.0000140734355,"about_ca_topic_score_gemma":7.98771e-8,"teacher_disagreement_score":0.7294077,"about_ca_system_score_codex":0.000033861103,"about_ca_system_score_gemma":0.0000030948206,"threshold_uncertainty_score":0.34828782},"labels":[],"label_agreement":null},{"id":"W2126071774","doi":"10.1090/proc/12848","title":"An unusual continued fraction","year":2015,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Sigma; Conjecture; Fraction (chemistry); Mathematics; Quotient; Transcendental number; Continued fraction; Combinatorics; Logarithm; Physics; Mathematical analysis; Arithmetic; Quantum mechanics","score_opus":0.018003505059312006,"score_gpt":0.28150130431641984,"score_spread":0.2634977992571078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126071774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9250475,0.000052547784,0.068216756,0.0015440261,0.0002282153,0.0004849005,0.000013253848,0.00044670573,0.003966082],"genre_scores_gemma":[0.8622046,0.00001669748,0.13684402,0.0005711336,0.00018541893,0.000046151377,0.000001778818,0.000032593718,0.000097619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979066,0.000026859816,0.00046888686,0.0005566199,0.00070678885,0.00033422455],"domain_scores_gemma":[0.997446,0.00011870099,0.0012224546,0.00061172753,0.000432681,0.00016845152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011873133,0.00030354227,0.00071147154,0.000029465316,0.0001063142,0.0002729479,0.002961408,0.00014632092,0.0000070740134],"category_scores_gemma":[0.0002248618,0.00020736811,0.00048995495,0.00041830546,0.000582572,0.00036376002,0.0019898848,0.0006507824,0.000014214064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007575536,0.0024816664,0.0027690772,0.0027908292,0.0009045266,0.000001511811,0.026127424,0.000113340364,0.05275951,0.788635,0.076718345,0.04662299],"study_design_scores_gemma":[0.00018429595,0.00013509195,0.0012110783,0.00025319587,0.00007521119,0.00001250319,0.0019468248,0.14350015,0.0067253346,0.845283,0.000258023,0.00041531102],"about_ca_topic_score_codex":0.00002939769,"about_ca_topic_score_gemma":1.02283465e-7,"teacher_disagreement_score":0.14338681,"about_ca_system_score_codex":0.0001326865,"about_ca_system_score_gemma":0.00011193657,"threshold_uncertainty_score":0.8456226},"labels":[],"label_agreement":null},{"id":"W2126946720","doi":"10.1142/s0218196708004913","title":"EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM","year":2008,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Variety (cybernetics); Mathematics; Signature (topology); Function (biology); Algebra over a field; Finite-state machine; Discrete mathematics; Pure mathematics; Algorithm","score_opus":0.04422240327387793,"score_gpt":0.2675585111768122,"score_spread":0.22333610790293423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126946720","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49949446,0.00014690572,0.49531245,0.0037220342,0.00068289594,0.000068080786,0.0000042262964,0.00001643682,0.00055248494],"genre_scores_gemma":[0.9792928,0.000020094662,0.020155646,0.00037000276,0.00012811227,8.9014827e-7,0.000002898514,0.000004181695,0.000025388776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985828,0.00010067346,0.00045493452,0.00011390436,0.0006596102,0.00008810229],"domain_scores_gemma":[0.99851745,0.00023369804,0.00056813395,0.000095270036,0.0005386823,0.000046769146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035333846,0.00008773961,0.0001393012,0.00013157034,0.00009294955,0.00005884573,0.00072162447,0.00003343766,0.000019972782],"category_scores_gemma":[0.00006990088,0.00006318977,0.00009089421,0.00016457308,0.00018222643,0.00052006356,0.00015720118,0.00012860564,0.0000027484732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000552421,0.0001857536,0.004764925,0.00001554168,0.00019261948,0.000031807966,0.0028807456,0.005786574,0.0010921946,0.95254827,0.0006041524,0.031842202],"study_design_scores_gemma":[0.0009762024,0.00014801702,0.08171263,0.00011175681,0.000014266824,0.00083950575,0.000074218195,0.11356143,0.0021527552,0.8000589,0.00021213146,0.00013816122],"about_ca_topic_score_codex":0.000008692124,"about_ca_topic_score_gemma":0.0000018476275,"teacher_disagreement_score":0.47979832,"about_ca_system_score_codex":0.000032101932,"about_ca_system_score_gemma":0.00012028137,"threshold_uncertainty_score":0.2576804},"labels":[],"label_agreement":null},{"id":"W2127978939","doi":"10.1016/j.jalgebra.2012.07.013","title":"Bifix codes and Sturmian words","year":2012,"lang":"en","type":"preprint","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Alphabet; Word (group theory); Mathematics; Degree (music); Code (set theory); Combinatorics; Set (abstract data type); Discrete mathematics; Arithmetic; Linguistics; Computer science; Physics","score_opus":0.015545204969675857,"score_gpt":0.2516857723966816,"score_spread":0.23614056742700576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127978939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79673624,0.016030371,0.17838693,0.0027354958,0.004627428,0.00014540883,0.000008219397,0.000089215646,0.0012407156],"genre_scores_gemma":[0.9694577,0.00050504686,0.028748285,0.00035841105,0.0008395923,0.0000012808256,8.5762514e-7,0.00001400994,0.00007482957],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862015,0.00011039973,0.00046238652,0.00019745436,0.00036432574,0.0002452832],"domain_scores_gemma":[0.99841017,0.00013213063,0.000673731,0.0004606167,0.000110176705,0.00021319433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010775614,0.00019191366,0.0004184687,0.00021152996,0.000057339334,0.00033517825,0.0011761817,0.00017230179,0.000020637883],"category_scores_gemma":[0.00004724084,0.00015226484,0.00015723302,0.000103638726,0.00006227078,0.00044545607,0.0010945958,0.0007238589,0.0000112785165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000690007,0.00052421435,0.0069829114,0.00051314896,0.00090219517,0.0004231805,0.013404933,0.0001413158,0.0024462352,0.25109035,0.015583143,0.70791936],"study_design_scores_gemma":[0.0020183066,0.0005616026,0.11956404,0.0024543398,0.0003557988,0.0029917003,0.0006798982,0.0075643794,0.005617256,0.82562727,0.030577265,0.0019881183],"about_ca_topic_score_codex":0.0000074288496,"about_ca_topic_score_gemma":0.0000017334718,"teacher_disagreement_score":0.70593125,"about_ca_system_score_codex":0.000041274045,"about_ca_system_score_gemma":0.00013481207,"threshold_uncertainty_score":0.620918},"labels":[],"label_agreement":null},{"id":"W2128534664","doi":"10.4230/lipics.mfcs.2017.24","title":"Better Complexity Bounds for Cost Register Automata","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Natural Sciences and Engineering Research Council of Canada; McGill University; National Science Foundation","keywords":"Nondeterministic algorithm; Parameterized complexity; Computer science; Finite-state machine; Automaton; Theory of computation; Theoretical computer science; Nondeterministic finite automaton; Automata theory; Mathematics; Algorithm","score_opus":0.19704830979027357,"score_gpt":0.21352947838471356,"score_spread":0.016481168594439988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128534664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058905505,0.000040658404,0.929044,0.00035057918,0.0012497314,0.0007397679,0.0000990869,0.00075377646,0.008816892],"genre_scores_gemma":[0.9806739,0.000032215812,0.014620416,0.0009670536,0.00017422183,0.000007716998,0.00007924107,0.000038259168,0.0034069498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753344,0.00012904203,0.0002668598,0.0014217388,0.00009791004,0.00055099494],"domain_scores_gemma":[0.99660426,0.00014568026,0.00034859747,0.0025458843,0.0001548741,0.00020071879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044004514,0.00041981536,0.00047214483,0.0002202339,0.00026057835,0.00027111714,0.003505434,0.00034879366,0.00007408459],"category_scores_gemma":[0.000025423878,0.0004622632,0.00037722572,0.00027549712,0.00031090196,0.00051884766,0.003069695,0.00045154637,0.0001505315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053697193,0.00016336283,0.0005892634,0.0001671953,0.00013488745,0.00014225033,0.000328238,0.0005777563,0.000023075381,0.984782,0.010100981,0.0029372852],"study_design_scores_gemma":[0.00085693493,0.00006995483,0.0016665936,0.00011395562,0.00007783691,0.000011151879,0.000026393109,0.35038364,0.00017563142,0.6299792,0.015899755,0.00073893764],"about_ca_topic_score_codex":0.00015944685,"about_ca_topic_score_gemma":0.000045146782,"teacher_disagreement_score":0.9217684,"about_ca_system_score_codex":0.00018364606,"about_ca_system_score_gemma":0.00015065678,"threshold_uncertainty_score":0.9997829},"labels":[],"label_agreement":null},{"id":"W2129329247","doi":"10.1007/s00012-004-1823-y","title":"Semigroups that are factors of subdirectly irreducible semigroups by their monolith","year":2004,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Wilfrid Laurier University","funders":"","keywords":"Semigroup; Mathematics; Intersection (aeronautics); Ideal (ethics); Pure mathematics; Semilattice; Monolith; Binary number; Binary operation; Algebra over a field; Discrete mathematics; Arithmetic; Chemistry","score_opus":0.011979141763910595,"score_gpt":0.18864766927466084,"score_spread":0.17666852751075024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129329247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9664434,0.0008997095,0.028592808,0.0005865103,0.00035697428,0.00020476054,0.00015970906,0.00056081294,0.0021952884],"genre_scores_gemma":[0.99768716,0.000121492994,0.0014932363,0.00026801333,0.000036872927,0.000004036389,0.000045016783,0.000036722973,0.000307456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979105,0.00010213224,0.0003026603,0.00070956507,0.0004021662,0.0005729619],"domain_scores_gemma":[0.99799204,0.0001961553,0.00031809194,0.0011752131,0.00009072887,0.00022779456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026078455,0.000390979,0.0004907795,0.00024331131,0.00016658708,0.000119390425,0.0017192004,0.00017625286,0.00005746869],"category_scores_gemma":[0.000030018628,0.00033824623,0.00023761444,0.0008166601,0.00017815355,0.0012925379,0.000376316,0.00022596386,0.000020829255],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012338466,0.0020045477,0.062355563,0.00030750578,0.001111826,0.00027975216,0.05474079,0.0007887243,0.07070238,0.7401273,0.045879364,0.021578824],"study_design_scores_gemma":[0.0026696026,0.00038000807,0.023401188,0.00038063907,0.00008291911,0.00006115843,0.0122084115,0.0014251224,0.8895903,0.054121487,0.013978134,0.0017009915],"about_ca_topic_score_codex":0.0015803289,"about_ca_topic_score_gemma":0.000074017305,"teacher_disagreement_score":0.81888795,"about_ca_system_score_codex":0.0001850324,"about_ca_system_score_gemma":0.00010974516,"threshold_uncertainty_score":0.99990696},"labels":[],"label_agreement":null},{"id":"W2129749965","doi":"10.1016/j.tcs.2010.09.006","title":"On the complexity of deciding avoidability of sets of partial words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Combinatorics on words; Set (abstract data type); Word (group theory); Alphabet; Space (punctuation); Discrete mathematics; Decidability; Finite set; Polynomial; De Bruijn sequence; Time complexity; Upper and lower bounds; Existential quantification; Computer science","score_opus":0.025403499655608456,"score_gpt":0.2698010805531539,"score_spread":0.24439758089754543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129749965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60157746,0.0000024386238,0.39678228,0.00045877445,0.00032549136,0.0001017601,0.000003375635,0.000027414195,0.0007210332],"genre_scores_gemma":[0.9491765,4.0100107e-7,0.0506619,0.00012609843,0.00002830786,0.0000024125816,1.7402093e-7,0.0000036865747,5.15443e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780273,0.00020247824,0.00046025086,0.00042822192,0.00077597797,0.00033034032],"domain_scores_gemma":[0.9965345,0.0015189698,0.00022044685,0.001390578,0.00021914791,0.00011633856],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0041234083,0.00013722031,0.00029781985,0.00010243694,0.00017321369,0.000054520064,0.0032646249,0.000049580587,0.00009243029],"category_scores_gemma":[0.00050937664,0.00008552472,0.00010765095,0.0009051813,0.012799348,0.00022896849,0.0010443105,0.00026946477,0.0000053785575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015110567,0.00012690574,0.00015686719,0.000012247351,0.000003287799,5.8808394e-7,0.0005464138,0.00003927339,0.021630678,0.9691014,0.000008401254,0.008358792],"study_design_scores_gemma":[0.000091400754,0.00015107232,0.00342838,0.000027778498,0.000002423701,0.0000039940205,0.000007850571,0.23914516,0.19111873,0.5659487,0.0000029068353,0.000071555456],"about_ca_topic_score_codex":0.000009000979,"about_ca_topic_score_gemma":0.0000011771041,"teacher_disagreement_score":0.40315267,"about_ca_system_score_codex":0.000012161266,"about_ca_system_score_gemma":0.00011670161,"threshold_uncertainty_score":0.98988724},"labels":[],"label_agreement":null},{"id":"W2129836340","doi":"10.1344/cm.v55i3.4061","title":"On equivalent conditions to quasi-perfectness of abelian *-semigroups","year":2004,"lang":"en","type":"article","venue":"Collectanea mathematica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Abelian group; Semigroup; Pure mathematics; Moment (physics); Function (biology); Measure (data warehouse); Set (abstract data type); Discrete mathematics; Combinatorics; Algebra over a field","score_opus":0.013708513478281626,"score_gpt":0.2629432933670337,"score_spread":0.2492347798887521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129836340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49810356,0.000055778924,0.4774661,0.0025400189,0.0003465918,0.0008482359,0.000032516196,0.0003429223,0.020264294],"genre_scores_gemma":[0.9747112,0.0000037315071,0.024119316,0.0005555448,0.000028512088,0.00009260906,0.0000023195016,0.000021220269,0.00046558026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983606,0.000050168048,0.00041391616,0.00039095143,0.00042021504,0.0003641937],"domain_scores_gemma":[0.99822605,0.00041161032,0.00012747204,0.00096455397,0.00008775773,0.00018254711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003285955,0.00021264955,0.000366239,0.00027077334,0.0001782134,0.00009165235,0.0010042231,0.000068652356,0.00016076301],"category_scores_gemma":[0.00024276256,0.00018519483,0.00012304107,0.0010627924,0.00007281388,0.0001231219,0.00019433195,0.000105144514,0.00047558107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011096585,0.0006286701,0.0000021179417,0.0001047043,0.00002770828,0.000024296409,0.0022609867,0.00030507238,0.011659708,0.9824555,0.0020595407,0.000460619],"study_design_scores_gemma":[0.0015275317,0.0016971583,0.00017595428,0.0009840422,0.000035861667,0.0001566062,0.00029521607,0.008213655,0.07515636,0.91044116,0.0006157025,0.00070073846],"about_ca_topic_score_codex":0.000010054322,"about_ca_topic_score_gemma":0.0000035640442,"teacher_disagreement_score":0.47660762,"about_ca_system_score_codex":0.00012197728,"about_ca_system_score_gemma":0.00012454178,"threshold_uncertainty_score":0.75520265},"labels":[],"label_agreement":null},{"id":"W2131311370","doi":"10.1017/s0013091508000473","title":"Independence algebras, basis algebras and semigroups of quotients","year":2010,"lang":"en","type":"article","venue":"Proceedings of the Edinburgh Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada; Universidade de Lisboa; Wilfrid Laurier University","keywords":"Endomorphism; Mathematics; Basis (linear algebra); Quotient; Monoid; Rank (graph theory); Independence (probability theory); Pure mathematics; Distributivity; Algebra over a field; Combinatorics; Distributive property","score_opus":0.007348634326920981,"score_gpt":0.2178260721708983,"score_spread":0.21047743784397732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131311370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992702,0.000054884476,0.003570959,0.0009081403,0.00030639328,0.0002585521,0.000003936992,0.00009653852,0.0020985648],"genre_scores_gemma":[0.9550187,0.000019034718,0.04446123,0.00017584891,0.000088764806,0.000015077001,1.8638193e-7,0.000013686728,0.00020748838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979913,0.000006149577,0.0004944415,0.00039014753,0.00078313693,0.0003348244],"domain_scores_gemma":[0.9985901,0.0002758944,0.00039582612,0.00035194075,0.00025158675,0.00013465069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012611052,0.00021784294,0.00038665347,0.000034327564,0.00014471273,0.000094061164,0.0016775805,0.00021656869,0.000099284814],"category_scores_gemma":[0.0004821364,0.00014518487,0.00027651878,0.00046781427,0.00048675496,0.0005749225,0.0011515534,0.00047349,0.0000024272167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070979877,0.00036994688,0.010968797,0.0004945946,0.00011099934,2.5839506e-7,0.006808712,4.653944e-7,0.1487874,0.8181978,0.010038884,0.004215064],"study_design_scores_gemma":[0.0004609353,0.00007480318,0.0043002535,0.00028034364,0.000059503298,0.000047924797,0.0008613849,0.01992896,0.15861332,0.8148582,0.0001808359,0.00033353132],"about_ca_topic_score_codex":0.000007023433,"about_ca_topic_score_gemma":2.8371878e-7,"teacher_disagreement_score":0.040890273,"about_ca_system_score_codex":0.000015709964,"about_ca_system_score_gemma":0.000034937275,"threshold_uncertainty_score":0.59204674},"labels":[],"label_agreement":null},{"id":"W2131975287","doi":"10.1137/100795425","title":"Nested Recurrence Relations with Conolly-like Solutions","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Fibonacci number; Sequence (biology); BETA (programming language); Integer (computer science); Discrete mathematics","score_opus":0.026111741299510324,"score_gpt":0.25227672015041924,"score_spread":0.22616497885090892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131975287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030149953,0.0004289828,0.95493746,0.0018031927,0.0007246377,0.00019171272,0.0000072558537,0.00019652756,0.011560262],"genre_scores_gemma":[0.8627269,0.000039718543,0.13599502,0.00028899367,0.00016821238,0.000010772834,0.0000027478134,0.000023170858,0.0007444345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984948,0.0000900577,0.00036913963,0.00015390184,0.00039698114,0.000495132],"domain_scores_gemma":[0.99850553,0.0002790305,0.00031856535,0.0005348143,0.00009057969,0.00027144872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007716177,0.00018772791,0.0002101849,0.00013664302,0.00046682506,0.00026339298,0.0006431373,0.000060452436,0.000077017605],"category_scores_gemma":[0.000092215196,0.00012806505,0.00009106779,0.00038511964,0.00008082365,0.0010118681,0.00011490978,0.0003879073,0.00028674395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007413541,0.00031113316,0.00045439778,0.000026129515,0.00006459183,0.000018811887,0.003951367,0.00024328312,0.0001133361,0.98698664,0.0044467016,0.0033761917],"study_design_scores_gemma":[0.0050922437,0.0024767732,0.01564725,0.004388787,0.00045778957,0.013652336,0.006512925,0.29624048,0.0015397385,0.5804958,0.06938514,0.0041107256],"about_ca_topic_score_codex":8.8180917e-7,"about_ca_topic_score_gemma":0.0000010804563,"teacher_disagreement_score":0.832577,"about_ca_system_score_codex":0.0000691883,"about_ca_system_score_gemma":0.00008196236,"threshold_uncertainty_score":0.5222341},"labels":[],"label_agreement":null},{"id":"W2132962549","doi":"10.1016/j.disc.2011.07.029","title":"A pattern sequence approach to Stern’s sequence","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Sequence (biology); Complement (music); Base (topology); Word (group theory); Integer (computer science); Binary number; Discrete mathematics; Arithmetic; Geometry","score_opus":0.09206309257501788,"score_gpt":0.2726519713867397,"score_spread":0.1805888788117218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132962549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036372658,0.000018155093,0.93523806,0.00009864233,0.00012425522,0.000269157,0.000014094698,0.00033133992,0.027533617],"genre_scores_gemma":[0.68661445,0.000002618207,0.31242502,0.00057042553,0.000029642484,0.000049535174,0.0000032830071,0.000020313924,0.0002847041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984284,0.00003831445,0.00032722056,0.00045497736,0.0003413709,0.00040970693],"domain_scores_gemma":[0.9984997,0.000054400916,0.00012112336,0.0010844202,0.000050555278,0.00018980169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039045778,0.00022815457,0.0002477656,0.00008794438,0.00008662803,0.0001594434,0.001782276,0.000060649556,0.00003287053],"category_scores_gemma":[0.000041968862,0.00018416959,0.00008360116,0.0003082738,0.000061354185,0.00042360896,0.00051808474,0.00012270121,0.00038623478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052182436,0.00047706318,0.0003991116,0.00042161945,0.00006804458,0.00009628008,0.079668805,0.000031368236,0.0068494305,0.86125326,0.00075769075,0.049972106],"study_design_scores_gemma":[0.00066037674,0.00036828071,0.0010399133,0.0005438763,0.00005406613,0.0004886027,0.003258287,0.6379561,0.02277328,0.32968423,0.0010618656,0.0021111616],"about_ca_topic_score_codex":0.000039567964,"about_ca_topic_score_gemma":0.0000018500972,"teacher_disagreement_score":0.6502418,"about_ca_system_score_codex":0.000039081726,"about_ca_system_score_gemma":0.000032721182,"threshold_uncertainty_score":0.7510218},"labels":[],"label_agreement":null},{"id":"W2133087912","doi":"10.46298/dmtcs.397","title":"On the critical exponent of generalized Thue-Morse words","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Infimum and supremum; Exponent; Mathematics; Morse code; Set (abstract data type); Critical exponent; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.01614136682013868,"score_gpt":0.2813352824947019,"score_spread":0.26519391567456324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133087912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10898168,0.00002614278,0.8827314,0.00232872,0.0004918343,0.00023405331,0.0000031574082,0.0001459087,0.0050571105],"genre_scores_gemma":[0.765916,0.000002312487,0.23314102,0.0008356054,0.00007530392,0.000007345201,4.7485625e-7,0.000013472936,0.000008446319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614483,0.00014619534,0.00070814625,0.00068116107,0.0014682184,0.0008514424],"domain_scores_gemma":[0.99404097,0.0034638846,0.00016916222,0.0018059917,0.00020877479,0.0003111935],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0059119747,0.00030990195,0.00039093668,0.0002183071,0.00045770477,0.00040467613,0.004036618,0.000075887285,0.00014108692],"category_scores_gemma":[0.00079218316,0.00018233982,0.00019266832,0.0011579123,0.0044349656,0.00037085483,0.0013131502,0.00029128717,0.00006947247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001053187,0.00016622643,0.000003232524,0.000023355959,0.0000075513008,0.000016565582,0.0018913848,0.000021634614,0.002017599,0.99299747,0.000081261685,0.002763203],"study_design_scores_gemma":[0.0001378956,0.0001584115,0.000063719315,0.00009971756,0.000008081042,0.000026279627,0.00009454634,0.3133587,0.01582426,0.67000616,0.000018726472,0.00020352362],"about_ca_topic_score_codex":0.00000203104,"about_ca_topic_score_gemma":3.567873e-7,"teacher_disagreement_score":0.6569343,"about_ca_system_score_codex":0.000044131095,"about_ca_system_score_gemma":0.00008826553,"threshold_uncertainty_score":0.9982744},"labels":[],"label_agreement":null},{"id":"W2133379784","doi":"10.1090/s0002-9939-09-09857-8","title":"On the irreducible representations of a finite semigroup","year":2009,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet; Swedish Foundation for International Cooperation in Research and Higher Education","keywords":"Mathematics; Semigroup; Isomorphism (crystallography); Lemma (botany); Irreducible representation; Simple (philosophy); Parameterized complexity; Pure mathematics; Ring (chemistry); (g,K)-module; Algebra over a field; Combinatorics","score_opus":0.0136250332330557,"score_gpt":0.25862107988260713,"score_spread":0.24499604664955144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133379784","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9304195,0.000028492168,0.029311216,0.017011343,0.000044592558,0.00041337905,0.0000051407214,0.00013764635,0.022628712],"genre_scores_gemma":[0.975258,0.00001065993,0.022844307,0.0016696074,0.000020815878,0.000012365626,1.10344565e-7,0.000006371978,0.00017774111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988471,0.0000138546475,0.00030373826,0.0002261561,0.00040721963,0.00020189816],"domain_scores_gemma":[0.998245,0.0007383324,0.00046116844,0.00040085698,0.00011057529,0.000044047847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005628578,0.000119992896,0.0002603309,0.00001853307,0.00013008055,0.00005380102,0.0014079286,0.000023619888,0.000016768148],"category_scores_gemma":[0.0005108618,0.00006287336,0.00032026126,0.00084061694,0.00043504112,0.00015303772,0.00022300628,0.00015866835,0.000008254839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004115667,0.00017241757,0.00005934781,0.000029492425,0.000026738619,4.1440625e-8,0.002734679,0.00001258183,0.014732004,0.9734023,0.007243403,0.0015828836],"study_design_scores_gemma":[0.000104684,0.00019120565,0.0025382855,0.00012762824,0.0000210327,0.0000052575256,0.0017095858,0.027667988,0.020342661,0.9471231,0.00005238854,0.00011619806],"about_ca_topic_score_codex":0.0000060069774,"about_ca_topic_score_gemma":2.3709678e-8,"teacher_disagreement_score":0.044838544,"about_ca_system_score_codex":0.000018932877,"about_ca_system_score_gemma":0.000019644622,"threshold_uncertainty_score":0.26163054},"labels":[],"label_agreement":null},{"id":"W2134684788","doi":"10.1109/sct.1990.113968","title":"Extensions to Barrington's M-program model","year":2002,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Nondeterministic algorithm; Monoid; Abelian group; Logarithm; Polynomial; Computer science; Algebra over a field; Space (punctuation); Theoretical computer science; Computation; Discrete mathematics; Mathematics; Programming language; Pure mathematics","score_opus":0.030752279288144422,"score_gpt":0.250632414631065,"score_spread":0.21988013534292059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134684788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028559122,0.000053720563,0.91551214,0.002969896,0.00015180143,0.00016104736,6.446989e-7,0.0013004025,0.051291194],"genre_scores_gemma":[0.67988735,0.000004003049,0.31265807,0.0031229707,0.000022955299,0.000020426012,1.5671638e-7,0.000005822994,0.0042782784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926084,0.000010856094,0.000093848794,0.00026274024,0.0001365641,0.00023517595],"domain_scores_gemma":[0.99920696,0.000025108195,0.0000119985825,0.0005658734,0.00002809736,0.00016198392],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008485186,0.000079889534,0.00007740083,0.000059007576,0.000085429354,0.00011229418,0.0006100936,0.000025954856,0.00018903767],"category_scores_gemma":[0.00001861033,0.00006431012,0.000042383494,0.00024292918,0.00001217094,0.00021960308,0.00027939066,0.00005041487,0.0008558265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.977224e-7,0.0001299405,0.000015423611,0.0000020027167,0.0000046644204,0.000012790547,0.00048444464,0.003260329,0.0016975094,0.46254137,0.044675484,0.48717555],"study_design_scores_gemma":[0.00005809127,0.000036147143,0.000080449005,0.000004415345,9.662747e-7,0.0000069413913,0.000009798849,0.98535794,0.00058798544,0.0070717596,0.006675493,0.00011001834],"about_ca_topic_score_codex":0.000005954228,"about_ca_topic_score_gemma":0.0000018648587,"teacher_disagreement_score":0.9820976,"about_ca_system_score_codex":0.000009938978,"about_ca_system_score_gemma":0.00000475979,"threshold_uncertainty_score":0.9999221},"labels":[],"label_agreement":null},{"id":"W2134765710","doi":"10.48550/arxiv.1103.2147","title":"Beta Expansions for Regular Pisot Numbers","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rogers Communications (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Base (topology); Conjecture; Integer (computer science); Combinatorics; BETA (programming language); Representation (politics); Variety (cybernetics); Series (stratigraphy); Discrete mathematics; Computer science; Mathematical analysis; Statistics","score_opus":0.08249476611587321,"score_gpt":0.18695021517599886,"score_spread":0.10445544906012565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134765710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098802194,0.00009347203,0.8934786,0.00012388789,0.0010353612,0.00047054503,0.00003566314,0.0005138648,0.005446412],"genre_scores_gemma":[0.9854891,0.00009308191,0.010316856,0.00019047229,0.00009372732,0.000004062042,0.00002599236,0.000030010724,0.0037567203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979951,0.000095583106,0.00019589794,0.0012051194,0.000074615426,0.00043370412],"domain_scores_gemma":[0.99736416,0.00013854711,0.0002283814,0.0019448415,0.00012561346,0.00019848236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030227582,0.00032802494,0.0003581405,0.00020267614,0.0002177969,0.00009669572,0.002679865,0.0002631441,0.000053652406],"category_scores_gemma":[0.00002222055,0.00036854195,0.00037301634,0.00032039665,0.00012661029,0.00036428467,0.0019760367,0.00034161768,0.00010025884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020361878,0.000102588594,0.00020529632,0.000064353844,0.000103409744,0.0001104944,0.00037176575,0.0035505581,0.0000737909,0.991827,0.0026180288,0.0009523253],"study_design_scores_gemma":[0.00079473975,0.00009098265,0.00042102372,0.00017071125,0.00014027886,0.000011188874,0.00018125508,0.17029889,0.0012361825,0.81992346,0.005798002,0.0009332874],"about_ca_topic_score_codex":0.00015636582,"about_ca_topic_score_gemma":0.000024671157,"teacher_disagreement_score":0.88668686,"about_ca_system_score_codex":0.00010658237,"about_ca_system_score_gemma":0.00016965244,"threshold_uncertainty_score":0.9998767},"labels":[],"label_agreement":null},{"id":"W2136210216","doi":"10.37236/1571","title":"A One&amp;ndash;Sided Zimin Construction","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Abelian group; Substring; Combinatorics; Square (algebra); Alphabet; String (physics); Discrete mathematics; Geometry; Computer science; Linguistics; Data structure","score_opus":0.01286402042136128,"score_gpt":0.22879972740132148,"score_spread":0.2159357069799602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136210216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41281763,0.0025034514,0.5786092,0.003411404,0.0010451766,0.00009146013,2.008823e-7,0.00006925633,0.0014521765],"genre_scores_gemma":[0.9978688,0.00095772406,0.0005843951,0.00020527032,0.00013529682,0.0000013437092,2.927283e-7,0.0000105065765,0.00023640534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983213,0.00017638593,0.0003990961,0.00012892281,0.00046481704,0.0005094838],"domain_scores_gemma":[0.99856985,0.000260935,0.00043559188,0.0004513751,0.00020202696,0.00008020227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013922959,0.00012814469,0.00023225314,0.00012790524,0.00017723677,0.000118042015,0.0012970897,0.00005880097,0.000019185372],"category_scores_gemma":[0.0001147319,0.00009465741,0.00013003389,0.0006352168,0.00007683845,0.0004281953,0.00011012861,0.0006130752,0.000027467984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002052767,0.00008575916,0.00009564726,0.000002230766,0.00005122018,0.000007709113,0.00021998776,0.000024832038,0.0006632406,0.98453707,0.00038852592,0.0139032295],"study_design_scores_gemma":[0.00066999433,0.0002819718,0.0003372651,0.000029871744,0.000028126871,0.0016649353,0.000062775645,0.00065462507,0.0011888042,0.98087806,0.014075033,0.00012852927],"about_ca_topic_score_codex":0.000005409809,"about_ca_topic_score_gemma":0.0000030656079,"teacher_disagreement_score":0.5850511,"about_ca_system_score_codex":0.000249225,"about_ca_system_score_gemma":0.00037189017,"threshold_uncertainty_score":0.3860017},"labels":[],"label_agreement":null},{"id":"W2136499814","doi":"10.1016/j.tcs.2009.02.032","title":"Twin-roots of words and their properties","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Involution (esoterism); Mathematics; Catenation; Combinatorics; Uniqueness; Word (group theory); Primitive root modulo n; Factorization; Pure mathematics; Modulo; Algorithm; Geometry; Biology; Mathematical analysis","score_opus":0.010737442766716497,"score_gpt":0.21839386871214253,"score_spread":0.20765642594542602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136499814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35193792,0.00014753842,0.6451699,0.0009806702,0.00015215657,0.000082330334,4.6932738e-7,0.00012690286,0.0014021315],"genre_scores_gemma":[0.96193427,0.0000070300866,0.037262794,0.0007346932,0.000051064882,0.0000012429402,8.930342e-8,0.0000032576086,0.00000558117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849796,0.000067219924,0.00022989584,0.00048431157,0.0003354483,0.0003851368],"domain_scores_gemma":[0.99891996,0.000107011736,0.000059107693,0.00065650104,0.00009150024,0.00016594508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010612342,0.00015707612,0.0002180042,0.00013716672,0.0001850663,0.00023363606,0.001743806,0.00003557288,0.0000085106985],"category_scores_gemma":[0.000046626912,0.00009930907,0.000043203378,0.00068947964,0.0023638678,0.000591133,0.00060854456,0.00010952638,0.0000073306755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043658138,0.00003639912,0.000015459394,0.0000042454667,0.0000014030228,0.00000189225,0.00088979857,0.000010885784,0.012380884,0.8250101,0.000007775705,0.16163675],"study_design_scores_gemma":[0.00018223388,0.00040107596,0.004052913,0.00007164162,0.0000019971787,0.00005227387,0.000028283495,0.40494868,0.05999083,0.5300112,0.000043762328,0.00021511075],"about_ca_topic_score_codex":0.0000012928222,"about_ca_topic_score_gemma":8.315203e-8,"teacher_disagreement_score":0.6099963,"about_ca_system_score_codex":0.000014548729,"about_ca_system_score_gemma":0.000061732826,"threshold_uncertainty_score":0.870977},"labels":[],"label_agreement":null},{"id":"W2136501818","doi":"10.1007/978-3-642-40579-2_12","title":"Suffix Conjugates for a Class of Morphic Subshifts","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Bijection; Conjugacy class; Morphism; Alphabet; Closure (psychology); Mathematics; Discrete mathematics","score_opus":0.01596543641131196,"score_gpt":0.23155511198402745,"score_spread":0.2155896755727155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136501818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006969108,0.0006729774,0.99392426,0.00072918663,0.0013603674,0.00070100767,0.000016927539,0.00015368077,0.0017447015],"genre_scores_gemma":[0.4682566,0.00006465927,0.5280458,0.002065056,0.0005451298,0.0000561887,0.00001124392,0.000071573835,0.00088380324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966264,0.000029179946,0.00064559054,0.0013105394,0.0007092894,0.0006790018],"domain_scores_gemma":[0.9963825,0.0011293862,0.0004524672,0.0015010822,0.00037556497,0.00015904207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009346888,0.00050994364,0.0007171572,0.00065221725,0.00015457516,0.00035745229,0.003916685,0.00033771532,0.00005253212],"category_scores_gemma":[0.00011735123,0.00043932337,0.00021627922,0.00042333562,0.00090872124,0.0006181207,0.0010067698,0.000436513,0.00004586271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000119043225,0.00006375732,0.000043799628,0.00020092801,0.000032383494,0.00002565894,0.000905374,0.0047400612,0.0015853691,0.51595366,0.00024542448,0.47619167],"study_design_scores_gemma":[0.00034421237,0.0002636572,0.00007780489,0.00039681484,0.000009454143,0.000029865625,2.1036976e-7,0.46903569,0.006900165,0.520663,0.0017172889,0.00056184287],"about_ca_topic_score_codex":0.000027804139,"about_ca_topic_score_gemma":0.000021740447,"teacher_disagreement_score":0.4756298,"about_ca_system_score_codex":0.00011573877,"about_ca_system_score_gemma":0.0004162044,"threshold_uncertainty_score":0.99980587},"labels":[],"label_agreement":null},{"id":"W2137547347","doi":"10.1007/s10485-006-9013-z","title":"A General View of Approximation","year":2006,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Theory of computation; Mathematics; Category theory; Calculus (dental); Pure mathematics; Algorithm","score_opus":0.006711144074672512,"score_gpt":0.20955944418273773,"score_spread":0.2028483001080652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137547347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075353496,0.00022469445,0.91345733,0.00012671479,0.00012960056,0.00014417809,8.127527e-7,0.00016742211,0.010395728],"genre_scores_gemma":[0.9827549,0.000003569429,0.016925385,0.00012671549,0.0001241585,0.000014069152,0.000010207231,0.0000062654613,0.000034734294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991138,0.000018638882,0.00022879719,0.00023932013,0.00021673625,0.0001827327],"domain_scores_gemma":[0.9994969,0.00003704928,0.000093923314,0.00031432984,0.000022540418,0.000035283905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085025524,0.000113139504,0.00017098186,0.00004642336,0.000051694507,0.000046927053,0.00048174208,0.000062335006,0.000026761634],"category_scores_gemma":[0.0000033681083,0.00008632562,0.00004882758,0.00027962995,0.000043207292,0.00008506304,0.00010432514,0.00007286223,0.00001028564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020847435,0.000015237154,0.000020574926,0.000012317421,0.000003895827,0.0000010709782,0.00003218108,0.00017577576,0.0135838725,0.94592583,0.0005883554,0.03963882],"study_design_scores_gemma":[0.00016449092,0.000012903361,0.005532591,3.785894e-7,0.00000408208,0.000008141764,0.000004885883,0.004922881,0.023245724,0.96436256,0.0016232645,0.000118099786],"about_ca_topic_score_codex":0.000058563273,"about_ca_topic_score_gemma":0.0000013390688,"teacher_disagreement_score":0.9074014,"about_ca_system_score_codex":0.000021912729,"about_ca_system_score_gemma":0.000016562726,"threshold_uncertainty_score":0.35202566},"labels":[],"label_agreement":null},{"id":"W2138769606","doi":"10.1145/2490818","title":"Algebra-coalgebra duality in brzozowski's minimization algorithm","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundação para a Ciência e a Tecnologia; Centre National de la Recherche Scientifique; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Agence Nationale de la Recherche","keywords":"Coalgebra; Duality (order theory); Mathematics; Automaton; Correctness; Algebra over a field; Reachability; Discrete mathematics; Computer science; Algorithm; Pure mathematics; Theoretical computer science","score_opus":0.016456805134547968,"score_gpt":0.2515546325590415,"score_spread":0.2350978274244935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138769606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006430177,0.000022149805,0.9896711,0.0025024195,0.00036503008,0.00015664178,0.000011858197,0.00028414303,0.00055645074],"genre_scores_gemma":[0.68034315,0.0000049968703,0.31780106,0.001690916,0.000038856415,0.00002615612,0.000028483724,0.000009806734,0.00005656051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821454,0.00025855674,0.00036858267,0.00050229573,0.0003814789,0.00027451976],"domain_scores_gemma":[0.99831104,0.00086528494,0.000093530994,0.0005523815,0.00008849375,0.000089264715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004778799,0.00018931861,0.0002008083,0.00027747516,0.00019349846,0.00012179097,0.00079061167,0.000097416545,0.00009673936],"category_scores_gemma":[0.00006828116,0.00018601461,0.00009364541,0.00066258654,0.00006076703,0.00045597466,0.00002315733,0.0002118311,0.00016836025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011054831,0.0004496937,0.000074394375,0.00001307713,0.00002158615,0.00000885293,0.00033835074,0.26726255,0.000025340587,0.22692613,0.00013323748,0.5047357],"study_design_scores_gemma":[0.00046001197,0.00008714887,0.00799774,0.00001558791,0.0000041085787,0.00001815495,0.000015617274,0.5569309,0.00013852719,0.43382934,0.00032112334,0.00018176931],"about_ca_topic_score_codex":0.000028243452,"about_ca_topic_score_gemma":0.0000098419005,"teacher_disagreement_score":0.673913,"about_ca_system_score_codex":0.00007018301,"about_ca_system_score_gemma":0.000057504214,"threshold_uncertainty_score":0.7585456},"labels":[],"label_agreement":null},{"id":"W2141385438","doi":"10.1016/j.tcs.2012.03.046","title":"State complexity of union and intersection of square and reversal on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math> regular languages","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Intersection (aeronautics); Component (thermodynamics); Mathematics; Discrete mathematics; Computer science; Algorithm; Engineering; Physics","score_opus":0.014212729719191937,"score_gpt":0.24482203627869006,"score_spread":0.23060930655949813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141385438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88612586,0.000084528176,0.11286901,0.00015950514,0.00033844644,0.000038716433,0.000014020478,0.00006417453,0.00030571508],"genre_scores_gemma":[0.98477834,0.000020796606,0.014861665,0.00020797817,0.0001023191,0.000005385385,0.0000057959237,0.0000147382425,0.000003001814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981715,0.00013106808,0.0003148211,0.00044267604,0.0005356976,0.0004042325],"domain_scores_gemma":[0.9986227,0.00030521644,0.00021735123,0.0006024176,0.000059602997,0.00019271113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015049618,0.00017237011,0.00017275833,0.00011150922,0.00023419756,0.00015667344,0.000672309,0.00009741655,0.000007949799],"category_scores_gemma":[0.00010142661,0.00016539679,0.00008503438,0.0003284176,0.0024279982,0.00065085496,0.0009371734,0.0001965342,0.000017757446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005796088,0.00008290125,0.00003458515,0.0000868553,0.000018008697,0.000010358423,0.0015881278,0.00007158692,0.0025033322,0.98976004,0.000019584808,0.0057666325],"study_design_scores_gemma":[0.00028049998,0.000564022,0.0013868043,0.00022814603,0.000019759684,0.00009915484,0.00014784951,0.95588934,0.022714995,0.018472178,0.00002699298,0.00017023658],"about_ca_topic_score_codex":0.000051537907,"about_ca_topic_score_gemma":0.000004606418,"teacher_disagreement_score":0.9712879,"about_ca_system_score_codex":0.000012056196,"about_ca_system_score_gemma":0.000059330447,"threshold_uncertainty_score":0.89460605},"labels":[],"label_agreement":null},{"id":"W2141718869","doi":"10.1007/s00236-006-0027-7","title":"Representation and uniformization of algebraic transductions","year":2006,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo; Saint Mary's University","funders":"","keywords":"Algebraic number; Formalism (music); Computer science; Representation (politics); Stack (abstract data type); Theory of computation; Context (archaeology); Mathematics; Algebra over a field; Theoretical computer science; Programming language; Pure mathematics","score_opus":0.004762714598113413,"score_gpt":0.19911530751033274,"score_spread":0.19435259291221932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141718869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4608587,0.000030054824,0.5228857,0.0008749043,0.00010846755,0.0001414412,0.0000030750014,0.0001319344,0.014965746],"genre_scores_gemma":[0.98559797,0.000010330732,0.014253618,0.000058653142,0.000012586883,0.0000036192653,0.000010554988,0.0000018676569,0.000050812214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953926,0.000011179863,0.00021800995,0.000056759483,0.000099495126,0.00007527497],"domain_scores_gemma":[0.9996292,0.000046758032,0.000080034115,0.00019583649,0.0000302384,0.000017962899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010024341,0.0000448802,0.000071157345,0.00007581962,0.000050825256,0.000045086064,0.00014403288,0.000023295312,0.000010618529],"category_scores_gemma":[0.000015100384,0.000039454688,0.000019394083,0.00024925408,0.000034921206,0.0012521114,0.000031190542,0.0000278578,0.0000057874627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032076978,0.000040881983,0.00045371844,0.000059934722,0.00001148751,5.613657e-7,0.0024416298,0.00021716277,0.0024148286,0.9531176,0.0013120978,0.039926898],"study_design_scores_gemma":[0.0013422427,0.00016938221,0.07451053,0.000085800515,0.000038533075,0.00017560553,0.0009589911,0.6040679,0.04078922,0.27024278,0.0071309633,0.0004880485],"about_ca_topic_score_codex":0.000033732664,"about_ca_topic_score_gemma":0.0000026949679,"teacher_disagreement_score":0.6828748,"about_ca_system_score_codex":0.0000054217353,"about_ca_system_score_gemma":0.000012004094,"threshold_uncertainty_score":0.16089155},"labels":[],"label_agreement":null},{"id":"W2142901839","doi":"10.1142/s0129054115500197","title":"Automatic Sets of Rational Numbers","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Closure (psychology); Rational number; Set (abstract data type); Set theory; Rational point; Algebra over a field","score_opus":0.027225692747738194,"score_gpt":0.31808074829621114,"score_spread":0.29085505554847296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142901839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23322742,0.000031044292,0.7626878,0.0011424619,0.002332074,0.000041402305,0.00000309399,0.00001635645,0.00051834073],"genre_scores_gemma":[0.72256404,0.0000032190073,0.2772329,0.00009402811,0.00009430736,5.461758e-7,0.000001055352,0.0000023593213,0.000007568536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733496,0.000052413503,0.0007303279,0.00015616753,0.0015962595,0.00012989604],"domain_scores_gemma":[0.99564135,0.00019489617,0.00088039617,0.0002910867,0.002861189,0.00013110893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016160216,0.000089140376,0.00019137833,0.0006043689,0.000053112424,0.00019012523,0.0030782528,0.000023320967,0.000024479446],"category_scores_gemma":[0.00025156164,0.000077896264,0.00010242587,0.0006348613,0.00040141647,0.002347102,0.00035115593,0.00008788793,0.000009521417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029741528,0.00063218427,0.0029053336,0.000019351433,0.00019507634,0.00003626988,0.004327978,0.015506086,0.0056334543,0.608738,0.0031179306,0.3588586],"study_design_scores_gemma":[0.0012675673,0.0003736122,0.014124458,0.00020626112,0.000014328981,0.00069819076,0.00009675031,0.87264895,0.010610646,0.098638885,0.0011133025,0.00020702071],"about_ca_topic_score_codex":0.000011798779,"about_ca_topic_score_gemma":0.0000012456926,"teacher_disagreement_score":0.85714287,"about_ca_system_score_codex":0.00011227582,"about_ca_system_score_gemma":0.0011680346,"threshold_uncertainty_score":0.57202107},"labels":[],"label_agreement":null},{"id":"W2143147654","doi":"10.1016/j.jpaa.2004.10.012","title":"Decidable locally finite discriminator varieties arising from dihedral varieties of groups","year":2004,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Decidability; Dihedral group; Discriminator; Class (philosophy); Variety (cybernetics); Order (exchange); Pure mathematics; Combinatorics; Discrete mathematics; Group (periodic table); Statistics; Artificial intelligence; Computer science","score_opus":0.008434117271399946,"score_gpt":0.20577376792626156,"score_spread":0.19733965065486161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143147654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5037101,0.0008423803,0.49418923,0.00043626566,0.00023747484,0.00006245838,0.0000042285096,0.000025086574,0.00049278216],"genre_scores_gemma":[0.9708765,0.00006206992,0.028512744,0.00032778824,0.00018760662,0.0000019339793,0.0000016789178,0.000012396617,0.000017291617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857384,0.000029043276,0.0005430176,0.0002083758,0.00040537553,0.00024035749],"domain_scores_gemma":[0.9988449,0.00021861774,0.00045302257,0.00026243704,0.00009054128,0.00013047797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039925252,0.00018773007,0.00041727175,0.00012251265,0.00012775771,0.00023311636,0.00061254273,0.000105926585,0.000018642242],"category_scores_gemma":[0.00003148994,0.00014302201,0.00011273416,0.00019892589,0.00014088913,0.0005542372,0.00021608673,0.0002818736,0.00000365879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006952781,0.00016165979,0.00016539771,0.00003964432,0.0001005453,0.000043086813,0.004135792,0.0006356521,0.012186191,0.9675012,0.00020871365,0.014752549],"study_design_scores_gemma":[0.0010808399,0.00022232378,0.0030790372,0.00010773292,0.000057253037,0.000052446045,0.0011177952,0.00042075058,0.026442368,0.96689695,0.00029865582,0.00022385924],"about_ca_topic_score_codex":0.000022077102,"about_ca_topic_score_gemma":0.000006014895,"teacher_disagreement_score":0.4671664,"about_ca_system_score_codex":0.000027498727,"about_ca_system_score_gemma":0.00011922422,"threshold_uncertainty_score":0.58322686},"labels":[],"label_agreement":null},{"id":"W2143276068","doi":"10.3233/fun-2007-761-208","title":"Intercode Regular Languages","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Programming language; Linguistics; Philosophy","score_opus":0.006680356628731117,"score_gpt":0.25572964456291125,"score_spread":0.24904928793418013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143276068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1297616,0.000099245764,0.7874043,0.0005066836,0.00034043065,0.00015343222,0.000003240587,0.00048676814,0.08124431],"genre_scores_gemma":[0.9414586,0.00000626088,0.054376405,0.0032440948,0.00007344459,0.0000056059503,0.0000083239565,0.000007982371,0.0008192728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998965,0.0000136452545,0.00032735028,0.00011901705,0.00023998215,0.0003349992],"domain_scores_gemma":[0.99914145,0.00009165632,0.00008628329,0.0005526723,0.00002207442,0.00010586989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006993034,0.000114405804,0.00011848872,0.0001188286,0.000085101055,0.00020402265,0.0008075253,0.000042249678,0.00012744374],"category_scores_gemma":[0.000029807057,0.00009567845,0.00005486189,0.00021214769,0.000046494908,0.001056631,0.00031679508,0.00010039315,0.00069411926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012205327,0.00008324019,0.0005963342,0.000071435345,0.00004608227,0.00004896156,0.008699308,0.000008088846,0.001999388,0.6626354,0.013979312,0.3118203],"study_design_scores_gemma":[0.0036139446,0.0007999262,0.020918299,0.0005258826,0.00004600236,0.0006787804,0.023006486,0.09457386,0.13142085,0.062058896,0.6598577,0.0024994097],"about_ca_topic_score_codex":0.000007752241,"about_ca_topic_score_gemma":0.0000031547322,"teacher_disagreement_score":0.811697,"about_ca_system_score_codex":0.000050923503,"about_ca_system_score_gemma":0.00001598064,"threshold_uncertainty_score":0.89217305},"labels":[],"label_agreement":null},{"id":"W2143645603","doi":"10.1016/j.aam.2005.05.007","title":"On the Stanley–Wilf limit of 4231-avoiding permutations and a conjecture of Arratia","year":2005,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Conjecture; Permutation (music); Mathematics; Combinatorics; Limit (mathematics); Class (philosophy); Parity of a permutation; Sequence (biology); Discrete mathematics; Cyclic permutation; Symmetric group; Computer science; Physics; Mathematical analysis","score_opus":0.009003227470727602,"score_gpt":0.23913186602539935,"score_spread":0.23012863855467175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143645603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33685046,0.0010611416,0.64715666,0.0005927067,0.00005351634,0.00041311086,0.000008514287,0.000057859645,0.013806055],"genre_scores_gemma":[0.8897727,0.00008601089,0.10999182,0.00010410125,0.0000105516565,0.000017321057,4.6532816e-7,0.0000060956168,0.000010903483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927855,0.00001788383,0.00028257645,0.00014048602,0.00016538068,0.00011514806],"domain_scores_gemma":[0.9980897,0.0013474228,0.00019199203,0.00033570593,0.000016398162,0.000018788853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033592436,0.00009836169,0.00018775888,0.000059454913,0.000054799777,0.000019125902,0.0003445163,0.000031673215,0.000008379304],"category_scores_gemma":[0.00009330753,0.00006632658,0.00002297356,0.00020789038,0.00010205463,0.00013105111,0.00007782849,0.0001172882,0.0000027209087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000209233,0.00006452653,0.000009910782,0.000081179045,0.0000041676026,3.2359006e-7,0.0050617955,0.0015074469,0.002037597,0.98135054,0.000017210568,0.009863228],"study_design_scores_gemma":[0.0002729848,0.00005319044,0.000038527378,0.00015615388,0.0000073930723,0.000005887761,0.0020222978,0.05580134,0.024071641,0.9170743,0.00036903945,0.00012724091],"about_ca_topic_score_codex":4.6278274e-7,"about_ca_topic_score_gemma":0.0000071648733,"teacher_disagreement_score":0.55292225,"about_ca_system_score_codex":0.000012916246,"about_ca_system_score_gemma":0.000015709225,"threshold_uncertainty_score":0.27047196},"labels":[],"label_agreement":null},{"id":"W2144782101","doi":"10.1142/s0129054111008647","title":"OVERLAP-FREE LANGUAGES AND SOLID CODES","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Undecidable problem; Decidability; Prefix code; Property (philosophy); Computer science; Linear code; Mathematics; Prime (order theory); Regular language; Discrete mathematics; Block code; Algorithm; Theoretical computer science; Combinatorics; Automaton","score_opus":0.018678284295213607,"score_gpt":0.30702943961086426,"score_spread":0.28835115531565064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144782101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18287152,0.00008889167,0.81426275,0.00053520006,0.0010597535,0.000027983015,0.0000030239287,0.000017914314,0.0011329608],"genre_scores_gemma":[0.7524049,0.000024372854,0.2473252,0.00013679199,0.000096464704,3.493662e-7,2.2525894e-7,0.0000019789134,0.000009715966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872535,0.000025208858,0.00035495436,0.00014995712,0.00062747573,0.00011703064],"domain_scores_gemma":[0.9983093,0.000107561595,0.0003746248,0.0003087596,0.0008226325,0.000077126024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007408486,0.000073302755,0.00012869478,0.00042069607,0.000077234516,0.00021870322,0.003060969,0.00001752423,0.000017411037],"category_scores_gemma":[0.00012208002,0.00006116345,0.00005353617,0.0002713669,0.00038392193,0.0018488246,0.0006230033,0.00007665598,0.0000032639164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022033659,0.0002595083,0.0040641646,0.000007937346,0.00010414194,0.00006365486,0.004398961,0.00014569736,0.008480542,0.7472579,0.00051028735,0.2346852],"study_design_scores_gemma":[0.0028519118,0.0012337924,0.28605378,0.0005118232,0.000043915414,0.003284777,0.00054451515,0.203564,0.09107722,0.4078821,0.0022118494,0.00074031693],"about_ca_topic_score_codex":0.00001804469,"about_ca_topic_score_gemma":0.0000022395345,"teacher_disagreement_score":0.5695334,"about_ca_system_score_codex":0.000030898413,"about_ca_system_score_gemma":0.00018151742,"threshold_uncertainty_score":0.5688093},"labels":[],"label_agreement":null},{"id":"W2144860383","doi":"10.25596/jalc-2004-121","title":"Bimachines and Structurally-Reversed Automata","year":2004,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Rational function; Nondeterministic algorithm; Computer science; Finite-state machine; Automaton; Function (biology); Word (group theory); Simple (philosophy); Trigonometric functions; Point (geometry); Range (aeronautics); Preprocessor; Power (physics); Algorithm; Theoretical computer science; Mathematics; Pure mathematics; Artificial intelligence; Engineering","score_opus":0.004140554167445769,"score_gpt":0.18249941646308462,"score_spread":0.17835886229563885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144860383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8914729,0.000536816,0.08890583,0.005674516,0.0011222197,0.00043015162,0.000036077494,0.0016736462,0.010147888],"genre_scores_gemma":[0.9695046,0.00011338094,0.02874632,0.00069200026,0.00011119532,0.0000019467823,0.000014331005,0.000022719985,0.0007935086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817383,0.00006138221,0.00021105117,0.0006513809,0.0003667631,0.00053561275],"domain_scores_gemma":[0.99868983,0.0000657843,0.000120856006,0.0008250356,0.00006871207,0.00022977167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022094618,0.00031076447,0.00030295897,0.00024056903,0.0004086682,0.00022636718,0.0013512056,0.00012920072,0.00005011095],"category_scores_gemma":[0.000029626828,0.00028545718,0.00010659471,0.00049869705,0.0001580615,0.0032239698,0.00100927,0.00021657164,0.0001441594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006277844,0.00020453743,0.0007845218,0.00012397057,0.00022605347,0.0006279461,0.0057284725,0.0006760379,0.010021386,0.84902304,0.0022233867,0.13029788],"study_design_scores_gemma":[0.037214153,0.00228742,0.27079013,0.0008904908,0.0007913474,0.0022196206,0.011557623,0.099544756,0.012935437,0.43784922,0.11542746,0.008492362],"about_ca_topic_score_codex":0.00026179777,"about_ca_topic_score_gemma":0.000025235971,"teacher_disagreement_score":0.41117382,"about_ca_system_score_codex":0.00016485924,"about_ca_system_score_gemma":0.00015143452,"threshold_uncertainty_score":0.99995977},"labels":[],"label_agreement":null},{"id":"W2145436131","doi":"10.1080/00207160.2012.704994","title":"Undecidability of state complexity","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Undecidable problem; Alphabet; Mathematics; State (computer science); Regular language; Computational complexity theory; Discrete mathematics; Algebra over a field; Automaton; Algorithm; Theoretical computer science; Pure mathematics; Computer science; Decidability; Linguistics","score_opus":0.038232645543636395,"score_gpt":0.2957965192233195,"score_spread":0.25756387367968314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145436131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22171581,0.000060929244,0.7762326,0.000293973,0.0013625958,0.000036352114,0.0000036878173,0.000016855096,0.00027720074],"genre_scores_gemma":[0.63490003,0.000006462662,0.3647624,0.000100238445,0.00021628295,2.8065557e-7,3.6899417e-7,0.000004107911,0.0000098059445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837005,0.000060004473,0.0007013494,0.00007160889,0.00064479874,0.00015217606],"domain_scores_gemma":[0.9980602,0.00032363963,0.00072230713,0.00026340736,0.00053422485,0.00009620008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010292195,0.000099388504,0.0002529105,0.0001450544,0.000018308338,0.00006893539,0.0014786819,0.000026135873,0.000030118417],"category_scores_gemma":[0.000051963965,0.00007827578,0.00015163457,0.000103066086,0.000078525656,0.0007039355,0.00032092107,0.00011716666,0.000012145956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029029616,0.0021558127,0.00460815,0.00010077585,0.00048186837,0.000030318715,0.008673404,0.00062028045,0.0013169266,0.8986878,0.0021987068,0.08109697],"study_design_scores_gemma":[0.0011300594,0.00024254197,0.024991687,0.0002976979,0.000025160838,0.0010373567,0.00009402782,0.14452247,0.01095439,0.8138855,0.0025059427,0.0003131395],"about_ca_topic_score_codex":0.0000020446405,"about_ca_topic_score_gemma":3.228089e-7,"teacher_disagreement_score":0.41318426,"about_ca_system_score_codex":0.00005616864,"about_ca_system_score_gemma":0.00004962558,"threshold_uncertainty_score":0.31919935},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07281263454795484,"score_gpt":0.35218667728933695,"score_spread":0.2793740427413821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146148441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3507104,0.000040319108,0.6470787,0.0004983698,0.001468452,0.0000730738,0.00000760164,0.000011309793,0.00011179986],"genre_scores_gemma":[0.80458045,0.0000066383054,0.19516724,0.00008032284,0.00015537249,0.0000019489946,0.0000017686839,0.0000029463777,0.0000033381186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99757123,0.000062457926,0.0008518749,0.00014000926,0.0011263852,0.00024802436],"domain_scores_gemma":[0.9966839,0.00010957306,0.00081629364,0.00031241195,0.0019608526,0.0001169788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019569574,0.00009873394,0.00018817153,0.00057037047,0.00014343797,0.00018782153,0.0026198442,0.000021626107,0.00004316606],"category_scores_gemma":[0.00009064209,0.000083148334,0.00012296512,0.00055527326,0.00059695716,0.005780163,0.0006219483,0.0000938359,0.0000047353883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038973503,0.0009947184,0.020700201,0.000029547598,0.00015198083,0.0000023549806,0.006048269,0.0014875856,0.040924247,0.66432863,0.00036486812,0.26492864],"study_design_scores_gemma":[0.003354927,0.0014435379,0.47371158,0.00051372877,0.00007943999,0.0012105017,0.0010952636,0.2246967,0.1893483,0.0999705,0.0038158519,0.0007596727],"about_ca_topic_score_codex":0.000030336725,"about_ca_topic_score_gemma":0.000009405591,"teacher_disagreement_score":0.5643581,"about_ca_system_score_codex":0.0001416856,"about_ca_system_score_gemma":0.0004286028,"threshold_uncertainty_score":0.48683655},"labels":[],"label_agreement":null},{"id":"W2146441371","doi":"10.1142/s0129054114400103","title":"NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Monomial; Mathematics; Combinatorics; Upper and lower bounds; Time complexity; Polynomial; State (computer science); PSPACE; Matching (statistics); Discrete mathematics; Constant (computer programming); Regular language; NP; Computational complexity theory; Automaton; Computer science; Algorithm; Turing machine; Theoretical computer science","score_opus":0.029026363745375795,"score_gpt":0.3105459000499086,"score_spread":0.2815195363045328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146441371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17881542,0.00000953694,0.8185256,0.00076167844,0.0014784344,0.00004427631,0.0000052246796,0.000012433606,0.00034740425],"genre_scores_gemma":[0.7412499,0.0000039940305,0.25852248,0.000094349205,0.000113456794,4.5986826e-7,0.0000010713866,0.000002624307,0.000011678372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973267,0.00006925968,0.00088624726,0.00019939289,0.0013656527,0.00015278503],"domain_scores_gemma":[0.9957126,0.00023439743,0.0012258985,0.00035405243,0.002381303,0.00009175515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018900769,0.00009922141,0.00023653398,0.00057231117,0.000086440086,0.00017707505,0.0031847926,0.000018644221,0.000021907314],"category_scores_gemma":[0.00025270387,0.00008519683,0.00012195308,0.0004727074,0.0009964786,0.0013636327,0.00040094552,0.00010195223,0.000005657768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032663367,0.00040886042,0.0013341364,0.000021831278,0.00008441136,0.00001619534,0.0007233202,0.0041322345,0.017377062,0.72626036,0.0001992523,0.24940968],"study_design_scores_gemma":[0.0009182829,0.00059481413,0.05570187,0.00024441327,0.000013422278,0.00066368654,0.000013074408,0.5578869,0.027338166,0.35496214,0.0014233658,0.00023987802],"about_ca_topic_score_codex":0.000008707123,"about_ca_topic_score_gemma":0.0000013328756,"teacher_disagreement_score":0.5624345,"about_ca_system_score_codex":0.00006224561,"about_ca_system_score_gemma":0.00051352935,"threshold_uncertainty_score":0.591819},"labels":[],"label_agreement":null},{"id":"W2146748072","doi":"10.1145/2590775","title":"Avoiding Three Consecutive Blocks of the Same Size and Same Sum","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"semigroups and automata theory","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Alphabet; Combinatorics; Block size; Mathematics; Word (group theory); Discrete mathematics; Computer science; Linguistics; Geometry","score_opus":0.01285349044668734,"score_gpt":0.22524436285073757,"score_spread":0.21239087240405022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146748072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98221487,0.00033317163,0.005750253,0.010729552,0.0006476604,0.000052641335,0.000001286413,0.000008008999,0.0002625655],"genre_scores_gemma":[0.99431443,0.00001378685,0.004469624,0.0009884224,0.00010875995,2.5076275e-7,6.802421e-9,0.0000042496963,0.00010046064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990443,0.00023251206,0.00025071827,0.000087418644,0.00025653615,0.00012849532],"domain_scores_gemma":[0.99715114,0.0013838571,0.00046325766,0.00087574584,0.00008288219,0.00004313109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014276784,0.00007925224,0.00018008889,0.000025674763,0.0001694058,0.000059913902,0.002843084,0.000034997705,0.0000075572807],"category_scores_gemma":[0.0029383537,0.00003795587,0.0001291352,0.00013715257,0.00013613857,0.00015762159,0.0012590421,0.00032039697,0.0000011216524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002381446,0.000420999,0.0897375,0.00014018132,0.00078027963,0.00004441841,0.026346859,0.0005204708,0.37554485,0.3904763,0.034764104,0.080985926],"study_design_scores_gemma":[0.0008360317,0.00015794764,0.10221147,0.00039742055,0.000055133358,0.0007276332,0.00040684847,0.004241477,0.043245997,0.8457233,0.0018313414,0.00016541674],"about_ca_topic_score_codex":0.000013497354,"about_ca_topic_score_gemma":0.0000066723483,"teacher_disagreement_score":0.455247,"about_ca_system_score_codex":0.000016765283,"about_ca_system_score_gemma":0.00004670043,"threshold_uncertainty_score":0.5283205},"labels":[],"label_agreement":null},{"id":"W2146755739","doi":"10.1016/j.jalgebra.2011.10.006","title":"Primitive orthogonal idempotents for R-trivial monoids","year":2011,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University; Université du Québec à Montréal","funders":"","keywords":"Monoid; Mathematics; Free monoid; Equivalence (formal languages); Syntactic monoid; Pure mathematics; Construct (python library); Combinatorics; Algebra over a field; Computer science","score_opus":0.03445370049432931,"score_gpt":0.23481080704051682,"score_spread":0.20035710654618752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146755739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46930587,0.00015020162,0.5284473,0.00024168972,0.0008371024,0.000092871414,0.000003077669,0.000027487962,0.0008944458],"genre_scores_gemma":[0.91510254,0.000015094324,0.08407283,0.00042618054,0.00030174514,0.0000026109174,4.0302834e-7,0.000009162445,0.000069440604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897677,0.000045945864,0.00038293982,0.00013447662,0.0002488577,0.00021098454],"domain_scores_gemma":[0.9990141,0.00011344449,0.0003634564,0.00018638826,0.000200603,0.00012200875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006282019,0.00010403584,0.00020417216,0.0001247411,0.00006752827,0.00005215536,0.0007826369,0.000055626206,0.000033611745],"category_scores_gemma":[0.000087130604,0.000080165,0.000205505,0.00012702684,0.000035177774,0.0006947912,0.00010310921,0.00014399042,0.000013231176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039460498,0.0006615741,0.004170131,0.00003634322,0.00036626947,0.0002530291,0.005318985,0.00001215013,0.008762789,0.7676349,0.00872445,0.20366475],"study_design_scores_gemma":[0.004699778,0.0029132962,0.16510896,0.0002056781,0.00011793244,0.0010930115,0.00032063425,0.008059889,0.05837501,0.7517993,0.0065387962,0.00076773856],"about_ca_topic_score_codex":0.0000016696829,"about_ca_topic_score_gemma":3.962297e-7,"teacher_disagreement_score":0.44579667,"about_ca_system_score_codex":0.000026279637,"about_ca_system_score_gemma":0.00010430225,"threshold_uncertainty_score":0.3269034},"labels":[],"label_agreement":null},{"id":"W2147060737","doi":"10.1007/978-3-642-14455-4_25","title":"Schema for Parallel Insertion and Deletion","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Computer science; Schema (genetic algorithms); Parallel computing; Regular language; Theoretical computer science; Genetics; Information retrieval; Automaton","score_opus":0.013283973227594005,"score_gpt":0.2348000085035534,"score_spread":0.2215160352759594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147060737","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078634627,0.00033262832,0.9959896,0.0009073664,0.001065778,0.00039835685,0.0000032774497,0.00014673598,0.00036987543],"genre_scores_gemma":[0.087057166,0.000052186188,0.9107184,0.0015198061,0.00042753122,0.000023734743,0.000007739856,0.000026796823,0.00016667682],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978092,0.000013134656,0.0003057363,0.0010691986,0.00039655739,0.00040618549],"domain_scores_gemma":[0.9984123,0.00035176257,0.00018288539,0.0007896919,0.00014717442,0.000116158175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007827272,0.00032679783,0.0003123685,0.00039792416,0.00025689788,0.0004274344,0.0013867922,0.000350916,0.0000067217024],"category_scores_gemma":[0.00007935813,0.00029226742,0.000077662466,0.00019133309,0.00045697993,0.00054276176,0.00061301445,0.0005011892,0.000010442394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008336943,0.000016276359,0.000017746506,0.000045181096,0.0000052994137,0.000009064614,0.00027356338,0.0006810535,0.0031313421,0.14172259,0.000012000194,0.8540776],"study_design_scores_gemma":[0.0002945509,0.00013263951,0.00016050007,0.00015594861,0.0000050721724,0.000060437545,7.032411e-8,0.41550228,0.0031215395,0.5770029,0.0031377142,0.00042636823],"about_ca_topic_score_codex":0.0000075696944,"about_ca_topic_score_gemma":0.000033759014,"teacher_disagreement_score":0.85365117,"about_ca_system_score_codex":0.000070568814,"about_ca_system_score_gemma":0.00017178456,"threshold_uncertainty_score":0.999953},"labels":[],"label_agreement":null},{"id":"W2147763027","doi":"10.1016/j.tcs.2008.09.056","title":"Quasiperiodic and Lyndon episturmian words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Quasiperiodic function; Mathematics; Generalization; Morphism; Word (group theory); Characterization (materials science); Class (philosophy); Directive; Pure mathematics; Combinatorics; Computer science; Artificial intelligence; Mathematical analysis; Physics; Geometry","score_opus":0.008835510490404727,"score_gpt":0.2206555159525293,"score_spread":0.21182000546212457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147763027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28704304,0.00009765206,0.70836276,0.0009943016,0.00037618668,0.000085857195,5.744578e-7,0.00027729073,0.0027623512],"genre_scores_gemma":[0.90325004,0.00002378651,0.09560213,0.0009904964,0.00010494028,0.0000042965094,2.7880318e-7,0.0000067565816,0.000017298102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977261,0.000094959214,0.0002318285,0.0007725925,0.00058745453,0.0005870753],"domain_scores_gemma":[0.9984695,0.00020384211,0.000050861003,0.0008399123,0.00007512267,0.0003608066],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010378689,0.00019486685,0.00022121698,0.0001747717,0.0008117867,0.00034113077,0.0020013554,0.000050755,0.000036206926],"category_scores_gemma":[0.000061272774,0.0001544893,0.000050246286,0.0009393462,0.0053945654,0.00078040455,0.0011980201,0.00018335588,0.00007821452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033073625,0.000032631306,0.00020694753,0.0000036941594,0.0000018135084,0.000054468266,0.0011064688,0.0000040206046,0.00042729653,0.95214796,0.00006698409,0.045944422],"study_design_scores_gemma":[0.000508093,0.00037307708,0.016822822,0.00004506387,0.000004382343,0.0013448556,0.000020859792,0.67114526,0.004165991,0.3043686,0.0006190895,0.0005818985],"about_ca_topic_score_codex":0.0000053415915,"about_ca_topic_score_gemma":3.07044e-7,"teacher_disagreement_score":0.67114127,"about_ca_system_score_codex":0.000036775506,"about_ca_system_score_gemma":0.00011485919,"threshold_uncertainty_score":0.9973122},"labels":[],"label_agreement":null},{"id":"W2148956539","doi":"10.2178/jsl/1278682213","title":"Quantifier elimination in valued Ore modules","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantifier elimination; Valuation (finance); Mathematics; Quantifier (linguistics); Residue field; Property (philosophy); Independence (probability theory); Field (mathematics); Pure mathematics; Discrete mathematics; Computer science; Statistics; Artificial intelligence","score_opus":0.015861606892785717,"score_gpt":0.2604011465616606,"score_spread":0.24453953966887487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148956539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9375322,0.000119370394,0.059128504,0.0014323125,0.00093062734,0.000041991436,3.3624707e-7,0.000022176784,0.00079248234],"genre_scores_gemma":[0.98184913,0.000019488689,0.017597897,0.0002841832,0.00017197682,8.7117803e-7,2.3314769e-7,0.000004347898,0.00007185576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908173,0.00005839006,0.00034086776,0.000115354225,0.00024389471,0.00015978167],"domain_scores_gemma":[0.999283,0.000073989584,0.00024156545,0.00023247834,0.00010832307,0.000060618146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094926864,0.000081638034,0.00017827802,0.00023494472,0.0000356277,0.00011580482,0.00066722545,0.00007417112,0.000025195557],"category_scores_gemma":[0.00013498489,0.000058398957,0.00007272403,0.00025842804,0.00003381753,0.00071609113,0.000067945504,0.0003244979,0.000017364437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009314194,0.00016215509,0.0013258678,0.000010615601,0.000010985966,0.00010734148,0.001031453,0.000114220005,0.04411232,0.9033015,0.0004160444,0.049398217],"study_design_scores_gemma":[0.0013586006,0.00029207428,0.34640542,0.000104557126,0.000015277372,0.00097331003,0.00027955556,0.06364047,0.012039174,0.5730085,0.0015188077,0.00036426252],"about_ca_topic_score_codex":0.000006837349,"about_ca_topic_score_gemma":0.000007131606,"teacher_disagreement_score":0.34507954,"about_ca_system_score_codex":0.000018853656,"about_ca_system_score_gemma":0.000042584135,"threshold_uncertainty_score":0.23814403},"labels":[],"label_agreement":null},{"id":"W2149642761","doi":"10.2307/2695103","title":"Number of variables is equivalent to space","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arity; Mathematics; Set (abstract data type); Sequence (biology); PSPACE; Discrete mathematics; Space (punctuation); Turing; Quantifier (linguistics); DSPACE; Universe; Combinatorics; Computational complexity theory; Algorithm; Computer science; Artificial intelligence","score_opus":0.02309942492369837,"score_gpt":0.28764868821992434,"score_spread":0.26454926329622597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149642761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71149904,0.00042071642,0.2637212,0.006995613,0.0007165393,0.000086552944,0.0000019601139,0.000035990222,0.016522402],"genre_scores_gemma":[0.9625824,0.00014509587,0.03475369,0.0017540893,0.00020631295,7.55024e-7,7.177367e-8,0.0000063933653,0.00055117375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988349,0.000052977575,0.0004027859,0.00013062316,0.00035443116,0.00022425408],"domain_scores_gemma":[0.9989681,0.00009306929,0.0003147231,0.00031907955,0.00016130047,0.00014367996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006166722,0.00010444072,0.00028785903,0.00011473593,0.000034786866,0.000051753803,0.0008715022,0.00004865395,0.00031427035],"category_scores_gemma":[0.000058055935,0.000075119206,0.00012430079,0.00040222262,0.000026203112,0.00028370688,0.00018386444,0.00011749322,0.00008513418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008288222,0.0007058302,0.015386541,0.0000718175,0.00020142978,0.00049166504,0.006002048,0.0006446082,0.02917047,0.8693613,0.037610605,0.040270824],"study_design_scores_gemma":[0.0026457973,0.0014473143,0.044623673,0.0007839345,0.000114335824,0.0086994,0.00089132716,0.0058237654,0.033165183,0.8015763,0.09919829,0.001030671],"about_ca_topic_score_codex":0.000014187,"about_ca_topic_score_gemma":2.8313679e-7,"teacher_disagreement_score":0.25108337,"about_ca_system_score_codex":0.000035528,"about_ca_system_score_gemma":0.00006352983,"threshold_uncertainty_score":0.344104},"labels":[],"label_agreement":null},{"id":"W2149893488","doi":"10.26493/1855-3974.46.b2f","title":"Deciding the deterministic property for soliton graphs","year":2009,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Automaton; Discrete mathematics; Combinatorics; Matching (statistics); Deterministic automaton; Algorithm; Finite-state machine; Theoretical computer science; Computer science","score_opus":0.031894086918758995,"score_gpt":0.26342375152607067,"score_spread":0.23152966460731167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149893488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037698008,0.00031829436,0.93329316,0.010328002,0.00045261774,0.0019393216,0.0000072874814,0.0007082267,0.015255102],"genre_scores_gemma":[0.97539014,0.0000050207136,0.022551242,0.0013930986,0.00003467964,0.00008040215,0.0000017446027,0.00001325436,0.00053041417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986337,0.00006741668,0.0003846991,0.00033491186,0.00022966988,0.00034962583],"domain_scores_gemma":[0.998171,0.00066372653,0.00016016854,0.00085517095,0.000068525645,0.00008145726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009005176,0.00019377051,0.00027271628,0.000058346875,0.0002919057,0.00025871187,0.0011937501,0.00005104787,0.0000070122096],"category_scores_gemma":[0.00024454272,0.00009816316,0.00016075296,0.00018800268,0.0000730393,0.00030259433,0.000075798496,0.00008935814,0.00004042886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014581752,0.00011826532,0.000009563149,0.000063248444,0.00002397135,0.00001530854,0.0018821938,0.0000020138446,0.0028936893,0.9449989,0.0027921288,0.047186114],"study_design_scores_gemma":[0.000496422,0.0002169604,0.00007568919,0.00013124074,0.000020386795,0.00007725044,0.00013938204,0.0758396,0.0026275183,0.91613364,0.0039722184,0.00026967432],"about_ca_topic_score_codex":0.0000030361105,"about_ca_topic_score_gemma":0.0000011187637,"teacher_disagreement_score":0.9376921,"about_ca_system_score_codex":0.000016432832,"about_ca_system_score_gemma":0.000046326764,"threshold_uncertainty_score":0.40029776},"labels":[],"label_agreement":null},{"id":"W2152005431","doi":"10.1109/12.862220","title":"Continuous learning automata solutions to the capacity assignment problem","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network packet; Computer science; Heuristic; Simulated annealing; Automaton; Learning automata; Set (abstract data type); Mathematical optimization; Class (philosophy); Assignment problem; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Computer network","score_opus":0.01753760132844699,"score_gpt":0.21251788692109483,"score_spread":0.19498028559264785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152005431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068342397,0.000011556862,0.9854761,0.0046963375,0.0008038623,0.0003636419,0.00000868964,0.0008025006,0.0010030781],"genre_scores_gemma":[0.9526874,0.000016256241,0.044431414,0.00172113,0.0000681624,0.000086200555,0.0000010774523,0.000017742725,0.00097063906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982569,0.00020965704,0.00025632489,0.00046287518,0.00034463927,0.0004696067],"domain_scores_gemma":[0.99885297,0.00020750458,0.00004819894,0.0006879341,0.000043836586,0.00015958532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042514666,0.00020694864,0.00017928408,0.00011157695,0.0008608213,0.00028222625,0.0010355663,0.000057967754,0.000115638264],"category_scores_gemma":[0.0000020283455,0.00016240025,0.00012226922,0.00058814936,0.00006335358,0.00029713794,0.000008626394,0.00036873773,0.00067072775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007547553,0.00016481495,0.0000015661767,0.0000035804867,0.000038475922,0.000005360863,0.0013035419,0.4656299,0.00023794209,0.0015410727,0.0030762167,0.52799],"study_design_scores_gemma":[0.0006023038,0.00045558112,0.00022438895,0.000105460575,0.00002569651,0.00011023316,0.00008130094,0.9340823,0.0019158582,0.00065737264,0.061256737,0.00048271113],"about_ca_topic_score_codex":0.00008757124,"about_ca_topic_score_gemma":0.000016910742,"teacher_disagreement_score":0.9458531,"about_ca_system_score_codex":0.000106251384,"about_ca_system_score_gemma":0.000044188466,"threshold_uncertainty_score":0.8621072},"labels":[],"label_agreement":null},{"id":"W2152857032","doi":"10.3233/fi-2012-750","title":"Sheng Yu (1950–2012) In Memoriam","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Computer science; Philosophy","score_opus":0.01328618173797886,"score_gpt":0.23743671798966437,"score_spread":0.22415053625168552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152857032","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56513315,0.0011985748,0.23433563,0.0034087526,0.014156482,0.0012609323,0.000019603889,0.0012785494,0.1792083],"genre_scores_gemma":[0.97660416,0.000016707336,0.019712463,0.0029866095,0.0003214457,0.000037254173,0.000008202299,0.000010338791,0.00030281578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998496,0.000041757587,0.00044070964,0.000118406606,0.0003052802,0.0005978264],"domain_scores_gemma":[0.999006,0.000114287745,0.00010478996,0.00058618013,0.00001611738,0.00017265782],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007729043,0.00015806366,0.00018734002,0.00017097486,0.00008406918,0.00018961425,0.0008079284,0.00006036066,0.0003111452],"category_scores_gemma":[0.00003264602,0.00013669433,0.0000542197,0.00035805904,0.00003993306,0.0044577047,0.0004107475,0.00016378143,0.0013895473],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020414598,0.00057591015,0.01909864,0.00023197675,0.00006470859,0.000011910765,0.039742496,0.000058561967,0.00039312674,0.73986566,0.0702501,0.12968652],"study_design_scores_gemma":[0.003252092,0.00024576188,0.06882788,0.0002903248,0.000025099644,0.00017196263,0.0040914374,0.09487398,0.0032537668,0.017820217,0.8054358,0.0017117132],"about_ca_topic_score_codex":0.000014118102,"about_ca_topic_score_gemma":0.0000038042535,"teacher_disagreement_score":0.7351857,"about_ca_system_score_codex":0.00010130118,"about_ca_system_score_gemma":0.000030797557,"threshold_uncertainty_score":0.999388},"labels":[],"label_agreement":null},{"id":"W2153168967","doi":"10.1016/s0019-3577(08)80005-5","title":"On the ring of approximation triples attached to a class of extremal real numbers","year":2008,"lang":"en","type":"preprint","venue":"Indagationes Mathematicae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Ring (chemistry); Class (philosophy); Point (geometry); Quotient; Dimension (graph theory); Algebraic number; Space (punctuation); Quotient ring; Polynomial; Discrete mathematics; Combinatorics; Pure mathematics; Polynomial ring; Mathematical analysis; Computer science; Geometry","score_opus":0.04345749382971566,"score_gpt":0.2784454634665455,"score_spread":0.23498796963682983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153168967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.616146,0.000016291122,0.3736557,0.0008778241,0.00018272396,0.0007332169,0.000016312893,0.000113848226,0.008258052],"genre_scores_gemma":[0.94772327,0.000015096653,0.051925022,0.000066820765,0.00004595113,0.00010732014,0.000010336,0.00002040117,0.00008578211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782807,0.00016292611,0.0008007664,0.0003889119,0.0006279888,0.00019135688],"domain_scores_gemma":[0.9967252,0.000999143,0.0008082019,0.0012389581,0.00017325795,0.000055248358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084576255,0.00024669757,0.0004960198,0.00021383642,0.000090073685,0.000064124484,0.0012882208,0.0001621495,0.000023694356],"category_scores_gemma":[0.00040815902,0.00017882486,0.0001791097,0.0003470547,0.00011165738,0.00013534873,0.00064143835,0.00023800616,0.000031886444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017854421,0.00022337212,0.000038284197,0.00060690555,0.000077461154,0.0000023331604,0.014939642,0.00262958,0.0016938538,0.9748301,0.00041533305,0.004525269],"study_design_scores_gemma":[0.0004558159,0.00012537047,0.0021482839,0.002044318,0.000049231934,0.000024310113,0.0007767087,0.3417097,0.03505604,0.61702454,0.000047973408,0.00053769845],"about_ca_topic_score_codex":0.000030451587,"about_ca_topic_score_gemma":0.0000034765224,"teacher_disagreement_score":0.35780558,"about_ca_system_score_codex":0.000058240552,"about_ca_system_score_gemma":0.00011357398,"threshold_uncertainty_score":0.7292266},"labels":[],"label_agreement":null},{"id":"W2153607460","doi":"10.1017/s1446788700002354","title":"Remarks concerning finitely generated semigroups having regular sets of unique normal forms","year":2001,"lang":"en","type":"article","venue":"Journal of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Mitacs; European Commission","keywords":"Mathematics; Decidability; Automaticity; Special classes of semigroups; Closure (psychology); Class (philosophy); Semigroup; Pure mathematics; Finitely-generated abelian group; Krohn–Rhodes theory; Task (project management); Inverse semigroup; Discrete mathematics; Inverse; Algebra over a field; Computer science; Artificial intelligence","score_opus":0.027377457301323772,"score_gpt":0.2660028107670802,"score_spread":0.23862535346575645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153607460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85715914,0.00007249632,0.1388797,0.0029819617,0.00021197775,0.00014474559,0.0000033824792,0.00004355015,0.00050303864],"genre_scores_gemma":[0.9100221,0.000038438284,0.08842767,0.0003823764,0.00011170791,0.0000017296924,7.1094405e-7,0.000018065048,0.0009972327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781287,0.00015216265,0.00089271576,0.00016852409,0.0006003316,0.0003734007],"domain_scores_gemma":[0.9979303,0.0002739433,0.0008822362,0.00054681365,0.00020980994,0.0001568861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018409494,0.00019855521,0.00044279898,0.000035582256,0.00016959228,0.00012394357,0.0015108131,0.00017021805,0.000114591014],"category_scores_gemma":[0.00018491062,0.000120691606,0.00063015625,0.00046427286,0.00017441735,0.00059930177,0.00029715349,0.00052987825,0.0000071019463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023745901,0.0022610782,0.014724944,0.0019409222,0.0025569818,0.0005922208,0.04252122,0.009739021,0.29859737,0.4715142,0.12060003,0.034714565],"study_design_scores_gemma":[0.0043905214,0.00090587366,0.0150899505,0.0046527595,0.00047234178,0.0076814657,0.004798913,0.21794094,0.19104476,0.5435773,0.0076969457,0.0017481948],"about_ca_topic_score_codex":0.000004249017,"about_ca_topic_score_gemma":5.2692235e-7,"teacher_disagreement_score":0.20820193,"about_ca_system_score_codex":0.00009116498,"about_ca_system_score_gemma":0.00009615668,"threshold_uncertainty_score":0.4921661},"labels":[],"label_agreement":null},{"id":"W2153808094","doi":"10.1016/j.disc.2011.12.019","title":"Avoiding 3/2-powers over the natural numbers","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Natural number; Mathematics; Lexicographical order; Sequence (biology); Combinatorics; Discrete mathematics; Natural (archaeology); Arithmetic","score_opus":0.011964409503328352,"score_gpt":0.25287049316825305,"score_spread":0.2409060836649247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153808094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48307,0.0015671625,0.47934204,0.0012106505,0.0025091236,0.00039254903,0.000005631247,0.0006226946,0.03128015],"genre_scores_gemma":[0.9808382,0.000008668256,0.018142162,0.0004900808,0.00012524423,0.000008382763,0.0000015634675,0.000015021478,0.0003707136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890214,0.0000753609,0.00019168321,0.00014166108,0.00028922048,0.0003999067],"domain_scores_gemma":[0.9987964,0.0003925377,0.000104088,0.00061016803,0.000016654967,0.00008013854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009109944,0.0001469815,0.0001349176,0.000032235588,0.0002899708,0.0001805381,0.0008905492,0.00003809744,0.00004415382],"category_scores_gemma":[0.00012801205,0.00008695706,0.00010264326,0.00021146066,0.00006565871,0.00060353277,0.00029035044,0.00025589674,0.0001704187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.598711e-7,0.000044067667,0.00014536074,0.000028972532,0.000027274507,0.000002370294,0.012696273,0.0000049374157,0.0004465589,0.98223406,0.0025141516,0.0018551938],"study_design_scores_gemma":[0.0013308444,0.00007669748,0.0080708265,0.0005144278,0.0001525991,0.00061148294,0.020814804,0.5727055,0.012220696,0.33888942,0.042161927,0.002450737],"about_ca_topic_score_codex":0.000005022952,"about_ca_topic_score_gemma":6.093823e-7,"teacher_disagreement_score":0.64334464,"about_ca_system_score_codex":0.000028631131,"about_ca_system_score_gemma":0.000011920421,"threshold_uncertainty_score":0.35460058},"labels":[],"label_agreement":null},{"id":"W2154524081","doi":"10.1017/s001309150002099x","title":"Primitive inverse congruences on categorical semigroups","year":2000,"lang":"en","type":"article","venue":"Proceedings of the Edinburgh Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Wilfrid Laurier University","keywords":"Congruence relation; Inverse semigroup; Categorical variable; Mathematics; Congruence (geometry); Semigroup; Pure mathematics; Inverse; Unitary state; Bicyclic semigroup; Inverse element; Special classes of semigroups; Geometry","score_opus":0.010711778495540654,"score_gpt":0.22031567048570366,"score_spread":0.20960389199016302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154524081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9131368,0.000045757384,0.0028581752,0.0054130927,0.000337183,0.00056916935,0.000004577505,0.0003983129,0.07723698],"genre_scores_gemma":[0.9815391,0.000043219858,0.013868211,0.0013726128,0.00021047628,0.00004067979,3.8588263e-7,0.000016750215,0.0029086058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998073,0.000009851264,0.0003951869,0.0004211434,0.00069787627,0.00040295644],"domain_scores_gemma":[0.9989448,0.0003210933,0.00017935963,0.0002799183,0.00013913408,0.00013565696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070563034,0.00023650442,0.00034079558,0.00002137405,0.00021811336,0.0001325751,0.0016980411,0.00014500934,0.0005511531],"category_scores_gemma":[0.0001796713,0.00014488856,0.00039780428,0.00053492666,0.00037431403,0.00046712373,0.00031048642,0.00032696387,0.0000493548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002147087,0.000585053,0.00032758218,0.0001501735,0.00012037943,0.0000013532486,0.009784796,0.000017813427,0.005020544,0.85320574,0.12153095,0.00923415],"study_design_scores_gemma":[0.0006725092,0.00022985032,0.0006428276,0.00031616166,0.0000624663,0.00005481232,0.0016512311,0.07310809,0.029650182,0.8891271,0.0039253854,0.000559396],"about_ca_topic_score_codex":0.0000058163805,"about_ca_topic_score_gemma":8.496531e-8,"teacher_disagreement_score":0.11760557,"about_ca_system_score_codex":0.00007406012,"about_ca_system_score_gemma":0.00003647644,"threshold_uncertainty_score":0.60347396},"labels":[],"label_agreement":null},{"id":"W2155195622","doi":"10.1016/j.tcs.2005.12.003","title":"Combinatorial properties of smooth infinite words","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Bijection; Mathematics; Combinatorics; Mixing (physics); Monoid; Class (philosophy); Fixed point; Palindrome; Combinatorial algorithms; Computation; Free monoid; Point (geometry); Discrete mathematics; Computer science; Algorithm","score_opus":0.008293644474209383,"score_gpt":0.20828282649396776,"score_spread":0.19998918201975838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155195622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3242455,0.00008273322,0.6681175,0.0003066938,0.0011297936,0.00011487136,9.782168e-7,0.00022539461,0.0057764817],"genre_scores_gemma":[0.9710617,0.0000014925573,0.028578222,0.00013692706,0.00020279875,0.0000044332282,3.0163127e-7,0.0000072693883,0.000006823749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977281,0.00009881544,0.00037444924,0.00052626745,0.0007729877,0.0004993787],"domain_scores_gemma":[0.9986167,0.0001287077,0.00010711947,0.00084144797,0.00018421603,0.00012180619],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001303448,0.00017710208,0.00025128797,0.00019848702,0.0002344257,0.00029399537,0.0026544963,0.00005253349,0.00001915593],"category_scores_gemma":[0.000050838655,0.00013265474,0.00007479232,0.0012093033,0.0034318161,0.00066803105,0.0010640426,0.00014354102,0.00003275072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008002539,0.00009378379,0.00007523691,0.000009935963,0.0000017664809,0.0000041960047,0.00019177499,0.00006813852,0.006984493,0.9827937,0.000025053883,0.009743951],"study_design_scores_gemma":[0.0003490275,0.00015526055,0.0012527633,0.000062506515,0.0000035345613,0.000013836027,0.000005727068,0.21466516,0.06431384,0.7187549,0.00018416258,0.00023927497],"about_ca_topic_score_codex":0.000020949374,"about_ca_topic_score_gemma":2.9122893e-7,"teacher_disagreement_score":0.6468162,"about_ca_system_score_codex":0.000034115863,"about_ca_system_score_gemma":0.00013690903,"threshold_uncertainty_score":0.9992803},"labels":[],"label_agreement":null},{"id":"W2156139008","doi":"10.1016/j.tcs.2012.02.030","title":"State complexity of combined operations with two basic operations","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Component (thermodynamics); Upper and lower bounds; Computer science; Computational complexity theory; Mathematics; Theoretical computer science; Algorithm","score_opus":0.020934576738689207,"score_gpt":0.2652000572899269,"score_spread":0.2442654805512377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156139008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29570255,0.000014484062,0.70231026,0.0005634609,0.00023421332,0.00015463894,0.000004915358,0.00012481157,0.00089063647],"genre_scores_gemma":[0.7499924,0.0000011227802,0.24955651,0.00037537742,0.000050079674,0.000007819509,0.0000018909997,0.000006323673,0.000008513686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997891,0.00015672448,0.00031422684,0.00042605074,0.0006062598,0.0006057303],"domain_scores_gemma":[0.99827534,0.00014528928,0.000040678435,0.0009454964,0.00026491092,0.00032830818],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014273209,0.0001831536,0.00024451202,0.00015948439,0.00052232586,0.00031470394,0.0018624205,0.000022065307,0.00007050279],"category_scores_gemma":[0.000036708327,0.00013149166,0.000045889934,0.0011842635,0.004538019,0.001596249,0.00074556365,0.00015151703,0.000052507865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072070166,0.00017262256,0.00021191612,0.000004140381,0.0000057857637,0.0000014023746,0.0009548565,0.002681272,0.0015706521,0.9908496,0.000010687891,0.0035298294],"study_design_scores_gemma":[0.00052714476,0.00032140577,0.004530884,0.00003112424,0.0000071596523,0.000042031046,0.000016100117,0.9019794,0.01740473,0.074860506,0.000017262197,0.000262262],"about_ca_topic_score_codex":0.000025897465,"about_ca_topic_score_gemma":0.000008568419,"teacher_disagreement_score":0.9159891,"about_ca_system_score_codex":0.000039986866,"about_ca_system_score_gemma":0.00016076598,"threshold_uncertainty_score":0.99817103},"labels":[],"label_agreement":null},{"id":"W2156285174","doi":"10.2168/lmcs-3(2:6)2007","title":"On tractability and congruence distributivity","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Mathematical Sciences; Hungarian Scientific Research Fund; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences","keywords":"Distributivity; Distributive property; Congruence (geometry); Mathematics; Bounded function; Variety (cybernetics); Term (time); Conjecture; Sequence (biology); Pure mathematics; Class (philosophy); Discrete mathematics; Invariant (physics); Computer science","score_opus":0.03957083179911924,"score_gpt":0.38527557279438834,"score_spread":0.3457047409952691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156285174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25006816,0.000026306474,0.74857575,0.00024265621,0.0004617447,0.0001037178,8.103537e-7,0.00010604396,0.00041483794],"genre_scores_gemma":[0.50386494,0.0000016080569,0.4956225,0.00048531362,0.000021269057,0.0000017803694,7.956126e-8,0.0000013339574,0.00000116758],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9973172,0.00034903537,0.00032594943,0.0009895894,0.00041298306,0.0006052287],"domain_scores_gemma":[0.9954185,0.0034850717,0.000080288424,0.0007101987,0.000062492516,0.00024346892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013254837,0.00016913415,0.000248298,0.00015315344,0.00020191414,0.0002604575,0.0015790873,0.000075365366,0.0000064052974],"category_scores_gemma":[0.00087129866,0.0001269938,0.00004008412,0.0013669676,0.0009972388,0.00064596004,0.0008949476,0.0003164301,0.000005258863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061308447,0.00010391337,0.00157033,0.0000035920655,5.662178e-7,0.000029462575,0.00010798494,0.000044689616,0.002236109,0.25926426,0.000002970886,0.73663],"study_design_scores_gemma":[0.00022073807,0.00024357083,0.38236985,0.000024513838,8.4050095e-7,0.00004617741,0.000005930067,0.23733361,0.011464298,0.3679362,0.00009585829,0.0002584362],"about_ca_topic_score_codex":0.00001561941,"about_ca_topic_score_gemma":0.0000030211013,"teacher_disagreement_score":0.7363716,"about_ca_system_score_codex":0.00009540899,"about_ca_system_score_gemma":0.000052141895,"threshold_uncertainty_score":0.51786566},"labels":[],"label_agreement":null},{"id":"W2157637221","doi":"10.1016/j.tcs.2004.09.008","title":"Mergible states in large NFA","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Parameterized complexity; Regular language; Constant (computer programming); Automaton; Deterministic finite automaton; Nondeterministic finite automaton; Mathematics; Finite-state machine; Deterministic automaton; Discrete mathematics; Büchi automaton; State (computer science); Computer science; Combinatorics; Algorithm; Theoretical computer science; Automata theory; Programming language","score_opus":0.005756027207093133,"score_gpt":0.23843631340741395,"score_spread":0.2326802862003208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157637221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17090717,0.00004216259,0.82523656,0.0014506263,0.0003810419,0.00009924438,0.0000013907772,0.00023080631,0.0016509973],"genre_scores_gemma":[0.8928275,0.000008041769,0.10603155,0.0010622558,0.00005233115,0.000005428138,7.646482e-7,0.000006614768,0.0000055014793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975165,0.00006647077,0.00027700418,0.00071116746,0.0005845096,0.00084430637],"domain_scores_gemma":[0.99870867,0.00013244097,0.00004465194,0.0008137345,0.00007261805,0.00022789591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001927625,0.00017438075,0.00020179753,0.00027813012,0.00024808367,0.00038463334,0.002768507,0.00004460367,0.000043933298],"category_scores_gemma":[0.00004501286,0.00014088581,0.000051528332,0.0017594333,0.0012331102,0.00096745766,0.0012257127,0.0002031238,0.00018628302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028036234,0.00010432203,0.000072331895,0.0000034212353,0.0000011414542,0.00003733234,0.0008390143,0.0010521831,0.0003435457,0.99015486,0.000011661734,0.0073773977],"study_design_scores_gemma":[0.00047496884,0.00010452101,0.0012693809,0.000033831562,8.931443e-7,0.000026238295,0.000017619768,0.27578261,0.005831804,0.716136,0.00012092631,0.00020119366],"about_ca_topic_score_codex":0.000013466616,"about_ca_topic_score_gemma":0.0000036618308,"teacher_disagreement_score":0.7219204,"about_ca_system_score_codex":0.000102745165,"about_ca_system_score_gemma":0.00015105812,"threshold_uncertainty_score":0.57451564},"labels":[],"label_agreement":null},{"id":"W2158592145","doi":"10.1016/j.tcs.2007.10.029","title":"A characterization of fine words over a finite alphabet","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Lexicographical order; Word (group theory); Prefix; Characterization (materials science); Mathematics; Alphabet; Combinatorics; Aperiodic graph; Combinatorics on words; Discrete mathematics; Linguistics","score_opus":0.006842940091432575,"score_gpt":0.23709594725084926,"score_spread":0.23025300715941668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158592145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34444183,0.000006395889,0.6541424,0.00016322908,0.00033401808,0.00007498594,0.000001981159,0.00010755389,0.00072764384],"genre_scores_gemma":[0.92669255,0.0000017394188,0.072684616,0.0004897396,0.00011030836,0.0000016711841,0.0000020053258,0.000006544266,0.000010802788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978794,0.0000530087,0.00037673602,0.0005120465,0.00065549236,0.00052333996],"domain_scores_gemma":[0.9983948,0.00036608087,0.00013051914,0.0007723078,0.00013937232,0.00019695217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025915715,0.00015656823,0.00021319921,0.00027064924,0.00015698327,0.00016443351,0.001957328,0.000051922954,0.000075676595],"category_scores_gemma":[0.0000880868,0.00012834829,0.00006522641,0.0016201364,0.0015459653,0.0007307532,0.00083095423,0.00012711236,0.00002958411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010090227,0.000060279395,0.00011387239,0.0000064312226,0.000002566937,0.000008816783,0.00045242847,0.000010505779,0.051955137,0.87280935,0.0000044558255,0.07456604],"study_design_scores_gemma":[0.0004250478,0.00029138848,0.025232494,0.00007615341,0.0000055118976,0.000026482583,0.0000045429147,0.70179725,0.14191222,0.12967904,0.00021408482,0.00033578125],"about_ca_topic_score_codex":0.0000019511642,"about_ca_topic_score_gemma":5.0677517e-7,"teacher_disagreement_score":0.7431303,"about_ca_system_score_codex":0.000031548065,"about_ca_system_score_gemma":0.00007270784,"threshold_uncertainty_score":0.56961733},"labels":[],"label_agreement":null},{"id":"W2159207128","doi":"","title":"On the Behavior of a Variant of Hofstadter's Q-Sequence","year":2007,"lang":"en","type":"article","venue":"Journal of integer sequences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fibonacci number; Combinatorics; Sequence (biology); Mathematics; Recursion (computer science); Integer (computer science); Partition (number theory); Monotone polygon; Integer sequence; Block (permutation group theory); Discrete mathematics; Algorithm; Generating function; Computer science","score_opus":0.02733554516420093,"score_gpt":0.28144379421011856,"score_spread":0.2541082490459176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159207128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8487503,0.0002912615,0.14829439,0.0007675039,0.0006008784,0.000104274055,0.0000041160492,0.000011600638,0.001175663],"genre_scores_gemma":[0.9924504,0.000026288102,0.007179657,0.0002540504,0.000053732794,0.0000016832614,8.295895e-8,0.000004334608,0.000029761475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99832195,0.000097774835,0.0007286612,0.00012073957,0.0005445962,0.00018625491],"domain_scores_gemma":[0.9975888,0.0007397425,0.0009249094,0.00035623784,0.00032521863,0.000065079126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025738704,0.00011377227,0.00026847445,0.00019086384,0.000042268563,0.000041370182,0.0015431261,0.000050564722,0.00005264313],"category_scores_gemma":[0.00023272268,0.000060623617,0.00017047845,0.00034741283,0.00024199419,0.00038072214,0.00008233942,0.0002515681,0.0000033261688],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007879853,0.0003045373,0.0006779857,0.000026658521,0.00008312449,0.00065022847,0.002646873,0.000076402896,0.1646851,0.7936201,0.0005550755,0.03659508],"study_design_scores_gemma":[0.0006141056,0.002833639,0.008012379,0.001299729,0.00008219622,0.0026197317,0.0022990766,0.0018643244,0.8070098,0.17238937,0.0005795479,0.00039607528],"about_ca_topic_score_codex":0.000060540304,"about_ca_topic_score_gemma":0.000006420294,"teacher_disagreement_score":0.64232475,"about_ca_system_score_codex":0.00003787674,"about_ca_system_score_gemma":0.00015115304,"threshold_uncertainty_score":0.28675377},"labels":[],"label_agreement":null},{"id":"W2159447498","doi":"10.1007/978-3-319-09704-6_9","title":"Most Complex Regular Right-Ideal Languages","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ideal (ethics); Quotient; Semigroup; Regular language; Mathematics; Alphabet; Discrete mathematics; State (computer science); Combinatorics; Computer science; Algorithm; Automaton; Linguistics; Theoretical computer science; Law","score_opus":0.011298781156436755,"score_gpt":0.23732970020095248,"score_spread":0.22603091904451572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159447498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007873828,0.0005362256,0.9838545,0.0011535655,0.0011593318,0.0002767924,0.000008886329,0.00041590608,0.012516101],"genre_scores_gemma":[0.24351902,0.000059603142,0.74006987,0.011373091,0.0020491749,0.00001584443,0.00004875142,0.000119442746,0.0027452207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564403,0.000067098765,0.00056134147,0.0017512849,0.0011258171,0.00085042196],"domain_scores_gemma":[0.9963931,0.00056480424,0.00032635368,0.002260633,0.0002162719,0.00023882574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011750057,0.0006505076,0.0007011768,0.00058417965,0.0003416094,0.0007346688,0.0052277218,0.00035581374,0.000115867006],"category_scores_gemma":[0.00008455982,0.0005561697,0.0001423447,0.00066642964,0.00089753495,0.0004054924,0.0018252566,0.0007362316,0.0001816617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033233216,0.000019328723,0.0000169296,0.000041683765,0.000014194524,0.00020853445,0.00033241123,0.0029502804,0.0005148026,0.30627844,0.0006039049,0.68901616],"study_design_scores_gemma":[0.0004157885,0.00019931982,0.00027086795,0.00044459137,0.000012474549,0.00025531137,3.1186212e-7,0.5505788,0.0021515226,0.407725,0.036646552,0.0012994441],"about_ca_topic_score_codex":0.000046506495,"about_ca_topic_score_gemma":0.00005486145,"teacher_disagreement_score":0.6877167,"about_ca_system_score_codex":0.00020457931,"about_ca_system_score_gemma":0.00033325228,"threshold_uncertainty_score":0.999689},"labels":[],"label_agreement":null},{"id":"W2159509242","doi":"10.1016/j.ic.2007.02.004","title":"Exponential lower bounds for the number of words of uniform length avoiding a pattern","year":2007,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Alphabet; Exponential growth; Mathematics; Exponential function; Combinatorics; Combinatorics on words; Finite set; Upper and lower bounds; Word length; Discrete mathematics; Word (group theory); Computer science; Natural language processing; Linguistics; Mathematical analysis; Geometry","score_opus":0.01120924040276972,"score_gpt":0.26443390570068526,"score_spread":0.25322466529791554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159509242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23945703,0.000011047362,0.75978225,0.00009270703,0.00018889653,0.00009531406,0.0000023584846,0.000020786534,0.00034959152],"genre_scores_gemma":[0.9944777,0.0000055218266,0.005318783,0.00015409506,0.000021735905,0.0000034323791,0.000009350582,0.0000017876956,0.000007586715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993966,0.000011511963,0.00031504946,0.00004695234,0.00014313366,0.000086712134],"domain_scores_gemma":[0.9993218,0.00024716073,0.00021801231,0.00009147206,0.000103212704,0.00001833631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068429264,0.00005233076,0.000071511604,0.000061557075,0.000096016614,0.00006339115,0.00013890363,0.000027946524,0.0000042897154],"category_scores_gemma":[0.000019230709,0.000039153878,0.00003486376,0.00013222269,0.000031216525,0.000876549,0.00004564517,0.00003960619,0.0000027683727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028908487,0.000023506342,0.0004908181,0.00006442473,0.00001769829,1.1564756e-7,0.0070967684,0.00072890153,0.00010413711,0.04790017,0.00013204096,0.9434125],"study_design_scores_gemma":[0.000775888,0.00007223653,0.010430936,0.000041215164,0.000009697778,0.000012663733,0.0014960541,0.9746579,0.0024084013,0.008091282,0.0018955524,0.00010818038],"about_ca_topic_score_codex":0.000020638941,"about_ca_topic_score_gemma":0.0000025709282,"teacher_disagreement_score":0.973929,"about_ca_system_score_codex":0.000009751252,"about_ca_system_score_gemma":0.000016686494,"threshold_uncertainty_score":0.15966488},"labels":[],"label_agreement":null},{"id":"W2160340816","doi":"10.1007/978-3-642-31653-1_22","title":"Unambiguous Constrained Automata","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Decidability; Automaton; Computer science; Class (philosophy); Bounded function; Closure (psychology); Set (abstract data type); Discrete mathematics; Tree automaton; Theoretical computer science; Mathematics; Programming language; Artificial intelligence","score_opus":0.014430594525762862,"score_gpt":0.23289091132539946,"score_spread":0.2184603167996366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160340816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006610728,0.0011078914,0.98328424,0.00090108305,0.0026126134,0.00032019702,0.000010427937,0.0006279892,0.011069482],"genre_scores_gemma":[0.43447912,0.00013249251,0.5590446,0.0039921505,0.0012549615,0.000012706461,0.000015747208,0.000095126474,0.0009730668],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956946,0.00004461238,0.00058844197,0.0015194579,0.0010733975,0.0010794875],"domain_scores_gemma":[0.99647015,0.000468189,0.00032465495,0.0022633062,0.00015346648,0.00032020497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013395562,0.0006687222,0.00064767344,0.00078626163,0.00027657178,0.0006327726,0.0049139005,0.0004136553,0.00009776044],"category_scores_gemma":[0.00007771972,0.00060180714,0.00017762955,0.00056368543,0.0011526312,0.00093708537,0.0019918953,0.0008339756,0.00027066626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022259833,0.000032377535,0.000014279187,0.00002645872,0.000010957986,0.000098882,0.0003858946,0.00091175153,0.00016514184,0.14899936,0.000036780308,0.8493159],"study_design_scores_gemma":[0.00052615575,0.00017431301,0.0002065314,0.00047770317,0.000016948878,0.0004901881,1.9700066e-7,0.44840705,0.001535175,0.54127264,0.0054786606,0.001414454],"about_ca_topic_score_codex":0.00001999121,"about_ca_topic_score_gemma":0.000013888472,"teacher_disagreement_score":0.8479014,"about_ca_system_score_codex":0.00026962924,"about_ca_system_score_gemma":0.0005681086,"threshold_uncertainty_score":0.9996433},"labels":[],"label_agreement":null},{"id":"W2161035123","doi":"10.1007/978-3-642-13675-7_8","title":"A Characterization of Combined Traces Using Labeled Stratified Order Structures","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Characterization (materials science); Quotient; Representation (politics); Dependency (UML); Graph; Mathematics; Order (exchange); Class (philosophy); Computer science; Pure mathematics; Discrete mathematics; Artificial intelligence; Materials science; Nanotechnology","score_opus":0.01463442094236324,"score_gpt":0.23834881888907516,"score_spread":0.2237143979467119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161035123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06580223,0.00006078921,0.9318321,0.00014840745,0.0014775618,0.0003444824,0.000013203656,0.00011881921,0.00020241215],"genre_scores_gemma":[0.62967515,0.000012840233,0.36953673,0.00040024362,0.0002450207,0.0000032446285,0.000018351215,0.000034528075,0.00007391991],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970828,0.000041286665,0.00061914517,0.0010349636,0.00077135325,0.00045041676],"domain_scores_gemma":[0.9975531,0.00023910464,0.00058042735,0.0011717355,0.00034740177,0.00010823111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005858734,0.00046599854,0.00060310285,0.0006412219,0.00020265942,0.00039863872,0.0025418664,0.00041988198,0.000050307397],"category_scores_gemma":[0.000065703585,0.00040700857,0.0000946094,0.0006692693,0.0006845451,0.0006860033,0.0006096092,0.00071958435,0.0000036989945],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017653396,0.00005341418,0.00003900546,0.00009225066,0.000024114861,0.00003187513,0.0012586432,0.0029413209,0.68109936,0.09098233,6.042612e-7,0.22345941],"study_design_scores_gemma":[0.0005063448,0.00019425407,0.00051593606,0.00031425297,0.000017393371,0.000054990604,3.0116686e-7,0.5389433,0.18408097,0.27450323,0.00009802323,0.0007710258],"about_ca_topic_score_codex":0.000021970262,"about_ca_topic_score_gemma":0.00004294947,"teacher_disagreement_score":0.56387293,"about_ca_system_score_codex":0.00006940809,"about_ca_system_score_gemma":0.00052835396,"threshold_uncertainty_score":0.9998382},"labels":[],"label_agreement":null},{"id":"W2161721062","doi":"10.1016/j.jnt.2014.05.003","title":"On the fractional parts of powers of Pisot numbers of length at most 4","year":2014,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Lietuvos Mokslo Taryba","keywords":"Mathematics; Degree (music); Combinatorics; Interval (graph theory); Sequence (biology); Limit point; Limit (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.00852299512625204,"score_gpt":0.2303911730282221,"score_spread":0.22186817790197005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161721062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9359517,0.000099484845,0.033535253,0.0008925426,0.0008582198,0.00008753253,0.000025938058,0.000014929503,0.02853442],"genre_scores_gemma":[0.99798185,0.00001738308,0.0012092278,0.00041928698,0.0000812087,8.15985e-7,7.130076e-7,0.000010196738,0.00027933897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812406,0.00040265513,0.0006199033,0.00012111852,0.0005759096,0.00015632813],"domain_scores_gemma":[0.99538076,0.0026992124,0.0011917901,0.0004448632,0.00021491032,0.000068481626],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022791557,0.00012315813,0.0003307556,0.00008041733,0.000058209884,0.000012898888,0.00081886677,0.000060318504,0.0011952871],"category_scores_gemma":[0.00042906092,0.00007844123,0.00022262985,0.0002021584,0.00022276865,0.00024190506,0.00012467672,0.00021372945,0.0000222391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025973486,0.00030081274,0.001206876,0.000032442116,0.00017466712,0.000006188583,0.0011733045,0.000461699,0.0036714806,0.9673028,0.019602789,0.0058071953],"study_design_scores_gemma":[0.001987316,0.0010018217,0.012170308,0.00079828774,0.000100930054,0.0005757457,0.0010913848,0.0037285697,0.06346381,0.892735,0.021908626,0.00043818096],"about_ca_topic_score_codex":0.0000071549553,"about_ca_topic_score_gemma":0.0000012042206,"teacher_disagreement_score":0.07456779,"about_ca_system_score_codex":0.000037484628,"about_ca_system_score_gemma":0.000070505084,"threshold_uncertainty_score":0.9997178},"labels":[],"label_agreement":null},{"id":"W2161913867","doi":"10.1016/j.jalgebra.2006.05.020","title":"On the rational subset problem for groups","year":2006,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Centro de Matemática Universidade do Porto; Natural Sciences and Engineering Research Council of Canada; European Science Foundation","keywords":"Decidability; Mathematics; Free product; Monoid; Abelian group; Combinatorics; Discrete mathematics; Free monoid; Commutative property; Group (periodic table); Direct product","score_opus":0.009193522760611693,"score_gpt":0.2132131024672273,"score_spread":0.2040195797066156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161913867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35569778,0.00022983734,0.6230612,0.017988103,0.00062704796,0.00022968692,0.000005099775,0.000037035366,0.002124233],"genre_scores_gemma":[0.9687165,0.0000028571194,0.028980404,0.0014734783,0.00063256343,0.0000056972367,0.0000014094738,0.0000065616155,0.000180555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992406,0.00004175235,0.00025655318,0.00007848153,0.0002466608,0.00013598514],"domain_scores_gemma":[0.9990297,0.000456134,0.00023455458,0.00015101871,0.00010159072,0.000027005759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079979585,0.00006548461,0.00009646703,0.000043231124,0.000114044706,0.0001260274,0.00054750324,0.000024290628,0.000027198997],"category_scores_gemma":[0.00003706472,0.000036973714,0.00010765367,0.00011235042,0.00002171933,0.00027833245,0.000032362557,0.00010029109,0.000011202959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010878126,0.000038812766,0.0000384968,0.0000024620879,0.000009623442,0.0000040663845,0.00004234862,0.0002523327,0.00045983354,0.9346919,0.06338955,0.0010597036],"study_design_scores_gemma":[0.00031926468,0.00019604487,0.0025240756,0.000024837886,0.0000050415683,0.00008140396,0.000010349665,0.0037468537,0.0014815031,0.9857515,0.0057950043,0.00006408148],"about_ca_topic_score_codex":0.0000012658239,"about_ca_topic_score_gemma":0.0000014519011,"teacher_disagreement_score":0.6130187,"about_ca_system_score_codex":0.000020377023,"about_ca_system_score_gemma":0.00005418343,"threshold_uncertainty_score":0.15077443},"labels":[],"label_agreement":null},{"id":"W2162199371","doi":"10.1007/3-540-44685-0_17","title":"An Algebraic Characterization of Data and Timed Languages","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decidability; Computer science; Automaton; Closure (psychology); Abstract family of languages; Regular language; Programming language; Characterization (materials science); Class (philosophy); Algebraic number; Theoretical computer science; Algebra over a field; Second-generation programming language; Artificial intelligence; Mathematics; Fifth-generation programming language; Pure mathematics","score_opus":0.016158389950387916,"score_gpt":0.2599235246412766,"score_spread":0.24376513469088867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162199371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037924193,0.00026944967,0.99441266,0.0002213132,0.0002857697,0.0001720161,0.000029731213,0.00010768053,0.00070897996],"genre_scores_gemma":[0.6808697,0.0002721772,0.31605065,0.0016337476,0.00061440683,0.000003896117,0.00023987185,0.000053448006,0.00026208357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977427,0.00003352608,0.00033002655,0.0011331392,0.00046619854,0.00029437031],"domain_scores_gemma":[0.9972962,0.0001725235,0.0002492816,0.0020947156,0.00008311002,0.00010413964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072930614,0.00027734507,0.00035175763,0.00043036678,0.00008995497,0.00027528807,0.0037999195,0.00016923879,0.000023368693],"category_scores_gemma":[0.000029741544,0.00024643823,0.000026376121,0.00033003927,0.00044345323,0.0013731318,0.0015203672,0.00025345542,0.0000065370355],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002439983,0.00002174548,0.000063897874,0.000026677524,0.0000057074617,0.00003356398,0.0004966757,0.00008530103,0.007786338,0.014021817,0.0000027902825,0.97745305],"study_design_scores_gemma":[0.00023883978,0.00018437806,0.0015048806,0.00033992477,0.000011059573,0.00011767915,4.2072236e-7,0.9220063,0.0040463028,0.06994329,0.0010226746,0.00058422924],"about_ca_topic_score_codex":0.000012776168,"about_ca_topic_score_gemma":0.000013600681,"teacher_disagreement_score":0.9768688,"about_ca_system_score_codex":0.000032629105,"about_ca_system_score_gemma":0.00014869307,"threshold_uncertainty_score":0.9999988},"labels":[],"label_agreement":null},{"id":"W2163125260","doi":"10.1142/s0129054113400339","title":"UNAMBIGUOUS CONSTRAINED AUTOMATA","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Decidability; Class (philosophy); Automaton; Closure (psychology); Set (abstract data type); Bounded function; Discrete mathematics; Mathematics; Tree automaton; Computer science; Combinatorics; Theoretical computer science; Programming language","score_opus":0.011032883667456058,"score_gpt":0.2731136558638009,"score_spread":0.2620807721963448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163125260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09923722,0.000021477686,0.8933226,0.003793476,0.002569963,0.00006799653,0.0000018782019,0.0000390302,0.0009463749],"genre_scores_gemma":[0.7605737,0.000007918684,0.23900817,0.0002515588,0.00013511298,0.0000010601173,6.069706e-7,0.0000027788274,0.000019099396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979044,0.000036567642,0.00061340193,0.0001924235,0.0010712856,0.00018191853],"domain_scores_gemma":[0.9965689,0.00016258711,0.0005936859,0.00037740343,0.0021771141,0.00012028853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008329541,0.00010036138,0.00016979646,0.0006216578,0.00010060828,0.00062616775,0.0042786575,0.000024604271,0.00007696269],"category_scores_gemma":[0.00013121798,0.0000847545,0.00010399725,0.0005634089,0.00051376445,0.0033468544,0.00045685537,0.00011025823,0.000049425347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005960536,0.00030399367,0.0004673874,0.0000059138683,0.00009339132,0.00003019486,0.0007187536,0.0015930237,0.01563457,0.38964224,0.0015267825,0.5899778],"study_design_scores_gemma":[0.0014707275,0.0004541539,0.039324276,0.0002033887,0.000012533024,0.001590274,0.000057053974,0.7839461,0.01261235,0.15788695,0.0020854191,0.00035675286],"about_ca_topic_score_codex":0.00002578276,"about_ca_topic_score_gemma":5.652059e-7,"teacher_disagreement_score":0.7823531,"about_ca_system_score_codex":0.000079239675,"about_ca_system_score_gemma":0.00052009494,"threshold_uncertainty_score":0.7950882},"labels":[],"label_agreement":null},{"id":"W2163285607","doi":"10.1016/s0304-3975(02)00398-5","title":"Periodicity, morphisms, and matrices","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Conjecture; Iterated function; Combinatorics; Constant (computer programming); Word (group theory); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.006621511833063064,"score_gpt":0.22147273379972024,"score_spread":0.21485122196665718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163285607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12539488,0.00019636663,0.8668835,0.0004881998,0.00035984023,0.000086109154,5.530739e-7,0.00022496156,0.006365582],"genre_scores_gemma":[0.8560516,0.000016525271,0.14315894,0.00071986235,0.000037965983,0.0000027924484,8.7501775e-8,0.0000048885054,0.000007343864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806243,0.00011449521,0.00018770903,0.00065298687,0.0004889125,0.00049346645],"domain_scores_gemma":[0.9987646,0.00019202547,0.00004660704,0.0006461126,0.00007425788,0.00027642085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015733478,0.00016083354,0.00016983975,0.00015232326,0.00047647118,0.0007345366,0.0015258548,0.000039689152,0.00011414941],"category_scores_gemma":[0.00006119565,0.00012600185,0.000034319546,0.00077612314,0.0026474847,0.0006806184,0.0007393336,0.00013295293,0.00010161156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.2466395e-7,0.000022501401,0.00010298473,0.0000039314154,0.0000018224338,0.000011681721,0.0002386975,0.0000071298796,0.00040621805,0.98210824,0.000031155472,0.0170649],"study_design_scores_gemma":[0.00024015621,0.00015298626,0.0014729107,0.000022084092,0.0000052694913,0.00023321592,0.00001418301,0.24583806,0.00468412,0.746276,0.0007365328,0.00032442622],"about_ca_topic_score_codex":0.0000018871813,"about_ca_topic_score_gemma":6.686615e-8,"teacher_disagreement_score":0.73065674,"about_ca_system_score_codex":0.000023967743,"about_ca_system_score_gemma":0.000080204605,"threshold_uncertainty_score":0.97547674},"labels":[],"label_agreement":null},{"id":"W2163424543","doi":"10.1016/j.disc.2009.01.022","title":"Packing and covering <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"bold\"><mml:mi>k</mml:mi></mml:mstyle></mml:math>-chain free subsets in Boolean lattices","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Chain (unit); Hypergraph; Center (category theory); Discrete mathematics; Crystallography; Physics","score_opus":0.014458789890085151,"score_gpt":0.23765184926040478,"score_spread":0.22319305937031964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163424543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97492695,0.00043614508,0.018058047,0.0004702443,0.00040831143,0.000092435606,0.00007595851,0.0002858968,0.005246001],"genre_scores_gemma":[0.9728559,0.00019703644,0.025636949,0.00071650825,0.00027798867,0.00006884899,0.00006262673,0.00012138986,0.00006272968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962721,0.000104643426,0.0009255235,0.00083526113,0.0008983015,0.0009641828],"domain_scores_gemma":[0.9966873,0.00065998477,0.0006919834,0.0016194124,0.000045237975,0.00029608846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001337278,0.00050467934,0.00038466277,0.00020314119,0.00048081973,0.0010064889,0.0014816645,0.00043328447,0.00007258452],"category_scores_gemma":[0.00045641564,0.0005920273,0.0003252244,0.00045968147,0.00026679225,0.0011506464,0.001080753,0.0005432329,0.00023171396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004351633,0.00015523535,0.00002371941,0.00042009534,0.00010157947,0.00035254465,0.004084581,0.00040205818,0.0013035077,0.99086046,0.00038977666,0.0018629467],"study_design_scores_gemma":[0.00084629195,0.0002717945,0.0002933055,0.00096112216,0.00011386291,0.000312512,0.0011296917,0.96981037,0.0075483997,0.017728476,0.00034417264,0.00064001326],"about_ca_topic_score_codex":0.00012206415,"about_ca_topic_score_gemma":0.00011261215,"teacher_disagreement_score":0.97313195,"about_ca_system_score_codex":0.00002170906,"about_ca_system_score_gemma":0.00015008953,"threshold_uncertainty_score":0.9996531},"labels":[],"label_agreement":null},{"id":"W2164278564","doi":"10.1007/3-540-36285-1_16","title":"New Rewritings and Optimizations for Regular Path Queries","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Path (computing); Conjunctive query; Regular expression; Path expression; Database query; Theoretical computer science; Query language; Algorithm; Relational database; Database; Programming language","score_opus":0.011993411357859278,"score_gpt":0.2162608945504441,"score_spread":0.2042674831925848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164278564","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012998212,0.0010442716,0.99506617,0.0013991084,0.00058455573,0.00036623157,0.000008009113,0.00020058324,0.0013180729],"genre_scores_gemma":[0.0034764935,0.00014617438,0.992909,0.0013341625,0.00040704536,0.000010529586,0.000005368695,0.000032728552,0.0016784655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975434,0.000015735519,0.00036399707,0.0011754909,0.00042597487,0.00047541538],"domain_scores_gemma":[0.99809563,0.000454599,0.0001993725,0.000927029,0.00014553044,0.00017785476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048505698,0.00037942128,0.00039176602,0.0004036072,0.0003279984,0.000687747,0.0016768805,0.00022628534,0.00002214639],"category_scores_gemma":[0.00010668713,0.00035429266,0.00008958949,0.0003252689,0.0004087114,0.0006361122,0.0007925896,0.00029676256,0.0000063215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024366727,0.000009584347,0.000007745626,0.000041745745,0.000007536745,0.000019737949,0.00092289667,0.00506377,0.00004286881,0.305526,0.0003687029,0.687987],"study_design_scores_gemma":[0.00024006388,0.00012211365,0.000016687358,0.00032862584,0.000007594465,0.00007594677,3.2017095e-7,0.55386513,0.00033127816,0.438574,0.0059545645,0.00048370715],"about_ca_topic_score_codex":0.000012402308,"about_ca_topic_score_gemma":0.000009411457,"teacher_disagreement_score":0.6875033,"about_ca_system_score_codex":0.00008344332,"about_ca_system_score_gemma":0.00022008721,"threshold_uncertainty_score":0.9998909},"labels":[],"label_agreement":null},{"id":"W2164513665","doi":"10.1145/773153.773165","title":"Query containment and rewriting using views for regular path queries under constraints","year":2003,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rewriting; Containment (computer programming); Computer science; Path (computing); Query optimization; Path expression; Query language; Theoretical computer science; Programming language; Information retrieval","score_opus":0.039757499225684785,"score_gpt":0.2718654214188744,"score_spread":0.2321079221931896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164513665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074568495,0.00040686337,0.9223776,0.00017500109,0.00010564535,0.0002114546,0.0000019025409,0.000086670356,0.0020663724],"genre_scores_gemma":[0.7071379,0.000012435612,0.2914009,0.0012419941,0.00002087634,0.000012378681,8.133555e-7,0.000008273371,0.00016442525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913234,0.000072905415,0.00019427037,0.0002737188,0.000097395474,0.00022935653],"domain_scores_gemma":[0.99945754,0.00014263451,0.00006355116,0.0002414274,0.000032496435,0.00006233111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006344514,0.00010870724,0.00015248067,0.000031383963,0.00015703669,0.00014065008,0.00013492054,0.00003977935,0.000021354334],"category_scores_gemma":[0.000049206246,0.00009175362,0.000039380917,0.00006577541,0.00011242554,0.00027158626,0.00006037936,0.000039355033,0.0000013956727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014514349,0.00001378433,0.0001265109,0.000018020315,0.0000092490545,0.0000037515574,0.00019598956,0.000009189888,0.0043329042,0.98139846,0.00012465837,0.013766042],"study_design_scores_gemma":[0.0040538213,0.00042640005,0.0011701243,0.00057793804,0.0000603491,0.0008216278,0.014301721,0.20515051,0.073345475,0.649001,0.049177743,0.0019132529],"about_ca_topic_score_codex":0.000010897225,"about_ca_topic_score_gemma":0.000003610563,"teacher_disagreement_score":0.6325694,"about_ca_system_score_codex":0.00003231118,"about_ca_system_score_gemma":0.000049272745,"threshold_uncertainty_score":0.3741604},"labels":[],"label_agreement":null},{"id":"W2166588729","doi":"10.1145/1017074.1017096","title":"On validation of XML streams using finite state machines","year":2004,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Finite-state machine; XML; STREAMS; State (computer science); Programming language; Finite state; Database; Operating system; Machine learning","score_opus":0.016053622204277765,"score_gpt":0.25164660744798417,"score_spread":0.23559298524370642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166588729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55895025,0.0000058943792,0.4400933,0.000054079603,0.00006442698,0.000025703384,0.0000015515845,0.000052332143,0.00075242907],"genre_scores_gemma":[0.9689236,0.000002039766,0.030836958,0.00014697075,0.0000102096565,5.3602787e-7,0.0000018253133,0.0000035642915,0.00007425867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950945,0.000018724022,0.00012007306,0.00013343267,0.00012490671,0.00009341224],"domain_scores_gemma":[0.9995865,0.00006655939,0.00005694267,0.00024333448,0.00002292213,0.000023719356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119467586,0.000061015824,0.00007102586,0.000059543738,0.000032222346,0.000038943468,0.00022967825,0.000014788802,0.000021604124],"category_scores_gemma":[0.000017214898,0.000046939767,0.000027332615,0.0001524515,0.000014967827,0.00023044381,0.000058886028,0.0000303185,0.000018007735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011044656,0.00019080035,0.00029141916,0.000022079961,0.000018979037,0.00001794495,0.0010441893,0.23343927,0.014789395,0.64466125,0.000037305494,0.10547635],"study_design_scores_gemma":[0.0005144034,0.00013473329,0.0005154493,0.00006110316,0.0000038011929,0.000008603379,0.000017220267,0.3756406,0.2581423,0.36476645,0.000029131843,0.00016623683],"about_ca_topic_score_codex":0.00015754184,"about_ca_topic_score_gemma":0.0000031020704,"teacher_disagreement_score":0.40997338,"about_ca_system_score_codex":0.00001659758,"about_ca_system_score_gemma":0.00002251069,"threshold_uncertainty_score":0.1914148},"labels":[],"label_agreement":null},{"id":"W2166846151","doi":"10.1016/j.tcs.2013.06.003","title":"State complexity of star of union and square of union on k regular languages","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Star (game theory); Square (algebra); Regular language; Mathematics; Component (thermodynamics); Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Algorithm; Automaton; Geometry; Physics","score_opus":0.011941278949197592,"score_gpt":0.24203050426044778,"score_spread":0.2300892253112502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166846151","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64740914,0.00003393101,0.35168323,0.0003027357,0.00006490135,0.0001236357,0.0000056568156,0.00003488611,0.00034191422],"genre_scores_gemma":[0.9440261,0.00000727699,0.055872742,0.00007108579,0.000011841076,0.0000014367835,9.1248717e-7,0.000004573199,0.0000039916395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982394,0.00024109345,0.0003351513,0.00037753733,0.0005422949,0.0002645209],"domain_scores_gemma":[0.9984839,0.00025842688,0.00017648611,0.0007231287,0.00023779087,0.00012028388],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014713157,0.00013229692,0.0002861513,0.0001779334,0.00007596215,0.000053286272,0.0011965685,0.000033885346,0.000029983576],"category_scores_gemma":[0.00004766962,0.0001002773,0.000044124135,0.0006113352,0.0045438823,0.000386805,0.00069669634,0.000092306575,0.000004408415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005506853,0.00007427509,0.00010437857,0.000047139456,0.0000035636567,0.0000011643662,0.00064743817,0.00006111803,0.011110771,0.95293504,0.000012766653,0.03499686],"study_design_scores_gemma":[0.00029950976,0.00080538646,0.02467749,0.00018690992,0.0000039402466,0.000007982149,0.00007114918,0.29726878,0.13887027,0.5376317,0.0000074474806,0.00016942217],"about_ca_topic_score_codex":0.000059328017,"about_ca_topic_score_gemma":7.139647e-7,"teacher_disagreement_score":0.41530332,"about_ca_system_score_codex":0.000014835899,"about_ca_system_score_gemma":0.000042709904,"threshold_uncertainty_score":0.9981652},"labels":[],"label_agreement":null},{"id":"W2167520368","doi":"10.37236/1108","title":"Binary Words Containing Infinitely Many Overlaps","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Binary number; Discrete mathematics; Arithmetic","score_opus":0.005592234311851341,"score_gpt":0.21008657108623313,"score_spread":0.20449433677438178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167520368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69244266,0.010430046,0.28812337,0.0023174505,0.0013886921,0.00012510415,5.5535116e-7,0.000114701135,0.0050574085],"genre_scores_gemma":[0.9988917,0.00021367116,0.00011375941,0.00024339248,0.00018966147,0.0000014757753,4.3471732e-7,0.000014947943,0.00033093456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808246,0.000170571,0.00048704032,0.000137096,0.0004972604,0.0006255912],"domain_scores_gemma":[0.99849176,0.00036368505,0.00049894577,0.00043223213,0.00015441368,0.00005895768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017532813,0.00016759681,0.0002668449,0.0001553155,0.00019340796,0.00015282724,0.0016501584,0.000062940286,0.00000914833],"category_scores_gemma":[0.000046190296,0.00011503922,0.0001552717,0.00064152526,0.000058158992,0.00049256015,0.00017651152,0.0007239631,0.000014001046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024557958,0.0000882518,0.00024293091,0.0000032745493,0.00003143075,0.000038651313,0.00016807523,0.00014436236,0.00039019054,0.99624985,0.0009848608,0.0016335589],"study_design_scores_gemma":[0.00085264316,0.0008179268,0.0017548543,0.000033434168,0.000022942233,0.00048005697,0.00009325633,0.0038285577,0.0007915665,0.9793375,0.01181292,0.00017434028],"about_ca_topic_score_codex":0.00001572387,"about_ca_topic_score_gemma":0.0000016500907,"teacher_disagreement_score":0.30644903,"about_ca_system_score_codex":0.00025476512,"about_ca_system_score_gemma":0.00039652715,"threshold_uncertainty_score":0.4691163},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02620600082371652,"score_gpt":0.3086807984164208,"score_spread":0.28247479759270433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168854371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13535255,0.000019051635,0.8617227,0.0006296475,0.0016857467,0.00005041515,0.000020202933,0.000022146263,0.00049756083],"genre_scores_gemma":[0.72643983,0.000012537241,0.273335,0.000099253215,0.00009816668,2.6562637e-7,0.000002349521,0.0000029351388,0.0000096879085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972603,0.00004667627,0.0009132524,0.0002073123,0.0013624817,0.00021002592],"domain_scores_gemma":[0.99508286,0.00053679117,0.0011683956,0.00036748685,0.002729306,0.000115135575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022313176,0.00011290477,0.00023289748,0.0009179149,0.00009697848,0.00017036716,0.0036775363,0.000023831199,0.00002991386],"category_scores_gemma":[0.00015915248,0.00009919692,0.00012679453,0.00088142144,0.001006946,0.0020121688,0.0005275743,0.00013609004,0.00000728101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008253764,0.0006560145,0.0010261324,0.000012641504,0.00018604283,0.00007277405,0.0022734574,0.0018118406,0.0089869555,0.4464275,0.00044181367,0.5380223],"study_design_scores_gemma":[0.0018357686,0.0007051087,0.12270364,0.0003857941,0.000018716051,0.0004686891,0.00006560821,0.5846027,0.09874997,0.1873728,0.0027136826,0.00037749624],"about_ca_topic_score_codex":0.000018623277,"about_ca_topic_score_gemma":0.0000053279314,"teacher_disagreement_score":0.5910873,"about_ca_system_score_codex":0.00009942073,"about_ca_system_score_gemma":0.00046450022,"threshold_uncertainty_score":0.6833839},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Intersection (aeronautics); State (computer science); Combined operations; Mathematics; Computer science; Algorithm; Engineering; Law","score_opus":0.041020828804904735,"score_gpt":0.29559549966654275,"score_spread":0.254574670861638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169267790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32418427,0.000017565326,0.6738212,0.00049024745,0.0012219284,0.00006945009,0.00000489815,0.000015050097,0.00017535969],"genre_scores_gemma":[0.82864565,0.000020549227,0.17120236,0.00006395491,0.000049497652,0.0000015461402,0.000002949491,0.0000036310098,0.000009851207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980027,0.000089447116,0.0007759699,0.00021479564,0.00078402436,0.00013307732],"domain_scores_gemma":[0.9959652,0.00010144114,0.00065327185,0.00026398498,0.0029304724,0.00008562864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013622923,0.00011208028,0.00020021034,0.00086723646,0.0001449436,0.00019449573,0.0016672802,0.000021256572,0.000020619145],"category_scores_gemma":[0.000105282845,0.00010009154,0.000074202406,0.00058534596,0.00074046734,0.0028281445,0.0003186696,0.000107509186,0.0000026028051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060449365,0.00067906844,0.003584518,0.000018922165,0.0001738431,0.000011845517,0.0089402925,0.005799653,0.025333304,0.86178905,0.00008370907,0.093525335],"study_design_scores_gemma":[0.0020060537,0.0007096214,0.10978885,0.00021051847,0.000022845226,0.00038172753,0.00014633728,0.64631623,0.060220398,0.1798487,0.00006584158,0.000282869],"about_ca_topic_score_codex":0.00024050102,"about_ca_topic_score_gemma":0.000040105944,"teacher_disagreement_score":0.6819404,"about_ca_system_score_codex":0.000098493634,"about_ca_system_score_gemma":0.00032943752,"threshold_uncertainty_score":0.40816146},"labels":[],"label_agreement":null},{"id":"W2170001390","doi":"10.1016/j.ic.2017.06.003","title":"Space proof complexity for random 3-CNFs","year":2017,"lang":"en","type":"preprint","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"European Research Council; Seventh Framework Programme; Sapienza Università di Roma; European Commission; Simons Foundation","keywords":"Lemma (botany); Mathematics; Combinatorics; Omega; Bipartite graph; Resolution (logic); Monomial; Upper and lower bounds; Discrete mathematics; Space (punctuation); Algebraic number; Disjoint sets; Physics; Computer science; Mathematical analysis; Graph","score_opus":0.03906740328881324,"score_gpt":0.29528677347701904,"score_spread":0.2562193701882058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170001390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004720277,0.000097183,0.98944837,0.0017943929,0.00080710114,0.00088414655,0.00003635282,0.00021268043,0.0019995258],"genre_scores_gemma":[0.88305444,0.00003391914,0.11536434,0.0006240198,0.00014214497,0.00016713607,0.00053051766,0.000009183022,0.000074303694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900913,0.00004102015,0.00037427133,0.00020952601,0.00020527706,0.00016074635],"domain_scores_gemma":[0.9985922,0.000109795365,0.00060898514,0.00039524393,0.00022788407,0.000065871995],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005214862,0.0001841064,0.0002513132,0.000140879,0.0003428609,0.0012695374,0.0005292969,0.00014360622,0.0000023508796],"category_scores_gemma":[0.000077029465,0.0001746421,0.00008516737,0.00004052464,0.00006751999,0.0015309611,0.00052548834,0.00016394597,0.000015478092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072783674,0.000035300734,0.000030967236,0.0006938706,0.000049455328,6.49143e-7,0.0040393663,0.009654651,0.000007857171,0.29124454,0.004980309,0.68919027],"study_design_scores_gemma":[0.0010489852,0.00003011593,0.00074868323,0.000073533534,0.000008305564,0.000005946127,0.000033664583,0.77111846,0.00010691356,0.22013162,0.006506957,0.00018681862],"about_ca_topic_score_codex":0.000030373589,"about_ca_topic_score_gemma":0.0000034480186,"teacher_disagreement_score":0.87833416,"about_ca_system_score_codex":0.000034859724,"about_ca_system_score_gemma":0.00010586142,"threshold_uncertainty_score":0.99976724},"labels":[],"label_agreement":null},{"id":"W2170271350","doi":"10.1007/978-3-540-85238-4_21","title":"On a Special Class of Primitive Words","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Complement (music); Word (group theory); Complementarity (molecular biology); Mathematics; Combinatorics; Class (philosophy); Sequence (biology); Combinatorics on words; Discrete mathematics; Computer science; Biology; Artificial intelligence; Genetics","score_opus":0.013332276532949107,"score_gpt":0.2273662514768892,"score_spread":0.21403397494394008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170271350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005436913,0.00017817748,0.96559256,0.00028671612,0.0021998123,0.00027362187,0.000008435124,0.00011038779,0.030806618],"genre_scores_gemma":[0.61748666,0.00026657362,0.3704326,0.00548325,0.004760981,0.000015999003,0.00001024293,0.00010787163,0.0014358159],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647397,0.0000387729,0.0005093054,0.0012940518,0.0011415958,0.0005423029],"domain_scores_gemma":[0.99717677,0.00078737235,0.00036348775,0.0013691431,0.00017047825,0.00013275712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005286911,0.00047765343,0.00061072444,0.00082133827,0.00016171118,0.00015018949,0.0033544768,0.0002958489,0.00004653652],"category_scores_gemma":[0.00009851009,0.00041879396,0.00018570568,0.0005687037,0.0010953201,0.0003551797,0.0010726877,0.0007202931,0.000056958783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018051896,0.00006735542,0.000008669271,0.000024318704,0.000014680987,0.00019548084,0.0020421466,0.00540786,0.000112898684,0.24057561,0.00028806052,0.75124484],"study_design_scores_gemma":[0.00091704784,0.0011401075,0.0005106448,0.0015616746,0.000013996873,0.00026551666,5.903358e-7,0.27104717,0.008986779,0.70593804,0.007897155,0.0017212421],"about_ca_topic_score_codex":0.00000739341,"about_ca_topic_score_gemma":0.00001358623,"teacher_disagreement_score":0.74952364,"about_ca_system_score_codex":0.00023493404,"about_ca_system_score_gemma":0.0005343544,"threshold_uncertainty_score":0.9998264},"labels":[],"label_agreement":null},{"id":"W2171278552","doi":"10.1016/j.tcs.2011.06.012","title":"The Černý conjecture for one-cluster automata with prime length cycle","year":2011,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Conjecture; Prime (order theory); Combinatorics; Cluster (spacecraft); Automaton; Mathematics; Computer science; Theoretical computer science","score_opus":0.013767798483434209,"score_gpt":0.23932951504386277,"score_spread":0.22556171656042856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171278552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009183946,0.00012868141,0.981173,0.003254412,0.0016975596,0.0012316456,0.000017391863,0.0007627476,0.0025506115],"genre_scores_gemma":[0.75457937,0.0000186274,0.24385355,0.0009815826,0.00035427688,0.000120342556,0.0000061629967,0.000039739327,0.00004632468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99486244,0.00025384303,0.00053820765,0.0019086618,0.0011530871,0.0012837341],"domain_scores_gemma":[0.9939341,0.0012345035,0.0003413849,0.0037321546,0.00036619234,0.0003916448],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.003652096,0.0006049493,0.0005782064,0.00017513106,0.0012843347,0.0021076447,0.010867484,0.00026393586,0.000017137505],"category_scores_gemma":[0.00012816238,0.0003584546,0.00021204492,0.0005708523,0.0055823955,0.00054167607,0.007953278,0.0008682346,0.000073344905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049683873,0.0000922648,0.0000045193597,0.00003973039,0.00003616567,0.000006254555,0.00079045113,0.00021644801,0.000033743432,0.952824,0.00015664283,0.045750074],"study_design_scores_gemma":[0.0003917889,0.00032273933,0.00015447388,0.00014875674,0.000024130786,0.00004420925,0.0000056211748,0.46698862,0.0018380551,0.5292242,0.0003935315,0.00046387798],"about_ca_topic_score_codex":0.000010033082,"about_ca_topic_score_gemma":0.0000031772415,"teacher_disagreement_score":0.7453954,"about_ca_system_score_codex":0.00011907539,"about_ca_system_score_gemma":0.0006372516,"threshold_uncertainty_score":0.99988675},"labels":[],"label_agreement":null},{"id":"W2172381877","doi":"10.1090/proc/13297","title":"Transcendence tests for Mahler functions","year":2016,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transcendence (philosophy); Eigenvalues and eigenvectors; Rank (graph theory); Mathematics; Lambda; Pure mathematics; Matrix (chemical analysis); Function (biology); Combinatorics; Physics; Philosophy; Quantum mechanics; Theology","score_opus":0.022991557692708768,"score_gpt":0.27299402095358244,"score_spread":0.25000246326087366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172381877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07582453,0.000094361916,0.90142286,0.01735681,0.00037832258,0.0012601864,0.00008965033,0.0004446265,0.0031286334],"genre_scores_gemma":[0.6942048,0.000054140193,0.3018077,0.0011173134,0.00030843474,0.0004885141,0.0000012907274,0.00006586576,0.0019519523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807626,0.000009289457,0.0004533327,0.0005911596,0.00046215148,0.00040778617],"domain_scores_gemma":[0.99787164,0.00044701467,0.0007596788,0.0005233135,0.00029654268,0.00010183221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006091973,0.00030481344,0.00059477286,0.000027058677,0.00016436027,0.00013917715,0.0026714834,0.00012055286,0.000013165476],"category_scores_gemma":[0.00023245244,0.00017765435,0.0009843785,0.00031728274,0.00046977596,0.00018637495,0.0012691249,0.00033666907,0.000013442722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038972164,0.00074861845,0.0007142235,0.0044687246,0.00069582404,2.3031043e-7,0.0060914042,0.000011827105,0.049053036,0.810792,0.09146622,0.03591886],"study_design_scores_gemma":[0.00020952783,0.00008040901,0.00054217427,0.00067926204,0.000091651054,0.000009426211,0.00029394933,0.014086007,0.0045527196,0.9784128,0.0006689082,0.00037317732],"about_ca_topic_score_codex":0.000004415925,"about_ca_topic_score_gemma":1.0381585e-7,"teacher_disagreement_score":0.61838025,"about_ca_system_score_codex":0.00013633362,"about_ca_system_score_gemma":0.000086642525,"threshold_uncertainty_score":0.72445345},"labels":[],"label_agreement":null},{"id":"W2174018860","doi":"10.1016/j.tcs.2015.04.017","title":"State complexity of inversion operations","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Yonsei University","keywords":"Substring; Inversion (geology); Nondeterministic algorithm; Prefix; Upper and lower bounds; Computational complexity theory; Mathematics; Combinatorics; Algorithm; Computer science; Discrete mathematics; Data structure","score_opus":0.04010833710941971,"score_gpt":0.2705048822927333,"score_spread":0.23039654518331357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174018860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16060247,0.000013404786,0.83617353,0.00074001146,0.0004276642,0.00008146634,0.0000022073325,0.00012742956,0.0018318421],"genre_scores_gemma":[0.78414,0.0000010690933,0.21547738,0.00034229804,0.000027220289,0.0000012863898,6.3404127e-7,0.0000029681983,0.0000071638856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825424,0.00011470387,0.0002440591,0.00041011174,0.00064917566,0.00032768628],"domain_scores_gemma":[0.9985047,0.00008249415,0.000044085322,0.000743706,0.0003054038,0.0003195861],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016030285,0.00011364033,0.0001713253,0.0001454225,0.00018739188,0.00019568596,0.0021718435,0.000023916671,0.000017842405],"category_scores_gemma":[0.00008726341,0.00009010854,0.000041232783,0.000963769,0.004128497,0.00081112166,0.0012591972,0.000101606034,0.00006662938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003896024,0.00004795654,0.000029425062,0.0000027413628,0.0000015936919,0.000003154987,0.00076857285,0.0007977087,0.00082477584,0.98734224,0.00009301115,0.010084907],"study_design_scores_gemma":[0.00015094528,0.000121386656,0.00022961175,0.000009976403,0.0000010863962,0.0000091875345,0.000009845935,0.61856043,0.009547578,0.37123555,0.000036978396,0.000087440654],"about_ca_topic_score_codex":0.000016253738,"about_ca_topic_score_gemma":0.0000013445801,"teacher_disagreement_score":0.62353754,"about_ca_system_score_codex":0.000046790734,"about_ca_system_score_gemma":0.0002111395,"threshold_uncertainty_score":0.9985817},"labels":[],"label_agreement":null},{"id":"W2176863542","doi":"10.1016/j.tcs.2007.03.023","title":"Powers in a class of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi mathvariant=\"script\">A</mml:mi></mml:math>-strict standard episturmian words","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Scroll; Class (philosophy); Mathematics; Algorithm; Computer science; Artificial intelligence; Theology; Philosophy","score_opus":0.010309950302254896,"score_gpt":0.2403761296158783,"score_spread":0.2300661793136234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176863542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6694843,0.00007445757,0.3264866,0.00037771394,0.000958578,0.000065028966,0.00001970801,0.00014815414,0.0023854424],"genre_scores_gemma":[0.95393133,0.000027010496,0.04475026,0.0009907219,0.00022282575,0.000017173348,0.000008095698,0.000041462994,0.000011150584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950283,0.00016585649,0.000881662,0.0011044982,0.0015717121,0.0012479624],"domain_scores_gemma":[0.9966568,0.0008817605,0.0003814782,0.0014968361,0.00012534874,0.00045777753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0049995366,0.00039293882,0.000368232,0.00035300877,0.00044490435,0.00059919327,0.0030464397,0.00029574198,0.00003146702],"category_scores_gemma":[0.0003821085,0.00039464532,0.0002872363,0.0016565253,0.0026636177,0.00097536435,0.0018240011,0.0005922491,0.0001661301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018871677,0.0001493241,0.000023534329,0.00005904618,0.000026092395,0.00032651034,0.001359559,0.0002843954,0.0010878852,0.98753047,0.000079210986,0.008885242],"study_design_scores_gemma":[0.000624983,0.0006090382,0.0005972075,0.00026435734,0.000024682464,0.00020911153,0.00013451112,0.9690022,0.006982231,0.020753365,0.0003963004,0.00040204322],"about_ca_topic_score_codex":0.00006905833,"about_ca_topic_score_gemma":0.000021571504,"teacher_disagreement_score":0.96871775,"about_ca_system_score_codex":0.00006243085,"about_ca_system_score_gemma":0.00048482165,"threshold_uncertainty_score":0.9998506},"labels":[],"label_agreement":null},{"id":"W2177646325","doi":"10.1007/978-3-642-30642-6_4","title":"The Complexity of Intersecting Finite Automata Having Few Final States","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Intersection (aeronautics); Automaton; Commutative property; Quantum finite automata; Computer science; Limiting; Finite-state machine; Deterministic finite automaton; Transformation (genetics); DFA minimization; Computational complexity theory; Discrete mathematics; ω-automaton; Automata theory; Theoretical computer science; Algebra over a field; Mathematics; Algorithm; Pure mathematics","score_opus":0.04821360167386302,"score_gpt":0.2649948956859152,"score_spread":0.2167812940120522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177646325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061818055,0.0012209812,0.9940909,0.00074521126,0.001831868,0.0002489234,0.000010650256,0.0001966608,0.0010366197],"genre_scores_gemma":[0.78318727,0.00014535197,0.21529964,0.00070369174,0.00044735163,0.00000747878,0.000008081651,0.000043883185,0.00015725964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964904,0.00008166744,0.0007218699,0.0009564483,0.00090312236,0.000846501],"domain_scores_gemma":[0.9952023,0.0021148373,0.0006054412,0.0017255322,0.00020619047,0.00014566827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00229606,0.00048812307,0.0005370746,0.0004093788,0.00057484716,0.00059149717,0.0049215076,0.00018911739,0.000020412916],"category_scores_gemma":[0.00019138325,0.0003567253,0.00017631607,0.00048458492,0.0024424512,0.00070633786,0.002812053,0.0008323256,0.000025886937],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008015423,0.00003166268,0.00011895512,0.00006099295,0.000019408006,0.000020628986,0.0020042448,0.005243225,0.0001136852,0.10265494,0.000022482001,0.8897018],"study_design_scores_gemma":[0.00017755441,0.00010386629,0.00035449144,0.00054881506,0.0000087091075,0.00005872617,0.000001627086,0.6303831,0.0012323968,0.36582518,0.0008566235,0.00044896637],"about_ca_topic_score_codex":0.00006213517,"about_ca_topic_score_gemma":0.00009730835,"teacher_disagreement_score":0.8892528,"about_ca_system_score_codex":0.00018496852,"about_ca_system_score_gemma":0.00027615792,"threshold_uncertainty_score":0.9998885},"labels":[],"label_agreement":null},{"id":"W2178095809","doi":"10.1142/s0129054115500124","title":"State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regular language; Prefix; Intersection (aeronautics); Upper and lower bounds; Alphabet; Combinatorics; Mathematics; State (computer science); Discrete mathematics; Deterministic finite automaton; Nondeterministic finite automaton; Finite-state machine; Binary number; Automaton; Automata theory; Computer science; Arithmetic; Theoretical computer science; Algorithm","score_opus":0.03549565474146355,"score_gpt":0.3102429891193492,"score_spread":0.2747473343778857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178095809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18507746,0.00006687178,0.812347,0.0011527509,0.001140768,0.00007390632,0.000012118358,0.000013266752,0.0001158611],"genre_scores_gemma":[0.74465007,0.000009690506,0.25516307,0.000065423716,0.000094743766,0.000001084463,0.0000015533742,0.0000029819673,0.00001138234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998419,0.000054008917,0.0005017084,0.00017453206,0.0007306187,0.00012014254],"domain_scores_gemma":[0.99668956,0.00014079959,0.0006668297,0.0003162226,0.0020887956,0.0000978129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017434251,0.00008549099,0.00018213839,0.00043801704,0.000060725208,0.00017004988,0.0020114298,0.000019473333,0.0000016677964],"category_scores_gemma":[0.00022207916,0.00007499052,0.00007529179,0.00030389306,0.0005627273,0.0016282503,0.00045431042,0.00006698945,4.6455983e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002049498,0.0005847831,0.0017705859,0.0000658032,0.00023040915,0.000014711825,0.006690939,0.0058796178,0.035633724,0.61983675,0.002992611,0.32609513],"study_design_scores_gemma":[0.0039518513,0.0016516617,0.015273522,0.00040468364,0.000031625135,0.00071675365,0.0003614617,0.34974822,0.07868938,0.54583573,0.002973583,0.00036154754],"about_ca_topic_score_codex":0.000028764085,"about_ca_topic_score_gemma":0.000007081035,"teacher_disagreement_score":0.55957264,"about_ca_system_score_codex":0.00007263243,"about_ca_system_score_gemma":0.00028374905,"threshold_uncertainty_score":0.37377706},"labels":[],"label_agreement":null},{"id":"W2179921374","doi":"10.1007/978-3-642-39310-5_11","title":"Nondeterministic State Complexity of Proportional Removals","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; State (computer science); Computer science; Mathematics; Theoretical computer science; Algorithm","score_opus":0.030457535285911327,"score_gpt":0.25548739443683566,"score_spread":0.22502985915092433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179921374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008646755,0.00016844971,0.9931704,0.00034509454,0.0010389088,0.00042280133,0.000018785999,0.00013525669,0.0038356446],"genre_scores_gemma":[0.34879926,0.000025545252,0.64888316,0.00094064896,0.000260298,0.000011696289,0.000011428511,0.000040755258,0.0010271907],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620306,0.00004177872,0.0008025699,0.0012343692,0.0011479165,0.00057030754],"domain_scores_gemma":[0.9970118,0.00037617097,0.0006127882,0.0014853611,0.00034986576,0.00016402944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009344585,0.0004659643,0.00066241284,0.00059193757,0.00015219713,0.0002918988,0.003350969,0.00018849153,0.0001414524],"category_scores_gemma":[0.00008384261,0.0004004685,0.00015385404,0.0004055018,0.0020505611,0.0005513236,0.0013876554,0.00051620096,0.00010411099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006824664,0.000066860935,0.000038707294,0.00012816211,0.000019497533,0.000118558506,0.0005286319,0.003412406,0.0008705317,0.22021951,0.00006301117,0.7745273],"study_design_scores_gemma":[0.00015018854,0.00013631841,0.0004097869,0.0002884954,0.000004491521,0.00009551097,6.552498e-8,0.2955319,0.0021875696,0.7004307,0.00033905235,0.00042593887],"about_ca_topic_score_codex":0.000030892603,"about_ca_topic_score_gemma":0.000014811063,"teacher_disagreement_score":0.7741014,"about_ca_system_score_codex":0.0001516946,"about_ca_system_score_gemma":0.0006278093,"threshold_uncertainty_score":0.99984473},"labels":[],"label_agreement":null},{"id":"W2183545083","doi":"10.1007/978-3-662-07003-1_11","title":"Finite Variable Logics","year":2004,"lang":"en","type":"book-chapter","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"T-norm fuzzy logics; Variable (mathematics); Mathematics; Monoidal t-norm logic; Fixed point; Expressive power; Discrete mathematics; Point (geometry); Pure mathematics; Computer science; Theoretical computer science; Mathematical analysis; Artificial intelligence; Geometry; Fuzzy logic","score_opus":0.018183411809687536,"score_gpt":0.2031866667813785,"score_spread":0.18500325497169096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183545083","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.1466354e-8,0.00015160831,0.41529113,0.00011383543,0.00028302023,0.00005227597,0.000004066171,0.00029242202,0.5838116],"genre_scores_gemma":[0.00028631865,0.00008265614,0.09418828,0.002164572,0.00015141242,0.0000025430263,0.000012434414,0.000025295609,0.9030865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888545,0.000005848273,0.00021112108,0.00044299304,0.00023062009,0.00022397596],"domain_scores_gemma":[0.9987821,0.00011841212,0.00010272045,0.0008712418,0.000046963745,0.000078582016],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001715975,0.00024996654,0.00024341838,0.00009108863,0.00006606781,0.00015508952,0.0011151404,0.00026734787,0.0025078226],"category_scores_gemma":[0.000011730436,0.00020619256,0.000098080665,0.00003811275,0.000041922343,0.00018312343,0.00042908953,0.0002438846,0.001565974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.5698505e-7,0.0000062615454,1.2169029e-7,0.000010387862,0.000014205828,0.000032083277,0.000018925626,0.00012739777,0.0000045932243,0.9914926,0.0024044844,0.005888434],"study_design_scores_gemma":[0.00007680968,0.000026950474,5.8669366e-7,0.000057435467,0.0000053260596,0.00001003497,4.849371e-7,0.0022521317,0.000024663603,0.724245,0.27307522,0.00022532442],"about_ca_topic_score_codex":0.000012148347,"about_ca_topic_score_gemma":9.910808e-7,"teacher_disagreement_score":0.32110283,"about_ca_system_score_codex":0.0000575834,"about_ca_system_score_gemma":0.00014709908,"threshold_uncertainty_score":0.99921143},"labels":[],"label_agreement":null},{"id":"W2187598595","doi":"","title":"The Least Self-Shuffle of the Thue-Morse Sequence","year":2014,"lang":"en","type":"article","venue":"J. Integer Seq.","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Morse code; Sequence (biology); Mathematics; Directive; Combinatorics; Computer science; Genetics; Biology; Telecommunications","score_opus":0.007924220440223888,"score_gpt":0.21584797314105525,"score_spread":0.20792375270083135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187598595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53394556,0.0010560399,0.33008733,0.028883295,0.0078044115,0.0010560333,0.000021264214,0.0014946517,0.09565142],"genre_scores_gemma":[0.99617124,0.0000115935945,0.0017056345,0.0009216873,0.00010208028,0.000010994292,3.1967681e-7,0.000009496376,0.0010669378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987601,0.00018155608,0.00023347409,0.00025335432,0.0003019417,0.00026956582],"domain_scores_gemma":[0.99809945,0.0003338927,0.00014695247,0.0012841196,0.00008537677,0.00005023694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007620018,0.00013131644,0.0001432924,0.000025831589,0.00023680164,0.00012891542,0.0023173245,0.000051154693,0.000016012436],"category_scores_gemma":[0.00010754558,0.000064855245,0.00012067593,0.00030208618,0.00017414574,0.00022390018,0.0005135315,0.0002047904,0.00011686065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051004777,0.00006132435,0.0007926359,0.000018722909,0.000030228884,0.0000022362078,0.0019016279,0.000053858468,0.0042549926,0.9477666,0.0068946728,0.03821797],"study_design_scores_gemma":[0.0007730636,0.00026811316,0.01573616,0.00027327283,0.00004292455,0.00016968217,0.00067024754,0.43891668,0.060682353,0.19457273,0.28707114,0.00082363654],"about_ca_topic_score_codex":0.000047678303,"about_ca_topic_score_gemma":0.000019111158,"teacher_disagreement_score":0.7531939,"about_ca_system_score_codex":0.000032162654,"about_ca_system_score_gemma":0.00006573812,"threshold_uncertainty_score":0.4306204},"labels":[],"label_agreement":null},{"id":"W2188416243","doi":"10.1007/3-540-45007-6_32","title":"Boolean Grammars","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Tree-adjoining grammar; L-attributed grammar; Indexed grammar; Computer science; Context-sensitive grammar; Phrase structure grammar; Context-free grammar; Programming language; Rule-based machine translation; Definite clause grammar; Extended Affix Grammar; Parsing; Theoretical computer science; Artificial intelligence","score_opus":0.01178501727695145,"score_gpt":0.22222122782973502,"score_spread":0.21043621055278358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188416243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025790448,0.00066816545,0.9857846,0.0009047185,0.0024519041,0.00025812496,0.0000032459604,0.00028554042,0.009617901],"genre_scores_gemma":[0.02727629,0.0001183739,0.9575796,0.011967371,0.00064964895,0.000012676774,0.0000072912567,0.00009265588,0.0022960873],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593985,0.000044120956,0.00049814256,0.0016992707,0.0009801042,0.00083850493],"domain_scores_gemma":[0.9970285,0.0003500184,0.00025304846,0.0020001186,0.00013908923,0.00022921813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010958633,0.0005911641,0.00053465704,0.00074983964,0.00025962674,0.0006901421,0.0043783262,0.00033609368,0.00005073212],"category_scores_gemma":[0.00007256954,0.000535365,0.00017834116,0.000602137,0.00071556325,0.0006284886,0.0011737088,0.00082556653,0.0001431939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018329799,0.000021975762,0.000015618534,0.000020424977,0.000008912152,0.00015105082,0.00026946602,0.0027454416,0.00009711993,0.2525601,0.0001772866,0.74393076],"study_design_scores_gemma":[0.00023553471,0.0001252884,0.000029542074,0.0002566119,0.0000066060475,0.00021140953,1.1244378e-7,0.14764608,0.0009258822,0.8349147,0.014741179,0.00090703997],"about_ca_topic_score_codex":0.000011798717,"about_ca_topic_score_gemma":0.000020341968,"teacher_disagreement_score":0.74302375,"about_ca_system_score_codex":0.00025189001,"about_ca_system_score_gemma":0.00033980634,"threshold_uncertainty_score":0.9997098},"labels":[],"label_agreement":null},{"id":"W2188978818","doi":"10.1080/00150517.2004.12428402","title":"On Tribonacci Sequences","year":2004,"lang":"en","type":"article","venue":"˜The œFibonacci quarterly","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Morphism; Generalization; Mathematics; Simple (philosophy); Point (geometry); Word (group theory); Combinatorics; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.009219202777209468,"score_gpt":0.22692072989398276,"score_spread":0.2177015271167733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188978818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6144228,0.0005844615,0.3466029,0.012871253,0.0024234673,0.0007639364,0.000016638938,0.0014197647,0.020894812],"genre_scores_gemma":[0.994521,0.0000038044525,0.0022533697,0.0025011937,0.00016535561,0.000036353835,0.000003406809,0.00001700752,0.00049847376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981047,0.00010957113,0.00031153022,0.0005235042,0.00046057501,0.00049011334],"domain_scores_gemma":[0.9983129,0.00025734122,0.00012507755,0.0011356752,0.000047160127,0.000121836965],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048704736,0.0002553686,0.0002131778,0.00010634196,0.0003275017,0.00036218678,0.0019182552,0.00008367807,0.000053033236],"category_scores_gemma":[0.00000816211,0.00016958285,0.00015347172,0.00045576633,0.00009592737,0.0005018796,0.0000637004,0.00024502655,0.0011742861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000187884,0.00013387237,0.000021377537,0.00000632229,0.000027127122,0.00006821452,0.002909891,0.00017854046,0.0011284555,0.8716002,0.0017075149,0.12219966],"study_design_scores_gemma":[0.0013264458,0.0015591913,0.0021907021,0.000062823594,0.000012805421,0.00014915715,0.00049409544,0.003154929,0.0011715303,0.9808536,0.008459348,0.0005653799],"about_ca_topic_score_codex":0.00013359918,"about_ca_topic_score_gemma":0.00007739766,"teacher_disagreement_score":0.38009825,"about_ca_system_score_codex":0.00008547638,"about_ca_system_score_gemma":0.00011436342,"threshold_uncertainty_score":0.9996034},"labels":[],"label_agreement":null},{"id":"W2192618602","doi":"10.1017/cbo9780511546563.005","title":"Finite Automata and Other Models of Computation","year":2003,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Automaton; Simple (philosophy); Computer science; Quantum finite automata; Finite-state machine; Theoretical computer science; Deterministic finite automaton; Automata theory; Algorithm; Philosophy","score_opus":0.028115674526389908,"score_gpt":0.19919486829276206,"score_spread":0.17107919376637215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2192618602","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062005056,0.00012322461,0.2614877,0.000009492063,0.00009121731,0.00014861482,0.00008925843,0.00012497985,0.7378635],"genre_scores_gemma":[0.005701063,0.00006520335,0.0065811686,0.00027447316,0.000025888854,3.5447715e-7,0.000012184963,0.000037391743,0.98730224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899364,0.00004547372,0.00017265107,0.00042321187,0.00020444745,0.00016057216],"domain_scores_gemma":[0.99896544,0.00011206583,0.000248438,0.00050240353,0.000083319326,0.000088334215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013058393,0.00023810146,0.00031539108,0.00016701913,0.00008300804,0.00004750406,0.0005677027,0.00019957169,9.0854974e-7],"category_scores_gemma":[0.0000033562999,0.00027218353,0.00009458243,0.000010482912,0.00017319675,0.00019599572,0.00041274456,0.00016722755,0.0000024897092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008527424,0.0000068446125,4.3930748e-7,0.000059324422,0.00004914267,0.000033150005,0.00008562391,0.00016869858,0.000014482314,0.99268335,0.003424531,0.003465897],"study_design_scores_gemma":[0.0013056315,0.00012150229,0.0000098293485,0.00042307517,0.00014095267,0.00004746051,0.000022617156,0.38073313,0.00045944427,0.0051061856,0.6107479,0.0008822766],"about_ca_topic_score_codex":0.000042052357,"about_ca_topic_score_gemma":3.0989173e-7,"teacher_disagreement_score":0.98757714,"about_ca_system_score_codex":0.000039469935,"about_ca_system_score_gemma":0.00004446096,"threshold_uncertainty_score":0.99997306},"labels":[],"label_agreement":null},{"id":"W2209966527","doi":"10.1016/j.crma.2015.12.015","title":"Ensembles reconnaissables de séries formelles sur un corps fini","year":2016,"lang":"fr","type":"article","venue":"Comptes Rendus Mathématique","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Alphabet; Decidability; Natural number; Humanities; Combinatorics; Automaton; Regular language; Field (mathematics); Discrete mathematics; Pure mathematics; Linguistics; Philosophy; Artificial intelligence; Computer science","score_opus":0.028751956643565533,"score_gpt":0.23837286666834578,"score_spread":0.20962091002478025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209966527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41031387,0.058599528,0.47886762,0.03230372,0.0042422772,0.0006345375,0.0002870498,0.0011946608,0.01355674],"genre_scores_gemma":[0.91355026,0.011295408,0.04817152,0.0014478434,0.0006515613,0.00009690614,0.000016735297,0.00012508004,0.024644662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960635,0.00059850176,0.000863906,0.00084491004,0.00037258887,0.0012566337],"domain_scores_gemma":[0.9949368,0.002623817,0.00047512914,0.0013331824,0.00024778637,0.0003832659],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012073006,0.00063252443,0.0007373444,0.00019112989,0.00041339232,0.0005674285,0.0017111289,0.0004529619,0.003107272],"category_scores_gemma":[0.00056955765,0.000488484,0.0002955356,0.0003945979,0.0005950884,0.0014343538,0.0007123776,0.00033553253,0.0018851624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027111557,0.00025932572,0.0016692147,0.00030099208,0.00012699126,0.00018787594,0.002640246,0.000017796405,0.006456954,0.54596555,0.13092463,0.3114233],"study_design_scores_gemma":[0.0017581456,0.00044962476,0.006746573,0.004745537,0.00008826662,0.0015325611,0.00048434673,0.02506336,0.10207434,0.57910925,0.27607936,0.0018686298],"about_ca_topic_score_codex":0.00019268821,"about_ca_topic_score_gemma":0.000081038146,"teacher_disagreement_score":0.5032364,"about_ca_system_score_codex":0.0001960509,"about_ca_system_score_gemma":0.00042197795,"threshold_uncertainty_score":0.9997567},"labels":[],"label_agreement":null},{"id":"W221348902","doi":"10.1109/ccc.2007.32","title":"The Communication Complexity of Correlation","year":2007,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alice and Bob; Alice (programming language); String (physics); Distribution (mathematics); Order (exchange); Combinatorics; Communication complexity; Discrete mathematics; Mathematics; Random variable; Computer science; Statistics","score_opus":0.029656031206740936,"score_gpt":0.26550561563762315,"score_spread":0.23584958443088222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W221348902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016904185,0.00010786016,0.94593805,0.0005685192,0.0000720132,0.00004064726,1.2535487e-7,0.000060247567,0.036308378],"genre_scores_gemma":[0.97675776,0.0000093193075,0.022917153,0.00008515945,0.000004776914,4.1844166e-7,8.638326e-7,9.803e-7,0.00022357808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996488,0.000031715717,0.00011910096,0.000047136135,0.00008720232,0.00006600682],"domain_scores_gemma":[0.99911976,0.00030828852,0.000059783542,0.00046100465,0.000038096492,0.000013049972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091786997,0.00002420266,0.00003158002,0.000015473433,0.00012128349,0.000023876404,0.0005381114,0.000013714216,0.0000075969597],"category_scores_gemma":[0.000021136462,0.000015109913,0.00001632163,0.00012672621,0.000102651175,0.0001218778,0.00011349596,0.000036325986,0.000012512681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012145559,0.0000055876612,0.00022912525,4.874878e-7,0.0000012897432,4.7368818e-8,0.00015054761,0.000006808408,0.00015391047,0.95935416,0.00026491107,0.039831888],"study_design_scores_gemma":[0.00019904965,0.0000339951,0.10723639,0.000011089993,0.0000021398405,0.000005931688,0.00032452162,0.3034396,0.010217436,0.57179105,0.0066423374,0.00009648214],"about_ca_topic_score_codex":0.000055659453,"about_ca_topic_score_gemma":0.00005332238,"teacher_disagreement_score":0.9598536,"about_ca_system_score_codex":0.0000107161295,"about_ca_system_score_gemma":0.000007917969,"threshold_uncertainty_score":0.099995375},"labels":[],"label_agreement":null},{"id":"W2216859873","doi":"10.1007/978-3-319-66396-8","title":"Combinatorics on Words","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences; Université de La Réunion; Università di Bologna; Université de Liège; Università degli Studi di Firenze; University of Waterloo; Christian-Albrechts-Universität zu Kiel; Freie Universität Berlin; Université de Bordeaux; Grantová Agentura České Republiky; Université du Québec à Montréal; King's College London; Aix-Marseille Université; Université de Lyon; Université Savoie Mont Blanc; Dartmouth College; Université Paris Diderot; Murdoch University; Università degli Studi di Napoli Federico II","keywords":"Computer science; Combinatorics; Artificial intelligence; Mathematics","score_opus":0.013754323225868849,"score_gpt":0.25010344606168783,"score_spread":0.236349122835819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216859873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007176627,0.0003077539,0.9733505,0.0007238129,0.005655343,0.0002629498,0.0000040407494,0.00028011447,0.019343708],"genre_scores_gemma":[0.54556584,0.00023462808,0.40824,0.014517298,0.0047062184,0.000075687654,0.000036243695,0.00024895708,0.026375122],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957804,0.0000638787,0.00039090985,0.0016866582,0.0012464782,0.00083168666],"domain_scores_gemma":[0.99507457,0.00066381996,0.00039272942,0.0035196522,0.00014329051,0.00020592997],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012907863,0.00056067767,0.0005800112,0.00075386005,0.0005674977,0.0014698128,0.009509434,0.00037747715,0.000010670029],"category_scores_gemma":[0.00021028593,0.00048948365,0.00015012998,0.0006232156,0.0007934297,0.00071165775,0.0021387984,0.0010906475,0.0001600455],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004376244,0.00008671301,0.000032465916,0.000040276733,0.000009288764,0.00024003864,0.00059951574,0.0032340742,0.000021651056,0.11778344,0.0012398618,0.87670827],"study_design_scores_gemma":[0.00032057983,0.0002585667,0.00017659263,0.00058488763,0.000004530978,0.000047738,6.736659e-8,0.24147084,0.0007595736,0.7459011,0.009702802,0.00077271165],"about_ca_topic_score_codex":0.00001035338,"about_ca_topic_score_gemma":0.000009821302,"teacher_disagreement_score":0.8759356,"about_ca_system_score_codex":0.0005698395,"about_ca_system_score_gemma":0.0012516569,"threshold_uncertainty_score":0.9997557},"labels":[],"label_agreement":null},{"id":"W2220261572","doi":"10.1007/978-0-387-21690-4_15","title":"The Fundamental Theorem of Abelian Extensions","year":2001,"lang":"en","type":"book-chapter","venue":"Universitext","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Abelian group; Mathematics; Section (typography); Extension (predicate logic); Pure mathematics; Field (mathematics); Abelian extension; Discrete mathematics; Computer science","score_opus":0.010116691329333473,"score_gpt":0.1868905009920641,"score_spread":0.17677380966273065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220261572","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011947304,0.0008886121,0.004541035,0.0004512907,0.00035355234,0.0001164579,0.000020341762,0.00009323983,0.993416],"genre_scores_gemma":[0.021683188,0.0010865597,0.00095960585,0.00028343717,0.00007963615,3.3585047e-7,0.0000115930225,0.000025940397,0.9758697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991051,0.000019086734,0.00015532643,0.00028314808,0.00024310405,0.00019421853],"domain_scores_gemma":[0.9986737,0.0001928339,0.00018119362,0.00081060274,0.00007045599,0.00007124908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014156257,0.00018526943,0.00018569586,0.00012709117,0.00028288038,0.00005406376,0.0012734975,0.00012295051,0.0003888088],"category_scores_gemma":[0.0000045753313,0.00013716104,0.00017279507,0.000065162516,0.00025993184,0.00014795721,0.00051211996,0.00018696586,0.0002555932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004916662,0.0000071418813,0.0000019646443,0.0000029079058,0.00003752578,0.000052022122,0.00017371052,0.0000022779038,0.000041027866,0.9440645,0.006006257,0.04960577],"study_design_scores_gemma":[0.00015419166,0.000052266158,0.00002066735,0.0000906068,0.0000232319,0.000024620385,0.0001485248,0.0004951114,0.000030582894,0.11093238,0.8878405,0.0001873179],"about_ca_topic_score_codex":0.000010252197,"about_ca_topic_score_gemma":0.00000674742,"teacher_disagreement_score":0.88183427,"about_ca_system_score_codex":0.00006270687,"about_ca_system_score_gemma":0.000057554378,"threshold_uncertainty_score":0.5593265},"labels":[],"label_agreement":null},{"id":"W2231646746","doi":"10.1093/oxfordhb/9780195307344.013.0011","title":"The Syntax and Semantics of Floating Numeral Quantifiers","year":2008,"lang":"en","type":"book","venue":"Oxford University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Numeral system; Syntax; Locality; Computer science; Semantics (computer science); Dependency (UML); Linguistics; Relation (database); Artificial intelligence; Programming language; Philosophy","score_opus":0.01432814268329649,"score_gpt":0.18468433776234733,"score_spread":0.17035619507905084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231646746","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010471859,0.00023782751,0.020101512,0.00004482879,0.00029276143,0.00023419618,0.000024100542,0.00012968853,0.9778879],"genre_scores_gemma":[0.0016135902,0.000720241,0.00378391,0.000034654906,0.00004353643,2.0333137e-7,0.000004025777,0.00001846622,0.9937814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989802,0.00007162033,0.00016369563,0.00031745376,0.00023805512,0.00022893405],"domain_scores_gemma":[0.9987326,0.00026757258,0.0002700258,0.0006035399,0.000055657132,0.000070576665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016289648,0.00019786175,0.00025824312,0.000061610954,0.0004215581,0.00006851598,0.0011354311,0.00016685322,9.279313e-7],"category_scores_gemma":[0.000011948129,0.00017433782,0.00010619604,0.00001895785,0.00034888228,0.00013025993,0.00097433565,0.00026321018,2.834889e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015529009,0.000005943016,0.000009187487,0.000063199695,0.000081337006,0.000074536634,0.00072445953,0.000009517739,0.000029054298,0.97145164,0.008160894,0.01937469],"study_design_scores_gemma":[0.00019797534,0.000034579283,0.000016133028,0.00011432621,0.000037002257,0.000028309672,0.000054547236,0.0056069735,0.00024579075,0.001799093,0.9916402,0.00022506408],"about_ca_topic_score_codex":0.000042210362,"about_ca_topic_score_gemma":0.000007255153,"teacher_disagreement_score":0.9834793,"about_ca_system_score_codex":0.000053626183,"about_ca_system_score_gemma":0.00012638439,"threshold_uncertainty_score":0.71092904},"labels":[],"label_agreement":null},{"id":"W2232191914","doi":"10.46298/dmtcs.1302","title":"Asymptotic Density of Zimin Words","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Word (group theory); Alphabet; Combinatorics; Homomorphism; Limit (mathematics); Mathematics; Physics; Discrete mathematics; Philosophy; Geometry; Mathematical analysis; Linguistics","score_opus":0.01017574878256319,"score_gpt":0.2404286828056132,"score_spread":0.23025293402305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232191914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094022825,0.000013711456,0.90187246,0.00093980064,0.00033636432,0.00015581712,0.0000033916638,0.00018866366,0.0024669438],"genre_scores_gemma":[0.7076866,0.0000036603192,0.29210618,0.0001286841,0.000043123942,0.0000040067657,1.9819645e-7,0.000010046242,0.000017505328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996979,0.000096107266,0.00055606297,0.00071071927,0.0010018058,0.0006563216],"domain_scores_gemma":[0.996835,0.00084164215,0.00021550096,0.0016044894,0.00021558834,0.00028780635],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021004116,0.00026554902,0.0004131961,0.00021509438,0.00022339198,0.00022990082,0.003473851,0.000068545254,0.000084621744],"category_scores_gemma":[0.00029297228,0.00015682618,0.00015016877,0.0009357307,0.0033588435,0.000730219,0.001700877,0.000111238405,0.00010641127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002962163,0.00007897883,0.000068387526,0.000027238459,0.000007805489,0.0000074980685,0.00074219686,0.0000033196657,0.007875489,0.97118276,0.000025637462,0.01997772],"study_design_scores_gemma":[0.00024811813,0.00014166987,0.0004630846,0.00021859654,0.000010490728,0.000049236518,0.000025415477,0.22267537,0.03304535,0.742827,0.000014988284,0.00028069416],"about_ca_topic_score_codex":0.0000011540776,"about_ca_topic_score_gemma":2.856154e-7,"teacher_disagreement_score":0.61366373,"about_ca_system_score_codex":0.000047821082,"about_ca_system_score_gemma":0.00012866018,"threshold_uncertainty_score":0.99935347},"labels":[],"label_agreement":null},{"id":"W2236411098","doi":"10.1093/analys/anv076","title":"A solution to the donkey sentence problem","year":2015,"lang":"en","type":"article","venue":"Analysis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Donkey; Sentence; Media studies; Computer science; Art; Library science; History; Sociology; Artificial intelligence; Archaeology","score_opus":0.02266169962045956,"score_gpt":0.24652172867639469,"score_spread":0.22386002905593513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236411098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01802128,0.00008727289,0.97082007,0.009231807,0.000066716246,0.00006476305,9.126235e-7,0.00010204705,0.0016051237],"genre_scores_gemma":[0.9786793,0.0000028776815,0.019362753,0.0013480334,0.00004383933,0.000012965997,0.0000018595487,0.0000021857957,0.0005461872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992391,0.000062144965,0.00010581017,0.00021015553,0.00022658063,0.00015622449],"domain_scores_gemma":[0.9992075,0.000029334018,0.000038456124,0.000557013,0.00007563225,0.0000920908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005473457,0.000058789818,0.000097286196,0.000116513176,0.000079243975,0.00012045851,0.0007094296,0.000016237778,0.00000770492],"category_scores_gemma":[0.000030985688,0.00003646872,0.00009097245,0.0018360262,0.000014300512,0.00018712174,0.00021407071,0.00004021206,0.0002627182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028625518,0.0003579152,0.024814887,0.000016130603,0.0025955986,0.000066582914,0.028580185,0.057442613,0.002667522,0.33466724,0.17893627,0.36982644],"study_design_scores_gemma":[0.00014836321,0.00006364887,0.005389871,0.000007843139,0.00028231848,0.000007890582,0.00035600312,0.94688094,0.000539755,0.015059837,0.031028828,0.00023467626],"about_ca_topic_score_codex":0.00040129712,"about_ca_topic_score_gemma":0.00019606289,"teacher_disagreement_score":0.960658,"about_ca_system_score_codex":0.000025648347,"about_ca_system_score_gemma":0.000025236033,"threshold_uncertainty_score":0.33767986},"labels":[],"label_agreement":null},{"id":"W2239741161","doi":"10.1016/j.jalgebra.2016.04.006","title":"Automata, reduced words and Garside shadows in Coxeter groups","year":2016,"lang":"en","type":"preprint","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coxeter group; Mathematics; Class (philosophy); Automaton; Shadow (psychology); Combinatorics; Regular language; Discrete mathematics; Büchi automaton; Order (exchange); Deterministic automaton; Finite-state machine; Pure mathematics; Computer science; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.012023465967148355,"score_gpt":0.24497971571705573,"score_spread":0.2329562497499074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2239741161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9527812,0.0016595233,0.03783207,0.003817291,0.0022972,0.00018932678,0.0000077163595,0.00008478589,0.0013309104],"genre_scores_gemma":[0.9858858,0.00033907476,0.01267854,0.00047795015,0.00046841215,0.000005281948,9.940104e-7,0.000024986712,0.000118973396],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976116,0.00019673382,0.00090848893,0.00042843353,0.00048669928,0.00036807192],"domain_scores_gemma":[0.9978248,0.0002435733,0.000894671,0.00072280143,0.000105592546,0.0002085716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013816702,0.00031296405,0.0006540617,0.00052733754,0.000044297136,0.0003386549,0.0016260507,0.00027320778,0.000040596384],"category_scores_gemma":[0.000115632596,0.0002257393,0.00021126606,0.0001638636,0.00008458797,0.0006392668,0.0014720908,0.0008564691,0.000016783933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045980033,0.0010660822,0.0067169834,0.00088573754,0.00089179055,0.0056224647,0.018876733,0.00015181363,0.022632211,0.31017923,0.022238676,0.6102785],"study_design_scores_gemma":[0.0030788821,0.00041277384,0.05301264,0.0041156313,0.00006629929,0.0019791436,0.00016176177,0.009479947,0.0033381493,0.9214986,0.0017384574,0.0011177106],"about_ca_topic_score_codex":0.000008133125,"about_ca_topic_score_gemma":0.0000036977713,"teacher_disagreement_score":0.61131936,"about_ca_system_score_codex":0.00013028762,"about_ca_system_score_gemma":0.00025071407,"threshold_uncertainty_score":0.9205382},"labels":[],"label_agreement":null},{"id":"W2244935559","doi":"10.1016/j.dam.2016.03.010","title":"Initial non-repetitive complexity of infinite words","year":2016,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Repetition (rhetorical device); Word (group theory); Function (biology); Mathematics; Word length; Combinatorics; Computer science; Linguistics; Natural language processing; Biology; Philosophy; Geometry","score_opus":0.03674040037245721,"score_gpt":0.2879595770724118,"score_spread":0.25121917669995464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244935559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01346757,0.00003791741,0.8876546,0.00019222041,0.0003914557,0.000629734,0.00022073869,0.0002523006,0.097153485],"genre_scores_gemma":[0.7653641,0.000023120117,0.23400384,0.000117355565,0.0001902252,0.00012815544,0.00004257485,0.000050461265,0.00008015193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742377,0.00003562442,0.0008596467,0.0006727853,0.00058116735,0.0004269862],"domain_scores_gemma":[0.99648976,0.0003841762,0.00089225074,0.0019848119,0.00011934388,0.00012963466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056547107,0.0004893671,0.00090377306,0.0001869444,0.000083662184,0.00014454998,0.0021927045,0.00031157004,0.000079619436],"category_scores_gemma":[0.000053017502,0.0003800172,0.00025851303,0.00019889079,0.0005049448,0.00012887591,0.003577229,0.0004500206,0.00011292368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000966723,0.00010832798,0.0000029370067,0.0006814717,0.00009998699,0.0000075277876,0.0041004047,0.0000139763415,0.0018298256,0.9888238,0.00018474204,0.0041373363],"study_design_scores_gemma":[0.00042213235,0.000032457498,0.00007774681,0.000741495,0.000045082397,0.0000060566617,0.00027952687,0.011188162,0.015776241,0.9707334,0.00015066931,0.00054702995],"about_ca_topic_score_codex":0.000008078678,"about_ca_topic_score_gemma":0.000002024823,"teacher_disagreement_score":0.75189656,"about_ca_system_score_codex":0.000053895517,"about_ca_system_score_gemma":0.00016907736,"threshold_uncertainty_score":0.9998652},"labels":[],"label_agreement":null},{"id":"W2246477806","doi":"10.1007/978-1-4612-1200-3_2","title":"Semigroups of Matrices","year":2000,"lang":"en","type":"book-chapter","venue":"Universitext","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Dalhousie University","funders":"","keywords":"Pure mathematics; Mathematics; Algebra over a field; Computer science","score_opus":0.006489637637958679,"score_gpt":0.16920474278433917,"score_spread":0.1627151051463805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246477806","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000109165485,0.0012991714,0.004083582,0.00005937047,0.00013367926,0.00007791863,0.000027237445,0.00014596747,0.9940639],"genre_scores_gemma":[0.008150232,0.0014015747,0.00447511,0.00019640365,0.0001000861,2.3235604e-7,0.000020567302,0.000031494124,0.9856243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990754,0.000011164929,0.0001717261,0.00033963233,0.00024163834,0.00016042103],"domain_scores_gemma":[0.9989857,0.000079400175,0.00017443487,0.0006489126,0.000043458727,0.00006810498],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007303177,0.00020846966,0.00029444828,0.00031138788,0.000055232962,0.000030741954,0.0012172716,0.00019951213,0.0019797783],"category_scores_gemma":[0.0000013585319,0.00021553082,0.00018029998,0.00007324678,0.00007792935,0.00027723526,0.0002702523,0.00016325792,0.00059668184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053304097,0.000008720867,0.000001993701,0.0000216915,0.000042541407,0.000071847426,0.00024791475,0.000009950336,0.000020337347,0.92759395,0.006558611,0.065417096],"study_design_scores_gemma":[0.00019848005,0.00006197675,0.000009368227,0.00018627825,0.00004052335,0.000017792157,0.000022377224,0.0006155938,0.00008872392,0.08642335,0.91198975,0.00034579623],"about_ca_topic_score_codex":0.000015158975,"about_ca_topic_score_gemma":0.0000018733206,"teacher_disagreement_score":0.90543115,"about_ca_system_score_codex":0.0000467996,"about_ca_system_score_gemma":0.000052367297,"threshold_uncertainty_score":0.99893254},"labels":[],"label_agreement":null},{"id":"W2250555305","doi":"","title":"On Panini and the Generative Capacity of Contextualized Replacement Systems","year":2012,"lang":"en","type":"article","venue":"International Conference on Computational Linguistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Generative grammar; Formalism (music); Sanskrit; Computer science; Grammar; Rewriting; Linguistics; Mildly context-sensitive grammar formalism; Adaptive grammar; Emergent grammar; Natural language processing; Programming language; Mathematics; Artificial intelligence; Philosophy; Literature","score_opus":0.0576393092193052,"score_gpt":0.3040569194395782,"score_spread":0.24641761022027298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250555305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06274259,0.00014777816,0.8784258,0.0015613276,0.0063969675,0.00046664802,0.00014055731,0.000098067096,0.05002029],"genre_scores_gemma":[0.9905042,0.000008538659,0.008398157,0.0006430855,0.00028776928,0.000017182432,0.000019759016,0.0000051617603,0.00011615969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866474,0.0001705745,0.00032497823,0.00019162399,0.0005163509,0.00013175432],"domain_scores_gemma":[0.9975234,0.0012927584,0.00024476528,0.0001856432,0.00069375307,0.000059644863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006345115,0.00012645902,0.00017815144,0.00007223896,0.00009338295,0.00012232843,0.0004201435,0.000035466273,0.00002504318],"category_scores_gemma":[0.0011373517,0.00008835353,0.000041343534,0.000060276005,0.00018152526,0.000054789445,0.00010835211,0.00012095926,0.00001767926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008515586,0.00007595046,0.00012445523,0.0000051165125,0.0000528793,7.240073e-7,0.0007271527,0.0032759318,0.000015173023,0.9950448,0.00030970146,0.00028290658],"study_design_scores_gemma":[0.0013291875,0.00009729306,0.0007275254,0.00007456549,0.000007871564,0.0000075478815,0.00010852598,0.77147734,0.00012382168,0.22461854,0.001300295,0.00012747225],"about_ca_topic_score_codex":0.000029814073,"about_ca_topic_score_gemma":5.947985e-7,"teacher_disagreement_score":0.9277616,"about_ca_system_score_codex":0.000044617682,"about_ca_system_score_gemma":0.0000537947,"threshold_uncertainty_score":0.36029524},"labels":[],"label_agreement":null},{"id":"W2250680610","doi":"10.1016/j.tcs.2015.05.003","title":"Studies on finite Sturmian words","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Mathematics; Bijection; Closure (psychology); Combinatorics; Palindrome; Extension (predicate logic); Word (group theory); Inverse; Combinatorics on words; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.03992175234996239,"score_gpt":0.30067441099862086,"score_spread":0.2607526586486585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250680610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05668213,0.00012185345,0.9295914,0.0023925614,0.0025160417,0.00014185645,0.0000010820379,0.0005254332,0.00802765],"genre_scores_gemma":[0.9267901,0.0000037821494,0.07047007,0.0024734421,0.00021666166,0.000006703185,2.7752372e-7,0.000007959502,0.000030968244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717456,0.00015461026,0.00028511774,0.0007887436,0.000995967,0.0006010213],"domain_scores_gemma":[0.9974787,0.00058708276,0.00007456976,0.0011426721,0.00025324884,0.00046369174],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029769524,0.0002241567,0.0002604887,0.0002269863,0.00030840156,0.00044481317,0.0030936105,0.00004396296,0.000006491614],"category_scores_gemma":[0.00048029204,0.00016095302,0.00006123074,0.0013131447,0.0027299153,0.00067517144,0.001553996,0.00021475977,0.00034144078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007799668,0.00005223779,0.000020396827,0.0000028841278,0.000005848397,0.000028572853,0.0020095126,0.0006931853,0.000041764382,0.9756626,0.0003527753,0.02112242],"study_design_scores_gemma":[0.0002884331,0.000511867,0.00008534909,0.00004996348,0.0000032307285,0.000024459534,0.00009932926,0.44322148,0.0042012427,0.5508309,0.0004095465,0.00027418588],"about_ca_topic_score_codex":7.7078545e-7,"about_ca_topic_score_gemma":2.8662294e-7,"teacher_disagreement_score":0.870108,"about_ca_system_score_codex":0.00010778645,"about_ca_system_score_gemma":0.0001655859,"threshold_uncertainty_score":0.9999841},"labels":[],"label_agreement":null},{"id":"W2256344519","doi":"10.37236/5752","title":"Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Sequence (biology); Fibonacci number; Palindromic sequence; Function (biology); Order (exchange); Mathematics; Generating function; Prefix; Property (philosophy); Combinatorics; Discrete mathematics; Algorithm; Arithmetic","score_opus":0.007368100112925745,"score_gpt":0.2320644672937312,"score_spread":0.22469636718080546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256344519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8968421,0.016143946,0.081421696,0.00329438,0.0016097653,0.00034283032,0.000002752462,0.00008068261,0.00026181122],"genre_scores_gemma":[0.9950719,0.0043530227,0.00020578182,0.00012436266,0.00014000347,0.000012316402,6.0449344e-7,0.000025653912,0.000066375374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966253,0.0005160447,0.00095500814,0.00038404283,0.0006717322,0.0008478858],"domain_scores_gemma":[0.9970711,0.0006368681,0.0012109614,0.00082339556,0.00013985005,0.00011783554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032175898,0.0003974078,0.00077952305,0.00033479155,0.00011958556,0.0002558258,0.0031124428,0.00025985288,0.000007543511],"category_scores_gemma":[0.00011699937,0.00024366028,0.00018678443,0.0004442616,0.00015728954,0.00037803504,0.00076904264,0.0019665028,0.0000050606905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034828012,0.00019991663,0.0014704915,0.00013448678,0.00023117379,0.00010288566,0.0019302202,0.00012295357,0.00051285356,0.97784686,0.00018394901,0.017229352],"study_design_scores_gemma":[0.0011819937,0.0002999676,0.0022918095,0.00052377186,0.000040427018,0.00036898183,0.00006953617,0.008378665,0.00056669605,0.9857185,0.00022782336,0.00033185637],"about_ca_topic_score_codex":0.000008472399,"about_ca_topic_score_gemma":0.0000075919984,"teacher_disagreement_score":0.09822974,"about_ca_system_score_codex":0.00055714196,"about_ca_system_score_gemma":0.0012844335,"threshold_uncertainty_score":0.9936178},"labels":[],"label_agreement":null},{"id":"W2260622622","doi":"10.1007/978-3-319-41114-9_6","title":"On the State Complexity of the Shuffle of Regular Languages","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Alphabet; Upper and lower bounds; Deterministic finite automaton; State (computer science); Finite-state machine; Nondeterministic finite automaton; Automaton","score_opus":0.01866464202560329,"score_gpt":0.23776755254319934,"score_spread":0.21910291051759606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2260622622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028552734,0.00026640017,0.9891642,0.0022601439,0.0006657614,0.00030432886,0.000024753299,0.000048562946,0.0044105756],"genre_scores_gemma":[0.9673428,0.000021282485,0.029946072,0.0017085916,0.00013166154,0.0000042936017,6.71028e-7,0.000024443209,0.00082020625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976837,0.00008698532,0.00039821386,0.0006304106,0.0008708923,0.0003298158],"domain_scores_gemma":[0.9961424,0.0011001119,0.00044864017,0.002117951,0.00014462596,0.00004626932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010894886,0.0002868577,0.00037856703,0.00019861851,0.00015024599,0.00008349443,0.0050223656,0.0001056205,0.000032607175],"category_scores_gemma":[0.00012119487,0.00013581754,0.00016238813,0.00035247699,0.0024052255,0.00015623446,0.0014983345,0.00036129396,0.000010130524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005467989,0.000022548329,0.000015020648,0.000029225308,0.000012557721,0.000006549737,0.00080835784,0.0013725951,0.0012496215,0.8043849,0.000053439486,0.1920397],"study_design_scores_gemma":[0.000122045574,0.00009425007,0.0003436768,0.00064104405,0.000003958657,0.000011336187,3.7506362e-7,0.026216894,0.028670296,0.9434699,0.00021161973,0.00021461294],"about_ca_topic_score_codex":0.00002257792,"about_ca_topic_score_gemma":0.000026284279,"teacher_disagreement_score":0.9644875,"about_ca_system_score_codex":0.00006966285,"about_ca_system_score_gemma":0.0001903108,"threshold_uncertainty_score":0.9332888},"labels":[],"label_agreement":null},{"id":"W2261193143","doi":"","title":"Longest path starting at a vertex","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Path (computing); Combinatorics; Computer science; Graph; Computer network","score_opus":0.007865656827534644,"score_gpt":0.20364350290230418,"score_spread":0.19577784607476953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261193143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928557,0.000210546,0.0005789364,0.0007170695,0.0016812929,0.00015476604,7.0830964e-7,0.00034828618,0.0034526477],"genre_scores_gemma":[0.9973156,0.000008055031,0.0015345411,0.00061569124,0.000007489865,0.000027134443,0.0000019546708,0.000012680521,0.0004768766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883425,0.000059837505,0.00019012581,0.0003263719,0.00023071429,0.00035870145],"domain_scores_gemma":[0.998936,0.00013885013,0.00008038488,0.0006532768,0.000061322,0.00013015108],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022401511,0.00013612352,0.0001455407,0.000044875742,0.00017067239,0.000185571,0.00076883676,0.000054271703,0.00015451608],"category_scores_gemma":[0.000050884133,0.00012277199,0.000054700726,0.00023032507,0.00003504315,0.000592512,0.00051162386,0.000105254476,0.001644193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014489813,0.00007673849,0.0034050262,0.000009487481,0.000012456066,0.0000213796,0.0005692407,0.000002082042,0.0028112682,0.95121497,0.026417462,0.015458442],"study_design_scores_gemma":[0.00061030814,0.00010880923,0.018206103,0.000036525762,0.000004332765,0.000013038753,0.000050718234,0.025743805,0.003533868,0.9489328,0.0024311102,0.00032856557],"about_ca_topic_score_codex":0.00008175834,"about_ca_topic_score_gemma":0.0000020772536,"teacher_disagreement_score":0.025741722,"about_ca_system_score_codex":0.00007236177,"about_ca_system_score_gemma":0.000025109151,"threshold_uncertainty_score":0.99913317},"labels":[],"label_agreement":null},{"id":"W2273670553","doi":"10.1007/s00236-016-0258-1","title":"Disjunctivity and other properties of sets of pseudo-bordered words","year":2016,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Combinatorics on words; Mathematics; Combinatorics; Morphism; Suffix; Theta function; Prefix; Word (group theory); Discrete mathematics; Pure mathematics; Geometry; Linguistics","score_opus":0.01445349805396633,"score_gpt":0.21664548021450866,"score_spread":0.20219198216054232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273670553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977722,0.000036717276,0.01842481,0.00048151237,0.000053679716,0.00010171582,0.0000069067937,0.000046846526,0.0031258473],"genre_scores_gemma":[0.9964294,0.0000093559165,0.0033635995,0.00013457857,0.000004629477,0.000004455728,9.710378e-8,0.0000033481115,0.00005057292],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938375,0.00002143081,0.00024914133,0.000071620096,0.00014779596,0.00012623805],"domain_scores_gemma":[0.99934226,0.00007877342,0.00014249858,0.00036721473,0.000033499484,0.000035741643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002246472,0.000077160905,0.00015915431,0.00005192286,0.000024226923,0.000021106518,0.0003304395,0.000031741445,0.000021379834],"category_scores_gemma":[0.000076661905,0.000041074443,0.000027394866,0.00009834223,0.00013023736,0.0008300245,0.00020518959,0.000027040187,0.000007737766],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010036304,0.00025670562,0.006552206,0.00090519653,0.00015411354,0.0000012659622,0.025526682,0.0000018773943,0.15664235,0.15239051,0.0015559811,0.65591276],"study_design_scores_gemma":[0.005419992,0.0011745043,0.055265248,0.003196276,0.00007254402,0.000115621406,0.0020683687,0.089932725,0.77528685,0.044249017,0.021580061,0.0016388142],"about_ca_topic_score_codex":0.000013580861,"about_ca_topic_score_gemma":0.0000014961383,"teacher_disagreement_score":0.6542739,"about_ca_system_score_codex":0.000005815142,"about_ca_system_score_gemma":0.000027215065,"threshold_uncertainty_score":0.16749673},"labels":[],"label_agreement":null},{"id":"W2275529993","doi":"10.1007/978-3-319-09704-6_29","title":"State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Unary operation; Computer science; State (computer science); Programming language; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.022607566690483857,"score_gpt":0.2554334232022315,"score_spread":0.23282585651174764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275529993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018664787,0.00012176474,0.9957535,0.00039222618,0.0004612834,0.00054074795,0.000042189873,0.00013550473,0.00068625825],"genre_scores_gemma":[0.3722545,0.0000075420835,0.62591946,0.0011927553,0.00016564145,0.00001785142,0.000022516535,0.000035218047,0.00038451748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740505,0.00003834065,0.00047753836,0.0010308042,0.0005754701,0.0004728111],"domain_scores_gemma":[0.9974736,0.0005374042,0.00024413674,0.0013605597,0.00026092702,0.00012335696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071366725,0.00041381654,0.0005707322,0.00051528245,0.00021245849,0.00026638267,0.0024714523,0.00015224151,0.000011243074],"category_scores_gemma":[0.000048694663,0.00032917803,0.00011384743,0.00035534933,0.0011677359,0.00033193626,0.0006731173,0.00034171288,0.0000074078084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000460839,0.00009528319,0.000033774948,0.00023676077,0.00005041567,0.00008518256,0.006124018,0.059866212,0.0023731345,0.20721076,0.000042288466,0.72383606],"study_design_scores_gemma":[0.00052042026,0.00062469044,0.00012446713,0.00040846155,0.000012142532,0.00006662063,8.195386e-7,0.89506435,0.0064530345,0.09582577,0.00031512542,0.00058409123],"about_ca_topic_score_codex":0.000032917946,"about_ca_topic_score_gemma":0.00015859168,"teacher_disagreement_score":0.83519816,"about_ca_system_score_codex":0.00008064514,"about_ca_system_score_gemma":0.0003665644,"threshold_uncertainty_score":0.999916},"labels":[],"label_agreement":null},{"id":"W2278164876","doi":"10.1142/s012905411540016x","title":"Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Word (group theory); Complement (music); Generalization; Combinatorics; Binary number; Measure (data warehouse); Similarity (geometry); Natural number; Discrete mathematics; Morse code; Arithmetic; Artificial intelligence; Computer science; Mathematical analysis","score_opus":0.01973837594558339,"score_gpt":0.2763361209495411,"score_spread":0.2565977450039577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278164876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4294693,0.000057755362,0.5652406,0.0039031256,0.0011486647,0.0000970243,0.00000933784,0.000008286225,0.000065865366],"genre_scores_gemma":[0.84158355,0.000008933899,0.15803285,0.00024549212,0.000110054876,0.0000019356785,3.5731017e-7,0.0000040723926,0.0000127370295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788076,0.000059972146,0.00046610183,0.00020558466,0.001218565,0.00016903608],"domain_scores_gemma":[0.99582267,0.0005894387,0.0007127215,0.00083524163,0.0019487463,0.00009119087],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0020210156,0.00012328847,0.00019558451,0.00024762415,0.00023694328,0.00039378018,0.0058798594,0.000029230634,0.0000024642418],"category_scores_gemma":[0.00047471526,0.00007063238,0.00010712325,0.00059209624,0.0011526268,0.0015187277,0.0015648731,0.00016923435,3.7464284e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010863083,0.0013897097,0.043175463,0.00005442887,0.0008767565,0.0000536257,0.017185604,0.082442775,0.00433575,0.7222955,0.008338452,0.11876561],"study_design_scores_gemma":[0.0048481147,0.0015725004,0.23776099,0.00046643039,0.000087812514,0.0011685116,0.0005228512,0.6258518,0.0048525482,0.11875194,0.0036643445,0.00045216296],"about_ca_topic_score_codex":0.000022456967,"about_ca_topic_score_gemma":0.0000150201995,"teacher_disagreement_score":0.6035436,"about_ca_system_score_codex":0.00007399914,"about_ca_system_score_gemma":0.0007480562,"threshold_uncertainty_score":0.9994988},"labels":[],"label_agreement":null},{"id":"W2286338935","doi":"","title":"Journal of Automata, Languages and Combinatorics, Vol. 11(1)","year":2006,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Automaton; Computer science; Mathematics; Programming language; Theoretical computer science","score_opus":0.006748540952273422,"score_gpt":0.22309632727071768,"score_spread":0.21634778631844426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286338935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24063224,0.007668386,0.7213352,0.00808035,0.0012130601,0.00033561987,0.000045787685,0.00045703925,0.020232353],"genre_scores_gemma":[0.8839947,0.0005896979,0.11127098,0.000102454265,0.00006169482,0.000011036786,0.000063395026,0.00003609289,0.0038699398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995682,0.0024433,0.0006098671,0.0005006016,0.00048378928,0.00028041622],"domain_scores_gemma":[0.99393713,0.0010140011,0.0008805338,0.0018226153,0.002191068,0.00015463457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0054333117,0.00027737874,0.00042994387,0.00026034963,0.00018882832,0.0006788519,0.0024086977,0.00022359945,0.000018338736],"category_scores_gemma":[0.0009363981,0.00026943555,0.0001707633,0.00028984345,0.00020066276,0.0002951426,0.0022957923,0.0005290247,0.000007297011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004650702,0.0007972926,0.004121974,0.00028547252,0.000096620184,0.00005589146,0.0066279657,0.000048491118,0.00088773115,0.8770694,0.0147895245,0.095215],"study_design_scores_gemma":[0.004847595,0.000006148299,0.06298131,0.009366084,0.00026263398,0.00068549794,0.00060929,0.2673491,0.11348867,0.44831845,0.08899147,0.0030937775],"about_ca_topic_score_codex":0.00074564526,"about_ca_topic_score_gemma":0.0002104231,"teacher_disagreement_score":0.64336246,"about_ca_system_score_codex":0.00007483594,"about_ca_system_score_gemma":0.00023048032,"threshold_uncertainty_score":0.9999758},"labels":[],"label_agreement":null},{"id":"W2287420140","doi":"","title":"Abstract numeration systems or decimation of languages","year":2011,"lang":"en","type":"article","venue":"Open Repository and Bibliography (University of Liège)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decimation; Integer (computer science); Combinatorics; Mathematics; Sequence (biology); Discrete mathematics; Bounded function; Word (group theory); Arithmetic; Computer science; Programming language; Telecommunications; Geometry","score_opus":0.029082824484588557,"score_gpt":0.22757069856101855,"score_spread":0.19848787407642998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287420140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9475379,0.0004961256,0.02892851,0.0000316313,0.00016125017,0.00023444234,0.000006273219,0.000048383205,0.022555502],"genre_scores_gemma":[0.99132854,0.0002150239,0.008310616,0.000006171033,0.000008102775,2.5473648e-7,0.0000015231426,0.000001997321,0.0001277782],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994863,0.00005084159,0.000114958326,0.00016188774,0.00011598772,0.00007001299],"domain_scores_gemma":[0.9993991,0.000042781456,0.00020320322,0.0002374176,0.0000763867,0.00004110183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024370324,0.00006112831,0.00013648788,0.0015689644,0.00013589751,0.000087497,0.0005509078,0.0000473936,0.000021146685],"category_scores_gemma":[1.7160721e-7,0.00005589576,0.00005024854,0.0023757238,0.00007066373,0.0012704167,0.00017317565,0.00003580789,0.0000011289002],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080816244,0.0011733432,0.69552696,0.0009618955,0.00061739574,0.0004154031,0.018224515,0.000030406558,0.114421725,0.14426354,0.012693227,0.010863428],"study_design_scores_gemma":[0.0006074126,0.00027999099,0.9804448,0.0002188585,0.000041082596,0.0000489433,0.004210209,0.0015242626,0.011687822,0.0005994055,0.000120437675,0.00021677988],"about_ca_topic_score_codex":0.0027847146,"about_ca_topic_score_gemma":0.0000061206647,"teacher_disagreement_score":0.28491783,"about_ca_system_score_codex":0.0000020046386,"about_ca_system_score_gemma":0.00001598226,"threshold_uncertainty_score":0.4209674},"labels":[],"label_agreement":null},{"id":"W2288306272","doi":"10.1016/j.tcs.2016.02.034","title":"The effect of end-markers on counter machines and commutativity","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Commutative property; Nondeterministic algorithm; Mathematics; Decidability; Deterministic pushdown automaton; Finite-state machine; Discrete mathematics; Bounded function; Nested word; Closure (psychology); Regular language; Pushdown automaton; Class (philosophy); Quotient; Automaton; Quantum finite automata; Nondeterministic finite automaton; Combinatorics; Automata theory; Computer science; Algorithm; Theoretical computer science","score_opus":0.0032313319446241667,"score_gpt":0.23135244729608526,"score_spread":0.2281211153514611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288306272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4297534,0.000038281214,0.5658057,0.002351215,0.00035540247,0.00013773119,0.0000029275518,0.00008339059,0.0014719613],"genre_scores_gemma":[0.996662,0.000009044491,0.0030102965,0.0002673665,0.000033956923,0.000004830444,6.6315486e-8,0.000004591343,0.000007845079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982035,0.00035284797,0.00018597579,0.00040301282,0.0004989123,0.0003557293],"domain_scores_gemma":[0.9935946,0.0054143956,0.00007231912,0.0007634209,0.00005346084,0.00010184357],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035161062,0.00015297892,0.00018369257,0.000068010384,0.00040525614,0.00020414736,0.00181133,0.000026733404,0.000012358428],"category_scores_gemma":[0.00023057095,0.00006357607,0.00004779244,0.00031903206,0.0054104063,0.00034035833,0.0008793876,0.0000908376,0.000016641769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032276654,0.000008208015,0.0003127632,0.0000039708816,0.0000034230547,0.0000020096136,0.00006277019,0.000001630514,0.0012513618,0.70048386,0.00003904102,0.2977987],"study_design_scores_gemma":[0.0014807704,0.0038410518,0.017845526,0.00027637897,0.000013023734,0.000078289675,0.0000051116667,0.5029089,0.07878415,0.39382,0.00045190062,0.00049492903],"about_ca_topic_score_codex":0.0000028490908,"about_ca_topic_score_gemma":4.9889064e-7,"teacher_disagreement_score":0.5669086,"about_ca_system_score_codex":0.000023447972,"about_ca_system_score_gemma":0.000025324785,"threshold_uncertainty_score":0.9972963},"labels":[],"label_agreement":null},{"id":"W2291478302","doi":"","title":"Image texture analysis using weighted finite automata","year":2003,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Automaton; Nondeterministic finite automaton; Mathematics; Texture (cosmology); Finite-state machine; DFA minimization; ENCODE; Image texture; Algorithm; Image (mathematics); Hausdorff space; Quantum finite automata; Computer science; Theoretical computer science; Artificial intelligence; Pattern recognition (psychology); Discrete mathematics; Automata theory; Image processing","score_opus":0.012314661173251884,"score_gpt":0.24611262213043758,"score_spread":0.2337979609571857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291478302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024572372,0.000090026806,0.95738703,0.00011792067,0.000119525066,0.000052247426,0.0000027021629,0.00044349328,0.017214669],"genre_scores_gemma":[0.55998677,0.0000061864043,0.43878764,0.00056297897,0.00001927763,0.0000018395444,0.000003879926,0.000008000457,0.0006234612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884266,0.00010725701,0.00019157157,0.00037118205,0.00020886058,0.00027848576],"domain_scores_gemma":[0.99883044,0.00011529275,0.000066773086,0.00084902387,0.000049627528,0.00008886864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033195078,0.00014084797,0.0002015351,0.00025662626,0.0001268968,0.00024868984,0.00062531984,0.000060125923,0.000487667],"category_scores_gemma":[0.00004117201,0.000110134904,0.0001502458,0.0018559833,0.00003266918,0.0005407998,0.00012335822,0.000087308516,0.00011882266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004475223,0.00030809932,0.003915827,0.000026271031,0.0009189584,0.0001882666,0.0009611158,0.00083544425,0.014055449,0.94252753,0.0029061656,0.03335239],"study_design_scores_gemma":[0.00016863705,0.000010429986,0.0007511037,0.0000041882267,0.00007761743,0.000013457931,0.00003951468,0.9866597,0.0018006968,0.0077270307,0.0025435223,0.00020409195],"about_ca_topic_score_codex":0.000025551279,"about_ca_topic_score_gemma":0.00000333944,"teacher_disagreement_score":0.9858243,"about_ca_system_score_codex":0.00002417999,"about_ca_system_score_gemma":0.000039828523,"threshold_uncertainty_score":0.5339612},"labels":[],"label_agreement":null},{"id":"W2293608128","doi":"10.1007/978-3-319-21500-6_31","title":"State Complexity of Neighbourhoods and Approximate Pattern Matching","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Neighbourhood (mathematics); Upper and lower bounds; Alphabet; Nondeterministic algorithm; Deterministic finite automaton; Combinatorics; Edit distance; State (computer science); Automaton; String searching algorithm; String (physics); Time complexity; Finite-state machine; Computer science; Approximate string matching; Discrete mathematics; Mathematics; Pattern matching; Algorithm; Set (abstract data type); Theoretical computer science; Artificial intelligence","score_opus":0.03395389298181168,"score_gpt":0.2580642488607614,"score_spread":0.22411035587894973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293608128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014517725,0.0006297235,0.99486643,0.0003101963,0.0006660773,0.00024258511,0.000019670635,0.00013255973,0.0016809638],"genre_scores_gemma":[0.727823,0.000049491795,0.2710707,0.0007227171,0.00016775685,0.0000039968904,0.0000060169145,0.000041275216,0.000115053284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968781,0.0000494853,0.0005443801,0.001135498,0.0008522967,0.0005402491],"domain_scores_gemma":[0.9977743,0.0002586465,0.00040776122,0.0011629114,0.00019269287,0.00020367598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013724057,0.0004591509,0.000650612,0.0004893222,0.00013539863,0.00036073677,0.0024098272,0.00016535397,0.000016142465],"category_scores_gemma":[0.000030272706,0.00040094924,0.00008096833,0.0003049402,0.0012809766,0.0005709242,0.0021850106,0.0005401801,0.000008946541],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005093413,0.000029429764,0.0000977963,0.00012660504,0.000014834695,0.00005588273,0.002321,0.0060756756,0.00017831624,0.06401879,0.000012178528,0.9270644],"study_design_scores_gemma":[0.00018730361,0.00008463699,0.0001947682,0.00025901163,0.0000038108442,0.00005672253,3.3684043e-7,0.36987728,0.00045891778,0.6284649,0.00006927765,0.00034308128],"about_ca_topic_score_codex":0.00009875585,"about_ca_topic_score_gemma":0.00005102149,"teacher_disagreement_score":0.92672133,"about_ca_system_score_codex":0.00011553654,"about_ca_system_score_gemma":0.00026731179,"threshold_uncertainty_score":0.99984425},"labels":[],"label_agreement":null},{"id":"W2296004905","doi":"10.37236/6003","title":"A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ternary operation; Square-free integer; Lexicographical order; Square (algebra); Mathematics; Combinatorics; Word (group theory); Sequence (biology); Arithmetic; Discrete mathematics; Computer science; Geometry; Chemistry","score_opus":0.01972710738274241,"score_gpt":0.2509052272474111,"score_spread":0.23117811986466869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296004905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5475905,0.0010035392,0.44440955,0.0057562185,0.0008857927,0.0001062177,0.0000014230715,0.000061270686,0.00018548069],"genre_scores_gemma":[0.9989073,0.0002803285,0.00011975241,0.00024918772,0.00011439334,0.0000024869155,8.180008e-8,0.000017902548,0.0003085664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975967,0.0002626584,0.0004578949,0.00021024789,0.00068398385,0.00078851543],"domain_scores_gemma":[0.9976537,0.0006981096,0.00038287326,0.00090014416,0.00018388093,0.00018128162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020617982,0.00020640295,0.00027545734,0.0001706085,0.00021978756,0.00011196676,0.0038816137,0.00005419295,0.000013200266],"category_scores_gemma":[0.00037443134,0.00010534434,0.00017506491,0.0005162025,0.000052274205,0.0006132627,0.0005531859,0.0005048131,0.000025671296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021499678,0.000071876624,0.00050632964,0.0000058213354,0.00005203906,0.000026500957,0.0007217896,0.000016382282,0.013578502,0.97928417,0.0010371853,0.0046779336],"study_design_scores_gemma":[0.00078808836,0.0010434097,0.0006056471,0.00014700787,0.000020680583,0.00032500338,0.000119145436,0.00030705146,0.01631068,0.9764149,0.0036773786,0.00024098778],"about_ca_topic_score_codex":0.000006735075,"about_ca_topic_score_gemma":0.0000013847147,"teacher_disagreement_score":0.4513168,"about_ca_system_score_codex":0.0006398373,"about_ca_system_score_gemma":0.00039074145,"threshold_uncertainty_score":0.72130686},"labels":[],"label_agreement":null},{"id":"W2308068944","doi":"10.71781/15641","title":"Homologie de morse et théorème de la signature","year":2009,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Morse code; Mathematics; Computer science","score_opus":0.028355987454048884,"score_gpt":0.3452112124085911,"score_spread":0.3168552249545422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308068944","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.731699,0.0044011357,0.014344156,0.0023925307,0.0011568246,0.00085095805,0.00007987069,0.000027637449,0.24504788],"genre_scores_gemma":[0.7109879,0.00041117347,0.21774903,0.0019542468,0.00029722825,0.000049151175,0.00047489392,0.00006051951,0.06801586],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99738693,0.00074835075,0.00030979517,0.0007167412,0.00024420448,0.00059398025],"domain_scores_gemma":[0.9982482,0.00055080984,0.0002626859,0.00067365356,0.000082151884,0.00018248022],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001966652,0.0003814584,0.0003989295,0.00010083437,0.0002149029,0.0015727046,0.0030814097,0.00082657865,0.00095806195],"category_scores_gemma":[0.00022087664,0.0003732078,0.0001475717,0.0003234221,0.000103856546,0.00069124793,0.00034213567,0.000897343,0.00051567616],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062772095,0.0003998517,0.00018515991,0.000038472994,0.00006724135,0.0012750136,0.017570462,0.0006822445,0.0102682235,0.04729069,0.004302329,0.9178575],"study_design_scores_gemma":[0.0029968726,0.001210271,0.122803986,0.0031596003,0.00048125963,0.0015840194,0.007926987,0.08168061,0.12311611,0.2228449,0.42796248,0.004232891],"about_ca_topic_score_codex":0.00040224125,"about_ca_topic_score_gemma":0.00019493532,"teacher_disagreement_score":0.91362464,"about_ca_system_score_codex":0.00014494793,"about_ca_system_score_gemma":0.0012719397,"threshold_uncertainty_score":0.9999552},"labels":[],"label_agreement":null},{"id":"W2308274958","doi":"","title":"On a Semigroup Variety of György Pollák","year":2010,"lang":"en","type":"article","venue":"NSUWorks (Nova Southeastern University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subvariety; Mathematics; Semigroup; Variety (cybernetics); Pure mathematics; Discrete mathematics; Statistics","score_opus":0.007572177382830552,"score_gpt":0.18747951257728251,"score_spread":0.17990733519445196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308274958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65713155,0.000015442492,0.29253557,0.00037210106,0.0011015395,0.00016882356,0.000026530935,0.00034119404,0.048307203],"genre_scores_gemma":[0.99240655,0.0000022629138,0.0042389533,0.00018907424,0.00006542134,2.130389e-7,0.000002613848,0.000014792404,0.0030801175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868184,0.00006859528,0.00017823625,0.0004481639,0.00028381735,0.0003393552],"domain_scores_gemma":[0.99841875,0.00021248487,0.00015875792,0.0009779809,0.00008346227,0.00014859163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023670428,0.0002084016,0.00025657646,0.00031765917,0.00012304199,0.000059428858,0.0014856749,0.00019624138,0.00013768],"category_scores_gemma":[0.00003535578,0.00019992473,0.0001588533,0.00075307884,0.00014920376,0.0003225776,0.00042685855,0.00044949725,0.00013412432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069479946,0.00020126271,0.0016545012,0.000017003515,0.00005289258,0.000072855015,0.0015751167,0.00007133933,0.004979585,0.97100693,0.00012239226,0.020176632],"study_design_scores_gemma":[0.029610286,0.004760685,0.06812815,0.0020986267,0.0006486559,0.0007723159,0.017408147,0.3011123,0.04455867,0.25592813,0.2638637,0.011110326],"about_ca_topic_score_codex":0.00007097576,"about_ca_topic_score_gemma":0.000046398003,"teacher_disagreement_score":0.7150788,"about_ca_system_score_codex":0.000018064877,"about_ca_system_score_gemma":0.00006841147,"threshold_uncertainty_score":0.8152694},"labels":[],"label_agreement":null},{"id":"W2313822457","doi":"10.1142/9789812776884_0008","title":"PROFINITE GROUPS AND APPLICATIONS TO FINITE SEMIGROUPS","year":2002,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Profinite group; Computer science; Algebra over a field; Pure mathematics; Mathematics; Group (periodic table); Physics","score_opus":0.01896540230934599,"score_gpt":0.2250850562541717,"score_spread":0.2061196539448257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313822457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063657924,0.00026047608,0.96439946,0.002382116,0.00006510469,0.00036253833,0.0000032517742,0.0005038883,0.025657352],"genre_scores_gemma":[0.9210384,0.000059564383,0.06840839,0.005368722,0.00014888003,0.00025655466,0.0000023285531,0.000015374013,0.004701777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990538,0.000024751333,0.0001567178,0.00038407798,0.00014021169,0.00024047299],"domain_scores_gemma":[0.99905163,0.00015718632,0.000030784977,0.00056258217,0.000029556753,0.00016827721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015334036,0.00011828723,0.000110198846,0.0001047488,0.00013141143,0.00017016903,0.00052837137,0.00004118104,0.00013180193],"category_scores_gemma":[0.000018959008,0.00010178833,0.00002837277,0.0004700786,0.000029117371,0.00032188365,0.00030089184,0.00007395417,0.0007596546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.5474e-7,0.00007572313,0.00045499785,0.000013265653,0.00000891257,0.000004839527,0.0008408913,0.00002657029,0.0006757029,0.78600097,0.0059303595,0.2059668],"study_design_scores_gemma":[0.00093754136,0.00032738506,0.007660863,0.00005508554,0.000018803705,0.00012548378,0.00027839563,0.40019456,0.0030763608,0.09807511,0.48788413,0.0013662844],"about_ca_topic_score_codex":0.000006811335,"about_ca_topic_score_gemma":0.0000034592963,"teacher_disagreement_score":0.9146726,"about_ca_system_score_codex":0.000011348241,"about_ca_system_score_gemma":0.0000038445232,"threshold_uncertainty_score":0.9764077},"labels":[],"label_agreement":null},{"id":"W2315867495","doi":"10.1142/s0218196716500612","title":"The subpower membership problem for semigroups","year":2016,"lang":"en","type":"preprint","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semigroup; Mathematics; Commutative property; Direct product; Cancellative semigroup; Nilpotent; Polynomial; Combinatorics; Discrete mathematics","score_opus":0.015184544212072722,"score_gpt":0.2838025573647477,"score_spread":0.268618013152675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315867495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028834738,0.0010746542,0.95345086,0.012173844,0.0038075051,0.00021150033,0.000011790192,0.00003676998,0.0003983125],"genre_scores_gemma":[0.97594,0.00024435698,0.0224109,0.00036451124,0.00088573335,0.000015751843,0.000008113237,0.000014888442,0.00011576332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984599,0.00008613112,0.0005554379,0.00022727717,0.0005127624,0.00015849542],"domain_scores_gemma":[0.99719137,0.0008026327,0.00088378246,0.0001566599,0.0008939674,0.00007159962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009768734,0.00016667646,0.00019878506,0.000148892,0.00011576847,0.0006811547,0.0013344579,0.000105403415,0.0000034793543],"category_scores_gemma":[0.0000826075,0.000101383666,0.00018541265,0.000044852226,0.00006423514,0.00038094324,0.0004740475,0.00023378445,0.0000025240267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000157434,0.00007201595,0.00019579014,0.000048649355,0.00058056804,0.0000282591,0.0012705532,0.00071299286,0.0002669547,0.5589523,0.0073242043,0.4303903],"study_design_scores_gemma":[0.00065774814,0.00010416717,0.00064020645,0.00030318458,0.00002188369,0.00017328504,0.000049205195,0.026886169,0.00036823069,0.9661022,0.004528144,0.0001656084],"about_ca_topic_score_codex":0.0000024396677,"about_ca_topic_score_gemma":0.0000020342288,"teacher_disagreement_score":0.9471052,"about_ca_system_score_codex":0.00007948087,"about_ca_system_score_gemma":0.00015444147,"threshold_uncertainty_score":0.6568391},"labels":[],"label_agreement":null},{"id":"W2324179043","doi":"10.7151/dmgaa.1036","title":"The semantical hyperunification problem","year":2001,"lang":"en","type":"article","venue":"Discussiones Mathematicae - General Algebra and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Kernel (algebra); Variety (cybernetics); Homomorphism; Invariant (physics); Discrete mathematics; Congruence (geometry); Type (biology); Algebra over a field; Pure mathematics","score_opus":0.00875509974983129,"score_gpt":0.23510693301893817,"score_spread":0.22635183326910688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324179043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037724957,0.0004695639,0.93351305,0.020824721,0.000054209664,0.0007725818,0.000003779286,0.00036419966,0.0062729525],"genre_scores_gemma":[0.89521164,0.0008978617,0.094522305,0.00081424636,0.00039597708,0.0017055845,0.000020979935,0.000039834304,0.0063916007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884343,0.000049055085,0.0002996288,0.0003423154,0.00020633833,0.0002592535],"domain_scores_gemma":[0.9988425,0.00017028782,0.0000917945,0.0007275989,0.00004535873,0.00012246137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002962771,0.0001492229,0.00013714485,0.000038908947,0.0008227783,0.00030818372,0.00065412564,0.000049651208,0.000019733217],"category_scores_gemma":[0.0000159492,0.00007586905,0.00005674096,0.00035324047,0.00013655772,0.00023776208,0.00021486558,0.00008958574,0.00013183286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010939068,0.00006911959,0.000037816797,0.000011367719,0.000007621401,5.717972e-7,0.00015494102,0.0000022391494,0.0014628,0.90982395,0.0003449452,0.08808351],"study_design_scores_gemma":[0.00014397313,0.000017421038,0.0018391553,0.000022361897,0.000016296484,0.00008953951,0.00018806303,0.030994315,0.0004974243,0.92353374,0.042441927,0.00021580583],"about_ca_topic_score_codex":0.000001887339,"about_ca_topic_score_gemma":0.0000017103908,"teacher_disagreement_score":0.85748667,"about_ca_system_score_codex":0.0000100707975,"about_ca_system_score_gemma":0.000019732131,"threshold_uncertainty_score":0.6328229},"labels":[],"label_agreement":null},{"id":"W2328055175","doi":"10.4153/cmb-2002-062-3","title":"Pure Discrete Spectrum for One-dimensional Substitution Systems of Pisot Type","year":2002,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Washington; National Science Foundation","keywords":"Mathematics; Substitution (logic); Action (physics); Spectrum (functional analysis); Type (biology); Corollary; Dynamical systems theory; Sequence (biology); Dynamical system (definition); Pure mathematics; Scheme (mathematics); Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.022303565074726913,"score_gpt":0.2107680713134128,"score_spread":0.18846450623868588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328055175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23136489,0.0027829213,0.6850032,0.04651024,0.0022325392,0.0030512677,0.00024244927,0.0005577753,0.028254693],"genre_scores_gemma":[0.9908281,0.0000033267,0.0073657786,0.00027612093,0.00007932277,0.000020582049,0.0000059242275,0.0000127598105,0.0014081162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894214,0.000034104498,0.00026640363,0.00023218071,0.00018793391,0.00033724093],"domain_scores_gemma":[0.99900883,0.00018436543,0.00007007614,0.00039614964,0.00005846535,0.00028210206],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027318695,0.00011659385,0.0002242983,0.000098757264,0.0000947103,0.00006764542,0.00042348742,0.0000801176,0.0017494543],"category_scores_gemma":[0.00016193124,0.000103538136,0.000067351,0.0001609893,0.00007699652,0.000052024472,0.000036124926,0.00007628888,0.0017186309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023609539,0.00003088543,0.0000054700554,0.00012485712,0.000014637488,0.000011559807,0.000095712094,0.00005905787,0.00014233674,0.98644006,0.012848675,0.0002244057],"study_design_scores_gemma":[0.0013397982,0.0005384331,0.0002038863,0.0010472278,0.00007173641,0.00029328608,0.00011918408,0.5021725,0.0025162129,0.35392216,0.1366248,0.0011507575],"about_ca_topic_score_codex":0.00025545835,"about_ca_topic_score_gemma":0.00010285477,"teacher_disagreement_score":0.7594632,"about_ca_system_score_codex":0.00007657762,"about_ca_system_score_gemma":0.00006169304,"threshold_uncertainty_score":0.9991631},"labels":[],"label_agreement":null},{"id":"W2331097733","doi":"10.1142/9789812778857_0005","title":"BETA-EXPANSIONS OF PISOT AND SALEM NUMBERS","year":2007,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"BETA (programming language); Mathematics; Computer science; Programming language","score_opus":0.010357235088151768,"score_gpt":0.24017431000621525,"score_spread":0.2298170749180635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331097733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47418314,0.0001192032,0.4944036,0.00037795573,0.00011689996,0.00004857279,8.327445e-7,0.00012312779,0.03062667],"genre_scores_gemma":[0.95726717,0.000008397454,0.04197933,0.00029412666,0.000012586107,3.9459442e-7,2.9817295e-7,0.0000026180098,0.0004350838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99951786,0.000009732527,0.00012150035,0.00012976829,0.00009464015,0.00012652251],"domain_scores_gemma":[0.9995426,0.000114813505,0.000030041552,0.00023811626,0.000017527016,0.000056891968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030831783,0.000049067294,0.00007945711,0.000043086315,0.000033010525,0.000016723812,0.00022340365,0.000019174844,0.000038259484],"category_scores_gemma":[0.000007366945,0.000038143407,0.000023630324,0.00013703768,0.00004300343,0.0001432555,0.00011565895,0.000033002816,0.0000125147635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025805193,0.000049988652,0.0037781533,0.000008761344,0.000011756489,0.000010629288,0.00068112416,0.0000023460323,0.007497998,0.9156293,0.0018014249,0.07052591],"study_design_scores_gemma":[0.0030741158,0.00065051386,0.40816292,0.00016123477,0.00005024117,0.0003610606,0.0029450564,0.0342653,0.3381373,0.16416208,0.046456557,0.0015735956],"about_ca_topic_score_codex":0.000054285407,"about_ca_topic_score_gemma":0.000022409671,"teacher_disagreement_score":0.7514672,"about_ca_system_score_codex":0.0000039508964,"about_ca_system_score_gemma":0.00000985668,"threshold_uncertainty_score":0.15554431},"labels":[],"label_agreement":null},{"id":"W233362823","doi":"","title":"Approximations de Séries Génératrices et Quelques Conjectures","year":2014,"lang":"fr","type":"preprint","venue":"viXra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Physics; Calculus (dental)","score_opus":0.022888260170104407,"score_gpt":0.2795945388202295,"score_spread":0.2567062786501251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W233362823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029351069,0.0050830785,0.9135627,0.012329233,0.0023104507,0.00046033587,0.000076393,0.0007568958,0.03606985],"genre_scores_gemma":[0.8299152,0.00083721156,0.15331739,0.010588985,0.0010703028,0.00016891967,0.000081761915,0.000066569504,0.003953602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968331,0.0007405786,0.0005304608,0.00088008447,0.00038714893,0.00062864495],"domain_scores_gemma":[0.9970913,0.0007805255,0.00043197523,0.0013014532,0.00018964379,0.00020508988],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014177003,0.0004976367,0.000560044,0.00020185007,0.00032476618,0.0013975992,0.0018518314,0.00045916133,0.00018401565],"category_scores_gemma":[0.00028416113,0.00047594827,0.00028377512,0.00031121622,0.0003189978,0.0005354608,0.0014093929,0.00076018507,0.00036200255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053288168,0.00009144693,0.00028246938,0.0002664309,0.000076007855,0.000016334874,0.00581986,0.0033156776,0.0004136178,0.97037774,0.0069540595,0.012381047],"study_design_scores_gemma":[0.00024575775,0.00009530135,0.004682579,0.00043138542,0.00007742479,0.000070856826,0.00023940382,0.1861528,0.003273401,0.73373073,0.0701866,0.0008137388],"about_ca_topic_score_codex":0.00090379047,"about_ca_topic_score_gemma":0.00010501991,"teacher_disagreement_score":0.80056417,"about_ca_system_score_codex":0.00010402662,"about_ca_system_score_gemma":0.000492628,"threshold_uncertainty_score":0.9997692},"labels":[],"label_agreement":null},{"id":"W2336446049","doi":"10.1142/s0129054115400067","title":"Large Aperiodic Semigroups","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Aperiodic graph; Semigroup; Mathematics; Unitary state; Special classes of semigroups; Tree (set theory); Quotient; Krohn–Rhodes theory; Discrete mathematics; State (computer science); Bicyclic semigroup; Pure mathematics; Combinatorics; Monoid; Algorithm","score_opus":0.02200527659450329,"score_gpt":0.30170178542708187,"score_spread":0.27969650883257857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336446049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10543408,0.00007857922,0.8887631,0.0014906191,0.0035357706,0.000035556208,0.0000027253004,0.000025742978,0.00063377776],"genre_scores_gemma":[0.8443097,0.00000879043,0.15505998,0.0003195798,0.00027782726,6.53802e-7,9.1006433e-7,0.0000032316634,0.000019360781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760675,0.000045078843,0.00055067,0.0001920444,0.0014102798,0.00019517702],"domain_scores_gemma":[0.9964823,0.00011183551,0.0005454384,0.00035079382,0.0023258603,0.00018376572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019599474,0.00009675832,0.00016963744,0.0006151729,0.00009147012,0.00044440164,0.004120604,0.000025234162,0.0000150461365],"category_scores_gemma":[0.00020817723,0.000082899656,0.0001012626,0.00067987764,0.0002765793,0.0027680127,0.0006005139,0.00012178188,0.000023491246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003811053,0.00071892753,0.0030373894,0.000007923307,0.00013528549,0.00010697689,0.0072082044,0.0039453576,0.0054553184,0.80758256,0.0046344385,0.16712952],"study_design_scores_gemma":[0.004299678,0.0011205977,0.018469328,0.00034781554,0.00002905582,0.0028230548,0.00049709214,0.74236894,0.014816186,0.1585864,0.055932984,0.00070889865],"about_ca_topic_score_codex":0.0000054988113,"about_ca_topic_score_gemma":0.000001361886,"teacher_disagreement_score":0.73887557,"about_ca_system_score_codex":0.00013050153,"about_ca_system_score_gemma":0.00082221883,"threshold_uncertainty_score":0.7657177},"labels":[],"label_agreement":null},{"id":"W2342016401","doi":"","title":"State Complexity of Unranked Tree Automata","year":2010,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Tree (set theory); Tree automaton; Automaton; State (computer science); String (physics); Nondeterministic finite automaton; Computer science; Mathematics; Combinatorics; Deterministic finite automaton; Discrete mathematics; Theoretical computer science; Automata theory; Algorithm","score_opus":0.023916768631599115,"score_gpt":0.24900218605603927,"score_spread":0.22508541742444016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342016401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.667618,0.00000921359,0.29510418,0.0010164431,0.0005507483,0.00010773512,0.0000086134805,0.0006222192,0.034962885],"genre_scores_gemma":[0.9110752,0.0000013957417,0.08823069,0.00019364928,0.000016168628,0.0000018090308,0.0000016037526,0.00000446977,0.00047501453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992328,0.000027257947,0.00018697111,0.00020238795,0.0001752578,0.00017532177],"domain_scores_gemma":[0.9989776,0.00007135732,0.00006829785,0.0007748437,0.000042451302,0.00006545347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002949926,0.00008454419,0.00013979146,0.000054514814,0.000042345564,0.000047683327,0.0009735058,0.000030119725,0.00016063203],"category_scores_gemma":[0.000020814741,0.00006607596,0.00004964943,0.00018955728,0.00016434447,0.0002765877,0.00025405272,0.00010617472,0.00006970941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030668234,0.0000805356,0.00025809603,0.000009098754,0.000008752454,0.000003831853,0.00023967256,0.0000019904278,0.049096357,0.8774551,0.0011489643,0.07169451],"study_design_scores_gemma":[0.0010099101,0.000117889496,0.07735735,0.0000133232,0.0000054173042,0.00003293062,0.000030529525,0.30908594,0.13230447,0.47372335,0.005946667,0.00037222484],"about_ca_topic_score_codex":0.000110563065,"about_ca_topic_score_gemma":0.00015231936,"teacher_disagreement_score":0.40373176,"about_ca_system_score_codex":0.0000036887025,"about_ca_system_score_gemma":0.00003075122,"threshold_uncertainty_score":0.26944995},"labels":[],"label_agreement":null},{"id":"W2344606806","doi":"10.1016/j.tcs.2016.04.015","title":"On Sillke's bijection","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Cardinality (data modeling); Indecomposable module; Combinatorics; Mathematics; Group (periodic table); Discrete mathematics; Computer science; Chemistry; Database","score_opus":0.005954904830763786,"score_gpt":0.223660163684643,"score_spread":0.21770525885387923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344606806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06245361,0.000005824001,0.9278975,0.0024886108,0.00094266585,0.00007898233,8.192159e-7,0.0004318349,0.0057001207],"genre_scores_gemma":[0.96727616,0.0000027650854,0.03135483,0.0011924691,0.00012846207,0.0000044888334,7.9343636e-8,0.000006507448,0.000034237484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997875,0.00008663744,0.00018184251,0.00071556884,0.00062432577,0.0005166212],"domain_scores_gemma":[0.9981559,0.0005219717,0.000048167236,0.0009591512,0.00009179446,0.0002230219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011749695,0.00015620771,0.00013543053,0.00020868902,0.00032544043,0.00027703177,0.0021893245,0.000041927935,0.00009887277],"category_scores_gemma":[0.00012903611,0.00008771217,0.00005930369,0.0008534038,0.0017800934,0.00075227447,0.0006550102,0.00008968029,0.00063631043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044860208,0.00003056239,0.000008297957,8.4223524e-7,0.000001159076,0.0000056009944,0.000047145884,0.00000792207,0.0034257113,0.8145745,0.00010756264,0.18178624],"study_design_scores_gemma":[0.00026876928,0.00036656842,0.0007766958,0.0000522979,0.0000013782545,0.000039161972,0.0000012753893,0.10102351,0.025189608,0.8717868,0.00026507044,0.00022891903],"about_ca_topic_score_codex":9.507162e-7,"about_ca_topic_score_gemma":9.019705e-8,"teacher_disagreement_score":0.9048225,"about_ca_system_score_codex":0.00007522481,"about_ca_system_score_gemma":0.00006038374,"threshold_uncertainty_score":0.81786954},"labels":[],"label_agreement":null},{"id":"W2345399371","doi":"10.1023/a:1022845202361","title":"Counting Endomorphisms of Crown-like Orders","year":2002,"lang":"en","type":"article","venue":"Order","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.014556372211343415,"score_gpt":0.20391724787052304,"score_spread":0.1893608756591796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345399371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2960619,0.0016664865,0.62668514,0.0028032374,0.0019505554,0.0003246069,0.0000066621596,0.00071980694,0.06978162],"genre_scores_gemma":[0.97868145,0.000021005046,0.018819824,0.00076179,0.000035866775,0.0000043256186,7.595493e-7,0.0000094453635,0.0016655521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999253,0.000023518696,0.00015294465,0.00019197297,0.00018516378,0.00019342305],"domain_scores_gemma":[0.99937177,0.000077131015,0.000076408614,0.00037015026,0.000070423725,0.000034107175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016604945,0.00008253404,0.00011792968,0.00005478205,0.000059208505,0.000046493522,0.0004904285,0.000035610286,0.00068606436],"category_scores_gemma":[0.000037506394,0.00007366463,0.0000368812,0.00035058346,0.00005650768,0.00024787406,0.00011747552,0.00006412561,0.00020680003],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013145383,0.0006442442,0.0030545536,0.00011302242,0.00013196452,0.00009744972,0.005119661,0.0004817995,0.024706291,0.521324,0.09761994,0.34669396],"study_design_scores_gemma":[0.0027534636,0.00021299814,0.0025535559,0.00012264207,0.000028494798,0.0001269323,0.00024235342,0.522027,0.013938084,0.013140433,0.4438215,0.0010325433],"about_ca_topic_score_codex":0.000032282118,"about_ca_topic_score_gemma":0.0000025046868,"teacher_disagreement_score":0.6826195,"about_ca_system_score_codex":0.00000865618,"about_ca_system_score_gemma":0.000011744913,"threshold_uncertainty_score":0.7511924},"labels":[],"label_agreement":null},{"id":"W2374151057","doi":"","title":"On residual finiteness of π-inverse semigroup","year":2003,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Residual; Mathematics; Semigroup; Inverse; Inverse semigroup; Cancellative semigroup; Inverse element; Pure mathematics; Special classes of semigroups; Algorithm; Geometry","score_opus":0.011848445623595069,"score_gpt":0.2190495794780286,"score_spread":0.20720113385443353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2374151057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53713495,0.00006312952,0.2559636,0.0003095795,0.00054965145,0.00013186924,0.0000033218098,0.00032346803,0.20552047],"genre_scores_gemma":[0.9741301,0.000004944995,0.023083411,0.0008728594,0.000013873615,0.0000031516988,7.626085e-7,0.0000059633826,0.0018849409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922895,0.000074288,0.00014651616,0.00020927965,0.00018203142,0.0001589407],"domain_scores_gemma":[0.999149,0.0002191737,0.00004869527,0.00050524174,0.000029567756,0.000048318685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031636804,0.00008380756,0.00011191806,0.000072404684,0.000036611385,0.000026014213,0.0004232465,0.000039424864,0.00016799408],"category_scores_gemma":[0.00008288829,0.000066333276,0.000041460058,0.00023489921,0.000032859498,0.00016529288,0.00005756408,0.00005520839,0.0001076768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026246844,0.000051166622,0.00010529313,0.000005361745,0.0000048680126,0.000007006637,0.00012428408,0.00006876225,0.0011494727,0.99230915,0.0042385813,0.0019334288],"study_design_scores_gemma":[0.0019442191,0.0006781363,0.0030506372,0.00012249404,0.000014811733,0.00005617901,0.00043977337,0.02605567,0.4323416,0.51149404,0.022929894,0.0008725142],"about_ca_topic_score_codex":0.000013510203,"about_ca_topic_score_gemma":0.000003793127,"teacher_disagreement_score":0.48081508,"about_ca_system_score_codex":0.000009613866,"about_ca_system_score_gemma":0.00003260149,"threshold_uncertainty_score":0.27049926},"labels":[],"label_agreement":null},{"id":"W2395596657","doi":"","title":"Operational State Complexity of Nested Word Automata.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Nested word; Quantum finite automata; Finite-state machine; Mathematics; Discrete mathematics; Constant (computer programming); Upper and lower bounds; Automaton; Word (group theory); Deterministic finite automaton; Automata theory; Combinatorics; Computer science; Theoretical computer science; Algorithm","score_opus":0.04680536913484907,"score_gpt":0.24967884068656124,"score_spread":0.20287347155171218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395596657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8720783,0.00006316872,0.124457456,0.00085322565,0.0002334195,0.00009571611,0.00001731291,0.00027526665,0.0019261129],"genre_scores_gemma":[0.970152,0.000008783701,0.02911369,0.00031323376,0.000035053872,0.000003816809,0.000010503251,0.0000046890773,0.00035823832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992597,0.000045641336,0.00017808964,0.00017092863,0.00020643104,0.00013919456],"domain_scores_gemma":[0.9994321,0.00004965576,0.000057798483,0.00035523885,0.000057476384,0.000047742815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013940789,0.00007428086,0.000121700425,0.00004837392,0.000098408076,0.00002573127,0.0004791999,0.000020301763,0.00005393152],"category_scores_gemma":[0.000015517522,0.0000658986,0.000037064383,0.00021425182,0.00014424331,0.0002944828,0.00013943552,0.00005213771,0.00007080836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002953163,0.0004058037,0.0046106423,0.000047193524,0.000062453124,0.00014907373,0.0054889093,0.00096571195,0.009362623,0.88013935,0.01328927,0.085449435],"study_design_scores_gemma":[0.0014687219,0.00015702621,0.36749566,0.000049801176,0.0000053278627,0.00027949244,0.000041795895,0.5250733,0.017956508,0.068001464,0.018923854,0.0005470523],"about_ca_topic_score_codex":0.000048108173,"about_ca_topic_score_gemma":0.0000046403047,"teacher_disagreement_score":0.8121379,"about_ca_system_score_codex":0.000012221757,"about_ca_system_score_gemma":0.000065151085,"threshold_uncertainty_score":0.2687267},"labels":[],"label_agreement":null},{"id":"W2396102698","doi":"","title":"Utility And Expandabilty Of Channel Assignments.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Channel (broadcasting); Mathematics; Computer science; Telecommunications","score_opus":0.011071127851217293,"score_gpt":0.2243109670607269,"score_spread":0.2132398392095096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396102698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9771583,0.00010967493,0.018211275,0.00017674585,0.0009307334,0.00008861122,0.000001574128,0.000102160695,0.003220922],"genre_scores_gemma":[0.9991402,0.000006583709,0.00070711295,0.00009139407,0.0000037366099,0.0000037754921,7.535362e-7,0.0000044309145,0.00004202795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999209,0.00008461009,0.00015411756,0.00023358654,0.00016318419,0.00015551066],"domain_scores_gemma":[0.99922407,0.00012743763,0.00007488275,0.0004705678,0.000033627402,0.00006942006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046000513,0.000087495115,0.00015709079,0.000033605895,0.00005589254,0.000033554566,0.00040131347,0.000042863005,0.0000080930195],"category_scores_gemma":[0.00005977058,0.00007717032,0.000030166575,0.000120560995,0.00006844172,0.00021054488,0.00024446606,0.00005988589,0.0000067793567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026939047,0.00007056808,0.0024037445,0.000014445652,0.0000074102704,6.106485e-7,0.0002701333,5.430015e-7,0.0005491459,0.9800156,0.00036431284,0.016300796],"study_design_scores_gemma":[0.0005281099,0.00009989793,0.025253927,0.000016842268,0.0000035439107,0.000002783648,0.000021411794,0.020958256,0.009883075,0.94226384,0.00085300487,0.000115281764],"about_ca_topic_score_codex":0.000015362326,"about_ca_topic_score_gemma":4.0598044e-7,"teacher_disagreement_score":0.03775173,"about_ca_system_score_codex":0.00000675216,"about_ca_system_score_gemma":0.000013567854,"threshold_uncertainty_score":0.31469145},"labels":[],"label_agreement":null},{"id":"W2397866482","doi":"10.1016/j.tcs.2016.05.018","title":"State complexity of prefix distance","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Suffix; Generalized suffix tree; Prefix; Combinatorics; Regular language; Mathematics; Deterministic finite automaton; Nondeterministic algorithm; Nondeterministic finite automaton; Discrete mathematics; State (computer science); Suffix tree; Set (abstract data type); Finite-state machine; Automaton; Computer science; Algorithm; Theoretical computer science; Automata theory","score_opus":0.016784463291252882,"score_gpt":0.24484974529758166,"score_spread":0.22806528200632878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397866482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07601975,0.00002210887,0.92042696,0.0011672768,0.000352309,0.000096712734,0.000008177319,0.0001946091,0.0017121024],"genre_scores_gemma":[0.8838148,0.000005210701,0.11591856,0.00019694968,0.00003524005,0.0000028772745,1.4003776e-7,0.000005543435,0.000020687856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976954,0.0001065279,0.00033293874,0.0006428852,0.0006809405,0.00054132985],"domain_scores_gemma":[0.997984,0.00033503177,0.0001188135,0.001157836,0.00018154884,0.00022280352],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013473224,0.00016356503,0.00024098463,0.00011911262,0.00018180402,0.00012817454,0.0032348535,0.00002709533,0.00005762208],"category_scores_gemma":[0.00008021945,0.00009712958,0.000069122354,0.000808294,0.008069877,0.00082020194,0.0012295826,0.00007605033,0.0000672018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007349289,0.00004368404,0.00008931805,0.000006046505,0.0000024064216,0.0000037936861,0.00015949996,0.0000050928506,0.0054726056,0.9023367,0.000027480408,0.09184602],"study_design_scores_gemma":[0.00025385598,0.00014842482,0.0030553695,0.00007107206,0.0000016077537,0.000015152683,0.0000016657292,0.07779958,0.04433599,0.87398404,0.00014000406,0.00019326419],"about_ca_topic_score_codex":0.0000024991512,"about_ca_topic_score_gemma":5.35955e-7,"teacher_disagreement_score":0.80779505,"about_ca_system_score_codex":0.00004813511,"about_ca_system_score_gemma":0.00009539005,"threshold_uncertainty_score":0.99462956},"labels":[],"label_agreement":null},{"id":"W2398698927","doi":"","title":"L-Presheaves and Their Stalks.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.009951069302425022,"score_gpt":0.21683104187285565,"score_spread":0.20687997257043061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398698927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912402,0.0019144204,0.0022466686,0.00030294203,0.0018250993,0.00007566948,9.0525066e-7,0.0007202992,0.0016738198],"genre_scores_gemma":[0.99870205,0.000025705693,0.0009655363,0.00022470366,0.0000133338435,0.000005595396,4.9913666e-7,0.000016102422,0.00004650076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993251,0.000047843165,0.00009623175,0.00015990328,0.00008864871,0.00028225724],"domain_scores_gemma":[0.9993147,0.00011594923,0.000034702167,0.00039147775,0.00001724994,0.00012590394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028026383,0.00010523977,0.000109444845,0.00003987306,0.0000556928,0.00008516533,0.0003793213,0.00003924054,0.000004360538],"category_scores_gemma":[0.000021312368,0.00008066364,0.000027400914,0.00014020667,0.00004148322,0.00064261345,0.00029873653,0.00007354267,0.000017871847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.7023545e-7,0.00004897785,0.00318352,0.000004174081,0.000007772775,9.2768346e-7,0.0010090759,1.08737e-7,0.00061315985,0.98321843,0.0013698748,0.010543124],"study_design_scores_gemma":[0.00037438804,0.00005423107,0.023629274,0.000012930954,0.0000030369713,0.000026215095,0.00013586074,0.0018323166,0.008328182,0.94956994,0.015800098,0.00023351768],"about_ca_topic_score_codex":0.000007725319,"about_ca_topic_score_gemma":1.7595889e-7,"teacher_disagreement_score":0.033648465,"about_ca_system_score_codex":0.000012665507,"about_ca_system_score_gemma":0.000010378625,"threshold_uncertainty_score":0.3289368},"labels":[],"label_agreement":null},{"id":"W2399095305","doi":"","title":"A combinatorial proof of a general two-term recurrence.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Term (time); Mathematics; Combinatorial proof; Combinatorics; Physics; Astronomy","score_opus":0.020140550437565602,"score_gpt":0.26238613102318215,"score_spread":0.24224558058561654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399095305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.976002,0.00036480153,0.0025296486,0.000231205,0.01235742,0.00033495494,0.000005260411,0.00023951687,0.007935227],"genre_scores_gemma":[0.99729866,0.000003250279,0.0024471332,0.000074275486,0.000045844023,0.000026761396,0.000005495132,0.00001534183,0.000083265135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981092,0.00016855924,0.00039030547,0.0004196844,0.0005374424,0.00037475867],"domain_scores_gemma":[0.99832165,0.0000899723,0.00021791735,0.00087473344,0.00025529158,0.00024042334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077648176,0.0002077669,0.00034305517,0.00012021416,0.00006402959,0.00009527898,0.0013888576,0.00008639319,0.000010129984],"category_scores_gemma":[0.00012945574,0.00019408323,0.00009983039,0.00055536884,0.00010631731,0.00051977433,0.00047126526,0.00017904108,0.000033632805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018316861,0.00025155145,0.0009846372,0.000013092789,0.00001895584,0.000017544122,0.00073310063,0.000008252609,0.00044072932,0.9886068,0.0028350567,0.0060719284],"study_design_scores_gemma":[0.0027526007,0.00037397604,0.00039514623,0.000043721942,0.000009385636,0.000020620599,0.000023683095,0.0063905576,0.016857684,0.97191894,0.0009467164,0.00026699426],"about_ca_topic_score_codex":0.000050044015,"about_ca_topic_score_gemma":0.0000010899028,"teacher_disagreement_score":0.021296669,"about_ca_system_score_codex":0.0000735229,"about_ca_system_score_gemma":0.00025114385,"threshold_uncertainty_score":0.7914484},"labels":[],"label_agreement":null},{"id":"W2399262470","doi":"10.48550/arxiv.1012.3962","title":"Quotient Complexity of Star-Free Languages","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quotient; Concatenation (mathematics); Mathematics; Regular language; Discrete mathematics; Star (game theory); Combinatorics; Intersection (aeronautics); Computer science; Theoretical computer science; Automaton","score_opus":0.06936346238571205,"score_gpt":0.19577833256891503,"score_spread":0.12641487018320297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399262470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77850795,0.0000732817,0.21655649,0.00012221326,0.00060176273,0.00017779376,0.00007772146,0.00026126957,0.003621513],"genre_scores_gemma":[0.99160945,0.00003332806,0.0077287024,0.00007194787,0.000055446148,3.5552063e-7,0.00001677226,0.000012620244,0.00047138237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985271,0.00011374013,0.00020059486,0.0007583771,0.000116480565,0.00028372038],"domain_scores_gemma":[0.9968542,0.00009602628,0.00030679372,0.00248689,0.00012766523,0.00012846662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028500226,0.00025237957,0.0003607715,0.00019414366,0.00008105755,0.000057217258,0.0036895613,0.00025657399,0.00008786203],"category_scores_gemma":[0.000046120098,0.0002708368,0.00021391799,0.00029867713,0.00034429049,0.00021025872,0.004440081,0.0006206529,0.000034551675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001583871,0.00014999458,0.00064829516,0.0001113553,0.00006496824,0.00014662642,0.0003968977,0.005042223,0.00036023994,0.99190974,0.000569831,0.0005839916],"study_design_scores_gemma":[0.00072812196,0.00008625488,0.007715858,0.00013801754,0.000061271996,0.0000068500117,0.0002644019,0.4142112,0.0025285538,0.5729798,0.0006146668,0.00066496676],"about_ca_topic_score_codex":0.00043411148,"about_ca_topic_score_gemma":0.00013673345,"teacher_disagreement_score":0.4189299,"about_ca_system_score_codex":0.000061457,"about_ca_system_score_gemma":0.00012282984,"threshold_uncertainty_score":0.99997437},"labels":[],"label_agreement":null},{"id":"W2399517370","doi":"","title":"Completely Regular Endomorphisms of Split Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endomorphism; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.010185618288861076,"score_gpt":0.20782741922918171,"score_spread":0.19764180094032063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399517370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9718015,0.00019810682,0.019055815,0.0004030761,0.0022157275,0.00017194892,0.0000036533172,0.000308917,0.0058412636],"genre_scores_gemma":[0.992368,0.0000063123666,0.007290019,0.00022452051,0.000006245998,0.0000115659195,0.0000031497493,0.000012067102,0.00007810646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986757,0.00013348163,0.00028824294,0.00031997214,0.00031156192,0.00027105527],"domain_scores_gemma":[0.99846363,0.00023297011,0.00015669892,0.00096747186,0.00008276262,0.00009646736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005898841,0.00014778995,0.00028397617,0.000104495724,0.00008299608,0.000051985782,0.0011708876,0.000060938262,0.000030469133],"category_scores_gemma":[0.0000657573,0.00013955754,0.000109444496,0.00037236974,0.00011738969,0.00023516364,0.00026320785,0.000103758844,0.00006088621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004686324,0.00006446563,0.0004970646,0.000012843797,0.000013752797,0.0000029906844,0.00010681263,0.0000020711943,0.0018192129,0.9887438,0.0014557168,0.007276582],"study_design_scores_gemma":[0.000789245,0.00017818657,0.0040363525,0.000026241543,0.000006259388,0.0000121988305,0.000007984249,0.006151357,0.011238022,0.97182906,0.0055535845,0.00017149461],"about_ca_topic_score_codex":0.000026570995,"about_ca_topic_score_gemma":5.365427e-7,"teacher_disagreement_score":0.020566521,"about_ca_system_score_codex":0.0000152284265,"about_ca_system_score_gemma":0.000021101048,"threshold_uncertainty_score":0.5690991},"labels":[],"label_agreement":null},{"id":"W2399743505","doi":"","title":"Channel Synthesis for Finite Transducers","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Transducer; Computer science; Channel (broadcasting); Electronic engineering; Electrical engineering; Telecommunications; Engineering","score_opus":0.022896982740763527,"score_gpt":0.2194862854777149,"score_spread":0.19658930273695138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399743505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037801997,0.00069999765,0.9665663,0.006595764,0.0005152928,0.00058003113,0.00009912105,0.0005787052,0.02058454],"genre_scores_gemma":[0.77679694,0.0005098895,0.21717761,0.0003049157,0.00005214345,0.000583507,0.00015680773,0.00007915516,0.0043390524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951808,0.0024218785,0.00050494313,0.0010855844,0.0003193281,0.00048749405],"domain_scores_gemma":[0.9915427,0.00355307,0.00043866708,0.0031781218,0.0010842247,0.00020324845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005536103,0.0003983212,0.00045740762,0.00024086393,0.00034658378,0.0005082293,0.0037847776,0.00033161454,0.00007956706],"category_scores_gemma":[0.0013574918,0.00041501832,0.00041063596,0.0002991096,0.00017139928,0.00026181233,0.0013813572,0.000428072,0.000048229867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022452674,0.0007848355,0.000038473816,0.00052301417,0.00022523764,0.000007943223,0.030170651,0.0002321619,0.0012865395,0.7486286,0.0024196445,0.21566042],"study_design_scores_gemma":[0.000906979,0.0000012971016,0.0006472459,0.003818295,0.00014890815,0.000014322741,0.00018784964,0.42191225,0.2746477,0.27715722,0.018795578,0.0017623042],"about_ca_topic_score_codex":0.0003909024,"about_ca_topic_score_gemma":0.00016695118,"teacher_disagreement_score":0.7730167,"about_ca_system_score_codex":0.000075571385,"about_ca_system_score_gemma":0.00025609075,"threshold_uncertainty_score":0.9998302},"labels":[],"label_agreement":null},{"id":"W2400176033","doi":"10.1016/s0304-3975(04)00143-4","title":"On the number of nonterminals in linear conjunctive grammars*1","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Terminal and nonterminal symbols; Indexed grammar; Mathematics; Context-sensitive grammar; Disjoint sets; Discrete mathematics; Combinatorics; Rule-based machine translation; Computer science; Context-free grammar; Natural language processing","score_opus":0.009711916773719308,"score_gpt":0.2632984173633767,"score_spread":0.2535865005896574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400176033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35643312,0.0000048007587,0.6391427,0.0014735244,0.00031695885,0.00012905861,0.000001020156,0.000051601928,0.0024472217],"genre_scores_gemma":[0.95527774,0.0000015700169,0.043324266,0.0013415652,0.00003799889,0.0000064784917,1.5693091e-7,0.000005221667,0.0000049791092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807256,0.00012078956,0.00029255103,0.0004981574,0.0005883502,0.00042755785],"domain_scores_gemma":[0.9981474,0.0007036929,0.00008371739,0.000848879,0.00010987535,0.00010643138],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019160864,0.00015714917,0.00021372248,0.000116801166,0.00015197342,0.0001124866,0.0025866407,0.000041586096,0.000045897024],"category_scores_gemma":[0.00016275569,0.00009600713,0.00006930258,0.0011299065,0.0028319298,0.00034072157,0.00069501926,0.00022433604,0.000120742916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011340947,0.00010210812,0.000055327942,0.0000028068073,0.0000019697054,0.000016667018,0.0005764087,0.0003104731,0.00025693973,0.9933652,0.000007710549,0.005293008],"study_design_scores_gemma":[0.00031340777,0.00015796433,0.0010963571,0.00008634762,0.0000014947875,0.000033754,0.000016231168,0.09877591,0.008602179,0.8907733,0.000008464758,0.00013456911],"about_ca_topic_score_codex":0.000013888579,"about_ca_topic_score_gemma":8.510892e-7,"teacher_disagreement_score":0.59884465,"about_ca_system_score_codex":0.00006127857,"about_ca_system_score_gemma":0.00012279808,"threshold_uncertainty_score":0.9998818},"labels":[],"label_agreement":null},{"id":"W2400282024","doi":"","title":"Enumeration Of Non-Isomorphic Semigraphs In Γ 4 .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics","score_opus":0.013960530520867834,"score_gpt":0.23514324594318844,"score_spread":0.2211827154223206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400282024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99464905,0.00015962585,0.0022699758,0.00018464832,0.0010654033,0.000100349425,0.0000011920151,0.000060122547,0.0015096499],"genre_scores_gemma":[0.9987091,0.000004934025,0.0011648822,0.000077860124,0.0000031210882,0.0000079994825,0.0000032251803,0.0000040665277,0.000024799825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991782,0.00006132068,0.00021171538,0.00018629518,0.00020898855,0.00015351117],"domain_scores_gemma":[0.99932396,0.00005884166,0.00008210615,0.0003945553,0.000071149516,0.00006937327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005022386,0.00008349736,0.00014979183,0.0001253561,0.000018771038,0.00003155984,0.00047896468,0.00005268272,0.000003822881],"category_scores_gemma":[0.000048381655,0.00008210649,0.00003319643,0.00050050183,0.000029935802,0.00034789482,0.00011114361,0.0000858454,0.0000345999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065461163,0.00015159618,0.012043834,0.000010401607,0.0000069329417,0.000014058895,0.0017091442,0.000050884963,0.0030236256,0.97676474,0.0028186245,0.0033996354],"study_design_scores_gemma":[0.0014893195,0.00018253014,0.011449297,0.00004622128,0.0000032381236,0.000006873379,0.00010437965,0.02937368,0.015156251,0.9415839,0.0004010238,0.0002033266],"about_ca_topic_score_codex":0.000069590256,"about_ca_topic_score_gemma":0.0000063397147,"teacher_disagreement_score":0.035180856,"about_ca_system_score_codex":0.00002839201,"about_ca_system_score_gemma":0.000070019254,"threshold_uncertainty_score":0.33482054},"labels":[],"label_agreement":null},{"id":"W2401586919","doi":"","title":"Restricted sets of trajectories and decidability of shuffle decompositions.","year":2004,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Acadia University","funders":"","keywords":"Decidability; Unary operation; Mathematics; Regular language; Context (archaeology); Set (abstract data type); Discrete mathematics; Combinatorics; Automaton; Computer science; Theoretical computer science; Programming language","score_opus":0.008540758322706883,"score_gpt":0.23902659181847943,"score_spread":0.23048583349577256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401586919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661678,0.00016105633,0.03301312,0.00017858991,0.000079754405,0.00006288208,0.000008539981,0.000043063388,0.0002851953],"genre_scores_gemma":[0.97326773,0.000008557835,0.026681658,0.000023097173,0.000009826047,0.0000024761387,0.0000015900351,0.0000021313688,0.0000029114356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99949807,0.000026505513,0.00016063897,0.00013381093,0.00009941634,0.00008158193],"domain_scores_gemma":[0.9994848,0.00010194011,0.000060618946,0.00027300837,0.000046890058,0.00003276083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010323961,0.000051872987,0.00011516807,0.0000456724,0.000032704254,0.000013452594,0.00021246819,0.00002875479,0.0000047146054],"category_scores_gemma":[0.000037671693,0.00004614929,0.00002730608,0.00023543676,0.00008581811,0.00015230275,0.000073672345,0.00003422874,0.0000010823563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060783765,0.00068512827,0.029652584,0.00022559303,0.00007024124,0.000019063747,0.0070375195,0.00044029648,0.11753838,0.78420705,0.00030002947,0.05976336],"study_design_scores_gemma":[0.0010339256,0.0002945485,0.5537557,0.000086578024,0.000013721078,0.000028491482,0.00011886858,0.0022038764,0.21767394,0.22430477,0.00027594433,0.00020961826],"about_ca_topic_score_codex":0.00010177594,"about_ca_topic_score_gemma":0.000009849809,"teacher_disagreement_score":0.55990225,"about_ca_system_score_codex":0.000013524192,"about_ca_system_score_gemma":0.000042897846,"threshold_uncertainty_score":0.18819134},"labels":[],"label_agreement":null},{"id":"W2401899815","doi":"","title":"A characterization of the arithmetical hierarchy by language equations.","year":2004,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Peano axioms; Arithmetic function; Mathematics; Concatenation (mathematics); Hierarchy; Expressive power; Class (philosophy); Axiom; Second-order arithmetic; Property (philosophy); Characterization (materials science); Analytical hierarchy; Discrete mathematics; Algebra over a field; Arithmetic; Pure mathematics; Computer science; Theoretical computer science; Analytic hierarchy process; Mathematical economics","score_opus":0.00519566250757594,"score_gpt":0.21013662021198726,"score_spread":0.20494095770441131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401899815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42654377,0.000028377068,0.57071656,0.0021458413,0.000100394755,0.000060363505,0.000008310876,0.000044750952,0.00035166641],"genre_scores_gemma":[0.99724597,0.0000017860428,0.0021750268,0.00042338984,0.000026462814,0.0000042404317,0.0000075834214,0.0000028688485,0.00011266844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99958366,0.000027858001,0.000089531415,0.000094390794,0.0001253467,0.00007921449],"domain_scores_gemma":[0.99962425,0.00003054348,0.00003919308,0.0002710591,0.000015596577,0.000019365585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010313318,0.00003927527,0.000049494745,0.000020982607,0.000040632807,0.00002889743,0.00036354913,0.000021504055,0.000011871585],"category_scores_gemma":[0.000037402504,0.00002687727,0.000028045431,0.00020121921,0.00003815643,0.00012736545,0.000088570836,0.00004476789,0.000016480193],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.173527e-7,0.0000483869,0.00004269754,0.000004980072,0.000004250093,0.0000011522267,0.001556932,0.000008295728,0.474588,0.5013263,0.00004039484,0.02237765],"study_design_scores_gemma":[0.0009454874,0.000085376865,0.015050218,0.00008116632,0.000011992039,0.000015599328,0.00009956722,0.023325372,0.89894027,0.05620525,0.004949539,0.00029015972],"about_ca_topic_score_codex":0.0000142487315,"about_ca_topic_score_gemma":8.702508e-7,"teacher_disagreement_score":0.5707022,"about_ca_system_score_codex":0.000012649336,"about_ca_system_score_gemma":0.000024430205,"threshold_uncertainty_score":0.10960232},"labels":[],"label_agreement":null},{"id":"W2402226617","doi":"10.25596/jalc-2014-157","title":"Generating the Pseudo-Powers of a Word","year":2014,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Word (group theory); Abelian group; Computer science; Closure (psychology); Power (physics); Connection (principal bundle); Arithmetic; Mathematics; Pure mathematics; Physics; Geometry","score_opus":0.008362743079370773,"score_gpt":0.19823471050112798,"score_spread":0.18987196742175722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402226617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56563145,0.00028361066,0.3955409,0.0038493527,0.0011929222,0.00034740235,0.000007857089,0.0004862906,0.032660227],"genre_scores_gemma":[0.9770265,0.000027488068,0.02028751,0.0008651865,0.00018592435,0.0000025824172,0.0000034605657,0.000017077571,0.001584254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998382,0.00018905396,0.00024133614,0.00041174496,0.00038485258,0.00039102783],"domain_scores_gemma":[0.99833655,0.0002476554,0.00019691569,0.0010156177,0.000097338554,0.00010592668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006480786,0.00020178834,0.00025505194,0.0001306226,0.00033447088,0.0001057572,0.0019362156,0.000088764216,0.00005523243],"category_scores_gemma":[0.00006959236,0.00015508619,0.00015538494,0.0005299656,0.00015303656,0.00092597574,0.0006714094,0.00020022126,0.00010026616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004286249,0.0001942426,0.0006146507,0.0000865975,0.00022657395,0.000052297848,0.013004485,0.0031305556,0.026959997,0.65860516,0.01707318,0.2800094],"study_design_scores_gemma":[0.00363019,0.0007188416,0.006215355,0.00028901186,0.00026627537,0.00011509009,0.01111188,0.7976811,0.011363074,0.019749349,0.1469983,0.0018615274],"about_ca_topic_score_codex":0.00010298723,"about_ca_topic_score_gemma":0.000015360629,"teacher_disagreement_score":0.79455054,"about_ca_system_score_codex":0.00006833751,"about_ca_system_score_gemma":0.00009030953,"threshold_uncertainty_score":0.63242316},"labels":[],"label_agreement":null},{"id":"W2402378065","doi":"","title":"Maximum Genus Embeddings and Genus Embeddings on Orientable Surfaces.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Genus; Mathematics; Combinatorics; Pure mathematics; Zoology; Biology","score_opus":0.007546579958146799,"score_gpt":0.21685188654742626,"score_spread":0.20930530658927946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402378065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917122,0.000338552,0.00045156284,0.0005089466,0.0024855467,0.00029774627,0.0000029845337,0.0003587196,0.0038437175],"genre_scores_gemma":[0.995968,0.000039146,0.0024750654,0.0006358735,0.000016611548,0.000038271563,0.0000034926632,0.000029326568,0.00079420704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801445,0.00006612022,0.0002839676,0.0006604905,0.00038457854,0.00059040566],"domain_scores_gemma":[0.9985519,0.00019934762,0.00013531251,0.00076401304,0.00010312847,0.00024627606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036900848,0.0002863276,0.00029428178,0.0001162236,0.0002654912,0.00053310243,0.0008950048,0.00012291034,0.00012818442],"category_scores_gemma":[0.00006119639,0.0002650726,0.00006653802,0.00040107715,0.00009135628,0.00097401306,0.0004819816,0.00023399404,0.00067049515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007870087,0.0001720395,0.0021569314,0.000029370392,0.000040315448,0.000037732254,0.0015072232,0.000025750125,0.0017958548,0.949766,0.022210117,0.022250839],"study_design_scores_gemma":[0.0016168387,0.00039545613,0.009301138,0.00009617758,0.000017647317,0.00006935499,0.00018504959,0.03580778,0.0073588113,0.9201407,0.024158547,0.0008524881],"about_ca_topic_score_codex":0.00023192144,"about_ca_topic_score_gemma":0.0000010707978,"teacher_disagreement_score":0.03578203,"about_ca_system_score_codex":0.000075993,"about_ca_system_score_gemma":0.000037519723,"threshold_uncertainty_score":0.99998015},"labels":[],"label_agreement":null},{"id":"W2402411904","doi":"","title":"On the Number of Distinct Squares.","year":2014,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Least-squares function approximation; Computer science; Mathematics; Statistics","score_opus":0.0176302303259467,"score_gpt":0.2506568914963618,"score_spread":0.23302666117041507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402411904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69514275,0.000008776401,0.2670309,0.0014362086,0.0002396941,0.00008448239,0.0000024207789,0.000098418495,0.035956353],"genre_scores_gemma":[0.99866915,0.0000018863793,0.00082978414,0.00034769656,0.000029188706,0.000012092354,0.0000010198124,0.0000043018376,0.000104876504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902225,0.00019810339,0.00017617836,0.00025892426,0.00013602171,0.00020851642],"domain_scores_gemma":[0.9980634,0.0010320413,0.00012693554,0.0006758109,0.0000629902,0.00003881355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046489993,0.00010835795,0.00015672576,0.000028025765,0.00008529652,0.000039429637,0.0011184633,0.00005668872,0.00014991412],"category_scores_gemma":[0.0003811962,0.0000712165,0.000042592575,0.00013362912,0.00018020594,0.00008385726,0.00024592617,0.0001626319,0.00014290011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039807173,0.000022029291,0.003731613,0.000005248596,0.000006550351,0.0000016866408,0.00011389683,0.000004284406,0.00020861372,0.9838371,0.00019585382,0.011869132],"study_design_scores_gemma":[0.00076466595,0.00033612584,0.15799664,0.00011964435,0.000015747737,0.0000720342,0.00006828947,0.065933235,0.011844466,0.7586319,0.003719224,0.0004980418],"about_ca_topic_score_codex":0.0000361168,"about_ca_topic_score_gemma":0.000004725426,"teacher_disagreement_score":0.3035264,"about_ca_system_score_codex":0.0000080872,"about_ca_system_score_gemma":0.000040469185,"threshold_uncertainty_score":0.29041246},"labels":[],"label_agreement":null},{"id":"W2402414534","doi":"10.1007/s00224-017-9817-2","title":"The Algebraic Theory of Parikh Automata","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Unary operation; Automaton; Regular language; Affine transformation; Closure (psychology); Mathematics; Discrete mathematics; Algebraic theory; Automata theory; Set (abstract data type); Quantum finite automata; Algebraic number; Algebra over a field; Computer science; Pure mathematics; Theoretical computer science; Programming language","score_opus":0.021471962263549357,"score_gpt":0.2563282494109741,"score_spread":0.23485628714742474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402414534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42081234,0.002429339,0.5528135,0.0003013546,0.0035596564,0.0004920109,0.000008341691,0.00045661544,0.019126851],"genre_scores_gemma":[0.99832517,0.000015879808,0.00092881225,0.000034322067,0.00015953727,0.0000040996556,8.0204103e-7,0.000019836465,0.0005115366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970922,0.0009677758,0.0007250637,0.0003585623,0.00044743548,0.00040895102],"domain_scores_gemma":[0.9927852,0.002551842,0.0013200663,0.003120389,0.00014748213,0.000075010554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008677979,0.00022074694,0.00048699917,0.00007849071,0.0009590829,0.00038223862,0.0049165427,0.000087452216,0.000003956756],"category_scores_gemma":[0.00048607623,0.00014935854,0.00017028395,0.000113208014,0.0006835613,0.00030476088,0.0010598815,0.00016389045,0.000025440046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020699881,0.00003604922,0.00018283939,0.00008886897,0.000074275216,0.0000035684875,0.0012458618,0.00012610026,0.00057937746,0.9465926,0.00021404024,0.05083571],"study_design_scores_gemma":[0.0011145842,0.00023779947,0.018601637,0.0011292221,0.000051092113,0.00010709834,0.0013251969,0.1713261,0.005219043,0.7983644,0.0019441664,0.00057969365],"about_ca_topic_score_codex":0.00003473247,"about_ca_topic_score_gemma":8.879416e-7,"teacher_disagreement_score":0.5775128,"about_ca_system_score_codex":0.000022223518,"about_ca_system_score_gemma":0.00008046977,"threshold_uncertainty_score":0.9136241},"labels":[],"label_agreement":null},{"id":"W2402441013","doi":"","title":"On the Recursive Sequence Order-k.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sequence (biology); Order (exchange); Combinatorics; Applied mathematics; Pure mathematics; Biology","score_opus":0.02118355980526211,"score_gpt":0.24788299946190995,"score_spread":0.22669943965664785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402441013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.962929,0.00035204343,0.0037208877,0.0054589952,0.006726368,0.00027139427,0.000002393298,0.00037112608,0.020167775],"genre_scores_gemma":[0.99704355,0.000008552736,0.00090760365,0.0018091595,0.00001583583,0.000017466502,8.619267e-7,0.0000083142095,0.00018864889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998991,0.00012323563,0.000110964706,0.00018825849,0.00023419454,0.0003523469],"domain_scores_gemma":[0.998556,0.0004952729,0.00006261663,0.0007421291,0.000053471336,0.000090496615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005441409,0.00011631778,0.000094607756,0.000032506454,0.00018174676,0.00008552338,0.0010342067,0.000044661992,0.000046823854],"category_scores_gemma":[0.00018741486,0.000076689976,0.000040143615,0.00038286418,0.000058425587,0.00041417245,0.00019299713,0.00016475063,0.0005757854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014631146,0.000055055887,0.0001514905,0.0000013022307,0.000006318393,0.0000025202203,0.00053136563,0.0000012278556,0.00015025161,0.99005145,0.0069370526,0.0021104866],"study_design_scores_gemma":[0.0001423622,0.000058295827,0.00074968673,0.000017552162,0.0000026446846,0.000009912608,0.000047711033,0.0006589216,0.0028092712,0.9910448,0.0043236366,0.0001351893],"about_ca_topic_score_codex":0.000009908432,"about_ca_topic_score_gemma":2.441461e-7,"teacher_disagreement_score":0.03411454,"about_ca_system_score_codex":0.000043326072,"about_ca_system_score_gemma":0.000030863244,"threshold_uncertainty_score":0.7400748},"labels":[],"label_agreement":null},{"id":"W2402862338","doi":"","title":"Endomorphism monoids of generalized split graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Endomorphism; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.008809712647425761,"score_gpt":0.20874445760834834,"score_spread":0.1999347449609226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402862338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937265,0.00030852854,0.001653865,0.00033161129,0.0014413322,0.00021238411,0.0000015659565,0.00018752101,0.002136704],"genre_scores_gemma":[0.99195194,0.000024708064,0.0075227995,0.00023106755,0.0000050844783,0.000038469614,0.0000024817734,0.000011637115,0.00021178806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883336,0.00008155478,0.00028522074,0.00028351852,0.00024283928,0.00027353448],"domain_scores_gemma":[0.9987948,0.000103009465,0.00012716607,0.00076890463,0.00010198574,0.000104152896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022626425,0.00014559198,0.00024608307,0.000103881015,0.000063512176,0.00008004297,0.0009937651,0.000067894536,0.0001305739],"category_scores_gemma":[0.000026692263,0.00013081911,0.00010663714,0.00036131663,0.000075112854,0.00045431286,0.00024958706,0.00009651701,0.00017746635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002136781,0.00006881128,0.0007194965,0.0000075665394,0.00001770325,0.0000030417598,0.0001561525,0.0000015580498,0.007065224,0.98350716,0.0038277844,0.0046233605],"study_design_scores_gemma":[0.0009035549,0.000081276135,0.0052798023,0.000012510591,0.0000048354655,0.0000066514194,0.000011326079,0.005320779,0.014467953,0.9731126,0.0006345608,0.000164146],"about_ca_topic_score_codex":0.00020077574,"about_ca_topic_score_gemma":3.895209e-7,"teacher_disagreement_score":0.010394559,"about_ca_system_score_codex":0.000017818635,"about_ca_system_score_gemma":0.000029130306,"threshold_uncertainty_score":0.5334649},"labels":[],"label_agreement":null},{"id":"W2403784750","doi":"","title":"Transition Complexity of Language Operations.","year":2006,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; Regular language; Computer science; Deterministic finite automaton; State (computer science); Regular expression; Finite-state machine; Automaton; Mathematics; Theoretical computer science; Programming language; Automata theory","score_opus":0.013856491255630364,"score_gpt":0.233511927603605,"score_spread":0.21965543634797463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403784750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46695408,0.000089937676,0.5284825,0.00066853914,0.00006106551,0.000043741235,0.000007806638,0.00009037922,0.0036019646],"genre_scores_gemma":[0.9808871,5.814962e-7,0.018850094,0.00013050043,0.000045015273,0.0000017110048,0.0000122986485,0.0000017852825,0.000070913324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996808,0.000021500806,0.00008482157,0.000081064754,0.000071090566,0.000060676768],"domain_scores_gemma":[0.9997779,0.000010560738,0.000012802447,0.00017222106,0.00001601448,0.000010468058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007992967,0.000033305263,0.00005323561,0.00002540348,0.000032359552,0.000022778919,0.00016631652,0.000014442795,0.000032645665],"category_scores_gemma":[0.0000020570465,0.000029955989,0.000023616542,0.000095513475,0.00003628346,0.00014499131,0.000017458427,0.000022355074,0.000018261937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012598528,0.000050923885,0.000025323547,0.000008880815,0.0000026009434,0.000004815425,0.0013004115,0.00052774936,0.03930215,0.9499993,0.0005915034,0.00818509],"study_design_scores_gemma":[0.0009799965,0.00011232087,0.02999721,0.000046332552,0.000010957915,0.00003462034,0.00040675138,0.59684217,0.25294873,0.11602286,0.0022001297,0.00039791674],"about_ca_topic_score_codex":0.00030625914,"about_ca_topic_score_gemma":0.000039465176,"teacher_disagreement_score":0.83397645,"about_ca_system_score_codex":0.00000532919,"about_ca_system_score_gemma":0.000008011032,"threshold_uncertainty_score":0.12215698},"labels":[],"label_agreement":null},{"id":"W2404371155","doi":"","title":"Some new monoid and group constructions under semidirect products.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Monoid; Group (periodic table); Semidirect product; Algebra over a field; Pure mathematics; Chemistry; Organic chemistry","score_opus":0.009443995149665058,"score_gpt":0.21686068752378948,"score_spread":0.2074166923741244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404371155","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9634664,0.005394923,0.0047499137,0.016414305,0.0057095415,0.00044083528,0.0000027949682,0.0012853608,0.0025359455],"genre_scores_gemma":[0.9913413,0.00010725703,0.0069321557,0.0012435295,0.000054579577,0.000003524789,0.000002291655,0.000008974128,0.00030639215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891514,0.000050713697,0.00017101869,0.0004300853,0.00016381472,0.00026922888],"domain_scores_gemma":[0.99912834,0.00008360848,0.00006407469,0.0005445233,0.000035389967,0.00014408428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018977752,0.0001546876,0.0001726884,0.000081925384,0.00016489453,0.00017289835,0.0004193393,0.00006229745,0.000005416259],"category_scores_gemma":[0.000043332562,0.0001478534,0.00003466965,0.0003455359,0.00006321664,0.0007256307,0.00011391078,0.0001380152,0.000027308732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001916332,0.000046038178,0.0000804527,0.000003163594,0.000009435775,0.0000047889,0.00012802193,0.0000024438846,0.0024462754,0.9737219,0.0047195856,0.01883598],"study_design_scores_gemma":[0.0004663079,0.000103679406,0.0046269097,0.0000152556795,0.000007355885,0.00006206492,0.000025751602,0.00073702534,0.003490049,0.9881068,0.0021582062,0.00020061688],"about_ca_topic_score_codex":0.000025269155,"about_ca_topic_score_gemma":6.3270545e-7,"teacher_disagreement_score":0.027874915,"about_ca_system_score_codex":0.000033275224,"about_ca_system_score_gemma":0.00006744764,"threshold_uncertainty_score":0.60292864},"labels":[],"label_agreement":null},{"id":"W2404648201","doi":"10.4169/amer.math.monthly.122.6.515","title":"Collapse: A Fibonacci and Sturmian Game","year":2015,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Fibonacci number; Fibonacci polynomials; Set (abstract data type); Mathematics; Pisano period; Combinatorics; Computer science","score_opus":0.015941436653906377,"score_gpt":0.24930249828228324,"score_spread":0.23336106162837686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404648201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37031126,0.0010062052,0.4549914,0.0098260045,0.00029917387,0.0007374717,0.00001635275,0.0013209151,0.1614912],"genre_scores_gemma":[0.9148964,0.0000043784157,0.08382608,0.0009433383,0.000045527035,0.000023808198,9.0853854e-7,0.000014226781,0.00024532384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987704,0.00007210813,0.00022380029,0.00032853658,0.00030017784,0.0003049396],"domain_scores_gemma":[0.9987088,0.0002518089,0.00009698518,0.0005369926,0.00004915421,0.0003562715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033204575,0.00015862018,0.00031064375,0.000059872706,0.000040813364,0.00015700933,0.0005281945,0.00002984512,0.000009607118],"category_scores_gemma":[0.00021437825,0.00012574765,0.00004308287,0.00035867663,0.00026238238,0.00024594058,0.00030893102,0.00009613527,0.00016273579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012705856,0.00016575569,0.00025393593,0.00002158079,0.000031039643,0.000068027366,0.0032655569,0.000015797392,0.00010782654,0.96588945,0.006995768,0.023172546],"study_design_scores_gemma":[0.0005283054,0.00043911656,0.0019118957,0.00003719642,0.000014585272,0.00007048065,0.0010859024,0.10226734,0.00017053736,0.8857408,0.0073405965,0.00039322427],"about_ca_topic_score_codex":0.000038251783,"about_ca_topic_score_gemma":0.0000040218315,"teacher_disagreement_score":0.54458517,"about_ca_system_score_codex":0.000031603915,"about_ca_system_score_gemma":0.00005158083,"threshold_uncertainty_score":0.51278406},"labels":[],"label_agreement":null},{"id":"W2404946359","doi":"","title":"Repetition Complexity of Words.","year":2002,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Repetition (rhetorical device); De Bruijn sequence; Word (group theory); Mathematics; Logarithm; Computational complexity theory; Iterated function; Time complexity; Complexity class; Combinatorics; Prefix; Discrete mathematics; Morphism; Combinatorics on words; Arithmetic; Algorithm","score_opus":0.048147448014609795,"score_gpt":0.23035284030705733,"score_spread":0.18220539229244753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404946359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33322328,0.0008007139,0.5358206,0.006135734,0.0009152193,0.00020313631,0.00001285321,0.00069654384,0.12219189],"genre_scores_gemma":[0.9850406,0.0000099543595,0.014377626,0.00019532915,0.00003894056,0.0000014690033,0.0000010455236,0.00000219114,0.0003328277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958795,0.000022375487,0.000094180345,0.000113445334,0.000098315744,0.00008372247],"domain_scores_gemma":[0.99957764,0.000023023485,0.00004282785,0.0003165419,0.00001679312,0.000023154387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009830947,0.000038381415,0.0000660129,0.000029222976,0.00002776152,0.000017619172,0.00028412903,0.000017283368,0.00024550428],"category_scores_gemma":[0.000012132906,0.000034860706,0.00002963861,0.00013445786,0.00005468255,0.0001378532,0.00006907992,0.0000330896,0.000107789776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.711932e-7,0.000055603672,0.00020051682,0.000011505633,0.0000047676226,0.000005943904,0.0006589178,0.000005220595,0.0019026921,0.91657627,0.0042262496,0.076351345],"study_design_scores_gemma":[0.0009644838,0.00023452027,0.027209869,0.00012865399,0.000010085368,0.00006980413,0.00011448835,0.36906874,0.039240967,0.49174064,0.07065261,0.0005651429],"about_ca_topic_score_codex":0.000012332003,"about_ca_topic_score_gemma":0.0000013596784,"teacher_disagreement_score":0.6518173,"about_ca_system_score_codex":0.000006716226,"about_ca_system_score_gemma":0.0000021555434,"threshold_uncertainty_score":0.26880997},"labels":[],"label_agreement":null},{"id":"W2405494927","doi":"","title":"Non-Uniqueness and Radius of Cyclic Unary NFAs.","year":2004,"lang":"es","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Acadia University","funders":"","keywords":"Unary operation; Nondeterministic algorithm; RADIUS; Mathematics; Uniqueness; Regular language; Diophantine equation; Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Theoretical computer science; Artificial intelligence; Automaton","score_opus":0.006565634247570317,"score_gpt":0.22898488601908956,"score_spread":0.22241925177151925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405494927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9755481,0.0019044166,0.018862147,0.0008777539,0.00038023436,0.00014199817,0.000011244389,0.000074370066,0.0021997606],"genre_scores_gemma":[0.99554574,0.00029189355,0.003640759,0.0003062959,0.00012031737,0.000004469559,0.000002322361,0.000014449199,0.00007373176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99888766,0.000041018044,0.0002573966,0.00035785022,0.00018733456,0.00026875507],"domain_scores_gemma":[0.99910706,0.00007112106,0.00012724446,0.0005478898,0.000038436392,0.000108245964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026440134,0.00017667719,0.0002748571,0.00010694092,0.0000868576,0.00010835111,0.0005464463,0.00010401258,0.000015485626],"category_scores_gemma":[0.000014118482,0.00016457753,0.000067909445,0.000300877,0.0002063112,0.000300587,0.0002971138,0.00012268194,0.0000349383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047206813,0.000412706,0.0088957725,0.00063732744,0.00012322809,0.00030887467,0.006693937,0.00045930076,0.04802643,0.7264449,0.0004529739,0.20749737],"study_design_scores_gemma":[0.005651767,0.0013435163,0.3789166,0.0026449913,0.00014669151,0.00060795556,0.00050309877,0.025335819,0.3022428,0.26770452,0.012838986,0.002063301],"about_ca_topic_score_codex":0.00018823857,"about_ca_topic_score_gemma":0.0000026132439,"teacher_disagreement_score":0.45874038,"about_ca_system_score_codex":0.00002785043,"about_ca_system_score_gemma":0.000093064664,"threshold_uncertainty_score":0.67112774},"labels":[],"label_agreement":null},{"id":"W2406664471","doi":"","title":"Estimation of State Complexity of Combined Operations.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; State (computer science); Alphabet; Upper and lower bounds; Mathematics; Regular language; Computer science; Theoretical computer science; Algorithm; Discrete mathematics; Automaton; Linguistics","score_opus":0.03663116717581648,"score_gpt":0.2526408769094715,"score_spread":0.21600970973365502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406664471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6475559,0.000017361976,0.35178518,0.00013706737,0.00004984092,0.000047022077,0.0000049821565,0.00003457572,0.00036809346],"genre_scores_gemma":[0.95317614,0.000004687351,0.046706747,0.00004239269,0.000004167771,0.0000016559926,0.000005640746,0.0000019013657,0.000056656485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995518,0.000029036646,0.00016346056,0.00008226846,0.00011236368,0.00006108383],"domain_scores_gemma":[0.99961144,0.000029256287,0.00004886587,0.0002446432,0.000046971974,0.0000188117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107805026,0.000039947332,0.00009829813,0.0000382716,0.000044531575,0.000006973134,0.00024090266,0.000011770388,0.000014638237],"category_scores_gemma":[0.000019168818,0.000036169455,0.00002325326,0.0001432444,0.000108832995,0.00018928661,0.00005957764,0.000024318919,0.000010062924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016315771,0.00025056285,0.00091642817,0.000053512333,0.000025438356,0.0000075754815,0.004646303,0.02256161,0.014516359,0.90669245,0.0009764952,0.049336933],"study_design_scores_gemma":[0.00029451767,0.000078005134,0.01873393,0.000013282154,0.0000014948292,0.0000071993295,0.000009162548,0.8986973,0.05843501,0.023624552,0.000043611486,0.000061909595],"about_ca_topic_score_codex":0.00006671706,"about_ca_topic_score_gemma":0.0000035445037,"teacher_disagreement_score":0.8830679,"about_ca_system_score_codex":0.00000586249,"about_ca_system_score_gemma":0.000028919714,"threshold_uncertainty_score":0.14749475},"labels":[],"label_agreement":null},{"id":"W2406984000","doi":"","title":"Lower Bounds against Weakly Uniform Circuits.","year":2012,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Succinctness; Connection (principal bundle); Boolean circuit; Mathematics; Electronic circuit; Discrete mathematics; Circuit complexity; Polynomial; Relaxation (psychology); Boolean function; Combinatorics; Pigeonhole principle; Time complexity; Physics; Mathematical analysis; Quantum mechanics; Geometry","score_opus":0.024397094283383106,"score_gpt":0.2601159559057044,"score_spread":0.2357188616223213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406984000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34563404,0.00071300793,0.60181934,0.003101949,0.002303344,0.0006761107,0.000039102895,0.0012451141,0.04446801],"genre_scores_gemma":[0.99098146,0.000007918373,0.0051145395,0.0030423824,0.0003522075,0.000031256244,0.00007509538,0.000028105844,0.00036701682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677664,0.00017220309,0.00042479462,0.00054347864,0.0008108139,0.0012720658],"domain_scores_gemma":[0.9983406,0.00038543757,0.0001888349,0.0006411338,0.00015950842,0.00028448057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089662184,0.00035069018,0.0003268652,0.0002197928,0.0005418014,0.00025130814,0.0011803245,0.000098125696,0.00014946412],"category_scores_gemma":[0.00004384968,0.0003525688,0.00019246594,0.0008163589,0.0001679115,0.0008321911,0.0002950906,0.00046140666,0.00049136946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020362471,0.00041947412,0.00018291514,0.000008894641,0.000050889896,0.0000043427913,0.00019104815,0.002564255,0.0001611511,0.98361707,0.0031235097,0.009656082],"study_design_scores_gemma":[0.0015246433,0.00082045345,0.032282196,0.000048887792,0.000020164456,0.00011335888,0.00004817809,0.30001685,0.0005416526,0.5749617,0.08837258,0.0012493023],"about_ca_topic_score_codex":0.00001489654,"about_ca_topic_score_gemma":0.000014554974,"teacher_disagreement_score":0.6453474,"about_ca_system_score_codex":0.0006434981,"about_ca_system_score_gemma":0.0005011288,"threshold_uncertainty_score":0.99989265},"labels":[],"label_agreement":null},{"id":"W2407080619","doi":"","title":"Low uniform versions of NC1.","year":2011,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Characterization (materials science); Logarithm; Power (physics); Electronic circuit; Mathematics; Computer science; Value (mathematics); Word (group theory); Discrete mathematics; Combinatorics; Algorithm; Topology (electrical circuits); Geometry; Physics; Mathematical analysis","score_opus":0.03610587064497138,"score_gpt":0.24498704681168648,"score_spread":0.2088811761667151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407080619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27240106,0.00008327604,0.7008375,0.0006045246,0.00044347454,0.00039788656,0.000033526885,0.0004086433,0.02479009],"genre_scores_gemma":[0.97591114,0.0000037759428,0.023508692,0.00039607292,0.000031567877,0.000009714684,0.000022208806,0.000010799847,0.000106049774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998271,0.00009921326,0.00033283085,0.00038446652,0.0004576951,0.00045479386],"domain_scores_gemma":[0.99884164,0.00024572306,0.00017984075,0.0004636642,0.00016708141,0.000102051265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036153276,0.0001858332,0.00024497972,0.00018342941,0.00020651871,0.000030759067,0.0010121171,0.00005447955,0.0002602531],"category_scores_gemma":[0.00002670189,0.00018344689,0.00013618289,0.00059526274,0.00016392382,0.00026052992,0.00023760596,0.00022347727,0.00010528005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051330717,0.0003281586,0.0000639142,0.000010874009,0.000036077483,0.000003983512,0.0003356503,0.0011483562,0.00011891523,0.9949296,0.0006422161,0.0023308853],"study_design_scores_gemma":[0.00080868846,0.0008370461,0.0141458465,0.00003364967,0.000009362141,0.000023503728,0.000040538038,0.1765891,0.004096986,0.80205685,0.0010519683,0.00030644634],"about_ca_topic_score_codex":0.000050082013,"about_ca_topic_score_gemma":0.000024189194,"teacher_disagreement_score":0.70351005,"about_ca_system_score_codex":0.00017180585,"about_ca_system_score_gemma":0.00041103183,"threshold_uncertainty_score":0.74807465},"labels":[],"label_agreement":null},{"id":"W2407154113","doi":"","title":"State complexity of prefix-free regular languages","year":2006,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Prefix; Regular language; Computer science; State (computer science); Abstract family of languages; Theoretical computer science; Programming language; Arithmetic; Automaton; Mathematics; Linguistics; Second-generation programming language","score_opus":0.013825166592377978,"score_gpt":0.22874204676205076,"score_spread":0.21491688016967278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407154113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39128074,0.00037438597,0.5186265,0.0010713335,0.000115300405,0.00012886908,0.000019246829,0.0005271367,0.08785648],"genre_scores_gemma":[0.91613823,0.0000020903146,0.08115655,0.00012926711,0.000025958234,0.0000018010237,0.0000032112493,0.0000045050024,0.0025383702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993627,0.000032628657,0.00014736444,0.00015959154,0.00015692376,0.0001407659],"domain_scores_gemma":[0.9991408,0.00003542906,0.00005580957,0.0007145636,0.000030159208,0.000023251672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016954678,0.0000665752,0.00010793744,0.000039189,0.000028408189,0.000033654916,0.0007937713,0.000017723301,0.00005319467],"category_scores_gemma":[0.000009942897,0.000052470234,0.00003878585,0.00013584924,0.000089752946,0.00017536717,0.00027709836,0.00003248137,0.000017294826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016910408,0.000048750364,0.0003395995,0.000011982383,0.000004817356,0.000006330212,0.00008451507,0.00003255542,0.0042791427,0.98196155,0.007615008,0.005614064],"study_design_scores_gemma":[0.00039961003,0.000049714607,0.027164748,0.000015394913,0.0000028500745,0.000010300309,0.000046755726,0.013358201,0.094452515,0.86223847,0.0020879149,0.0001735014],"about_ca_topic_score_codex":0.0005136343,"about_ca_topic_score_gemma":0.000064338725,"teacher_disagreement_score":0.5248575,"about_ca_system_score_codex":0.0000074785853,"about_ca_system_score_gemma":0.000012078867,"threshold_uncertainty_score":0.2139674},"labels":[],"label_agreement":null},{"id":"W2407362099","doi":"","title":"Bridges between Algebraic Automata Theory and Complexity Theory.","year":2006,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Algebraic theory; Automaton; Automata theory; Computer science; Computation; Semigroup; Algebra over a field; Algebraic number; Theoretical computer science; Krohn–Rhodes theory; Theory of computation; Finite-state machine; Mathematics; Discrete mathematics; Algorithm; Special classes of semigroups; Pure mathematics","score_opus":0.020045024236462962,"score_gpt":0.24084838510107667,"score_spread":0.22080336086461372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407362099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33779263,0.00031680567,0.6421147,0.0009221739,0.00011899316,0.00013249977,0.000013325176,0.0010256171,0.017563228],"genre_scores_gemma":[0.9854766,0.0000064475184,0.012269336,0.0005644836,0.00015257199,0.00000550844,0.0000120008835,0.00001358576,0.0014994423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835277,0.00035544168,0.00025532968,0.00046469553,0.00022046301,0.00035131295],"domain_scores_gemma":[0.9982523,0.00083014613,0.0000771662,0.0007197956,0.000028742943,0.00009189756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016913872,0.00019583828,0.00023780882,0.000091081994,0.00020231456,0.00027673584,0.0008857431,0.000067274654,0.00011749074],"category_scores_gemma":[0.000041969495,0.00015467468,0.000059759317,0.00020018745,0.00028085132,0.00049054256,0.00052522897,0.00010982685,0.00010269815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037267946,0.000027609958,0.0028253102,0.000007806559,0.000011605478,0.00000560916,0.000071368166,0.0000010806215,0.0001395589,0.9626618,0.0010131131,0.033231426],"study_design_scores_gemma":[0.00024984078,0.00003071405,0.18375,0.000010137909,0.000008320799,0.00002130419,0.00003979143,0.002902251,0.0016328706,0.80979586,0.0013480256,0.00021087352],"about_ca_topic_score_codex":0.000113182396,"about_ca_topic_score_gemma":0.000010471561,"teacher_disagreement_score":0.647684,"about_ca_system_score_codex":0.000018038225,"about_ca_system_score_gemma":0.000023713907,"threshold_uncertainty_score":0.63074505},"labels":[],"label_agreement":null},{"id":"W2407962255","doi":"","title":"State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Waterloo","funders":"","keywords":"Alphabet; Regular language; Mathematics; Combinatorics; State (computer science); Class (philosophy); Hierarchy; Discrete mathematics; Formal language; Complexity class; Simple (philosophy); Pumping lemma for regular languages; Set (abstract data type); Automaton; Time complexity; Computer science; Theoretical computer science; Algorithm; Linguistics","score_opus":0.021792489354975023,"score_gpt":0.24690518062486091,"score_spread":0.2251126912698859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407962255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98061717,0.0002794882,0.013551298,0.00015696495,0.00008492625,0.00006781013,0.000026093403,0.00010473278,0.00511152],"genre_scores_gemma":[0.97515124,0.000058946294,0.024358094,0.00007467991,0.00002475733,0.0000019785432,0.0000026317184,0.000005890883,0.00032178548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991967,0.000041356245,0.00022279893,0.00015842852,0.00020683011,0.0001738854],"domain_scores_gemma":[0.99914706,0.0001961002,0.00011648415,0.00044959367,0.000047704092,0.000043040476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017451154,0.00009133048,0.00020296937,0.0000665362,0.000052817984,0.0000087386015,0.00060434244,0.000025534022,0.00004249782],"category_scores_gemma":[0.00004755664,0.00007673192,0.0000652785,0.00021666902,0.0002462546,0.00021451738,0.00017800083,0.00006772316,0.000011387587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006488782,0.00042345806,0.012151717,0.00032004892,0.00017434442,0.00014750242,0.02807578,0.00021996029,0.037347022,0.75584835,0.004105835,0.16112109],"study_design_scores_gemma":[0.0020647014,0.00068115536,0.33053204,0.00017253506,0.000020115593,0.00015737864,0.0010407045,0.02149833,0.44076908,0.19284321,0.00932257,0.0008981961],"about_ca_topic_score_codex":0.00018005789,"about_ca_topic_score_gemma":0.000011380996,"teacher_disagreement_score":0.56300515,"about_ca_system_score_codex":0.000011670302,"about_ca_system_score_gemma":0.00004934167,"threshold_uncertainty_score":0.31290367},"labels":[],"label_agreement":null},{"id":"W2408319280","doi":"","title":"Input-Driven Pushdown Automata with Limited Nondeterminism (Invited Paper)","year":2014,"lang":"en","type":"article","venue":"Developments in Language Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Pushdown automaton; Deterministic pushdown automaton; Nondeterministic algorithm; Embedded pushdown automaton; Discrete mathematics; Automaton; Path (computing); Computer science; Algorithm; Computation; Mathematics; Combinatorics; Theoretical computer science; Nondeterministic finite automaton; Automata theory; Rule-based machine translation; Artificial intelligence; Programming language","score_opus":0.005016240646057672,"score_gpt":0.2126898059308322,"score_spread":0.20767356528477451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408319280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78732806,0.0001319005,0.18985178,0.00060058053,0.00054261286,0.0004900891,0.0000081358185,0.001240947,0.019805884],"genre_scores_gemma":[0.9264811,0.000008678663,0.067573205,0.0052944133,0.00005009927,0.00005217294,0.00004231243,0.00003812049,0.00045989023],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9976155,0.0003927641,0.0003978722,0.0006236967,0.0004025822,0.0005675709],"domain_scores_gemma":[0.9982527,0.000364906,0.00015042376,0.0010571892,0.000039621522,0.00013515979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012266393,0.00032091953,0.0003290177,0.0003534393,0.00011782566,0.00015845326,0.0015352755,0.00012161285,0.00007135789],"category_scores_gemma":[0.00014906113,0.00025455392,0.00004310444,0.0006852111,0.00011467759,0.0006352589,0.0005197156,0.00024733442,0.0001524382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015054141,0.0004554943,0.003954654,0.00009377848,0.00014553613,0.0007919896,0.03709445,0.00009563902,0.013992606,0.22002535,0.0006042301,0.72259575],"study_design_scores_gemma":[0.028618649,0.0018513509,0.50041294,0.0034533269,0.00013752445,0.0015308671,0.008141404,0.14918047,0.057888847,0.14008291,0.09781253,0.010889166],"about_ca_topic_score_codex":0.0000137014285,"about_ca_topic_score_gemma":0.000021667776,"teacher_disagreement_score":0.7117066,"about_ca_system_score_codex":0.00008162884,"about_ca_system_score_gemma":0.000073794654,"threshold_uncertainty_score":0.99999064},"labels":[],"label_agreement":null},{"id":"W24097891","doi":"","title":"Permutations Restricted By Patterns Of Type (2, 1).","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Biology","score_opus":0.00854896597266616,"score_gpt":0.23052660469578637,"score_spread":0.2219776387231202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24097891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98823047,0.00012439406,0.009676864,0.00034992234,0.00086416234,0.000072190516,0.000007370974,0.00013659932,0.00053800514],"genre_scores_gemma":[0.99886256,0.000016894626,0.00092252914,0.000098052034,0.0000025899178,0.0000035472674,0.0000104944365,0.0000067802116,0.00007655432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993246,0.000028655297,0.00015988262,0.00017404537,0.0001661049,0.0001466829],"domain_scores_gemma":[0.9993499,0.00005663027,0.000070967806,0.0003875896,0.00008167978,0.000053212447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000070864255,0.00007769665,0.00010522709,0.000055066044,0.00005522028,0.000034140507,0.00050654844,0.000041771207,0.000013445558],"category_scores_gemma":[0.000041299343,0.00007459585,0.00003203725,0.00037710683,0.000021180344,0.00020965796,0.00009552961,0.00007148631,0.000036594163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015169414,0.00010564604,0.0008603258,0.000005332691,0.000008798827,0.0000051230695,0.00032282932,0.00002302906,0.0033933285,0.99382514,0.0007488531,0.0007000632],"study_design_scores_gemma":[0.0010325371,0.00019384282,0.012290119,0.000036788526,0.0000073868914,0.000008918128,0.0000644301,0.0007300191,0.014941573,0.9696837,0.00082579104,0.00018488741],"about_ca_topic_score_codex":0.000093879105,"about_ca_topic_score_gemma":0.0000010314992,"teacher_disagreement_score":0.024141448,"about_ca_system_score_codex":0.0000308491,"about_ca_system_score_gemma":0.00006103991,"threshold_uncertainty_score":0.30419308},"labels":[],"label_agreement":null},{"id":"W2410782219","doi":"10.46298/dmtcs.2727","title":"Universal cycles for permutation classes","year":2009,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Permutation (music); Class (philosophy); Parity of a permutation; Cyclic permutation; Symmetric group; Physics","score_opus":0.018646532285511847,"score_gpt":0.2787453586999372,"score_spread":0.2600988264144254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2410782219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010128137,0.00043430764,0.96841836,0.0127809355,0.0017217653,0.0006447193,0.00003436923,0.0002898008,0.0055476255],"genre_scores_gemma":[0.5570691,0.00002674464,0.44151875,0.0008407808,0.000331804,0.000007628729,0.0000058551386,0.000019206753,0.00018013154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956702,0.00014982461,0.0006954538,0.0011688126,0.00103514,0.0012805616],"domain_scores_gemma":[0.996412,0.001114406,0.000282308,0.0011853501,0.00050596026,0.0005000132],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023640112,0.0005061249,0.0005497024,0.00028054242,0.0009127517,0.001900029,0.0030485326,0.00018314923,0.00010627252],"category_scores_gemma":[0.00033690195,0.00045172632,0.0002994647,0.0012493347,0.004370576,0.0019914028,0.0006217198,0.00029557166,0.000113239694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012035403,0.00025325987,0.0000023627795,0.000102047,0.000013852442,0.000020256133,0.0037869562,0.00023443582,0.00087232434,0.9283366,0.00035675464,0.06600907],"study_design_scores_gemma":[0.0002565894,0.0004023039,0.00008610155,0.000211271,0.00003428347,0.000063863634,0.00015607831,0.51006866,0.001100983,0.48691216,0.00037788835,0.00032984035],"about_ca_topic_score_codex":0.0000032918415,"about_ca_topic_score_gemma":6.34311e-7,"teacher_disagreement_score":0.546941,"about_ca_system_score_codex":0.00014922177,"about_ca_system_score_gemma":0.00034907696,"threshold_uncertainty_score":0.99979347},"labels":[],"label_agreement":null},{"id":"W241508062","doi":"10.1007/978-0-387-68759-9_4","title":"Equations Over ω-Automata","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Automaton; Computer science; Theoretical computer science","score_opus":0.034341375351331346,"score_gpt":0.2287106275507101,"score_spread":0.19436925219937873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W241508062","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.08931e-7,0.00012451132,0.33503225,0.000098277305,0.00032649204,0.00007886647,0.0000071284,0.0005305427,0.6638013],"genre_scores_gemma":[0.0014628395,0.00006405822,0.011166951,0.00093976466,0.00013375058,0.000006473903,0.000017408545,0.00003556176,0.9861732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988233,0.000008970442,0.0002477776,0.00045284093,0.00026354997,0.00020356805],"domain_scores_gemma":[0.9982935,0.00011159658,0.00013231882,0.0013285897,0.000044116536,0.00008985434],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001579093,0.00025301505,0.0002247345,0.000148352,0.00007713472,0.00012063568,0.0013183889,0.0002122735,0.0042405585],"category_scores_gemma":[0.000010995939,0.00021599223,0.00014286966,0.000030344132,0.00005162407,0.0003292039,0.0005457673,0.00018512912,0.0032314125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.9741468e-7,0.0000085488955,2.6610007e-7,0.0000049896835,0.000021326001,0.000011481583,0.000054147946,2.3492525e-7,0.000005118016,0.95181084,0.012073329,0.036009304],"study_design_scores_gemma":[0.00009168265,0.000024893434,0.000015678575,0.000041325242,0.000011552459,0.000008109556,5.952135e-7,0.004640367,0.000030473542,0.6785372,0.31628996,0.00030817706],"about_ca_topic_score_codex":0.000022328248,"about_ca_topic_score_gemma":0.0000072100165,"teacher_disagreement_score":0.32386532,"about_ca_system_score_codex":0.000029267712,"about_ca_system_score_gemma":0.000069022375,"threshold_uncertainty_score":0.9975447},"labels":[],"label_agreement":null},{"id":"W2419591848","doi":"10.1016/j.dam.2016.05.003","title":"The New Periodicity Lemma revisited","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Lemma (botany); Factorization; String (physics); Neighbourhood (mathematics); Combinatorics; Algorithm; Mathematical analysis","score_opus":0.010581352350266988,"score_gpt":0.2258826769507843,"score_spread":0.2153013246005173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2419591848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040912926,0.00015655775,0.97542685,0.0029447586,0.00009237328,0.0002488274,0.0000037294571,0.00033645742,0.01669912],"genre_scores_gemma":[0.72647256,0.00028713635,0.26724908,0.0011137732,0.00037007598,0.000076048535,0.0000036561469,0.00006408475,0.0043636146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878424,0.000016929604,0.0002959443,0.0002749838,0.00029406187,0.00033382117],"domain_scores_gemma":[0.9981428,0.00044317704,0.00014744457,0.0011215612,0.000024947913,0.00012010943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044271993,0.00016949937,0.00018954603,0.000028977038,0.0002774978,0.00026747145,0.001275034,0.000050970757,0.00003626261],"category_scores_gemma":[0.00007362431,0.00007853208,0.00007790368,0.00019964522,0.00010364617,0.00016257628,0.00034924364,0.00007386643,0.0003791545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023189973,0.0000107636215,0.0000025678505,0.000012377,0.000012555343,0.0000015066855,0.00049848045,2.6860224e-7,0.0075631374,0.9282322,0.006442045,0.05722177],"study_design_scores_gemma":[0.0006175931,0.00003239123,0.000115460796,0.00011924016,0.000018668454,0.000021337917,0.00022211847,0.003997016,0.012724681,0.9137366,0.06798955,0.00040534258],"about_ca_topic_score_codex":0.0000018250844,"about_ca_topic_score_gemma":0.0000011535288,"teacher_disagreement_score":0.72238123,"about_ca_system_score_codex":0.000026924501,"about_ca_system_score_gemma":0.000047605747,"threshold_uncertainty_score":0.48733902},"labels":[],"label_agreement":null},{"id":"W2422636290","doi":"10.1051/ita/2016010","title":"Decision algorithms for Fibonacci-automatic Words, I: Basic results","year":2016,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Morphism; Class (philosophy); Word (group theory); Algorithm; Computer science; Point (geometry); Palindrome; Arithmetic; Combinatorics; Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.011414138565296647,"score_gpt":0.26358908885084137,"score_spread":0.2521749502855447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2422636290","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033273206,0.0000485928,0.9909751,0.0021739968,0.00007014931,0.0006410899,0.000101462414,0.00023285217,0.0024294772],"genre_scores_gemma":[0.48953825,0.00013887777,0.50809646,0.0011579451,0.00014124258,0.000688726,0.000027483464,0.000022825152,0.00018818206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855554,0.000021335334,0.0006395025,0.00023229828,0.00022127345,0.00033006555],"domain_scores_gemma":[0.9970206,0.0017895695,0.00015806808,0.0007574728,0.00008248879,0.00019179916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006767252,0.00017664373,0.00020847171,0.00009434211,0.00025140023,0.00019839297,0.00066202215,0.000094631025,0.000026603648],"category_scores_gemma":[0.00016480166,0.00010942342,0.0000822128,0.0002493042,0.00030022464,0.0004265137,0.00026158325,0.00007030594,0.00009483223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004569472,0.000022042843,0.0000011872024,0.000012238205,0.0000049999535,8.960391e-8,0.0001282861,0.0000017217304,0.000042299107,0.5773824,0.0006189002,0.42178124],"study_design_scores_gemma":[0.00087035866,0.000068975285,0.00009326598,0.00007820855,0.000010947864,0.000014609033,0.000070767725,0.26739514,0.00035243193,0.701748,0.029094718,0.00020256072],"about_ca_topic_score_codex":5.371708e-7,"about_ca_topic_score_gemma":2.255475e-7,"teacher_disagreement_score":0.48621094,"about_ca_system_score_codex":0.000026294376,"about_ca_system_score_gemma":0.000034966757,"threshold_uncertainty_score":0.44621575},"labels":[],"label_agreement":null},{"id":"W2430843852","doi":"10.1007/978-3-319-41114-9_5","title":"Unrestricted State Complexity of Binary Operations on Regular Languages","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concatenation (mathematics); Alphabet; Binary number; State (computer science); Product (mathematics); Combinatorics; Discrete mathematics; Quotient; Intersection (aeronautics); Time complexity; Mathematics; Regular language; Computer science; Arithmetic; Algorithm; Theoretical computer science; Automaton","score_opus":0.02201696527997163,"score_gpt":0.25859836794947844,"score_spread":0.2365814026695068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2430843852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001952396,0.0002681227,0.9931011,0.0010264197,0.0006446962,0.00028915182,0.000042512358,0.00018103117,0.0024945335],"genre_scores_gemma":[0.68493307,0.00009901003,0.31119376,0.0017248985,0.0003831078,0.000011601409,0.00001725091,0.000058466037,0.0015788015],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718827,0.00006426236,0.00047729284,0.001041794,0.0007754144,0.00045293968],"domain_scores_gemma":[0.99742764,0.00045262653,0.00020805301,0.0015866846,0.00020198249,0.00012301114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005710726,0.00039928372,0.00047685314,0.00076240033,0.00019184014,0.0001993001,0.0028258322,0.00017070251,0.00003466368],"category_scores_gemma":[0.00008079486,0.0002988788,0.00011293116,0.0005091049,0.0012176386,0.00041643556,0.0009728396,0.000387844,0.00004145685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001548532,0.00009151516,0.000020630012,0.00004929934,0.000025148462,0.00023040512,0.0007530659,0.024294844,0.0061490457,0.45389462,0.00006191421,0.5144141],"study_design_scores_gemma":[0.0006560546,0.0007097123,0.0010093275,0.0014164117,0.000011018453,0.00008183011,5.4089395e-7,0.37209633,0.019216776,0.60300744,0.0006940983,0.0011004779],"about_ca_topic_score_codex":0.000027513177,"about_ca_topic_score_gemma":0.00002762804,"teacher_disagreement_score":0.6829807,"about_ca_system_score_codex":0.00015060385,"about_ca_system_score_gemma":0.0003513693,"threshold_uncertainty_score":0.99994636},"labels":[],"label_agreement":null},{"id":"W2439381154","doi":"10.1142/s0129054112400436","title":"ABELIAN PRIMITIVE WORDS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Abelian group; Rank of an abelian group; Arithmetic of abelian varieties; Combinatorics on words; Mathematics; Word (group theory); Elementary abelian group; Context (archaeology); Free abelian group; Alphabet; Set (abstract data type); Combinatorics; Discrete mathematics; Computer science; Biology; Linguistics; Philosophy","score_opus":0.016539528795581793,"score_gpt":0.30270130491401165,"score_spread":0.28616177611842986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2439381154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10858277,0.00008074846,0.8849778,0.0011722338,0.004253777,0.00003521361,0.000001645131,0.000018185274,0.0008775801],"genre_scores_gemma":[0.7786738,0.000012215771,0.22070257,0.00021323597,0.0003808136,5.829589e-7,4.2353668e-7,0.000002544067,0.000013804771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981197,0.000038316717,0.00046659078,0.00013183153,0.0010280652,0.00021546765],"domain_scores_gemma":[0.9976429,0.00016121387,0.0005284103,0.0002708819,0.0012547742,0.00014181995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014064132,0.000086596316,0.00013762046,0.00060855976,0.0000968128,0.0002588137,0.0031105597,0.000021116755,0.000023009652],"category_scores_gemma":[0.00011387066,0.00007329657,0.00009728703,0.00061194436,0.00031786188,0.0040159714,0.00042232728,0.00011088217,0.00001850279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001191786,0.00042776,0.0043394505,0.000004155026,0.00009039682,0.000010580873,0.003320895,0.00057411764,0.0082048485,0.5957612,0.0005460433,0.38670862],"study_design_scores_gemma":[0.003720166,0.0012191354,0.47637102,0.000871162,0.000072644434,0.003852742,0.0004473518,0.2486142,0.12062598,0.1010597,0.041744605,0.0014012802],"about_ca_topic_score_codex":0.000004689574,"about_ca_topic_score_gemma":3.3804216e-7,"teacher_disagreement_score":0.67009103,"about_ca_system_score_codex":0.00010535192,"about_ca_system_score_gemma":0.00032756987,"threshold_uncertainty_score":0.5780245},"labels":[],"label_agreement":null},{"id":"W2460573387","doi":"","title":"Boolean grammars: expressive power and parsing algorithms","year":2005,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Indexed grammar; Phrase structure grammar; Context-sensitive grammar; Tree-adjoining grammar; Definite clause grammar; Computer science; L-attributed grammar; Context-free grammar; Deterministic context-free grammar; Programming language; Embedded pushdown automaton; Boolean expression; Parsing expression grammar; Theoretical computer science; Algorithm; Parsing","score_opus":0.007330642977168579,"score_gpt":0.2218708008210055,"score_spread":0.21454015784383693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460573387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040398974,0.0006207222,0.9425895,0.0019132412,0.00018410296,0.000088954854,0.0000010015146,0.00039832416,0.013805173],"genre_scores_gemma":[0.70840514,0.000017090277,0.28907105,0.0016054735,0.000084959174,0.0000034553302,5.713418e-7,0.0000070771307,0.00080519385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999297,0.000023398135,0.00010677696,0.00025068628,0.00011777698,0.00020432354],"domain_scores_gemma":[0.9995276,0.00005285256,0.000031231833,0.00028786404,0.000017880478,0.00008262375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013922578,0.000088617366,0.00008549747,0.00004100369,0.0000787232,0.0001775646,0.00030467412,0.000032299795,0.000059205944],"category_scores_gemma":[0.000009447487,0.000071025104,0.000026245121,0.000080676444,0.000038397946,0.00057488773,0.0001915194,0.000059975937,0.000041646923],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019672466,0.000048008475,0.000105444466,0.0000030484773,0.000011187388,0.00001817083,0.0015228045,0.000012319893,0.0025945592,0.25485027,0.0046125823,0.73621964],"study_design_scores_gemma":[0.0019327438,0.00029730418,0.0050010723,0.0001483641,0.000016926653,0.0004894092,0.0012409431,0.61530954,0.04810466,0.115416706,0.21053931,0.0015030348],"about_ca_topic_score_codex":0.00000955288,"about_ca_topic_score_gemma":0.0000016623655,"teacher_disagreement_score":0.7347166,"about_ca_system_score_codex":0.000012055588,"about_ca_system_score_gemma":0.000009922872,"threshold_uncertainty_score":0.28963196},"labels":[],"label_agreement":null},{"id":"W2478264020","doi":"10.5485/tmcs.2015.0381","title":"The far side of recursion","year":2015,"lang":"en","type":"article","venue":"Teaching Mathematics and Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Recursion (computer science); Far side of the Moon; Mathematics; Computer science; Geology; Algorithm; Geophysics","score_opus":0.02293979355512128,"score_gpt":0.2572593223697552,"score_spread":0.23431952881463392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478264020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08783166,0.00016871732,0.90909976,0.00042410672,0.00030475526,0.00006765345,2.525164e-7,0.00007847345,0.0020245973],"genre_scores_gemma":[0.59493876,0.000011430274,0.40486163,0.0001124877,0.00003138008,0.0000016279587,6.525333e-8,0.0000034888812,0.000039111674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885535,0.000040412382,0.00021626225,0.00023551726,0.0004340591,0.00021841975],"domain_scores_gemma":[0.9988272,0.00024632135,0.00013331098,0.00059634505,0.000080273756,0.00011654498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003508371,0.00009006111,0.00012298186,0.000064510816,0.00041218463,0.0003564355,0.0014725077,0.000017956872,2.3411202e-7],"category_scores_gemma":[0.00011978191,0.00005456163,0.000025527595,0.00023360136,0.00031674717,0.00040813268,0.0008090127,0.000114057984,0.0000046606715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.696505e-7,0.000028182945,0.000012570874,0.000008277688,0.0000018363044,9.796225e-7,0.0033536444,0.000024729936,0.00034793623,0.81432414,0.00014611192,0.18175115],"study_design_scores_gemma":[0.000096358606,0.00008272155,0.00012029608,0.00004257665,0.0000017557356,0.000039893624,0.00013146675,0.7897412,0.00071876217,0.2076208,0.0013152488,0.0000889224],"about_ca_topic_score_codex":0.000010330403,"about_ca_topic_score_gemma":6.84533e-7,"teacher_disagreement_score":0.7897165,"about_ca_system_score_codex":0.000017959273,"about_ca_system_score_gemma":0.00007968702,"threshold_uncertainty_score":0.34371158},"labels":[],"label_agreement":null},{"id":"W2482750740","doi":"10.1007/978-3-319-41114-9_15","title":"State Complexity of Prefix Distance of Subregular Languages","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Prefix; Upper and lower bounds; Regular language; Deterministic finite automaton; Neighbourhood (mathematics); Finite-state machine; Combinatorics; Alphabet; Mathematics; Nondeterministic finite automaton; Discrete mathematics; Automaton; Computer science; Algorithm; Theoretical computer science; Automata theory","score_opus":0.01602923877316603,"score_gpt":0.24238024157622856,"score_spread":0.22635100280306253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482750740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009873364,0.0009445786,0.9941569,0.00026489721,0.000475457,0.0002248113,0.0000583647,0.00008977809,0.0027978607],"genre_scores_gemma":[0.7809751,0.00006457307,0.21796447,0.0002388914,0.00013463455,0.0000037373939,0.000003629371,0.000031415515,0.0005835312],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997036,0.00004601701,0.0006247326,0.00096110196,0.0008690956,0.00046310193],"domain_scores_gemma":[0.99697506,0.00042980094,0.0005919149,0.0016568908,0.00024365644,0.00010265513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008081348,0.00038583865,0.00068319787,0.00043853393,0.000076092045,0.00008327562,0.0034493662,0.00015144087,0.00002771293],"category_scores_gemma":[0.00005711915,0.0002925991,0.00014943734,0.0003706509,0.0022492579,0.00042133228,0.0011683266,0.00027801775,0.000009301296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013278437,0.0000443601,0.00012025666,0.00017249028,0.000020682333,0.000038711325,0.00089499564,0.000999706,0.0027075675,0.4087225,0.00001331431,0.58625215],"study_design_scores_gemma":[0.00035940052,0.00019608233,0.00071878877,0.00123584,0.000007835454,0.000027825528,3.502862e-7,0.04810199,0.038274202,0.9099761,0.0005032877,0.0005982772],"about_ca_topic_score_codex":0.000021395103,"about_ca_topic_score_gemma":0.000039502007,"teacher_disagreement_score":0.7799878,"about_ca_system_score_codex":0.00010296996,"about_ca_system_score_gemma":0.0002678898,"threshold_uncertainty_score":0.9999526},"labels":[],"label_agreement":null},{"id":"W2486550492","doi":"10.1090/cbms/101/09","title":"Integration on ℋ_{𝓅}×ℋ","year":2003,"lang":"en","type":"book-chapter","venue":"Regional conference series in mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.052780865652129964,"score_gpt":0.2525236068841242,"score_spread":0.1997427412319942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486550492","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056921297,0.00014625338,0.105917394,0.0019583616,0.00037685686,0.00033264072,0.000010359807,0.00018259099,0.8910186],"genre_scores_gemma":[0.006138112,0.0013125032,0.13134795,0.0024184582,0.00020281418,0.00006215764,0.00007950662,0.00012448209,0.85831404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983054,0.000030656858,0.00047787974,0.00045366777,0.0004928988,0.00023952393],"domain_scores_gemma":[0.9984283,0.00020841043,0.0003047521,0.00085930835,0.00013200879,0.00006722081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030827944,0.00039940645,0.00045574733,0.00022661003,0.00006725586,0.00017845267,0.0009333285,0.00030749934,0.000190407],"category_scores_gemma":[0.000060226103,0.00035003352,0.00011864104,0.00006798263,0.00017108138,0.00033103424,0.00013431188,0.00047118615,0.00022066939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041422127,0.00003171698,1.5124658e-7,0.00005772073,0.000011671785,0.000024597148,0.0005171946,0.000003915205,0.000029949475,0.991356,0.0022639611,0.0056989407],"study_design_scores_gemma":[0.00010293019,0.00010256422,0.000002965599,0.0010028504,0.00000646329,0.00007086991,0.00007317109,0.0022016268,0.00017987657,0.9420044,0.05387718,0.00037511482],"about_ca_topic_score_codex":0.0000014534575,"about_ca_topic_score_gemma":0.000013450498,"teacher_disagreement_score":0.05161322,"about_ca_system_score_codex":0.00010684888,"about_ca_system_score_gemma":0.00013980284,"threshold_uncertainty_score":0.99989516},"labels":[],"label_agreement":null},{"id":"W2491692501","doi":"10.1090/chel/346/14","title":"Table of knots and links","year":2003,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Table (database); Computer science; Database","score_opus":0.011795954336634861,"score_gpt":0.222302871429485,"score_spread":0.21050691709285013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491692501","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016210365,0.00029814715,0.13731238,0.00027420727,0.00006397789,0.00027704384,0.0000147410765,0.00017518169,0.86142224],"genre_scores_gemma":[0.0058429833,0.00023252443,0.43002278,0.0053004785,0.00013893654,0.000035090135,0.000005999142,0.0001604277,0.5582608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983985,0.000022334632,0.0004447535,0.0004697066,0.00035932698,0.00030539226],"domain_scores_gemma":[0.99828166,0.0003485143,0.0004118444,0.0007358562,0.00006568033,0.00015645321],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003155142,0.0003353876,0.0007590674,0.00003073232,0.00008059964,0.000066530236,0.0005713738,0.00028130418,0.00008296036],"category_scores_gemma":[0.000023676595,0.0002874404,0.00030043404,0.000036439407,0.00094917667,0.000055553337,0.0003442753,0.00049478613,0.000039338753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.365605e-7,0.000016337723,8.453976e-7,0.00013881721,0.00008902848,0.0000032142746,0.0006301681,1.8129927e-7,0.00009931999,0.97067654,0.0026165002,0.02572822],"study_design_scores_gemma":[0.0001732751,0.00015094999,0.0000030137594,0.00027520268,0.000063449086,0.000038206614,0.00009351722,0.002601728,0.00033165276,0.9380966,0.05768272,0.00048968324],"about_ca_topic_score_codex":0.000006455897,"about_ca_topic_score_gemma":2.7160664e-7,"teacher_disagreement_score":0.30316144,"about_ca_system_score_codex":0.00002508243,"about_ca_system_score_gemma":0.00006461992,"threshold_uncertainty_score":0.9999578},"labels":[],"label_agreement":null},{"id":"W2491771107","doi":"10.1017/cbo9780511546884.003","title":"Algorithms and Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Sociology","score_opus":0.02354278881369802,"score_gpt":0.20245350631542028,"score_spread":0.17891071750172227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491771107","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004597948,0.00038037394,0.04359888,0.000012676941,0.000265989,0.00017387845,0.00004551832,0.00030805354,0.95516866],"genre_scores_gemma":[0.00024814424,0.00016092198,0.0035379983,0.00016151354,0.000065786175,1.7709718e-7,0.0000091489355,0.000024871928,0.99579144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986924,0.000020682915,0.00014190213,0.00060867163,0.00024753355,0.0002887893],"domain_scores_gemma":[0.99878937,0.00008565195,0.0001446419,0.0007032854,0.00007775328,0.00019930997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017724252,0.00031325757,0.00029919398,0.0002646656,0.00017628056,0.00010047001,0.00096525485,0.00029819086,0.0000016459471],"category_scores_gemma":[0.000002876868,0.00035557494,0.00013604863,0.000011975043,0.00023744865,0.0001781729,0.000889823,0.00034937146,0.000010518812],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007164655,0.000003675079,5.3147136e-7,0.000023584425,0.000048488582,0.000443259,0.00003802913,1.3657501e-7,0.000011702732,0.963194,0.0057205735,0.030508848],"study_design_scores_gemma":[0.00037586,0.000047871887,0.000023745642,0.000100802434,0.00005443781,0.00007725175,0.000011505284,0.00097586034,0.00018779788,0.0007335205,0.9968938,0.00051754527],"about_ca_topic_score_codex":0.000053121326,"about_ca_topic_score_gemma":7.136886e-7,"teacher_disagreement_score":0.9911732,"about_ca_system_score_codex":0.00005955035,"about_ca_system_score_gemma":0.000044852724,"threshold_uncertainty_score":0.9998896},"labels":[],"label_agreement":null},{"id":"W2494060019","doi":"10.1002/9781119105664.oth1","title":"Problem Set 1","year":2015,"lang":"en","type":"other","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Citation; Syntax; Set (abstract data type); Library science; Linguistics; Computer science; Information retrieval; Natural language processing; Programming language; Philosophy","score_opus":0.018110248526803412,"score_gpt":0.24224630515230583,"score_spread":0.22413605662550243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494060019","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.961588e-8,0.0003661132,0.05470099,0.00014453131,0.00024908505,0.00008266431,0.000008302677,0.001146602,0.9433016],"genre_scores_gemma":[0.000006522452,0.000008964945,0.055691533,0.0003563264,0.00013814757,0.000005207642,0.000011444899,0.00008718684,0.94369465],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937516,0.000019700037,0.00006891423,0.00023893695,0.0001571317,0.00014017399],"domain_scores_gemma":[0.99931574,0.0000080358495,0.000051033316,0.00054792996,0.000012630288,0.000064649146],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013126753,0.00011692596,0.00012619961,0.00008434494,0.000008744735,0.000066481814,0.00081764563,0.00010624018,0.0017157164],"category_scores_gemma":[0.0000029431103,0.00008595207,0.000024321362,0.00011944227,0.000014954203,0.000052784802,0.0002297816,0.0000636053,0.00209609],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.742871e-8,0.0000049272094,4.918076e-7,0.0000075561306,0.0000054046163,0.000004759943,0.000031378593,1.0066213e-7,0.000001223691,0.07472366,0.9189052,0.0063152523],"study_design_scores_gemma":[0.00005808733,0.000010863471,3.6866547e-7,0.000030075438,0.0000014141419,0.000006595736,0.000003928519,0.0005097322,0.0000072877924,0.01333955,0.9858982,0.00013388164],"about_ca_topic_score_codex":0.00006520252,"about_ca_topic_score_gemma":0.00002217863,"teacher_disagreement_score":0.066993035,"about_ca_system_score_codex":0.00001038913,"about_ca_system_score_gemma":0.000058292302,"threshold_uncertainty_score":0.9991968},"labels":[],"label_agreement":null},{"id":"W2495464377","doi":"10.5802/aif.2235","title":"Kolam indiens, dessins sur le sable aux îles Vanuatu, courbe de Sierpinski et morphismes de monoïde","year":2006,"lang":"fr","type":"article","venue":"Annales de l’institut Fourier","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Sequence (biology); Humanities; Sierpinski triangle; Combinatorics; Art; Fractal; Mathematical analysis","score_opus":0.03006068674506317,"score_gpt":0.25844794490440015,"score_spread":0.22838725815933697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495464377","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7544706,0.034543097,0.17003235,0.022433897,0.0016515639,0.00044074867,0.0001624257,0.000554034,0.015711302],"genre_scores_gemma":[0.8914621,0.0021036258,0.077828325,0.0062713767,0.0011283333,0.00006452372,0.00006815566,0.0001037515,0.020969851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951534,0.0004995901,0.0007128187,0.00096628844,0.00058104325,0.0020868273],"domain_scores_gemma":[0.9973066,0.0003771883,0.00034819279,0.0011652331,0.00026675925,0.000536029],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017724084,0.0006899454,0.00064939196,0.00028951126,0.0008955178,0.001059596,0.0015954509,0.0005461589,0.00013859218],"category_scores_gemma":[0.00026640878,0.0007572866,0.0003888369,0.0007062423,0.0009292689,0.0023605428,0.0005267806,0.0007822665,0.00030257116],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000640389,0.0014725528,0.015485321,0.00026120656,0.0002164976,0.0021328062,0.0053230803,0.019799387,0.002737901,0.7227311,0.194863,0.03491308],"study_design_scores_gemma":[0.0014564994,0.00016075931,0.029152222,0.0006715427,0.00012780043,0.0009899491,0.00031127082,0.18115166,0.0067678294,0.08069776,0.69726723,0.0012454949],"about_ca_topic_score_codex":0.0077995127,"about_ca_topic_score_gemma":0.0024526208,"teacher_disagreement_score":0.64203334,"about_ca_system_score_codex":0.00044110802,"about_ca_system_score_gemma":0.004821496,"threshold_uncertainty_score":0.9999774},"labels":[],"label_agreement":null},{"id":"W2497478234","doi":"10.1007/978-1-4939-3264-1_2","title":"Solution by Radicals of the Cubic: From Equations to Groups and from Real to Complex Numbers","year":2015,"lang":"en","type":"book-chapter","venue":"Compact textbooks in mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Radical; Pure mathematics; Mathematics; Chemistry; Organic chemistry","score_opus":0.06677806057408893,"score_gpt":0.2895536565764837,"score_spread":0.22277559600239477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497478234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015085504,0.0008653435,0.7134267,0.0022150765,0.00079815043,0.0022878223,0.0020047273,0.00033140814,0.26298526],"genre_scores_gemma":[0.6933533,0.00012763808,0.2257355,0.0025024305,0.0006490996,0.000068120324,0.0004445175,0.0003466081,0.076772794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778974,0.000073833144,0.00074445363,0.00047707,0.0006318009,0.00028309834],"domain_scores_gemma":[0.9969746,0.00095284457,0.00039948768,0.0013302263,0.000083514315,0.00025934065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050953514,0.00037514963,0.0007348999,0.0001489647,0.00010354354,0.00012506633,0.0015065519,0.00021984137,0.000113551636],"category_scores_gemma":[0.00013789457,0.0002996484,0.000119498785,0.00008628647,0.00016885965,0.0001153069,0.0006941526,0.00030096166,0.00009461469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011663666,0.0001252349,0.00003747253,0.000060557526,0.00010756565,0.000004843726,0.010162166,0.00009613712,0.003433587,0.9012948,0.0777093,0.006956626],"study_design_scores_gemma":[0.00040162963,0.00006977994,0.00030673965,0.00097302825,0.00005608745,0.0000037232417,0.00012046688,0.035364326,0.00021246487,0.9488495,0.013121326,0.00052093185],"about_ca_topic_score_codex":0.00057454867,"about_ca_topic_score_gemma":0.00014189476,"teacher_disagreement_score":0.6782678,"about_ca_system_score_codex":0.00018382253,"about_ca_system_score_gemma":0.000096361255,"threshold_uncertainty_score":0.9999456},"labels":[],"label_agreement":null},{"id":"W2502558882","doi":"10.1017/cbo9780511760860.012","title":"Codes and formal series","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Series (stratigraphy); Computer science; Content (measure theory); Information retrieval; Theoretical computer science; Mathematics; Geology","score_opus":0.011116549833925647,"score_gpt":0.17264100536049434,"score_spread":0.1615244555265687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502558882","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003141484,0.00012378956,0.013252513,0.0000315059,0.00027822488,0.00015600625,0.0000898038,0.00028216315,0.98547184],"genre_scores_gemma":[0.0013861771,0.00009368598,0.0028522962,0.0000844815,0.00008150242,3.043307e-7,0.00001155483,0.000018925417,0.99547106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990158,0.000016701471,0.00011087554,0.0004316481,0.00016714692,0.00025782263],"domain_scores_gemma":[0.9989912,0.00005181899,0.00012742607,0.0006186656,0.000068340756,0.00014257613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011337699,0.00026994344,0.00027345782,0.00011302483,0.00026952298,0.00014060897,0.0008713325,0.00030904752,0.00000218812],"category_scores_gemma":[0.0000037374477,0.0002932851,0.00009273772,0.000005026886,0.0003171976,0.0004993149,0.0011866163,0.0004297005,0.0000075658204],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014169855,0.0000023905707,5.9473933e-7,0.00003291263,0.000032301028,0.00014907951,0.00006446821,8.526743e-8,0.0001915627,0.9924449,0.0019560356,0.005111536],"study_design_scores_gemma":[0.00025880666,0.00005047095,0.000020233401,0.00006437352,0.000040558058,0.00011467813,0.000014648457,0.00021746357,0.0015046275,0.000465378,0.99684685,0.00040191715],"about_ca_topic_score_codex":0.00003328479,"about_ca_topic_score_gemma":0.0000029728958,"teacher_disagreement_score":0.9948908,"about_ca_system_score_codex":0.000028713885,"about_ca_system_score_gemma":0.000056016153,"threshold_uncertainty_score":0.9999519},"labels":[],"label_agreement":null},{"id":"W250939016","doi":"10.1007/978-3-540-70918-3_43","title":"Languages with Bounded Multiparty Communication Complexity","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; McGill University","funders":"","keywords":"Bounded function; Computer science; Theoretical computer science; Communication complexity; Mathematics","score_opus":0.017780105756289227,"score_gpt":0.279311783082664,"score_spread":0.2615316773263748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W250939016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15106331,0.0001370367,0.8474748,0.00069611665,0.00014867622,0.00013675247,6.077334e-7,0.00020829233,0.00013439807],"genre_scores_gemma":[0.5622696,0.0000018333942,0.43693405,0.00075420516,0.00003272709,0.0000018979046,0.0000011658324,0.0000039374067,5.5162155e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812186,0.00007249987,0.0002321256,0.0005645569,0.00047756132,0.00053140847],"domain_scores_gemma":[0.9978998,0.0005193381,0.000103061015,0.0012553299,0.0001087393,0.00011375952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018115182,0.00017380557,0.00017767845,0.00025742745,0.00033228262,0.0003853319,0.00243359,0.00005509874,0.000005831944],"category_scores_gemma":[0.000069567446,0.00013205392,0.000029874147,0.001647157,0.00080351194,0.0007752495,0.00064611045,0.0002634886,0.000013001382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002534344,0.0001953455,0.01071644,0.000017710916,0.0000065622867,0.00007741556,0.005183035,0.006637329,0.0033935118,0.045161225,0.000013539667,0.92857254],"study_design_scores_gemma":[0.0007079377,0.00016646684,0.07150941,0.00010609377,0.0000026615958,0.00012996218,0.000010226775,0.81409734,0.041165724,0.071471475,0.00015303803,0.00047967964],"about_ca_topic_score_codex":0.00015223103,"about_ca_topic_score_gemma":0.00058438146,"teacher_disagreement_score":0.92809284,"about_ca_system_score_codex":0.00010767674,"about_ca_system_score_gemma":0.000106106934,"threshold_uncertainty_score":0.53850025},"labels":[],"label_agreement":null},{"id":"W2511042131","doi":"10.1007/s00233-017-9867-4","title":"The Frobenius problem for the shuffle operation","year":2017,"lang":"en","type":"preprint","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Iterated function; Word (group theory); Computer science; Finite set; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science; Geometry","score_opus":0.017830932465054645,"score_gpt":0.2706545985434372,"score_spread":0.2528236660783826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511042131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006314423,0.0076011973,0.93650395,0.04189863,0.005279009,0.002920241,0.000079891666,0.00049274846,0.0045928713],"genre_scores_gemma":[0.8917719,0.0026637253,0.068896644,0.004626201,0.0031403683,0.0054277014,0.00024388386,0.00022933251,0.023000205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997604,0.000094721785,0.00042899576,0.00077503145,0.00039244987,0.0007047946],"domain_scores_gemma":[0.9951141,0.00078220275,0.00046904516,0.0034127452,0.00014166292,0.00008026767],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016739061,0.00038438285,0.00030798526,0.000043187414,0.0027726435,0.002895399,0.006255797,0.0002880747,0.0000076885635],"category_scores_gemma":[0.00013363203,0.00020717316,0.00034997432,0.000058774007,0.00018029098,0.00040985006,0.0033578877,0.00060882384,0.000056250134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025811423,0.000050004306,0.00007439091,0.00008675485,0.00017239511,0.0000033809645,0.0010222615,0.0012935605,0.00029072713,0.63694715,0.12716429,0.23286927],"study_design_scores_gemma":[0.00037541403,0.000075859985,0.00023711626,0.0001423607,0.000045511104,0.000014272679,0.00020337272,0.32129797,0.00104286,0.33408508,0.34200037,0.00047981486],"about_ca_topic_score_codex":0.00020762782,"about_ca_topic_score_gemma":0.00034109902,"teacher_disagreement_score":0.8911405,"about_ca_system_score_codex":0.000087619395,"about_ca_system_score_gemma":0.00022434315,"threshold_uncertainty_score":0.99912083},"labels":[],"label_agreement":null},{"id":"W2512194986","doi":"10.1007/978-3-540-28629-5_56","title":"Decidability of Trajectory-Based Equations","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Catenation; Decidability; Constructive; Computer science; Trajectory; Quotient; Integer (computer science); Algebra over a field; Discrete mathematics; Algorithm; Mathematics; Programming language; Pure mathematics","score_opus":0.01825032286877343,"score_gpt":0.2449511614274609,"score_spread":0.22670083855868747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512194986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025610864,0.00024323257,0.9960556,0.0003445507,0.0008556652,0.00033462574,0.00001010112,0.00015639227,0.001743705],"genre_scores_gemma":[0.608978,0.000003878409,0.3903105,0.0005534479,0.00010264656,0.000006502706,0.000003474524,0.000017122866,0.000024474566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680763,0.000039465074,0.0005936624,0.0011755025,0.00091921847,0.0004645191],"domain_scores_gemma":[0.9964764,0.0010648617,0.00033225096,0.0017471702,0.00024389455,0.00013538849],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011047038,0.00039574786,0.0005086022,0.00069180457,0.00015370338,0.000185091,0.0032186124,0.00026204617,0.00006235359],"category_scores_gemma":[0.00019171242,0.00035968272,0.00019562177,0.0006778736,0.00096433377,0.00037345532,0.0005400831,0.0004875023,0.00002093407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067098863,0.00011429935,0.000078441444,0.00009607428,0.000011122023,0.000032460553,0.00057217287,0.20471542,0.00063183723,0.3271617,0.0000034903585,0.46657628],"study_design_scores_gemma":[0.00028144897,0.00014026252,0.00023741326,0.00032943976,0.0000063617704,0.0000058146275,7.1719604e-8,0.44914466,0.0059079495,0.54347944,0.00007263776,0.00039449616],"about_ca_topic_score_codex":0.00003393004,"about_ca_topic_score_gemma":0.00004426591,"teacher_disagreement_score":0.60872185,"about_ca_system_score_codex":0.00036977488,"about_ca_system_score_gemma":0.001549125,"threshold_uncertainty_score":0.9998855},"labels":[],"label_agreement":null},{"id":"W2515301419","doi":"10.1017/cbo9781139195768.011","title":"Synchronization","year":2009,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Synchronization (alternating current); Computer science; Parsing; Automaton; Theoretical computer science; Programming language; Computer network; Channel (broadcasting)","score_opus":0.012404575036208012,"score_gpt":0.1789077074443026,"score_spread":0.16650313240809458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515301419","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000049422265,0.00014898909,0.10946016,0.000028783343,0.00020269558,0.00016652494,0.000024161467,0.000427616,0.88953614],"genre_scores_gemma":[0.00077860494,0.000073116746,0.0012504192,0.0001831856,0.00010938846,1.4765016e-7,0.000025113039,0.000020773316,0.99755925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988325,0.000027209613,0.00013718975,0.0005275233,0.00024442698,0.00023114885],"domain_scores_gemma":[0.9987189,0.00003965856,0.00017519022,0.0008438695,0.00010090761,0.00012146065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008523016,0.00028272189,0.0002624145,0.00016377498,0.00015821794,0.00010800694,0.001280064,0.00027082744,0.0000032184205],"category_scores_gemma":[0.0000040377067,0.000334881,0.00014502314,0.000011159368,0.00008542857,0.00022534895,0.00045711527,0.00026668436,0.00004008852],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004657975,0.000004666376,9.2758675e-8,0.000015757409,0.000026705176,0.00019161541,0.000020292016,0.0000040548753,0.000012010402,0.9334163,0.01929643,0.04700742],"study_design_scores_gemma":[0.00025286622,0.000046736797,0.0000066057773,0.000116413146,0.000044008375,0.000025635089,0.0000028167326,0.0035245577,0.00016033069,0.00034050064,0.9950607,0.0004188709],"about_ca_topic_score_codex":0.000016074124,"about_ca_topic_score_gemma":2.6129356e-7,"teacher_disagreement_score":0.9757642,"about_ca_system_score_codex":0.00016944141,"about_ca_system_score_gemma":0.00009423676,"threshold_uncertainty_score":0.9999103},"labels":[],"label_agreement":null},{"id":"W2517333950","doi":"10.1017/etds.2014.5","title":"Suffix conjugates for a class of morphic subshifts","year":2014,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Bijection; Closure (psychology); Class (philosophy); Morphism; Fixed point; Set (abstract data type); Suffix; Alphabet; Finite set","score_opus":0.005779104364594204,"score_gpt":0.21056211858217272,"score_spread":0.20478301421757852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517333950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36196423,0.00059008086,0.6359499,0.000117939584,0.0004540032,0.00023420769,0.000012885961,0.00011930242,0.0005574457],"genre_scores_gemma":[0.99880445,0.000008481015,0.0006710394,0.00010976319,0.00009583284,0.000037148522,0.000004789989,0.000011242599,0.0002572276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984869,0.00043294227,0.00033193725,0.0003357838,0.00015020039,0.00026224853],"domain_scores_gemma":[0.9976632,0.0016187888,0.00013450078,0.00041516632,0.000048461185,0.00011988842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020815462,0.00015060404,0.00034156372,0.00006330011,0.000099123514,0.00008629853,0.0004694294,0.00010974666,0.0000055477863],"category_scores_gemma":[0.00020421116,0.0001161582,0.000084265674,0.00011407343,0.00018074679,0.00016427577,0.0001173897,0.000085025255,0.000007683618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051787498,0.000036759302,0.00015178598,0.00012754227,0.000019252711,0.0000010472606,0.00019031935,0.00007246562,0.0014101942,0.9953332,0.00006252262,0.0025430992],"study_design_scores_gemma":[0.0008690196,0.0003215802,0.0008022166,0.00015666582,0.000019385017,0.000040147694,0.00012911472,0.6327023,0.0003945135,0.3618794,0.0024130787,0.00027254137],"about_ca_topic_score_codex":0.000017480366,"about_ca_topic_score_gemma":0.0000022226313,"teacher_disagreement_score":0.6368402,"about_ca_system_score_codex":0.000013152649,"about_ca_system_score_gemma":0.000019013161,"threshold_uncertainty_score":0.47367936},"labels":[],"label_agreement":null},{"id":"W2520022270","doi":"10.37236/6450","title":"Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups?","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research","keywords":"Unary operation; Mathematics; Combinatorics; Identity (music); Multiplicative function; Upper and lower bounds; Inverse; Identity function; Function (biology); Discrete mathematics; Constant (computer programming); Mathematical analysis; Geometry","score_opus":0.011733497705416334,"score_gpt":0.2718810865264232,"score_spread":0.26014758882100686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520022270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93368113,0.001701704,0.055774108,0.0028175933,0.0012602806,0.00012748902,5.6839843e-7,0.00002962652,0.0046075103],"genre_scores_gemma":[0.9988751,0.0006010682,0.00000878193,0.00012431435,0.00010188693,0.0000032807975,3.4789696e-7,0.000009414099,0.0002758255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984885,0.00011335859,0.00039451252,0.000114836424,0.0004994038,0.0003893736],"domain_scores_gemma":[0.998707,0.00010001332,0.00041986647,0.00061748613,0.00011184648,0.000043805678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016589493,0.00014397969,0.00022707587,0.00012173207,0.0003995012,0.00053841446,0.0018727637,0.000067814966,0.000007685495],"category_scores_gemma":[0.000045736368,0.00009938624,0.00011852869,0.00017430971,0.00006447924,0.0014398092,0.000066445406,0.00061519665,0.000008866217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040620056,0.00011702746,0.00058928714,0.000007976542,0.00003240181,0.000029402028,0.001124314,0.00013901205,0.000056025052,0.9950564,0.00036098677,0.0024465497],"study_design_scores_gemma":[0.0008137249,0.00062344735,0.0107426355,0.00013780774,0.000018431248,0.0001723935,0.00038631307,0.0041410555,0.0013416848,0.9793035,0.0021141886,0.0002048169],"about_ca_topic_score_codex":0.00000537105,"about_ca_topic_score_gemma":0.000026368889,"teacher_disagreement_score":0.06519396,"about_ca_system_score_codex":0.0002955636,"about_ca_system_score_gemma":0.00019320015,"threshold_uncertainty_score":0.5191943},"labels":[],"label_agreement":null},{"id":"W2529230500","doi":"10.1007/978-3-319-53733-7_12","title":"Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Suffix; Concatenation (mathematics); Regular language; Computer science; Ideal (ethics); Generalized suffix tree; Mathematics; Discrete mathematics; Combinatorics; Suffix tree; Artificial intelligence; Linguistics; Automaton","score_opus":0.02190194143970756,"score_gpt":0.2560078981016194,"score_spread":0.23410595666191183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529230500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021819107,0.0021254763,0.9871908,0.0013026743,0.0009114717,0.0003882246,0.000037447848,0.00020395433,0.0056580394],"genre_scores_gemma":[0.60634625,0.00020161453,0.39092994,0.0010973321,0.0005327523,0.0000045558522,0.000014811522,0.00006502007,0.0008077387],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962675,0.00006100726,0.0005722363,0.0014820023,0.00097326626,0.0006439621],"domain_scores_gemma":[0.9947614,0.0005016034,0.00060884806,0.0037099782,0.00021593826,0.00020222263],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001313944,0.000570654,0.0008555377,0.0006147313,0.00039058013,0.0005947763,0.0065178527,0.00033544714,0.000031048654],"category_scores_gemma":[0.00024769944,0.00050673814,0.00014951719,0.0001595485,0.003275323,0.00066764234,0.003649879,0.00063240685,0.000011119372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019022196,0.000083490515,0.00029915158,0.00026514262,0.00004786411,0.00027262254,0.0022498781,0.00058871636,0.001597586,0.42127737,0.00025960372,0.57303953],"study_design_scores_gemma":[0.0007305991,0.0002930503,0.002626246,0.00083381264,0.000020192256,0.00020798626,0.0000012085817,0.1014488,0.0057294252,0.88552946,0.0015705773,0.001008616],"about_ca_topic_score_codex":0.00014662124,"about_ca_topic_score_gemma":0.00020953946,"teacher_disagreement_score":0.6041643,"about_ca_system_score_codex":0.0001013508,"about_ca_system_score_gemma":0.00033272678,"threshold_uncertainty_score":0.9997384},"labels":[],"label_agreement":null},{"id":"W2529588972","doi":"10.46298/dmtcs.1343","title":"Most Complex Regular Ideal Languages","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quotient; Ideal (ethics); Alphabet; Class (philosophy); Regular language; Quotient algebra","score_opus":0.012728167214424515,"score_gpt":0.2622929057545596,"score_spread":0.24956473854013508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529588972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011966905,0.00003414031,0.97537327,0.0031909703,0.00026233497,0.00020875767,0.000010109613,0.00051045994,0.008443068],"genre_scores_gemma":[0.6609452,0.000005231167,0.33824608,0.0006261061,0.00010708523,0.000009018168,0.0000012362293,0.000016684919,0.00004338699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965027,0.00010981678,0.00049972144,0.00090795563,0.0010914521,0.00088838494],"domain_scores_gemma":[0.99677205,0.0006594546,0.00016095462,0.0017966776,0.00022110107,0.00038974697],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018376582,0.00033480205,0.00038474207,0.00016066806,0.00044687313,0.00065624557,0.0041976045,0.0000744667,0.00020370615],"category_scores_gemma":[0.00025692527,0.0001975963,0.00011269162,0.0011160502,0.003118792,0.0008972873,0.0018949609,0.0001337157,0.00030244773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021942678,0.000054352233,0.00001623366,0.00001703557,0.0000078298945,0.00002417895,0.00047381196,0.0000029929624,0.010884319,0.9609605,0.00035942163,0.027197115],"study_design_scores_gemma":[0.000343012,0.00012898269,0.00033049178,0.00015220871,0.000008878539,0.00011113744,0.000059314152,0.29464623,0.0074527115,0.6959817,0.00034006996,0.00044527862],"about_ca_topic_score_codex":0.0000022684626,"about_ca_topic_score_gemma":4.0267813e-7,"teacher_disagreement_score":0.6489783,"about_ca_system_score_codex":0.00006179658,"about_ca_system_score_gemma":0.00011168773,"threshold_uncertainty_score":0.99959415},"labels":[],"label_agreement":null},{"id":"W2536714351","doi":"10.1007/978-3-319-53733-7_21","title":"On Finite-Index Indexed Grammars and Their Restrictions","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decidability; Rule-based machine translation; Bounded function; Indexed grammar; Discrete mathematics; Index (typography); Mathematics; Combinatorics; Computer science; Programming language; Artificial intelligence; Tree-adjoining grammar; Context-free grammar; Mathematical analysis","score_opus":0.016311217695042193,"score_gpt":0.2358414698239249,"score_spread":0.21953025212888272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536714351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025702198,0.00026842253,0.9918032,0.00072165136,0.0015961868,0.0002558293,0.000008629517,0.0001981918,0.0048908563],"genre_scores_gemma":[0.92965585,0.00018085825,0.065635175,0.00266213,0.00060445606,0.000017479997,0.000006741836,0.00006251789,0.0011748191],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970559,0.00003554532,0.00034394843,0.0014432201,0.0005530727,0.00056831684],"domain_scores_gemma":[0.9960681,0.001233857,0.00023121439,0.0021640481,0.00010943763,0.00019334181],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00070572377,0.000528409,0.0004666134,0.00083994935,0.00069572043,0.0010661191,0.003460665,0.0003443739,0.000009666829],"category_scores_gemma":[0.00021092885,0.00041822603,0.000111156856,0.00022890893,0.0009005777,0.0005617579,0.0014528296,0.0009074087,0.000026515047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075293756,0.00002921823,0.00009050225,0.000016760028,0.000013170019,0.00006267516,0.0005499565,0.0058669606,0.000040863433,0.17581035,0.000060768216,0.81745124],"study_design_scores_gemma":[0.00021405211,0.00015178944,0.00035163815,0.0002921814,0.0000029638854,0.00004977223,1.6561069e-7,0.3439276,0.00019910611,0.652916,0.0014319674,0.00046276723],"about_ca_topic_score_codex":0.00004071794,"about_ca_topic_score_gemma":0.000058139984,"teacher_disagreement_score":0.9293988,"about_ca_system_score_codex":0.00013519949,"about_ca_system_score_gemma":0.00031148808,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W2538425405","doi":"10.1016/j.tcs.2016.10.005","title":"Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Computer science; Algorithm; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.010856704063362848,"score_gpt":0.2600031196010287,"score_spread":0.24914641553766584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538425405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25564137,0.000057856465,0.74103403,0.0019474984,0.0005642484,0.0002914562,0.0000042891675,0.00030727184,0.00015196603],"genre_scores_gemma":[0.70545167,0.0000085707825,0.29422247,0.00022738561,0.000047792026,0.000018242075,3.057443e-7,0.0000068648033,0.000016699963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970653,0.00012070747,0.00045005817,0.0010824058,0.00061467517,0.0006668511],"domain_scores_gemma":[0.9962788,0.002145317,0.00010801571,0.0009751541,0.00017087563,0.00032181025],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0034588738,0.00023780469,0.00029581328,0.00017296747,0.00080322206,0.0003731142,0.002229097,0.000087925124,0.00005329264],"category_scores_gemma":[0.00050595624,0.00014008002,0.00008375671,0.0008144225,0.0033647043,0.0011754251,0.0015671849,0.00010789689,0.000028126371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004196002,0.00002700796,0.000028515286,0.000005511457,0.000002451501,0.0000022349689,0.00021412825,0.0000027963183,0.0007353862,0.55752325,0.00002766061,0.4414269],"study_design_scores_gemma":[0.00034579422,0.00026235438,0.0011647377,0.00009402276,0.0000036176239,0.000043916487,0.0000049452237,0.39519522,0.0018114137,0.6007797,0.00010222907,0.00019205178],"about_ca_topic_score_codex":0.0000021842043,"about_ca_topic_score_gemma":4.69813e-7,"teacher_disagreement_score":0.4498103,"about_ca_system_score_codex":0.00007997585,"about_ca_system_score_gemma":0.000119887874,"threshold_uncertainty_score":0.99934757},"labels":[],"label_agreement":null},{"id":"W2547353811","doi":"10.1007/978-3-319-46376-6_6","title":"Descriptional Complexity of Error Detection","year":2016,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Neighbourhood (mathematics); Prefix; Automaton; Regular language; Computer science; String (physics); Algorithm; Finite-state machine; Mathematics; Theoretical computer science; Discrete mathematics; Linguistics","score_opus":0.11137692888721303,"score_gpt":0.2852576581418257,"score_spread":0.17388072925461268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547353811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015851557,0.00044646428,0.92526054,0.00041218172,0.0011309478,0.00030996525,0.00009126368,0.00024805602,0.07051541],"genre_scores_gemma":[0.9416138,0.0001936885,0.037552122,0.00023176051,0.00043096291,0.000018656383,0.000116834075,0.000057782767,0.01978438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978812,0.00007403367,0.00064131705,0.00064408575,0.0005066363,0.000252759],"domain_scores_gemma":[0.99856913,0.000098290075,0.00054405833,0.00039794503,0.00026801418,0.00012254278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003346549,0.0003646792,0.00047384642,0.00027614392,0.00027693363,0.00006151011,0.00052876206,0.00021224296,0.0003580392],"category_scores_gemma":[0.000013978633,0.00033664098,0.0001787819,0.00010637507,0.00066115364,0.00043065145,0.00033719777,0.00022445605,0.00007624822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022727534,0.000028810247,0.000007944035,0.00006664838,0.000049746923,0.000002675952,0.00013009743,0.000030971412,0.00040550448,0.93000036,0.0003856903,0.06886881],"study_design_scores_gemma":[0.00028222392,0.00019573495,0.0016783511,0.0001643921,0.000024556099,0.000032330445,0.0000109090915,0.052188873,0.00020954822,0.9396611,0.0051387474,0.00041325975],"about_ca_topic_score_codex":0.000031003914,"about_ca_topic_score_gemma":0.0000541279,"teacher_disagreement_score":0.94002867,"about_ca_system_score_codex":0.000049788396,"about_ca_system_score_gemma":0.00006704622,"threshold_uncertainty_score":0.99990857},"labels":[],"label_agreement":null},{"id":"W2551783230","doi":"10.1142/s1793042118501099","title":"D-finite numbers","year":2018,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Class (philosophy); Algebraic number; Polynomial; Field (mathematics); Point (geometry); Constant (computer programming); Algebraic number field; Differential (mechanical device); Real number","score_opus":0.010393281732494403,"score_gpt":0.2805275340452899,"score_spread":0.27013425231279553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551783230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036993198,0.000078637546,0.86716056,0.001991722,0.0074810777,0.000042933534,0.000020199153,0.00009234257,0.08613931],"genre_scores_gemma":[0.9758934,0.000016065906,0.019468114,0.0020235467,0.0015463678,9.618014e-7,0.000001757477,0.000010759996,0.0010390325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870133,0.00012395777,0.00036747937,0.00013003315,0.00052489596,0.00015229749],"domain_scores_gemma":[0.998242,0.00048151947,0.0003421968,0.00022773253,0.00061644113,0.000090112364],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009175725,0.0001002706,0.00012918629,0.00012289578,0.000048198748,0.00016195189,0.0019406448,0.000042591837,0.0028860974],"category_scores_gemma":[0.00026932042,0.00008182613,0.00013976997,0.00013386979,0.00013222286,0.0007609762,0.00021209712,0.00015361654,0.0007338178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114331335,0.00012529058,0.0007778405,0.0000018489659,0.00025924796,0.00025717393,0.0013887996,0.000014188268,0.0006221747,0.8674732,0.029105842,0.099860094],"study_design_scores_gemma":[0.00087386346,0.00012737785,0.0014522689,0.00012777802,0.000013506406,0.0020175448,0.00018586924,0.0022317155,0.0042735073,0.8040722,0.18438159,0.00024279187],"about_ca_topic_score_codex":0.0000030397953,"about_ca_topic_score_gemma":9.045913e-7,"teacher_disagreement_score":0.9389002,"about_ca_system_score_codex":0.000056534183,"about_ca_system_score_gemma":0.000077583485,"threshold_uncertainty_score":0.9980254},"labels":[],"label_agreement":null},{"id":"W2559784680","doi":"10.4153/cmb-2016-093-7","title":"On Radicals of Green’s Relations in Ordered Semigroups","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Semigroup; Radical; Pure mathematics; Special classes of semigroups; Simple (philosophy); Chemistry; Epistemology; Organic chemistry","score_opus":0.007200642009731801,"score_gpt":0.19841702331749586,"score_spread":0.19121638130776406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559784680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29855165,0.00016940568,0.5107074,0.119323805,0.00024261103,0.00082363567,0.000070611284,0.0002754634,0.06983546],"genre_scores_gemma":[0.98854953,0.0000031135428,0.00734555,0.0009738799,0.000023518545,0.000021405243,9.524186e-7,0.000013279074,0.0030687905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987773,0.00008404788,0.00034757287,0.00025659273,0.00018801939,0.0003465156],"domain_scores_gemma":[0.9981693,0.00087752333,0.00006336448,0.00053667487,0.000027644628,0.0003254686],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00044856413,0.000118952,0.00022102718,0.00018625834,0.000042513762,0.000021732525,0.0005731697,0.00009702848,0.005721681],"category_scores_gemma":[0.0005743036,0.00008287253,0.000058996728,0.0002260499,0.00010108782,0.000054894066,0.00005043577,0.00009710731,0.0051524104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020515824,0.00004214202,0.000099067656,0.000015545844,0.0000050187946,0.000030569914,0.00018520559,0.0000032686855,0.00013527238,0.9816268,0.008378821,0.009476205],"study_design_scores_gemma":[0.00071992975,0.00008745761,0.0014743953,0.0005281521,0.0000047232606,0.000024616911,0.000031624182,0.0028772468,0.0004891462,0.9759743,0.017500529,0.00028783016],"about_ca_topic_score_codex":0.001066017,"about_ca_topic_score_gemma":0.0010926909,"teacher_disagreement_score":0.68999785,"about_ca_system_score_codex":0.00013469973,"about_ca_system_score_gemma":0.00013835855,"threshold_uncertainty_score":0.9956222},"labels":[],"label_agreement":null},{"id":"W2562450072","doi":"10.1515/puma-2015-0008","title":"Enumeration and Automatic Sequences","year":2015,"lang":"en","type":"article","venue":"Pure mathematics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Enumeration; Sequence (biology); Automaton; Finite-state machine; Generating function; State (computer science); Function (biology); Combinatorics; Computer science; Base (topology); Algorithm; Mathematics; Discrete mathematics; Theoretical computer science; Biology; Genetics","score_opus":0.02117350694330332,"score_gpt":0.25226926973511526,"score_spread":0.23109576279181193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562450072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028180502,0.00047631757,0.96727586,0.0013093036,0.000020597432,0.00024643147,0.0000025336765,0.0001650611,0.0023234189],"genre_scores_gemma":[0.7358912,0.000047286594,0.2634993,0.00018423589,0.00005490743,0.0002043514,0.0000038197136,0.00000694946,0.000107923595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995238,0.000009223972,0.00012994822,0.00014896154,0.00010274794,0.00008532339],"domain_scores_gemma":[0.9995144,0.00006597327,0.00005846551,0.00023840264,0.00003429433,0.00008845146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022797428,0.00006916848,0.00008703882,0.000032536307,0.00009950924,0.00019073866,0.0001700231,0.000026774866,0.0000025566549],"category_scores_gemma":[0.000018223715,0.000056064557,0.000010005927,0.00012328723,0.000043597243,0.00018181688,0.00008696841,0.000036037392,0.000019012077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.691079e-8,0.000027128319,0.00003927187,0.00003050499,0.0000040155646,2.877911e-7,0.0010902688,0.0000034560312,0.0002451861,0.95626587,0.00016199399,0.042131975],"study_design_scores_gemma":[0.00011074086,0.000018400196,0.00015695133,0.000017015409,0.000008222007,0.000050597297,0.00029430486,0.26049817,0.00030422545,0.73366743,0.004756748,0.00011720726],"about_ca_topic_score_codex":0.000002699068,"about_ca_topic_score_gemma":0.0000010577944,"teacher_disagreement_score":0.70771074,"about_ca_system_score_codex":0.000006910671,"about_ca_system_score_gemma":0.000020527687,"threshold_uncertainty_score":0.22862463},"labels":[],"label_agreement":null},{"id":"W2568552169","doi":"10.1016/j.ic.2012.10.008","title":"Generic expression hardness results for primitive positive formula comparison","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Trichotomy (philosophy); Equivalence (formal languages); Mathematics; Expression (computer science); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.02384311133039244,"score_gpt":0.2827658495853759,"score_spread":0.2589227382549834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568552169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06290281,0.00006486051,0.93473715,0.00019323212,0.0003672738,0.00029276256,0.000020069645,0.000125999,0.0012958642],"genre_scores_gemma":[0.950083,0.000004775802,0.04913126,0.0004777325,0.000055410666,0.00003066337,0.00019936879,0.0000030277772,0.000014773386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992089,0.00003563255,0.00032578473,0.00009568906,0.00014945051,0.00018454515],"domain_scores_gemma":[0.99933916,0.00012012589,0.00022751898,0.00010119575,0.00013380944,0.000078189165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033148567,0.000097824006,0.00011013795,0.000101719226,0.00018645795,0.00018285224,0.00012370147,0.00005080846,6.6998234e-7],"category_scores_gemma":[0.000037075773,0.000086387096,0.000031253465,0.0001306334,0.000017670725,0.0036477756,0.00007525578,0.000047089106,0.000018139248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001667506,0.0001237894,0.00035596036,0.00007804953,0.000021521057,1.8296485e-7,0.032856185,0.0021992316,0.0010486325,0.10823384,0.008015941,0.8468999],"study_design_scores_gemma":[0.0015173289,0.00012747459,0.024910795,0.0000508869,0.000008153359,0.000013042357,0.0008104132,0.9492148,0.012490517,0.0026795669,0.007928288,0.00024872457],"about_ca_topic_score_codex":0.0000038801563,"about_ca_topic_score_gemma":1.9738555e-7,"teacher_disagreement_score":0.9470156,"about_ca_system_score_codex":0.000030911437,"about_ca_system_score_gemma":0.000018007564,"threshold_uncertainty_score":0.35227636},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023064990121982428,"score_gpt":0.27846263967602103,"score_spread":0.2553976495540386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570053645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49919805,0.00020125868,0.4994515,0.00035860934,0.0006896254,0.00003195227,5.470461e-7,0.000008560097,0.000059892718],"genre_scores_gemma":[0.8366163,0.000020981548,0.16320205,0.000050346585,0.00010180278,8.2332326e-7,1.7810576e-7,0.0000016456322,0.000005912007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854124,0.000038560323,0.00048102043,0.00009677353,0.00071821833,0.00012417565],"domain_scores_gemma":[0.9981824,0.00009410113,0.0005497794,0.00016272537,0.0009412133,0.00006976682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012038834,0.000066949266,0.00013923288,0.00039985438,0.000079302954,0.00018822895,0.0012823776,0.00001680524,0.000008062646],"category_scores_gemma":[0.00012027437,0.000051793555,0.00004425035,0.00033584255,0.00037072552,0.0036700962,0.00022931708,0.000055237713,0.0000019161375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018732513,0.00056370866,0.018632201,0.00006832753,0.00016259005,0.0000048813413,0.00938771,0.0025064752,0.20326614,0.38325697,0.00017717193,0.3819551],"study_design_scores_gemma":[0.000862866,0.0004301498,0.0871254,0.0007837439,0.000027094924,0.0009542365,0.00018998371,0.5713896,0.31330156,0.023886753,0.00072279514,0.00032577786],"about_ca_topic_score_codex":0.000012003597,"about_ca_topic_score_gemma":6.957993e-7,"teacher_disagreement_score":0.5688832,"about_ca_system_score_codex":0.000043420692,"about_ca_system_score_gemma":0.0002579687,"threshold_uncertainty_score":0.2660731},"labels":[],"label_agreement":null},{"id":"W2570386222","doi":"10.1142/s0218196709005330","title":"A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS","year":2009,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Fibonacci number; Class (philosophy); Set (abstract data type); Discrete mathematics; Finite set; Automaton; Sequence (biology); Regular language; Decision problem; Algebra over a field; Arithmetic; Combinatorics; Pure mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Computer science","score_opus":0.01046059632410859,"score_gpt":0.2923544748404146,"score_spread":0.281893878516306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570386222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31231165,0.00023646101,0.6859769,0.00077456655,0.0005318479,0.000104446946,0.0000024619558,0.000013173745,0.000048480146],"genre_scores_gemma":[0.937106,0.00003363111,0.06259216,0.00016516299,0.000089411216,0.0000025701338,0.000004836206,0.000003068558,0.0000031522388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989624,0.00003632934,0.00043608499,0.00012772069,0.0003455113,0.00009193771],"domain_scores_gemma":[0.9990992,0.00014221958,0.0002741985,0.000048266294,0.00039360372,0.00004254479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049336394,0.00008037644,0.00013955584,0.00026076764,0.000046805122,0.00039080443,0.00027888082,0.00003735544,0.0000012896115],"category_scores_gemma":[0.000038992064,0.00006895597,0.000048515663,0.00010118565,0.0000120861,0.000767681,0.00002245565,0.00007000974,0.000001207966],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019853695,0.00011697355,0.00035888868,0.00000955675,0.00003120009,0.00004097138,0.001413481,0.015519958,0.0010133564,0.0891314,0.00040753902,0.89175814],"study_design_scores_gemma":[0.0021293582,0.00050259545,0.009835095,0.000370834,0.000007066616,0.00053923356,0.00011990229,0.83275723,0.00028143247,0.1529477,0.00036355833,0.00014600386],"about_ca_topic_score_codex":0.0000035248956,"about_ca_topic_score_gemma":0.000001325652,"teacher_disagreement_score":0.8916121,"about_ca_system_score_codex":0.000070049355,"about_ca_system_score_gemma":0.000063273845,"threshold_uncertainty_score":0.37685362},"labels":[],"label_agreement":null},{"id":"W2570565098","doi":"10.1142/s0129054105003273","title":"WORDS AVOIDING $\\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Complement (music); Morse code; Word (group theory); Combinatorics; Identity (music); Term (time); Combinatorics on words; Binary number; Discrete mathematics; Pure mathematics; Arithmetic; Computer science; Physics; Geometry","score_opus":0.009880745572070696,"score_gpt":0.27315879649748337,"score_spread":0.2632780509254127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570565098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15051557,0.00016558614,0.83644724,0.010748296,0.001646429,0.000055118086,0.0000010388612,0.000017168271,0.00040354763],"genre_scores_gemma":[0.8798725,0.000058227673,0.11907877,0.00060204574,0.0003575184,9.99693e-7,2.4154363e-7,0.000003140772,0.000026568601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998053,0.000083137405,0.00053003366,0.00019137487,0.0009800162,0.00016241484],"domain_scores_gemma":[0.99777865,0.00048199153,0.00053798215,0.0003105455,0.0008050872,0.00008574913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026825564,0.000101425896,0.0001772642,0.00044700672,0.00024957032,0.0005738232,0.0031643624,0.000021522363,0.000017229224],"category_scores_gemma":[0.00020782494,0.00006900472,0.00010085581,0.00047083694,0.0009193281,0.0025582346,0.0005420473,0.00020164538,0.0000074549653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037012465,0.00010440884,0.00032996215,0.0000030147828,0.00007669744,0.000012791321,0.004455645,0.00453608,0.001564295,0.63933986,0.00046771351,0.3490725],"study_design_scores_gemma":[0.0026260451,0.00014477472,0.008331837,0.00019269637,0.000022358183,0.0012405472,0.00016532135,0.9079983,0.0036264502,0.06769151,0.007690698,0.00026942446],"about_ca_topic_score_codex":0.000009312165,"about_ca_topic_score_gemma":0.0000018116071,"teacher_disagreement_score":0.90346223,"about_ca_system_score_codex":0.00007983556,"about_ca_system_score_gemma":0.0002448783,"threshold_uncertainty_score":0.58802253},"labels":[],"label_agreement":null},{"id":"W2574656611","doi":"","title":"A Note on Roman Bondage Number of Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007521313394551624,"score_gpt":0.2396196506465457,"score_spread":0.23209833725199408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574656611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98362195,0.000023365898,0.0020619235,0.000681715,0.0015176911,0.000086097425,0.0000039348083,0.00019042993,0.011812917],"genre_scores_gemma":[0.99828374,0.000007498881,0.0011395804,0.0002047455,0.0000044220888,0.000005340307,4.1503958e-7,0.000010364791,0.000343912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999001,0.00005789041,0.00018783515,0.00027723363,0.00024998304,0.00022604261],"domain_scores_gemma":[0.99883956,0.0002144845,0.000098333956,0.0007316789,0.00004191937,0.00007403894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024291998,0.00012107546,0.00016706323,0.0000614728,0.000050395254,0.00002774349,0.00075274333,0.00005753704,0.00005662872],"category_scores_gemma":[0.00004331342,0.00008188064,0.0000861795,0.00025309974,0.00006358025,0.00025799102,0.0001712293,0.000062258754,0.00028213614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054256375,0.00008644163,0.001174366,0.0000044966814,0.0000080717855,0.000010737407,0.00012991249,8.828563e-8,0.0033383677,0.9827023,0.0022131796,0.010326591],"study_design_scores_gemma":[0.00071507844,0.00010080253,0.0057739834,0.000069711954,0.000003185072,0.000007965867,0.0000033801223,0.000117899064,0.01962037,0.9708674,0.002572138,0.00014808975],"about_ca_topic_score_codex":0.000012658424,"about_ca_topic_score_gemma":5.9820104e-7,"teacher_disagreement_score":0.016282003,"about_ca_system_score_codex":0.000024187531,"about_ca_system_score_gemma":0.000025501686,"threshold_uncertainty_score":0.36263832},"labels":[],"label_agreement":null},{"id":"W2574983858","doi":"","title":"Split graphs whose completely regular endomorphisms form a monoid.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endomorphism; Mathematics; Monoid; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.012409645097022711,"score_gpt":0.2139522759062076,"score_spread":0.2015426308091849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574983858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.965302,0.00042285453,0.023006588,0.0026004496,0.0035637591,0.00042560245,0.00001540084,0.0009213379,0.003742043],"genre_scores_gemma":[0.9951172,0.00003693656,0.0037872454,0.00042194614,0.000012939454,0.000039350143,0.0000027601893,0.000025012136,0.00055661437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980476,0.00009514858,0.000338477,0.00056391075,0.00039965136,0.0005552144],"domain_scores_gemma":[0.99795556,0.0002965366,0.0001497151,0.0012979149,0.000094566894,0.00020567965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049441156,0.0002577597,0.0003105421,0.00014456327,0.00019362188,0.00014795647,0.0015735752,0.00009789779,0.00006067868],"category_scores_gemma":[0.000064556334,0.00018468605,0.00016146377,0.00041959016,0.00013918629,0.00078524736,0.00045882893,0.00011438869,0.00038297832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012419255,0.00008104651,0.00046618804,0.0000062480526,0.000023648327,0.00003246568,0.00020324311,1.1600788e-7,0.004856,0.9620987,0.003311287,0.028908633],"study_design_scores_gemma":[0.0016879091,0.00018655857,0.0027542752,0.000062197236,0.000007778034,0.000038314814,0.0000117235995,0.00062436843,0.009525807,0.97296965,0.011801119,0.00033032408],"about_ca_topic_score_codex":0.000026504502,"about_ca_topic_score_gemma":0.000001727082,"teacher_disagreement_score":0.029815232,"about_ca_system_score_codex":0.000076760654,"about_ca_system_score_gemma":0.000050077844,"threshold_uncertainty_score":0.7531279},"labels":[],"label_agreement":null},{"id":"W2578144384","doi":"10.4204/eptcs.31.18","title":"Transformations Between Different Types of Unranked Bottom-Up Tree Automata","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Tree automaton; Automaton; Tree (set theory); String (physics); Mathematics; Computer science; State (computer science); Combinatorics; Theoretical computer science; Discrete mathematics; Algorithm","score_opus":0.0052680346812756865,"score_gpt":0.2312247567987587,"score_spread":0.22595672211748302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578144384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.631415,0.000025265079,0.3644425,0.00092077255,0.0003584685,0.00022363136,0.000001984667,0.00024218706,0.0023701878],"genre_scores_gemma":[0.98338604,0.000011164131,0.016375966,0.00009564327,0.00009604194,0.000016429132,0.0000011997827,0.000011162831,0.0000063673947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970581,0.00002522485,0.0005284912,0.0006682495,0.0007338273,0.0009861144],"domain_scores_gemma":[0.99878687,0.00023068217,0.00013613307,0.00047952635,0.00017372967,0.00019305856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018599299,0.0002533575,0.00037341157,0.0004335403,0.00022196103,0.00028028683,0.0035359452,0.00011574793,0.00002418916],"category_scores_gemma":[0.000114760194,0.00020202025,0.00009220467,0.0016881878,0.0016116606,0.0011925643,0.00049539265,0.00079934276,0.000012730372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059565396,0.000070255584,0.00046700868,0.000018351051,0.000005961734,5.3287215e-7,0.0008033568,0.000002097671,0.010775118,0.9432373,0.0000150650585,0.044598967],"study_design_scores_gemma":[0.0006185565,0.00034342258,0.009022911,0.00005486218,0.0000107511005,0.000029610836,0.000014197196,0.3383894,0.074121825,0.5769755,0.00009103038,0.00032789045],"about_ca_topic_score_codex":0.0000034545403,"about_ca_topic_score_gemma":0.0000043829023,"teacher_disagreement_score":0.3662618,"about_ca_system_score_codex":0.000092934424,"about_ca_system_score_gemma":0.00024233323,"threshold_uncertainty_score":0.8238147},"labels":[],"label_agreement":null},{"id":"W2578735002","doi":"10.4204/eptcs.31.12","title":"Transition Complexity of Incomplete DFAs","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Multiplicative function; Intersection (aeronautics); Finite-state machine; Computational complexity theory; Upper and lower bounds; Descriptive complexity theory; State (computer science); Discrete mathematics; Automaton; Average-case complexity; Time complexity; Computer science; Theoretical computer science; Algorithm","score_opus":0.007691240734273789,"score_gpt":0.23088464506836429,"score_spread":0.2231934043340905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578735002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50997967,0.000015879685,0.48582488,0.0013221505,0.00028442053,0.00017321215,9.449794e-7,0.0001614237,0.0022374443],"genre_scores_gemma":[0.92961085,0.0000036373433,0.069976866,0.0003048846,0.0000843629,0.000009305167,5.2713705e-7,0.000008452309,0.0000011007551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971729,0.000024684423,0.00042872643,0.0007623743,0.00067221746,0.00093909714],"domain_scores_gemma":[0.99895257,0.00011138958,0.0001283388,0.00041970317,0.0002258731,0.0001621179],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026777927,0.00020907153,0.0002996939,0.00037112617,0.00020555337,0.00021931865,0.003060195,0.00008591054,0.00003767094],"category_scores_gemma":[0.00009556392,0.00018608678,0.00007668016,0.0019125993,0.004109071,0.0010700108,0.0005698899,0.00070028735,0.000011413462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000947638,0.000086028915,0.0000662742,0.000014088643,0.0000022453387,0.0000015945914,0.00062410155,0.000006505855,0.04013099,0.94909513,0.0000072803164,0.009956269],"study_design_scores_gemma":[0.00023287993,0.00018910553,0.0012609984,0.000023003238,0.0000017719356,0.000056103927,0.000008601525,0.34387377,0.03343338,0.6207131,0.000040005983,0.00016727552],"about_ca_topic_score_codex":0.0000075083317,"about_ca_topic_score_gemma":0.0000049135883,"teacher_disagreement_score":0.4196312,"about_ca_system_score_codex":0.00008967176,"about_ca_system_score_gemma":0.0002313026,"threshold_uncertainty_score":0.9986012},"labels":[],"label_agreement":null},{"id":"W2582188091","doi":"10.1142/s0129054116500349","title":"State Complexity of Insertion","year":2016,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Algorithm; Computer science","score_opus":0.032465811927913014,"score_gpt":0.3026928864660438,"score_spread":0.2702270745381308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582188091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27587596,0.000012821432,0.72112596,0.0016575676,0.0011802604,0.00002577953,0.000004342734,0.0000097718685,0.00010752409],"genre_scores_gemma":[0.85756314,0.000017761537,0.14226393,0.00006919315,0.00007202513,3.4130113e-7,2.5858506e-7,0.0000020666268,0.000011286086],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809605,0.00004398945,0.00062620157,0.00014992457,0.0009613325,0.00012247605],"domain_scores_gemma":[0.99665624,0.00017945979,0.0008197125,0.00028750606,0.0019888089,0.00006827078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010419165,0.00007336555,0.00015783716,0.0005425964,0.0000552492,0.00010232406,0.002799925,0.000014557076,0.000020530795],"category_scores_gemma":[0.00012321067,0.000050083516,0.00009315049,0.0004366815,0.0007675724,0.0022280293,0.00035547573,0.000051437688,0.0000062613144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031680574,0.00024965606,0.0019379643,0.0000063217303,0.00006405297,0.000008585762,0.00055665104,0.0005069138,0.10706078,0.39841893,0.00017336043,0.4909851],"study_design_scores_gemma":[0.0020941284,0.0007560176,0.18630467,0.0006410636,0.000013168255,0.0004425851,0.00002283148,0.0828098,0.23492533,0.48993456,0.0017232299,0.00033261662],"about_ca_topic_score_codex":0.000010964355,"about_ca_topic_score_gemma":0.0000019336446,"teacher_disagreement_score":0.58168715,"about_ca_system_score_codex":0.000081942664,"about_ca_system_score_gemma":0.00035921158,"threshold_uncertainty_score":0.5203004},"labels":[],"label_agreement":null},{"id":"W2585141159","doi":"10.1016/j.jcss.2017.02.001","title":"State complexity of operations on input-driven pushdown automata","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Combinatorics; State (computer science); Discrete mathematics; Mathematics; Alphabet; Automaton; Regular language; Star (game theory); Pushdown automaton; Finite-state machine; Computer science; Algorithm; Theoretical computer science","score_opus":0.05344652619702596,"score_gpt":0.29515263919310697,"score_spread":0.24170611299608102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585141159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56621623,0.00009056551,0.4298124,0.0012508559,0.0012517415,0.0000883887,0.000005893329,0.000031558877,0.0012523636],"genre_scores_gemma":[0.95549667,0.000013909243,0.044276696,0.00007450137,0.00011844899,5.063796e-7,1.4154533e-7,0.0000023178743,0.000016824326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985249,0.00012461461,0.0004947471,0.00019472648,0.00049547036,0.00016556117],"domain_scores_gemma":[0.99861413,0.00009829115,0.0005539559,0.00045704516,0.00017098642,0.00010559773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014100702,0.0001089137,0.00032939235,0.00017224572,0.0006730247,0.0008691046,0.0019698667,0.00002483033,0.0000016759531],"category_scores_gemma":[0.000019959714,0.000071703114,0.000079167985,0.000107597945,0.00049683574,0.0011357947,0.00034511698,0.0000950827,0.0000033956496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027975288,0.0002681141,0.005707498,0.00020372531,0.000110093875,0.00012491591,0.0038452041,0.013176752,0.002003248,0.8727572,0.0014612277,0.10031407],"study_design_scores_gemma":[0.0005935324,0.0009060766,0.05706188,0.00054048735,0.000008494363,0.00044649644,0.00012237285,0.9347558,0.00082480646,0.0043078773,0.00026420655,0.00016795547],"about_ca_topic_score_codex":0.000031801028,"about_ca_topic_score_gemma":0.000005598748,"teacher_disagreement_score":0.92157906,"about_ca_system_score_codex":0.000018689212,"about_ca_system_score_gemma":0.00011125249,"threshold_uncertainty_score":0.8380795},"labels":[],"label_agreement":null},{"id":"W2585527963","doi":"10.37236/6915","title":"Counting Lyndon Factors","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Fibonacci number; Mathematics; Word (group theory); Counterexample; Golden ratio; Upper and lower bounds; Combinatorics on words; Alphabet; Word length; Discrete mathematics; Computer science; Philosophy","score_opus":0.010469131315584097,"score_gpt":0.2396999400641482,"score_spread":0.22923080874856408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585527963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8507998,0.0019624736,0.14069691,0.0022212116,0.0017433616,0.00006682024,2.3320797e-7,0.000041463336,0.0024677145],"genre_scores_gemma":[0.9994045,0.0002250386,0.000032269458,0.000067703964,0.00009844943,3.7232735e-7,7.6905216e-8,0.000008527878,0.00016307364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987184,0.000072793664,0.00026917754,0.00009724058,0.00039429902,0.00044808237],"domain_scores_gemma":[0.9980558,0.00018731257,0.000788055,0.0007610205,0.00015325373,0.000054538286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016337695,0.000114262606,0.00019244231,0.00005482805,0.0006329364,0.00041687308,0.0033698084,0.000040666444,0.0000049993146],"category_scores_gemma":[0.00019789491,0.00006912109,0.000119695505,0.00009883665,0.00006564105,0.00074382377,0.00023835101,0.0005209421,0.0000064493656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003905968,0.000032773696,0.0011152639,0.0000024901765,0.000033438093,0.0000072820917,0.00024486546,0.0000051868524,0.00022673613,0.99608636,0.00036442696,0.0018772831],"study_design_scores_gemma":[0.0005025955,0.0002413607,0.0054885093,0.000025354573,0.0000197783,0.00014957908,0.0000757366,0.0023567642,0.003422025,0.98179567,0.005792228,0.00013039849],"about_ca_topic_score_codex":0.000010743498,"about_ca_topic_score_gemma":0.0000015057042,"teacher_disagreement_score":0.14860468,"about_ca_system_score_codex":0.00014728912,"about_ca_system_score_gemma":0.0002593108,"threshold_uncertainty_score":0.62619984},"labels":[],"label_agreement":null},{"id":"W2585764344","doi":"10.1016/j.tcs.2017.02.012","title":"Abelian-square-rich words","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Square (algebra); Abelian group; Combinatorics; Algebra over a field; Pure mathematics; Geometry","score_opus":0.012208342314047174,"score_gpt":0.2651676796845346,"score_spread":0.2529593373704874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585764344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07114929,0.00003411289,0.9073104,0.002837604,0.0015692143,0.00012700478,0.0000013023017,0.00038556923,0.016585488],"genre_scores_gemma":[0.8877917,0.000005450564,0.111111134,0.0008010693,0.00022968878,0.000006184258,2.7095555e-7,0.00000935832,0.000045148092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702924,0.00007554608,0.00027064563,0.0009471537,0.0008564681,0.00082095736],"domain_scores_gemma":[0.9959037,0.0001866071,0.00014884534,0.0032355303,0.00015791904,0.00036744273],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0020927445,0.00023313733,0.00024680782,0.0001701567,0.0020125476,0.002726354,0.009611363,0.00006605003,0.000077505276],"category_scores_gemma":[0.000205245,0.00018386368,0.0000836868,0.00049274584,0.0045693,0.0018475294,0.003346822,0.0002346982,0.0004233424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026555165,0.000039511906,0.00018643789,0.0000038067667,0.0000027054602,0.000024817318,0.0002626872,0.000010371069,0.0003849942,0.89128923,0.00011259118,0.10768021],"study_design_scores_gemma":[0.00031316362,0.000171199,0.010038188,0.000053050015,0.0000044058534,0.000061344064,0.00000748328,0.42742264,0.006577344,0.5543546,0.00057514803,0.00042143956],"about_ca_topic_score_codex":0.0000067091205,"about_ca_topic_score_gemma":5.861334e-7,"teacher_disagreement_score":0.8166424,"about_ca_system_score_codex":0.00005167387,"about_ca_system_score_gemma":0.0001313087,"threshold_uncertainty_score":0.9992867},"labels":[],"label_agreement":null},{"id":"W2586542999","doi":"10.1142/s1793830917500203","title":"Random graph languages","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Undirected graph; Comparability graph; Voltage graph; Null graph; Graph; Discrete mathematics; Mathematics; Line graph; Theoretical computer science","score_opus":0.012106860808956496,"score_gpt":0.2792503952538275,"score_spread":0.267143534444871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586542999","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014236303,0.00027431993,0.9867909,0.00085505866,0.000028769984,0.00027156377,0.000016105101,0.00012847684,0.010211202],"genre_scores_gemma":[0.41116443,0.0003293136,0.5861236,0.00023492714,0.0002695318,0.0005701734,0.00001763885,0.000031574848,0.0012588112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932134,0.000008503267,0.00015746293,0.00023618115,0.00012315583,0.00015336886],"domain_scores_gemma":[0.9985964,0.00008081406,0.00014874559,0.00106591,0.000030039299,0.00007813194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021488292,0.00011031271,0.00015095843,0.00003835753,0.0006556521,0.00060187,0.0008351161,0.000035801993,0.000008298946],"category_scores_gemma":[0.000023295897,0.00008689858,0.000052498894,0.000055528606,0.00011125061,0.00026240942,0.00027968056,0.00006209942,0.000027811273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.921441e-7,0.000039493945,0.000026286358,0.000027062115,0.00001619133,0.0000018057613,0.0003818465,0.0000020192554,0.00021714294,0.9143157,0.00012771621,0.08484434],"study_design_scores_gemma":[0.0011604325,0.000029020835,0.0017875562,0.00006387875,0.000039123108,0.000049344595,0.0006632204,0.17003731,0.001417905,0.8103523,0.013887372,0.0005125104],"about_ca_topic_score_codex":0.000014536094,"about_ca_topic_score_gemma":0.0000017475546,"teacher_disagreement_score":0.4097408,"about_ca_system_score_codex":0.0000039407546,"about_ca_system_score_gemma":0.000009135979,"threshold_uncertainty_score":0.5803847},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022275286274606947,"score_gpt":0.2935118611464839,"score_spread":0.27123657487187697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590512199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15172972,0.00008444921,0.8442184,0.0021799626,0.0016546142,0.00009609648,0.0000030415372,0.000018773433,0.0000149708085],"genre_scores_gemma":[0.6707301,0.00003397508,0.32897007,0.00009068251,0.00015100221,0.000003243499,3.3470963e-7,0.0000031075792,0.000017492266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828553,0.000025636033,0.0005725693,0.00021641767,0.00075119693,0.0001486283],"domain_scores_gemma":[0.9974959,0.00036749785,0.00048092514,0.00023350299,0.0013399016,0.000082279774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001098777,0.0000990374,0.0001626516,0.00051893113,0.00015139743,0.00040904013,0.0016632092,0.000025340281,0.000008408732],"category_scores_gemma":[0.00021866272,0.0000632543,0.00007284769,0.0002888722,0.00028105418,0.0027775532,0.00027032712,0.000044981785,0.0000029677426],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013590594,0.000055365756,0.00010644595,0.0000043998575,0.000024998553,0.0000018848108,0.00044480275,0.00010867367,0.011579376,0.02576748,0.00013883041,0.96175414],"study_design_scores_gemma":[0.0029354517,0.0006852758,0.011353327,0.0011527657,0.000020957954,0.00053043955,0.000050446866,0.8360527,0.037357427,0.10609108,0.0034064045,0.0003636924],"about_ca_topic_score_codex":0.000004735481,"about_ca_topic_score_gemma":0.000001782272,"teacher_disagreement_score":0.96139044,"about_ca_system_score_codex":0.00007934516,"about_ca_system_score_gemma":0.00029155912,"threshold_uncertainty_score":0.39443836},"labels":[],"label_agreement":null},{"id":"W2592641503","doi":"10.1007/s00224-018-9859-0","title":"Primitivity, Uniform Minimality, and State Complexity of Boolean Operations","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Product term; Discrete mathematics; Permutation (music); Boolean circuit; Combinatorics; Boolean network; Direct product; Permutation group; Boolean expression; State (computer science); Boolean function; Two-element Boolean algebra; Parity function; Complete Boolean algebra; Algorithm; Algebra over a field; Pure mathematics","score_opus":0.041126256274553526,"score_gpt":0.2732903883261544,"score_spread":0.23216413205160086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592641503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61433935,0.00008148865,0.3828123,0.000044387285,0.00022674949,0.00014432434,0.000010461603,0.000084378284,0.0022565934],"genre_scores_gemma":[0.9912676,0.000002261606,0.008514098,0.00004410121,0.00007837681,0.0000010201809,0.0000017956474,0.000008784885,0.00008195393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838126,0.0004171863,0.00049331604,0.0002619642,0.00022883482,0.00021744466],"domain_scores_gemma":[0.99862164,0.0003431049,0.00023311764,0.00053561304,0.00020028434,0.000066247354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024308346,0.0001370479,0.00036049375,0.00010404838,0.00016729264,0.00008324466,0.0006105923,0.000037831178,0.0000039787965],"category_scores_gemma":[0.000050188126,0.00012220663,0.000047682148,0.00020536956,0.0007983733,0.00021527066,0.0005075763,0.00007286664,0.000005751835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011448213,0.00006215237,0.00042181587,0.00014749968,0.000033765304,0.0000011864212,0.004041658,0.000206136,0.0031521816,0.985917,0.000036476144,0.0059687207],"study_design_scores_gemma":[0.0009376778,0.0007267541,0.029544163,0.0007968309,0.000027884435,0.00012039171,0.0010596404,0.74303496,0.024702717,0.19834277,0.00018483277,0.00052136945],"about_ca_topic_score_codex":0.00013770809,"about_ca_topic_score_gemma":0.000013805684,"teacher_disagreement_score":0.7875742,"about_ca_system_score_codex":0.000017499626,"about_ca_system_score_gemma":0.000051185893,"threshold_uncertainty_score":0.49834418},"labels":[],"label_agreement":null},{"id":"W2592757846","doi":"10.1142/s0129054113400182","title":"AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Shuffling; Mathematics; Combinatorics; Combinatorics on words; Discrete mathematics; Function (biology); Algorithm; Word (group theory)","score_opus":0.011031482350575644,"score_gpt":0.2717489781803248,"score_spread":0.2607174958297491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592757846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4710107,0.000016878666,0.5244253,0.0015644033,0.002185553,0.00007892604,4.6732575e-7,0.000021182386,0.00069652667],"genre_scores_gemma":[0.92936134,0.000006489334,0.07028926,0.0002392828,0.00008645948,0.0000024917358,3.0723882e-7,0.0000036859,0.000010689038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997855,0.000059447666,0.00062581216,0.00019139898,0.0010845342,0.00018382004],"domain_scores_gemma":[0.9977524,0.00033524985,0.0005263994,0.0003330774,0.0009707537,0.00008208482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012407292,0.00010297259,0.00017545086,0.0010020629,0.00007365808,0.000497013,0.0035413571,0.000025401916,0.000045159784],"category_scores_gemma":[0.00019669726,0.00008560594,0.000077688645,0.00085421867,0.00025018997,0.0025174916,0.00035454688,0.00016478474,0.000029280367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034236398,0.00029634856,0.001271389,0.0000052482415,0.00002103499,0.000016142692,0.00094530254,0.0020470137,0.0012552232,0.6546852,0.00017093927,0.33928275],"study_design_scores_gemma":[0.0006015841,0.00024782072,0.040676486,0.0002509,0.000002583118,0.00012155809,0.000045976238,0.72048116,0.002330745,0.23495963,0.0001339506,0.00014761202],"about_ca_topic_score_codex":0.000021207954,"about_ca_topic_score_gemma":0.000001117683,"teacher_disagreement_score":0.71843415,"about_ca_system_score_codex":0.00017673065,"about_ca_system_score_gemma":0.00033763176,"threshold_uncertainty_score":0.65807813},"labels":[],"label_agreement":null},{"id":"W2595036685","doi":"10.1016/j.tcs.2017.03.007","title":"State complexity of permutation on finite languages over a binary alphabet","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Science and Technology; Ministry of Science, ICT and Future Planning","keywords":"Deterministic finite automaton; Combinatorics; Mathematics; Permutation (music); Regular language; Modulo; Nondeterministic finite automaton; Finite-state machine; Discrete mathematics; Deterministic automaton; State (computer science); DFA minimization; Cyclic permutation; Alphabet; String (physics); Binary number; Automaton; Automata theory; Algorithm; Computer science; Arithmetic; Symmetric group; Theoretical computer science; Physics","score_opus":0.023003178710106462,"score_gpt":0.2986228897265871,"score_spread":0.27561971101648064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595036685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4646541,0.000013288544,0.5299173,0.00077373965,0.00032443283,0.000110803136,0.000009802921,0.00011853397,0.004078026],"genre_scores_gemma":[0.96342367,0.0000032063315,0.036035366,0.0004552915,0.000055550165,0.0000028720385,0.000001256235,0.000006668154,0.000016121481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803513,0.00010036977,0.00024563284,0.00056120974,0.00065351697,0.00040416274],"domain_scores_gemma":[0.99762994,0.00032121534,0.00020328465,0.0015675147,0.00012006667,0.00015796394],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012312183,0.00016698385,0.00022795801,0.00015637297,0.00065287075,0.00053103146,0.0034244282,0.00003405167,0.000042631385],"category_scores_gemma":[0.00017716218,0.00013151916,0.000071617374,0.00025832732,0.005182185,0.0008730564,0.0012715323,0.00014690358,0.000047688198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000142979125,0.000078561454,0.0001571021,0.000009752908,0.000003940192,0.000019815327,0.00058162917,0.00020658385,0.0017049466,0.96961427,0.000042140447,0.02756699],"study_design_scores_gemma":[0.00028162476,0.0003184402,0.041034676,0.000060493905,0.0000027392082,0.000006918321,0.0000073676983,0.6190563,0.01030207,0.3287255,0.000024417377,0.00017945135],"about_ca_topic_score_codex":0.000016130678,"about_ca_topic_score_gemma":8.452282e-7,"teacher_disagreement_score":0.64088875,"about_ca_system_score_codex":0.000030561558,"about_ca_system_score_gemma":0.00007085868,"threshold_uncertainty_score":0.99752516},"labels":[],"label_agreement":null},{"id":"W260210188","doi":"","title":"Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen - J.UCS Special Issue.","year":2002,"lang":"en","type":"article","venue":"JUCS - Journal of Universal Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Honour; Computer science; Automaton; Cognitive science; Theoretical computer science; History; Psychology; Archaeology","score_opus":0.006244402982577283,"score_gpt":0.2163864148918221,"score_spread":0.2101420119092448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W260210188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992176,0.0005537889,0.0047532045,0.00036655884,0.0004969286,0.00006441807,0.0000029369983,0.000007702333,0.001578438],"genre_scores_gemma":[0.9906986,0.0003381431,0.008802859,0.000026200305,0.00009210228,9.984363e-8,4.7008978e-8,0.0000025819081,0.00003937934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988158,0.00008661521,0.00036245334,0.00016724847,0.00038299954,0.0001848996],"domain_scores_gemma":[0.9991588,0.00010026839,0.00043010587,0.00017605198,0.00007796836,0.000056821984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074411323,0.00009406706,0.00025442732,0.0006678893,0.00007311337,0.00003355559,0.00075057533,0.0000323346,0.000013707316],"category_scores_gemma":[0.000026629732,0.00006864632,0.000049288938,0.0015536877,0.00042581282,0.0011045613,0.00032357726,0.00013690555,9.398921e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008859441,0.00029182408,0.011031042,0.000092811875,0.00001924842,0.000090299785,0.020530721,0.0014976978,0.009859488,0.0059349923,0.00034775757,0.9502155],"study_design_scores_gemma":[0.0045508263,0.0019820402,0.37976345,0.0008734001,0.000026254536,0.0008530007,0.0026969803,0.58900166,0.015453272,0.001123864,0.0032248849,0.00045036295],"about_ca_topic_score_codex":0.00003087595,"about_ca_topic_score_gemma":0.00004144421,"teacher_disagreement_score":0.94976515,"about_ca_system_score_codex":0.000042331656,"about_ca_system_score_gemma":0.000059331804,"threshold_uncertainty_score":0.27993155},"labels":[],"label_agreement":null},{"id":"W2610921159","doi":"10.14232/actacyb.23.1.2017.3","title":"Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages","year":2017,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prefix; Regular language; Prefix code; Concatenation (mathematics); Ideal (ethics); Mathematics; Quotient; Combinatorics; Discrete mathematics; Alphabet; Computer science; Automaton; Algorithm; Theoretical computer science","score_opus":0.019023756742540792,"score_gpt":0.25754122198324414,"score_spread":0.23851746524070336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610921159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94132644,0.0009816972,0.002147104,0.00508575,0.00022965421,0.0003069393,0.000040208302,0.00023254564,0.049649686],"genre_scores_gemma":[0.979353,0.000056953417,0.019767987,0.00012682396,0.000063237945,0.0000065369873,0.000003085669,0.000012674253,0.0006096966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871033,0.00007110121,0.00023346936,0.00041274683,0.0002811008,0.00029126435],"domain_scores_gemma":[0.99689275,0.00012005629,0.00023838601,0.002572962,0.00005430492,0.00012152128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031561186,0.00016991804,0.00027343645,0.00005388595,0.00024878207,0.00026350206,0.0023731727,0.00008454267,0.000071209164],"category_scores_gemma":[0.00019681896,0.00014155306,0.000059308113,0.000054043536,0.00061475515,0.00042326664,0.0013536152,0.00011937288,0.000015410988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002228444,0.00014835747,0.0018402319,0.00008591104,0.000070374845,0.000042888263,0.00088672654,6.1532666e-7,0.014488529,0.94586265,0.010732659,0.02581877],"study_design_scores_gemma":[0.0019960399,0.00032909907,0.42722255,0.00021845016,0.000059598042,0.000099735844,0.00008776451,0.0060540666,0.053246684,0.4841343,0.025823105,0.0007286196],"about_ca_topic_score_codex":0.00033765537,"about_ca_topic_score_gemma":0.000051107832,"teacher_disagreement_score":0.46172836,"about_ca_system_score_codex":0.000011995089,"about_ca_system_score_gemma":0.000028661805,"threshold_uncertainty_score":0.57723665},"labels":[],"label_agreement":null},{"id":"W2610936131","doi":"","title":"On a variant of the Ailon–Rudnick theorem in finite characteristic","year":2017,"lang":"en","type":"article","venue":"New York journal of mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of British Columbia","funders":"","keywords":"Mathematics; Pure mathematics; Calculus (dental); Medicine; Orthodontics","score_opus":0.02745803990985038,"score_gpt":0.24837936559747903,"score_spread":0.22092132568762865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610936131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71565175,0.00024699274,0.27358446,0.0037699817,0.0016011664,0.00024994672,0.0000053359418,0.000023468036,0.004866915],"genre_scores_gemma":[0.9794213,0.000016993758,0.020067036,0.00017620936,0.000095755706,4.904545e-7,5.006984e-8,0.000009123885,0.0002130224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876815,0.000068718655,0.00054984936,0.000093968316,0.00036479416,0.00015454071],"domain_scores_gemma":[0.996984,0.0005698904,0.0013298624,0.0009972439,0.000054407235,0.00006460601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011099266,0.00011365074,0.00030833384,0.00008133252,0.0000992037,0.00015338708,0.0023359943,0.000051076986,0.000027379376],"category_scores_gemma":[0.0008861998,0.00006594651,0.00013802266,0.000093803224,0.00006758269,0.00020304054,0.00021464983,0.00025028805,0.00001405051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026483782,0.0004428523,0.00024249493,0.000091975046,0.00004931406,0.00010570633,0.005983381,0.00016712054,0.0009932851,0.9692266,0.0014330387,0.021237738],"study_design_scores_gemma":[0.0012331724,0.00028112775,0.011602193,0.001980679,0.000033944456,0.0003815081,0.00016737831,0.029189467,0.0022703456,0.95215,0.0005128283,0.00019739439],"about_ca_topic_score_codex":0.0000064079513,"about_ca_topic_score_gemma":0.0000028880017,"teacher_disagreement_score":0.26376957,"about_ca_system_score_codex":0.000024933848,"about_ca_system_score_gemma":0.00012638545,"threshold_uncertainty_score":0.43408975},"labels":[],"label_agreement":null},{"id":"W2612751452","doi":"","title":"NBB bases of some lattices of pattern avoiding permutations.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.019426898417844934,"score_gpt":0.2651149689424482,"score_spread":0.24568807052460326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612751452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99564713,0.00017497863,0.0019408315,0.00029896415,0.0010647844,0.000064556014,0.0000051492675,0.00004513429,0.00075847533],"genre_scores_gemma":[0.9993422,0.000016639877,0.00052349526,0.00005565942,0.0000076735,0.0000039785955,0.0000011719596,0.000006483025,0.00004270891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992017,0.00006249317,0.00021992678,0.00017946395,0.00019743918,0.00013893854],"domain_scores_gemma":[0.9984487,0.00026047535,0.0003425507,0.00082959357,0.000078632045,0.000039990886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037952603,0.000085717504,0.00018408774,0.000062494204,0.00022742117,0.00009222376,0.001136353,0.00003539698,0.000015275698],"category_scores_gemma":[0.00017965875,0.000080026155,0.00006341747,0.000058095742,0.000102379665,0.0008152022,0.00029511825,0.00007417933,0.000012205076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016168287,0.00008019776,0.009892601,0.00004404303,0.000018693592,0.000005492917,0.0006380115,0.000005357374,0.0029860642,0.9771811,0.0001577259,0.0089891],"study_design_scores_gemma":[0.00069110986,0.00010092653,0.04887157,0.00014147074,0.000015831509,0.0000040189334,0.00012864383,0.0107962275,0.05747356,0.88146144,0.00013560266,0.00017958686],"about_ca_topic_score_codex":0.000102685495,"about_ca_topic_score_gemma":0.0000018756006,"teacher_disagreement_score":0.09571964,"about_ca_system_score_codex":0.00000992882,"about_ca_system_score_gemma":0.00003315592,"threshold_uncertainty_score":0.3263372},"labels":[],"label_agreement":null},{"id":"W2613395908","doi":"","title":"Extensions and restrictions of Wyhtoff's game preserving Wythoff's P-positions","year":2009,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada; Dalhousie University","funders":"","keywords":"Fibonacci number; Set (abstract data type); Morphism; Computer science; Word (group theory); Combinatorics; Mathematics; Discrete mathematics; Programming language; Geometry","score_opus":0.01289465573409901,"score_gpt":0.22562146701532143,"score_spread":0.21272681128122242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613395908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090816595,0.002839194,0.86278105,0.01525979,0.00025185873,0.0004744704,0.000070035356,0.00053205737,0.02697494],"genre_scores_gemma":[0.7875497,0.0012471966,0.20902875,0.0001422576,0.000023593386,0.000044511184,0.000108704895,0.000026609961,0.0018286775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951053,0.0027861928,0.0005707219,0.00082430104,0.00038323537,0.00033021029],"domain_scores_gemma":[0.9933755,0.0014550375,0.00051537686,0.0030808235,0.0013716912,0.00020159618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028757514,0.00029626978,0.00039507184,0.00032936124,0.0003756566,0.00044579135,0.0019396647,0.00025331767,0.000035394944],"category_scores_gemma":[0.00086763856,0.00031654295,0.00018771747,0.0005848437,0.00022122641,0.00033227046,0.0029413328,0.00058885186,0.000009119904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004658933,0.00075530057,0.00048285568,0.00015699636,0.00008175608,0.0000124721355,0.007273567,0.00030117552,0.0077062175,0.91377586,0.0027016916,0.06674742],"study_design_scores_gemma":[0.0012070674,0.0000041584817,0.09069371,0.008368236,0.00021197047,0.0001692594,0.00029077163,0.42418003,0.042216532,0.41698533,0.013948272,0.0017246683],"about_ca_topic_score_codex":0.00077209086,"about_ca_topic_score_gemma":0.00024181054,"teacher_disagreement_score":0.6967331,"about_ca_system_score_codex":0.00005511395,"about_ca_system_score_gemma":0.0002331166,"threshold_uncertainty_score":0.99992865},"labels":[],"label_agreement":null},{"id":"W2613700840","doi":"10.71781/10245","title":"Modèles et algorithmes pour les enchères combinatoires","year":2003,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chemistry","score_opus":0.009160145108839623,"score_gpt":0.18695090907059203,"score_spread":0.17779076396175242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613700840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6860308,0.1363524,0.035768174,0.0032504052,0.006240574,0.00087852817,0.00019211089,0.0007129674,0.13057402],"genre_scores_gemma":[0.65387064,0.0031076113,0.020844746,0.00079816,0.00026896328,0.000060535236,0.0005125657,0.0000983061,0.32043844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99603975,0.00055343256,0.0005764051,0.0011194707,0.0009628628,0.0007480833],"domain_scores_gemma":[0.997271,0.00037669588,0.00058180984,0.00077084254,0.00058631395,0.00041332725],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004337459,0.00077574677,0.0006411878,0.0004307344,0.008856292,0.00035110646,0.0013742226,0.00067539763,0.00011368542],"category_scores_gemma":[0.00013275826,0.00088025397,0.00051912956,0.0005036362,0.0004792787,0.001159119,0.00039195994,0.00070681015,0.00014555422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013934511,0.0005805233,0.004039,0.00023206614,0.00042819988,0.0032394275,0.03011933,0.003470479,0.009608441,0.92016095,0.002679124,0.025303116],"study_design_scores_gemma":[0.0062610474,0.00075203483,0.12297894,0.0033134755,0.0012022082,0.008395006,0.15809132,0.23815362,0.10814693,0.058719143,0.28801453,0.0059717363],"about_ca_topic_score_codex":0.040083636,"about_ca_topic_score_gemma":0.0034370394,"teacher_disagreement_score":0.8614418,"about_ca_system_score_codex":0.0029956661,"about_ca_system_score_gemma":0.0029569408,"threshold_uncertainty_score":0.9993648},"labels":[],"label_agreement":null},{"id":"W2616293382","doi":"","title":"Substitution shifts generated by $p$-adic integer sequences","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Substitution (logic); Uncountable set; Modulo; Mathematics; Alphabet; Algebraic number; Combinatorics; Sequence (biology); Integer (computer science); Discrete mathematics; Closure (psychology); Computer science","score_opus":0.032336867444329405,"score_gpt":0.15971958641899922,"score_spread":0.12738271897466982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616293382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45869783,0.000033407687,0.53909135,0.00006646406,0.00017563983,0.00003785902,0.0000015825157,0.00019396996,0.001701867],"genre_scores_gemma":[0.9983429,0.000025081388,0.00048303706,0.0003115208,0.000039058952,2.6531515e-7,0.0000076268134,0.0000054861107,0.000785024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998997,0.00012516449,0.00009869528,0.00046860808,0.00006096239,0.00024958942],"domain_scores_gemma":[0.99924755,0.0000651422,0.00007074364,0.00044868924,0.00005250209,0.000115345734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002644506,0.00013185691,0.00012164449,0.00009546623,0.00016467409,0.00008718748,0.00083338306,0.00007402532,0.000043338834],"category_scores_gemma":[0.000025980866,0.00013043388,0.00005558582,0.0006034417,0.00012027,0.0007093909,0.00013506519,0.00010898967,0.00022817828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063265716,0.00003781294,0.0009583835,0.0000050687195,0.000014368862,0.000035259804,0.00008213185,0.0041701286,0.004442803,0.9873399,0.0013256933,0.0015820944],"study_design_scores_gemma":[0.00044852466,0.00007884955,0.00077879924,0.000022309889,0.00001543642,0.0000074408786,0.000036034562,0.933969,0.0060489243,0.05031698,0.007924206,0.00035345886],"about_ca_topic_score_codex":0.000077420686,"about_ca_topic_score_gemma":0.000011992582,"teacher_disagreement_score":0.9370229,"about_ca_system_score_codex":0.00006432072,"about_ca_system_score_gemma":0.00003815393,"threshold_uncertainty_score":0.5318939},"labels":[],"label_agreement":null},{"id":"W2616617106","doi":"10.1142/s0129054117500137","title":"Worst Case Branching and Other Measures of Nondeterminism","year":2017,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; TRACE (psycholinguistics); Mathematics; Computation; Upper and lower bounds; Nondeterministic finite automaton; Tree (set theory); Bounded function; Discrete mathematics; Branching (polymer chemistry); Automaton; Combinatorics; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.04300114367963864,"score_gpt":0.3331492841058865,"score_spread":0.29014814042624787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616617106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32089856,0.000034050936,0.67711127,0.00050907384,0.0011418028,0.00002572673,0.0000025612362,0.000005177873,0.0002717524],"genre_scores_gemma":[0.8612262,0.000006392598,0.13854977,0.00008642252,0.00012292458,2.9720192e-7,5.40752e-8,0.0000025524942,0.000005367361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986098,0.000024342964,0.0004440435,0.00015417571,0.0006629068,0.00010472866],"domain_scores_gemma":[0.99757224,0.00013858022,0.0009782676,0.00042452218,0.00081643136,0.000069950496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012010952,0.00007674192,0.0001598174,0.0003741667,0.0002572821,0.0005745097,0.0027332678,0.000019591138,0.000004568964],"category_scores_gemma":[0.00017305682,0.00006459718,0.000069699905,0.00010479904,0.000635166,0.0021260572,0.00051448564,0.00008521849,9.613385e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018658537,0.00016466845,0.004267951,0.00001247905,0.00009708275,0.00028276263,0.0029164962,0.00041019326,0.011598787,0.22364691,0.00004817061,0.7565358],"study_design_scores_gemma":[0.003905788,0.00094222766,0.099396914,0.0013516222,0.000061579034,0.033499915,0.00021847137,0.6107164,0.054807413,0.18968846,0.004594459,0.0008167749],"about_ca_topic_score_codex":0.000043266085,"about_ca_topic_score_gemma":0.0000075027233,"teacher_disagreement_score":0.75571907,"about_ca_system_score_codex":0.000024656974,"about_ca_system_score_gemma":0.00019711611,"threshold_uncertainty_score":0.55400103},"labels":[],"label_agreement":null},{"id":"W2618109676","doi":"10.1016/j.tcs.2018.04.024","title":"Variations of checking stack automata: Obtaining unexpected decidability properties","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Undecidable problem; Decidability; Nondeterministic algorithm; Emptiness; Decision problem; Discrete mathematics; Automaton; Bounded function; Mathematics; Computer science; Combinatorics; Algorithm; Theoretical computer science","score_opus":0.018541725253925886,"score_gpt":0.25498249743764784,"score_spread":0.23644077218372195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618109676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25018656,0.00001322496,0.7467503,0.0003363162,0.00043846216,0.00014447363,0.0000013124203,0.00035350956,0.0017758457],"genre_scores_gemma":[0.8105228,8.611974e-7,0.18915375,0.00017504116,0.00012998757,0.0000065020467,3.5171672e-7,0.0000068376976,0.000003857337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973019,0.0001814192,0.00045671864,0.00073461665,0.0007539283,0.00057145493],"domain_scores_gemma":[0.997528,0.0002932204,0.00014861497,0.0012756712,0.00056732725,0.00018716138],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024212138,0.00018879688,0.00027316323,0.00020701892,0.00056059734,0.00036809297,0.0028002285,0.000056868346,0.00004764913],"category_scores_gemma":[0.0003947306,0.00014529355,0.0000694301,0.0018595641,0.005083812,0.0010262487,0.0014965109,0.0001450031,0.000042828506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008257198,0.000088065615,0.0001205265,0.000010287044,0.0000057795037,0.0000017446289,0.0022462085,0.000034561475,0.009830118,0.96547407,0.000012607599,0.022167796],"study_design_scores_gemma":[0.00020654128,0.0002709663,0.0041351584,0.000064845415,0.0000048785,0.000015099251,0.000027881846,0.78708494,0.05042901,0.15752894,0.00003037078,0.00020135271],"about_ca_topic_score_codex":0.000009767314,"about_ca_topic_score_gemma":9.755988e-7,"teacher_disagreement_score":0.80794513,"about_ca_system_score_codex":0.00007574424,"about_ca_system_score_gemma":0.00027174657,"threshold_uncertainty_score":0.9976238},"labels":[],"label_agreement":null},{"id":"W2618190110","doi":"10.1007/978-3-319-60134-2_5","title":"Complexity of Proper Prefix-Convex Regular Languages","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Regular language; Regular polygon; Combinatorics; Prefix code; Computer science; Discrete mathematics; Alphabet; Mathematics; Theoretical computer science; Algorithm; Linguistics; Automaton","score_opus":0.02884657845516872,"score_gpt":0.2612156032773482,"score_spread":0.2323690248221795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618190110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037258887,0.00090082985,0.9837488,0.0006483455,0.00092640496,0.00038058238,0.0000124910575,0.0001701973,0.012839773],"genre_scores_gemma":[0.5256501,0.000060365986,0.4699368,0.0010403147,0.0006081973,0.0000119745855,0.000010620769,0.00006353675,0.0026181168],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664026,0.000045014254,0.0005044684,0.0013135904,0.0009406152,0.000556059],"domain_scores_gemma":[0.9958473,0.00019855617,0.00056125544,0.0030133727,0.00024157371,0.00013793207],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010720408,0.00048129214,0.00073093217,0.00047694155,0.00028435566,0.00044410542,0.006094109,0.00028911623,0.000043231685],"category_scores_gemma":[0.000114430986,0.00039007762,0.00017050808,0.00016314327,0.0025043993,0.00068246963,0.0021703395,0.0005717549,0.00003779414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008194838,0.00005126378,0.00006824193,0.00014837061,0.000025572148,0.00012664597,0.0011129972,0.0008837616,0.0011427171,0.2368935,0.0000610999,0.7594776],"study_design_scores_gemma":[0.00047310526,0.00027374667,0.0007857967,0.001256439,0.000017805425,0.00013580183,5.7899166e-7,0.18487287,0.019277794,0.7882245,0.003548208,0.0011333632],"about_ca_topic_score_codex":0.000054640073,"about_ca_topic_score_gemma":0.000044482542,"teacher_disagreement_score":0.7583443,"about_ca_system_score_codex":0.00011164098,"about_ca_system_score_gemma":0.00040386704,"threshold_uncertainty_score":0.9998551},"labels":[],"label_agreement":null},{"id":"W2619644749","doi":"10.1142/s1793557118500596","title":"On the endomorphism monoids of Clifford semigroups","year":2017,"lang":"en","type":"article","venue":"Asian-European Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Endomorphism; Mathematics; Pure mathematics; Clifford algebra; Algebra over a field","score_opus":0.02498553244667356,"score_gpt":0.23708769808081512,"score_spread":0.21210216563414155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619644749","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4794367,0.00019775244,0.40534487,0.008338096,0.0010495743,0.0002444699,0.000006454892,0.00006161939,0.10532047],"genre_scores_gemma":[0.9709811,0.000038798073,0.028342456,0.0002696013,0.00013656025,5.529396e-7,1.2551207e-7,0.000023629476,0.00020717122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982326,0.00024385804,0.0007194317,0.00012884288,0.00046915349,0.00020610249],"domain_scores_gemma":[0.9960875,0.0004736204,0.0017612806,0.0014440246,0.00013762398,0.00009596492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029658044,0.0001678214,0.00033232072,0.000087566725,0.00027349856,0.0002642796,0.0035420936,0.000025210333,0.000033164637],"category_scores_gemma":[0.0007571489,0.0000990257,0.00022445685,0.000067887464,0.00017234439,0.00037172946,0.00034890004,0.00030274046,0.000077034936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017247143,0.00041466884,0.00006554007,0.0000720943,0.00013868856,0.00042655182,0.004995155,0.000026225016,0.0029140252,0.9296718,0.010821155,0.050436843],"study_design_scores_gemma":[0.0051891864,0.0032869002,0.010463134,0.003489535,0.00025393386,0.0032345867,0.003589232,0.02826532,0.042799,0.8857966,0.012345848,0.0012867369],"about_ca_topic_score_codex":7.702037e-7,"about_ca_topic_score_gemma":2.3370593e-7,"teacher_disagreement_score":0.49154443,"about_ca_system_score_codex":0.00001797454,"about_ca_system_score_gemma":0.000036201684,"threshold_uncertainty_score":0.658215},"labels":[],"label_agreement":null},{"id":"W2621373850","doi":"10.1007/978-3-319-60252-3_16","title":"Branching Measures and Nearly Acyclic NFAs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Combinatorics; Path (computing); Directed acyclic graph; Finite-state machine; String (physics); Mathematics; Nondeterministic finite automaton; Discrete mathematics; Computation; Automaton; Algorithm; Computer science; Automata theory; Theoretical computer science","score_opus":0.01823453053306076,"score_gpt":0.24333581897018078,"score_spread":0.22510128843712002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621373850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005167236,0.0016391417,0.98943186,0.00082527724,0.0015546096,0.00022902104,0.0000030639167,0.0002080338,0.0055922833],"genre_scores_gemma":[0.7278016,0.00023441386,0.2671649,0.0026820283,0.0010408768,0.000008841266,0.0000028242553,0.00006859035,0.0009959379],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965461,0.000037630525,0.00037195615,0.0015457781,0.0008603364,0.00063818437],"domain_scores_gemma":[0.9968971,0.0004081859,0.00032447831,0.0020516808,0.00011311526,0.000205413],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012405261,0.00051238196,0.0005392666,0.0005235262,0.00068262516,0.0020919386,0.004387597,0.00028912743,0.0000091518705],"category_scores_gemma":[0.00015578113,0.0004462395,0.00010941451,0.00013515003,0.0010032824,0.00122142,0.0020158929,0.0007906703,0.000033844008],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024123829,0.000008395226,0.00006173287,0.000021322141,0.000008873264,0.00007438749,0.0008202204,0.00049295864,0.00026991585,0.0276825,0.000014863857,0.97054243],"study_design_scores_gemma":[0.0004380991,0.00016107147,0.0013031295,0.00086857745,0.000013469205,0.00027480628,1.9514938e-7,0.25272447,0.0013481625,0.7350968,0.006560417,0.0012107703],"about_ca_topic_score_codex":0.00005095949,"about_ca_topic_score_gemma":0.00006732618,"teacher_disagreement_score":0.9693316,"about_ca_system_score_codex":0.000100358266,"about_ca_system_score_gemma":0.00028613157,"threshold_uncertainty_score":0.99979895},"labels":[],"label_agreement":null},{"id":"W266933206","doi":"10.1007/s00236-003-0110-2","title":"A word on 7 letters which is non-repetitive up to mod 5","year":2003,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mod; Theory of computation; Construct (python library); Word (group theory); Combinatorics; Mathematics; Plane (geometry); Discrete mathematics; Arithmetic; Computer science; Algorithm; Programming language","score_opus":0.008311424531101974,"score_gpt":0.22354343087930634,"score_spread":0.21523200634820436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W266933206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6200605,0.000005935935,0.2209545,0.01219405,0.000978689,0.00057684846,0.000010529477,0.0003544805,0.14486444],"genre_scores_gemma":[0.95649904,0.0000025716631,0.01389343,0.02926181,0.000022067326,0.000028927045,0.0000015522959,0.000008126384,0.00028249348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988531,0.000026597276,0.00026929684,0.00018772771,0.00030362752,0.000359638],"domain_scores_gemma":[0.9988617,0.0001276395,0.000075755706,0.0007299481,0.000054894837,0.0001500973],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002919183,0.00016086637,0.00016398064,0.0001383039,0.00011001106,0.00022201416,0.00072350155,0.00004469065,0.000118306365],"category_scores_gemma":[0.0001326581,0.00013556471,0.000051549294,0.0005099042,0.000019268404,0.0008952962,0.00014592095,0.00013884756,0.0015438377],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058020458,0.00019062244,0.00014155715,0.0001375711,0.00016131879,0.000027417713,0.107898735,0.00033948853,0.0046600346,0.5302857,0.26949224,0.08660727],"study_design_scores_gemma":[0.0043388684,0.0014502971,0.007451352,0.0011297697,0.00005829566,0.00022787326,0.0045244195,0.18273434,0.14036556,0.024092348,0.6297071,0.003919758],"about_ca_topic_score_codex":0.000006002117,"about_ca_topic_score_gemma":0.0000012323926,"teacher_disagreement_score":0.50619334,"about_ca_system_score_codex":0.000043079282,"about_ca_system_score_gemma":0.000045493493,"threshold_uncertainty_score":0.9992336},"labels":[],"label_agreement":null},{"id":"W2676854164","doi":"10.1016/j.ic.2010.11.009","title":"Decision problems for convex languages","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Suffix; Regular language; Mathematics; Computer science; Combinatorics; Abstract family of languages; Time complexity; Discrete mathematics; Linguistics; Automaton; Artificial intelligence; Programming language","score_opus":0.006772956264340065,"score_gpt":0.2565013127934235,"score_spread":0.2497283565290834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2676854164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10032751,0.000013351699,0.8981115,0.00026520537,0.00026504873,0.00015979464,0.000002218439,0.00012512061,0.0007302093],"genre_scores_gemma":[0.90661085,0.0000033120116,0.09275766,0.0005450576,0.000025701354,0.00001719885,0.00002564306,0.0000017648405,0.000012842646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999617,0.0000055534992,0.00015352994,0.00006397969,0.0000871492,0.00007283559],"domain_scores_gemma":[0.99962664,0.00010677108,0.00007344624,0.00008370013,0.00007717016,0.000032257984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020487179,0.000049391572,0.00005160111,0.00007274916,0.00008649929,0.00022896627,0.0001143628,0.000036001256,0.0000039778424],"category_scores_gemma":[0.000035823447,0.000042365693,0.000016353291,0.00007808711,0.000013833225,0.0013242151,0.000035166388,0.000046629368,0.00002428946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002819205,0.0000056053937,0.000043293752,0.000016167733,0.0000018432302,6.4319025e-8,0.00095050846,0.00024631576,0.00029802194,0.13603252,0.0005886855,0.86181414],"study_design_scores_gemma":[0.00050717196,0.000044268767,0.0033427663,0.000010834375,0.000001677509,0.000014711977,0.000114303904,0.92551726,0.0005019735,0.048963267,0.020883938,0.000097843644],"about_ca_topic_score_codex":0.000004335298,"about_ca_topic_score_gemma":0.0000028463396,"teacher_disagreement_score":0.9252709,"about_ca_system_score_codex":0.0000034676978,"about_ca_system_score_gemma":0.000013794049,"threshold_uncertainty_score":0.2207927},"labels":[],"label_agreement":null},{"id":"W272196518","doi":"10.1515/dema-2013-0425","title":"Idempotent tree languages","year":2013,"lang":"en","type":"article","venue":"Demonstratio Mathematica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Idempotence; Tree (set theory); Pure mathematics; Combinatorics","score_opus":0.009053640755379136,"score_gpt":0.22744410840890125,"score_spread":0.2183904676535221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W272196518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067282856,0.00015707644,0.8033496,0.0036358202,0.000105125975,0.0003917756,0.0000014123957,0.0006673625,0.12440895],"genre_scores_gemma":[0.8247569,0.000004122674,0.17391151,0.00046845744,0.000043987966,0.000062335006,0.000001583137,0.000009150153,0.00074195635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990634,0.000038504953,0.00024586997,0.00021881322,0.00020503771,0.00022840699],"domain_scores_gemma":[0.99908656,0.00015159242,0.00007231868,0.0005627617,0.000035777382,0.00009096761],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018925822,0.00012496396,0.00015309078,0.000053362666,0.00007957968,0.00027993805,0.0006167015,0.000046263754,0.000296438],"category_scores_gemma":[0.00005518137,0.00009591891,0.000064154425,0.00015164714,0.000046146208,0.00056203845,0.000100338504,0.00007522129,0.0017443675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.636141e-7,0.000081313105,0.000064981534,0.000027686046,0.000017502074,0.000011577967,0.000637465,0.0000022263928,0.0055274647,0.9127823,0.0073863,0.07346091],"study_design_scores_gemma":[0.00034720148,0.00008599203,0.0051827496,0.00008677146,0.000015726207,0.0001871465,0.00074301445,0.17616671,0.012185088,0.8036237,0.0008534607,0.0005224416],"about_ca_topic_score_codex":0.0000106544885,"about_ca_topic_score_gemma":0.0000022522324,"teacher_disagreement_score":0.75747406,"about_ca_system_score_codex":0.000011380191,"about_ca_system_score_gemma":0.000024462444,"threshold_uncertainty_score":0.9990329},"labels":[],"label_agreement":null},{"id":"W2727894299","doi":"10.1142/s021819671950019x","title":"Low-complexity computations for nilpotent subgroup problems","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Coset; Mathematics; Nilpotent; Centralizer and normalizer; Nilpotent group; Characteristic subgroup; Fitting subgroup; Bounded function; Conjugacy class; Commutator subgroup; Discrete mathematics; Computation; Combinatorics; Normal subgroup; Group (periodic table); Algorithm; p-group; Symmetric group; Mathematical analysis","score_opus":0.0311483277074883,"score_gpt":0.2916422187674985,"score_spread":0.2604938910600102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727894299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1408266,0.00038513137,0.85192287,0.0023669866,0.00398118,0.00035822354,0.000032929376,0.0000509974,0.000075077434],"genre_scores_gemma":[0.9174332,0.000093436814,0.08139892,0.00042612434,0.00049983873,0.000012816964,0.000089507805,0.000018446772,0.000027681877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787074,0.000093303584,0.0008302609,0.0003739631,0.00064459984,0.00018714085],"domain_scores_gemma":[0.9969228,0.00034402063,0.0011797203,0.00019465979,0.0012561542,0.00010268161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060597487,0.0002493041,0.00039650645,0.00040454252,0.00008320736,0.00064956077,0.0012344361,0.00014526409,0.000005654553],"category_scores_gemma":[0.000054397315,0.00023182713,0.00026755384,0.000093796276,0.00007151989,0.0005303863,0.00062115013,0.00037161124,0.000006952076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017348705,0.0007709504,0.00063803204,0.00068158144,0.0010411399,0.00005785025,0.0038566038,0.37540436,0.0006493467,0.31413496,0.0035148454,0.29907686],"study_design_scores_gemma":[0.0009766722,0.00017295999,0.004142043,0.00041638242,0.00003295161,0.00015697395,0.000045324985,0.5291997,0.00019644552,0.4641439,0.00027830273,0.00023833184],"about_ca_topic_score_codex":0.000012631677,"about_ca_topic_score_gemma":0.0000026336218,"teacher_disagreement_score":0.7766066,"about_ca_system_score_codex":0.00012526893,"about_ca_system_score_gemma":0.00023484444,"threshold_uncertainty_score":0.9453636},"labels":[],"label_agreement":null},{"id":"W2736549445","doi":"10.1007/978-3-319-62809-7_21","title":"Relative Prefix Distance Between Languages","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Prefix; Decidability; Computer science; Context (archaeology); Word (group theory); Context-free language; Regular language; Combinatorics; Discrete mathematics; Mathematics; Theoretical computer science; Rule-based machine translation; Artificial intelligence; Linguistics; Automaton; Geometry","score_opus":0.01644346720488384,"score_gpt":0.2641630324598084,"score_spread":0.24771956525492453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736549445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053202657,0.0010185747,0.9694722,0.00072076725,0.0008961585,0.0002704642,0.000020067155,0.0002522348,0.027296297],"genre_scores_gemma":[0.5704213,0.00008928339,0.4204197,0.0010593204,0.0015958033,0.0000159065,0.000019455238,0.00008291357,0.006296329],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99642,0.000040304163,0.0004229162,0.0015868793,0.00086863886,0.0006612443],"domain_scores_gemma":[0.9959208,0.0006871947,0.00048239392,0.0025946812,0.0001382005,0.00017674538],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009129353,0.0005383421,0.0006155453,0.0004292107,0.0004882361,0.0008738999,0.0059976242,0.00033672003,0.000019969406],"category_scores_gemma":[0.00016033008,0.00046370918,0.00015166121,0.00018102715,0.0010490677,0.0013158753,0.0019024597,0.0008932193,0.000102202546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022005088,0.000010415585,0.00022650027,0.000027802287,0.000017982213,0.00012690345,0.00089799357,0.00043063654,0.000022146927,0.14812383,0.000035366844,0.8500782],"study_design_scores_gemma":[0.00032471793,0.00016179486,0.0014768946,0.0010203596,0.000018656141,0.00003463454,2.899263e-7,0.054379635,0.0009976308,0.92892593,0.011455705,0.0012037397],"about_ca_topic_score_codex":0.000023318224,"about_ca_topic_score_gemma":0.000040987805,"teacher_disagreement_score":0.8488745,"about_ca_system_score_codex":0.00022539064,"about_ca_system_score_gemma":0.00031722954,"threshold_uncertainty_score":0.9997815},"labels":[],"label_agreement":null},{"id":"W2739858278","doi":"10.46298/dmtcs.3526","title":"The Size of the rth Smallest Component in Decomposable Structures with a Restricted Pattern","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Statistics Canada","funders":"","keywords":"Mathematics; Combinatorics; Component (thermodynamics); Class (philosophy); Combinatorial analysis; Combinatorial method; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0071796406325237245,"score_gpt":0.23238279958540722,"score_spread":0.2252031589528835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739858278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34770688,0.000028856146,0.6501309,0.00062947255,0.00020336831,0.00030500224,0.0000020734276,0.000051445626,0.0009419944],"genre_scores_gemma":[0.897865,0.000004018893,0.10190107,0.00017614852,0.000030507836,0.0000057733846,3.3088864e-7,0.000011846057,0.0000052945543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679273,0.00013448054,0.00064900506,0.00053505634,0.0011211042,0.0007675981],"domain_scores_gemma":[0.99553126,0.0022533087,0.00029041874,0.0016023635,0.00015968295,0.00016299305],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024784063,0.00026997077,0.00031832443,0.0001099949,0.00055797945,0.0004388055,0.004750046,0.00005672602,0.000011677109],"category_scores_gemma":[0.00019348858,0.00012719893,0.000096423675,0.0016329541,0.003290879,0.0002191669,0.0015198598,0.00031725346,0.00000388891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013038689,0.00006705757,0.00060146104,0.000020703157,0.000008276393,0.000012025431,0.00123738,0.00015922457,0.000895539,0.99200964,0.000010089065,0.0049655726],"study_design_scores_gemma":[0.0005544173,0.00019638591,0.034159057,0.00024165282,0.000011533878,0.00009900291,0.0002590567,0.46049237,0.008194837,0.49541402,0.000028101322,0.00034956547],"about_ca_topic_score_codex":0.000018366509,"about_ca_topic_score_gemma":0.00003115037,"teacher_disagreement_score":0.55015814,"about_ca_system_score_codex":0.00005496335,"about_ca_system_score_gemma":0.00012939822,"threshold_uncertainty_score":0.9994216},"labels":[],"label_agreement":null},{"id":"W2741750108","doi":"10.1142/9789813148208_0006","title":"Quasi-Distances and Weighted Finite Automata","year":2017,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.021884968505049333,"score_gpt":0.23485990733877915,"score_spread":0.2129749388337298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741750108","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000538805,0.001161165,0.0062333327,0.00025802327,0.0033683167,0.00030214834,0.000075871576,0.0005834085,0.98796386],"genre_scores_gemma":[0.0068527414,0.0000074441823,0.004413376,0.0001513351,0.00017666502,0.000012921541,0.000027915039,0.000043903496,0.9883137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967907,0.000037983533,0.00046042382,0.0014705356,0.00073601096,0.0005043459],"domain_scores_gemma":[0.99581736,0.00022391017,0.00054533203,0.0030451836,0.000119479126,0.000248748],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010472476,0.00050288416,0.0005457506,0.00059862074,0.0013054541,0.0029422776,0.0027534824,0.00018193529,0.00012489084],"category_scores_gemma":[0.000016445638,0.00044955322,0.00017670594,0.000039363935,0.0011918946,0.0003661421,0.0010554392,0.00041815982,0.00037032817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004019484,0.000016034852,0.0000028655888,0.000048380567,0.00003365126,0.00008395949,0.00033740667,1.3560991e-7,0.00004668823,0.9030262,0.021125415,0.07527522],"study_design_scores_gemma":[0.00018851628,0.000028837316,0.000011135409,0.0003607723,0.00002063063,0.000013358159,0.0000023943644,0.004394552,0.00011253227,0.24095957,0.7534335,0.0004741826],"about_ca_topic_score_codex":0.0000052016726,"about_ca_topic_score_gemma":0.0006634134,"teacher_disagreement_score":0.7323081,"about_ca_system_score_codex":0.000049909275,"about_ca_system_score_gemma":0.00018323366,"threshold_uncertainty_score":0.9999947},"labels":[],"label_agreement":null},{"id":"W2749482857","doi":"10.1007/978-3-319-66396-8_3","title":"Overpals, Underlaps, and Underpals","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Computer science; Word (group theory); Landmark; Factor (programming language); Natural language processing; Artificial intelligence; Linguistics; Programming language; Philosophy","score_opus":0.019617496920211915,"score_gpt":0.25108628994739307,"score_spread":0.23146879302718115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749482857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008960788,0.0015499176,0.98453665,0.0012133232,0.0014876411,0.00024211663,0.000005525774,0.00019427786,0.010680955],"genre_scores_gemma":[0.54773355,0.0007553271,0.44000217,0.006053638,0.0012319178,0.000012861735,0.000009448875,0.00011556934,0.004085547],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652606,0.000029906965,0.0003864201,0.0016133854,0.00079789315,0.00064632884],"domain_scores_gemma":[0.99652976,0.000511233,0.00034909497,0.0022841988,0.000109241344,0.00021649986],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001011467,0.00053315837,0.0005679715,0.00052629487,0.00052988017,0.001509021,0.0040908474,0.0003422541,0.000022636603],"category_scores_gemma":[0.000108324384,0.00047323984,0.00010048512,0.00013599431,0.0011768632,0.0008934006,0.0024195139,0.0006339052,0.000046580088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022101733,0.000013406276,0.000044094922,0.00003339228,0.0000118803555,0.000110435445,0.0003297069,0.0004915059,0.00008686537,0.24486898,0.00005013386,0.7539574],"study_design_scores_gemma":[0.00025480182,0.000100741876,0.00038480904,0.00043451428,0.000007626017,0.00014497353,1.3948414e-7,0.13937868,0.00039421543,0.8544794,0.0037142145,0.0007058777],"about_ca_topic_score_codex":0.000031374348,"about_ca_topic_score_gemma":0.00006529072,"teacher_disagreement_score":0.7532515,"about_ca_system_score_codex":0.00016239184,"about_ca_system_score_gemma":0.0004142742,"threshold_uncertainty_score":0.99977195},"labels":[],"label_agreement":null},{"id":"W2756030149","doi":"10.1007/s11139-017-9981-7","title":"More infinite products: Thue–Morse and the gamma function","year":2018,"lang":"en","type":"article","venue":"The Ramanujan Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Product (mathematics); Infinite product; Morse code; Function (biology); Mathematics; Combinatorics; Rational function; Constant (computer programming); Pure mathematics; Biology; Geometry; Computer science","score_opus":0.009218506670999176,"score_gpt":0.21572346704083556,"score_spread":0.20650496036983637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756030149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.810523,0.0017502685,0.13079973,0.050849073,0.002576751,0.00035411178,0.0000012817085,0.00018340233,0.0029624202],"genre_scores_gemma":[0.9940595,0.00007599489,0.0011764944,0.0022648443,0.0017915786,0.000004560964,3.00298e-7,0.000009865583,0.0006168575],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880993,0.0002622297,0.00021748398,0.0001849873,0.00026882454,0.00025655882],"domain_scores_gemma":[0.9988814,0.00016129762,0.00017047087,0.00059201167,0.00012463724,0.00007020968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022281634,0.00012486258,0.00012621023,0.00005503403,0.00077275396,0.0005661716,0.0009052952,0.00003125361,0.00004174424],"category_scores_gemma":[0.0001161026,0.00005580857,0.000053009535,0.00026879675,0.00059302564,0.0004497387,0.00024569742,0.0003442777,0.00007927875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000645698,0.000103181046,0.00068074977,0.000025658175,0.00024614637,0.000055999673,0.0323278,0.000052252304,0.0018958516,0.41919744,0.037997246,0.506772],"study_design_scores_gemma":[0.007530646,0.0011326722,0.05273546,0.0002526502,0.00021989376,0.009618325,0.0037512302,0.10383497,0.003676289,0.6414751,0.17481343,0.00095933175],"about_ca_topic_score_codex":0.0000054028696,"about_ca_topic_score_gemma":0.0000017079167,"teacher_disagreement_score":0.50581264,"about_ca_system_score_codex":0.000013831531,"about_ca_system_score_gemma":0.00004588434,"threshold_uncertainty_score":0.59434766},"labels":[],"label_agreement":null},{"id":"W2758996273","doi":"10.25596/jalc-2017-169","title":"State Complexity of Prefix Distance of Subregular Languages","year":2017,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Prefix; Upper and lower bounds; Mathematics; Regular language; Combinatorics; Deterministic finite automaton; Finite-state machine; Alphabet; Neighbourhood (mathematics); Nondeterministic finite automaton; Discrete mathematics; Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.024655987397331262,"score_gpt":0.25231424399670954,"score_spread":0.22765825659937827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758996273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8567443,0.00059355807,0.115849145,0.0009637861,0.00039388053,0.00030672902,0.00017865919,0.00022361864,0.024746345],"genre_scores_gemma":[0.9897357,0.000055509616,0.0084291315,0.00003673425,0.00003081485,9.682024e-7,0.000007858388,0.0000118127455,0.0016914345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985763,0.00007615747,0.00025587901,0.00038779437,0.0003853172,0.0003185918],"domain_scores_gemma":[0.99742067,0.00006271542,0.00050218625,0.001762219,0.00014819148,0.00010400061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030407697,0.00018849102,0.00038837493,0.00010847446,0.0002897327,0.00008223995,0.0026758902,0.000067822126,0.000042769712],"category_scores_gemma":[0.000047716065,0.00018277783,0.00014461331,0.00014606725,0.00063078466,0.0015868187,0.00097158254,0.00012131443,0.000023121123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015357681,0.00044369014,0.007628063,0.00047656742,0.00029629364,0.00021819124,0.007892828,0.0001425348,0.020055134,0.90372384,0.0026717447,0.056297533],"study_design_scores_gemma":[0.008358226,0.0012326632,0.58509016,0.0011570816,0.0003741184,0.00006468692,0.0091277,0.038366597,0.16957872,0.15282515,0.030974105,0.0028508194],"about_ca_topic_score_codex":0.0005048505,"about_ca_topic_score_gemma":0.00008908303,"teacher_disagreement_score":0.7508987,"about_ca_system_score_codex":0.0000614176,"about_ca_system_score_gemma":0.00009286319,"threshold_uncertainty_score":0.74534637},"labels":[],"label_agreement":null},{"id":"W2765317479","doi":"10.1090/bproc/37","title":"When is an automatic set an additive basis?","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society Series B","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Basis (linear algebra); Natural number; Characterization (materials science); Set (abstract data type); Mathematics; Natural (archaeology); Algorithm; Order (exchange); Computer science; Combinatorics; Geometry; Geography; Physics","score_opus":0.019577695073338557,"score_gpt":0.2632862714098411,"score_spread":0.24370857633650256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765317479","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808262,0.00003022358,0.010483719,0.004702518,0.00024156537,0.0008742007,0.00017516503,0.00084020855,0.0018261957],"genre_scores_gemma":[0.41581646,0.000060858827,0.578841,0.0041040005,0.0004650061,0.0002385905,0.000016037762,0.00011991793,0.00033814833],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966236,0.00005683515,0.0007491147,0.0010279459,0.0009296443,0.0006128719],"domain_scores_gemma":[0.99625045,0.0001616193,0.0015502688,0.0012478022,0.0005132932,0.00027656663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009798124,0.00059566234,0.0011073988,0.000049828333,0.00030898617,0.0005993156,0.005187726,0.00021629076,0.00021192076],"category_scores_gemma":[0.0001868782,0.00042387558,0.0006964913,0.000490045,0.002090662,0.0013282861,0.004224167,0.0006365553,0.000040469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091700604,0.0020948937,0.00068552466,0.0063804383,0.0018073207,0.000003103985,0.44107938,0.000006285022,0.005076985,0.31315798,0.17797147,0.05164492],"study_design_scores_gemma":[0.00013007488,0.00048664468,0.0007415964,0.0005212981,0.00011933327,0.000034464385,0.008965607,0.092719354,0.0072248406,0.8880066,0.0003846341,0.0006655133],"about_ca_topic_score_codex":0.00003569194,"about_ca_topic_score_gemma":6.5610334e-7,"teacher_disagreement_score":0.57484865,"about_ca_system_score_codex":0.00012231227,"about_ca_system_score_gemma":0.00014643554,"threshold_uncertainty_score":0.9998213},"labels":[],"label_agreement":null},{"id":"W2765746319","doi":"10.23638/dmtcs-20-1-20","title":"Permutation complexity of images of Sturmian words by marked morphisms","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Permutation (music); Mathematics; Combinatorics; Pure mathematics; Art","score_opus":0.019732605636758344,"score_gpt":0.276199733789977,"score_spread":0.25646712815321865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765746319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06723645,0.000091706344,0.9278624,0.00044504539,0.00065874145,0.0004988219,0.00012668245,0.00016610074,0.0029140709],"genre_scores_gemma":[0.6187712,0.0000090851445,0.38104513,0.000060104674,0.000058426005,0.000011709704,0.000016328548,0.000019771469,0.0000082172755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99489933,0.00026057527,0.0012480839,0.0012254115,0.0016959729,0.00067065225],"domain_scores_gemma":[0.9949251,0.00053449476,0.0010287975,0.0025217638,0.0007122335,0.00027760997],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033005867,0.00054850144,0.0010373527,0.000359844,0.0002333434,0.0004885957,0.0063467277,0.0002204088,0.000102322454],"category_scores_gemma":[0.00026280404,0.00044683655,0.00031366298,0.0009083296,0.013191651,0.00051406096,0.0062087155,0.00046870325,0.000017235321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098353285,0.00023005372,0.000016991436,0.0004625878,0.000036959183,0.000003931372,0.0026972997,0.000054056134,0.0042111953,0.98929894,0.0002957728,0.0026823774],"study_design_scores_gemma":[0.0001400846,0.00013209604,0.00012775128,0.00037757735,0.000025311685,0.000010026333,0.00004678087,0.43974203,0.020154553,0.53893834,0.000003842726,0.00030162098],"about_ca_topic_score_codex":0.000011692008,"about_ca_topic_score_gemma":4.5034855e-7,"teacher_disagreement_score":0.5515348,"about_ca_system_score_codex":0.000071942486,"about_ca_system_score_gemma":0.00026075487,"threshold_uncertainty_score":0.99979836},"labels":[],"label_agreement":null},{"id":"W2766426016","doi":"10.1016/j.dam.2018.12.028","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e556\" altimg=\"si21.gif\"><mml:mi>k</mml:mi></mml:math>-foldability of words","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bijection; Catalan number; Combinatorics; Mathematics; Word (group theory); Tree (set theory); Alphabet; Complement (music); Discrete mathematics; Geometry","score_opus":0.012423472672947664,"score_gpt":0.2340378134522046,"score_spread":0.22161434077925693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766426016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95338553,0.00011567776,0.036295075,0.00013462959,0.00047283832,0.00019640104,0.00008346993,0.000301445,0.009014954],"genre_scores_gemma":[0.9548674,0.000048205027,0.044097107,0.00034934795,0.00018387717,0.00016139194,0.000078131045,0.00011185837,0.00010263095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963285,0.00005037498,0.0009991678,0.0008388265,0.0010115148,0.00077165617],"domain_scores_gemma":[0.9958637,0.0006674611,0.0008047648,0.0023607793,0.0000630604,0.0002402593],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011913177,0.0004798533,0.00049776444,0.0001159418,0.0002483558,0.00031206702,0.0017074696,0.000414679,0.000077164426],"category_scores_gemma":[0.00015786375,0.00048835005,0.0004406373,0.00045727252,0.00031747983,0.0005073951,0.001201069,0.00044616914,0.0012321679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005720351,0.00024072097,0.000011292133,0.000827904,0.0001405042,0.000020843157,0.0023900475,0.00024822462,0.0049556135,0.98946136,0.00021384044,0.0014324521],"study_design_scores_gemma":[0.000711935,0.0001979685,0.00007372657,0.00029868446,0.00012299663,0.00005624315,0.0009915951,0.9489603,0.014506568,0.03275109,0.0007810267,0.00054785487],"about_ca_topic_score_codex":0.000044519773,"about_ca_topic_score_gemma":0.000013486911,"teacher_disagreement_score":0.9567103,"about_ca_system_score_codex":0.00002495982,"about_ca_system_score_gemma":0.00020912403,"threshold_uncertainty_score":0.9997568},"labels":[],"label_agreement":null},{"id":"W2766804132","doi":"10.1007/978-3-319-94631-3_7","title":"A New Technique for Reachability of States in Concatenation Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concatenation (mathematics); Reachability; Computer science; Automaton; Mathematical proof; Theoretical computer science; State (computer science); Finite-state machine; Algorithm; Discrete mathematics; Mathematics; Combinatorics","score_opus":0.015007128737231968,"score_gpt":0.2591802567197418,"score_spread":0.24417312798250984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766804132","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021400295,0.00010530089,0.99715483,0.00049643364,0.00057271455,0.00096470735,0.000015573927,0.0001175389,0.00035892185],"genre_scores_gemma":[0.06872366,0.000016008633,0.93036026,0.00038266034,0.00020533787,0.000036964208,0.000014343168,0.000027553197,0.00023319272],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690217,0.00004819991,0.0007781601,0.001227604,0.0005964744,0.00044738073],"domain_scores_gemma":[0.99693555,0.00080990145,0.00038900002,0.0014668157,0.00029834232,0.000100385885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027273064,0.00036197322,0.0005885985,0.0007709533,0.000070998394,0.00015316562,0.0029364778,0.0002954088,0.000024222945],"category_scores_gemma":[0.00022018726,0.00031622892,0.0001215682,0.0005403079,0.00055792485,0.00051152514,0.000835675,0.00032283086,0.0000067873157],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030316774,0.00008140757,0.00008744177,0.0002083941,0.00001251969,0.000015126129,0.0026624245,0.0027815616,0.005361941,0.072572805,0.00016441164,0.91602165],"study_design_scores_gemma":[0.000295106,0.00025373726,0.00012069442,0.00034860903,0.0000027926856,0.000014112585,2.4364422e-7,0.3630483,0.019384436,0.61572486,0.0005034215,0.0003037212],"about_ca_topic_score_codex":0.00012033732,"about_ca_topic_score_gemma":0.00014133357,"teacher_disagreement_score":0.91571796,"about_ca_system_score_codex":0.0002574235,"about_ca_system_score_gemma":0.00068061467,"threshold_uncertainty_score":0.99992895},"labels":[],"label_agreement":null},{"id":"W2768476682","doi":"10.1016/j.tcs.2018.04.039","title":"Avoidance bases for formulas with reversal","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Index (typography); Subject (documents); Mathematics; Combinatorics; Computer science","score_opus":0.011948554639043669,"score_gpt":0.25296535695797273,"score_spread":0.24101680231892905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768476682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017652186,0.000052191135,0.97641915,0.0012661711,0.0016906841,0.00070544967,0.000024207719,0.00056154246,0.001628432],"genre_scores_gemma":[0.5136705,0.000004435266,0.48459393,0.0011388181,0.0004885037,0.00005742408,0.000004401245,0.00002102307,0.000020944422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955044,0.000107930995,0.0004215379,0.0019239335,0.0009952933,0.0010469367],"domain_scores_gemma":[0.99572295,0.0006512065,0.00024355075,0.0024291473,0.0005727856,0.00038038354],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023833173,0.00050558866,0.00052933313,0.0002613728,0.0006351634,0.0011992665,0.0068268236,0.00018051587,0.000033533815],"category_scores_gemma":[0.00014858106,0.0003708127,0.00017408085,0.00071643223,0.005040589,0.0007325391,0.005289669,0.0004676989,0.00005793304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039345632,0.00006238534,0.000011052942,0.00007663966,0.000013898866,0.000012018253,0.00033956685,0.00022595494,0.000089740606,0.9831961,0.0006824732,0.015250849],"study_design_scores_gemma":[0.0002746749,0.00047614885,0.00007944022,0.00025656397,0.000013926741,0.000038176284,0.0000035769287,0.5484971,0.0042942413,0.44501093,0.00058188225,0.00047337142],"about_ca_topic_score_codex":0.000004449779,"about_ca_topic_score_gemma":0.0000013513745,"teacher_disagreement_score":0.5482711,"about_ca_system_score_codex":0.0001280169,"about_ca_system_score_gemma":0.00059752923,"threshold_uncertainty_score":0.99987435},"labels":[],"label_agreement":null},{"id":"W2769915601","doi":"10.1007/978-3-319-94631-3_4","title":"Most Complex Deterministic Union-Free Regular Languages","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Regular expression; Mathematics; Discrete mathematics; Nondeterministic finite automaton; State (computer science); Automaton; Star (game theory); Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm; Programming language","score_opus":0.016876873437716863,"score_gpt":0.27262869384931837,"score_spread":0.2557518204116015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769915601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017688766,0.00030746602,0.97638196,0.0018623077,0.0027257525,0.00037471048,0.00002181623,0.00050024583,0.00013699423],"genre_scores_gemma":[0.58424985,0.000009825594,0.41333935,0.0017774757,0.0005719939,0.000015547977,0.000012751512,0.000020436017,0.000002774043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503964,0.00026705206,0.0005751407,0.0020925405,0.0010533709,0.0009722287],"domain_scores_gemma":[0.9938731,0.00061220204,0.00032680502,0.0046354523,0.00031952103,0.00023288366],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018995687,0.0005924258,0.0006065856,0.00053658424,0.00036702058,0.0013419829,0.011679669,0.0003268706,0.000027807051],"category_scores_gemma":[0.0005676155,0.0005309618,0.000118462776,0.0020245856,0.0012905665,0.00046487906,0.012897004,0.0008167839,0.000047803303],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007785059,0.00017409636,0.00071593735,0.00020193215,0.000025580382,0.00039523563,0.0025247748,0.03432762,0.0021683834,0.0052221846,0.0008088089,0.9534277],"study_design_scores_gemma":[0.00026512757,0.00011462829,0.003712031,0.00032129514,0.0000068183085,0.00009924748,0.0000011554904,0.8075687,0.003753652,0.18329,0.0002165338,0.0006507935],"about_ca_topic_score_codex":0.00012921814,"about_ca_topic_score_gemma":0.00007546015,"teacher_disagreement_score":0.95277685,"about_ca_system_score_codex":0.00023827987,"about_ca_system_score_gemma":0.00071695715,"threshold_uncertainty_score":0.9997142},"labels":[],"label_agreement":null},{"id":"W2770859862","doi":"10.37236/1671","title":"There Are Ternary Circular Square-Free Words of Length $n$ for $n\\ge 18$","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Ternary operation; Combinatorics; Square (algebra); Geometry; Computer science","score_opus":0.01556969058956936,"score_gpt":0.22256243941455833,"score_spread":0.20699274882498897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770859862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.426359,0.04720258,0.5182015,0.0051313927,0.0014220522,0.00041977345,0.0000062726394,0.00008588729,0.0011715736],"genre_scores_gemma":[0.998369,0.00092634157,0.0001516479,0.000120286466,0.00012189679,0.00000434163,2.2114409e-7,0.000021279648,0.0002850133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981364,0.00015941495,0.00049695815,0.00015748198,0.00050582393,0.00054393517],"domain_scores_gemma":[0.9976894,0.00038157616,0.00077244936,0.0008542462,0.00023009065,0.000072226925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014113376,0.00017755378,0.0003608244,0.0001177849,0.00013417032,0.000060960516,0.0028893473,0.00007455754,0.000027394193],"category_scores_gemma":[0.00010391018,0.00012127749,0.00028133058,0.00041494946,0.00006403985,0.0003334704,0.00017767471,0.00048569642,0.000004075478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003187917,0.0003273418,0.00040546677,0.00005685428,0.00023499649,0.000023947667,0.0010266895,0.00009428849,0.0004675711,0.9873982,0.004669967,0.005262808],"study_design_scores_gemma":[0.00176814,0.001040239,0.00050709804,0.00010030192,0.00007079644,0.0002806936,0.00026455717,0.013874369,0.002579047,0.97371423,0.0055915164,0.00020898902],"about_ca_topic_score_codex":0.0000034367836,"about_ca_topic_score_gemma":0.0000010568015,"teacher_disagreement_score":0.57201,"about_ca_system_score_codex":0.00017019839,"about_ca_system_score_gemma":0.0001219732,"threshold_uncertainty_score":0.53691745},"labels":[],"label_agreement":null},{"id":"W2771131742","doi":"10.1007/s00224-018-9871-4","title":"Better Complexity Bounds for Cost Register Automata","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Register (sociolinguistics); Computer science; Automaton; Register allocation; Theoretical computer science; Arithmetic; Parallel computing; Mathematics; Programming language","score_opus":0.05901425934316849,"score_gpt":0.2955452278681961,"score_spread":0.23653096852502759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771131742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094664946,0.0001149942,0.89654624,0.0002736734,0.0020117133,0.0005568938,0.000015600881,0.00048986956,0.0053260927],"genre_scores_gemma":[0.97634476,4.8776366e-7,0.021965323,0.0004855585,0.0007268988,0.0000133282265,0.0000069857847,0.000024752117,0.00043191717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978164,0.00036358906,0.0005945046,0.0004679032,0.00029790628,0.0004597104],"domain_scores_gemma":[0.99724865,0.00075909065,0.00043756023,0.0012196571,0.00024475064,0.000090307294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030935127,0.00022257262,0.0004613351,0.00012554851,0.00031500758,0.0002321259,0.0015672187,0.00008799206,0.000009639244],"category_scores_gemma":[0.00007983511,0.00019633344,0.000140195,0.0002354807,0.00052980747,0.00024639716,0.00039424852,0.00009494785,0.000055914606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000332155,0.000057393052,0.000102226404,0.0001700755,0.000052020332,0.0000019245244,0.00162645,0.0000252303,0.0007267817,0.9716445,0.0050821775,0.020477973],"study_design_scores_gemma":[0.0016940826,0.00054782804,0.0023734048,0.0006895795,0.00003293639,0.00013554237,0.0002875392,0.72053033,0.003300467,0.23700821,0.032707483,0.00069256907],"about_ca_topic_score_codex":0.000023734217,"about_ca_topic_score_gemma":0.000001556481,"teacher_disagreement_score":0.8816798,"about_ca_system_score_codex":0.00004874157,"about_ca_system_score_gemma":0.000049465485,"threshold_uncertainty_score":0.8006245},"labels":[],"label_agreement":null},{"id":"W2771270479","doi":"10.1016/j.tcs.2018.04.019","title":"Leaf realization problem, caterpillar graphs and prefix normal words","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bijection; Simple graph; Prefix; Discrete mathematics; Graph; Simple (philosophy); Natural number; Realization (probability)","score_opus":0.006163145191917235,"score_gpt":0.22559021252530242,"score_spread":0.21942706733338518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771270479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10800148,0.00003228506,0.8860053,0.00068807596,0.00042189698,0.00015440834,0.0000011624863,0.00035635507,0.004339064],"genre_scores_gemma":[0.8929697,0.000009977315,0.10589267,0.000984946,0.000112152135,0.000005688058,9.596683e-7,0.0000084334215,0.000015462327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977143,0.000105873885,0.00026343815,0.00078367133,0.0005447811,0.0005879422],"domain_scores_gemma":[0.99851686,0.000098274155,0.00007436852,0.0007719865,0.00019715745,0.00034138223],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014992526,0.00019178855,0.00017556324,0.00021046102,0.0005924519,0.0006604801,0.0017419027,0.00006051004,0.00003206447],"category_scores_gemma":[0.000056439785,0.00015165347,0.00003546205,0.0012471409,0.0043134387,0.0010812969,0.0012815973,0.0001190212,0.00005535756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005774129,0.000025878106,0.0001737693,0.0000074041013,0.000002507155,0.0000040035075,0.001057034,0.000006878172,0.00080460333,0.9608402,0.00012019247,0.036951702],"study_design_scores_gemma":[0.00021205221,0.00040184686,0.001396114,0.000042639087,0.000004649899,0.000091174996,0.0000075172484,0.32200363,0.0070610223,0.668134,0.0003602523,0.0002851299],"about_ca_topic_score_codex":0.000008191629,"about_ca_topic_score_gemma":0.0000012868754,"teacher_disagreement_score":0.78496826,"about_ca_system_score_codex":0.000028368737,"about_ca_system_score_gemma":0.000096670105,"threshold_uncertainty_score":0.9983963},"labels":[],"label_agreement":null},{"id":"W2782891332","doi":"10.1016/j.tcs.2018.10.017","title":"Critical exponents of infinite balanced words","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Exponent; Critical exponent; Construct (python library); Word (group theory); Mathematics; Discrete mathematics; Combinatorics; Computer science; Scaling; Geometry","score_opus":0.015274009070791862,"score_gpt":0.28262871418596985,"score_spread":0.267354705115178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782891332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07701794,0.00007660198,0.9142208,0.00066065084,0.0035043238,0.00022350052,0.000014967071,0.00035371716,0.003927513],"genre_scores_gemma":[0.76584935,0.00000949766,0.23328564,0.00047586655,0.000344113,0.000012599533,0.0000024825601,0.000015546615,0.000004892389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99489117,0.00027055672,0.00076238834,0.0016089207,0.001507933,0.00095905777],"domain_scores_gemma":[0.99500823,0.000837416,0.00024509145,0.0028053946,0.0006522899,0.00045159383],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0028159812,0.0004619711,0.0006931043,0.00043292533,0.0002849447,0.000717184,0.008305403,0.00026485437,0.00013641128],"category_scores_gemma":[0.00055502687,0.00039459352,0.00021916491,0.0010957646,0.010184379,0.00064292055,0.012307814,0.00067823974,0.00012547772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001238526,0.00011989381,0.000063432926,0.00007567534,0.000009976323,0.000016259437,0.00062006764,0.000056354962,0.00056040596,0.9821606,0.00010907789,0.01619586],"study_design_scores_gemma":[0.00014892338,0.00018946924,0.00092519296,0.0003194262,0.0000096294525,0.00002026799,0.0000041275434,0.41189235,0.0063742474,0.5796963,0.000038595586,0.0003814592],"about_ca_topic_score_codex":0.0000051674533,"about_ca_topic_score_gemma":1.5206831e-7,"teacher_disagreement_score":0.68883145,"about_ca_system_score_codex":0.00008262604,"about_ca_system_score_gemma":0.0004177377,"threshold_uncertainty_score":0.9998506},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020012000271576177,"score_gpt":0.32110049861142975,"score_spread":0.30108849833985357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786516640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42258662,0.000034314977,0.573899,0.002458834,0.0005802387,0.00005927449,0.0000018452997,0.0000068379086,0.0003730448],"genre_scores_gemma":[0.83891344,0.000009175461,0.16081744,0.00016009403,0.00008009828,7.7537965e-7,6.601872e-7,0.0000021984001,0.000016112706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814874,0.000049658713,0.00056480535,0.00014591604,0.00094913517,0.0001417357],"domain_scores_gemma":[0.997526,0.00016989089,0.0003758504,0.0002792968,0.0015871804,0.0000617874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009455902,0.000070507456,0.00016689491,0.00063153706,0.00003926563,0.00018815146,0.0030560037,0.000019027213,0.00007609857],"category_scores_gemma":[0.000079940684,0.00006078355,0.00006137758,0.000758235,0.00037044505,0.0023138553,0.0004061298,0.00009921287,0.000010360782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017541079,0.0006864331,0.006036578,0.000026310901,0.00009491568,0.000056389636,0.0035919785,0.010686307,0.16202486,0.506346,0.0022303383,0.3082024],"study_design_scores_gemma":[0.0014644129,0.00042180863,0.24201359,0.000346461,0.000006511012,0.00051328185,0.00028942022,0.633272,0.06449486,0.05578048,0.0010967605,0.00030039743],"about_ca_topic_score_codex":0.00011082703,"about_ca_topic_score_gemma":0.000002991134,"teacher_disagreement_score":0.6225857,"about_ca_system_score_codex":0.00006472368,"about_ca_system_score_gemma":0.00029488484,"threshold_uncertainty_score":0.5678866},"labels":[],"label_agreement":null},{"id":"W2787777282","doi":"10.5539/jmr.v10n2p24","title":"Regularity and Green's Relations for Generalized Semigroups of Transformations with Invariant Set","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Semigroup; Combinatorics; Invariant (physics); Discrete mathematics; Mathematical physics","score_opus":0.08349271056879606,"score_gpt":0.35714500524810566,"score_spread":0.2736522946793096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787777282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23506951,0.0000937183,0.7622813,0.0017748886,0.000031950975,0.00022344594,0.000010392977,0.000009663227,0.00050511287],"genre_scores_gemma":[0.4610936,0.00003747104,0.5385401,0.000024765197,0.000085601736,0.000007271334,0.0000010965688,0.000009696389,0.00020034441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984752,0.000118658696,0.0004903138,0.000096230535,0.00061829184,0.00020134091],"domain_scores_gemma":[0.9976617,0.00067525945,0.0002543925,0.0003049194,0.0010035302,0.000100197925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038338304,0.00007506582,0.00023061331,0.00030127692,0.00020599604,0.00009153834,0.00052241405,0.00005574121,0.000016190275],"category_scores_gemma":[0.00021840591,0.00005106685,0.00005874169,0.00038869795,0.00022027017,0.00050708966,0.00007967069,0.00020431024,0.0000023990888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007041893,0.0003120239,0.000089030356,0.00047639338,0.00014499202,0.000010689936,0.017487623,0.00003097455,0.008250533,0.96471196,0.0035852904,0.0048300438],"study_design_scores_gemma":[0.0020377482,0.0015855454,0.00063263846,0.0004673695,0.0000530111,0.0006108719,0.00147718,0.22498788,0.012173818,0.75414747,0.001644904,0.00018156836],"about_ca_topic_score_codex":0.000013661059,"about_ca_topic_score_gemma":0.000018387133,"teacher_disagreement_score":0.22602409,"about_ca_system_score_codex":0.000028358456,"about_ca_system_score_gemma":0.00016853493,"threshold_uncertainty_score":0.20824456},"labels":[],"label_agreement":null},{"id":"W2788443823","doi":"10.1007/978-3-319-73216-9_17","title":"Input-Position-Restricted Models of Language Acceptors","year":2018,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Nondeterministic algorithm; Position (finance); Computer science; Class (philosophy); Algorithm; Bounded function; Mathematics; Artificial intelligence","score_opus":0.044618863842752675,"score_gpt":0.27305922008322947,"score_spread":0.2284403562404768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788443823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011922691,0.0009776377,0.89138603,0.0001917851,0.00084238773,0.0003963183,0.00008873483,0.00034652825,0.09384787],"genre_scores_gemma":[0.9015602,0.0005014869,0.07302182,0.00050715794,0.00073510816,0.00002078199,0.00070230395,0.00009223328,0.022858895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983133,0.00005146281,0.00051248865,0.0005233628,0.00039302494,0.0002063624],"domain_scores_gemma":[0.99878085,0.000081209044,0.00041906963,0.00040798757,0.00021036694,0.00010053458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015292138,0.0003062932,0.00039347986,0.00027732793,0.00017471373,0.000077342585,0.0005910503,0.00019366085,0.00046588862],"category_scores_gemma":[0.0000074720833,0.0003136767,0.000121562516,0.00016476976,0.00026424133,0.0004611556,0.0003530606,0.00018983666,0.000049362094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015947246,0.000045256475,0.0000031632198,0.00008909743,0.000078230936,0.0000082673405,0.0023160407,0.0006314738,0.00017413993,0.96081656,0.005622313,0.030199502],"study_design_scores_gemma":[0.00020910136,0.00016020985,0.00020261783,0.00013715232,0.000029033728,0.000013179422,0.000055992918,0.3042754,0.00015710956,0.6934227,0.0009520034,0.00038552858],"about_ca_topic_score_codex":0.000064971486,"about_ca_topic_score_gemma":0.00001490271,"teacher_disagreement_score":0.88963753,"about_ca_system_score_codex":0.000024653618,"about_ca_system_score_gemma":0.000061544844,"threshold_uncertainty_score":0.9999315},"labels":[],"label_agreement":null},{"id":"W2788967239","doi":"10.1090/tran/7762","title":"Becker’s conjecture on Mahler functions","year":2019,"lang":"en","type":"preprint","venue":"Transactions of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Integer (computer science); Polynomial; Combinatorics; Rational function; Function (biology); Power series; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.015532435128295144,"score_gpt":0.251137186422282,"score_spread":0.23560475129398686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788967239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022912806,0.000038225724,0.9676985,0.006404837,0.0005860631,0.0004716141,0.00008277076,0.00023391597,0.0015712632],"genre_scores_gemma":[0.9336461,0.0000465617,0.060801283,0.0015024034,0.00007821571,0.00008223173,0.000004749254,0.00004590061,0.00379258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981352,0.00012885526,0.00041156908,0.0005157581,0.00050515437,0.00030347175],"domain_scores_gemma":[0.996778,0.0004835996,0.000454884,0.0021359257,0.00006434964,0.000083245504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029261806,0.0003269197,0.0006310613,0.00004076854,0.00018837061,0.000085266365,0.0018634716,0.00016134133,0.00018089691],"category_scores_gemma":[0.000021371485,0.00021604035,0.0012789087,0.00043707137,0.0003767392,0.00008026632,0.0002493505,0.0010080746,0.00015720229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016473232,0.008385222,0.00025863922,0.0058594723,0.007439831,0.0000079562815,0.030283809,0.2591257,0.0049489615,0.39350674,0.110275865,0.17974305],"study_design_scores_gemma":[0.0010529053,0.000723914,0.001822478,0.001436066,0.0007836805,0.00007092081,0.0020103885,0.4763081,0.004623685,0.5049469,0.0043131374,0.0019078507],"about_ca_topic_score_codex":0.00006361734,"about_ca_topic_score_gemma":0.000001757483,"teacher_disagreement_score":0.9107333,"about_ca_system_score_codex":0.00017857183,"about_ca_system_score_gemma":0.00014721848,"threshold_uncertainty_score":0.880987},"labels":[],"label_agreement":null},{"id":"W2790789623","doi":"","title":"Hereditary hemimorphy of {5, -4}-hemimorphic arc connected digraphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arc (geometry); Mathematics; Combinatorics; Geometry","score_opus":0.009607700113445904,"score_gpt":0.21796445153209554,"score_spread":0.20835675141864962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790789623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98684675,0.00034280942,0.0018273091,0.00038790144,0.0033904817,0.0001616895,0.000007992287,0.000409263,0.006625797],"genre_scores_gemma":[0.99717987,0.000013439625,0.0023672665,0.00028076203,0.000043207438,0.000010722104,0.000006695789,0.00001832904,0.00007973447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983639,0.000085339016,0.0003640509,0.0004487539,0.0003528947,0.00038506763],"domain_scores_gemma":[0.9981163,0.0002764471,0.00018352289,0.0010586127,0.00022876658,0.0001363362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036532525,0.00020923396,0.00030725787,0.00015344637,0.00012535801,0.000053437594,0.0013625695,0.000105127154,0.00011236501],"category_scores_gemma":[0.00011900463,0.00019837757,0.00012511773,0.0008364127,0.0002959109,0.0004029887,0.00037139154,0.00015173406,0.00011767284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012878005,0.00016745474,0.0013637145,0.00002682937,0.00004663299,0.000029590796,0.0003964313,4.8412153e-7,0.009205757,0.97563183,0.010702973,0.0024153988],"study_design_scores_gemma":[0.0010215202,0.0003894465,0.0053576757,0.00009358781,0.000014157764,0.000047856312,0.000052265226,0.002368885,0.09076453,0.8978065,0.0017186283,0.00036494542],"about_ca_topic_score_codex":0.000059085876,"about_ca_topic_score_gemma":0.000004646708,"teacher_disagreement_score":0.08155877,"about_ca_system_score_codex":0.000023380979,"about_ca_system_score_gemma":0.00008633978,"threshold_uncertainty_score":0.80896026},"labels":[],"label_agreement":null},{"id":"W2791126244","doi":"10.23638/lmcs-15(1:11)2019","title":"The Subpower Membership Problem for Finite Algebras with Cube Terms","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; Austrian Science Fund; National Science Foundation","keywords":"Mathematics; Subalgebra; Variety (cybernetics); Tuple; Constraint satisfaction problem; Finite set; Cube (algebra); Combinatorics; Set (abstract data type); Discrete mathematics; Direct product; Product (mathematics); Algebra over a field; Pure mathematics; Computer science","score_opus":0.06249495354962712,"score_gpt":0.36465759795693997,"score_spread":0.30216264440731283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791126244","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018273267,0.00021364886,0.9905211,0.0016373107,0.0028711366,0.0014536637,0.0000044008893,0.0002700402,0.0012013871],"genre_scores_gemma":[0.04728418,0.000024439216,0.9509834,0.0011231115,0.00020405606,0.00025557406,0.000002081751,0.000021899323,0.000101236205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941374,0.0008417609,0.0006931431,0.0022414734,0.0008752542,0.0012109444],"domain_scores_gemma":[0.9898961,0.006554465,0.0004408443,0.0026383987,0.00024308052,0.00022709588],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.011836331,0.00054951175,0.00068874675,0.00027200405,0.00049751264,0.0019819106,0.0093461145,0.00030160873,0.000007850077],"category_scores_gemma":[0.000410211,0.00030317294,0.0002132075,0.0013035317,0.0012121727,0.0005587667,0.0063846144,0.0010508909,0.000016115475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056035184,0.00017099394,0.00066204974,0.0001674961,0.000032542153,0.000033809654,0.0011561671,0.030911187,0.00027965233,0.35739338,0.00014649723,0.6089902],"study_design_scores_gemma":[0.00027819874,0.0002575231,0.0016515772,0.00019225656,0.0000061219703,0.00002043958,0.0000065610384,0.5879402,0.00075248623,0.40705022,0.0013896876,0.0004547358],"about_ca_topic_score_codex":0.000012079537,"about_ca_topic_score_gemma":0.0000062593017,"teacher_disagreement_score":0.60853547,"about_ca_system_score_codex":0.00015869751,"about_ca_system_score_gemma":0.00044734255,"threshold_uncertainty_score":0.99994206},"labels":[],"label_agreement":null},{"id":"W2793662473","doi":"10.4230/lipics.stacs.2018.54","title":"Sums of Palindromes: an Approach via Automata","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Natural number; Automaton; Base (topology); Representation (politics); Combinatorics; Constant (computer programming); Mathematics; Natural (archaeology); Discrete mathematics; Computer science; Theoretical computer science","score_opus":0.016344549135428415,"score_gpt":0.26225920579889506,"score_spread":0.24591465666346665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793662473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2372081,0.000029586592,0.7527116,0.000090428715,0.0009205973,0.0007787402,0.0002252198,0.00054861594,0.0074871504],"genre_scores_gemma":[0.864177,0.000009724588,0.13440612,0.00067861006,0.0002125953,0.000062245475,0.0002869616,0.00004284702,0.00012389707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683136,0.000067495006,0.0012477882,0.00041151413,0.0006273738,0.00081445434],"domain_scores_gemma":[0.99671346,0.000109537985,0.00059942866,0.0019385512,0.00036017856,0.00027886318],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011039027,0.00042601934,0.00058106607,0.00032773343,0.0003090301,0.00034169038,0.0027618501,0.00025208775,0.000036852354],"category_scores_gemma":[0.00005642808,0.00036291318,0.0002442482,0.00053811294,0.00034829328,0.0028988977,0.0007071823,0.0002603018,0.00015084745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005158081,0.005207084,0.010187434,0.004318188,0.001252878,0.000026221825,0.11998142,0.00020977418,0.0039939974,0.47001556,0.016496906,0.36779472],"study_design_scores_gemma":[0.0034375752,0.0012126494,0.0018621983,0.00016091642,0.000046428395,0.00022356848,0.0015575015,0.95455414,0.0087543,0.00822601,0.018992523,0.0009721816],"about_ca_topic_score_codex":0.000026743443,"about_ca_topic_score_gemma":0.000005384785,"teacher_disagreement_score":0.9543444,"about_ca_system_score_codex":0.000062717576,"about_ca_system_score_gemma":0.00009004835,"threshold_uncertainty_score":0.9998823},"labels":[],"label_agreement":null},{"id":"W2794110009","doi":"10.1515/udt-2017-0013","title":"Palindromic Closures and Thue-Morse Substitution for Markoff Numbers","year":2017,"lang":"en","type":"article","venue":"Uniform distribution theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Closure (psychology); Palindrome; Iterated function; Substitution (logic); Mathematics; Fibonacci number; Combinatorics; Word (group theory); Morse code; State (computer science); Discrete mathematics; Computer science; Algorithm; Geometry; Mathematical analysis","score_opus":0.011275225272347702,"score_gpt":0.25504062010601153,"score_spread":0.24376539483366383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794110009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26748565,0.00015317759,0.7284408,0.00048408483,0.0005648149,0.00031225744,0.00026159122,0.00019491673,0.002102712],"genre_scores_gemma":[0.9976923,0.000041468524,0.0015523345,0.00010272537,0.00009000059,0.000028501108,0.0001785698,0.0000081132375,0.00030602253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989436,0.000057713667,0.00021199822,0.00033696127,0.00014092165,0.00030880468],"domain_scores_gemma":[0.9986131,0.00016129269,0.00021562744,0.00083077536,0.00007380737,0.000105377265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011972026,0.00016247685,0.00016388706,0.000036884197,0.0009812522,0.0004341478,0.0007989259,0.00010446616,0.000018516912],"category_scores_gemma":[0.00028233492,0.00014271509,0.00008953163,0.000050232047,0.00029309563,0.00085778686,0.0002237293,0.000094655086,0.000023213428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004766241,0.000027269305,0.00048694367,0.0000195937,0.000016983655,0.0000039020574,0.00007506029,0.0000041670037,0.00020408572,0.9791494,0.0006648292,0.019300075],"study_design_scores_gemma":[0.0015177054,0.00010714587,0.030699287,0.00007307747,0.00003953575,0.00007522181,0.00013634186,0.014571846,0.006628406,0.92502046,0.020652428,0.00047853452],"about_ca_topic_score_codex":0.000019191491,"about_ca_topic_score_gemma":0.000007264446,"teacher_disagreement_score":0.7302066,"about_ca_system_score_codex":0.0000674792,"about_ca_system_score_gemma":0.00005209426,"threshold_uncertainty_score":0.7547097},"labels":[],"label_agreement":null},{"id":"W2795834488","doi":"10.1142/s0218196718500285","title":"Birecurrent sets","year":2018,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Series (stratigraphy); Set (abstract data type); Automaton; Representation (politics); Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Theoretical computer science; Computer science","score_opus":0.01246235517186945,"score_gpt":0.2920277872573106,"score_spread":0.27956543208544116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795834488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44340605,0.00014011365,0.5530864,0.0013731616,0.0016505534,0.000016760147,6.1964226e-7,0.00001829896,0.00030806204],"genre_scores_gemma":[0.9841478,0.000026742287,0.015098251,0.00037668637,0.00033851786,2.6552152e-7,9.3294693e-7,0.0000026285754,0.000008160839],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993202,0.000030189682,0.00021717216,0.00008436526,0.0002843094,0.000063745465],"domain_scores_gemma":[0.9992361,0.000057848116,0.00019633604,0.000047159956,0.0004153997,0.000047124617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021026892,0.0000538966,0.000071409275,0.00014287833,0.000036624595,0.0001527585,0.00037198985,0.000018621,0.000011306679],"category_scores_gemma":[0.000022889844,0.00004451898,0.000036340713,0.0000754655,0.000039915943,0.00047462198,0.00008383044,0.000056138757,0.000014149531],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023129101,0.000058984107,0.0005279739,0.0000023869495,0.00006773324,0.000031276588,0.001014707,0.000046034937,0.00058072654,0.08894393,0.0015388456,0.9071643],"study_design_scores_gemma":[0.0019418303,0.0009338077,0.048415814,0.00020848808,0.000020616628,0.001875691,0.00016616334,0.3316643,0.0062839477,0.59964836,0.008505712,0.00033525727],"about_ca_topic_score_codex":0.0000019183026,"about_ca_topic_score_gemma":5.4655425e-7,"teacher_disagreement_score":0.906829,"about_ca_system_score_codex":0.000019936217,"about_ca_system_score_gemma":0.00003275067,"threshold_uncertainty_score":0.18154314},"labels":[],"label_agreement":null},{"id":"W2797999682","doi":"10.1142/s0129054118400099","title":"State Complexity of Neighbourhoods and Approximate Pattern Matching","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Neighbourhood (mathematics); Mathematics; Combinatorics; Upper and lower bounds; Deterministic finite automaton; State (computer science); Nondeterministic algorithm; String (physics); Discrete mathematics; Finite-state machine; Set (abstract data type); Computer science; Algorithm","score_opus":0.026187599199695585,"score_gpt":0.303750500253681,"score_spread":0.2775629010539854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797999682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3292669,0.000015440079,0.66912466,0.0005234512,0.00086578086,0.000028262471,0.000004126139,0.000008990116,0.00016240968],"genre_scores_gemma":[0.8246814,0.000010624426,0.17503724,0.00013767205,0.00012626202,2.8738734e-7,4.3281833e-7,0.0000028100674,0.0000032871865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825495,0.000043701883,0.0005821967,0.00018339956,0.0007892393,0.0001465346],"domain_scores_gemma":[0.99730337,0.00011701125,0.00075299205,0.00026273087,0.0014823723,0.00008152422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011224555,0.00009128337,0.0001880898,0.00045646337,0.00010953481,0.00026371132,0.0022194537,0.00001560261,0.000017460257],"category_scores_gemma":[0.000043545435,0.00007819444,0.00006199276,0.00036357864,0.0011945682,0.001667572,0.0006040419,0.00008920567,0.0000024911922],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034569235,0.00035566228,0.0044153854,0.00003300895,0.00015056746,0.000018797115,0.006764596,0.0010891557,0.020262009,0.31869805,0.000106727704,0.64807147],"study_design_scores_gemma":[0.00089279993,0.0005460739,0.07168898,0.00029694638,0.000011088697,0.00052018807,0.00006613698,0.59078616,0.02884301,0.30592543,0.00019180383,0.00023139229],"about_ca_topic_score_codex":0.000037950147,"about_ca_topic_score_gemma":0.000004739445,"teacher_disagreement_score":0.6478401,"about_ca_system_score_codex":0.000038627823,"about_ca_system_score_gemma":0.00020481258,"threshold_uncertainty_score":0.44014364},"labels":[],"label_agreement":null},{"id":"W2798578734","doi":"","title":"Nonlinear Weighted Finite Automata","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Nonlinear system; Computer science; Automaton; Finite-state machine; Algorithm; Theoretical computer science; Physics","score_opus":0.08505758686459591,"score_gpt":0.3371786691107923,"score_spread":0.2521210822461964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798578734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023721773,0.0000071919694,0.98240834,0.0019844498,0.0010640514,0.00007760475,0.0001479081,0.00014000839,0.011798256],"genre_scores_gemma":[0.82646567,0.0000988329,0.17181796,0.0008978982,0.00032078163,0.0000071056797,0.000036661404,0.0000094444995,0.00034565025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986274,0.0000574044,0.00034143325,0.0003939731,0.0003554032,0.00022436463],"domain_scores_gemma":[0.9987021,0.00037239917,0.000106655185,0.00032293057,0.00039267933,0.000103240214],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002779769,0.00016117463,0.00013582928,0.00014375117,0.00016072663,0.00043512482,0.0008037296,0.000060835315,0.00052692916],"category_scores_gemma":[0.00024861383,0.00014623706,0.000025179044,0.00015947054,0.00027662478,0.00026333722,0.00019186185,0.00013490678,0.0007799483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022999528,0.00006175852,0.000010801903,0.0000018419928,0.000011351535,0.000014808898,0.0002559392,0.0000032631483,0.00030753744,0.729224,0.00029623366,0.26978943],"study_design_scores_gemma":[0.000022632383,0.00019267436,0.000054091346,0.000024190807,0.0000024377055,0.000008284365,0.000070222115,0.6192563,0.0043505654,0.37432644,0.001562574,0.00012958508],"about_ca_topic_score_codex":0.000028332772,"about_ca_topic_score_gemma":0.000038314978,"teacher_disagreement_score":0.8240935,"about_ca_system_score_codex":0.000022737819,"about_ca_system_score_gemma":0.000071363604,"threshold_uncertainty_score":0.99999803},"labels":[],"label_agreement":null},{"id":"W2798699651","doi":"10.1142/s0129054120410014","title":"Additive Number Theory via Approximation by Regular Languages","year":2020,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Natural number; Mathematics; Base (topology); Formal language; Regular language; Number theory; Discrete mathematics; Automaton; Representation (politics); Combinatorics; Computer science; Theoretical computer science; Algorithm","score_opus":0.008711594732859467,"score_gpt":0.27563610870373884,"score_spread":0.26692451397087935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798699651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010087765,0.00003807862,0.9853322,0.0031169748,0.00060917286,0.000051850177,0.00003016389,0.00003098261,0.0007028402],"genre_scores_gemma":[0.79633117,0.000010707399,0.20246838,0.00086929067,0.00028062725,0.0000016551814,0.00001288232,0.0000047176104,0.000020569092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816644,0.00007726128,0.00045250877,0.00021076262,0.00096007047,0.00013297485],"domain_scores_gemma":[0.99770993,0.00026769502,0.00058119645,0.0002066967,0.0011191756,0.00011531691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077487057,0.000097849224,0.0001536581,0.00017591377,0.000088626315,0.00028819763,0.0027022099,0.00002531869,0.00020594904],"category_scores_gemma":[0.00022430837,0.00008545482,0.00009425154,0.00052273844,0.000304056,0.002275766,0.0003301242,0.00011958368,0.00003305873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004024476,0.0002274015,0.00013982679,0.000009521921,0.00014000903,0.00003257778,0.0034477673,0.00073311466,0.020492557,0.35824108,0.01654659,0.5999493],"study_design_scores_gemma":[0.0018858996,0.00062190555,0.003486561,0.0002989977,0.000038624443,0.00089206925,0.00042536302,0.68654567,0.11255618,0.16236015,0.030197788,0.00069079734],"about_ca_topic_score_codex":0.0000026901964,"about_ca_topic_score_gemma":1.3804548e-7,"teacher_disagreement_score":0.78624344,"about_ca_system_score_codex":0.00006010813,"about_ca_system_score_gemma":0.0002071676,"threshold_uncertainty_score":0.5021423},"labels":[],"label_agreement":null},{"id":"W2798939578","doi":"10.1007/978-3-319-98654-8_19","title":"Counting Subwords and Regular Languages","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Arithmetic; Combinatorics; Word (group theory); Discrete mathematics; Mathematics; Geometry","score_opus":0.008474628084336331,"score_gpt":0.2309994693236953,"score_spread":0.22252484123935898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798939578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013124433,0.0013128641,0.9917302,0.00048333502,0.001068821,0.00016876328,0.0000030321398,0.00022483608,0.0036957148],"genre_scores_gemma":[0.24646676,0.00017268294,0.7431896,0.005295002,0.002798785,0.000009227377,0.000007977636,0.000091947215,0.001968042],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718225,0.00002613176,0.00032126217,0.0012677346,0.00066311983,0.00053951674],"domain_scores_gemma":[0.9980254,0.0003307228,0.00020008124,0.001175505,0.00014173564,0.00012655981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011057653,0.00039960188,0.00039076412,0.00047541302,0.00024914314,0.00071527576,0.0022482295,0.00024061854,0.000043738957],"category_scores_gemma":[0.000076179516,0.00035034528,0.00006589637,0.00034644667,0.0009750425,0.0005611225,0.0015650743,0.00042676405,0.000043232732],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036145514,0.00001560327,0.00011373689,0.000065546104,0.000014502163,0.00017735251,0.00191685,0.0003409729,0.00040967588,0.07316109,0.0001807683,0.9236003],"study_design_scores_gemma":[0.00034956215,0.00023054413,0.0004240103,0.00090436527,0.0000130300405,0.00033218673,0.000001487133,0.4206285,0.0031428928,0.564657,0.008045979,0.0012704701],"about_ca_topic_score_codex":0.000017123039,"about_ca_topic_score_gemma":0.00003017076,"teacher_disagreement_score":0.92232984,"about_ca_system_score_codex":0.00009840257,"about_ca_system_score_gemma":0.00018574113,"threshold_uncertainty_score":0.99989486},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Aperiodic graph; Rigidity (electromagnetism); Algebraic number; Word (group theory); Extension (predicate logic); Discrete mathematics; Class (philosophy); Graph; Computer science; Artificial intelligence","score_opus":0.014958775711966481,"score_gpt":0.29957644344810586,"score_spread":0.2846176677361394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802228513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26092732,0.000032414722,0.7357432,0.00063597364,0.0021692358,0.000024096616,0.0000012191813,0.000011664929,0.00045481618],"genre_scores_gemma":[0.82897484,0.00001528765,0.17053787,0.00013467918,0.00032591922,3.2468193e-7,2.0936311e-7,0.0000016338503,0.000009194607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985679,0.000030365289,0.00036386083,0.0001790128,0.000730482,0.00012838272],"domain_scores_gemma":[0.9975157,0.0001395505,0.00039305424,0.00022161764,0.0016422061,0.00008791511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009069304,0.00007546583,0.00012193093,0.00049413403,0.00014600718,0.00034556,0.002229369,0.000018357643,0.000017039029],"category_scores_gemma":[0.00011278465,0.00006367622,0.00005001445,0.0005417106,0.00096593855,0.002156683,0.00043505718,0.00008352398,0.000008422018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022670902,0.00019317873,0.0029106122,0.000004308973,0.00008346934,0.000029035387,0.0024737234,0.0001819679,0.005967417,0.6520903,0.0004726304,0.33557066],"study_design_scores_gemma":[0.002152795,0.0013968601,0.21332052,0.0004285699,0.000035217974,0.0028497272,0.00012175866,0.46164203,0.059533197,0.24685372,0.011015512,0.0006500726],"about_ca_topic_score_codex":0.000008452205,"about_ca_topic_score_gemma":0.000002700599,"teacher_disagreement_score":0.5680475,"about_ca_system_score_codex":0.00006326645,"about_ca_system_score_gemma":0.00033721284,"threshold_uncertainty_score":0.4142759},"labels":[],"label_agreement":null},{"id":"W2802872846","doi":"10.1142/s0129054120420010","title":"Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels","year":2020,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Regular language; Regular expression; Invariant (physics); Automaton; Alphabet; String (physics); Prefix; Decision problem; Discrete mathematics; Formal language; Mathematics; Graph; Predicate (mathematical logic); Word (group theory); Decidability; Computer science; Theoretical computer science; Algorithm; Programming language","score_opus":0.016306984253055712,"score_gpt":0.26942994187874125,"score_spread":0.25312295762568554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802872846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2710294,0.00010763445,0.7196356,0.008594756,0.00051180937,0.00004382711,0.0000043608975,0.000016667309,0.000055937544],"genre_scores_gemma":[0.8248911,0.00005509476,0.17422363,0.00070037995,0.00012093993,6.258732e-7,4.538308e-7,0.0000033777899,0.000004423232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983421,0.00004145756,0.0004117152,0.00023912147,0.00083530036,0.00013028781],"domain_scores_gemma":[0.99850565,0.0001747237,0.0003161676,0.00017837246,0.000643495,0.0001815683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066914916,0.000097098186,0.00016818775,0.00025711575,0.0001223739,0.00039031068,0.0015106008,0.00002425046,0.000014640697],"category_scores_gemma":[0.00012916714,0.00008198377,0.000051724513,0.00036543884,0.00036396197,0.001978613,0.00038113713,0.00010764572,0.0000012782849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006374723,0.00024155782,0.001940042,0.000030325056,0.0002015228,0.0000903145,0.0064986576,0.0015119348,0.19580865,0.62452984,0.0017825376,0.16730085],"study_design_scores_gemma":[0.0050798375,0.001260282,0.091423765,0.00069607445,0.00007270069,0.0011424484,0.0002204968,0.7813693,0.04520326,0.05381927,0.018875536,0.00083698786],"about_ca_topic_score_codex":0.0000067535902,"about_ca_topic_score_gemma":6.7506295e-7,"teacher_disagreement_score":0.7798574,"about_ca_system_score_codex":0.00003216623,"about_ca_system_score_gemma":0.00025634325,"threshold_uncertainty_score":0.37637746},"labels":[],"label_agreement":null},{"id":"W2803866596","doi":"10.4171/jca/39","title":"On the complexity of the cogrowth sequence","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Cayley graph; Sequence (biology); Combinatorics; Generating set of a group; Mathematics; Set (abstract data type); Graph; Group (periodic table); Finitely-generated abelian group; Discrete mathematics; Computer science","score_opus":0.058327331036721046,"score_gpt":0.26513548195462605,"score_spread":0.206808150917905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803866596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81229025,0.0006920858,0.030683191,0.08952885,0.061807554,0.0010914947,0.000060716982,0.00014202196,0.0037038578],"genre_scores_gemma":[0.99755335,0.000023759332,0.00078055076,0.000953567,0.0006635027,0.0000029152363,5.951338e-7,0.000014239186,0.0000075339967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693495,0.000610646,0.000836725,0.00026756004,0.0011338932,0.00021623672],"domain_scores_gemma":[0.9958347,0.0007223747,0.0018950644,0.001071916,0.0003614262,0.00011453706],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0013763307,0.00026969254,0.00063301896,0.00007363193,0.00015699628,0.00020812504,0.0058071413,0.00016832759,0.000027233373],"category_scores_gemma":[0.0006321542,0.00014009282,0.0005796284,0.00037283852,0.0005015897,0.00016344847,0.002142248,0.0016442945,0.000009048169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003827071,0.00009900184,0.000024789211,0.00004522445,0.000090125395,0.000017294056,0.00039794558,0.000036884132,0.0005933877,0.9946508,0.0035985543,0.00040775424],"study_design_scores_gemma":[0.00042406685,0.00022683118,0.0007755621,0.00035461938,0.000033890035,0.000032783242,0.000020462614,0.0017204754,0.006747067,0.9890079,0.00050659425,0.00014977048],"about_ca_topic_score_codex":0.000017704357,"about_ca_topic_score_gemma":4.156322e-7,"teacher_disagreement_score":0.18526311,"about_ca_system_score_codex":0.00009234396,"about_ca_system_score_gemma":0.0005445034,"threshold_uncertainty_score":0.9995719},"labels":[],"label_agreement":null},{"id":"W2804472712","doi":"10.4230/lipics.cpm.2018.6","title":"Nearest constrained circular words","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Point (geometry); Computer science; Word (group theory); Polynomial; Dynamic programming; Algorithm; Time complexity; Mathematical optimization; Mathematics; Geometry; Mathematical analysis","score_opus":0.017279605229506646,"score_gpt":0.2567727694223453,"score_spread":0.23949316419283864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804472712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09206233,0.00024615403,0.88045096,0.0007931679,0.0072189537,0.002687601,0.0016903215,0.0014957583,0.013354764],"genre_scores_gemma":[0.86242825,0.00011287383,0.12860285,0.0040142126,0.0013818549,0.00051326124,0.0021943802,0.00018278841,0.0005695135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487144,0.00009981918,0.0018767398,0.00084334996,0.0009385224,0.0013701186],"domain_scores_gemma":[0.99453133,0.00023826008,0.0011284947,0.0031185336,0.0005356932,0.00044770824],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013860285,0.0010004909,0.0010854289,0.00049897574,0.0004982209,0.001897297,0.0047890795,0.00092171517,0.00011976383],"category_scores_gemma":[0.00019128738,0.00094242406,0.00075232144,0.0004014327,0.00051513687,0.0014340074,0.004185167,0.0012844717,0.00057359616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055784726,0.0036953276,0.009098615,0.020679275,0.005592508,0.0003884531,0.116844185,0.0024865877,0.0005157081,0.44292408,0.1670735,0.23014392],"study_design_scores_gemma":[0.0059682387,0.0006315061,0.0010035745,0.0021763497,0.00022524223,0.00042017904,0.0016207778,0.6794487,0.0016830744,0.0634614,0.2392889,0.004072013],"about_ca_topic_score_codex":0.00002865982,"about_ca_topic_score_gemma":0.0000071774875,"teacher_disagreement_score":0.77036595,"about_ca_system_score_codex":0.00025014373,"about_ca_system_score_gemma":0.0004726415,"threshold_uncertainty_score":0.9993026},"labels":[],"label_agreement":null},{"id":"W2805347351","doi":"10.37236/7985","title":"Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Repetition (rhetorical device); Mathematics; Infimum and supremum; Word (group theory); Exponent; Physics; Geometry; Philosophy","score_opus":0.012828629700556458,"score_gpt":0.22911369206267942,"score_spread":0.21628506236212297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805347351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90117294,0.022429116,0.069391616,0.0018936808,0.004125349,0.0004806282,0.000011780771,0.00008238281,0.00041247928],"genre_scores_gemma":[0.99714684,0.0021661627,0.000057031626,0.00029055102,0.00020752993,0.0000045753045,0.0000054251695,0.00003663828,0.000085255815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969323,0.0003527666,0.00086307613,0.00038108838,0.00082316506,0.00064759067],"domain_scores_gemma":[0.99561155,0.00059060135,0.0018321816,0.0014933822,0.00038662885,0.000085636595],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002276358,0.00040387444,0.0007992514,0.000298695,0.00010744491,0.00014359051,0.0031017205,0.00033138,0.000008101072],"category_scores_gemma":[0.00014953825,0.0002832683,0.00048103757,0.0003591901,0.00010176229,0.00022947307,0.00068152556,0.0024513863,0.000010026588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004534432,0.00025414358,0.00007181694,0.00014074543,0.00028337684,0.00007887266,0.0002561543,0.0034854012,0.0004341924,0.9934029,0.00043677085,0.0011102651],"study_design_scores_gemma":[0.000890743,0.0016039681,0.00020198543,0.00054534024,0.00012206584,0.000958177,0.000057747504,0.0015110802,0.0068211057,0.98577994,0.0011667219,0.00034110463],"about_ca_topic_score_codex":0.000013609907,"about_ca_topic_score_gemma":0.0000028673592,"teacher_disagreement_score":0.095973864,"about_ca_system_score_codex":0.00052608416,"about_ca_system_score_gemma":0.0012747565,"threshold_uncertainty_score":0.999962},"labels":[],"label_agreement":null},{"id":"W2810127451","doi":"10.1007/978-3-319-98654-8_21","title":"A General Approach to State Complexity of Operations: Formalization and Limitations","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unary operation; Arity; Computer science; Complement (music); State (computer science); Regular language; Class (philosophy); Automaton; Set (abstract data type); Tuple; Theoretical computer science; Finite-state machine; Deterministic finite automaton; Transformation (genetics); Time complexity; Algorithm; Discrete mathematics; Programming language; Mathematics; Artificial intelligence","score_opus":0.05043347692059187,"score_gpt":0.2581152853837025,"score_spread":0.20768180846311063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810127451","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014400838,0.00011865052,0.9950797,0.0002367802,0.00032434784,0.000382851,0.000011687451,0.00007108884,0.002334827],"genre_scores_gemma":[0.11378468,0.000031363397,0.88486767,0.000979508,0.000128908,0.000011075817,0.000013479691,0.000015000566,0.00016833581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980236,0.00003189499,0.0004045,0.0007804752,0.00045777965,0.0003017252],"domain_scores_gemma":[0.9985822,0.0001570991,0.00012378249,0.00071907946,0.00029713623,0.00012070574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059626705,0.0002585268,0.0003122259,0.00055524474,0.00020982015,0.00034079698,0.001280269,0.0001005497,0.0000055274254],"category_scores_gemma":[0.00008477538,0.00023344888,0.000045104938,0.0004934438,0.0008040059,0.0006139385,0.00086616207,0.0001733268,0.00000835674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064796936,0.00006555358,0.000020983518,0.00006750922,0.000015096537,0.0000034271084,0.007931028,0.1089723,0.0004507386,0.5011508,0.00005257498,0.38126352],"study_design_scores_gemma":[0.00010793359,0.00012036606,0.00022151363,0.00008390882,0.0000033104152,0.000019523273,4.412483e-7,0.7772773,0.00075592264,0.22096138,0.00020790662,0.0002404832],"about_ca_topic_score_codex":0.000023576606,"about_ca_topic_score_gemma":0.00009858677,"teacher_disagreement_score":0.66830504,"about_ca_system_score_codex":0.00007224473,"about_ca_system_score_gemma":0.00020424595,"threshold_uncertainty_score":0.9519769},"labels":[],"label_agreement":null},{"id":"W2810888652","doi":"10.1007/s11083-018-9462-7","title":"A Syntactic Approach to the MacNeille Completion of Λ∗, the Free Monoid Over an Ordered Alphabet Λ","year":2018,"lang":"en","type":"article","venue":"Order","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Closure (psychology); Monoid; Alphabet; Partially ordered set; Divisibility rule; Lattice (music); Discrete mathematics; Linguistics","score_opus":0.014486632585228622,"score_gpt":0.23637881447789247,"score_spread":0.22189218189266385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810888652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51246005,0.000090352216,0.45850655,0.005544829,0.000802784,0.0006315117,0.000017684404,0.00016762922,0.021778597],"genre_scores_gemma":[0.9825882,0.0000011577438,0.015161827,0.0017421455,0.00012558213,0.000019593814,0.000001785427,0.000010715339,0.0003490029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990005,0.00013288934,0.0001452285,0.0002647727,0.00025758595,0.0001990119],"domain_scores_gemma":[0.9982466,0.000054731976,0.00007741774,0.0014762841,0.00009832297,0.00004662456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032908632,0.00010411405,0.00011529903,0.00003368497,0.00020158803,0.00008390864,0.0017477565,0.000037830454,0.000071772345],"category_scores_gemma":[0.00006996178,0.00005661033,0.0000429166,0.0005334626,0.0000950783,0.00021398207,0.0005228973,0.00008383767,0.000052842224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008165937,0.0012980396,0.0032100256,0.000068428104,0.00015480297,0.000001990722,0.014507679,0.00054811337,0.0200971,0.7399055,0.15095171,0.06917499],"study_design_scores_gemma":[0.0018636507,0.00063587417,0.15102491,0.00007989482,0.000056280733,0.00006491612,0.00084699626,0.6464743,0.012101376,0.026447576,0.15953858,0.0008656261],"about_ca_topic_score_codex":0.0001664346,"about_ca_topic_score_gemma":0.000042204018,"teacher_disagreement_score":0.7134579,"about_ca_system_score_codex":0.000017049442,"about_ca_system_score_gemma":0.000035849636,"threshold_uncertainty_score":0.32477954},"labels":[],"label_agreement":null},{"id":"W2826831346","doi":"10.1007/978-3-319-94631-3_17","title":"Cycle Height of Finite Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Deterministic finite automaton; Finite-state machine; Computation; Polynomial; GF(2); Mathematics; Discrete mathematics; Combinatorics; Finite field; Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science; Mathematical analysis","score_opus":0.011887819308244016,"score_gpt":0.23078918159480524,"score_spread":0.21890136228656124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2826831346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028977616,0.00034851904,0.98979676,0.0004049954,0.0016868986,0.0002121864,0.00001149461,0.0002476937,0.0070016747],"genre_scores_gemma":[0.26797432,0.000095495874,0.7269877,0.00288368,0.0010224244,0.000008990358,0.0000106228645,0.00007799683,0.0009387562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643594,0.00003633558,0.0006092156,0.0013455129,0.0009687714,0.00060423947],"domain_scores_gemma":[0.99627733,0.0006650736,0.0004112371,0.0022612775,0.00023384647,0.00015122948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010143105,0.00047801138,0.00059954845,0.0007436376,0.00016332955,0.0002830048,0.0050671822,0.0003035718,0.00012961816],"category_scores_gemma":[0.000102020465,0.00041569507,0.00016263948,0.0006213486,0.0012020118,0.00062226376,0.0021311706,0.00046088183,0.00014782907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010027528,0.000086595406,0.00003372406,0.000111412635,0.000030271487,0.00012263845,0.0018422742,0.008180163,0.00041113858,0.10607394,0.0003040896,0.8827937],"study_design_scores_gemma":[0.00021975007,0.00019815729,0.00007489181,0.00036807498,0.0000061550386,0.00004278782,8.090417e-8,0.56257164,0.0038500219,0.42941874,0.0027473357,0.0005023303],"about_ca_topic_score_codex":0.000014036894,"about_ca_topic_score_gemma":0.000016160227,"teacher_disagreement_score":0.8822914,"about_ca_system_score_codex":0.000117028976,"about_ca_system_score_gemma":0.0003884898,"threshold_uncertainty_score":0.9998295},"labels":[],"label_agreement":null},{"id":"W2883076598","doi":"10.4153/s0008439519000031","title":"Linear Conjugacy","year":2019,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjugacy class; Semigroup; Finite field; Conjugate; Field (mathematics); Linear map; Representation (politics); Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.0060828230119658756,"score_gpt":0.19554829676925173,"score_spread":0.18946547375728584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883076598","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23365499,0.00022002913,0.15394749,0.048771262,0.00087978086,0.00091857207,0.000018775052,0.00071635336,0.56087273],"genre_scores_gemma":[0.95358,0.000002291798,0.0269309,0.0067378776,0.00008474881,0.000013111328,0.0000031961342,0.00002179971,0.01262604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898195,0.000033810727,0.00017669292,0.0002620967,0.00015148634,0.00039396223],"domain_scores_gemma":[0.9987028,0.00016607235,0.00003063738,0.00062782795,0.000031747037,0.0004409136],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00028153686,0.00011549928,0.00017124778,0.00008864653,0.000055394798,0.00010159034,0.0007498163,0.00006741478,0.022209771],"category_scores_gemma":[0.00009833221,0.00010132682,0.000060275084,0.00013836897,0.000036277386,0.00006302508,0.00007985332,0.00012156521,0.14172734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.9115206e-7,0.0000143449715,0.000031174623,0.000028789604,0.0000066418656,0.000034355275,0.00013497191,0.0000036518875,0.00007540367,0.9767033,0.020130407,0.0028363788],"study_design_scores_gemma":[0.00040232748,0.00006797159,0.0002017087,0.000099511366,0.0000055985247,0.00009104961,0.00007130351,0.0384427,0.00045749723,0.21208994,0.7476163,0.00045412028],"about_ca_topic_score_codex":0.00027245647,"about_ca_topic_score_gemma":0.000044680404,"teacher_disagreement_score":0.76461333,"about_ca_system_score_codex":0.00005737504,"about_ca_system_score_gemma":0.0001301026,"threshold_uncertainty_score":0.97868407},"labels":[],"label_agreement":null},{"id":"W2885423836","doi":"10.1051/ita/2018008","title":"Circular critical exponents for Thue–Morse factors","year":2019,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morse code; Exponent; Word (group theory); Repetition (rhetorical device); Mathematics; Critical exponent; Factor (programming language); Discrete Morse theory; Combinatorics; Morse theory; Discrete mathematics; Pure mathematics; Geometry; Computer science; Linguistics; Philosophy","score_opus":0.009138817957750053,"score_gpt":0.25539041598198997,"score_spread":0.2462515980242399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885423836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05227844,0.00004132583,0.94184595,0.0004948546,0.000082287384,0.0006434491,0.00003374358,0.0001414325,0.0044385027],"genre_scores_gemma":[0.96231824,0.000012684709,0.03682488,0.0005359385,0.00004147187,0.00018653955,0.000024679994,0.000011074135,0.000044491688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895364,0.000018183411,0.00035803654,0.0001837876,0.00018383766,0.0003025059],"domain_scores_gemma":[0.9984737,0.0006377597,0.00006194622,0.00057743303,0.00006755075,0.00018161046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028865493,0.00015278406,0.00019121538,0.00006150633,0.00018277696,0.00021789494,0.00051839114,0.00008862388,0.000066625056],"category_scores_gemma":[0.00006196982,0.00012140544,0.00008580928,0.0001533152,0.00028542854,0.000371306,0.00020123321,0.00010938176,0.00011174816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001809739,0.00004753809,0.000084362255,0.00007063817,0.000008508353,8.925631e-8,0.00040545763,0.000008149642,0.00015532604,0.9949235,0.00009568286,0.004198944],"study_design_scores_gemma":[0.00035261488,0.00007265549,0.00032117934,0.000023009632,0.00001756661,0.000010022288,0.00048888143,0.2885023,0.0006664754,0.69410765,0.015165972,0.00027169424],"about_ca_topic_score_codex":7.043601e-7,"about_ca_topic_score_gemma":3.518946e-8,"teacher_disagreement_score":0.9100398,"about_ca_system_score_codex":0.00001533265,"about_ca_system_score_gemma":0.00002314243,"threshold_uncertainty_score":0.495077},"labels":[],"label_agreement":null},{"id":"W2885772766","doi":"10.1007/978-3-319-98654-8_33","title":"Computational Complexity of Decision Problems on Self-verifying Finite Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Nondeterministic algorithm; Decision problem; Nondeterministic finite automaton; Büchi automaton; Deterministic automaton; Computer science; Two-way deterministic finite automaton; Automaton; Computational complexity theory; Universality (dynamical systems); DFA minimization; Theoretical computer science; Deterministic finite automaton; NP; Equivalence (formal languages); Discrete mathematics; Algorithm; Automata theory; Mathematics; Computation; Turing machine","score_opus":0.033065120484532674,"score_gpt":0.26349418510358047,"score_spread":0.2304290646190478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885772766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009257344,0.000112495676,0.9943295,0.00021493835,0.0013814962,0.00041147368,0.000021008704,0.0003756803,0.0022276454],"genre_scores_gemma":[0.23597847,0.000019312725,0.76272285,0.00090895727,0.00026789843,0.00000558793,0.0000142539375,0.00003639632,0.00004625283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529445,0.00005858841,0.0008281169,0.0015886519,0.001627573,0.00060264085],"domain_scores_gemma":[0.995514,0.0017006334,0.00058104296,0.0016470698,0.00038992678,0.00016735734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013929005,0.00058044994,0.0006935648,0.000969565,0.00030675204,0.000353308,0.0040631522,0.00031073755,0.000059245238],"category_scores_gemma":[0.00012888956,0.0005146978,0.00017849273,0.00071379374,0.001350337,0.00056585943,0.0017781814,0.00061971194,0.00010227354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028458197,0.000292614,0.000041753286,0.00018849998,0.00004359049,0.00008341994,0.002387151,0.29370093,0.00007265811,0.16367851,0.00015106682,0.5393313],"study_design_scores_gemma":[0.00029040937,0.0002467211,0.0001389856,0.0006587504,0.0000041620365,0.00003094273,8.472931e-8,0.5696798,0.00026716889,0.42799175,0.00036138523,0.0003298568],"about_ca_topic_score_codex":0.0000148054505,"about_ca_topic_score_gemma":0.000017568202,"teacher_disagreement_score":0.53900146,"about_ca_system_score_codex":0.00024944622,"about_ca_system_score_gemma":0.0004724451,"threshold_uncertainty_score":0.99973047},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017999668340575658,"score_gpt":0.30974991188201595,"score_spread":0.2917502435414403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888233883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08562258,0.000009216716,0.9067809,0.0025809444,0.003905834,0.00004632562,0.000004113044,0.000035959358,0.0010141213],"genre_scores_gemma":[0.8119062,0.000007897255,0.18705566,0.00054479926,0.0004501743,8.613443e-7,9.654206e-7,0.0000035663754,0.00002983349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978902,0.00004466472,0.00054980925,0.0002261191,0.0011210256,0.0001681911],"domain_scores_gemma":[0.9966116,0.0001912125,0.0003265667,0.0004697745,0.0023018622,0.0000990043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010071674,0.00010392777,0.00014774573,0.000775533,0.00022235472,0.0005406014,0.0039917254,0.00002515508,0.000037702193],"category_scores_gemma":[0.00023512622,0.00008812381,0.00009115908,0.0007106008,0.0005789047,0.0020335254,0.000406926,0.000114785435,0.00006317549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028399578,0.00053461804,0.00019633994,0.0000033589426,0.000089649206,0.000032184667,0.0013849059,0.015884172,0.006731672,0.65399504,0.0011258344,0.31999385],"study_design_scores_gemma":[0.00077788136,0.0009937957,0.0092843445,0.00016796691,0.000008171871,0.0003093744,0.000016551152,0.94522434,0.019394426,0.019924788,0.00369216,0.00020619828],"about_ca_topic_score_codex":0.000011047105,"about_ca_topic_score_gemma":0.0000027762264,"teacher_disagreement_score":0.9293402,"about_ca_system_score_codex":0.000094323674,"about_ca_system_score_gemma":0.00052272505,"threshold_uncertainty_score":0.74176854},"labels":[],"label_agreement":null},{"id":"W2890948056","doi":"10.1142/s0129054119500308","title":"Cobham’s Theorem and Automaticity","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture; Natural Sciences and Engineering Research Council of Canada; Université de Liège","keywords":"Aperiodic graph; Automaticity; Prefix; Sequence (biology); Mathematics; Discrete mathematics; Combinatorics; Philosophy; Linguistics","score_opus":0.016367887227190753,"score_gpt":0.29745463307549835,"score_spread":0.2810867458483076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890948056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1228172,0.00012843066,0.8689256,0.0017312067,0.005791266,0.000107611755,0.000008778373,0.00003154925,0.00045835765],"genre_scores_gemma":[0.7322463,0.000054484433,0.26728407,0.00017718505,0.00021844156,0.0000010757338,0.0000016321354,0.0000051392058,0.000011690413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971223,0.000081845224,0.0008360358,0.00037004595,0.0014037247,0.00018603724],"domain_scores_gemma":[0.9954352,0.00035634675,0.0014202024,0.0006288274,0.0020453907,0.00011403557],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0019696774,0.00018900711,0.00037312502,0.00087702996,0.00009034192,0.00091817114,0.005651017,0.00007886686,0.000014936367],"category_scores_gemma":[0.00017493367,0.00016187484,0.00016038932,0.00031994926,0.00060551544,0.001492188,0.003114048,0.00037004714,0.000008442572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020321351,0.0002942566,0.0012836185,0.00008262682,0.00027682225,0.000035652887,0.002426191,0.017803868,0.0014735505,0.7369327,0.0007281118,0.23864229],"study_design_scores_gemma":[0.00048230085,0.00015774614,0.01427389,0.0005939709,0.0000216393,0.00041039925,0.000021637683,0.7745961,0.0019611914,0.20659097,0.0006200384,0.00027014012],"about_ca_topic_score_codex":0.000012632989,"about_ca_topic_score_gemma":8.272724e-7,"teacher_disagreement_score":0.75679225,"about_ca_system_score_codex":0.00013799556,"about_ca_system_score_gemma":0.0011201665,"threshold_uncertainty_score":0.99972886},"labels":[],"label_agreement":null},{"id":"W2898086057","doi":"10.3390/a11110165","title":"Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Saint Mary's University; University of Waterloo","funders":"","keywords":"Edit distance; Computer science; Nondeterministic algorithm; Cardinality (data modeling); Algorithm; Nondeterministic finite automaton; Correctness; Word (group theory); Automaton; Theoretical computer science; Mathematics; Automata theory","score_opus":0.01009466810539971,"score_gpt":0.2554369351228916,"score_spread":0.2453422670174919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898086057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02804784,0.00042083216,0.9690594,0.00059999764,0.001138494,0.00033836343,0.000021686345,0.00014149485,0.00023190105],"genre_scores_gemma":[0.85367227,0.0000026987489,0.14485453,0.0003693331,0.0009111713,0.000020714846,0.0000061008436,0.00002255727,0.00014065727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984501,0.000069645,0.0003233126,0.00041870098,0.00033345638,0.00040479132],"domain_scores_gemma":[0.99860066,0.0002753689,0.00015972073,0.0007496268,0.00014652757,0.00006809019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083970366,0.00017902584,0.0002395871,0.00006288535,0.0002515349,0.00006848306,0.0011413643,0.00006390064,0.000011711806],"category_scores_gemma":[0.00003380783,0.00012390182,0.00014025699,0.00045511796,0.00029611343,0.00008689307,0.00014832246,0.00010734936,0.000012023435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027683407,0.00022447569,0.000015133686,0.00007643013,0.000114052535,0.000021499889,0.021061448,0.0008864776,0.010512166,0.034780968,0.002326991,0.9299527],"study_design_scores_gemma":[0.0004995818,0.00016950819,0.0001646255,0.00004873532,0.000016000442,0.000024579562,0.0004278172,0.975329,0.017185815,0.0019654625,0.0039634113,0.0002055007],"about_ca_topic_score_codex":0.000048897316,"about_ca_topic_score_gemma":0.000004324661,"teacher_disagreement_score":0.9744425,"about_ca_system_score_codex":0.00003315457,"about_ca_system_score_gemma":0.00003457438,"threshold_uncertainty_score":0.50525695},"labels":[],"label_agreement":null},{"id":"W2898795341","doi":"10.1142/s0218196720500125","title":"The complexity of properties of transformation semigroups","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semigroup; Mathematics; Semilattice; Idempotence; Transformation (genetics); Commutative property; Decidability; Discrete mathematics; Bicyclic semigroup; Cancellative semigroup; Polynomial; Pure mathematics; Combinatorics; Algebra over a field; Mathematical analysis","score_opus":0.03541922886832506,"score_gpt":0.26587798678265917,"score_spread":0.23045875791433412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898795341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59159034,0.0011457196,0.40407905,0.001664084,0.0012663242,0.000118479904,0.000007526091,0.000009658327,0.00011878771],"genre_scores_gemma":[0.99609613,0.00032624436,0.0034255628,0.000046675992,0.00008638963,0.0000013817715,0.000006083466,0.000005182938,0.0000063215416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826306,0.000108549866,0.0008110483,0.00011703158,0.0006209845,0.000079295525],"domain_scores_gemma":[0.99747694,0.00012810386,0.001316376,0.00014265993,0.00090710784,0.000028807888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006518948,0.000120893055,0.00026906806,0.00017411361,0.000040508596,0.00013995203,0.0009672939,0.000073816336,0.0000015588915],"category_scores_gemma":[0.00003593538,0.00008155293,0.00014818243,0.0000661915,0.00019351862,0.00040068536,0.00027106982,0.00023135818,8.0213357e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004360862,0.00032250915,0.00068124605,0.00064754975,0.0011520596,0.000009256177,0.016069302,0.036898457,0.010614013,0.6077174,0.0003322027,0.3251199],"study_design_scores_gemma":[0.0010998856,0.0002896191,0.010624584,0.0014086042,0.00005531375,0.00017905825,0.00061986607,0.50507593,0.026109695,0.4540987,0.00019268421,0.00024606325],"about_ca_topic_score_codex":0.000022077767,"about_ca_topic_score_gemma":0.0000025478776,"teacher_disagreement_score":0.46817747,"about_ca_system_score_codex":0.000036027806,"about_ca_system_score_gemma":0.00014216245,"threshold_uncertainty_score":0.3325632},"labels":[],"label_agreement":null},{"id":"W2898948556","doi":"10.1016/j.tcs.2018.12.014","title":"State complexity of pattern matching in regular languages","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Sigma; Alphabet; Word (group theory); Kappa; Mathematics; State (computer science); Matching (statistics); Discrete mathematics; Physics; Algorithm; Geometry; Statistics; Philosophy; Linguistics","score_opus":0.019041264832982706,"score_gpt":0.2783483248492058,"score_spread":0.2593070600162231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898948556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3344063,0.000051849653,0.66362447,0.00038356704,0.00055208785,0.00017993643,0.000012331129,0.0001493248,0.0006401415],"genre_scores_gemma":[0.8699179,0.0000076196798,0.12962882,0.00030189232,0.000116027455,0.0000065451486,0.0000033760318,0.000013946277,0.00000387218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960985,0.00031295745,0.0006483415,0.001255933,0.0009637484,0.00072052696],"domain_scores_gemma":[0.99700993,0.00024071653,0.00029117288,0.002054228,0.00020446966,0.00019948096],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0033038172,0.00035802607,0.0006009466,0.00043819484,0.00014250394,0.00043177645,0.006139079,0.00012867131,0.000047130477],"category_scores_gemma":[0.000054898446,0.00030812068,0.00012869466,0.00077893113,0.00650233,0.0003853296,0.009290372,0.0005863836,0.000034990215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064354335,0.00010269588,0.00019595349,0.000110861925,0.0000081508515,0.000048080696,0.002535194,0.0005003465,0.00048276133,0.9460747,0.000024190875,0.049910616],"study_design_scores_gemma":[0.0001293679,0.00007091925,0.0034008683,0.00031349124,0.000002737183,0.000013377465,0.00001364626,0.33545768,0.0049457992,0.6553774,0.0000038099245,0.0002709233],"about_ca_topic_score_codex":0.00010882409,"about_ca_topic_score_gemma":0.0000086354785,"teacher_disagreement_score":0.5355116,"about_ca_system_score_codex":0.00009803473,"about_ca_system_score_gemma":0.0002220244,"threshold_uncertainty_score":0.9999371},"labels":[],"label_agreement":null},{"id":"W2900953251","doi":"10.22215/etd/2019-13532","title":"Enumerative properties of restricted words and compositions","year":2019,"lang":"en","type":"preprint","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Subsequence; Mathematics; Simple (philosophy); Enumeration; Group (periodic table); Convergence (economics); Integer (computer science); Graph; Distribution (mathematics); Combinatorics; Classification of finite simple groups; Longest common subsequence problem; Element (criminal law); Discrete mathematics; Pure mathematics; Group theory; Computer science; Group of Lie type; Mathematical analysis","score_opus":0.0224147944789346,"score_gpt":0.23190583011547997,"score_spread":0.20949103563654536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900953251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.594783,0.0016837287,0.39416376,0.001053504,0.0005477798,0.000558398,0.000022655564,0.0002855606,0.0069016186],"genre_scores_gemma":[0.9822327,0.000060898685,0.017050667,0.00009539852,0.0000195644,0.000014728068,0.000005788009,0.0000052045098,0.00051508524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919504,0.000073754236,0.00019029698,0.00030298808,0.00013372661,0.00010421515],"domain_scores_gemma":[0.99919623,0.000049457103,0.00011100564,0.0005399194,0.000070847665,0.00003254205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008036828,0.00012813087,0.00022735624,0.00009571627,0.000039827864,0.00011198386,0.0005044997,0.00009390515,0.000008701678],"category_scores_gemma":[0.000011864111,0.00009536867,0.00004228546,0.000104608676,0.00007274481,0.00012796398,0.0012907395,0.00018859578,0.000008688093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045930887,0.00045873763,0.001246679,0.001075693,0.00041259846,0.000016019883,0.02023177,0.001961128,0.079091355,0.871617,0.0051389467,0.018704144],"study_design_scores_gemma":[0.0011983596,0.00041241772,0.015596274,0.0025975055,0.00008794151,0.000053032418,0.0009889174,0.71810514,0.17628694,0.08204846,0.00094833213,0.0016766932],"about_ca_topic_score_codex":0.00012014544,"about_ca_topic_score_gemma":0.000003073308,"teacher_disagreement_score":0.78956854,"about_ca_system_score_codex":0.000013097233,"about_ca_system_score_gemma":0.00008808558,"threshold_uncertainty_score":0.38890213},"labels":[],"label_agreement":null},{"id":"W2903659467","doi":"","title":"Some combinatorial problems in the theory of partial transformation semigroups","year":2014,"lang":"en","type":"article","venue":"The scientific electronic library of periodicals of the National Academy of Sciences of Ukraine (National Academy of Sciences of Ukraine)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wilfrid Laurier University","keywords":"Transformation (genetics); Mathematics; Special classes of semigroups; Algebra over a field; Semigroup; Computer science; Pure mathematics","score_opus":0.026589543742404957,"score_gpt":0.27143248645005463,"score_spread":0.24484294270764967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903659467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9649748,0.0025230031,0.00053032144,0.027969994,0.00023853399,0.001100601,0.00019715939,0.000033019376,0.0024325768],"genre_scores_gemma":[0.9980574,0.00016168923,0.0011468916,0.00042563156,0.0001292794,0.000019674668,0.0000041705985,0.000008734678,0.000046528316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98925185,0.0009845603,0.0023535392,0.0006946675,0.006078346,0.0006370457],"domain_scores_gemma":[0.99352545,0.003110539,0.0027741096,0.0001806984,0.000328728,0.00008045702],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.026967831,0.00031364642,0.00077086734,0.00090384384,0.0005520492,0.0000861118,0.009404914,0.00023849704,0.00004641632],"category_scores_gemma":[0.0012575157,0.00018180546,0.0004520881,0.004440495,0.015244048,0.0032601897,0.0006171558,0.0006017753,0.0000011354707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044741075,0.00033997133,0.00014502564,0.00017427451,0.000035373723,1.1285907e-8,0.0027013347,0.004986037,0.0744433,0.91592515,0.00025405403,0.0009507342],"study_design_scores_gemma":[0.00087385875,0.00044426764,0.0070318063,0.00032816315,0.000026078997,0.00001089479,0.00032253537,0.03577179,0.18845285,0.76581323,0.0007145933,0.0002099484],"about_ca_topic_score_codex":0.000021652106,"about_ca_topic_score_gemma":4.191271e-7,"teacher_disagreement_score":0.15011193,"about_ca_system_score_codex":0.000043802058,"about_ca_system_score_gemma":0.0009429282,"threshold_uncertainty_score":0.9959547},"labels":[],"label_agreement":null},{"id":"W2903828083","doi":"10.4230/lipics.icalp.2019.121","title":"Optimal Regular Expressions for Permutations","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Permutation (music); Alphabet; Combinatorics; Mathematics; Bit-reversal permutation; Construct (python library); Expression (computer science); Regular language; Discrete mathematics; Cyclic permutation; Symmetric group; Computer science; Physics; Theoretical computer science","score_opus":0.06957427623550301,"score_gpt":0.20176615200875134,"score_spread":0.1321918757732483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903828083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18049301,0.00003732644,0.8171076,0.00012436137,0.0005519547,0.00029815256,0.00005168011,0.00032193697,0.0010139792],"genre_scores_gemma":[0.9688033,0.000021695027,0.028304333,0.00009670546,0.00016769867,0.000005528762,0.000041901367,0.000020017591,0.0025388477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984242,0.00008216169,0.00015735008,0.00095910055,0.000067276924,0.00030992273],"domain_scores_gemma":[0.99797297,0.00016527563,0.00017747252,0.0013451678,0.00018912082,0.0001499853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022081952,0.00024155295,0.00023655886,0.00018806403,0.00032895972,0.00014328484,0.00192698,0.00023689102,0.00004470922],"category_scores_gemma":[0.000043069504,0.0002647646,0.0002562321,0.00027224555,0.00014408148,0.00035133344,0.0016990956,0.00023301695,0.00007533262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020800915,0.00010619688,0.00007002334,0.0000613373,0.00008506495,0.00006858475,0.00046913748,0.09198785,0.00031821133,0.9013662,0.0051474883,0.00029910996],"study_design_scores_gemma":[0.00036284287,0.000057060286,0.00018916487,0.00010572715,0.000055486456,0.000004798108,0.00012130176,0.75889724,0.0006299588,0.23662585,0.0025557901,0.00039475955],"about_ca_topic_score_codex":0.000015040902,"about_ca_topic_score_gemma":0.0000026658113,"teacher_disagreement_score":0.7888033,"about_ca_system_score_codex":0.00008802404,"about_ca_system_score_gemma":0.00017257693,"threshold_uncertainty_score":0.99998045},"labels":[],"label_agreement":null},{"id":"W290526480","doi":"10.4230/dagsemproc.06111.10","title":"Incremental branching programs","year":2006,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; McGill University; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Nondeterministic algorithm; Branching (polymer chemistry); Computation; Computer science; Exponential function; Mathematics; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.008540348256302814,"score_gpt":0.21953475216317944,"score_spread":0.21099440390687663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W290526480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49153945,0.000094241565,0.49055183,0.00034290963,0.0012400832,0.001372917,0.00011352448,0.0009953976,0.013749644],"genre_scores_gemma":[0.9396037,0.0000058759188,0.058441114,0.00094613,0.00026808842,0.0001212632,0.0003233387,0.000037459115,0.0002530384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724877,0.00003577311,0.0009833485,0.00031640698,0.0005421258,0.0008735677],"domain_scores_gemma":[0.9984441,0.000083829604,0.0003659265,0.0008357233,0.000120064935,0.00015038921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067611504,0.00038427647,0.00036532248,0.00020768841,0.00042436252,0.0009131877,0.0015329021,0.00016079692,0.00002354036],"category_scores_gemma":[0.000022008699,0.0003407928,0.00026134966,0.00037064607,0.00010363565,0.0025473763,0.0005638435,0.00030472194,0.00018659278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012412968,0.0020022166,0.028963927,0.0010637525,0.00030262306,0.000037869675,0.01116725,0.0002818095,0.0017057885,0.5435732,0.02295429,0.3878231],"study_design_scores_gemma":[0.013389774,0.001229244,0.010769395,0.00079289946,0.00010318834,0.0005665177,0.0025238814,0.51537305,0.015559581,0.057600204,0.3784251,0.003667166],"about_ca_topic_score_codex":0.00007375868,"about_ca_topic_score_gemma":0.00002452375,"teacher_disagreement_score":0.51509124,"about_ca_system_score_codex":0.00011671766,"about_ca_system_score_gemma":0.000050030525,"threshold_uncertainty_score":0.9999044},"labels":[],"label_agreement":null},{"id":"W2906840866","doi":"10.4153/s0008439519000651","title":"Deciding the Existence of Minority Terms","year":2019,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council","keywords":"Approx; Idempotence; Ternary operation; Class (philosophy); Mathematics; Type (biology); Polynomial; Combinatorics; Work (physics); Computational complexity theory; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Physics; Algorithm; Mathematical analysis; Quantum mechanics; Artificial intelligence","score_opus":0.01911506829677905,"score_gpt":0.2252663140036611,"score_spread":0.20615124570688204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906840866","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104746,0.0015306612,0.2923317,0.041049033,0.003145552,0.002747845,0.00018743011,0.00040963586,0.55385214],"genre_scores_gemma":[0.9758303,0.000013561115,0.020463353,0.0011122621,0.000118602635,0.000043695174,0.0000058080423,0.000018017055,0.0023943607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981473,0.00012096859,0.00045069435,0.00048814446,0.0003297682,0.00046311732],"domain_scores_gemma":[0.99691546,0.0006255847,0.00021428753,0.0018697339,0.0000685463,0.0003063925],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008821977,0.00025705108,0.0004441502,0.000119643875,0.00009953733,0.00020470771,0.003029137,0.00023203656,0.0015179641],"category_scores_gemma":[0.00037774618,0.00018110164,0.00020531565,0.00012982225,0.00017584542,0.000032503154,0.0009448798,0.00051068445,0.003104145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013551165,0.000030671763,0.000073747375,0.00060710765,0.000040406794,0.000049888364,0.0007577734,0.00004553156,0.000031767322,0.9786615,0.015174431,0.0045258305],"study_design_scores_gemma":[0.0001803222,0.000038222097,0.0007010216,0.0010480494,0.000047373982,0.00010016474,0.00012988666,0.030522302,0.0005543296,0.9210734,0.044914518,0.00069046],"about_ca_topic_score_codex":0.0014565088,"about_ca_topic_score_gemma":0.00019727756,"teacher_disagreement_score":0.87108433,"about_ca_system_score_codex":0.00012905827,"about_ca_system_score_gemma":0.00039472675,"threshold_uncertainty_score":0.9993948},"labels":[],"label_agreement":null},{"id":"W2907265589","doi":"10.1016/j.tcs.2018.12.016","title":"The number of valid factorizations of Fibonacci prefixes","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Prefix; Fibonacci polynomials; Mathematics; Sequence (biology); Pisano period; Combinatorics; Lucas sequence; Recurrence relation; Arithmetic; Word (group theory); Lucas number; Discrete mathematics; Linguistics","score_opus":0.007265641520229918,"score_gpt":0.2561661758688777,"score_spread":0.24890053434864778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907265589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3189024,0.000027450307,0.67516273,0.0002872277,0.0007448335,0.00013985421,0.000003276357,0.00006494728,0.004667286],"genre_scores_gemma":[0.9670734,0.000007707016,0.032792185,0.000053521544,0.00002914085,0.0000021920287,3.6901415e-7,0.0000044539606,0.000037076006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834394,0.00009816719,0.00030912925,0.00034063487,0.00059605326,0.0003120632],"domain_scores_gemma":[0.9977782,0.00078206323,0.00013305499,0.0010104546,0.0002114942,0.00008474665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011645822,0.00010911378,0.00018703646,0.000054949363,0.00018635539,0.00013111347,0.0028479462,0.000032749063,0.000070212554],"category_scores_gemma":[0.00007230719,0.000067422574,0.000074323216,0.00088764814,0.0018429992,0.00041475188,0.0009158446,0.00009027803,0.00006078223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027836336,0.000029588906,0.0013088728,0.000007860006,0.0000040068076,1.8052268e-7,0.00026939085,0.00004261393,0.0028719741,0.98593247,0.000018057886,0.009512212],"study_design_scores_gemma":[0.00018575121,0.00015064403,0.008707281,0.00005729675,0.0000055212145,0.000009244235,0.000025658635,0.2790412,0.06009038,0.65120435,0.00031529897,0.00020736767],"about_ca_topic_score_codex":0.0000029471576,"about_ca_topic_score_gemma":6.7903954e-8,"teacher_disagreement_score":0.64817095,"about_ca_system_score_codex":0.000015212252,"about_ca_system_score_gemma":0.000101484926,"threshold_uncertainty_score":0.67906076},"labels":[],"label_agreement":null},{"id":"W2907458073","doi":"10.1016/j.tcs.2018.12.025","title":"Syntactic complexity of bifix-free regular languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Narodowe Centrum Nauki","keywords":"Injective function; Cardinality (data modeling); Mathematics; Regular language; Alphabet; Upper and lower bounds; Combinatorics; Discrete mathematics; Function (biology); Semigroup; Computer science; Theoretical computer science; Linguistics; Automaton","score_opus":0.011359170030102426,"score_gpt":0.24601496610541337,"score_spread":0.23465579607531095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907458073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33439493,0.00005802766,0.65611,0.0010672441,0.0005234227,0.0001829581,0.0000037392192,0.00023990023,0.007419789],"genre_scores_gemma":[0.8707378,0.0000021212172,0.12882975,0.00034937603,0.00005102003,0.0000018974996,5.830858e-7,0.000007364592,0.000020073527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754584,0.00013030482,0.0003093318,0.00068097695,0.0008178207,0.00051569875],"domain_scores_gemma":[0.99697477,0.00032411478,0.00012072651,0.0022400687,0.00015154999,0.00018878278],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015822675,0.00018247956,0.00031328225,0.00019974113,0.00014709002,0.00020775433,0.0050188294,0.000051655898,0.00016949944],"category_scores_gemma":[0.00011761907,0.00014498529,0.00009384627,0.0010756177,0.0033635984,0.00071973604,0.0021979357,0.00016741747,0.00017832409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005762657,0.000056015404,0.0001490781,0.0000214948,0.000004782348,0.0000074559666,0.00023671622,0.000024908575,0.006442904,0.9845859,0.000048835955,0.008416146],"study_design_scores_gemma":[0.00034151852,0.00024645776,0.0037446935,0.00006698901,0.0000050932035,0.000055414122,0.000029437026,0.29947177,0.037887372,0.6578227,0.00006527147,0.0002632709],"about_ca_topic_score_codex":0.000009970114,"about_ca_topic_score_gemma":3.6551663e-7,"teacher_disagreement_score":0.53634286,"about_ca_system_score_codex":0.000038922793,"about_ca_system_score_gemma":0.00009622728,"threshold_uncertainty_score":0.9993487},"labels":[],"label_agreement":null},{"id":"W2910240168","doi":"10.1016/j.tcs.2019.10.006","title":"Some further results on squarefree arithmetic progressions in infinite words","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Square-free integer; Arithmetic; Mathematics; Combinatorics","score_opus":0.016454798319736685,"score_gpt":0.27484793513718514,"score_spread":0.25839313681744847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910240168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14828493,0.00048109854,0.82198256,0.009648871,0.008353769,0.0019344119,0.000065859786,0.0012062668,0.008042239],"genre_scores_gemma":[0.93444633,0.000026749778,0.06381297,0.0011574163,0.00043061524,0.000051166924,0.000007069813,0.000031539934,0.000036116482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932593,0.000457388,0.0008954745,0.0024788599,0.0016372718,0.0012717069],"domain_scores_gemma":[0.9941158,0.0010261273,0.00032211846,0.003958761,0.00017214412,0.00040504304],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0041827657,0.0006435748,0.0007203788,0.0010164372,0.00024107407,0.001251906,0.008333309,0.00036201728,0.000022725366],"category_scores_gemma":[0.00032284137,0.0005032995,0.00020289789,0.0016393613,0.0027374912,0.00066396396,0.009219099,0.0016783756,0.0004306797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045383447,0.00025580157,0.00004925018,0.000040289833,0.0000071444283,0.00007003206,0.0015725503,0.004425804,0.000033354718,0.94379294,0.000088495784,0.049618956],"study_design_scores_gemma":[0.0005341949,0.00030332344,0.0015432257,0.00080574694,0.000004786299,0.000013591735,0.000010599251,0.5263583,0.00035806748,0.46940237,0.000118356445,0.0005474145],"about_ca_topic_score_codex":0.000011388496,"about_ca_topic_score_gemma":0.0000014664706,"teacher_disagreement_score":0.7861614,"about_ca_system_score_codex":0.00022892252,"about_ca_system_score_gemma":0.00057571504,"threshold_uncertainty_score":0.9999765},"labels":[],"label_agreement":null},{"id":"W2911230821","doi":"","title":"Decomposition and descriptional complexity of shuffle on words and finite languages","year":2010,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Unary operation; Regular language; Singleton; Nondeterministic finite automaton; Character (mathematics); Mathematics; Deterministic finite automaton; Finite-state machine; Discrete mathematics; Computer science; Automaton; Combinatorics; Automata theory; Theoretical computer science; Algorithm","score_opus":0.0765272094044937,"score_gpt":0.31538020865417143,"score_spread":0.23885299924967773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911230821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9904803,0.000041940708,0.008706566,0.0002289142,0.00013722244,0.00009285503,0.00002109418,0.000100427016,0.00019068885],"genre_scores_gemma":[0.9979208,0.000015972095,0.0015797728,0.00021861095,0.000034549546,3.6224094e-7,0.000009011678,0.000008813575,0.00021210458],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989882,0.00011017226,0.00013378343,0.00036749328,0.00020439272,0.0001959653],"domain_scores_gemma":[0.9991803,0.0001577289,0.00010734444,0.0003616146,0.00005320998,0.00013980365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002693384,0.00015831128,0.00018089509,0.00026573474,0.00015744373,0.0001858943,0.0004947073,0.00010230116,0.000011391481],"category_scores_gemma":[0.000021946369,0.00016632458,0.000042288335,0.00020083555,0.00025859452,0.0011376468,0.00037430268,0.00033017137,0.000013453905],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008263317,0.00013566748,0.91617805,0.000049448172,0.000033073506,0.000087603126,0.0008441814,0.0000071637282,0.021530736,0.056076534,5.253892e-7,0.0049743825],"study_design_scores_gemma":[0.00059372647,0.00016225498,0.9893365,0.000078370416,0.0000148676845,0.000048690672,0.00011296153,0.000038892784,0.0053612147,0.0038812684,0.00016144782,0.000209835],"about_ca_topic_score_codex":0.000004632618,"about_ca_topic_score_gemma":0.00029769668,"teacher_disagreement_score":0.07315842,"about_ca_system_score_codex":0.00002079094,"about_ca_system_score_gemma":0.0000247223,"threshold_uncertainty_score":0.678252},"labels":[],"label_agreement":null},{"id":"W2911506693","doi":"10.1051/ita/2018015","title":"Randomized generation of error control codes with automata and transducers","year":2018,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Error detection and correction; Algorithm; Computer science; Block (permutation group theory); Code (set theory); Automaton; Theoretical computer science; Mathematics; Programming language","score_opus":0.014520461654828115,"score_gpt":0.25472337989382593,"score_spread":0.2402029182389978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911506693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045261603,0.00004490457,0.9504731,0.0006006451,0.000013317638,0.00052811025,0.00001797285,0.000071226605,0.0029890705],"genre_scores_gemma":[0.9468452,0.000039563532,0.05258541,0.0003563071,0.00004098896,0.00011204048,0.00000762574,0.0000050994454,0.000007771197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999199,0.000050419934,0.00036137685,0.000115353105,0.00013761783,0.00013624242],"domain_scores_gemma":[0.9990964,0.0002955689,0.00012287628,0.0003111722,0.000084369305,0.00008963413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056990964,0.00011113013,0.00027884252,0.000053234744,0.00014536829,0.000100291945,0.00021256715,0.00004851089,0.000014738739],"category_scores_gemma":[0.000021374994,0.00007381014,0.000032323416,0.0001371036,0.0015039936,0.00023137759,0.000045566132,0.000056263474,0.000004378115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021178053,0.000024037005,0.0000035961436,0.000024473127,0.000025423431,5.9896244e-8,0.0008816255,0.000011152721,0.00026269394,0.98864526,0.00003874793,0.009871136],"study_design_scores_gemma":[0.016527014,0.00010000582,0.00002499721,0.000019182839,0.000047310532,0.000017074934,0.00013546812,0.9061252,0.0013195887,0.07513468,0.00042174855,0.00012774492],"about_ca_topic_score_codex":0.000002239269,"about_ca_topic_score_gemma":7.198496e-7,"teacher_disagreement_score":0.9135106,"about_ca_system_score_codex":0.000004842009,"about_ca_system_score_gemma":0.000024317835,"threshold_uncertainty_score":0.5541527},"labels":[],"label_agreement":null},{"id":"W2911617544","doi":"10.1007/978-3-030-13435-8_15","title":"State Complexity of Pseudocatenation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Alphabet; Deterministic finite automaton; Combinatorics; Upper and lower bounds; State (computer science); Mathematics; Nondeterministic algorithm; Nondeterministic finite automaton; Discrete mathematics; Word (group theory); Finite-state machine; Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.025421893009769405,"score_gpt":0.24552281160870568,"score_spread":0.22010091859893627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911617544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005422036,0.00020825065,0.9929711,0.00041666662,0.0013534469,0.0002997503,0.000010707075,0.00012418057,0.0040736524],"genre_scores_gemma":[0.6234276,0.000051580646,0.3743711,0.0011125271,0.00018043583,0.0000033516033,0.000011060877,0.000040479666,0.0008018124],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970218,0.00003465003,0.0005344261,0.0010639268,0.00089192967,0.00045327502],"domain_scores_gemma":[0.9974517,0.00032743244,0.00043276997,0.0014338194,0.00026206765,0.000092199916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009242818,0.00037344883,0.0005335715,0.00067554263,0.00009468151,0.00021228925,0.0032142717,0.0001710034,0.000028033919],"category_scores_gemma":[0.000042980028,0.00033064923,0.00012302717,0.00047394764,0.000995024,0.00058407563,0.0012079689,0.00045262717,0.00007353604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068887216,0.000038710117,0.00006290998,0.000096974094,0.000014382117,0.000026270582,0.0007721477,0.017030325,0.0007689033,0.34306327,0.000024593232,0.6380946],"study_design_scores_gemma":[0.00017383692,0.00010543236,0.00036674947,0.00022395176,0.0000031161403,0.000024765928,6.959358e-8,0.43110278,0.0039390363,0.5634733,0.00023807798,0.00034889058],"about_ca_topic_score_codex":0.000030317084,"about_ca_topic_score_gemma":0.000026743943,"teacher_disagreement_score":0.63774574,"about_ca_system_score_codex":0.00016282315,"about_ca_system_score_gemma":0.0005053388,"threshold_uncertainty_score":0.9999145},"labels":[],"label_agreement":null},{"id":"W2912094370","doi":"10.1016/s0304-3975(01)00212-2","title":"Palindrome complexity","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst; University of Alberta","keywords":"Palindrome; Mathematics; Morphism; Sequence (biology); Combinatorics; Upper and lower bounds; Discrete mathematics; Class (philosophy); Computer science","score_opus":0.019404880997357755,"score_gpt":0.2512589619389404,"score_spread":0.2318540809415826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912094370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03651332,0.000029222174,0.9418839,0.00055255665,0.00079066947,0.000109522014,9.46995e-7,0.00038728476,0.01973257],"genre_scores_gemma":[0.7528226,0.0000014776953,0.24625452,0.0008587171,0.00004239865,0.0000033224046,2.7283627e-7,0.000005791199,0.000010933187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973189,0.00019809837,0.00026554812,0.00078566856,0.0007067015,0.0007250482],"domain_scores_gemma":[0.9980213,0.0002208614,0.00005926494,0.0012233389,0.00012330443,0.00035193315],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022966296,0.00019689206,0.00021936098,0.00016118182,0.00051240646,0.0005292414,0.002959863,0.000047977104,0.00018507676],"category_scores_gemma":[0.00012992045,0.0001590072,0.00007779185,0.0013318313,0.0037549364,0.00073362223,0.00070983655,0.00019374039,0.0003207526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011149916,0.00005134463,0.000039642193,0.0000027493093,0.0000021230753,0.000015460997,0.00015282711,0.00001641549,0.00035308162,0.9891718,0.000044717555,0.010148712],"study_design_scores_gemma":[0.00017933486,0.0000990507,0.0008066484,0.000011438793,0.0000018726188,0.00013631025,0.00000481185,0.18181989,0.005623507,0.81045085,0.00062327686,0.00024302854],"about_ca_topic_score_codex":0.0000016528803,"about_ca_topic_score_gemma":1.8860706e-7,"teacher_disagreement_score":0.71630925,"about_ca_system_score_codex":0.00005069088,"about_ca_system_score_gemma":0.00013073675,"threshold_uncertainty_score":0.99895626},"labels":[],"label_agreement":null},{"id":"W2912417747","doi":"","title":"Interpreted Trajectories","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Acadia University","funders":"","keywords":"Decidability; Equivalence (formal languages); Operand; Formalism (music); Turing; Computation; Mathematics; Computer science; Algebra over a field; Discrete mathematics; Algorithm; Pure mathematics; Arithmetic","score_opus":0.004391832578533249,"score_gpt":0.1974072551963312,"score_spread":0.19301542261779794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912417747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26314765,0.000097090655,0.6069908,0.0006298582,0.0009324443,0.00026021097,0.000011685819,0.001029904,0.12690035],"genre_scores_gemma":[0.98235524,0.0000017289356,0.01629951,0.0007968638,0.000060314018,0.000015804699,0.00001234938,0.0000054383318,0.0004527811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908465,0.000017859853,0.00031945627,0.00011399036,0.00020788464,0.00025612878],"domain_scores_gemma":[0.9993539,0.00006705926,0.000082726096,0.0004245057,0.000023073728,0.000048747443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015866535,0.00011937016,0.00012346641,0.000084075735,0.00009886129,0.0003288381,0.0006669754,0.000035701607,0.00013106687],"category_scores_gemma":[0.000012555159,0.000100153164,0.000055870918,0.00023044596,0.000051021263,0.0012981029,0.00019596983,0.00007841449,0.00043625614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007657281,0.00007911963,0.00128043,0.000049931863,0.000024718163,0.0000074189747,0.0026861005,0.00004076978,0.0009267125,0.93815863,0.024465544,0.032272957],"study_design_scores_gemma":[0.002788145,0.0006034523,0.028898535,0.00027231508,0.000036184738,0.00023225494,0.00225778,0.42409277,0.033789426,0.21418303,0.2908304,0.0020157206],"about_ca_topic_score_codex":0.000038275502,"about_ca_topic_score_gemma":0.0000038616377,"teacher_disagreement_score":0.7239756,"about_ca_system_score_codex":0.000047153862,"about_ca_system_score_gemma":0.000024807667,"threshold_uncertainty_score":0.56073356},"labels":[],"label_agreement":null},{"id":"W2912588130","doi":"10.1016/j.tcs.2011.12.024","title":"Relativized codes","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Canada Research Chairs","keywords":"Prefix code; Alphabet; Prefix; Mathematics; Class (philosophy); Factorization; Discrete mathematics; Block code; Word (group theory); Code (set theory); Set (abstract data type); Computer science; Combinatorics; Decoding methods; Linear code; Algorithm; Programming language; Linguistics","score_opus":0.018758539228213668,"score_gpt":0.230878302459858,"score_spread":0.21211976323164433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912588130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023701001,0.00002260974,0.9376823,0.0002194853,0.00053928903,0.00009427889,5.930815e-7,0.00048843067,0.037252024],"genre_scores_gemma":[0.69868517,0.0000019095949,0.30078143,0.0004651302,0.00004371711,0.0000035926205,1.5318078e-7,0.0000050349645,0.00001387299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978951,0.00011186592,0.00023801943,0.00066597847,0.0005214081,0.0005676246],"domain_scores_gemma":[0.9983282,0.00019692414,0.0000614554,0.0010386022,0.0001105079,0.0002642728],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016632852,0.00016865163,0.00019264134,0.00016488269,0.00035347915,0.00024293226,0.003322278,0.000047011345,0.00017965824],"category_scores_gemma":[0.00006796464,0.00012922267,0.000067358254,0.0010442793,0.0028480995,0.0009871935,0.0012266703,0.0001694404,0.00031457792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049082205,0.0000492058,0.00005895003,0.0000018165532,0.000002672671,0.000016188818,0.0009975968,0.0000023666985,0.00040709446,0.96695644,0.000037300153,0.03146547],"study_design_scores_gemma":[0.00016706108,0.00012772047,0.0018831905,0.000015353166,0.0000025634358,0.00004564454,0.0000060882776,0.2980994,0.010349356,0.68902564,0.00007600486,0.00020200008],"about_ca_topic_score_codex":0.0000042098936,"about_ca_topic_score_gemma":1.7435626e-7,"teacher_disagreement_score":0.67498416,"about_ca_system_score_codex":0.000031138537,"about_ca_system_score_gemma":0.00008187256,"threshold_uncertainty_score":0.9998656},"labels":[],"label_agreement":null},{"id":"W2912608078","doi":"10.1016/s0890-5401(03)00090-7","title":"Follow automata","year":2003,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nondeterministic finite automaton; Regular expression; Automaton; Nondeterministic algorithm; Quotient; Combinatorics; Computer science; Mathematics; Discrete mathematics; Equivalence relation; Deterministic automaton; Equivalence (formal languages); Theoretical computer science; Automata theory; Programming language","score_opus":0.009556904921695659,"score_gpt":0.22470565894381395,"score_spread":0.21514875402211828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912608078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027097285,0.000025481844,0.95827895,0.0002398164,0.00019210481,0.00006664002,5.9935536e-7,0.00023827417,0.013860856],"genre_scores_gemma":[0.9647955,0.000007779603,0.034333084,0.0008186159,0.000005686275,0.000004472786,0.000008832393,0.0000014911735,0.000024596826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995511,0.000029108607,0.00015694046,0.000063922686,0.000115039315,0.000083890016],"domain_scores_gemma":[0.99972016,0.000032410266,0.00006646724,0.00010272636,0.000040032977,0.000038220573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020194142,0.000055204542,0.00005118402,0.000079141806,0.00008843455,0.00023249789,0.00009912835,0.00002507395,0.0000059853865],"category_scores_gemma":[0.000026462532,0.000051021372,0.000015617352,0.00015346397,0.000010864445,0.0019538475,0.000027158827,0.000032217882,0.00009767753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.996964e-7,0.0000075700545,0.00005519853,0.000008167655,0.0000031470297,3.679655e-7,0.00077320286,0.00033140118,0.000012591021,0.59762055,0.0007433203,0.4004436],"study_design_scores_gemma":[0.0006953179,0.000043542557,0.0031942152,0.000010303386,0.0000023038565,0.00004829923,0.00015503893,0.89308196,0.0003512068,0.06465684,0.037604526,0.00015643645],"about_ca_topic_score_codex":0.0000029305895,"about_ca_topic_score_gemma":2.483504e-7,"teacher_disagreement_score":0.9376982,"about_ca_system_score_codex":0.000010017287,"about_ca_system_score_gemma":0.000021894673,"threshold_uncertainty_score":0.22419824},"labels":[],"label_agreement":null},{"id":"W2913164463","doi":"10.1007/978-3-642-31653-1_28","title":"Pseudoperiodic Words","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Alphabet; Generalization; Computer science; Word (group theory); Simple (philosophy); Natural number; Period (music); Natural (archaeology); Palindrome; Combinatorics; Artificial intelligence; Natural language processing; Arithmetic; Mathematics; Linguistics; History; Philosophy","score_opus":0.01386970247357725,"score_gpt":0.2304507232981848,"score_spread":0.21658102082460756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913164463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011688001,0.002560226,0.9856042,0.0005725628,0.0027969205,0.0002463142,0.00000361829,0.000329845,0.007769397],"genre_scores_gemma":[0.41091052,0.00024311894,0.57989836,0.0051637217,0.0020976425,0.000019318919,0.0000080518075,0.00009741072,0.0015618472],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614626,0.000035862777,0.0004809842,0.0013858101,0.0009867942,0.0009642609],"domain_scores_gemma":[0.99704283,0.00033280673,0.00024157883,0.0019898855,0.0001146057,0.0002782906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011739486,0.0005842281,0.00054530345,0.0007478142,0.0002801566,0.0007000638,0.0047853068,0.00034772206,0.00012794841],"category_scores_gemma":[0.000049553873,0.00050755567,0.00016425013,0.0006014608,0.00079430424,0.0009909754,0.0020249148,0.0008336508,0.00035144115],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018529305,0.000021560445,0.000038489645,0.000019045201,0.000006902652,0.000053283416,0.00077263714,0.0008574426,0.00012030886,0.077290006,0.000036527304,0.92078197],"study_design_scores_gemma":[0.000500973,0.00023262425,0.00038146324,0.0007761127,0.000021021862,0.00044722136,3.7698442e-7,0.33817917,0.002555446,0.63128287,0.0233515,0.002271206],"about_ca_topic_score_codex":0.000013270873,"about_ca_topic_score_gemma":0.000013471374,"teacher_disagreement_score":0.91851074,"about_ca_system_score_codex":0.0002537779,"about_ca_system_score_gemma":0.00041511032,"threshold_uncertainty_score":0.9997376},"labels":[],"label_agreement":null},{"id":"W2913376930","doi":"10.1016/j.tcs.2009.05.010","title":"Predictable semiautomata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science","score_opus":0.005467650429001623,"score_gpt":0.2282123256084742,"score_spread":0.22274467517947258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913376930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0216761,0.000048750437,0.9585672,0.0024174205,0.0005349795,0.0001255004,0.0000011973657,0.0010059712,0.015622887],"genre_scores_gemma":[0.8316801,0.0000035144276,0.16569507,0.002456113,0.00013790012,0.0000021995777,5.893592e-7,0.0000046307246,0.00001986833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728185,0.0000714684,0.00027165213,0.00081076956,0.000789406,0.0007748714],"domain_scores_gemma":[0.9979598,0.00014625424,0.00005982532,0.0013637688,0.000117148156,0.0003532069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015524109,0.00020269344,0.00021233942,0.00018990248,0.00044649633,0.0007042208,0.0042753955,0.00004516981,0.00006276896],"category_scores_gemma":[0.00006806454,0.00016164707,0.00006777565,0.0014209178,0.001343241,0.0013730815,0.00081875065,0.00019489163,0.00019818774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022080776,0.0000522731,0.000010176657,0.0000016491811,0.000001290803,0.000019983125,0.00013686092,0.000044706198,0.0011960082,0.90598404,0.00034682045,0.09220399],"study_design_scores_gemma":[0.00013670359,0.00019400973,0.0011075006,0.000019363608,0.000001905507,0.000091034366,0.0000020791317,0.5551643,0.0054205726,0.43740472,0.00027342243,0.0001843984],"about_ca_topic_score_codex":0.000001003829,"about_ca_topic_score_gemma":4.126983e-8,"teacher_disagreement_score":0.810004,"about_ca_system_score_codex":0.000055343833,"about_ca_system_score_gemma":0.00012628497,"threshold_uncertainty_score":0.794482},"labels":[],"label_agreement":null},{"id":"W2913518517","doi":"10.1016/j.ejc.2008.04.006","title":"Palindromic richness","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Conjecture; Mathematics; Class (philosophy); Word (group theory); Combinatorics; Property (philosophy); Sequence (biology); Pure mathematics; Computer science; Artificial intelligence","score_opus":0.01561513954250889,"score_gpt":0.19376765825863365,"score_spread":0.17815251871612475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913518517","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68397164,0.0008405576,0.2981847,0.00040117645,0.00255275,0.000037424677,4.2042853e-7,0.00008985566,0.013921483],"genre_scores_gemma":[0.9963782,0.0001268497,0.002951283,0.0001763769,0.00011719542,9.1346884e-8,1.4632398e-7,0.000015014329,0.00023488517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864495,0.00032041848,0.00040293596,0.00011428848,0.0003405096,0.00017690008],"domain_scores_gemma":[0.99891573,0.000080346836,0.0003518108,0.00034471427,0.0001746799,0.0001327128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010539901,0.00010721537,0.00018696445,0.00013338511,0.00012435252,0.000056036875,0.0013860184,0.000014815638,0.000008838007],"category_scores_gemma":[0.000068168796,0.00008864268,0.00010994553,0.00035578042,0.000045414596,0.0004092082,0.00017504566,0.00023866254,0.00010188548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004003777,0.0009134642,0.008542565,0.00003609323,0.00013977173,0.020757135,0.0041502398,0.00022181257,0.0021269051,0.89063203,0.0394342,0.033005755],"study_design_scores_gemma":[0.015439595,0.0052404655,0.3077445,0.0005541828,0.000114113616,0.0556534,0.00036855662,0.011579111,0.013722976,0.25785917,0.3288181,0.0029058333],"about_ca_topic_score_codex":1.8261912e-7,"about_ca_topic_score_gemma":6.861487e-9,"teacher_disagreement_score":0.63277286,"about_ca_system_score_codex":0.00003128217,"about_ca_system_score_gemma":0.000063693515,"threshold_uncertainty_score":0.36147434},"labels":[],"label_agreement":null},{"id":"W2918819669","doi":"10.1007/978-3-030-28796-2_6","title":"Critical Exponent of Infinite Balanced Words via the Pell Number System","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponent; Alphabet; Computation; Word (group theory); Critical exponent; Combinatorics on words","score_opus":0.01091101810620658,"score_gpt":0.23917438440136696,"score_spread":0.22826336629516036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918819669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035751896,0.00032183126,0.98670274,0.0006106698,0.0031049305,0.000359441,0.000007542362,0.00015394617,0.008381356],"genre_scores_gemma":[0.91499174,0.000016064925,0.08322477,0.0010684062,0.000383946,0.0000073827046,0.000002447502,0.00003465659,0.00027059793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962154,0.000087970584,0.00067816157,0.0011823911,0.0011858586,0.0006502192],"domain_scores_gemma":[0.99532235,0.0017583565,0.00031700157,0.0022054492,0.00026773108,0.00012909928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013068987,0.0004917724,0.0006651613,0.00029360462,0.00017609574,0.00037306963,0.004507618,0.0002880842,0.000045390756],"category_scores_gemma":[0.00010010935,0.0003430019,0.00020174746,0.0005259234,0.001033675,0.00047462195,0.0017165239,0.0007471855,0.0002162801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017705273,0.00006319184,0.00024569881,0.00040915897,0.00003164336,0.00011067433,0.002205477,0.008146906,0.0007109114,0.6724933,0.00007150061,0.31549385],"study_design_scores_gemma":[0.00036170313,0.00016931545,0.00041448092,0.001628176,0.000020372083,0.00028253172,0.0000022129398,0.865969,0.0020879698,0.12685496,0.0013204583,0.0008888231],"about_ca_topic_score_codex":0.00002430194,"about_ca_topic_score_gemma":0.000007850819,"teacher_disagreement_score":0.9146342,"about_ca_system_score_codex":0.00019765853,"about_ca_system_score_gemma":0.0003894943,"threshold_uncertainty_score":0.9999022},"labels":[],"label_agreement":null},{"id":"W2922093590","doi":"10.1007/978-3-030-23247-4_10","title":"Generalized de Bruijn Words and the State Complexity of Conjugate Sets","year":2019,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"De Bruijn sequence; Generalization; Word (group theory); Conjugate; State (computer science); Computer science; Arithmetic; Mathematics; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.01462106335471596,"score_gpt":0.25134246284634876,"score_spread":0.2367213994916328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922093590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45219147,0.00013539763,0.5464334,0.00081627857,0.00023976355,0.0001357705,0.0000011896931,0.000033398053,0.000013372005],"genre_scores_gemma":[0.8001015,0.000014738588,0.198293,0.0015613928,0.000020576725,0.0000029911675,3.1218005e-7,0.0000041264398,0.0000013327726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982738,0.00019275125,0.00025955227,0.00049904326,0.00035849717,0.0004163571],"domain_scores_gemma":[0.9984364,0.0005519588,0.00012829134,0.00074526615,0.00006247637,0.000075616925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018899477,0.0001535769,0.00028409928,0.00013736293,0.00011602602,0.00024361843,0.0017023344,0.000037508904,0.0000076276606],"category_scores_gemma":[0.0000619311,0.0000998838,0.000046443052,0.00090826926,0.0014444957,0.0003765798,0.00085797516,0.00018379805,0.0000061218243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012220701,0.00010430404,0.010846187,0.000088941655,0.000026782844,0.000024291618,0.022017239,0.078978576,0.013150323,0.1210974,0.00001623885,0.7535275],"study_design_scores_gemma":[0.0008414658,0.000041361534,0.0048013264,0.000031024476,0.0000013272168,0.000029414965,9.843276e-7,0.7611834,0.008699023,0.22424622,0.000011031575,0.0001134549],"about_ca_topic_score_codex":0.00021477333,"about_ca_topic_score_gemma":0.0000353622,"teacher_disagreement_score":0.75341403,"about_ca_system_score_codex":0.00003922911,"about_ca_system_score_gemma":0.00014430976,"threshold_uncertainty_score":0.53223044},"labels":[],"label_agreement":null},{"id":"W2922297948","doi":"10.1016/j.aim.2022.108513","title":"Scaling limits of permutation classes with a finite specification: A dichotomy","year":2022,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche; National Science Foundation","keywords":"Mathematics; Random permutation; Permutation (music); Separable space; Limit (mathematics); Substitution (logic); Combinatorics; Discrete mathematics; Scaling limit; Limiting; Simple (philosophy); Scaling; Symmetric group; Computer science","score_opus":0.01687842668211548,"score_gpt":0.2675458652067728,"score_spread":0.25066743852465734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922297948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10015996,0.001131875,0.89302504,0.00017099883,0.00013092234,0.00023806575,0.000005122409,0.000092607006,0.0050454205],"genre_scores_gemma":[0.8072623,0.00009845615,0.1924653,0.00004513838,0.000013056913,0.00005783259,0.0000027010979,0.00000733755,0.000047883306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991348,0.00004290993,0.00025458957,0.00016801554,0.00028459326,0.0001151355],"domain_scores_gemma":[0.9989051,0.00051047635,0.00020241606,0.00032884884,0.000034985347,0.000018151191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028977956,0.0000770252,0.00014008538,0.00009970067,0.00007460651,0.000025413436,0.00046064853,0.000011374789,0.00002901803],"category_scores_gemma":[0.00006132785,0.00006652992,0.00002187317,0.0005321604,0.000040500167,0.00044837545,0.00009081853,0.000092881106,0.0000033464878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019267964,0.0005445332,0.0012552676,0.00034167728,0.000014856984,0.000030079935,0.014344434,0.05535432,0.0007712316,0.86403924,0.000024260446,0.06326083],"study_design_scores_gemma":[0.00071793044,0.00021244003,0.0010733359,0.00023527563,0.000011798929,0.00006984169,0.0050074556,0.5620107,0.0028684381,0.42090756,0.006546326,0.00033891283],"about_ca_topic_score_codex":7.6460236e-7,"about_ca_topic_score_gemma":0.0000018422883,"teacher_disagreement_score":0.70710236,"about_ca_system_score_codex":0.000032154185,"about_ca_system_score_gemma":0.000029162664,"threshold_uncertainty_score":0.27130115},"labels":[],"label_agreement":null},{"id":"W2922342170","doi":"10.1016/j.tcs.2019.03.005","title":"Edit distance neighbourhoods of input-driven pushdown automata","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Deterministic pushdown automaton; Pushdown automaton; Neighbourhood (mathematics); Embedded pushdown automaton; Context-free language; Automaton; Discrete mathematics; Nondeterministic algorithm; Nested word; Deterministic context-free grammar; Mathematics; Computer science; Combinatorics; Regular language; Theoretical computer science; Automata theory; Nondeterministic finite automaton; Quantum finite automata; Context-free grammar; Rule-based machine translation; Artificial intelligence","score_opus":0.004905713422251415,"score_gpt":0.22424705956990149,"score_spread":0.21934134614765008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922342170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10647921,0.0000315678,0.8822357,0.00073437864,0.001552237,0.0002138038,0.000005349091,0.0003287932,0.008418938],"genre_scores_gemma":[0.9008819,0.0000050620215,0.098469794,0.00045228808,0.00013688096,0.0000042846027,0.0000016617439,0.000011426362,0.00003672552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966843,0.000117074305,0.00045455154,0.0009381854,0.0010800048,0.0007258596],"domain_scores_gemma":[0.99700856,0.00035735572,0.00017738674,0.001971014,0.00020346261,0.00028219688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014295953,0.0002550866,0.00039604816,0.00021849037,0.00018607284,0.00032279646,0.0051562493,0.000075302865,0.00023336265],"category_scores_gemma":[0.000072513525,0.00020511754,0.0001180286,0.0015218367,0.002282873,0.001159888,0.0020461348,0.00023080685,0.00029273343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007214204,0.00008328332,0.00033627287,0.000020767748,0.0000053032636,0.0000067456162,0.00033937275,0.00018745419,0.003195592,0.9673943,0.00006371945,0.028359978],"study_design_scores_gemma":[0.0003980717,0.00030803357,0.0030168567,0.00008983325,0.0000045166016,0.000033748107,0.000009327721,0.8385248,0.006295713,0.15036693,0.00062503124,0.0003270908],"about_ca_topic_score_codex":0.000003871034,"about_ca_topic_score_gemma":2.5884088e-7,"teacher_disagreement_score":0.8383374,"about_ca_system_score_codex":0.00006182101,"about_ca_system_score_gemma":0.00018023391,"threshold_uncertainty_score":0.958168},"labels":[],"label_agreement":null},{"id":"W2922460544","doi":"10.1016/j.ic.2019.03.003","title":"On store languages and applications","year":2019,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Nondeterministic algorithm; Pushdown automaton; Bounded function; Reachability; Set (abstract data type); Successor cardinal; Finite-state machine; Automaton; Theoretical computer science; Deterministic pushdown automaton; Decidability; Programming language; Algorithm; Nondeterministic finite automaton; Mathematics; Automata theory","score_opus":0.003813228071605732,"score_gpt":0.23946662207938194,"score_spread":0.2356533940077762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922460544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20494735,0.000049579925,0.7870558,0.00028312026,0.00005004173,0.00018673508,0.0000018375613,0.00013230772,0.0072932215],"genre_scores_gemma":[0.9962361,0.000008064491,0.0027760214,0.00091036246,0.000009794045,0.00000976904,0.000015701118,0.0000011923795,0.00003300061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997218,0.000009362812,0.00008631779,0.000061345025,0.000074057396,0.000047078338],"domain_scores_gemma":[0.9997788,0.000049439208,0.000046847188,0.0000782408,0.000022842562,0.000023850258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007370739,0.000041103605,0.000039503117,0.00006560909,0.00004871401,0.00013104908,0.00006093546,0.000019188254,0.0000045103066],"category_scores_gemma":[0.00000343862,0.000036345864,0.0000066149264,0.000075432115,0.000008887541,0.00075966644,0.00003204327,0.00003070129,0.000118990516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014428206,0.0000044966055,0.00012260406,0.000014603692,0.000001799319,5.8514246e-8,0.0006518221,0.00042717005,0.000015815593,0.49519548,0.00015164926,0.5034131],"study_design_scores_gemma":[0.0008300374,0.00014912071,0.03185308,0.000032137574,0.0000033540234,0.00002491223,0.00083260395,0.88412637,0.0001717267,0.060041066,0.02169232,0.00024329309],"about_ca_topic_score_codex":0.0000031486295,"about_ca_topic_score_gemma":2.0250572e-7,"teacher_disagreement_score":0.8836992,"about_ca_system_score_codex":0.0000063402504,"about_ca_system_score_gemma":0.000006511489,"threshold_uncertainty_score":0.15294221},"labels":[],"label_agreement":null},{"id":"W2922654736","doi":"10.23638/dmtcs-22-1-3","title":"A Characterization of Morphic Words with Polynomial Growth","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zigzag; Multilinear map; Word (group theory); Morphism; Mathematics; String (physics); Combinatorics; Characterization (materials science); Polynomial; Type (biology); Discrete mathematics; Pure mathematics; Physics","score_opus":0.012555062082393343,"score_gpt":0.23269367976107758,"score_spread":0.22013861767868423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922654736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09417795,0.000012162186,0.90174156,0.0015775779,0.00048743005,0.0005121058,0.000035530935,0.000304823,0.0011508361],"genre_scores_gemma":[0.6990397,0.0000071220193,0.30047163,0.00025399314,0.00015683551,0.000023145334,0.000014193023,0.000029462988,0.0000039293077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556345,0.00013381224,0.0008229529,0.001362902,0.0014595329,0.00065734296],"domain_scores_gemma":[0.9965193,0.00024823647,0.0006738649,0.0018024753,0.00036943468,0.0003866796],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012524732,0.00056868786,0.0008766008,0.00032468585,0.0002251041,0.0008744391,0.0055742525,0.00018905524,0.000039960316],"category_scores_gemma":[0.000121450066,0.0004228303,0.00020355434,0.0012598477,0.0029627604,0.0005696684,0.0056557856,0.00063403806,0.00002388364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016537011,0.00010920591,0.000014264777,0.00034768382,0.0000323368,0.000021594627,0.0031783688,0.00003653988,0.010414018,0.98455757,0.000013288615,0.0012585977],"study_design_scores_gemma":[0.00021516,0.00022476091,0.00016384912,0.0005204567,0.000037091537,0.00003438002,0.00002213802,0.67508566,0.013938386,0.30926,0.000005564684,0.0004925622],"about_ca_topic_score_codex":0.0000041971034,"about_ca_topic_score_gemma":2.3383674e-7,"teacher_disagreement_score":0.67529756,"about_ca_system_score_codex":0.00005969045,"about_ca_system_score_gemma":0.00044835123,"threshold_uncertainty_score":0.9998224},"labels":[],"label_agreement":null},{"id":"W2936148280","doi":"10.1007/978-3-030-28796-2_10","title":"Circularly Squarefree Words and Unbordered Conjugates: A New Approach","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Square-free integer; Conjugate; Word (group theory); Mathematics; Binary number; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.017454630119164944,"score_gpt":0.24844484626922583,"score_spread":0.23099021615006088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936148280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012595469,0.0014929915,0.9815474,0.0010828299,0.0021860385,0.000674871,0.0000052349683,0.0003129733,0.000102197526],"genre_scores_gemma":[0.6029422,0.000029759407,0.39559135,0.0011703772,0.00022364405,0.000014016238,0.0000056046206,0.000018238716,0.0000047785534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99491423,0.00016797015,0.0005160778,0.002605995,0.0009049135,0.00089079054],"domain_scores_gemma":[0.99603236,0.0004889493,0.00027605725,0.002771664,0.00012678506,0.00030420886],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015239366,0.00060523656,0.0007070127,0.00067543495,0.0001924139,0.0021469104,0.0055507775,0.0004036267,0.000008461997],"category_scores_gemma":[0.0001896754,0.0005414979,0.00012737203,0.0016679829,0.00055585196,0.00076651917,0.006552159,0.001167657,0.000031104548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011174679,0.00014665956,0.0019155816,0.0003308812,0.000035642308,0.00005712938,0.00910823,0.15590419,0.0012064818,0.005912148,0.00006664492,0.8253052],"study_design_scores_gemma":[0.00045596348,0.00006817542,0.0009818655,0.00027533,0.0000073468195,0.000073335774,0.000002363592,0.879479,0.00065755,0.11728884,0.00006484758,0.0006453668],"about_ca_topic_score_codex":0.0002893239,"about_ca_topic_score_gemma":0.000021427064,"teacher_disagreement_score":0.8246599,"about_ca_system_score_codex":0.00018581463,"about_ca_system_score_gemma":0.0012643338,"threshold_uncertainty_score":0.99982965},"labels":[],"label_agreement":null},{"id":"W2940923581","doi":"10.4230/lipics.mfcs.2017.24","title":"Better Complexity Bounds for Cost Register Automata","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Register (sociolinguistics); Automaton; Register allocation; Theoretical computer science; Parallel computing; Programming language","score_opus":0.06230586614724938,"score_gpt":0.3169479117971421,"score_spread":0.25464204564989273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940923581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058506615,0.000036755144,0.91353786,0.005627137,0.0033519634,0.0030831767,0.0015079275,0.00082297367,0.013525616],"genre_scores_gemma":[0.7579199,0.000024588686,0.22684056,0.010227582,0.0008305914,0.0008485081,0.0009237446,0.00013279411,0.00225171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966736,0.000035788784,0.001125181,0.00049666164,0.0005317186,0.0011370409],"domain_scores_gemma":[0.99471533,0.0002269773,0.0010013805,0.0034478833,0.0003158252,0.00029262932],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011607689,0.00052393007,0.0006405488,0.00019194266,0.0018855896,0.0031367375,0.00459558,0.00026429124,0.000030472595],"category_scores_gemma":[0.00021301549,0.00046278475,0.00044730073,0.00010562208,0.00048284905,0.004220845,0.0013834428,0.0003396907,0.00019747936],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037704693,0.0009905692,0.008425063,0.002028515,0.00060707785,0.000025103307,0.010824465,0.000025582758,0.00020506905,0.55599827,0.20385808,0.21663518],"study_design_scores_gemma":[0.006566211,0.00034534818,0.0062359553,0.00025210044,0.00005456874,0.000107305015,0.00024996136,0.30769938,0.001087946,0.036218055,0.6400448,0.0011383526],"about_ca_topic_score_codex":0.000029857523,"about_ca_topic_score_gemma":0.000032434727,"teacher_disagreement_score":0.6994133,"about_ca_system_score_codex":0.00014048215,"about_ca_system_score_gemma":0.000093787225,"threshold_uncertainty_score":0.9997824},"labels":[],"label_agreement":null},{"id":"W2941395296","doi":"10.1007/978-3-030-28796-2_11","title":"The Undirected Repetition Threshold","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Conjecture; Combinatorics; Infimum and supremum; Mathematics; Repetition (rhetorical device); Physics; Philosophy","score_opus":0.012675204938594394,"score_gpt":0.2475024252707532,"score_spread":0.2348272203321588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941395296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013628258,0.00077703735,0.9749479,0.0028623813,0.0068045426,0.00044157944,0.0000026915563,0.00037421827,0.00016138112],"genre_scores_gemma":[0.88385916,0.000079974336,0.11452474,0.0011508027,0.00033416215,0.00002545351,0.000004389957,0.000015241318,0.0000060848665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962243,0.00013767896,0.00043862214,0.0015466798,0.00089902844,0.0007536863],"domain_scores_gemma":[0.9955585,0.0008722889,0.00027145902,0.003006616,0.00018973426,0.000101406746],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021160953,0.0003756202,0.0003396013,0.00033368715,0.00046430418,0.0019044324,0.0066947173,0.00024409585,0.0000045516363],"category_scores_gemma":[0.0001944763,0.00026005265,0.00013035756,0.0015252912,0.0005421884,0.0004534845,0.005452965,0.001068904,0.00005439782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076083284,0.0000623288,0.00082647573,0.000055871064,0.000014407122,0.00003877315,0.0010449524,0.33242652,0.00058512477,0.016778348,0.00009924043,0.6480604],"study_design_scores_gemma":[0.000108612076,0.000037161106,0.0020240599,0.00018990079,0.0000024536143,0.000022283104,3.3090217e-7,0.79607844,0.0031811208,0.19785842,0.00018580102,0.00031140764],"about_ca_topic_score_codex":0.000050596234,"about_ca_topic_score_gemma":0.000051680992,"teacher_disagreement_score":0.8702309,"about_ca_system_score_codex":0.00025385618,"about_ca_system_score_gemma":0.0006242852,"threshold_uncertainty_score":0.99998516},"labels":[],"label_agreement":null},{"id":"W2941439348","doi":"10.48550/arxiv.1904.11100","title":"Decision Problems for Restricted Variants of Two-Dimensional Automata","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic finite automaton; Deterministic automaton; Nondeterministic algorithm; Decidability; Discrete mathematics; Deterministic finite automaton; Mathematics; Combinatorics; Decision problem; Two-way deterministic finite automaton; Unary operation; Büchi automaton; Undecidable problem; Equivalence (formal languages); Automaton; Automata theory; Finite-state machine; Computer science; Algorithm; Theoretical computer science","score_opus":0.05830578397450525,"score_gpt":0.20406357862047086,"score_spread":0.1457577946459656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941439348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34931585,0.000048623762,0.64835095,0.000032836648,0.00094381435,0.0005941762,0.000069492846,0.00021729883,0.00042693474],"genre_scores_gemma":[0.9765687,0.000025842168,0.022596342,0.000052458803,0.00004333353,0.0000018919258,0.000044196506,0.000021778715,0.0006454433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979186,0.000105156905,0.00033653673,0.0011285475,0.00016398284,0.0003471927],"domain_scores_gemma":[0.9967647,0.0005960033,0.00046705743,0.0017828391,0.0002713064,0.00011809177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040995952,0.000300243,0.00045987844,0.0003494244,0.000096472,0.00007069716,0.0023281595,0.0002760627,0.00002119926],"category_scores_gemma":[0.000080779966,0.00031190657,0.00025762603,0.00055574084,0.00007251246,0.00035804862,0.002551796,0.00029298107,0.00005027424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009598261,0.00024155798,0.0005146644,0.00019989576,0.000120970006,0.000058036025,0.00009335309,0.6837567,0.00079348066,0.3104557,0.0012491241,0.0024205097],"study_design_scores_gemma":[0.0012395795,0.00008971639,0.002160585,0.00028600602,0.00004198711,0.000004909155,0.0000050556487,0.79018587,0.00017384338,0.20539083,0.00012863254,0.0002930025],"about_ca_topic_score_codex":0.00009100031,"about_ca_topic_score_gemma":0.000008250286,"teacher_disagreement_score":0.6272529,"about_ca_system_score_codex":0.000105322375,"about_ca_system_score_gemma":0.000333257,"threshold_uncertainty_score":0.9999333},"labels":[],"label_agreement":null},{"id":"W29419446","doi":"10.3899/jrheum.171196","title":"On Pregroups, Freedom, and (Virtual) Conceptual Necessity","year":2006,"lang":"en","type":"article","venue":"The Journal of Rheumatology","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rotation formalisms in three dimensions; Minimalist program; Computer science; Chomsky hierarchy; Formalism (music); Grammar; Transformational grammar; Natural language; Theoretical linguistics; Linguistics; Generative grammar; Mathematics; Programming language; Artificial intelligence; Formal language; Geometry; Philosophy","score_opus":0.00685313990406954,"score_gpt":0.20728176299071827,"score_spread":0.20042862308664872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29419446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9320521,0.00071067695,0.06513329,0.0012232136,0.00046813418,0.000036428726,7.687095e-7,0.00002639786,0.00034902332],"genre_scores_gemma":[0.9982661,0.000115549105,0.0013235515,0.00021416736,0.00001726662,4.0093428e-7,2.0163696e-7,0.0000049211767,0.000057845824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989443,0.00026671414,0.00032741632,0.00009975223,0.00017951347,0.0001823235],"domain_scores_gemma":[0.9984403,0.00084277877,0.00034786077,0.0002676197,0.000053250533,0.000048161175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007408767,0.000104201645,0.0002521616,0.00007233241,0.00012479778,0.000040474562,0.0007887206,0.00005956843,0.000015955575],"category_scores_gemma":[0.00006794149,0.000061127255,0.000046294826,0.00010322455,0.00031864937,0.00023804637,0.0001481658,0.00022973015,0.000013484513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050860926,0.00006243848,0.0070220837,0.0000041040407,0.00002423483,0.000013152861,0.00079327996,0.00027572707,0.0002816422,0.97884035,0.008553553,0.004078577],"study_design_scores_gemma":[0.007758281,0.0041363942,0.066420406,0.0005707681,0.00011999008,0.04485002,0.0021523207,0.03714928,0.0026848044,0.8227523,0.010309459,0.0010960067],"about_ca_topic_score_codex":0.0001188104,"about_ca_topic_score_gemma":0.000020405167,"teacher_disagreement_score":0.15608807,"about_ca_system_score_codex":0.000014185468,"about_ca_system_score_gemma":0.00003667793,"threshold_uncertainty_score":0.24926972},"labels":[],"label_agreement":null},{"id":"W2942306020","doi":"10.1007/978-3-030-28796-2_7","title":"Repetitions in Infinite Palindrome-Rich Words","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alphabet; Word (group theory); Combinatorics on words; Repetition (rhetorical device); Exponent; Construct (python library)","score_opus":0.013142131746093222,"score_gpt":0.23493822697104802,"score_spread":0.2217960952249548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942306020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079816475,0.00042054936,0.9784488,0.0007984742,0.0022225853,0.0003884077,0.000008700942,0.00020485699,0.016709454],"genre_scores_gemma":[0.6095248,0.00019748037,0.38040283,0.005945374,0.0007861926,0.000029924719,0.000027025342,0.00010559421,0.0029807547],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959,0.00005446577,0.00066365954,0.0016963216,0.00090782746,0.00077775866],"domain_scores_gemma":[0.99657744,0.000749333,0.000277837,0.0021242797,0.000127964,0.00014314614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012540322,0.0005310377,0.00061349064,0.0015222335,0.00015041875,0.000548088,0.0039036958,0.00039094896,0.0000853538],"category_scores_gemma":[0.00010508609,0.0004989794,0.00013299144,0.0012709275,0.0004764934,0.0007413287,0.001678807,0.0010932394,0.0002695322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007633416,0.000093287534,0.00074697885,0.00008983481,0.000016619219,0.0004419973,0.0023367528,0.025110887,0.00014826919,0.33258182,0.000058357644,0.6383676],"study_design_scores_gemma":[0.00064878043,0.0002466068,0.001846991,0.0014494312,0.000008429118,0.00020824482,7.736715e-7,0.3796353,0.00040378026,0.6089436,0.0051064193,0.0015016682],"about_ca_topic_score_codex":0.00002540395,"about_ca_topic_score_gemma":0.00013198557,"teacher_disagreement_score":0.6368659,"about_ca_system_score_codex":0.00029785573,"about_ca_system_score_gemma":0.00069361343,"threshold_uncertainty_score":0.9997462},"labels":[],"label_agreement":null},{"id":"W2942381101","doi":"","title":"Two-Pattern Strings","year":2002,"lang":"en","type":"article","venue":"Murdoch Research Repository (Murdoch University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); McMaster University","funders":"","keywords":"Generalization; String (physics); Computer science; Class (philosophy); Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.053742380219074966,"score_gpt":0.2676355784846972,"score_spread":0.21389319826562225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942381101","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39041373,0.0008104829,0.060955282,0.0018521256,0.0011737997,0.00075533945,0.000009126779,0.0014872545,0.5425428],"genre_scores_gemma":[0.95123196,0.00008349302,0.001479309,0.00009902897,0.00026811805,0.0000034371515,0.0000021516921,0.000025996327,0.046806518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955486,0.00075320405,0.00027457735,0.0010079122,0.0012733567,0.0011423627],"domain_scores_gemma":[0.9969906,0.00042209338,0.000105639505,0.0015887278,0.00040757607,0.00048532334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008732062,0.00027721087,0.00028405653,0.0010976073,0.0011059308,0.0005812522,0.0033234884,0.0001399799,0.00017361842],"category_scores_gemma":[0.000070192116,0.00029669428,0.00018192548,0.0021920295,0.0003611159,0.0014712061,0.0013936841,0.00082955294,0.0006290585],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008996587,0.0016332384,0.009339068,0.00023266839,0.0004013339,0.020743594,0.0057393126,0.00024908406,0.06778095,0.6347881,0.04618857,0.21281411],"study_design_scores_gemma":[0.0068217907,0.0014522808,0.008054234,0.00049773615,0.00006678339,0.001245256,0.0027045277,0.24836293,0.07758137,0.0063070073,0.64389884,0.003007211],"about_ca_topic_score_codex":0.00052954437,"about_ca_topic_score_gemma":0.00001773933,"teacher_disagreement_score":0.6284811,"about_ca_system_score_codex":0.0004282106,"about_ca_system_score_gemma":0.000103534185,"threshold_uncertainty_score":0.9999485},"labels":[],"label_agreement":null},{"id":"W2942613632","doi":"10.1016/j.tcs.2019.05.010","title":"Palindromic Ziv–Lempel and Crochemore factorizations of m-bonacci infinite words","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Research in Fundamental Sciences; Fonds De La Recherche Scientifique - FNRS","keywords":"Palindrome; Fibonacci number; Word (group theory); Factorization; Variation (astronomy); Mathematics; Computer science; Combinatorics; Algorithm; Physics","score_opus":0.010676924602460596,"score_gpt":0.25030753162492947,"score_spread":0.23963060702246888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942613632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21909414,0.00015063495,0.7774992,0.0004071889,0.0012961684,0.00029219352,0.000022961074,0.00017763216,0.0010599019],"genre_scores_gemma":[0.9064618,0.000037754617,0.09308777,0.000240144,0.00012247654,0.000008150881,0.0000070162464,0.00001770882,0.000017219827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641687,0.0001410512,0.0006082708,0.0013454943,0.0008794207,0.00060887233],"domain_scores_gemma":[0.9965479,0.0005445271,0.00032304283,0.002004791,0.0002891794,0.00029055524],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014057681,0.00041946076,0.0006240993,0.0004186599,0.00022594834,0.00066134305,0.004343484,0.0002476906,0.000044387503],"category_scores_gemma":[0.00012905114,0.00036105557,0.00013907884,0.0008870318,0.003069332,0.00046973833,0.008580731,0.000629878,0.000032941385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005302381,0.000058050675,0.00033370027,0.00009717416,0.000013803638,0.0000054432876,0.0012289081,0.0006747213,0.00058078376,0.9796542,0.000030143814,0.017317794],"study_design_scores_gemma":[0.0002622555,0.00011394542,0.0034416,0.00026842768,0.000016994076,0.000028695331,0.000014921241,0.5959091,0.0040688203,0.39529565,0.00008112901,0.00049844367],"about_ca_topic_score_codex":0.000009280372,"about_ca_topic_score_gemma":4.0825418e-7,"teacher_disagreement_score":0.6873676,"about_ca_system_score_codex":0.000062290426,"about_ca_system_score_gemma":0.0004660292,"threshold_uncertainty_score":0.9998841},"labels":[],"label_agreement":null},{"id":"W2943660833","doi":"10.1017/jsl.2019.26","title":"AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Massey University; Russian Science Foundation; Kazan Federal University; Ministry of Education, India; Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Algebraic structure; Computer science; Presentation (obstetrics); Set (abstract data type); Automaton; Turing machine; Algebra over a field; Discrete mathematics; Mathematics; Theoretical computer science; Programming language; Pure mathematics","score_opus":0.004713833986705237,"score_gpt":0.20536240274780657,"score_spread":0.20064856876110132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943660833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951073,0.0008144613,0.0015242556,0.0008589178,0.0004446076,0.00007395591,5.971532e-7,0.000051011513,0.0011248931],"genre_scores_gemma":[0.9902434,0.000029138748,0.008619498,0.000777102,0.00014554466,3.9761713e-7,1.6925534e-7,0.0000072172606,0.0001775749],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998984,0.000073069146,0.00034807407,0.00014739644,0.00024433422,0.0002031346],"domain_scores_gemma":[0.999105,0.00013810475,0.00031873828,0.0002771739,0.0000499878,0.000111024594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043223318,0.0001258373,0.00032036696,0.00016480604,0.000045015113,0.00014916706,0.00065772847,0.00006244726,0.0002456215],"category_scores_gemma":[0.000040569867,0.00008535112,0.00008732568,0.00016000566,0.000040536026,0.00046493925,0.00014910733,0.0001631692,0.00011130558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004713424,0.00025804163,0.0069589885,0.00025779175,0.00041673667,0.00037537832,0.0055387584,0.00020326613,0.13873908,0.41029343,0.018532392,0.41837898],"study_design_scores_gemma":[0.0038622478,0.0015679168,0.22498335,0.00031525615,0.000090780166,0.007623388,0.0003298089,0.09335494,0.0063109077,0.6566534,0.003882865,0.0010251609],"about_ca_topic_score_codex":0.0000028995933,"about_ca_topic_score_gemma":8.570981e-8,"teacher_disagreement_score":0.41735384,"about_ca_system_score_codex":0.000024588744,"about_ca_system_score_gemma":0.000062912,"threshold_uncertainty_score":0.34805176},"labels":[],"label_agreement":null},{"id":"W2946240107","doi":"10.1016/j.tcs.2019.04.007","title":"Ranking and unranking fixed-density necklaces and Lyndon words","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ranking (information retrieval); Prefix; Combinatorics; Mathematics; Time complexity; Running time; Algorithm; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.003989916041867961,"score_gpt":0.20771983853182152,"score_spread":0.20372992248995356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946240107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5680674,0.000092843686,0.42971462,0.00043195742,0.00033927304,0.00010364184,2.684493e-7,0.00014318484,0.0011068309],"genre_scores_gemma":[0.94607466,0.000015455063,0.053075325,0.0007466434,0.00006854854,0.000001592921,2.0910818e-7,0.000007036907,0.000010536641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978037,0.000103788145,0.00020563006,0.00085248664,0.0005123394,0.0005220968],"domain_scores_gemma":[0.99858844,0.00042127605,0.00006372942,0.0006479106,0.000066542896,0.00021208989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001895419,0.00019608211,0.0002550028,0.00015843383,0.0003906967,0.0008379704,0.0012246121,0.000054623328,0.000029255727],"category_scores_gemma":[0.00004403105,0.000157542,0.00003421583,0.0006258829,0.0017462266,0.00096283306,0.0018164658,0.00019143366,0.000032617274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006659507,0.000012876721,0.0016176444,0.000013777374,0.0000029356936,0.000008121569,0.0007900693,0.000010060822,0.0018186239,0.9260891,0.0000068669046,0.069623254],"study_design_scores_gemma":[0.0004238875,0.00015428876,0.011249034,0.00009637851,0.0000051691623,0.00014157975,0.000027200485,0.71900785,0.0035201036,0.26499012,0.00006519855,0.00031918054],"about_ca_topic_score_codex":0.0000062088393,"about_ca_topic_score_gemma":5.1990617e-7,"teacher_disagreement_score":0.7189978,"about_ca_system_score_codex":0.000024489458,"about_ca_system_score_gemma":0.000044306078,"threshold_uncertainty_score":0.8080568},"labels":[],"label_agreement":null},{"id":"W2947749495","doi":"10.1007/s00224-019-09929-9","title":"Additive Number Theory via Automata Theory","year":2019,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Natural number; Palindrome; Mathematics; Base (topology); Basis (linear algebra); Automaton; Mathematical proof; Discrete mathematics; Representation (politics); Combinatorics; Computer science; Theoretical computer science","score_opus":0.0077621033940630585,"score_gpt":0.2280083916079614,"score_spread":0.22024628821389836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947749495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15400793,0.00040450357,0.7772339,0.000033843866,0.0028779996,0.00069075765,0.00007970058,0.0011758967,0.063495465],"genre_scores_gemma":[0.99343246,0.0000043106643,0.0029292912,0.00022349003,0.00026604297,0.00001283091,0.000025023237,0.000055173565,0.0030513674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944898,0.0025965772,0.00084024225,0.000777803,0.0006203129,0.0006752809],"domain_scores_gemma":[0.99173725,0.0053350157,0.00070826476,0.001872711,0.00019629038,0.00015049826],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0074471664,0.00043182747,0.0007900985,0.00018610666,0.00018837294,0.00017827115,0.0024111292,0.00018244787,0.0008818951],"category_scores_gemma":[0.00018808391,0.0003720616,0.00025736107,0.00050787564,0.00025862345,0.00050424587,0.0007924289,0.00031814413,0.0018586706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058645935,0.000094710405,0.00013323317,0.00013333834,0.00014161684,0.000012502019,0.0026006363,0.00030279302,0.000700853,0.95355386,0.0010130975,0.0412547],"study_design_scores_gemma":[0.001550229,0.0002811722,0.002567322,0.0014637907,0.000059482634,0.00045798204,0.0024169248,0.1599273,0.0028108258,0.8218666,0.005356016,0.0012423809],"about_ca_topic_score_codex":0.000012792676,"about_ca_topic_score_gemma":1.6826985e-7,"teacher_disagreement_score":0.83942455,"about_ca_system_score_codex":0.0000782291,"about_ca_system_score_gemma":0.00010405067,"threshold_uncertainty_score":0.99987316},"labels":[],"label_agreement":null},{"id":"W2948857561","doi":"10.1016/j.ipl.2020.106027","title":"Borders, palindrome prefixes, and square prefixes","year":2020,"lang":"en","type":"preprint","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prefix; Palindrome; Conjecture; Combinatorics; Mathematics; Alphabet; Bijection; Square (algebra); Linguistics; Geometry","score_opus":0.013896880524760269,"score_gpt":0.23957471478753883,"score_spread":0.22567783426277857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948857561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033079732,0.00077184197,0.92989,0.032558277,0.0008090656,0.0005286342,0.00004378742,0.0013130172,0.0010056631],"genre_scores_gemma":[0.9104982,0.00006495549,0.063149594,0.025711736,0.00017416892,0.000106929,0.00024606904,0.000028601895,0.000019756926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982402,0.000051088282,0.00056819327,0.00039814453,0.00043838908,0.0003040159],"domain_scores_gemma":[0.99870807,0.000036798887,0.0005459779,0.00049035,0.00009078934,0.00012799463],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00027613743,0.00033363246,0.00030683214,0.00022022829,0.00021203565,0.0018816333,0.0010020705,0.00019856374,0.0000066166667],"category_scores_gemma":[0.0000635966,0.00031917228,0.0000715045,0.0002483497,0.00008612672,0.0033511745,0.0011768176,0.0005365495,0.00004651452],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003612944,0.000054776076,0.00061754667,0.008409647,0.00013718565,0.00003094677,0.044674464,0.0025105204,0.0012340536,0.011514235,0.03142032,0.8993602],"study_design_scores_gemma":[0.0023302566,0.00018852003,0.009004852,0.004146314,0.00013717041,0.00023026565,0.0011452588,0.76815987,0.0031577768,0.048899893,0.1586156,0.0039842217],"about_ca_topic_score_codex":0.000021205153,"about_ca_topic_score_gemma":5.86611e-7,"teacher_disagreement_score":0.89537597,"about_ca_system_score_codex":0.00005630029,"about_ca_system_score_gemma":0.00017412422,"threshold_uncertainty_score":0.99992603},"labels":[],"label_agreement":null},{"id":"W2949256186","doi":"10.31857/s0869-56524862156-158","title":"Zeroone laws for sentences with k variables","year":2019,"lang":"en","type":"article","venue":"Доклады Академии наук","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Zero (linguistics); Mathematics; Random variable; Variable (mathematics); Graph; Combinatorics; Discrete mathematics; Law; Mathematical physics; Philosophy; Mathematical analysis; Statistics; Political science; Linguistics","score_opus":0.006313602605071225,"score_gpt":0.19395133374847678,"score_spread":0.18763773114340557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949256186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25068393,0.0003971342,0.72990215,0.002268788,0.0011653868,0.00087143114,0.000021007098,0.00068424287,0.01400591],"genre_scores_gemma":[0.9085111,0.0000146659,0.08572923,0.0010513632,0.00016207242,0.00006880427,0.000011263251,0.000026506512,0.0044249767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862397,0.000035588466,0.00018389951,0.00048911356,0.00025829868,0.000409149],"domain_scores_gemma":[0.9988014,0.00021933501,0.00010068737,0.00070923904,0.0000789482,0.000090357724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035218173,0.00018269976,0.00023621367,0.00007237014,0.000110286855,0.00019584963,0.00091935706,0.000062718216,0.00008928763],"category_scores_gemma":[0.000019140234,0.00013304234,0.00006819574,0.00028147272,0.000052487532,0.00057033706,0.00015178446,0.000087409484,0.0002319012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007809389,0.00020397517,0.005620524,0.00014266536,0.00010615407,0.000018725055,0.000967326,0.00029443522,0.010564064,0.9446763,0.010869532,0.02645825],"study_design_scores_gemma":[0.007608753,0.0029337173,0.010305356,0.00073325145,0.00011150416,0.00031677578,0.002074084,0.3095888,0.038624823,0.31358856,0.31101632,0.0030980716],"about_ca_topic_score_codex":0.000039293547,"about_ca_topic_score_gemma":0.000009247819,"teacher_disagreement_score":0.6578272,"about_ca_system_score_codex":0.00002159474,"about_ca_system_score_gemma":0.000068135996,"threshold_uncertainty_score":0.54253095},"labels":[],"label_agreement":null},{"id":"W2949299973","doi":"10.48550/arxiv.0911.5151","title":"Recurrent words with constant Abelian complexity","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Constant (computer programming); Abelian group; Mathematics; Pure mathematics; Computer science; Programming language","score_opus":0.06207296745981019,"score_gpt":0.2749516028501021,"score_spread":0.21287863539029192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949299973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8257285,0.0017248683,0.15375778,0.0034709673,0.0018849059,0.0006700127,0.000049940874,0.0011707613,0.011542285],"genre_scores_gemma":[0.9740559,0.00015024963,0.024236983,0.00109615,0.00020814112,0.000029603614,0.000039795024,0.00002560787,0.00015761207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9973661,0.00015827139,0.00042378088,0.0010633001,0.00043895625,0.0005496469],"domain_scores_gemma":[0.9973636,0.00007973502,0.00033005927,0.001892896,0.000117265394,0.00021643874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004811616,0.0004684905,0.00053766946,0.00014610276,0.00017294109,0.00025419306,0.0020929168,0.00020617641,0.00006025507],"category_scores_gemma":[0.000025161851,0.00037490885,0.0001498802,0.0003277077,0.00026911698,0.00020428738,0.001350198,0.00085338403,0.00019890317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021055443,0.0016438449,0.13841006,0.00064147345,0.00056339457,0.0010116781,0.0050818576,0.0004225265,0.0006638811,0.53942025,0.012034044,0.29989645],"study_design_scores_gemma":[0.0033938335,0.0016396865,0.57137686,0.005385028,0.00022070552,0.00033733252,0.00042851968,0.040808138,0.0037388888,0.32708982,0.039772455,0.0058087325],"about_ca_topic_score_codex":0.00006270959,"about_ca_topic_score_gemma":0.000044023356,"teacher_disagreement_score":0.4329668,"about_ca_system_score_codex":0.00012186663,"about_ca_system_score_gemma":0.00027256567,"threshold_uncertainty_score":0.9998703},"labels":[],"label_agreement":null},{"id":"W2949340385","doi":"10.48550/arxiv.0907.0159","title":"The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Prefix; Universality (dynamical systems); Mathematics; Computer science; Arithmetic; Linguistics; Philosophy; Physics","score_opus":0.05736920413176716,"score_gpt":0.277646012375562,"score_spread":0.22027680824379486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949340385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89786094,0.0016040801,0.09890358,0.0005281855,0.00015856103,0.0005328832,0.00017465523,0.00009012765,0.00014698808],"genre_scores_gemma":[0.9885154,0.00007369362,0.011153695,0.000033118133,0.000037333044,0.000008350016,0.00011504789,0.000010691463,0.000052683736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99848163,0.00016118582,0.00042118825,0.0004442634,0.0002677641,0.00022399318],"domain_scores_gemma":[0.99786234,0.0006238235,0.000510935,0.00073636346,0.00020712196,0.00005943113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007013117,0.00023040405,0.00041522057,0.00006393293,0.00014906151,0.000056574347,0.0010497309,0.00014327758,0.0000031104264],"category_scores_gemma":[0.000089001354,0.00016736254,0.00014502527,0.00012658461,0.00045359114,0.00012870893,0.00072556897,0.00020909734,3.9409898e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000712721,0.0004263168,0.17867579,0.0013401622,0.00038960273,0.0000040866385,0.005176067,0.0044482364,0.0011082933,0.7987811,0.0009747499,0.008604311],"study_design_scores_gemma":[0.00054299965,0.0001680847,0.71574277,0.00026416057,0.000047409874,0.0000029403827,0.00037167248,0.0211266,0.0029058224,0.25752506,0.00094375183,0.00035870494],"about_ca_topic_score_codex":0.00022579796,"about_ca_topic_score_gemma":0.0000498076,"teacher_disagreement_score":0.54125607,"about_ca_system_score_codex":0.000037217535,"about_ca_system_score_gemma":0.000121231555,"threshold_uncertainty_score":0.6824846},"labels":[],"label_agreement":null},{"id":"W2949449426","doi":"","title":"Extremal words in the shift orbit closure of a morphic sequence","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Lexicographical order; Word (group theory); Morphism; Closure (psychology); Mathematics; Combinatorics; Alphabet; Sequence (biology); Orbit (dynamics); Sigma; Binary number; Omega; Discrete mathematics; Arithmetic; Linguistics; Physics; Geometry","score_opus":0.08722468572650457,"score_gpt":0.19206390880599006,"score_spread":0.10483922307948548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949449426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9142321,0.00012523709,0.08283192,0.00025794422,0.00026051555,0.00030788092,0.000011500276,0.000099822704,0.001873091],"genre_scores_gemma":[0.99863845,0.00006548039,0.00078380917,0.0001579216,0.000045153807,0.0000022102838,0.0000047907865,0.000010938067,0.0002912284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998125,0.00032491065,0.00025221368,0.00080453634,0.00015116789,0.00034215802],"domain_scores_gemma":[0.99763274,0.00022813141,0.00028438572,0.001716929,0.000066983186,0.00007080774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006285471,0.00027793867,0.0003433311,0.00025090284,0.000067880974,0.000107456995,0.003985444,0.0002551062,0.000069903],"category_scores_gemma":[0.00003060817,0.00023549852,0.00019518948,0.000822045,0.00020104687,0.00040083638,0.0016236075,0.00068336696,0.000060641436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019584031,0.00019383107,0.018038023,0.00016106796,0.00005828449,0.0008045581,0.0032020824,0.036470238,0.00012802915,0.9396817,0.00029170862,0.0009508619],"study_design_scores_gemma":[0.0005508678,0.00007960736,0.028715087,0.0003831184,0.000049393766,0.00002203605,0.0004124839,0.4721866,0.00014271055,0.4966074,0.00020431043,0.0006463983],"about_ca_topic_score_codex":0.00063498196,"about_ca_topic_score_gemma":0.00007562115,"teacher_disagreement_score":0.44307435,"about_ca_system_score_codex":0.00008155303,"about_ca_system_score_gemma":0.00017941731,"threshold_uncertainty_score":0.9603351},"labels":[],"label_agreement":null},{"id":"W2949687231","doi":"10.1016/j.ic.2017.07.009","title":"Deletion operations on deterministic families of automata","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Bounded function; Deterministic pushdown automaton; Quotient; Computer science; Regular language; Discrete mathematics; Mathematics; Automaton; Nondeterministic finite automaton; Combinatorics; Theoretical computer science; Automata theory","score_opus":0.015235780528646823,"score_gpt":0.27170826713596813,"score_spread":0.2564724866073213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949687231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25607112,0.000005367093,0.7383963,0.00046475037,0.00019898305,0.0001108753,0.0000053833373,0.00009920737,0.004648058],"genre_scores_gemma":[0.9922208,0.000014816799,0.0074851164,0.00023633042,0.000011039079,0.000005873298,0.000015209986,0.0000015085036,0.000009300689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949944,0.000017734124,0.00021726638,0.00006938834,0.00013296625,0.0000631772],"domain_scores_gemma":[0.9994564,0.000038297498,0.00014994654,0.00025033945,0.000078642646,0.000026353622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001487461,0.000060388244,0.000073457944,0.00010084683,0.00031832283,0.00038627646,0.00023734331,0.000028507,0.0000017921261],"category_scores_gemma":[0.00006314464,0.00005498251,0.000017558192,0.000039010858,0.000044953988,0.0019221964,0.00007497891,0.000033671433,0.00002850103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057499574,0.000019885812,0.000062983614,0.000025975249,0.00000486601,3.893568e-7,0.0012099608,0.006103086,0.000088939494,0.2801812,0.00011121203,0.71218574],"study_design_scores_gemma":[0.00031897123,0.00008428093,0.024045525,0.000027703061,0.0000024403598,0.0000062213594,0.00007987358,0.9688855,0.0004209249,0.0056302734,0.00042733815,0.00007096407],"about_ca_topic_score_codex":0.000025087222,"about_ca_topic_score_gemma":0.0000018716545,"teacher_disagreement_score":0.9627824,"about_ca_system_score_codex":0.000009125053,"about_ca_system_score_gemma":0.000023016466,"threshold_uncertainty_score":0.37248728},"labels":[],"label_agreement":null},{"id":"W2949830328","doi":"10.48550/arxiv.1202.0276","title":"A combinatorial approach for solving certain nested recursions with non-slow solutions","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Recursion (computer science); Golomb coding; Interpretation (philosophy); Lambda; Tree (set theory); Sequence (biology); Monotone polygon; Mathematics; Combinatorics; Function (biology); Generating function; Discrete mathematics; Computer science; Algorithm; Physics; Geometry","score_opus":0.06844618958737558,"score_gpt":0.18510450200578585,"score_spread":0.11665831241841026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949830328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038553346,0.00006319353,0.9563924,0.00008369102,0.0012018268,0.00078601093,0.0000320926,0.0003714599,0.0025159987],"genre_scores_gemma":[0.9809698,0.000019649642,0.01817419,0.000051422587,0.00023672258,0.000013301095,0.00008018266,0.00003258566,0.0004221449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782795,0.00010607384,0.0001954434,0.0010403614,0.00011226079,0.00071789476],"domain_scores_gemma":[0.99766564,0.00023798207,0.00027577853,0.0013594213,0.00019883389,0.00026236405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050230767,0.00037945085,0.00040743483,0.00024671823,0.0005531106,0.00016765282,0.0018741522,0.0003500733,0.0000070499136],"category_scores_gemma":[0.00003478905,0.00038194182,0.00024509322,0.0005975998,0.00014632376,0.0005435049,0.0015819424,0.00052362913,0.000015541174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007318686,0.0004302986,0.0005081012,0.00012965551,0.00014951259,0.00002932191,0.000664444,0.0362126,0.000060662114,0.9604219,0.00088884786,0.000431446],"study_design_scores_gemma":[0.0014132395,0.00010718843,0.00045877098,0.0001440195,0.00017781531,0.00001186451,0.0002682768,0.92116594,0.00006587021,0.075049676,0.00041662413,0.0007207131],"about_ca_topic_score_codex":0.00011877446,"about_ca_topic_score_gemma":0.000008648332,"teacher_disagreement_score":0.9424164,"about_ca_system_score_codex":0.0002200239,"about_ca_system_score_gemma":0.00030609113,"threshold_uncertainty_score":0.99986327},"labels":[],"label_agreement":null},{"id":"W2949945653","doi":"10.48550/arxiv.math/0210182","title":"Approximation to real numbers by cubic algebraic integers II","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Exponent; Algebraic number; Mathematics; Transcendental number; Integer (computer science); Combinatorics; Real number; Degree (music); Discrete mathematics; Property (philosophy); Physics; Mathematical analysis; Computer science","score_opus":0.02501620453971207,"score_gpt":0.24668063431600107,"score_spread":0.221664429776289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949945653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86666304,0.00020132036,0.1150081,0.0029036473,0.001541762,0.00049572095,0.00002054183,0.00080820674,0.0123576345],"genre_scores_gemma":[0.98512757,0.000119071854,0.008795145,0.0013691379,0.00021548917,0.00011515433,0.00007066237,0.00004509322,0.004142666],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736404,0.00012177809,0.0005093904,0.001090442,0.0004047355,0.00050960976],"domain_scores_gemma":[0.99776745,0.000083369516,0.00027733835,0.001558999,0.000076863995,0.00023597416],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004793083,0.00041441442,0.000408154,0.00018598919,0.00020335845,0.00020290003,0.0021201526,0.0003115443,0.00014314038],"category_scores_gemma":[0.000074841846,0.00041214676,0.00018640887,0.00039705023,0.000065731074,0.000366388,0.002361754,0.00060519826,0.0008820773],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006331843,0.0015244444,0.046026886,0.00094228046,0.0006877296,0.00016768984,0.040965557,0.0019509614,0.025954146,0.11065175,0.5883795,0.18268572],"study_design_scores_gemma":[0.0048582964,0.0017219422,0.0771778,0.0038201855,0.00038859172,0.00023190248,0.0022581322,0.44963157,0.0801461,0.1611417,0.2037658,0.014857998],"about_ca_topic_score_codex":0.0003126756,"about_ca_topic_score_gemma":0.00001027518,"teacher_disagreement_score":0.44768062,"about_ca_system_score_codex":0.00019537157,"about_ca_system_score_gemma":0.000064908316,"threshold_uncertainty_score":0.9998959},"labels":[],"label_agreement":null},{"id":"W2950033168","doi":"10.48550/arxiv.1107.4654","title":"On abelian and additive complexity in infinite words","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Abelian group; Bounded function; Mathematics; Discrete mathematics; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.10706452918237605,"score_gpt":0.19396571086449196,"score_spread":0.08690118168211591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950033168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9046836,0.00006136926,0.07648369,0.00006343555,0.0004072732,0.00026266885,0.0000563747,0.00024132319,0.017740265],"genre_scores_gemma":[0.9983452,0.00013448719,0.00092331605,0.00020956833,0.000025577381,8.861048e-7,0.0000115748135,0.000011403642,0.00033800266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983697,0.00016159458,0.00015522365,0.00094665744,0.0000638486,0.00030299881],"domain_scores_gemma":[0.9985942,0.00018510035,0.00015815499,0.0008828536,0.00004403859,0.00013561726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002492752,0.000275926,0.000309481,0.00038266636,0.0000845023,0.00007940942,0.0011699011,0.00021450197,0.00006885737],"category_scores_gemma":[0.000028323071,0.0003075683,0.00008518375,0.000430845,0.00022281488,0.00026550196,0.001839157,0.00058892526,0.0000824117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000349052,0.000102081474,0.0012834491,0.000025649993,0.000029215546,0.000325058,0.00083510467,0.0012143691,0.0000040242144,0.9933115,0.0001601406,0.0026744844],"study_design_scores_gemma":[0.00057995087,0.00009260075,0.023051148,0.00024797666,0.000015351938,0.000004004915,0.00010315244,0.11310441,0.00007201177,0.861954,0.000269253,0.00050616777],"about_ca_topic_score_codex":0.00038383927,"about_ca_topic_score_gemma":0.00017526747,"teacher_disagreement_score":0.13135755,"about_ca_system_score_codex":0.00010269022,"about_ca_system_score_gemma":0.000076334225,"threshold_uncertainty_score":0.99993765},"labels":[],"label_agreement":null},{"id":"W2950107561","doi":"10.1142/s0129054118400051","title":"On the Density of Context-Free and Counter Languages","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of British Columbia","funders":"","keywords":"Undecidable problem; Deterministic pushdown automaton; Context-free language; Decidability; Mathematics; Regular language; Pushdown automaton; Discrete mathematics; Nondeterministic algorithm; Nested word; Word (group theory); Pumping lemma for regular languages; Combinatorics; Bounded function; Automaton; Nondeterministic finite automaton; Computer science; Finite-state machine; Automata theory; Quantum finite automata; Algorithm; Theoretical computer science; Rule-based machine translation; Programming language","score_opus":0.011998211497109624,"score_gpt":0.2856617002251832,"score_spread":0.2736634887280736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950107561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5107301,0.000028159035,0.48531145,0.0028370584,0.00075733,0.00002921082,0.0000024797694,0.0000055040614,0.00029873085],"genre_scores_gemma":[0.97276914,0.000007729574,0.02645699,0.0006117483,0.0001427303,2.801745e-7,1.3366882e-7,0.0000016733633,0.0000095918795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876726,0.00003715814,0.0003090105,0.00011886025,0.000684272,0.00008343224],"domain_scores_gemma":[0.9973803,0.0004040639,0.00040433725,0.00034840257,0.001424747,0.000038112645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010245937,0.000060702776,0.000109576176,0.00023718497,0.00009555204,0.00016712004,0.0027058523,0.000013921108,0.000017574137],"category_scores_gemma":[0.0002721385,0.00003956069,0.000047492525,0.00023155747,0.0008714819,0.00070656376,0.0004662006,0.0000719804,0.0000034121304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023580205,0.00009781341,0.0015337243,0.0000029101477,0.000051740073,0.000006689732,0.001426017,0.00004976435,0.004239843,0.9001661,0.0014088029,0.09099301],"study_design_scores_gemma":[0.0025216916,0.002252145,0.20816259,0.000829689,0.000034605633,0.0011727376,0.00046505925,0.2868055,0.1276774,0.3661542,0.0034546051,0.00046976822],"about_ca_topic_score_codex":0.000014236184,"about_ca_topic_score_gemma":0.0000052376186,"teacher_disagreement_score":0.5340119,"about_ca_system_score_codex":0.000027361919,"about_ca_system_score_gemma":0.00014183727,"threshold_uncertainty_score":0.5028192},"labels":[],"label_agreement":null},{"id":"W2950147499","doi":"","title":"Theory of Atomata","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic finite automaton; Deterministic finite automaton; Regular language; Deterministic automaton; Büchi automaton; Nondeterministic algorithm; Finite-state machine; Regular expression; Quotient; Automaton; Discrete mathematics; DFA minimization; Computer science; Mathematics; Combinatorics; Algorithm; Theoretical computer science; Automata theory; Programming language","score_opus":0.08135788777280233,"score_gpt":0.17228220593679217,"score_spread":0.09092431816398984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950147499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2921091,0.00015610372,0.6904293,0.000014002301,0.00053575676,0.00015214297,0.00001696942,0.00032485853,0.016261805],"genre_scores_gemma":[0.9965652,0.000099085424,0.0020506408,0.000062505285,0.00003226081,3.846605e-7,0.000006131901,0.000014930236,0.0011688556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984655,0.00020363834,0.00020012607,0.00079531333,0.00007150044,0.00026396857],"domain_scores_gemma":[0.9973693,0.00014154956,0.0003137871,0.0019704765,0.00009511577,0.00010980587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047698375,0.0002492081,0.0003455992,0.0002162863,0.000060648865,0.000035989953,0.003163108,0.0002383181,0.00011489193],"category_scores_gemma":[0.000025228552,0.00026476514,0.00023497948,0.0003398976,0.00017328419,0.00029160595,0.0032931622,0.00032969576,0.000110119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017102107,0.00007364781,0.00041968978,0.000067162386,0.00007296095,0.00010686343,0.00033231248,0.0009950412,0.000051465435,0.9959853,0.00018956226,0.0016888665],"study_design_scores_gemma":[0.0002396219,0.000038654525,0.0012414139,0.00011614189,0.000051838782,0.00000573185,0.00008022906,0.056264173,0.0015933269,0.93980974,0.00019691758,0.00036218727],"about_ca_topic_score_codex":0.000063420084,"about_ca_topic_score_gemma":0.0000036370527,"teacher_disagreement_score":0.7044561,"about_ca_system_score_codex":0.000049151808,"about_ca_system_score_gemma":0.00013212333,"threshold_uncertainty_score":0.99998045},"labels":[],"label_agreement":null},{"id":"W2950158923","doi":"10.48550/arxiv.0808.2417","title":"On NFAs Where All States are Final, Initial, or Both","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Automaton; Finite-state machine; Computer science; State (computer science); Nondeterministic finite automaton; Discrete mathematics; Mathematics; Theoretical computer science; Combinatorics; Programming language; Automata theory","score_opus":0.10069417776452155,"score_gpt":0.3076529819467308,"score_spread":0.20695880418220924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950158923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.979709,0.0011172636,0.011940823,0.0020968737,0.0016750123,0.00037889334,0.00006714614,0.00082827493,0.0021866695],"genre_scores_gemma":[0.9829798,0.0035942951,0.0040162303,0.0059030065,0.0005234071,0.00009656854,0.00008166522,0.00008467325,0.0027203897],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972483,0.0001691371,0.00045482945,0.0011143221,0.00043735772,0.00057605293],"domain_scores_gemma":[0.99710625,0.0003699153,0.00039982476,0.0018510121,0.000089030145,0.00018394279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027233135,0.0005169173,0.0005434088,0.0001653489,0.00018409452,0.00024962396,0.002273496,0.00032851048,0.00023104434],"category_scores_gemma":[0.00009615807,0.00041743545,0.00020744854,0.00020545059,0.00012560449,0.00028817353,0.0017931149,0.0008572791,0.0006914162],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059861713,0.0029190162,0.06378042,0.0018906336,0.0012482415,0.011846092,0.015282278,0.009775457,0.00053978845,0.02457717,0.8169282,0.05061406],"study_design_scores_gemma":[0.0066810283,0.0032245968,0.25991598,0.009979624,0.0003115894,0.0009455403,0.0015676538,0.08676783,0.012106325,0.13334203,0.4737484,0.011409441],"about_ca_topic_score_codex":0.0001323419,"about_ca_topic_score_gemma":0.000049152266,"teacher_disagreement_score":0.34317985,"about_ca_system_score_codex":0.00009659626,"about_ca_system_score_gemma":0.00025144411,"threshold_uncertainty_score":0.99982774},"labels":[],"label_agreement":null},{"id":"W2950350370","doi":"10.48550/arxiv.math/0602454","title":"On the rational subset problem for groups","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decidability; Mathematics; Free product; Monoid; Abelian group; Combinatorics; Discrete mathematics; Group (periodic table); Commutative property; Direct product; Free monoid; Product (mathematics)","score_opus":0.03801478463653996,"score_gpt":0.2499666468721628,"score_spread":0.21195186223562285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950350370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61667466,0.00018227438,0.3673586,0.008257886,0.0013645807,0.0012798228,0.00008240085,0.00040667912,0.004393102],"genre_scores_gemma":[0.98044765,0.0000069114403,0.014443957,0.002619167,0.0007188891,0.00052307267,0.00017620243,0.000030321724,0.0010338391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834484,0.0000961905,0.00030283103,0.00063119637,0.00028228518,0.00034265177],"domain_scores_gemma":[0.9979961,0.00061011454,0.0002141131,0.0010467197,0.000088274566,0.00004466385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073882483,0.00025842237,0.00021890608,0.000051530995,0.0002524435,0.00021858877,0.0016559635,0.00016617434,0.000034033135],"category_scores_gemma":[0.000058860158,0.00017775247,0.00019197943,0.00012397316,0.00006101521,0.00013299416,0.00076623145,0.0003727496,0.00013964705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010376104,0.00009587598,0.004989313,0.00005701578,0.000043249125,0.0000049247565,0.00018779331,0.0018603436,0.00013590924,0.92192566,0.06920794,0.0014816069],"study_design_scores_gemma":[0.0004170438,0.000109991175,0.06883007,0.00019015824,0.000023538243,0.000008108541,0.000013458319,0.034286294,0.0011935765,0.8822309,0.012080702,0.00061619363],"about_ca_topic_score_codex":0.00002347775,"about_ca_topic_score_gemma":0.000013333365,"teacher_disagreement_score":0.363773,"about_ca_system_score_codex":0.000054551198,"about_ca_system_score_gemma":0.00012304891,"threshold_uncertainty_score":0.7248535},"labels":[],"label_agreement":null},{"id":"W2950353433","doi":"","title":"There are k-uniform cubefree binary morphisms for all k >= 0","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Morphism; Sigma; Binary number; Mathematics; Word (group theory); Combinatorics; Pure mathematics; Discrete mathematics; Physics; Arithmetic; Geometry","score_opus":0.05784351900844131,"score_gpt":0.2664431063803424,"score_spread":0.2085995873719011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950353433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9052949,0.0019011166,0.08211088,0.0030310305,0.0024609577,0.00094581774,0.000104555016,0.0010106994,0.0031400358],"genre_scores_gemma":[0.9759778,0.0007864542,0.018085351,0.00223988,0.0006920433,0.00029021924,0.00010904815,0.00008999287,0.0017292355],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99737966,0.000068695925,0.00046488614,0.0011025572,0.00033979875,0.000644401],"domain_scores_gemma":[0.99671024,0.00018634851,0.00043709323,0.00234722,0.00013869698,0.00018037957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003740556,0.0005183149,0.0005609549,0.00016935004,0.00022457844,0.00014061146,0.0032677196,0.00043140815,0.000039183804],"category_scores_gemma":[0.00005868084,0.0004613112,0.0004104842,0.00018090346,0.00012224045,0.00035060014,0.002580852,0.00061185576,0.000286938],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042743885,0.004337903,0.23700626,0.0044796276,0.0034707957,0.0059394957,0.019478433,0.012886342,0.011785425,0.15952402,0.3979547,0.14270954],"study_design_scores_gemma":[0.0042226384,0.0010008081,0.31346095,0.002212983,0.0002777448,0.00057043636,0.0007185866,0.29159743,0.010313935,0.14963618,0.21947716,0.006511147],"about_ca_topic_score_codex":0.00006620883,"about_ca_topic_score_gemma":0.000010585772,"teacher_disagreement_score":0.27871108,"about_ca_system_score_codex":0.00011155975,"about_ca_system_score_gemma":0.0001605006,"threshold_uncertainty_score":0.9997839},"labels":[],"label_agreement":null},{"id":"W2950489119","doi":"10.48550/arxiv.0907.4667","title":"Further applications of a power series method for pattern avoidance","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Alphabet; Morphism; Combinatorics on words; Combinatorics; Mathematics; Sigma; Series (stratigraphy); Class (philosophy); Binary number; Word (group theory); Algebraic number; Upper and lower bounds; Discrete mathematics; Arithmetic; Computer science; Physics; Artificial intelligence; Geometry","score_opus":0.02269352017953786,"score_gpt":0.2917949579463926,"score_spread":0.26910143776685475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950489119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020663416,0.0007194531,0.9752444,0.0016661589,0.0002489784,0.0006300901,0.000048983457,0.00019709564,0.000581397],"genre_scores_gemma":[0.69538915,0.00008381927,0.3018076,0.0012072051,0.00018855803,0.000623339,0.00002460351,0.00003573168,0.00063996116],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985013,0.00009012929,0.00036062743,0.0006298569,0.0001620142,0.00025605585],"domain_scores_gemma":[0.99785453,0.00016758134,0.0003319489,0.001446578,0.00014042224,0.000058938607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051102875,0.00023914954,0.00036490714,0.00008723462,0.00006887254,0.00006142873,0.0014900194,0.00017776439,0.000024969606],"category_scores_gemma":[0.000027901735,0.00022261369,0.00020315693,0.00015902631,0.00005201601,0.00017478809,0.0006439401,0.00024233776,0.00003569744],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052628882,0.00080620835,0.022177417,0.0011002696,0.0004243393,0.000013256634,0.0096043125,0.0007210618,0.014204998,0.10167555,0.005459439,0.84376055],"study_design_scores_gemma":[0.0016695809,0.0006305837,0.16434066,0.0010551946,0.00019858386,0.00006615557,0.00061767007,0.029215077,0.08028288,0.58574516,0.13305688,0.003121561],"about_ca_topic_score_codex":0.000024347286,"about_ca_topic_score_gemma":0.0000067009673,"teacher_disagreement_score":0.84063894,"about_ca_system_score_codex":0.000025687463,"about_ca_system_score_gemma":0.000079816375,"threshold_uncertainty_score":0.90779227},"labels":[],"label_agreement":null},{"id":"W2950591547","doi":"10.48550/arxiv.cs/0604104","title":"On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Presentation (obstetrics); FTCS scheme; Mathematics; Type (biology); Automaton; Word (group theory); Discrete mathematics; Pure mathematics; Computer science; Ordinary differential equation; Mathematical analysis; Theoretical computer science; Differential equation; Geometry; Engineering","score_opus":0.04169870009626818,"score_gpt":0.25060793330755027,"score_spread":0.20890923321128207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950591547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977951,0.00045838903,0.010357434,0.00039826677,0.0017425703,0.00044130918,0.00007633916,0.0001095946,0.008465088],"genre_scores_gemma":[0.9987968,0.00001993281,0.00024613546,0.000109989654,0.000073366384,0.000015229511,0.000026161231,0.000016007143,0.0006963765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998303,0.00018291268,0.00048268653,0.0004702155,0.00032060652,0.00024057133],"domain_scores_gemma":[0.9970479,0.0007971315,0.00053010805,0.0014006303,0.00018161551,0.000042606967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067917816,0.00023975718,0.0004289608,0.00013148974,0.0000535468,0.000056254008,0.0014185315,0.00018580284,0.000029128778],"category_scores_gemma":[0.00017818545,0.00017411282,0.00013322756,0.00034595813,0.00018536532,0.00007228276,0.00057701516,0.00032121144,0.000043591393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016113644,0.000993825,0.045279093,0.001925361,0.00077129,0.00009258293,0.003292407,0.112449035,0.024936918,0.77818704,0.027246237,0.004665046],"study_design_scores_gemma":[0.0041093747,0.0023982807,0.08396542,0.011522229,0.00042455748,0.00006974655,0.002160388,0.69481784,0.11081456,0.07542911,0.009774496,0.004513979],"about_ca_topic_score_codex":0.0005284742,"about_ca_topic_score_gemma":0.0000041627363,"teacher_disagreement_score":0.70275795,"about_ca_system_score_codex":0.000042270334,"about_ca_system_score_gemma":0.00025247035,"threshold_uncertainty_score":0.7100115},"labels":[],"label_agreement":null},{"id":"W2951205465","doi":"10.48550/arxiv.1004.1890","title":"On the superimposition of Christoffel words","year":2010,"lang":"en","type":"preprint","venue":"Archipelago (Université du Québec à Montréal)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Superimposition; Conjecture; Mathematics; Root (linguistics); Pure mathematics; Arithmetic; Combinatorics; Linguistics; Computer science; Philosophy; Artificial intelligence","score_opus":0.006177373981429543,"score_gpt":0.17036645386233032,"score_spread":0.16418907988090078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951205465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93465656,0.0007829942,0.055125747,0.006784455,0.0005375136,0.00032061688,0.000029360783,0.000209331,0.001553427],"genre_scores_gemma":[0.9971027,0.000120489894,0.0020873733,0.00046558122,0.000093806135,0.000010260532,0.000014134842,0.000025391197,0.00008028051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981708,0.00020554652,0.00026318565,0.0006079835,0.00043619634,0.0003163159],"domain_scores_gemma":[0.99695134,0.0007173149,0.00030469845,0.0018186935,0.00008341437,0.00012451211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004193846,0.00034481773,0.00037928653,0.00024154119,0.00035238717,0.00009020496,0.0028902113,0.00025522514,0.00010874179],"category_scores_gemma":[0.00006751377,0.00027376233,0.0003375256,0.00022997869,0.00026702075,0.0001990193,0.0022730841,0.0011283619,0.000070058646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014366792,0.00037252414,0.00011241078,0.00010446317,0.00022963443,0.0001612593,0.13039942,0.00091752637,0.0071950764,0.78084826,0.0040305,0.07548526],"study_design_scores_gemma":[0.0029467086,0.0011763335,0.025111368,0.0012866567,0.0004055994,0.0002511178,0.015960027,0.34201607,0.011025292,0.58353126,0.012906537,0.0033830563],"about_ca_topic_score_codex":0.06275695,"about_ca_topic_score_gemma":0.024202265,"teacher_disagreement_score":0.34109855,"about_ca_system_score_codex":0.00014061881,"about_ca_system_score_gemma":0.00041237124,"threshold_uncertainty_score":0.99997145},"labels":[],"label_agreement":null},{"id":"W2951393208","doi":"10.48550/arxiv.1408.0389","title":"Bifix codes and interval exchanges","year":2014,"lang":"en","type":"preprint","venue":"Archipelago (Université du Québec à Montréal)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Interval (graph theory); Mathematics; Combinatorics","score_opus":0.008124256583171655,"score_gpt":0.17813909347262963,"score_spread":0.17001483688945798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951393208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79986376,0.005308101,0.18738538,0.005329739,0.00048179773,0.00024207143,0.000025766298,0.0005283025,0.0008350948],"genre_scores_gemma":[0.9905514,0.00080611603,0.0076142577,0.00055919576,0.00017475395,0.000009242404,0.000016512202,0.00003293815,0.00023554578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978667,0.00023028301,0.00023737227,0.00093530666,0.0002999384,0.00043039536],"domain_scores_gemma":[0.9978129,0.00038684177,0.0002449095,0.0012259927,0.0000703634,0.0002589939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003957396,0.00042086915,0.00054789806,0.00033918003,0.00031589033,0.00023986431,0.002010233,0.00021667268,0.000034901594],"category_scores_gemma":[0.00004507941,0.00043750388,0.000211449,0.00014568784,0.0002461008,0.00030128582,0.0056701656,0.00056134997,0.00007355577],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008612068,0.0001717365,0.0009585563,0.00040018366,0.00037909942,0.00036097408,0.17153326,0.00032768864,0.00038610073,0.09975399,0.005983524,0.7196588],"study_design_scores_gemma":[0.003233694,0.0007909933,0.042986702,0.0013851804,0.00041290437,0.0004770249,0.016224308,0.6493193,0.0005246805,0.20266733,0.077810645,0.0041672206],"about_ca_topic_score_codex":0.07868763,"about_ca_topic_score_gemma":0.07650477,"teacher_disagreement_score":0.71549153,"about_ca_system_score_codex":0.00013802551,"about_ca_system_score_gemma":0.00020839083,"threshold_uncertainty_score":0.99980766},"labels":[],"label_agreement":null},{"id":"W2951433852","doi":"10.1007/s00029-021-00629-2","title":"Noncommutative rational Pólya series","year":2021,"lang":"en","type":"preprint","venue":"Selecta Mathematica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Karl-Franzens-Universität Graz; Austrian Science Fund","keywords":"Mathematics; Noncommutative geometry; Formal power series; Series (stratigraphy); Corollary; Invertible matrix; Power series; Conjecture; Field (mathematics); Pure mathematics; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.01580780768877425,"score_gpt":0.256094717062033,"score_spread":0.24028690937325878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951433852","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019180125,0.0007177184,0.94970006,0.0032528057,0.00081324164,0.00051420263,0.000024610561,0.00079971604,0.024997497],"genre_scores_gemma":[0.4075576,0.00007209308,0.58909816,0.0005782635,0.0002374303,0.00022336293,0.00014143938,0.00005636397,0.0020352842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978905,0.00019867207,0.00044564492,0.00064908597,0.00047249562,0.00034364723],"domain_scores_gemma":[0.99781406,0.00034350893,0.00026569256,0.001250801,0.00023056768,0.000095383606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044751156,0.0003491865,0.00051410357,0.000111247275,0.00016194828,0.00082831766,0.001627829,0.00020174663,0.00030103326],"category_scores_gemma":[0.00019680588,0.0003206153,0.00018991264,0.00031684726,0.00008555141,0.00051362143,0.0020548503,0.00055601425,0.00013734371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070815436,0.00030409225,0.000010673823,0.0006922172,0.0002717129,0.00010568504,0.01504575,0.00013512741,0.0010936814,0.97301,0.0048245345,0.004499459],"study_design_scores_gemma":[0.00023221197,0.00007901053,0.00011138162,0.0006305564,0.000044534198,0.00023870665,0.00053052045,0.0806687,0.0124589875,0.90330166,0.0008662138,0.00083751953],"about_ca_topic_score_codex":0.0000065331287,"about_ca_topic_score_gemma":0.000007080954,"teacher_disagreement_score":0.3883775,"about_ca_system_score_codex":0.00007898958,"about_ca_system_score_gemma":0.0005243332,"threshold_uncertainty_score":0.9999246},"labels":[],"label_agreement":null},{"id":"W2951629521","doi":"10.1142/s0129054119400239","title":"Most Complex Non-Returning Regular Languages","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Concatenation (mathematics); Upper and lower bounds; Regular language; State (computer science); Semigroup; Discrete mathematics; Star (game theory); Mathematics; Combinatorics; Binary number; Automaton; Computer science; Algorithm; Theoretical computer science; Arithmetic","score_opus":0.02039698106508405,"score_gpt":0.31923168493430226,"score_spread":0.29883470386921823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951629521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07412583,0.00011497985,0.9167832,0.0018860061,0.0060785566,0.00012485069,0.000014742553,0.00003414512,0.0008376791],"genre_scores_gemma":[0.73393494,0.00003075625,0.26518056,0.00029935292,0.0004948668,0.0000014050444,0.00001115236,0.000008544518,0.000038437327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645036,0.000070336246,0.0009552232,0.0004445554,0.0018286749,0.00025082915],"domain_scores_gemma":[0.993739,0.00024597728,0.0017489225,0.00087550137,0.0032698025,0.000120760276],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0016316628,0.00023151486,0.00043201723,0.0008923899,0.000119445875,0.0010122919,0.008796656,0.00009084279,0.00003330401],"category_scores_gemma":[0.00016972012,0.00020996638,0.00021659913,0.0006078006,0.00042933668,0.0015465267,0.003168081,0.00048434507,0.000020596292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066115164,0.0008786859,0.003447446,0.00021978197,0.0010108724,0.00030029053,0.006619499,0.22096184,0.050949555,0.21710421,0.010705406,0.4877363],"study_design_scores_gemma":[0.00080838753,0.00022039344,0.021641167,0.001086594,0.00003204486,0.00052223314,0.00008190617,0.94044477,0.007667143,0.023824904,0.003169625,0.0005008598],"about_ca_topic_score_codex":0.00002886372,"about_ca_topic_score_gemma":0.0000013835206,"teacher_disagreement_score":0.7194829,"about_ca_system_score_codex":0.0002079279,"about_ca_system_score_gemma":0.0014590676,"threshold_uncertainty_score":0.99656624},"labels":[],"label_agreement":null},{"id":"W2951674483","doi":"10.48550/arxiv.1105.0086","title":"A Pattern Sequence Approach to Stern's Sequence","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Sequence (biology); Complement (music); Word (group theory); String (physics); Base (topology); Mathematics; Binary number; Integer (computer science); Bar (unit); Physics; Discrete mathematics; Arithmetic; Computer science; Geometry; Mathematical physics; Mathematical analysis; Chemistry","score_opus":0.1631295145464035,"score_gpt":0.19920289243417796,"score_spread":0.036073377887774455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951674483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19224213,0.000027448505,0.7967581,0.000052294195,0.0004905921,0.00036823243,0.000033694123,0.0005038763,0.0095236115],"genre_scores_gemma":[0.99125445,0.000040299936,0.0065511777,0.0006181677,0.00008171133,0.0000045374554,0.000017187695,0.000029213956,0.001403258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969256,0.00016548956,0.00024483833,0.0019168948,0.00015061336,0.0005965999],"domain_scores_gemma":[0.99687636,0.00006330937,0.00024288312,0.0023188686,0.00013358587,0.00036500974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038109548,0.0004732284,0.00043163748,0.0003035525,0.00014147461,0.00021773712,0.005024098,0.00030550075,0.00003130796],"category_scores_gemma":[0.000020822725,0.0005210632,0.00022405003,0.0006246322,0.00013416882,0.0005512659,0.0046551246,0.00062951684,0.00041956184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055249766,0.00063695037,0.004038223,0.00051295164,0.00029556834,0.0021696968,0.005783139,0.063718714,0.0014360227,0.892584,0.0011618768,0.027607583],"study_design_scores_gemma":[0.0006033907,0.00016163789,0.001521554,0.00042493275,0.000095498595,0.00007753121,0.00025356107,0.80555916,0.0013174518,0.18687774,0.00090213964,0.002205429],"about_ca_topic_score_codex":0.0006483275,"about_ca_topic_score_gemma":0.000016487049,"teacher_disagreement_score":0.7990123,"about_ca_system_score_codex":0.0002448994,"about_ca_system_score_gemma":0.0002040099,"threshold_uncertainty_score":0.9997241},"labels":[],"label_agreement":null},{"id":"W2951682701","doi":"10.48550/arxiv.1112.3758","title":"Filtrations of Formal Languages by Arithmetic Progressions","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arithmetic; Diagonal; Square (algebra); Context (archaeology); Mathematics; Sequence (biology); Formal language; Set (abstract data type); Filtration (mathematics); Computer science; Linguistics; Algorithm; Pure mathematics; Programming language; Philosophy; History","score_opus":0.04921501896387369,"score_gpt":0.18985637935941863,"score_spread":0.14064136039554492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951682701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24982628,0.00028512557,0.7384729,0.00006180783,0.00027909206,0.00028593707,0.00008302763,0.00030950384,0.010396331],"genre_scores_gemma":[0.99415624,0.00006624595,0.0042913887,0.000034399058,0.000020600968,0.0000014948956,0.000029823554,0.000009390472,0.0013904142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989431,0.0000791003,0.00016516045,0.00049484015,0.0000660412,0.0002517461],"domain_scores_gemma":[0.99860513,0.00007004753,0.00022904962,0.0009191306,0.000077693505,0.00009895458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001630185,0.00018240174,0.00022454596,0.00015089817,0.00010752888,0.000043925917,0.0014553984,0.00017396854,0.00008752389],"category_scores_gemma":[0.000019869372,0.00018409106,0.00014593138,0.00029496624,0.00012267876,0.0004002306,0.0012701891,0.00028387594,0.00002613203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011985904,0.00035988027,0.0011582465,0.00011932776,0.000113361624,0.000109854904,0.00097618875,0.0020464899,0.00074984535,0.9872804,0.0024649294,0.0046094856],"study_design_scores_gemma":[0.0016140275,0.00043240475,0.0052565746,0.00087436853,0.00036419704,0.00003749133,0.0013311662,0.5370817,0.02236774,0.42620385,0.0022907595,0.0021456867],"about_ca_topic_score_codex":0.00010595295,"about_ca_topic_score_gemma":0.000010729583,"teacher_disagreement_score":0.7443299,"about_ca_system_score_codex":0.0000305187,"about_ca_system_score_gemma":0.00010511571,"threshold_uncertainty_score":0.7507015},"labels":[],"label_agreement":null},{"id":"W2951958096","doi":"10.1142/s0129054120410075","title":"The Intersection Problem for Finite Semigroups","year":2020,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft","keywords":"Decidability; Special classes of semigroups; Intersection (aeronautics); Mathematics; Commutative property; Semigroup; Complexity class; Monoid; Bounded function; Class (philosophy); Word problem (mathematics education); Discrete mathematics; Morphism; Order (exchange); Krohn–Rhodes theory; Pure mathematics; Time complexity; Computer science; Arithmetic","score_opus":0.026329324620930957,"score_gpt":0.30822186272285923,"score_spread":0.28189253810192827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951958096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038180917,0.00010090983,0.97716045,0.009301853,0.009141371,0.00024244409,0.000015344667,0.00003725436,0.00018230351],"genre_scores_gemma":[0.63315654,0.000056536886,0.36564678,0.00026589417,0.00082884775,0.000013316596,0.0000053558356,0.000008697428,0.000018060908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971196,0.00006782874,0.0010079275,0.00038707445,0.0011969947,0.00022058745],"domain_scores_gemma":[0.99364346,0.0008952591,0.0017275673,0.000518803,0.003102147,0.000112756374],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020248895,0.00018928084,0.0002786378,0.00037748436,0.0002865948,0.0013975503,0.0077969977,0.00006848982,0.0000031190598],"category_scores_gemma":[0.00040247935,0.00014156627,0.00032898865,0.00043878725,0.00046096655,0.0012176413,0.0021178033,0.0004087227,0.0000041383832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009225533,0.00019187303,0.000090814916,0.00006183752,0.00038501972,0.0000134831935,0.0027048718,0.029928919,0.0022749382,0.4819533,0.0034658478,0.47883686],"study_design_scores_gemma":[0.0004206474,0.00027484202,0.00056503573,0.00033132415,0.000021448854,0.00010134776,0.00003901832,0.69607884,0.002210208,0.29175824,0.0080045955,0.000194459],"about_ca_topic_score_codex":0.00001006214,"about_ca_topic_score_gemma":0.0000041323783,"teacher_disagreement_score":0.6661499,"about_ca_system_score_codex":0.0002364924,"about_ca_system_score_gemma":0.0011972061,"threshold_uncertainty_score":0.9996391},"labels":[],"label_agreement":null},{"id":"W2951961788","doi":"10.48550/arxiv.1006.4104","title":"Abelian Primitive Words","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Abelian group; Combinatorics on words; Word (group theory); Rank of an abelian group; Mathematics; Context (archaeology); Arithmetic of abelian varieties; Set (abstract data type); Elementary abelian group; Enumeration; Pure mathematics; Discrete mathematics; Computer science; Biology; Geometry","score_opus":0.044369920398749686,"score_gpt":0.1752911875584094,"score_spread":0.1309212671596597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951961788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42103195,0.000055595505,0.5637926,0.0001959962,0.001599943,0.00024547955,0.000020225845,0.000646425,0.012411805],"genre_scores_gemma":[0.99324137,0.00008147333,0.0038585535,0.0002565419,0.00013506241,9.3985057e-7,0.000012890431,0.000020709387,0.0023924785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801224,0.00011019882,0.0001675167,0.0011960757,0.00009820151,0.00041577025],"domain_scores_gemma":[0.99756396,0.0001157502,0.00022305241,0.0017751119,0.00011333811,0.00020877722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002937029,0.00033934126,0.00031823255,0.000257578,0.00016082164,0.0001914168,0.0029441766,0.00045701978,0.00008164474],"category_scores_gemma":[0.000031439446,0.0003760693,0.00023193356,0.00047918808,0.00016074808,0.00039609993,0.0030461464,0.0011182448,0.00028732966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014109068,0.00012531014,0.000702393,0.000049218605,0.000094412004,0.00056228496,0.0005867926,0.0051721893,0.0003633951,0.985795,0.0006377092,0.005897176],"study_design_scores_gemma":[0.000779749,0.000080652884,0.005119192,0.00021707226,0.00009629782,0.000020992231,0.00017498701,0.558469,0.0016383986,0.42525622,0.0066995854,0.0014478398],"about_ca_topic_score_codex":0.00010542028,"about_ca_topic_score_gemma":0.00003786963,"teacher_disagreement_score":0.5722094,"about_ca_system_score_codex":0.00011128928,"about_ca_system_score_gemma":0.00021568727,"threshold_uncertainty_score":0.9998691},"labels":[],"label_agreement":null},{"id":"W2952125519","doi":"10.48550/arxiv.math/0610033","title":"Automata over a binary alphabet generating free groups of even rank","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Alphabet; Rank (graph theory); Automaton; Binary number; Combinatorics; Mathematics; Computer science; Arithmetic; Theoretical computer science","score_opus":0.024106702353282713,"score_gpt":0.2498368270045698,"score_spread":0.22573012465128708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952125519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9549972,0.0014213586,0.039514374,0.00037321853,0.0014305271,0.00035214738,0.000085636355,0.00064124604,0.0011843225],"genre_scores_gemma":[0.9662364,0.000081170074,0.03213292,0.00045149328,0.0005932923,0.00006132942,0.000104305815,0.000060852548,0.00027824857],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9966564,0.000231195,0.0008430746,0.0011235592,0.0005808015,0.0005649599],"domain_scores_gemma":[0.9955026,0.00021572373,0.000648048,0.0034054096,0.00010871282,0.00011949799],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080984953,0.0005214222,0.0007279295,0.00024632615,0.00015326445,0.00015932588,0.0038864387,0.00040115172,0.00005715482],"category_scores_gemma":[0.00010893146,0.00049979513,0.00034920993,0.00035876856,0.00012487307,0.00043682646,0.0058861785,0.0006377504,0.000062802705],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010494508,0.0027212675,0.50892705,0.0030353472,0.0013743382,0.0011688357,0.0050491467,0.01952789,0.12670645,0.06830388,0.20095593,0.062124923],"study_design_scores_gemma":[0.0021385981,0.00020667425,0.5053551,0.00095478835,0.00011309146,0.000044107863,0.000036722013,0.45712036,0.008327469,0.022188082,0.0018109315,0.0017040891],"about_ca_topic_score_codex":0.00048013902,"about_ca_topic_score_gemma":0.000021956308,"teacher_disagreement_score":0.43759248,"about_ca_system_score_codex":0.00009033746,"about_ca_system_score_gemma":0.00020130358,"threshold_uncertainty_score":0.99974537},"labels":[],"label_agreement":null},{"id":"W2952126735","doi":"10.48550/arxiv.1311.4448","title":"Most Complex Regular Right-Ideal Languages","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ideal (ethics); Mathematics; Quotient; State (computer science); Alphabet; Semigroup; Discrete mathematics; Sequence (biology); Regular language; Combinatorics; Pure mathematics; Computer science; Algorithm; Automaton; Theoretical computer science; Linguistics","score_opus":0.045525544993766064,"score_gpt":0.18543329295013616,"score_spread":0.1399077479563701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952126735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5081953,0.0002944323,0.46544343,0.0004767613,0.00083899975,0.00052861625,0.000050659724,0.001296362,0.022875475],"genre_scores_gemma":[0.99100465,0.000074550684,0.00415453,0.0003945832,0.00013739984,0.0000012914368,0.00005813656,0.000023553011,0.0041512894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792534,0.00017170898,0.00020406718,0.0011258185,0.00012274206,0.00045031216],"domain_scores_gemma":[0.9974372,0.00010970615,0.00023623428,0.0018626474,0.00014770596,0.00020650719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022536457,0.00036748344,0.00038824306,0.00018252591,0.00018589749,0.0002552341,0.0029329853,0.00029070885,0.0003594533],"category_scores_gemma":[0.00002040855,0.00038058983,0.00017194769,0.00051614497,0.00015420877,0.0004274031,0.002918471,0.0004861524,0.00060237694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068542377,0.000085583895,0.00039641093,0.00007119875,0.00010503881,0.00074890826,0.00020542798,0.008633184,0.00031203002,0.9734628,0.013989014,0.0019835257],"study_design_scores_gemma":[0.0006146104,0.000054367632,0.0043576052,0.00013670516,0.00006645408,0.000026389607,0.00018623067,0.69341904,0.00054877676,0.2877107,0.011819571,0.001059548],"about_ca_topic_score_codex":0.00059395493,"about_ca_topic_score_gemma":0.000024999947,"teacher_disagreement_score":0.68575215,"about_ca_system_score_codex":0.0001324012,"about_ca_system_score_gemma":0.00012631869,"threshold_uncertainty_score":0.9998646},"labels":[],"label_agreement":null},{"id":"W2952198339","doi":"10.48550/arxiv.1102.3932","title":"Fife's Theorem Revisited","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Calculus (dental); Medicine; Orthodontics","score_opus":0.06622231502230806,"score_gpt":0.17311808128531983,"score_spread":0.10689576626301177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952198339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12680171,0.00028309785,0.8240944,0.000084282525,0.00087777764,0.00033188838,0.00002089142,0.0010438199,0.0464621],"genre_scores_gemma":[0.99495083,0.00021708109,0.0021260749,0.00026931765,0.000096273805,6.5829437e-7,0.000016150536,0.00002213218,0.0023014888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979059,0.00020767999,0.00019876787,0.0012100354,0.000083627754,0.00039399986],"domain_scores_gemma":[0.9971215,0.00010585542,0.00025938835,0.0022199308,0.00011253662,0.00018079809],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004030693,0.0003512733,0.00037296803,0.00024287241,0.00013545103,0.0001404143,0.0033407325,0.00031452827,0.00019695585],"category_scores_gemma":[0.000032530603,0.00036833197,0.000280591,0.00050929404,0.0001287983,0.00038477138,0.0032622283,0.0005608205,0.00044396086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013206224,0.0000575901,0.00032518557,0.000048951202,0.00006403873,0.00032717138,0.00025292457,0.0012153314,0.000026157504,0.99508685,0.0009689917,0.0016135888],"study_design_scores_gemma":[0.0003404589,0.000045716373,0.0010306541,0.00019352352,0.00006570015,0.000012169903,0.00004494512,0.16417043,0.00037280124,0.83102345,0.001990284,0.0007098596],"about_ca_topic_score_codex":0.000071897564,"about_ca_topic_score_gemma":0.0000036156882,"teacher_disagreement_score":0.8681491,"about_ca_system_score_codex":0.00009972677,"about_ca_system_score_gemma":0.000112061294,"threshold_uncertainty_score":0.99987686},"labels":[],"label_agreement":null},{"id":"W2952343029","doi":"","title":"Finite Orbits of Language Operations","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Complement (music); Closure (psychology); Set (abstract data type); Finite set; Monoid; Bounded function; Mathematics; Orbit (dynamics); Computer science; Discrete mathematics; Pure mathematics; Programming language; Political science; Engineering; Mathematical analysis","score_opus":0.06161193071247009,"score_gpt":0.18350968864853764,"score_spread":0.12189775793606755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952343029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38191056,0.00009577372,0.60970503,0.000022211543,0.0003341114,0.00012955694,0.000024012652,0.00018033035,0.007598383],"genre_scores_gemma":[0.9949949,0.00005747844,0.0030509057,0.000067312234,0.000032062973,4.828452e-7,0.0000134223,0.000009763088,0.0017737068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998978,0.000088866596,0.00015214573,0.0005461602,0.00005242786,0.0001823735],"domain_scores_gemma":[0.99847734,0.00007496122,0.000114062204,0.0011629885,0.00009009152,0.000080581165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001646056,0.00017409194,0.00023155604,0.00018211393,0.00006788512,0.00004350445,0.0016278714,0.00015919072,0.000101392405],"category_scores_gemma":[0.000029962717,0.00018805367,0.00014044816,0.00032209067,0.00007815429,0.0002638628,0.0015513498,0.0002602967,0.00009506112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074559603,0.00011232304,0.00029288363,0.00006234186,0.000069143745,0.00019097455,0.002253263,0.08288644,0.00032174485,0.912861,0.0001572859,0.00078515295],"study_design_scores_gemma":[0.00042833338,0.000067331304,0.001023976,0.00016951482,0.000069432936,0.0000051360003,0.00030976432,0.9145507,0.004524423,0.078116395,0.00016514659,0.0005698196],"about_ca_topic_score_codex":0.00031654368,"about_ca_topic_score_gemma":0.00004457252,"teacher_disagreement_score":0.8347446,"about_ca_system_score_codex":0.000034739845,"about_ca_system_score_gemma":0.00011969534,"threshold_uncertainty_score":0.7668606},"labels":[],"label_agreement":null},{"id":"W2952344650","doi":"10.48550/arxiv.math/0608698","title":"The Quiver of the Semigroup Algebra of a Left Regular Band","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Quiver; Semigroup; Mathematics; Algebra over a field; Pure mathematics","score_opus":0.013763130426212694,"score_gpt":0.2168305934229344,"score_spread":0.2030674629967217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952344650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864488,0.0016777938,0.0070960824,0.00093468843,0.000989397,0.0003165821,0.00001703262,0.00008207764,0.0024375287],"genre_scores_gemma":[0.99747473,0.000083426225,0.0006302108,0.00017597001,0.00012362361,0.0000109464045,0.0000043560913,0.00002041727,0.0014763182],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99792475,0.00023170789,0.0005423861,0.0005156563,0.00046647503,0.0003190546],"domain_scores_gemma":[0.9962363,0.0003171169,0.00061619224,0.0026553273,0.00013083137,0.000044213994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008063236,0.0002731342,0.0003858383,0.00005597843,0.0001797895,0.00007228126,0.0035843088,0.00021378053,0.000016958174],"category_scores_gemma":[0.00007713946,0.00015724794,0.00035455925,0.00020768883,0.00039163246,0.00012500265,0.002298416,0.00044936995,0.000014067569],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073754796,0.0007280662,0.6372709,0.0010411612,0.0009276448,0.00004688928,0.0083725145,0.0018616383,0.051010936,0.22384456,0.046897482,0.027924446],"study_design_scores_gemma":[0.0005847127,0.000079256606,0.7856382,0.00079370785,0.00011085055,0.000029428782,0.00014448704,0.005447054,0.12660521,0.06604926,0.013811831,0.00070597866],"about_ca_topic_score_codex":0.00028397772,"about_ca_topic_score_gemma":0.000048935442,"teacher_disagreement_score":0.1577953,"about_ca_system_score_codex":0.00003759821,"about_ca_system_score_gemma":0.00017086032,"threshold_uncertainty_score":0.6660597},"labels":[],"label_agreement":null},{"id":"W2952441272","doi":"","title":"Quotient Complexity of Star-Free Languages","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Concatenation (mathematics); Regular language; Mathematics; Star (game theory); Discrete mathematics; Combinatorics; Intersection (aeronautics); Operand; Function (biology); Computer science; Arithmetic; Theoretical computer science; Automaton","score_opus":0.06936346238571205,"score_gpt":0.19577833256891503,"score_spread":0.12641487018320297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952441272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77850795,0.0000732817,0.21655649,0.00012221326,0.00060176273,0.00017779376,0.00007772146,0.00026126957,0.003621513],"genre_scores_gemma":[0.99160945,0.00003332806,0.0077287024,0.00007194787,0.000055446148,3.5552063e-7,0.00001677226,0.000012620244,0.00047138237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985271,0.00011374013,0.00020059486,0.0007583771,0.000116480565,0.00028372038],"domain_scores_gemma":[0.9968542,0.00009602628,0.00030679372,0.00248689,0.00012766523,0.00012846662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028500226,0.00025237957,0.0003607715,0.00019414366,0.00008105755,0.000057217258,0.0036895613,0.00025657399,0.00008786203],"category_scores_gemma":[0.000046120098,0.0002708368,0.00021391799,0.00029867713,0.00034429049,0.00021025872,0.004440081,0.0006206529,0.000034551675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001583871,0.00014999458,0.00064829516,0.0001113553,0.00006496824,0.00014662642,0.0003968977,0.005042223,0.00036023994,0.99190974,0.000569831,0.0005839916],"study_design_scores_gemma":[0.00072812196,0.00008625488,0.007715858,0.00013801754,0.000061271996,0.0000068500117,0.0002644019,0.4142112,0.0025285538,0.5729798,0.0006146668,0.00066496676],"about_ca_topic_score_codex":0.00043411148,"about_ca_topic_score_gemma":0.00013673345,"teacher_disagreement_score":0.4189299,"about_ca_system_score_codex":0.000061457,"about_ca_system_score_gemma":0.00012282984,"threshold_uncertainty_score":0.99997437},"labels":[],"label_agreement":null},{"id":"W2952515196","doi":"10.48550/arxiv.1602.06915","title":"Periodicity in Rectangular Arrays","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Repetition (rhetorical device); Root (linguistics); Mathematics; Combinatorics; Arithmetic; Algorithm; Discrete mathematics","score_opus":0.044682663767223796,"score_gpt":0.1705782619942617,"score_spread":0.1258955982270379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952515196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45200393,0.00008462292,0.54085904,0.00016847278,0.00051603606,0.0001594317,0.0000105615145,0.00027605417,0.0059218477],"genre_scores_gemma":[0.99778664,0.00012692732,0.0010337149,0.00013214046,0.00007443841,8.9119885e-7,0.000003693401,0.0000140996735,0.000827448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980785,0.00018554203,0.00018244247,0.001079874,0.00008362736,0.00038996825],"domain_scores_gemma":[0.9981439,0.00010088454,0.00016280616,0.0014106069,0.000055033008,0.00012676824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037765087,0.00027765983,0.0003320606,0.00029456578,0.000087710076,0.00010085539,0.0021700438,0.0002779789,0.0000620503],"category_scores_gemma":[0.000036525136,0.0002706195,0.00017549818,0.0004338354,0.000117636984,0.00035589063,0.0018931824,0.00044458784,0.00015076772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003666823,0.0001590932,0.010098874,0.00008544635,0.000064858985,0.0016711201,0.0008191734,0.008303203,0.000646801,0.9734077,0.0005866471,0.0041204058],"study_design_scores_gemma":[0.0009151014,0.000054427892,0.006441424,0.00043937715,0.000025468156,0.000012698999,0.00009957112,0.25035194,0.0008298186,0.73833495,0.0015099094,0.0009853216],"about_ca_topic_score_codex":0.00012417958,"about_ca_topic_score_gemma":0.000043345386,"teacher_disagreement_score":0.54578274,"about_ca_system_score_codex":0.00025381253,"about_ca_system_score_gemma":0.00015963973,"threshold_uncertainty_score":0.9999746},"labels":[],"label_agreement":null},{"id":"W2952621327","doi":"10.48550/arxiv.math/0306081","title":"Avoiding large squares in infinite binary words","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; Mathematics; Least-squares function approximation; Statistics; Arithmetic","score_opus":0.03556507515267771,"score_gpt":0.2701786116115995,"score_spread":0.2346135364589218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952621327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97029775,0.0017452696,0.021476584,0.0005418548,0.0016722638,0.00023873955,0.000011697198,0.00036674907,0.0036490737],"genre_scores_gemma":[0.9957716,0.00020946572,0.0022104683,0.000996266,0.0001403134,0.00005321331,0.000019628289,0.000033944867,0.0005650937],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99725604,0.00046220596,0.000432717,0.0009179293,0.00028720402,0.0006438857],"domain_scores_gemma":[0.99797016,0.00029288034,0.00022219575,0.0013548514,0.00004515027,0.00011475662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015642428,0.00038541254,0.0004358106,0.00037649047,0.00019082312,0.00019371086,0.001739591,0.00033397556,0.00008821869],"category_scores_gemma":[0.00021502755,0.00038428346,0.00016691061,0.0005516809,0.00004780931,0.00036430487,0.0023484689,0.0014902872,0.00030644893],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026909825,0.00076513505,0.8857119,0.00051883864,0.00012794825,0.0013321268,0.010478376,0.0017710768,0.0023017118,0.08044524,0.005129805,0.011390948],"study_design_scores_gemma":[0.0026124131,0.00023473517,0.82051075,0.0033365658,0.00005342967,0.00010574528,0.0015242947,0.059653055,0.005242019,0.04917213,0.05355841,0.003996487],"about_ca_topic_score_codex":0.000044461933,"about_ca_topic_score_gemma":0.000016844691,"teacher_disagreement_score":0.06520117,"about_ca_system_score_codex":0.00010929526,"about_ca_system_score_gemma":0.0001537241,"threshold_uncertainty_score":0.9998609},"labels":[],"label_agreement":null},{"id":"W2952654623","doi":"10.48550/arxiv.1207.4233","title":"Lyndon words and Fibonacci numbers","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Fibonacci number; Combinatorics; Concatenation (mathematics); Word (group theory); Upper and lower bounds; Mathematics; Closure (psychology); Golden ratio; Aperiodic graph; Combinatorics on words; Discrete mathematics; Geometry","score_opus":0.04710241029971428,"score_gpt":0.1737734363795925,"score_spread":0.12667102607987824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952654623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6718218,0.00043411148,0.31473792,0.00014303485,0.0010452879,0.00021062828,0.000011440556,0.00046243425,0.0111334035],"genre_scores_gemma":[0.996237,0.00023008342,0.0016637297,0.00015170251,0.00011038287,5.904611e-7,0.000008098978,0.000016106835,0.0015823472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844885,0.00010767804,0.00013728527,0.0008324452,0.000076325065,0.0003974441],"domain_scores_gemma":[0.9983885,0.00011217919,0.00016115115,0.0010725912,0.00003940564,0.00022612476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028522036,0.00028584275,0.00027999404,0.00015398407,0.00012531108,0.0001419577,0.0013242131,0.0002568178,0.00007023556],"category_scores_gemma":[0.000014099747,0.00031700442,0.00012912396,0.000303192,0.000107687716,0.000510773,0.0027027612,0.00042222242,0.000103156715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030279942,0.00014710186,0.0117441295,0.0001613498,0.00016007127,0.00033281356,0.001599572,0.0034085966,0.00007628788,0.9697339,0.0018949928,0.010710898],"study_design_scores_gemma":[0.0015566703,0.00007772002,0.016588138,0.0003653772,0.00022463761,0.00007583221,0.0004912097,0.57142395,0.00041722166,0.39736474,0.009081693,0.0023328122],"about_ca_topic_score_codex":0.00015146003,"about_ca_topic_score_gemma":0.00001561656,"teacher_disagreement_score":0.57236916,"about_ca_system_score_codex":0.00009817427,"about_ca_system_score_gemma":0.000071119764,"threshold_uncertainty_score":0.9999282},"labels":[],"label_agreement":null},{"id":"W2952711126","doi":"10.48550/arxiv.1206.5352","title":"Subword Complexity and k-Synchronization","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Contrast (vision); Synchronization (alternating current); Function (biology); Mathematics; Combinatorics; Algorithm; Computer science; Discrete mathematics; Arithmetic; Artificial intelligence; Biology; Evolutionary biology; Topology (electrical circuits); Genetics","score_opus":0.0930934791514959,"score_gpt":0.18355479325032645,"score_spread":0.09046131409883054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952711126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24784629,0.0002081305,0.7493758,0.00009569686,0.00044155982,0.00013409673,0.000008608383,0.00027762345,0.0016121871],"genre_scores_gemma":[0.99658513,0.00014431054,0.0027277756,0.000098073695,0.00009284093,3.5496817e-7,0.000019916322,0.000011542001,0.00032007074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987581,0.00011620584,0.00011943381,0.00066052657,0.000059725862,0.0002860023],"domain_scores_gemma":[0.9987273,0.00006382599,0.0001531338,0.00083680375,0.00006509228,0.00015383409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023543477,0.00021702253,0.00022192804,0.00012374013,0.00014577266,0.00012626758,0.0009537483,0.00018752486,0.000047175112],"category_scores_gemma":[0.00001304296,0.00024678378,0.00007324137,0.000277828,0.0001600888,0.0004619359,0.002143606,0.0002938821,0.00006068889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061679348,0.000057619272,0.0051469835,0.00006936043,0.00003530267,0.000039361457,0.00024856956,0.0030709968,0.000016356347,0.987265,0.00019970082,0.0038445971],"study_design_scores_gemma":[0.000297292,0.000017945687,0.012623509,0.00006050702,0.000043101256,0.0000100758425,0.000034466917,0.72335756,0.00006365536,0.26232257,0.00071207446,0.00045725852],"about_ca_topic_score_codex":0.000101008125,"about_ca_topic_score_gemma":0.00001896773,"teacher_disagreement_score":0.7487388,"about_ca_system_score_codex":0.00010132408,"about_ca_system_score_gemma":0.000069382346,"threshold_uncertainty_score":0.99999845},"labels":[],"label_agreement":null},{"id":"W2952789396","doi":"10.48550/arxiv.1505.02695","title":"Palindromic complexity of trees","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Alphabet; TRACE (psycholinguistics); Path (computing); Tree (set theory); Combinatorics; Word (group theory); Upper and lower bounds; Set (abstract data type); Free monoid; Combinatorics on words; Mathematics; Computer science; Discrete mathematics; Monoid; Biology; Linguistics; Genome","score_opus":0.15652650826724238,"score_gpt":0.20203523843705312,"score_spread":0.045508730169810746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952789396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7257855,0.00010066451,0.26899073,0.00007112903,0.0005295275,0.00016065527,0.000041439245,0.00024809982,0.0040722275],"genre_scores_gemma":[0.99707776,0.000035105448,0.0022960403,0.000040221817,0.000041793697,2.5395659e-7,0.000016007718,0.000010996945,0.00048183044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985651,0.00014995346,0.0002089648,0.00073011644,0.00009792385,0.0002479483],"domain_scores_gemma":[0.99786824,0.0000696782,0.00030968786,0.0014487136,0.00015547362,0.00014822392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037217303,0.00023920262,0.00041213943,0.00018958603,0.000054993045,0.000049378363,0.0024491004,0.00020949882,0.0000325722],"category_scores_gemma":[0.000023603076,0.0002619269,0.00020043048,0.0003408398,0.0002959063,0.00022547391,0.0025318717,0.00032465972,0.00006283778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002479673,0.00014907468,0.0017371025,0.00007780334,0.000098100325,0.00016984562,0.00037917017,0.031419273,0.00011382546,0.96404475,0.001096996,0.00068927964],"study_design_scores_gemma":[0.00040472977,0.000047294197,0.0028649054,0.00008075918,0.000036325662,0.000005417985,0.00006834551,0.43690285,0.0003677112,0.55869263,0.00020017424,0.00032886656],"about_ca_topic_score_codex":0.0002245974,"about_ca_topic_score_gemma":0.00006841511,"teacher_disagreement_score":0.40548357,"about_ca_system_score_codex":0.00011290307,"about_ca_system_score_gemma":0.00021725864,"threshold_uncertainty_score":0.9999833},"labels":[],"label_agreement":null},{"id":"W2952825866","doi":"10.48550/arxiv.0808.1657","title":"Periodicity, repetitions, and orbits of an automatic sequence","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Decidability; Sequence (biology); Simple (philosophy); Lexicographical order; Quotient; Closure (psychology); Mathematics; Discrete mathematics; Combinatorics","score_opus":0.052077942687973076,"score_gpt":0.2794468482591015,"score_spread":0.2273689055711284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952825866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926916,0.0004566482,0.004915025,0.00031745582,0.00033222476,0.00020570047,0.000022533879,0.00037444776,0.0006843737],"genre_scores_gemma":[0.9822244,0.0004025686,0.016880648,0.0002729258,0.000073304574,0.00002657788,0.000021168742,0.00001710048,0.00008131814],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9981652,0.00014892625,0.00043108448,0.00070962,0.00028928267,0.00025586731],"domain_scores_gemma":[0.9979075,0.00009261134,0.00031108235,0.0014537644,0.000099672754,0.00013536574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035278103,0.0002602016,0.00040989145,0.00014379864,0.00015645624,0.00010016804,0.0012092558,0.0001938088,0.000027261414],"category_scores_gemma":[0.00008766523,0.00024887855,0.0000888543,0.00018565106,0.000275661,0.00039633084,0.0014928574,0.0003664808,0.000032657234],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040782892,0.0024343685,0.538152,0.0059679057,0.0007047182,0.002623063,0.03919935,0.0012170806,0.053203054,0.13223703,0.0030439133,0.22117674],"study_design_scores_gemma":[0.00083916826,0.00043473236,0.6952698,0.001987495,0.00008669247,0.0011738414,0.0002823083,0.24935263,0.0129744345,0.034825187,0.00097048597,0.0018031814],"about_ca_topic_score_codex":0.00013694764,"about_ca_topic_score_gemma":0.000007032772,"teacher_disagreement_score":0.24813555,"about_ca_system_score_codex":0.00004001966,"about_ca_system_score_gemma":0.00020715503,"threshold_uncertainty_score":0.99999636},"labels":[],"label_agreement":null},{"id":"W2952875997","doi":"10.48550/arxiv.math/0612497","title":"A Profinite Approach to Stable Pairs","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Profinite group; Mathematics; Sociology; Physics; Group (periodic table)","score_opus":0.04287205224487553,"score_gpt":0.24269637916613382,"score_spread":0.1998243269212583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952875997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47339702,0.00034450085,0.4780301,0.00067755196,0.0010301232,0.00078729313,0.000024262225,0.0009874983,0.044721685],"genre_scores_gemma":[0.90875846,0.000009965813,0.08482842,0.0012750612,0.0003937719,0.00030425322,0.00006631448,0.00005190613,0.0043118643],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99735,0.0001207765,0.00039363393,0.0011712324,0.00037022846,0.0005941308],"domain_scores_gemma":[0.99754137,0.00007143585,0.00017928735,0.0019402868,0.00008909728,0.00017852614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006012385,0.0003888528,0.00042095198,0.00019659038,0.00013096227,0.00029262694,0.002353567,0.00025320798,0.0000145349595],"category_scores_gemma":[0.000042942545,0.0003590902,0.00017083682,0.000424243,0.000045009732,0.00023562604,0.0030632634,0.0005579149,0.0004904434],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007694651,0.0036267738,0.47104397,0.002370172,0.0006051566,0.00032697374,0.011521932,0.027008606,0.003596189,0.20327778,0.20366588,0.07287961],"study_design_scores_gemma":[0.0017548798,0.0003782503,0.5932048,0.0011178963,0.00014346317,0.00008336239,0.00039003318,0.20591241,0.010187181,0.052679908,0.12800072,0.0061470675],"about_ca_topic_score_codex":0.00024378976,"about_ca_topic_score_gemma":0.0000048472198,"teacher_disagreement_score":0.43536144,"about_ca_system_score_codex":0.000092435046,"about_ca_system_score_gemma":0.00016836466,"threshold_uncertainty_score":0.9998861},"labels":[],"label_agreement":null},{"id":"W2952917448","doi":"10.48550/arxiv.math/0306416","title":"State Complexity and the Monoid of Transformations of a Finite Set","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monoid; State (computer science); Syntactic monoid; Root (linguistics); Set (abstract data type); Free monoid; Finite set; Mathematics; Finite-state machine; Computer science; Discrete mathematics; Algorithm; Linguistics","score_opus":0.06035698064283764,"score_gpt":0.2639145045130027,"score_spread":0.20355752387016504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952917448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8374882,0.00045133271,0.1596995,0.00063430157,0.00016107802,0.00029473694,0.00012721133,0.000043203672,0.0011004688],"genre_scores_gemma":[0.9962811,0.0002510041,0.0031979592,0.00018029728,0.000008504079,0.000017679302,0.000012746861,0.0000064983883,0.00004421742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988491,0.00019187387,0.00042165385,0.00022931241,0.00015973957,0.0001483354],"domain_scores_gemma":[0.99858445,0.00027633202,0.00028629077,0.00073684665,0.000076890254,0.000039201906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000644761,0.00015206578,0.0003495239,0.00006659909,0.00006987851,0.000033983637,0.0007401337,0.00006635672,0.0000127489775],"category_scores_gemma":[0.000039554885,0.00010691125,0.00011558955,0.00014876125,0.00037736807,0.00014366466,0.0003694859,0.00024603584,0.0000053193635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002967336,0.0007400485,0.0675146,0.0034620077,0.0011378791,0.00001907072,0.13695525,0.01135095,0.0022245878,0.7430018,0.0019758416,0.03132125],"study_design_scores_gemma":[0.0036470501,0.0001395269,0.18172608,0.00051264203,0.00013234475,0.000022971004,0.0005981884,0.23145382,0.011437369,0.5679332,0.0015511035,0.00084568147],"about_ca_topic_score_codex":0.000107702464,"about_ca_topic_score_gemma":0.0000114258455,"teacher_disagreement_score":0.22010288,"about_ca_system_score_codex":0.000009175564,"about_ca_system_score_gemma":0.00006734366,"threshold_uncertainty_score":0.4359714},"labels":[],"label_agreement":null},{"id":"W2952942893","doi":"10.48550/arxiv.0708.3224","title":"The Frobenius Problem in a Free Monoid","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Noncommutative geometry; Mathematics; Monoid; Free monoid; Integer (computer science); Commutative property; Combinatorics; Quadratic equation; Exponential function; Discrete mathematics; Measure (data warehouse); Pure mathematics; Computer science","score_opus":0.026644636919038706,"score_gpt":0.2528533788499173,"score_spread":0.22620874193087862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952942893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8314228,0.010415816,0.12446041,0.010393084,0.0038209183,0.0010748109,0.000015611124,0.00083629566,0.017560253],"genre_scores_gemma":[0.9563898,0.0007307939,0.036777396,0.0016778088,0.00060888706,0.00019268694,0.0000116925585,0.000062809944,0.0035481453],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978137,0.00012426359,0.00046075202,0.00071819505,0.00030245958,0.0005806573],"domain_scores_gemma":[0.99693614,0.00028519152,0.00021191964,0.0024167672,0.000056905425,0.00009306968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013403052,0.00029179992,0.00028149775,0.00013753165,0.00014371233,0.0002609017,0.004064199,0.00028324744,0.000012932354],"category_scores_gemma":[0.00009078651,0.00021810824,0.0001420504,0.00031897076,0.00010120709,0.00020687253,0.003930794,0.00093255116,0.00015708969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086196706,0.0008372051,0.19188789,0.0005049258,0.00030917278,0.0010133631,0.009982464,0.00238924,0.0015744349,0.3170819,0.07066203,0.40367118],"study_design_scores_gemma":[0.0014717702,0.00011366584,0.22332278,0.00084926677,0.000029865258,0.000058890375,0.00023758369,0.030379554,0.0042542084,0.6416009,0.095942825,0.0017386747],"about_ca_topic_score_codex":0.00040258202,"about_ca_topic_score_gemma":0.00018998366,"teacher_disagreement_score":0.4019325,"about_ca_system_score_codex":0.00011179754,"about_ca_system_score_gemma":0.00014969202,"threshold_uncertainty_score":0.8894196},"labels":[],"label_agreement":null},{"id":"W2952968515","doi":"10.48550/arxiv.0901.1397","title":"Avoiding Squares and Overlaps Over the Natural Numbers","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Natural (archaeology); Natural number; Mathematics; Computer science; Econometrics; History; Combinatorics; Archaeology","score_opus":0.018036416459758967,"score_gpt":0.2514304650373672,"score_spread":0.23339404857760826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952968515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98837584,0.0034027938,0.003567109,0.0012158444,0.0014446827,0.00019542756,0.0000042551083,0.00028459972,0.0015094451],"genre_scores_gemma":[0.9964476,0.00021692723,0.00084783265,0.0018522661,0.0002880613,0.000010860403,0.000006141182,0.000016436328,0.00031385044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99821675,0.00021989466,0.00024561776,0.0006720466,0.00028437944,0.00036134096],"domain_scores_gemma":[0.99836266,0.00033138698,0.00017846462,0.0010137263,0.000036052,0.00007770764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006776053,0.00030651197,0.00026714162,0.00006716078,0.00036986367,0.00039346458,0.0014470567,0.00017342788,0.000018639166],"category_scores_gemma":[0.00010560916,0.00021344687,0.00014040856,0.0001500506,0.00010469095,0.00031481424,0.0016524825,0.0012078459,0.00004548545],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076760334,0.00036510316,0.2955642,0.00056260347,0.0006880962,0.000568608,0.02515039,0.00082290114,0.008947607,0.39330173,0.041319553,0.23263247],"study_design_scores_gemma":[0.00042225872,0.00004425278,0.9235417,0.0004102259,0.000041587107,0.00009175656,0.00031113176,0.021999236,0.001296876,0.04439255,0.0065544355,0.000893954],"about_ca_topic_score_codex":0.00010763681,"about_ca_topic_score_gemma":0.000009979383,"teacher_disagreement_score":0.62797755,"about_ca_system_score_codex":0.00005252227,"about_ca_system_score_gemma":0.000059947768,"threshold_uncertainty_score":0.87041104},"labels":[],"label_agreement":null},{"id":"W2953066797","doi":"10.48550/arxiv.1808.02529","title":"Circular critical exponents for Thue-Morse factors","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morse code; Exponent; Word (group theory); Repetition (rhetorical device); Critical exponent; Factor (programming language); Mathematics; Statistical physics; Physics; Pure mathematics; Computer science; Geometry; Linguistics; Telecommunications; Philosophy","score_opus":0.10233616838167477,"score_gpt":0.21566655069228802,"score_spread":0.11333038231061325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953066797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3950244,0.000036287896,0.60261714,0.00006070517,0.0011859077,0.00023393607,0.00003754727,0.0002847968,0.0005193086],"genre_scores_gemma":[0.9964428,0.000020655638,0.0027251332,0.00012057501,0.0001751643,0.0000021327253,0.000028346829,0.0000269543,0.00045821536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977658,0.00011686586,0.00020445803,0.0012857118,0.000115382485,0.0005117792],"domain_scores_gemma":[0.9975546,0.00033764308,0.00013803407,0.0015282703,0.00019772955,0.0002437221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030280143,0.00036245,0.00036907158,0.00021531776,0.00023997988,0.00018747053,0.0024457113,0.00034966957,0.00006341752],"category_scores_gemma":[0.00015220015,0.00038901714,0.00037468428,0.00026715524,0.00024042703,0.0004311088,0.0019631258,0.00032418288,0.000110407775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044681627,0.00034998916,0.0037738916,0.00035161938,0.00021495379,0.00034652173,0.0008040821,0.0029968084,0.00030090337,0.98734444,0.0029750227,0.00049705745],"study_design_scores_gemma":[0.0006970356,0.00014940082,0.0029063309,0.00019018436,0.00013747952,0.0000075685266,0.00019557372,0.49427247,0.0014130425,0.4962978,0.0026578612,0.0010752456],"about_ca_topic_score_codex":0.000043853477,"about_ca_topic_score_gemma":0.0000027430874,"teacher_disagreement_score":0.60141844,"about_ca_system_score_codex":0.00014605322,"about_ca_system_score_gemma":0.00013144717,"threshold_uncertainty_score":0.9998562},"labels":[],"label_agreement":null},{"id":"W2953147117","doi":"10.1002/rsa.20095","title":"The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function","year":2005,"lang":"en","type":"article","venue":"Scholarship - Claremont (Claremont Colleges)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","funders":"","keywords":"Probabilistic logic; Monotone polygon; Boolean function; Mathematics; Function (biology); Convergence (economics); Linear growth; Discrete mathematics; Applied mathematics; Pure mathematics; Statistics","score_opus":0.01287401157908717,"score_gpt":0.2288308892448166,"score_spread":0.21595687766572944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953147117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07938644,0.008784072,0.68462926,0.2030379,0.007189315,0.0067579225,0.00036793295,0.0030227269,0.0068244194],"genre_scores_gemma":[0.96055955,0.00013792168,0.0052857166,0.010779978,0.0012224477,0.0003153764,0.00008391285,0.00013345979,0.021481631],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934897,0.0010470495,0.00093199546,0.0014255239,0.0015406616,0.0015650863],"domain_scores_gemma":[0.9939054,0.0014847348,0.00043721832,0.0029662896,0.00052253425,0.00068380154],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003930259,0.00085155934,0.0006924597,0.00029609798,0.0044173277,0.003258212,0.004203742,0.00041660087,0.00011515192],"category_scores_gemma":[0.00070281135,0.00049235264,0.0005134553,0.0019990045,0.00023563049,0.00276033,0.00093381514,0.0015672736,0.0005416472],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023770041,0.00058116036,0.00034882518,0.000043098626,0.0005858736,0.000114768634,0.0011940626,0.0011365025,0.0044095404,0.054489784,0.6941355,0.24058388],"study_design_scores_gemma":[0.003998624,0.0005447355,0.0027702022,0.0001315504,0.00012499746,0.00016367596,0.0005784813,0.039232135,0.001992856,0.00464416,0.9448084,0.0010101678],"about_ca_topic_score_codex":0.000053617034,"about_ca_topic_score_gemma":0.001643361,"teacher_disagreement_score":0.88117313,"about_ca_system_score_codex":0.00054895313,"about_ca_system_score_gemma":0.00029650133,"threshold_uncertainty_score":0.9997528},"labels":[],"label_agreement":null},{"id":"W2953277693","doi":"10.48550/arxiv.1312.4428","title":"On Constraint Satisfaction Problems below P","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Datalog; Constraint satisfaction problem; Treewidth; Bounded function; Mathematics; Duality (order theory); Discrete mathematics; Constraint satisfaction; Nondeterministic algorithm; Combinatorics; Conjecture; Simple (philosophy); Computer science; Pathwidth; Theoretical computer science; Graph","score_opus":0.046308067381303705,"score_gpt":0.17042913700929968,"score_spread":0.12412106962799598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953277693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54450285,0.000026180287,0.44844568,0.00013738568,0.0008369771,0.00038894857,0.000011862216,0.00049677095,0.005153341],"genre_scores_gemma":[0.9975643,0.00006735439,0.0011814085,0.00020399358,0.00005174208,0.0000023382977,0.00000986189,0.000015651072,0.00090333266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982518,0.00012452777,0.00017676607,0.0010128275,0.00010258448,0.00033150052],"domain_scores_gemma":[0.99819,0.00013817017,0.00023238994,0.0011959583,0.00009078539,0.00015269643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002078196,0.00030819472,0.00027261232,0.00021919461,0.00014348385,0.00019756016,0.001158425,0.00028140852,0.00016177015],"category_scores_gemma":[0.00002157199,0.0003264173,0.00016914052,0.0002725086,0.00012626094,0.00036743257,0.0010284486,0.00058059767,0.00061562145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050413123,0.000054284425,0.00057130924,0.000050979994,0.000056160992,0.00007895909,0.00014813825,0.067074046,0.00007744799,0.92284214,0.00090735586,0.008134113],"study_design_scores_gemma":[0.0003506203,0.000081152684,0.003643555,0.00018393679,0.000024260635,0.000008918683,0.00003965872,0.4473486,0.00013329482,0.54741204,0.00027511944,0.00049883785],"about_ca_topic_score_codex":0.00033427007,"about_ca_topic_score_gemma":0.00002662835,"teacher_disagreement_score":0.45306146,"about_ca_system_score_codex":0.00020190394,"about_ca_system_score_gemma":0.00011976457,"threshold_uncertainty_score":0.99991876},"labels":[],"label_agreement":null},{"id":"W2953288157","doi":"10.48550/arxiv.1010.5391","title":"Multi-dimensional sets recognizable in all abstract numeration systems","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Computer science","score_opus":0.09328003376098516,"score_gpt":0.2102244378903298,"score_spread":0.11694440412934463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953288157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8797684,0.000114948074,0.11621303,0.0000763533,0.0022861047,0.00042298337,0.000025647816,0.00030870916,0.00078387896],"genre_scores_gemma":[0.99414194,0.000037607602,0.0048091104,0.00009735788,0.000055628214,0.0000017832656,0.000057998735,0.000017687014,0.00078089774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981135,0.00011749851,0.00027105852,0.0010353979,0.000108674416,0.00035384815],"domain_scores_gemma":[0.9983789,0.00012869072,0.00026149966,0.0009769604,0.000115850664,0.00013810878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005513237,0.00028967933,0.00031355166,0.0002924244,0.00009124863,0.00020700665,0.0012566125,0.0004696134,0.000045050674],"category_scores_gemma":[0.00003087699,0.0003264122,0.00011714089,0.0002992388,0.00004918934,0.0005537619,0.0010044585,0.0009083957,0.00022472825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004391843,0.00063022075,0.002734423,0.00023058461,0.00013551509,0.0014192986,0.0005556316,0.9216258,0.003336938,0.066091314,0.0012065481,0.0019898217],"study_design_scores_gemma":[0.00049312634,0.000014908653,0.0035464924,0.00014459812,0.000014954979,0.000011841451,0.000027255206,0.98744535,0.00016430231,0.0073265717,0.00041005883,0.00040054353],"about_ca_topic_score_codex":0.00083476584,"about_ca_topic_score_gemma":0.00018771391,"teacher_disagreement_score":0.11437358,"about_ca_system_score_codex":0.00015452698,"about_ca_system_score_gemma":0.00017445054,"threshold_uncertainty_score":0.9999188},"labels":[],"label_agreement":null},{"id":"W2953320161","doi":"10.48550/arxiv.0708.4217","title":"A note on the Markoff condition and central words","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Economics","score_opus":0.026028751113604667,"score_gpt":0.2649261114454045,"score_spread":0.23889736033179984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953320161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94120294,0.0002269556,0.049891982,0.0028161707,0.0012198433,0.0002633552,0.000013131394,0.00020617743,0.004159447],"genre_scores_gemma":[0.9957369,0.00008301227,0.0009304084,0.0026052122,0.00028122668,0.000018181318,0.000014924238,0.00001438771,0.0003157549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985418,0.00010592428,0.00020953751,0.0005351053,0.00023845444,0.00036921623],"domain_scores_gemma":[0.9985204,0.00032168676,0.00014278208,0.0008917289,0.00002945266,0.00009396549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048026707,0.00022853553,0.00018793523,0.000079779515,0.00014689492,0.00018189683,0.0008731212,0.00018313745,0.000073413896],"category_scores_gemma":[0.00006013108,0.00016182063,0.000088128,0.00012401592,0.00010724045,0.00011969416,0.0009158746,0.00057391066,0.00009721034],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018556144,0.0006812589,0.12665355,0.0004503721,0.0004016208,0.00064642617,0.013778073,0.0004908231,0.0050215167,0.55942905,0.033686485,0.25857526],"study_design_scores_gemma":[0.0004845712,0.00011182594,0.9262251,0.00049402384,0.000036135058,0.000040072417,0.000121114994,0.019221619,0.004879423,0.03546473,0.012121041,0.00080031116],"about_ca_topic_score_codex":0.000032209984,"about_ca_topic_score_gemma":0.0000066109883,"teacher_disagreement_score":0.7995716,"about_ca_system_score_codex":0.00005843232,"about_ca_system_score_gemma":0.000056306893,"threshold_uncertainty_score":0.6598854},"labels":[],"label_agreement":null},{"id":"W2954251248","doi":"10.1007/978-3-030-23220-7_5","title":"Finite Limits and Anti-unification in Substitution Categories","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Unification; Morphism; Mathematical proof; Substitution (logic); Computer science; Arrow; Algebra over a field; Mathematics; Pure mathematics; Programming language; Geometry","score_opus":0.017021689750149425,"score_gpt":0.2296796129914109,"score_spread":0.21265792324126148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954251248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035837707,0.0007526533,0.99244773,0.00047674926,0.0011096532,0.00029145207,0.0000028935228,0.00010457166,0.0012305176],"genre_scores_gemma":[0.9504093,0.00019991159,0.04845814,0.00057098124,0.00013511599,0.0000043764503,0.000008770159,0.00001698177,0.00019642871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976045,0.000032806314,0.00037001696,0.0011237421,0.00046260646,0.00040632836],"domain_scores_gemma":[0.9982185,0.00047487763,0.00019447261,0.0009340126,0.00010137381,0.00007681134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007809316,0.00033701034,0.00037237667,0.0007708677,0.00013014398,0.00045653526,0.0014954859,0.00025234974,0.0000055235805],"category_scores_gemma":[0.000080081634,0.00031066767,0.0000442654,0.000532749,0.00053003366,0.0008516471,0.00050469674,0.00047809683,0.000040471634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048939896,0.00003009668,0.00084667467,0.00007684893,0.000005709358,0.00005941777,0.0013627786,0.028628603,0.00088059454,0.49471933,0.000005504119,0.47337955],"study_design_scores_gemma":[0.00033019864,0.000088615685,0.0058789323,0.0004423517,0.000005211043,0.00005636725,4.898408e-7,0.7781983,0.0021366386,0.21115093,0.0009998513,0.0007121024],"about_ca_topic_score_codex":0.000028056036,"about_ca_topic_score_gemma":0.000058672493,"teacher_disagreement_score":0.9468255,"about_ca_system_score_codex":0.0001441443,"about_ca_system_score_gemma":0.00035048864,"threshold_uncertainty_score":0.99993455},"labels":[],"label_agreement":null},{"id":"W2954853821","doi":"10.1007/978-3-030-23247-4_16","title":"Nondeterminism Growth and State Complexity","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; String (physics); Combinatorics; Nondeterministic algorithm; Path (computing); Discrete mathematics; Tree (set theory); Bounding overwatch; Deterministic finite automaton; Nondeterministic finite automaton; Finite-state machine; State (computer science); Degree (music); Automaton; Algorithm; Computer science; Physics; Automata theory; Theoretical computer science","score_opus":0.01937335753452985,"score_gpt":0.2362460321222283,"score_spread":0.21687267458769846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954853821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008041102,0.00035363127,0.9910157,0.00059088593,0.0014512831,0.00033748554,0.000012180271,0.00020253834,0.0052322135],"genre_scores_gemma":[0.534009,0.00015512026,0.45964178,0.0047780583,0.00037696096,0.0000064357173,0.0000078833,0.00007227036,0.0009524948],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964579,0.000038520193,0.00044500202,0.0016345556,0.0007571882,0.00066687306],"domain_scores_gemma":[0.9975677,0.00049511046,0.0002617103,0.0013697275,0.0001125049,0.00019326052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006983113,0.00054376794,0.00059906807,0.0005900216,0.00020949933,0.00070281595,0.0029626014,0.00021890715,0.000017499411],"category_scores_gemma":[0.00004190496,0.00048246974,0.00009890536,0.00031660197,0.0011611738,0.00071728375,0.0023223737,0.000678591,0.000069715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071020086,0.00002959084,0.00014080844,0.00012724126,0.000016320748,0.00017383751,0.0012837282,0.0006522043,0.0004068181,0.2504204,0.000023839544,0.7467181],"study_design_scores_gemma":[0.00029187909,0.00017482834,0.0005866833,0.0002587849,0.0000048493634,0.0001442295,1.08220426e-7,0.2861033,0.001243825,0.7100332,0.00043528987,0.0007230401],"about_ca_topic_score_codex":0.000026198002,"about_ca_topic_score_gemma":0.000022870892,"teacher_disagreement_score":0.7459951,"about_ca_system_score_codex":0.000098223616,"about_ca_system_score_gemma":0.00039842454,"threshold_uncertainty_score":0.9997627},"labels":[],"label_agreement":null},{"id":"W2955954078","doi":"10.46298/dmtcs.6380","title":"On intervals of the consecutive pattern poset","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Bucknell University; Simons Foundation","keywords":"Partially ordered set; Combinatorics; Mathematics; Subsequence; Rank (graph theory); Order (exchange); Generating function; Hasse diagram; Set (abstract data type); Function (biology); Discrete mathematics; Computer science; Biology","score_opus":0.015109162470780112,"score_gpt":0.2509598280722007,"score_spread":0.23585066560142057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955954078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05855837,0.000009576966,0.93311334,0.004928591,0.00029065832,0.00025063782,0.000014266664,0.000114657974,0.0027199266],"genre_scores_gemma":[0.9561525,0.0000010406739,0.0397848,0.0039990903,0.00004254252,0.0000051047423,4.9248894e-7,0.000011325269,0.0000030841718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745655,0.00014942625,0.00046449198,0.00059556664,0.0009077514,0.00042623593],"domain_scores_gemma":[0.9975825,0.0006876104,0.00022453154,0.0011334481,0.00013816486,0.00023374366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009333859,0.00023766076,0.00033959682,0.00006793909,0.0002317917,0.00027616817,0.0045810435,0.000047625996,0.00006214689],"category_scores_gemma":[0.00035290807,0.00014096912,0.00018269183,0.0009171549,0.0026679703,0.00027857348,0.0021497798,0.00024249041,0.00006863443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003728624,0.000058119756,0.000016560249,0.000034713463,0.0000090932,0.0000046538617,0.0043011312,0.00003651145,0.00093578117,0.99071896,0.0001398576,0.0037409004],"study_design_scores_gemma":[0.0001525718,0.00022171678,0.00012850632,0.00013759198,0.00000725055,0.000013063961,0.00007025117,0.60080725,0.012544569,0.38573828,0.000013087339,0.00016586838],"about_ca_topic_score_codex":0.0000011875949,"about_ca_topic_score_gemma":1.16982704e-7,"teacher_disagreement_score":0.89759415,"about_ca_system_score_codex":0.00002194836,"about_ca_system_score_gemma":0.00008477658,"threshold_uncertainty_score":0.9830248},"labels":[],"label_agreement":null},{"id":"W2962693339","doi":"10.4171/lem/56-1-2","title":"A Wreath Product Approach to Classical Subgroup Theorems","year":2010,"lang":"fr","type":"article","venue":"L’Enseignement Mathématique","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Wreath product; Mathematics; Product (mathematics); Combinatorics; Geometry","score_opus":0.015635897593886727,"score_gpt":0.2381202000603462,"score_spread":0.22248430246645948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962693339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17522946,0.0012185139,0.59302866,0.029870268,0.007483863,0.0030499534,0.000066108805,0.0009997397,0.18905345],"genre_scores_gemma":[0.7700941,0.000057135432,0.20499071,0.00426324,0.0015930099,0.00043557008,0.00003444357,0.00011813934,0.01841367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948782,0.00039657758,0.0008700445,0.0015966936,0.000886171,0.0013723187],"domain_scores_gemma":[0.99617755,0.00021174474,0.00027587064,0.0024319289,0.00022505155,0.00067784055],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020871812,0.00074500334,0.00068809395,0.00025575777,0.00042453653,0.0009312415,0.0020914103,0.00037192815,0.00051272736],"category_scores_gemma":[0.00023750863,0.00067730236,0.00028238757,0.00091954845,0.0003744758,0.00080270675,0.0010038833,0.00114167,0.0013055139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021607531,0.0012952929,0.00003728413,0.00022713428,0.000064601205,0.000056194483,0.010270778,0.000041417552,0.015255603,0.8967001,0.04231074,0.03371925],"study_design_scores_gemma":[0.0019853804,0.0011168681,0.0085763745,0.0006344374,0.0001945242,0.0015027932,0.0011389047,0.168552,0.024811042,0.26900187,0.5190149,0.0034709177],"about_ca_topic_score_codex":0.00014250522,"about_ca_topic_score_gemma":0.000092740185,"teacher_disagreement_score":0.62769824,"about_ca_system_score_codex":0.00015555568,"about_ca_system_score_gemma":0.00034942295,"threshold_uncertainty_score":0.9995678},"labels":[],"label_agreement":null},{"id":"W2962772080","doi":"","title":"Most Complex Regular Ideal Languages","year":2017,"lang":"en","type":"article","venue":"UWSpace (University of Waterloo)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quotient; Concatenation (mathematics); Ideal (ethics); Mathematics; Combinatorics; Sigma; Alphabet; Discrete mathematics; Class (philosophy); Pure mathematics; Computer science; Physics; Linguistics","score_opus":0.014989971566290986,"score_gpt":0.2154152196680669,"score_spread":0.20042524810177592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962772080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.986019,0.000045346165,0.0045435815,0.0068106293,0.00010898071,0.00007619399,0.000010526454,0.00014744129,0.0022383037],"genre_scores_gemma":[0.91584545,0.000018367473,0.024967846,0.000103149934,0.000034700493,7.014443e-8,0.0000068473073,0.000006836564,0.059016746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993038,0.00003392131,0.00005157591,0.00023953996,0.00016858496,0.00020257577],"domain_scores_gemma":[0.99870616,0.000021259286,0.00013671945,0.0010004542,0.000059629223,0.00007577472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015925065,0.00009293961,0.00016367566,0.00005040791,0.0004991205,0.00010082198,0.0017837379,0.00005167525,0.000085834945],"category_scores_gemma":[0.000014043051,0.0000989932,0.00005833694,0.00006275601,0.00019922684,0.0006283566,0.0006651083,0.00006636272,0.000083363],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009259122,0.00033007204,0.016016912,0.0002004047,0.0002755525,0.0013257231,0.15035443,0.00009210063,0.121170916,0.46102116,0.071785055,0.1773351],"study_design_scores_gemma":[0.005618305,0.00059369,0.72276753,0.00032895216,0.00012224227,0.000121367484,0.106420316,0.077732444,0.025016746,0.025920779,0.03334885,0.0020087752],"about_ca_topic_score_codex":0.017056148,"about_ca_topic_score_gemma":0.0019914361,"teacher_disagreement_score":0.70675063,"about_ca_system_score_codex":0.000017916818,"about_ca_system_score_gemma":0.000022431133,"threshold_uncertainty_score":0.9894894},"labels":[],"label_agreement":null},{"id":"W2962795882","doi":"10.25596/jalc-2017-029","title":"Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages","year":2017,"lang":"en","type":"article","venue":"UWSpace (University of Waterloo)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ideal (ethics); State (computer science); Mathematics; Computer science; Binary number; Arithmetic; Programming language; Epistemology; Philosophy","score_opus":0.02019124733844362,"score_gpt":0.22524602191600346,"score_spread":0.20505477457755983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962795882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99630505,0.000029289913,0.00088098977,0.002474145,0.00003662303,0.00007021873,0.000023754834,0.00004219132,0.00013776807],"genre_scores_gemma":[0.98196566,0.000031708176,0.010615197,0.000019391979,0.0000058614555,5.856223e-8,0.0000047685917,0.0000031188715,0.0073542083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99948,0.00004731175,0.00005588987,0.0001794119,0.00012246716,0.00011488961],"domain_scores_gemma":[0.99922,0.000025361192,0.0000893664,0.0005609673,0.000051593004,0.000052687556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115735194,0.00007226814,0.00014626977,0.000088724475,0.00034140272,0.00004602173,0.0006456451,0.000031777505,0.0000131481875],"category_scores_gemma":[0.00001313454,0.000073256786,0.000033994664,0.000057708974,0.00034628733,0.0004078107,0.00036671004,0.000056392775,0.0000056722365],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029988322,0.0007769194,0.013122485,0.00032131578,0.0003265738,0.0008947055,0.19978516,0.0016622265,0.2631938,0.46871477,0.0044628726,0.046439327],"study_design_scores_gemma":[0.0027434542,0.00094207824,0.8448002,0.00025124932,0.00005054308,0.000025865573,0.024539743,0.08875109,0.02562901,0.011366653,0.00030861766,0.0005915198],"about_ca_topic_score_codex":0.018403754,"about_ca_topic_score_gemma":0.0018791851,"teacher_disagreement_score":0.8316777,"about_ca_system_score_codex":0.0000108121885,"about_ca_system_score_gemma":0.000020146079,"threshold_uncertainty_score":0.9881328},"labels":[],"label_agreement":null},{"id":"W2962852487","doi":"10.1515/integ.2009.027","title":"Christoffel Words and Markoff Triples","year":2009,"lang":"en","type":"article","venue":"Integers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Mathematics; Algebra over a field; Arithmetic; Pure mathematics","score_opus":0.005713033424047182,"score_gpt":0.21434177469517077,"score_spread":0.20862874127112357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962852487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4429284,0.0030635574,0.4730915,0.011166263,0.0010977453,0.00023242833,0.0000038531402,0.000926831,0.06748941],"genre_scores_gemma":[0.98906857,0.000034020937,0.008900684,0.0014640248,0.000045499135,0.0000017939687,4.926403e-7,0.000003086361,0.0004818134],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941283,0.000024019095,0.00010076408,0.00020305334,0.000099977864,0.000159376],"domain_scores_gemma":[0.9995773,0.000056808916,0.000030476778,0.00025970853,0.0000117160425,0.00006397866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000174073,0.0000829237,0.00009511402,0.00006115529,0.000049715625,0.00010105,0.0003747693,0.000035074314,0.00001756105],"category_scores_gemma":[0.000031025556,0.00006875021,0.00003302692,0.00013910653,0.00003837659,0.00022790326,0.00005364456,0.00008361309,0.000027824757],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009275636,0.000033036762,0.0001023736,0.0000041196417,0.00000789003,0.000028263326,0.0011591652,0.000002403625,0.0021635187,0.148577,0.012866689,0.83504623],"study_design_scores_gemma":[0.0032199712,0.001233779,0.067677006,0.0003816752,0.000037391423,0.00048048675,0.0016244595,0.14264287,0.034162976,0.46965897,0.27667102,0.0022094145],"about_ca_topic_score_codex":0.000011247064,"about_ca_topic_score_gemma":0.000001119905,"teacher_disagreement_score":0.83283687,"about_ca_system_score_codex":0.000015891934,"about_ca_system_score_gemma":0.0000150043725,"threshold_uncertainty_score":0.28035522},"labels":[],"label_agreement":null},{"id":"W2962895102","doi":"10.23638/lmcs-15(1:11)2019","title":"The Subpower Membership Problem for Finite Algebras with Cube Terms","year":2019,"lang":"en","type":"article","venue":"CU Scholar (University of Colorado Boulder)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cube (algebra); Algebra over a field; Mathematics; Pure mathematics; Computer science; Combinatorics","score_opus":0.007760281499568587,"score_gpt":0.18962416952716468,"score_spread":0.1818638880275961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962895102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90255743,0.00019688162,0.08609433,0.003424626,0.00027412237,0.0009681891,0.0000140913835,0.00021117613,0.0062591718],"genre_scores_gemma":[0.97486347,0.000023287539,0.021828083,0.00019965823,0.000018679504,0.0000018303772,0.000005829912,0.000014554169,0.003044581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878114,0.0000976704,0.000113290436,0.00037527859,0.00028840418,0.00034422765],"domain_scores_gemma":[0.9984759,0.00036080397,0.00018184965,0.00072550727,0.00015469552,0.00010125264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000765009,0.00015336396,0.00021621269,0.00009230637,0.0006108943,0.00019792603,0.0015941994,0.00010225983,0.00006220636],"category_scores_gemma":[0.00002963847,0.00012411109,0.00011851859,0.00038823916,0.0001779083,0.0012401533,0.00028034163,0.0002720666,0.00008511909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010020733,0.00041403127,0.018098425,0.00035571714,0.0004927424,0.00007913393,0.011895565,0.00046264613,0.005670936,0.9124795,0.008549047,0.040500168],"study_design_scores_gemma":[0.012076186,0.0036015194,0.0730224,0.0005828601,0.0002541378,0.00008461618,0.013468627,0.072889015,0.0039861146,0.14981408,0.6679443,0.002276129],"about_ca_topic_score_codex":0.000022356264,"about_ca_topic_score_gemma":0.000049734423,"teacher_disagreement_score":0.76266545,"about_ca_system_score_codex":0.000041136977,"about_ca_system_score_gemma":0.00010905751,"threshold_uncertainty_score":0.5061103},"labels":[],"label_agreement":null},{"id":"W2962904359","doi":"10.1007/s00224-017-9803-8","title":"Syntactic Complexity of Regular Ideals","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"European Social Fund; Uniwersytet Wrocławski; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; European Commission; Narodowe Centrum Nauki; University of Toronto; Narodowym Centrum Nauki","keywords":"Regular language; Cardinality (data modeling); Suffix; Mathematics; Prefix; Discrete mathematics; Nondeterministic finite automaton; Descriptive complexity theory; Combinatorics; Computer science; Time complexity; Automaton; Automata theory; Linguistics; Theoretical computer science","score_opus":0.05201520097610158,"score_gpt":0.2847825039784081,"score_spread":0.23276730300230652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962904359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54479015,0.00042725296,0.44512546,0.00012057209,0.0011466838,0.00021787881,0.000005168239,0.00016334366,0.008003504],"genre_scores_gemma":[0.99464273,0.0000023318285,0.005116596,0.00001966371,0.000100118974,0.0000012255422,7.2670895e-7,0.000011758257,0.000104837396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806845,0.00045428285,0.00058119436,0.00029562006,0.00033880095,0.00026164544],"domain_scores_gemma":[0.996011,0.00053648214,0.0012150048,0.0020284078,0.0001421518,0.00006696382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033663367,0.00015809097,0.0005463616,0.00009272934,0.0003242373,0.00015340827,0.0024815185,0.000063594634,0.0000069133857],"category_scores_gemma":[0.00023339318,0.00014102971,0.00012519778,0.000081822924,0.0005117164,0.00029328253,0.00059490086,0.0001002187,0.000013627575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009809277,0.000039359325,0.00035120492,0.00021890932,0.000045870973,0.0000050757626,0.00072434347,0.00018320071,0.003189581,0.98939925,0.00006792196,0.0057654395],"study_design_scores_gemma":[0.0009785191,0.00023722068,0.038308818,0.0019191018,0.000045168046,0.00014674124,0.00057103107,0.2098321,0.023361621,0.7237596,0.00026652357,0.00057355384],"about_ca_topic_score_codex":0.00012539282,"about_ca_topic_score_gemma":6.8201666e-7,"teacher_disagreement_score":0.4498526,"about_ca_system_score_codex":0.00002249826,"about_ca_system_score_gemma":0.00003723528,"threshold_uncertainty_score":0.57510245},"labels":[],"label_agreement":null},{"id":"W2962907371","doi":"10.48550/arxiv.1907.08247","title":"The abelian complexity of infinite words and the Frobenius problem","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Abelian group; Mathematics; Algebra over a field; Pure mathematics","score_opus":0.056827129785857494,"score_gpt":0.17794420859524235,"score_spread":0.12111707880938485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962907371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57653606,0.0012625656,0.40432936,0.001749569,0.0010674403,0.0013225119,0.00004604143,0.00028772405,0.0133987],"genre_scores_gemma":[0.9975447,0.00047482832,0.0009759695,0.00010135131,0.000029602297,9.967222e-7,0.0000029109615,0.00000984162,0.00085981906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985249,0.000296819,0.00022441104,0.0005837125,0.00010333433,0.0002668145],"domain_scores_gemma":[0.997331,0.00057223433,0.00037067023,0.0015665343,0.00009327278,0.000066275934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083868357,0.00022998944,0.00033906312,0.0000867093,0.0002683879,0.00017792163,0.0025159519,0.00014225929,0.000008228932],"category_scores_gemma":[0.000027447306,0.00014729617,0.00016681783,0.0003608842,0.00103991,0.00017444503,0.003304412,0.00047976102,0.000023380546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005335647,0.00002219059,0.0008612388,0.00005683364,0.000082367565,0.00000927218,0.00068771705,0.0066729058,0.000008192806,0.9897901,0.00014081632,0.0016150211],"study_design_scores_gemma":[0.0009444712,0.000028685161,0.002422256,0.00010518806,0.000047165206,0.00000395329,0.00019223745,0.36637732,0.000046888734,0.6282865,0.0013049527,0.00024040324],"about_ca_topic_score_codex":0.00032795212,"about_ca_topic_score_gemma":0.00006695696,"teacher_disagreement_score":0.42100862,"about_ca_system_score_codex":0.000038361846,"about_ca_system_score_gemma":0.000113749025,"threshold_uncertainty_score":0.6006564},"labels":[],"label_agreement":null},{"id":"W2962987831","doi":"10.1016/j.tcs.2011.05.057","title":"The growth function of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>S</mml:mi></mml:math>-recognizable sets","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scroll; Function (biology); Mathematics; Computer science; Algorithm; Computer graphics (images); Theology; Philosophy; Biology","score_opus":0.014901754697260744,"score_gpt":0.22520454045590907,"score_spread":0.21030278575864833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962987831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7656783,0.00008247997,0.22885574,0.0002159456,0.001321314,0.00005420572,0.000008442097,0.00017584073,0.0036077492],"genre_scores_gemma":[0.9772881,0.000041117575,0.021618057,0.00075165846,0.00021678225,0.0000309602,0.000006238577,0.000031904852,0.000015161275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967229,0.0001364029,0.0005296359,0.0008133938,0.00097638805,0.0008213129],"domain_scores_gemma":[0.9973391,0.0006356881,0.00031102897,0.0012682539,0.0001585265,0.00028736904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022993812,0.00028175567,0.00020241343,0.00011366143,0.0008995391,0.00052004267,0.002657903,0.00018557173,0.000041444036],"category_scores_gemma":[0.00022268562,0.00023866822,0.00023377787,0.00079804636,0.0024948851,0.0009830898,0.0016911955,0.00035670388,0.00046512697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007869346,0.00011168616,0.0000099070085,0.00003769381,0.00003182054,0.000029251696,0.00072857173,0.000057042398,0.0006240352,0.9884272,0.00013914896,0.009724937],"study_design_scores_gemma":[0.00025211557,0.00051234977,0.00029827523,0.00010235856,0.00003475966,0.00009622633,0.00005053153,0.88786787,0.013085982,0.097310126,0.00014264992,0.00024676882],"about_ca_topic_score_codex":0.000052135565,"about_ca_topic_score_gemma":0.0000054060024,"teacher_disagreement_score":0.8911171,"about_ca_system_score_codex":0.000014820194,"about_ca_system_score_gemma":0.00024578496,"threshold_uncertainty_score":0.97326076},"labels":[],"label_agreement":null},{"id":"W2962994149","doi":"","title":"Connecting Weighted Automata and Recurrent Neural Networks through Spectral Learning","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Recurrent neural network; Computer science; Connection (principal bundle); Automaton; Algorithm; Extension (predicate logic); Rank (graph theory); Artificial neural network; Artificial intelligence; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.08167116604847909,"score_gpt":0.3369207155138802,"score_spread":0.2552495494654011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962994149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029086443,0.00003445041,0.96593636,0.0009158768,0.001100984,0.00008327499,0.000021554997,0.00013672885,0.0026843355],"genre_scores_gemma":[0.95923424,0.00019361294,0.03995382,0.00025539077,0.00028836803,0.000003879351,0.00001910971,0.000009032746,0.000042522668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986177,0.00009900077,0.00033358965,0.00043338415,0.0002521818,0.00026413135],"domain_scores_gemma":[0.99899125,0.0003931607,0.00013926881,0.0001699513,0.00022182653,0.00008451606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002899765,0.00017587401,0.00015601436,0.000076166834,0.00029152082,0.00058081053,0.00042763582,0.000059715498,0.00016129501],"category_scores_gemma":[0.000220378,0.00016339705,0.000021343623,0.00012310724,0.00020526045,0.00034085405,0.00020678976,0.0002640775,0.00003587899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024858608,0.000025304784,0.0000403767,0.0000022625422,0.000011144312,0.000011775436,0.00068302755,0.00008331128,0.00009918405,0.66401017,0.000040564388,0.33496803],"study_design_scores_gemma":[0.00003242551,0.0002943363,0.000112723,0.000037217236,0.0000040717855,0.00003177964,0.00037923208,0.7864067,0.00072774745,0.21153076,0.00028561425,0.00015740363],"about_ca_topic_score_codex":0.000045314784,"about_ca_topic_score_gemma":0.00007083135,"teacher_disagreement_score":0.9301478,"about_ca_system_score_codex":0.00002402604,"about_ca_system_score_gemma":0.000023782188,"threshold_uncertainty_score":0.6663138},"labels":[],"label_agreement":null},{"id":"W2963042803","doi":"10.1051/ita/2010007","title":"Infinite words containing squares at every position","year":2010,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Infimum and supremum; Alphabet; Word (group theory); Position (finance); Mathematics; Combinatorics; Binary number; Arithmetic; Existential quantification; Discrete mathematics; Linguistics; Philosophy","score_opus":0.00508258092233842,"score_gpt":0.23085131560883587,"score_spread":0.22576873468649744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963042803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16543615,0.00003528531,0.8104636,0.0013689005,0.00009265057,0.00033387763,0.000020105037,0.00026136014,0.021988085],"genre_scores_gemma":[0.9588639,0.000018969013,0.039649177,0.0012207978,0.00007378865,0.000105635285,0.000020923919,0.000007438901,0.000039333703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910057,0.000017289416,0.00035090037,0.00013455392,0.00016652321,0.0002301423],"domain_scores_gemma":[0.9988836,0.00030318886,0.00010233323,0.00048753223,0.000067380155,0.0001559562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035695458,0.0001301772,0.00013511893,0.000071908486,0.00033213157,0.00023744929,0.00040160495,0.00009573998,0.00008136877],"category_scores_gemma":[0.000038882572,0.00010936234,0.00004634695,0.0001980921,0.00036413438,0.00038444414,0.00032726084,0.00021795604,0.00008136032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035523233,0.000022645903,0.00003798875,0.000013215131,0.000005839801,3.089297e-7,0.00067090866,0.0000059436934,0.00083109393,0.9757504,0.00014139322,0.022516726],"study_design_scores_gemma":[0.00042360535,0.00009162227,0.000796098,0.000027843951,0.000019179948,0.00009840631,0.00039696236,0.28226298,0.0013444157,0.67328143,0.04088083,0.00037664868],"about_ca_topic_score_codex":0.0000014342032,"about_ca_topic_score_gemma":0.0000013676085,"teacher_disagreement_score":0.79342777,"about_ca_system_score_codex":0.000015412366,"about_ca_system_score_gemma":0.000023464438,"threshold_uncertainty_score":0.4459667},"labels":[],"label_agreement":null},{"id":"W2963118546","doi":"","title":"On the number of unbordered factors","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Sequence (biology); Morse code; Computer science; Combinatorics; Discrete mathematics; Mathematics; Telecommunications","score_opus":0.01886922901219202,"score_gpt":0.2231976949213709,"score_spread":0.20432846590917889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963118546","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086239807,0.000025059224,0.0069856,0.0003348398,0.0002467068,0.00014170272,0.000005441469,0.00010636798,0.9912919],"genre_scores_gemma":[0.05509057,0.000019885994,0.0012643337,0.0007791128,0.00003942942,0.0000042185998,0.0000042882816,0.000025342539,0.9427728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915165,0.000014892121,0.0001934283,0.00025150488,0.00025844644,0.000130092],"domain_scores_gemma":[0.99841976,0.00043588685,0.00014704111,0.0009099937,0.000050051323,0.000037258196],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010472908,0.00020422248,0.00021341442,0.000037315895,0.000042123593,0.00005837275,0.0010970059,0.0001366004,0.0092786485],"category_scores_gemma":[0.000014336471,0.00010536148,0.00012896913,0.000023756644,0.00006956119,0.00008475886,0.00022436358,0.00017379124,0.0016797436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.961247e-7,0.000005607016,0.000003109952,0.000004167711,0.00002134498,7.812979e-7,0.000058619447,4.0869466e-7,0.000006928273,0.9824724,0.0141972685,0.0032289764],"study_design_scores_gemma":[0.00006655271,0.000029535597,0.000081573824,0.00007916785,0.0000069934244,0.0000029849518,0.000011352515,0.00067512295,0.0004431212,0.94092995,0.05742373,0.0002499092],"about_ca_topic_score_codex":0.000036530837,"about_ca_topic_score_gemma":0.0000013260353,"teacher_disagreement_score":0.05422817,"about_ca_system_score_codex":0.000012813217,"about_ca_system_score_gemma":0.000027289976,"threshold_uncertainty_score":0.9990976},"labels":[],"label_agreement":null},{"id":"W2963210887","doi":"10.1142/s0218196710005662","title":"APERIODIC POINTLIKES AND BEYOND","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Aperiodic graph; Decidability; Mathematics; Set (abstract data type); Discrete mathematics; Combinatorics; Pure mathematics; Computer science","score_opus":0.004474427832064978,"score_gpt":0.2400935153321515,"score_spread":0.23561908750008653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963210887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8163926,0.00015041258,0.1796518,0.0024551323,0.0010364215,0.000018878394,6.904008e-7,0.000015358602,0.00027871932],"genre_scores_gemma":[0.97620475,0.00003529988,0.023043009,0.00052535115,0.00017669282,3.4022554e-7,9.426988e-7,0.0000029959585,0.000010624146],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993984,0.000019367639,0.00020084468,0.000092449576,0.000228974,0.000059958664],"domain_scores_gemma":[0.9994397,0.000096312135,0.00016599095,0.000047008776,0.000192003,0.00005898747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022700716,0.000060005368,0.00008181755,0.0001354041,0.000043495416,0.00026745643,0.00027136906,0.00002881371,0.000011128795],"category_scores_gemma":[0.000032353,0.00005001501,0.000028757457,0.000048486665,0.00004922915,0.0005834221,0.00008535377,0.00013065268,0.0000024876288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021652499,0.000053686177,0.0017619448,0.000004627444,0.00006402525,0.00005827559,0.0015464852,0.00003485107,0.012825898,0.27760115,0.00030059056,0.7057268],"study_design_scores_gemma":[0.00205762,0.00037968956,0.10003382,0.00006446809,0.000023470231,0.0050553945,0.00034860792,0.13362698,0.003913956,0.75056,0.003596141,0.00033988242],"about_ca_topic_score_codex":0.0000024014055,"about_ca_topic_score_gemma":0.0000014803666,"teacher_disagreement_score":0.70538694,"about_ca_system_score_codex":0.000006105644,"about_ca_system_score_gemma":0.000028374481,"threshold_uncertainty_score":0.25790885},"labels":[],"label_agreement":null},{"id":"W2963216346","doi":"10.1007/978-3-319-98654-8_10","title":"Additive Number Theory via Approximation by Regular Languages","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Programming language; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.005978647879563974,"score_gpt":0.22829505871394593,"score_spread":0.22231641083438194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963216346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059081434,0.00032850725,0.986688,0.00022267511,0.0007876085,0.00030666805,0.00007849797,0.0003071161,0.011221804],"genre_scores_gemma":[0.0629592,0.00008147117,0.9186538,0.006889672,0.0024281654,0.000070392234,0.0003519618,0.00016701971,0.008398329],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650633,0.000094214534,0.0004152878,0.001483254,0.00088734325,0.0006135603],"domain_scores_gemma":[0.99701655,0.000791547,0.00033263324,0.0014950822,0.00021697672,0.00014719299],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012352918,0.0005297166,0.00045317403,0.0003323394,0.00025479402,0.00049131375,0.0031120384,0.00035717493,0.0011726228],"category_scores_gemma":[0.000116307776,0.0004618144,0.00013013961,0.0004480423,0.001076603,0.000814033,0.0011254383,0.0005394091,0.00047010818],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071243044,0.00003358576,0.000003025663,0.000024984132,0.000020526004,0.00005170275,0.0015116604,0.00011649445,0.00034146657,0.07432103,0.0036169156,0.9199515],"study_design_scores_gemma":[0.00020644699,0.000110092406,0.000015715246,0.00036784212,0.000010105721,0.00012270553,0.0000013211597,0.14051154,0.007471907,0.839691,0.010667825,0.0008235101],"about_ca_topic_score_codex":0.0000082868355,"about_ca_topic_score_gemma":0.0000070662,"teacher_disagreement_score":0.91912794,"about_ca_system_score_codex":0.000208123,"about_ca_system_score_gemma":0.00019136122,"threshold_uncertainty_score":0.99978334},"labels":[],"label_agreement":null},{"id":"W2963221799","doi":"","title":"Permutation complexity of images of Sturmian words by marked morphisms","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Morphism; Permutation (music); Combinatorics; Art","score_opus":0.050669574501848766,"score_gpt":0.1841130613037573,"score_spread":0.13344348680190854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963221799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6801193,0.000016768996,0.31754932,0.00004641881,0.00007919816,0.000056617002,0.000013518445,0.000050781346,0.002068119],"genre_scores_gemma":[0.9975541,0.000009428657,0.0019348993,0.00004072929,0.000016501559,8.9869836e-8,0.0000043641126,0.0000048029187,0.00043508582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927545,0.00008600159,0.00013366203,0.00028596743,0.00007025549,0.00014869709],"domain_scores_gemma":[0.9991535,0.00006244546,0.00016252289,0.000438791,0.00012716172,0.000055611185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019827741,0.00009411742,0.0001573288,0.00010045696,0.0000673455,0.0000139696485,0.0006849452,0.00004298705,0.0000689948],"category_scores_gemma":[0.000017277729,0.000099283854,0.000064257285,0.0005085851,0.00048768794,0.0003928568,0.00018967497,0.000053567546,0.000018188926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012744924,0.00037785058,0.010985276,0.00007125882,0.00010437547,0.000044349985,0.0015612707,0.00043919616,0.06395248,0.9130008,0.00374285,0.005592801],"study_design_scores_gemma":[0.0023600224,0.0007625526,0.07300051,0.00012158149,0.00008264545,0.000012392907,0.0010119574,0.4894392,0.19506153,0.23668006,0.00071885687,0.00074869255],"about_ca_topic_score_codex":0.00010591468,"about_ca_topic_score_gemma":0.000011242952,"teacher_disagreement_score":0.6763208,"about_ca_system_score_codex":0.000028035673,"about_ca_system_score_gemma":0.00002826578,"threshold_uncertainty_score":0.4048678},"labels":[],"label_agreement":null},{"id":"W2963223550","doi":"10.1515/integ.2011.007","title":"Van der Waerden's Theorem and Avoidability in Words","year":2011,"lang":"en","type":"article","venue":"Integers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Van der Waerden's theorem; Mathematics; Combinatorics","score_opus":0.015984831060490524,"score_gpt":0.2174280305775529,"score_spread":0.20144319951706235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963223550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8986317,0.0001466959,0.06287077,0.0003039786,0.0002745107,0.00012531942,8.955424e-7,0.00016143137,0.03748472],"genre_scores_gemma":[0.9942836,0.000004801346,0.0052673807,0.00031828712,0.000013255584,0.000007682446,1.7029026e-7,0.000004889772,0.000099887766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924535,0.00007669021,0.00013396383,0.00026611844,0.00008735324,0.00019052185],"domain_scores_gemma":[0.9994206,0.00009678712,0.000029410176,0.0003767516,0.00001684233,0.000059601767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048624468,0.000089794536,0.000105206665,0.00006769036,0.000031032236,0.000043213382,0.0004438475,0.000046263856,0.000110643065],"category_scores_gemma":[0.000059001857,0.000071780945,0.000028976048,0.00016161722,0.00011006633,0.00026722645,0.00016940213,0.00012904739,0.00003993999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003430079,0.00018016786,0.02654638,0.000023695107,0.00002207554,0.00007491736,0.026907936,0.000004242497,0.0008024117,0.71276075,0.0004925081,0.23215058],"study_design_scores_gemma":[0.0005604176,0.00012694739,0.08169226,0.00007759958,0.0000062060394,0.000036967915,0.0014839561,0.012109247,0.010193225,0.8919195,0.0013394032,0.00045429808],"about_ca_topic_score_codex":0.0001195236,"about_ca_topic_score_gemma":0.000040665305,"teacher_disagreement_score":0.2316963,"about_ca_system_score_codex":0.000028443752,"about_ca_system_score_gemma":0.000020370233,"threshold_uncertainty_score":0.29271418},"labels":[],"label_agreement":null},{"id":"W2963282310","doi":"10.1016/j.aim.2009.09.001","title":"A groupoid approach to discrete inverse semigroup algebras","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":184,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Inverse semigroup; Inverse element; Bicyclic semigroup; Semigroup; Cancellative semigroup; Pure mathematics; Duality (order theory); Inverse; Algebra over a field; Convolution (computer science); Idempotence; Special classes of semigroups","score_opus":0.00977277697568894,"score_gpt":0.25581891978628796,"score_spread":0.24604614281059903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963282310","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014074397,0.00057590986,0.9420643,0.00039098546,0.00015934347,0.00032840244,0.000002495595,0.0002914419,0.042112745],"genre_scores_gemma":[0.18427742,0.00013608337,0.8131328,0.0020338725,0.00006366925,0.00003582874,0.000003398359,0.000016141163,0.00030074595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845517,0.000040953666,0.00037101092,0.00041938756,0.00030835555,0.0004051293],"domain_scores_gemma":[0.998809,0.00013161117,0.00010701657,0.00080215395,0.000023221954,0.00012704202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044314645,0.00021470262,0.0002921939,0.00015981273,0.00006410101,0.000105743144,0.0011907812,0.000058904716,0.000007736204],"category_scores_gemma":[0.00009875111,0.00018333527,0.000065753564,0.0007081701,0.000038457252,0.0011006407,0.00019331716,0.00015465118,0.00009365345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036120352,0.00029575347,0.00004335275,0.00006916686,0.000004497437,0.000014891071,0.0044533648,0.001098217,0.0003973057,0.9602575,0.00054988405,0.032812465],"study_design_scores_gemma":[0.00036268562,0.00011853692,0.00035663965,0.000120966455,0.0000056129093,0.00004457928,0.0004537066,0.14249258,0.0005706415,0.8469334,0.008085603,0.00045502235],"about_ca_topic_score_codex":0.0000019928502,"about_ca_topic_score_gemma":0.0000046289138,"teacher_disagreement_score":0.17020302,"about_ca_system_score_codex":0.00005026912,"about_ca_system_score_gemma":0.00001549207,"threshold_uncertainty_score":0.74761957},"labels":[],"label_agreement":null},{"id":"W2963375598","doi":"10.1017/s1446788713000074","title":"A VARIANT OF HOFSTADTER’S SEQUENCE AND FINITE AUTOMATA","year":2012,"lang":"en","type":"article","venue":"Journal of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Automaton; Mathematics; Finite-state machine; Integer (computer science); Combinatorics; Discrete mathematics; Algorithm; Theoretical computer science; Computer science; Programming language; Genetics; Biology","score_opus":0.04289413870499177,"score_gpt":0.28252230318145355,"score_spread":0.2396281644764618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963375598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6493064,0.00024403808,0.33720765,0.0117452135,0.0007012921,0.00024380429,0.000014087651,0.00006247595,0.00047503726],"genre_scores_gemma":[0.8999855,0.000019692012,0.09940268,0.00025250253,0.00008696207,7.740613e-7,6.676846e-8,0.000006421187,0.00024542355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986986,0.00009033694,0.00047856662,0.00008662931,0.0003808926,0.00026495493],"domain_scores_gemma":[0.9985861,0.00032429048,0.0004572163,0.0004132264,0.00006379968,0.00015535302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014579099,0.000116207375,0.00027349705,0.000018652625,0.000071962364,0.000067434245,0.00092791195,0.000073601615,0.00004077153],"category_scores_gemma":[0.0001682999,0.00006562077,0.00028171367,0.00019632684,0.00017249011,0.0005760564,0.0002969981,0.00023511537,0.0000074030445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021206324,0.0011725331,0.0032518625,0.0009571461,0.0005597919,0.00003324909,0.024713125,0.000079872254,0.026806366,0.9067559,0.025294153,0.010354788],"study_design_scores_gemma":[0.0024280665,0.0004794813,0.03686261,0.0018954986,0.00038911577,0.0055958256,0.0018068961,0.069253825,0.025701031,0.8495645,0.0050954176,0.00092776935],"about_ca_topic_score_codex":0.0000016333289,"about_ca_topic_score_gemma":3.591337e-8,"teacher_disagreement_score":0.25067908,"about_ca_system_score_codex":0.0000312169,"about_ca_system_score_gemma":0.0000419563,"threshold_uncertainty_score":0.2675937},"labels":[],"label_agreement":null},{"id":"W2963398621","doi":"","title":"Hereditary Rigid Relations.","year":2015,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Unary operation; Mathematics; Identity function; Identity (music); Set (abstract data type); Constant (computer programming); Finite set; Pure mathematics; Combinatorics; Computer science; Mathematical analysis; Physics","score_opus":0.015371285475275043,"score_gpt":0.22473418335123818,"score_spread":0.20936289787596313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963398621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022379538,0.0027984977,0.8112167,0.018791601,0.0010342505,0.0004231037,0.00005685206,0.0011403869,0.14215906],"genre_scores_gemma":[0.63571894,0.000250949,0.34090328,0.0004068269,0.00011869354,0.00011050572,0.0005753107,0.00007512683,0.02184038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931877,0.0042286674,0.0005607244,0.0010122478,0.0006059389,0.00040467893],"domain_scores_gemma":[0.99205136,0.0011970117,0.00048244777,0.004009316,0.001972261,0.00028762818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007380691,0.00037018384,0.00038301348,0.00023216968,0.00032052113,0.000726231,0.0035974414,0.00036096034,0.00012678382],"category_scores_gemma":[0.0011692978,0.00038790805,0.00021949118,0.00048452595,0.00019331167,0.00044922976,0.0038712204,0.00082462124,0.0003358345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005279187,0.0005408261,0.00057989574,0.00010021336,0.0001026935,0.00003812154,0.010884681,0.00031120234,0.00025498742,0.84885365,0.051172674,0.08715578],"study_design_scores_gemma":[0.0010785487,9.0029823e-7,0.0033488648,0.0025705893,0.000069161135,0.00009820476,0.00017500509,0.38206917,0.010788997,0.49757305,0.10062234,0.001605189],"about_ca_topic_score_codex":0.000611055,"about_ca_topic_score_gemma":0.00023839672,"teacher_disagreement_score":0.6133394,"about_ca_system_score_codex":0.0001834641,"about_ca_system_score_gemma":0.0006121999,"threshold_uncertainty_score":0.9998573},"labels":[],"label_agreement":null},{"id":"W2963407000","doi":"","title":"Primitive words and Lyndon words in automatic and linearly recurrent sequences","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Sequence (biology); Factorization; Combinatorics; Generating function; Bounded function; Computer science; Function (biology); Combinatorics on words; Algorithm; Mathematics; Discrete mathematics; Word (group theory); Arithmetic; Biology; Genetics","score_opus":0.015559798908457682,"score_gpt":0.22808675651606733,"score_spread":0.21252695760760965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963407000","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032379203,0.011045534,0.024777105,0.0023848098,0.0013423497,0.0020109168,0.000027505785,0.0010849206,0.9249477],"genre_scores_gemma":[0.2492154,0.006662565,0.1158933,0.0021234746,0.00055565394,0.00018341205,0.00003925213,0.00017048628,0.62515646],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832517,0.00004097901,0.00039743737,0.00067246467,0.00027855046,0.00028539434],"domain_scores_gemma":[0.99897164,0.0002460822,0.00018127238,0.0004266536,0.00004045645,0.00013387311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034688137,0.0003715688,0.00045736716,0.0002658962,0.000059320133,0.00038025217,0.0004804874,0.00023555907,0.0002592193],"category_scores_gemma":[0.000022595153,0.0002634601,0.000050561448,0.00006798338,0.00019196265,0.0005150388,0.00047733728,0.00034446057,0.00007161827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022777842,0.000014744407,0.00003456882,0.0000860385,0.000025199286,0.000035018686,0.0014551202,4.3086544e-7,0.0000121979165,0.40733618,0.00044758708,0.5905506],"study_design_scores_gemma":[0.0015451467,0.0009147759,0.004934089,0.0046108,0.00007551656,0.00029144716,0.00036315128,0.3420233,0.00014727376,0.61296165,0.02931792,0.0028149497],"about_ca_topic_score_codex":0.00008242622,"about_ca_topic_score_gemma":0.000050663737,"teacher_disagreement_score":0.58773565,"about_ca_system_score_codex":0.000056484572,"about_ca_system_score_gemma":0.00007965544,"threshold_uncertainty_score":0.99998176},"labels":[],"label_agreement":null},{"id":"W2963571572","doi":"10.1016/j.aim.2009.08.013","title":"An automaton-theoretic approach to the representation theory of quantum algebras","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Torus; Invariant (physics); Semigroup; Pure mathematics; Discrete mathematics; Representation theory; Invariant theory; Algebraic number; Quantum; Algebra over a field; Quantum mechanics; Mathematical physics","score_opus":0.015042188280655398,"score_gpt":0.2922200621754028,"score_spread":0.2771778738947474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963571572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0416939,0.00048296273,0.9497485,0.00023363363,0.00010625229,0.00030101102,0.0000014039886,0.00013636831,0.007295959],"genre_scores_gemma":[0.8240415,0.000062346306,0.17554843,0.0002722176,0.000024378971,0.000018638772,0.0000017545057,0.000008159248,0.000022588436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986254,0.0001761879,0.00039572586,0.00028653038,0.00029505676,0.00022112372],"domain_scores_gemma":[0.9982532,0.00038762586,0.00017207165,0.0010950324,0.00004053252,0.000051530376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169976,0.00013642345,0.00022530522,0.000109043154,0.000061664825,0.000060787053,0.0013557211,0.000039657538,0.000006592471],"category_scores_gemma":[0.00016199815,0.00009190857,0.000048940274,0.0005982217,0.00008357619,0.00069300126,0.000080500446,0.00009783954,0.000015190024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038700887,0.00023172684,0.000023850533,0.000031796855,0.0000025405586,0.0000013158154,0.005489476,0.0027176815,0.00020641864,0.95281523,0.000021803711,0.03845428],"study_design_scores_gemma":[0.00008609323,0.00006471866,0.0004934043,0.00004064853,0.0000036125089,0.000011686615,0.0008914956,0.27882007,0.0013881925,0.71804154,0.00006490519,0.00009360742],"about_ca_topic_score_codex":9.354661e-7,"about_ca_topic_score_gemma":4.973237e-7,"teacher_disagreement_score":0.78234756,"about_ca_system_score_codex":0.000018097577,"about_ca_system_score_gemma":0.000018511239,"threshold_uncertainty_score":0.37479228},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028626477348128468,"score_gpt":0.3462912195548554,"score_spread":0.31766474220672697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964048382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04117853,0.00021781537,0.94579834,0.007512244,0.0051011015,0.00007802085,0.0000034279024,0.000019631829,0.00009087301],"genre_scores_gemma":[0.7164978,0.000014109667,0.28284088,0.00030421466,0.00032751766,0.0000031797463,3.00161e-7,0.000002662766,0.0000093344215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979418,0.000046641584,0.0005852923,0.00013991277,0.0010002947,0.0002860917],"domain_scores_gemma":[0.99635905,0.0012247731,0.00042472995,0.0002913616,0.0015735279,0.0001265741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022977896,0.00009283841,0.00014657773,0.00025470462,0.00035688665,0.00062602636,0.003434743,0.000020642181,0.000011772327],"category_scores_gemma":[0.0003276847,0.00006344116,0.0001277312,0.00035559566,0.00060103583,0.0027670972,0.00034714333,0.00008682131,0.000007731157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009631956,0.00024666885,0.0008315755,0.000011391282,0.00007482772,0.0000024031106,0.0018280594,0.00078590517,0.001563082,0.7500067,0.0019211067,0.24271867],"study_design_scores_gemma":[0.00052386266,0.0002849025,0.0077377497,0.00016212341,0.00001713621,0.00047634754,0.00010546573,0.8639601,0.010855648,0.10023253,0.01542639,0.00021776477],"about_ca_topic_score_codex":0.000004468085,"about_ca_topic_score_gemma":2.988755e-7,"teacher_disagreement_score":0.8631742,"about_ca_system_score_codex":0.00009478074,"about_ca_system_score_gemma":0.00035210102,"threshold_uncertainty_score":0.6382664},"labels":[],"label_agreement":null},{"id":"W2964137219","doi":"10.4153/cmb-2018-014-8","title":"Merge Decompositions, Two-sided Krohn–Rhodes, and Aperiodic Pointlikes","year":2018,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Homomorphism; Semigroup; Semidirect product; Aperiodic graph; Mathematical proof; Merge (version control); Pure mathematics; Decomposition theorem; Discrete mathematics; Algebraic number; Direct product; Algebra over a field; Combinatorics; Group (periodic table); Computer science; Mathematical analysis","score_opus":0.006204546888429754,"score_gpt":0.22040460149230726,"score_spread":0.2142000546038775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964137219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44499317,0.001286577,0.36119407,0.08142566,0.00080950215,0.001010418,0.000066267196,0.0010090385,0.108205296],"genre_scores_gemma":[0.92886394,0.000008499659,0.06549192,0.004658297,0.0001593598,0.000024754576,0.0000051636816,0.000022068243,0.0007660023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986326,0.00008138489,0.0002632475,0.00037206974,0.00015853476,0.00049212703],"domain_scores_gemma":[0.99844134,0.00025989956,0.000046309462,0.0005333302,0.000058208112,0.0006608975],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000389107,0.00017735454,0.00022375745,0.00014827581,0.00033212185,0.0002855029,0.00054946565,0.000069805465,0.0046329466],"category_scores_gemma":[0.00019262222,0.00016075463,0.000052308224,0.00018276511,0.0002725624,0.00009309605,0.00012612987,0.00011768223,0.007072463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026152943,0.000032761513,0.00002557245,0.000029773893,0.000018605882,0.00006566735,0.00067970756,3.7814857e-7,0.000533884,0.9612999,0.030166553,0.0071445704],"study_design_scores_gemma":[0.0012058845,0.00027476597,0.0009836988,0.0004427076,0.000047327612,0.00085461634,0.00031696528,0.0346151,0.0027175548,0.73532516,0.22199245,0.0012237557],"about_ca_topic_score_codex":0.0009209792,"about_ca_topic_score_gemma":0.001001067,"teacher_disagreement_score":0.48387074,"about_ca_system_score_codex":0.00006901183,"about_ca_system_score_gemma":0.00012689874,"threshold_uncertainty_score":0.996277},"labels":[],"label_agreement":null},{"id":"W2964149005","doi":"10.1142/s0218196717500084","title":"On the atoms of algebraic lattices arising in 𝔮-theory","year":2017,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Mathematics; Algebraic number; Algebra over a field; Pure mathematics; Algebraic theory; Mathematical analysis","score_opus":0.015634903759305544,"score_gpt":0.29598898408520485,"score_spread":0.2803540803258993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964149005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87063974,0.00011349308,0.12589197,0.0024622467,0.0004707231,0.000029132962,6.369582e-7,0.0000048049696,0.0003872235],"genre_scores_gemma":[0.99794555,0.000022701935,0.0016640123,0.0002869842,0.000067560606,4.4670654e-7,3.119267e-7,0.0000030229928,0.000009396879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999162,0.00008455759,0.00028979752,0.000086699874,0.00031182118,0.000065111715],"domain_scores_gemma":[0.9985549,0.00054073706,0.00059318385,0.0001309928,0.00015663306,0.0000235522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008307808,0.000061980245,0.00010766401,0.00014690789,0.000080206795,0.00025291982,0.00085749244,0.00002435226,0.000006605292],"category_scores_gemma":[0.00018226693,0.000042121635,0.000047595473,0.000037404763,0.00007578318,0.0005601344,0.00011692865,0.00011374159,0.0000020485718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040830917,0.000051951523,0.0013861952,0.0000033305178,0.00004646709,0.000025480656,0.0008450553,0.00030937587,0.00032747578,0.86919546,0.000042250784,0.1277261],"study_design_scores_gemma":[0.00046901332,0.000098269215,0.06682602,0.0001710821,0.000005056054,0.00006781204,0.000109209774,0.034724865,0.0014630394,0.8959792,0.00002666132,0.00005972017],"about_ca_topic_score_codex":0.0000083871255,"about_ca_topic_score_gemma":0.0000021163319,"teacher_disagreement_score":0.12766638,"about_ca_system_score_codex":0.00001813354,"about_ca_system_score_gemma":0.00003094829,"threshold_uncertainty_score":0.24389116},"labels":[],"label_agreement":null},{"id":"W2964301491","doi":"10.1007/978-3-642-40579-2_26","title":"Sets Represented as the Length-n Factors of a Word","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alphabet; Word (group theory); Upper and lower bounds; Combinatorics; Binary number; Mathematics; Set (abstract data type); Combinatorics on words; Discrete mathematics; Finite set; Word length; Computer science; Arithmetic; Natural language processing; Linguistics","score_opus":0.0172427046136661,"score_gpt":0.24584312987546808,"score_spread":0.22860042526180196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964301491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005359889,0.0005356476,0.9840344,0.0012242245,0.0015603555,0.00051244296,0.000005262888,0.00017794548,0.00658981],"genre_scores_gemma":[0.9063551,0.00007949889,0.08958425,0.0019988068,0.00030066672,0.000016155942,0.0000063750654,0.00005607673,0.0016030844],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964854,0.00006762518,0.00056578935,0.0012322661,0.0010698074,0.00057908945],"domain_scores_gemma":[0.99556947,0.0011949557,0.00043462354,0.0024410777,0.00022437985,0.00013549771],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000834313,0.00048791018,0.00053587684,0.00048570693,0.00022398667,0.00041199982,0.0056475555,0.00026215907,0.000109673856],"category_scores_gemma":[0.00018820575,0.0003136767,0.00019607529,0.0006435022,0.0010734192,0.00057129597,0.0020842862,0.00074304244,0.00009453202],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005335506,0.000045719877,0.00012231212,0.0000400444,0.000036480313,0.000046282134,0.0032403017,0.0035107515,0.00039568724,0.09204877,0.00017264804,0.90033567],"study_design_scores_gemma":[0.00029972143,0.0002241363,0.0011048561,0.00059007213,0.000016023218,0.00010340579,0.0000022946715,0.3417449,0.007574593,0.64311236,0.0042923265,0.00093533716],"about_ca_topic_score_codex":0.00014432416,"about_ca_topic_score_gemma":0.000021683672,"teacher_disagreement_score":0.9009952,"about_ca_system_score_codex":0.000103464576,"about_ca_system_score_gemma":0.0003309078,"threshold_uncertainty_score":0.9999315},"labels":[],"label_agreement":null},{"id":"W2964341975","doi":"10.37236/8905","title":"Queens in Exile: Non-attacking Queens on Infinite Chess Boards","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Quadrant (abdomen); Square (algebra); Queen (butterfly); Order (exchange); Mathematics; Word (group theory); Spiral (railway); Geometry; Mathematical analysis; Biology; Zoology","score_opus":0.01603099815686654,"score_gpt":0.2611772959522399,"score_spread":0.24514629779537334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964341975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.555227,0.008676477,0.3977866,0.02257181,0.008574239,0.0010139459,0.000010130853,0.0002779637,0.0058618593],"genre_scores_gemma":[0.9974227,0.0011568851,0.00011880722,0.00078791624,0.000375048,0.000009094425,0.0000021840272,0.000045921963,0.000081457896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961611,0.00045027476,0.0009968848,0.0004529108,0.00097423827,0.0009645881],"domain_scores_gemma":[0.99666715,0.0005687727,0.0012540388,0.0010963291,0.00025081044,0.0001629187],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0028815034,0.000473892,0.000854883,0.00037990502,0.0001323811,0.00031219266,0.0043664775,0.00029931052,0.0000065375957],"category_scores_gemma":[0.00018828335,0.00035679224,0.00036796197,0.00085187383,0.000075002274,0.00026855984,0.0012864996,0.0051403246,0.000020524127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006256103,0.00023804218,0.00024606826,0.00007964514,0.00016940219,0.0001687238,0.0022936354,0.0026982585,0.00013139249,0.9899111,0.0012662516,0.00273495],"study_design_scores_gemma":[0.0010551393,0.00074369623,0.001389175,0.000574709,0.000051139556,0.000121965364,0.00009971027,0.015727134,0.0013611871,0.974901,0.0034873951,0.0004877402],"about_ca_topic_score_codex":0.000032747303,"about_ca_topic_score_gemma":0.000009893503,"teacher_disagreement_score":0.4421957,"about_ca_system_score_codex":0.0010047394,"about_ca_system_score_gemma":0.0017977218,"threshold_uncertainty_score":0.9998884},"labels":[],"label_agreement":null},{"id":"W2964549879","doi":"10.1007/978-3-030-23679-3_18","title":"Decision Problems for Restricted Variants of Two-Dimensional Automata","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic automaton; Nondeterministic finite automaton; Decidability; Nondeterministic algorithm; Unary operation; Deterministic finite automaton; Discrete mathematics; Automaton; Two-way deterministic finite automaton; Decision problem; Computer science; Büchi automaton; Equivalence (formal languages); Combinatorics; Mathematics; Finite-state machine; Automata theory; Algorithm; Theoretical computer science","score_opus":0.017336484729493278,"score_gpt":0.25404343266138335,"score_spread":0.23670694793189007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964549879","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006392961,0.0002862632,0.99459606,0.00020946316,0.0025027369,0.0008528586,0.000029241546,0.00016712445,0.0007169563],"genre_scores_gemma":[0.0932968,0.000015134986,0.905303,0.0006764291,0.00025906833,0.00001358756,0.000018615536,0.00005025963,0.0003670995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959051,0.00003254105,0.0007585169,0.0015476027,0.001145957,0.00061027426],"domain_scores_gemma":[0.99519134,0.001859241,0.0005218116,0.0019069263,0.00038807592,0.0001325819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001136389,0.00048329702,0.0006892902,0.0008817744,0.00015838629,0.00024885806,0.0038728125,0.0003047289,0.000018559736],"category_scores_gemma":[0.00017965508,0.0004086367,0.00018405255,0.0006552354,0.00038729567,0.0005850937,0.0016557706,0.00042176328,0.000032515727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028850496,0.000087254826,0.000026714206,0.00012354086,0.000023951297,0.000026915426,0.00025450683,0.13940392,0.0023032841,0.120740764,0.0001278642,0.7368524],"study_design_scores_gemma":[0.00065503037,0.00022692386,0.00020836493,0.00068527355,0.00000701485,0.000040789608,2.4150019e-8,0.6526802,0.0006995476,0.34415016,0.00028694145,0.00035970123],"about_ca_topic_score_codex":0.000018537496,"about_ca_topic_score_gemma":0.000017480434,"teacher_disagreement_score":0.73649275,"about_ca_system_score_codex":0.0001517845,"about_ca_system_score_gemma":0.00091105513,"threshold_uncertainty_score":0.99983656},"labels":[],"label_agreement":null},{"id":"W2964924495","doi":"10.23638/dmtcs-22-1-6","title":"The repetition threshold for binary rich words","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Repetition (rhetorical device); Binary number; Psychology; Linguistics; Mathematics; Natural language processing; Arithmetic; Computer science; Philosophy","score_opus":0.017334118239021163,"score_gpt":0.25899928604030886,"score_spread":0.2416651678012877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964924495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077622817,0.000072223986,0.97596514,0.012304493,0.00043187407,0.00047001048,0.0000055743185,0.00034628622,0.002642127],"genre_scores_gemma":[0.7160529,0.000011181814,0.28212225,0.0015256527,0.0002110239,0.000044943758,0.00000202231,0.000017217813,0.000012833245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715734,0.000060829516,0.00047519288,0.00078782503,0.0008087539,0.0007100701],"domain_scores_gemma":[0.99722266,0.00096156955,0.00015954657,0.00114128,0.00018347909,0.0003314906],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021382407,0.0002605324,0.00027133749,0.00006710931,0.0011469313,0.0012623701,0.0040596146,0.000059734342,0.000017691527],"category_scores_gemma":[0.0003308859,0.0001632786,0.00015392844,0.0010734946,0.0019667088,0.00062357466,0.0014045873,0.00020807957,0.00006064932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008740746,0.0000340331,0.0000037320538,0.000033118333,0.000007261897,0.0000046668542,0.001590606,0.00006126256,0.0008031181,0.9921845,0.00037067183,0.00489828],"study_design_scores_gemma":[0.00012596404,0.00017029989,0.000013893612,0.000029673502,0.000006413846,0.000010189736,0.00007166194,0.5858919,0.0012048567,0.41203743,0.0002759405,0.00016178245],"about_ca_topic_score_codex":2.4921138e-7,"about_ca_topic_score_gemma":1.2860997e-7,"teacher_disagreement_score":0.7082906,"about_ca_system_score_codex":0.000036141064,"about_ca_system_score_gemma":0.00010900561,"threshold_uncertainty_score":0.9997744},"labels":[],"label_agreement":null},{"id":"W2969519964","doi":"10.5802/jtnb.1070","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>F</mml:mi> </mml:math> -sets and finite automata","year":2019,"lang":"en","type":"article","venue":"Journal de Théorie des Nombres de Bordeaux","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Subvariety; Mathematics; Commutative property; Endomorphism; Algebraic group; Natural number; Context (archaeology); Abelian group; Algebraic number; Discrete mathematics; Action (physics); Invariant (physics); Pure mathematics; Algebra over a field; Mathematical analysis; Variety (cybernetics)","score_opus":0.01246956994955565,"score_gpt":0.23958445543329335,"score_spread":0.2271148854837377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969519964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98247725,0.00088231877,0.010559878,0.0005608546,0.0008070854,0.000043490803,0.000023121538,0.00022141328,0.0044245822],"genre_scores_gemma":[0.98341143,0.0006851016,0.014016052,0.0012262464,0.00037272827,0.000023252775,0.000012389071,0.000069919966,0.00018286477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974985,0.00013928508,0.0005160584,0.00046982738,0.0005571661,0.0008191517],"domain_scores_gemma":[0.9977111,0.00052873953,0.00043842866,0.0008448262,0.00007875812,0.00039811578],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012847596,0.00029994253,0.0002321666,0.00015994642,0.00051233073,0.0010926039,0.0012406721,0.0002991079,0.000061054794],"category_scores_gemma":[0.0002658178,0.00032094703,0.00025942695,0.0003002674,0.00020878944,0.0010756057,0.0007158798,0.00063928665,0.0005546667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006655733,0.000074966745,0.00021215451,0.00011625974,0.00011291531,0.00048721817,0.0009833799,0.00032347091,0.00088418636,0.986188,0.0015534248,0.008997496],"study_design_scores_gemma":[0.0008866499,0.0005213306,0.0027989948,0.00036812606,0.000080543,0.003618569,0.00028872906,0.93503433,0.0023415745,0.044343065,0.009244908,0.00047319874],"about_ca_topic_score_codex":0.00007284163,"about_ca_topic_score_gemma":0.000018695964,"teacher_disagreement_score":0.9418449,"about_ca_system_score_codex":0.0000430564,"about_ca_system_score_gemma":0.00049580034,"threshold_uncertainty_score":0.9999443},"labels":[],"label_agreement":null},{"id":"W2971864569","doi":"10.1142/s0129054121420041","title":"Descriptional Complexity of Semi-Simple Splicing Systems","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"String (physics); Regular language; RNA splicing; Axiom; Mathematics; Set (abstract data type); Recursively enumerable language; Simple (philosophy); Focus (optics); Combinatorics; Discrete mathematics; Computer science; Theoretical computer science; Physics; Automaton; Genetics; RNA","score_opus":0.04492041818409099,"score_gpt":0.30748736289904227,"score_spread":0.2625669447149513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971864569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18806268,0.00010479941,0.8084679,0.00059735955,0.0024399075,0.000034757955,0.000008679803,0.000012238079,0.00027168368],"genre_scores_gemma":[0.85513806,0.000014748023,0.14454237,0.00009007425,0.00019582726,6.086027e-7,0.0000031965392,0.0000030821318,0.000012061063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974222,0.00007231261,0.0008109781,0.00021419178,0.0013216366,0.00015869224],"domain_scores_gemma":[0.99484545,0.00019849632,0.0008315017,0.00036000586,0.0036739514,0.00009058158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011404045,0.00009694349,0.00024545545,0.00045837453,0.00010980829,0.00032241145,0.0025101597,0.000025621672,0.000026914604],"category_scores_gemma":[0.00014921608,0.00009045327,0.00013489499,0.00072964816,0.0005389802,0.0017227662,0.00053217553,0.00011718785,0.0000037852608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013945825,0.00030721072,0.0016385434,0.000022397044,0.000109468696,0.000041528943,0.0006161269,0.013252804,0.045536343,0.9130967,0.00038035514,0.024984537],"study_design_scores_gemma":[0.0010861602,0.0003008611,0.03901005,0.0004976432,0.000022538352,0.0022690021,0.00017830278,0.80020124,0.056948055,0.09698366,0.0021970076,0.00030547602],"about_ca_topic_score_codex":0.000030725245,"about_ca_topic_score_gemma":0.0000029572805,"teacher_disagreement_score":0.81611305,"about_ca_system_score_codex":0.000115522285,"about_ca_system_score_gemma":0.0008424818,"threshold_uncertainty_score":0.46645433},"labels":[],"label_agreement":null},{"id":"W2972232677","doi":"10.1007/s00209-021-02868-7","title":"A refinement of Christol’s theorem for algebraic power series","year":2021,"lang":"en","type":"preprint","venue":"Mathematische Zeitschrift","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algebraic closure; Mathematics; Algebraic number; Power series; Ring (chemistry); Formal power series; Context (archaeology); Series (stratigraphy); Finite field; Algebraic extension; State (computer science); Polynomial ring; Combinatorics; Field (mathematics); Discrete mathematics; Bounded function; Closure (psychology); Polynomial; Pure mathematics; Algorithm; Mathematical analysis","score_opus":0.015340489818487563,"score_gpt":0.2493736303180293,"score_spread":0.23403314049954174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972232677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030934408,0.0052378434,0.93389547,0.0018479985,0.0016232698,0.0014572283,0.00015528327,0.0005709533,0.024277518],"genre_scores_gemma":[0.6082168,0.00011136114,0.38947466,0.00030635437,0.00011942018,0.0004918992,0.000094851806,0.00008531021,0.0010993095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695796,0.00013855753,0.0009061299,0.0009688604,0.00054064335,0.00048786483],"domain_scores_gemma":[0.99615324,0.00031177682,0.0007295919,0.0023831779,0.0003040175,0.00011821832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011646188,0.0005352142,0.0010040796,0.00017918252,0.00012224112,0.00034058033,0.002154114,0.0003599868,0.00026150348],"category_scores_gemma":[0.00026125237,0.00046262995,0.00052251073,0.0002409036,0.00012965575,0.00035588525,0.0028019536,0.00041323082,0.000024798968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014195718,0.00020932678,0.0000075300873,0.0013280495,0.00021026969,0.000016770937,0.0037056748,0.00003104522,0.0025592241,0.98477364,0.003635986,0.0035083145],"study_design_scores_gemma":[0.0036310107,0.0011425433,0.000950283,0.008580003,0.00053494377,0.0004551715,0.0033835513,0.024369227,0.25770417,0.5450007,0.14920689,0.0050415304],"about_ca_topic_score_codex":0.000019664212,"about_ca_topic_score_gemma":0.0000074484433,"teacher_disagreement_score":0.5772824,"about_ca_system_score_codex":0.000010009327,"about_ca_system_score_gemma":0.00030627134,"threshold_uncertainty_score":0.99978256},"labels":[],"label_agreement":null},{"id":"W2973381442","doi":"10.1142/s0129054119400367","title":"State Complexity of the Quotient Operation on Input-Driven Pushdown Automata","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Pushdown automaton; Deterministic pushdown automaton; Quotient; Context-free language; Nested word; Discrete mathematics; String (physics); Regular language; Mathematics; Closure (psychology); Computer science; Quantum finite automata; Nondeterministic finite automaton; Combinatorics; Finite-state machine; Automata theory; Automaton; Rule-based machine translation; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.022675386170567174,"score_gpt":0.2866288769865917,"score_spread":0.2639534908160245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973381442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5194796,0.000006031843,0.47425058,0.002689581,0.0031439255,0.000105587686,0.0000074552445,0.000012642303,0.00030463046],"genre_scores_gemma":[0.95112544,0.0000048135057,0.048493482,0.00027059947,0.000069936075,7.0110616e-7,0.0000015122073,0.000003369538,0.00003014623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746096,0.00008343249,0.00064922933,0.00020937096,0.0014554787,0.00014152756],"domain_scores_gemma":[0.9970633,0.00014624708,0.0008591311,0.0005674189,0.0013057783,0.00005813962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094523974,0.000103136386,0.000187061,0.00039951163,0.00010591944,0.00025116952,0.0043329727,0.000019540974,0.0000270042],"category_scores_gemma":[0.00007222238,0.000071945724,0.00012959108,0.0005161255,0.0005070777,0.0015099824,0.0006630397,0.00014037648,0.000018871177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005629561,0.0007942997,0.005995624,0.000020703825,0.00013536713,0.0000064675332,0.002618473,0.13369332,0.03607821,0.7336194,0.0005401432,0.08644172],"study_design_scores_gemma":[0.0010099397,0.0005345697,0.104750834,0.00030494537,0.0000074960653,0.0001233962,0.000024924475,0.83528864,0.029475167,0.027054423,0.0012491053,0.00017654775],"about_ca_topic_score_codex":0.00001692959,"about_ca_topic_score_gemma":0.0000034986174,"teacher_disagreement_score":0.70656496,"about_ca_system_score_codex":0.00012393395,"about_ca_system_score_gemma":0.0004798539,"threshold_uncertainty_score":0.8051813},"labels":[],"label_agreement":null},{"id":"W2973570009","doi":"10.1142/s0129054119400306","title":"Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Suffix; Prefix; Factor (programming language); Regular language; Star (game theory); Computer science; Mathematics; Complementation; Discrete mathematics; Linguistics; Artificial intelligence; Programming language; Automaton","score_opus":0.01206863278707973,"score_gpt":0.2887628517587392,"score_spread":0.27669421897165947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973570009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6519817,0.00017852892,0.34576866,0.001377737,0.00054214563,0.00006442973,0.000014558564,0.000014069437,0.00005813615],"genre_scores_gemma":[0.93138856,0.000055376517,0.06808362,0.0003772576,0.00006615289,7.206993e-7,0.0000057444204,0.000004373187,0.000018192679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983997,0.000050531547,0.00042448216,0.00023892889,0.0007397187,0.00014668949],"domain_scores_gemma":[0.9983289,0.00017190522,0.0004185994,0.00026709237,0.0007223412,0.000091152426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005134446,0.00011075822,0.00016223779,0.0003525108,0.00009516077,0.0005213818,0.0015267745,0.00002410519,0.00003232584],"category_scores_gemma":[0.00003584072,0.00009617975,0.00003590585,0.00030979936,0.00024300067,0.0020381846,0.00047312435,0.000095576615,0.0000035337168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056654753,0.00044673815,0.019429334,0.000044767905,0.00035064702,0.00002096715,0.0036862777,0.0015106514,0.2235777,0.5698454,0.0028726435,0.17815825],"study_design_scores_gemma":[0.007015265,0.0015883285,0.3545784,0.00045709917,0.00004971593,0.00087098836,0.000854943,0.4670569,0.08145461,0.08088586,0.004147021,0.0010408816],"about_ca_topic_score_codex":0.00002469587,"about_ca_topic_score_gemma":0.000004614911,"teacher_disagreement_score":0.48895952,"about_ca_system_score_codex":0.000059997183,"about_ca_system_score_gemma":0.00017725494,"threshold_uncertainty_score":0.50276965},"labels":[],"label_agreement":null},{"id":"W2980045536","doi":"10.37236/11660","title":"Tree Automata and Pigeonhole Classes of Matroids: II","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Douglas College","funders":"Royal Society Te Apārangi","keywords":"Matroid; Pigeonhole principle; Mathematics; Combinatorics; Graphic matroid; Discrete mathematics; Class (philosophy); Tree (set theory); Computer science","score_opus":0.006619691375914248,"score_gpt":0.22282454320529904,"score_spread":0.2162048518293848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980045536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.963181,0.0049030017,0.026627108,0.003659824,0.0005810642,0.00009576252,0.0000011312763,0.00012919937,0.0008219168],"genre_scores_gemma":[0.998019,0.0015113552,0.000075765245,0.000056288827,0.000040835745,0.0000011058961,3.1158797e-7,0.000010476295,0.00028489734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857575,0.000109366,0.00037736044,0.00011503767,0.0003993614,0.00042312316],"domain_scores_gemma":[0.99874705,0.0002922705,0.00037721646,0.00040463338,0.0001201474,0.000058677564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016103963,0.00011795186,0.00025902482,0.00017153869,0.00015822794,0.000053360516,0.00124704,0.00004523105,0.000003057642],"category_scores_gemma":[0.00007607181,0.00007838453,0.000091647285,0.00081240135,0.00007702606,0.0003295878,0.00035316782,0.00034447634,0.0000057509815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011110354,0.00006689381,0.00010906557,0.000013746731,0.000053014835,0.000009747916,0.00045800177,0.000016760923,0.0013521627,0.9876726,0.0022342964,0.008002549],"study_design_scores_gemma":[0.0007884375,0.0009412237,0.002106271,0.00004144832,0.000029838737,0.00026210098,0.0002065905,0.00886353,0.0036766448,0.9789929,0.003971303,0.00011971396],"about_ca_topic_score_codex":0.0000037205086,"about_ca_topic_score_gemma":0.0000014615864,"teacher_disagreement_score":0.034837972,"about_ca_system_score_codex":0.000056285022,"about_ca_system_score_gemma":0.00026046863,"threshold_uncertainty_score":0.31964287},"labels":[],"label_agreement":null},{"id":"W2980258839","doi":"","title":"Upper Bound on Syntactic Complexity of Suffix-Free Languages","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Cardinality (data modeling); Semigroup; Suffix; Upper and lower bounds; Alphabet; Mathematics; Combinatorics; Discrete mathematics; State (computer science); Quotient; Automaton; Computer science; Algorithm; Theoretical computer science; Linguistics","score_opus":0.05045026808207155,"score_gpt":0.18716882192228534,"score_spread":0.1367185538402138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980258839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86743146,0.000014620806,0.11696763,0.00016584984,0.00012749564,0.00006080897,0.000005063703,0.00015127979,0.015075803],"genre_scores_gemma":[0.998339,0.000006197889,0.00085255207,0.00022467825,0.000030002831,1.04664444e-7,0.0000016178049,0.0000066681837,0.0005391835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991454,0.000116474555,0.000097477765,0.00035869327,0.00007573982,0.0002062176],"domain_scores_gemma":[0.9985405,0.00021928678,0.00009482369,0.001022628,0.000042801985,0.00007995023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002285075,0.00011792604,0.00016678954,0.00011505952,0.00009667973,0.00003635113,0.0012039096,0.000049953247,0.000060243456],"category_scores_gemma":[0.00007391953,0.000117537915,0.00008541966,0.00033298697,0.00017126188,0.00030462965,0.00031952187,0.00010360707,0.000099456316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013816907,0.00008227371,0.0017976293,0.000013751287,0.000016216747,0.00002468341,0.000109186854,0.00045093216,0.00034152757,0.9962445,0.00029835128,0.0006071114],"study_design_scores_gemma":[0.0020445313,0.00060766283,0.053119436,0.00012417042,0.00005824947,0.000020237194,0.00047700884,0.35975087,0.0099826995,0.57053363,0.0025269892,0.00075452885],"about_ca_topic_score_codex":0.00010961055,"about_ca_topic_score_gemma":0.000023169416,"teacher_disagreement_score":0.42571092,"about_ca_system_score_codex":0.000037825714,"about_ca_system_score_gemma":0.000020890942,"threshold_uncertainty_score":0.4793057},"labels":[],"label_agreement":null},{"id":"W2980435437","doi":"10.4153/s0008439519000638","title":"Measurable and Continuous Units of an -semigroup","year":2019,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unicode; Bijection; Mathematics; Semigroup; Combinatorics; Product (mathematics); Discrete mathematics; Arithmetic; Pure mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.007780172752348805,"score_gpt":0.18181219706139112,"score_spread":0.17403202430904233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980435437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95615757,0.00015404244,0.0057412414,0.0014713927,0.00008826421,0.00025958067,0.0000109850325,0.00008283339,0.03603408],"genre_scores_gemma":[0.9891081,0.000002594578,0.008519486,0.00059938256,0.00001498819,0.0000053328936,0.0000022507984,0.0000123496075,0.001735541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990085,0.0000619611,0.00021134935,0.0002489341,0.0001600223,0.00030926286],"domain_scores_gemma":[0.9987467,0.00016737843,0.000054468925,0.0005255224,0.00007580745,0.00043012723],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00047997292,0.00011473814,0.00024863833,0.000097558295,0.00004528104,0.000079140584,0.000503338,0.000071825045,0.0018494566],"category_scores_gemma":[0.00014332743,0.000102107595,0.000024081464,0.000192054,0.00006583565,0.00009806091,0.00006168194,0.000094048235,0.0015644634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029026698,0.000037825463,0.00020448289,0.00012291412,0.00001556278,0.000033230226,0.0006804309,0.0000038856415,0.0010831762,0.9843586,0.0029806544,0.010476322],"study_design_scores_gemma":[0.0028938851,0.0011523088,0.004199457,0.0010670525,0.00006278483,0.0007962104,0.0021611787,0.09198336,0.013205261,0.5729061,0.30738586,0.0021865852],"about_ca_topic_score_codex":0.00089867256,"about_ca_topic_score_gemma":0.00019499724,"teacher_disagreement_score":0.41145256,"about_ca_system_score_codex":0.000028282353,"about_ca_system_score_gemma":0.0001165552,"threshold_uncertainty_score":0.9992129},"labels":[],"label_agreement":null},{"id":"W2985287154","doi":"10.1016/j.tcs.2019.10.048","title":"Palindromization and construction of Markoff triples","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Diophantine equation; Mathematics; Set (abstract data type); Monoid; Palindrome; Free monoid; Resolution (logic); Combinatorics; Pure mathematics; Algebra over a field; Computer science","score_opus":0.003379876228543957,"score_gpt":0.19893721235105163,"score_spread":0.19555733612250767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985287154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39427802,0.000018577299,0.6038404,0.00016574281,0.00031200837,0.00008077597,6.018203e-7,0.000054757194,0.0012491071],"genre_scores_gemma":[0.81760544,0.0000060910206,0.1822662,0.00009333783,0.00002079287,8.839566e-7,3.3100764e-7,0.0000025755564,0.000004315793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988166,0.00006419774,0.0001984138,0.00038891958,0.00032402962,0.0002078315],"domain_scores_gemma":[0.9991211,0.00017780448,0.000077064724,0.00044483322,0.00009111168,0.00008805891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009106261,0.00008998621,0.00015690128,0.00013375263,0.000090115704,0.0001368419,0.0007803995,0.00003404811,0.000042605414],"category_scores_gemma":[0.00003625471,0.00007259148,0.000026832042,0.0005745059,0.0015683803,0.0005205111,0.00048236104,0.00006570575,0.00001811822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045672423,0.000012179722,0.00049395557,0.000009236796,0.000001604518,6.3365155e-7,0.00013171365,0.000021382839,0.0016531574,0.94297713,0.0000029690007,0.054691482],"study_design_scores_gemma":[0.0002727552,0.00013476686,0.0040493575,0.00003159461,0.000002462387,0.00005481288,0.000012201798,0.64879405,0.010134349,0.33636802,0.000026739172,0.000118866614],"about_ca_topic_score_codex":0.0000013854583,"about_ca_topic_score_gemma":5.0486815e-8,"teacher_disagreement_score":0.64877266,"about_ca_system_score_codex":0.000012787262,"about_ca_system_score_gemma":0.000048402882,"threshold_uncertainty_score":0.57787627},"labels":[],"label_agreement":null},{"id":"W2989980706","doi":"10.3233/fi-2020-1875","title":"Insertions Yielding Equivalent Double Occurrence Words","year":2019,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Symbol (formal); Palindrome; Mathematics; Computer science; Arithmetic; Characterization (materials science); Combinatorics; Geometry; Physics","score_opus":0.02152212203726644,"score_gpt":0.2566209218273727,"score_spread":0.23509879979010628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989980706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7968753,0.00008081254,0.14011644,0.00084929523,0.001748221,0.0005467778,0.000017566854,0.0005650969,0.059200488],"genre_scores_gemma":[0.99101573,0.000013519826,0.0068270257,0.0015340056,0.00002972532,0.000030496522,0.000014826135,0.0000049327905,0.00052973256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867296,0.000016820175,0.0003885705,0.00019133063,0.00033959546,0.00039074448],"domain_scores_gemma":[0.99887156,0.00009177666,0.00012775644,0.00075940375,0.00003148476,0.00011800021],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003307932,0.00015292304,0.0001665642,0.00012957245,0.00013717845,0.0004007799,0.0010409788,0.000047988193,0.000675451],"category_scores_gemma":[0.000012414748,0.0001337689,0.00007673408,0.00036462076,0.00003523203,0.002054526,0.0005487218,0.00015801542,0.0035108046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000457872,0.00028362215,0.009932475,0.00035804696,0.00009943642,0.000007962419,0.015339555,0.0005046773,0.0024112535,0.8748114,0.019661859,0.076543905],"study_design_scores_gemma":[0.0085413195,0.0012026491,0.008071205,0.0012569835,0.000063616346,0.0002226151,0.006668586,0.53564215,0.027437573,0.028162712,0.37941915,0.003311432],"about_ca_topic_score_codex":0.000010639098,"about_ca_topic_score_gemma":9.929295e-7,"teacher_disagreement_score":0.8466487,"about_ca_system_score_codex":0.00007656136,"about_ca_system_score_gemma":0.00005949169,"threshold_uncertainty_score":0.9972651},"labels":[],"label_agreement":null},{"id":"W2991381026","doi":"10.1016/j.tcs.2019.11.022","title":"Unique decipherability in formal languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chomsky hierarchy; Undecidable problem; Unique factorization domain; Combinatorics; Mathematics; Context (archaeology); Multiset; Factorization; Regular language; Word (group theory); Hierarchy; Context-free language; Formal language; Discrete mathematics; Philosophy of language; Computer science; Decidability; Artificial intelligence; Rule-based machine translation; Automaton; Philosophy; Algorithm","score_opus":0.004845414963894193,"score_gpt":0.2447670603921896,"score_spread":0.23992164542829542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991381026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49254256,0.000013862797,0.5004293,0.00030361238,0.00023063476,0.00012785269,4.0371376e-7,0.00013715628,0.0062146503],"genre_scores_gemma":[0.928524,0.0000015530976,0.0707121,0.00070004916,0.000037054706,0.0000045986494,3.379422e-7,0.0000049547757,0.000015320189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978538,0.00013618811,0.00024851895,0.0006488167,0.0004625644,0.00065011],"domain_scores_gemma":[0.99839234,0.00032948257,0.00004151773,0.001013881,0.0000648324,0.00015794963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002658019,0.00014827507,0.00019795728,0.00016588192,0.00011035184,0.00027212416,0.002576443,0.000051827228,0.00016173832],"category_scores_gemma":[0.000059431673,0.00011729761,0.000050757084,0.0010831323,0.0009451724,0.001329864,0.0012512057,0.00020866284,0.00020602155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004598999,0.00004304982,0.001095034,0.000005670421,7.561305e-7,0.000009413897,0.00035974602,0.00010622824,0.0010924829,0.944094,0.000005306633,0.053183682],"study_design_scores_gemma":[0.00035476167,0.00020292985,0.019355914,0.000037381153,7.995064e-7,0.000033360506,0.000025317077,0.6509535,0.0062815137,0.32236508,0.000117692085,0.00027175466],"about_ca_topic_score_codex":0.00000896886,"about_ca_topic_score_gemma":0.0000015709652,"teacher_disagreement_score":0.65084726,"about_ca_system_score_codex":0.000075084805,"about_ca_system_score_gemma":0.000104296065,"threshold_uncertainty_score":0.47877148},"labels":[],"label_agreement":null},{"id":"W2994108360","doi":"10.37236/2018","title":"Christoffel Words and the Calkin-Wilf Tree","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Christoffel symbols; Noncommutative geometry; Tree (set theory); Combinatorics; Duality (order theory); Rational number; Pure mathematics","score_opus":0.0079640133193285,"score_gpt":0.1884078611678091,"score_spread":0.1804438478484806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994108360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45495886,0.048350867,0.47388864,0.008548685,0.002334494,0.00037347907,5.2960615e-7,0.000112056376,0.011432387],"genre_scores_gemma":[0.9981734,0.001137212,0.000077756304,0.00032436437,0.00007677225,0.0000020543152,4.524559e-8,0.000009194899,0.00019918097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985746,0.00025444594,0.00031283306,0.000110440655,0.0003304029,0.00041724558],"domain_scores_gemma":[0.99869823,0.0003630521,0.0003371727,0.0004518938,0.000085720654,0.00006392672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025730578,0.00013002647,0.00023315632,0.000062820334,0.00019896585,0.00007806302,0.0017251073,0.00004390176,0.0000064610613],"category_scores_gemma":[0.000075364114,0.00006266367,0.00011301957,0.0003371635,0.0002026348,0.00026319426,0.00019280764,0.0006372264,0.000005185296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004784086,0.00004454254,0.000047093225,0.0000021917197,0.00004700069,0.0000073814535,0.0023479122,7.712705e-7,0.000023910881,0.9897751,0.00038544225,0.0072707813],"study_design_scores_gemma":[0.0014576032,0.00028764154,0.00076133216,0.000013482122,0.000037200374,0.00047960508,0.00015202843,0.0012802988,0.00052179507,0.9918897,0.0030230153,0.00009630939],"about_ca_topic_score_codex":0.000016730952,"about_ca_topic_score_gemma":0.000003595475,"teacher_disagreement_score":0.54321456,"about_ca_system_score_codex":0.00008654644,"about_ca_system_score_gemma":0.00019964266,"threshold_uncertainty_score":0.32057074},"labels":[],"label_agreement":null},{"id":"W2995334287","doi":"10.1016/j.ic.2021.104689","title":"Maximal state complexity and generalized de Bruijn words","year":2021,"lang":"en","type":"preprint","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"De Bruijn sequence; Generalization; Word (group theory); State (computer science); Mathematics; Word length; Combinatorics; Computer science; Discrete mathematics; Algorithm; Natural language processing","score_opus":0.024555745477797198,"score_gpt":0.2641879211985905,"score_spread":0.23963217572079332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995334287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37914506,0.00016000296,0.6196299,0.00035906627,0.00018430229,0.00011294889,0.000008942253,0.00013323058,0.00026650334],"genre_scores_gemma":[0.87669885,0.00017616282,0.12154654,0.0012596744,0.000031020852,0.000016233987,0.00025039288,0.0000053069593,0.000015802627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989709,0.00010103247,0.0003639752,0.00020032749,0.00019456756,0.00016917025],"domain_scores_gemma":[0.99930876,0.000045060835,0.0002455151,0.00019155952,0.00011662075,0.00009245187],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035958682,0.00016743591,0.00020009949,0.00013640338,0.00012856236,0.001244398,0.0002038191,0.00010130599,0.0000072781686],"category_scores_gemma":[0.000017089671,0.00017347776,0.0000391793,0.00011626446,0.000058400852,0.0011648296,0.0006857901,0.00020629751,0.0000056200624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025908335,0.000039152827,0.0005394025,0.000441006,0.00006356971,0.000009428703,0.02139747,0.018284064,0.00005462333,0.063117035,0.00053441676,0.8954939],"study_design_scores_gemma":[0.00040667102,0.000018300883,0.01817189,0.00006034945,0.0000065418285,0.000046477653,0.0001847785,0.91501683,0.000086879656,0.065285645,0.0005030955,0.0002125484],"about_ca_topic_score_codex":0.00013412896,"about_ca_topic_score_gemma":0.0000093133,"teacher_disagreement_score":0.89673275,"about_ca_system_score_codex":0.000045934823,"about_ca_system_score_gemma":0.00012576388,"threshold_uncertainty_score":0.9997924},"labels":[],"label_agreement":null},{"id":"W2997558551","doi":"10.1051/ita/2020006","title":"The weak circular repetition threshold over large alphabets","year":2020,"lang":"en","type":"preprint","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Repetition (rhetorical device); Physics; Combinatorics; Infimum and supremum; Mathematics; Philosophy","score_opus":0.010011638184957341,"score_gpt":0.2504297073528558,"score_spread":0.24041806916789846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997558551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012155405,0.0004912099,0.97154385,0.0041611716,0.00014142077,0.00083644653,0.000094214774,0.00030881766,0.021207316],"genre_scores_gemma":[0.97826713,0.0011592457,0.01601685,0.0030751582,0.00034913438,0.00084437255,0.00018880208,0.00003622194,0.00006308638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818045,0.000049708928,0.00065793673,0.00034065198,0.00038162628,0.00038963972],"domain_scores_gemma":[0.9976885,0.00033040287,0.0002779779,0.0013959166,0.000080201375,0.00022704969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326535,0.00028897857,0.00028519236,0.00005110396,0.000600056,0.00090040243,0.0013925872,0.0002357054,0.000032942473],"category_scores_gemma":[0.000048690585,0.00020681822,0.00015509427,0.00021481053,0.0004760894,0.00020965903,0.0021585575,0.00064897176,0.00008333729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020595767,0.000034969176,0.0000075568323,0.00008854569,0.00003217834,4.9168943e-7,0.00030989604,0.000027950102,0.000017070173,0.9885226,0.0010489702,0.009907736],"study_design_scores_gemma":[0.00013001799,0.000014055697,0.00006690225,0.000043124466,0.000022588936,0.0000071047916,0.00014756109,0.34838006,0.000044401193,0.61110276,0.039837677,0.00020375535],"about_ca_topic_score_codex":0.0000017809132,"about_ca_topic_score_gemma":6.4817647e-7,"teacher_disagreement_score":0.9770516,"about_ca_system_score_codex":0.000047089175,"about_ca_system_score_gemma":0.00007550171,"threshold_uncertainty_score":0.86826015},"labels":[],"label_agreement":null},{"id":"W2998391309","doi":"10.48550/arxiv.1912.12992","title":"A Note on the Parallel Cleaning of Cliques","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Clique; Conjecture; Computer science; Upper and lower bounds; Combinatorics; Mathematics; Parallel computing; Theoretical computer science; Mathematical analysis","score_opus":0.06377983943882734,"score_gpt":0.19165351717713636,"score_spread":0.12787367773830902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998391309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37825036,0.000038838094,0.6103042,0.00031499838,0.00044530013,0.00025775185,0.000007926827,0.00018931982,0.010191313],"genre_scores_gemma":[0.9975351,0.00009355509,0.0012255908,0.00034750142,0.00003796029,4.1193067e-7,0.0000025192503,0.000011671699,0.00074567663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987223,0.00018061801,0.000157446,0.0006281677,0.00009007546,0.00022140065],"domain_scores_gemma":[0.99765944,0.0004000764,0.00028148777,0.0015385749,0.00007026864,0.000050125193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039850714,0.00020832208,0.0002653355,0.000121068704,0.00007973004,0.0000624902,0.0023362688,0.00017001777,0.000024853287],"category_scores_gemma":[0.000035397174,0.00016910069,0.00020940977,0.00024307177,0.000093905015,0.000153655,0.0017376204,0.0004664217,0.0001187975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023272914,0.00004395141,0.0003391171,0.00003878512,0.00003908071,0.000038875205,0.0003780645,0.08227664,0.000044569635,0.91569036,0.00038456448,0.00070271123],"study_design_scores_gemma":[0.00027840538,0.000109594446,0.001441758,0.0002938438,0.0000317926,0.000002061852,0.000114715695,0.77920836,0.0006513608,0.21677728,0.0007223394,0.00036849134],"about_ca_topic_score_codex":0.00007508739,"about_ca_topic_score_gemma":0.000005608114,"teacher_disagreement_score":0.6989131,"about_ca_system_score_codex":0.00006429138,"about_ca_system_score_gemma":0.0001023124,"threshold_uncertainty_score":0.68957263},"labels":[],"label_agreement":null},{"id":"W2999574320","doi":"10.1016/j.tcs.2018.05.036","title":"On store languages of language acceptors","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pushdown automaton; Computer science; Nondeterministic algorithm; Regular language; Programming language; Nondeterministic finite automaton; Set (abstract data type); Finite-state machine; Theoretical computer science; Automaton; Automata theory","score_opus":0.005652122416816928,"score_gpt":0.2664795864860257,"score_spread":0.26082746406920876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999574320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42762893,0.000019101015,0.5621289,0.00021714641,0.00041216382,0.00006761241,0.0000017704425,0.00017687661,0.009347512],"genre_scores_gemma":[0.95159197,7.301319e-7,0.04750401,0.00069024984,0.00018742823,0.0000017323126,3.8078494e-7,0.0000065267377,0.000016970538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821824,0.0000788725,0.00019721941,0.00050825684,0.0005941416,0.0004032502],"domain_scores_gemma":[0.99840325,0.00027677897,0.00007269127,0.0009662089,0.00012279395,0.00015826212],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009832266,0.00014409244,0.00017900443,0.00019337979,0.00019497625,0.00014495407,0.0026910184,0.000040844363,0.0001956704],"category_scores_gemma":[0.00011405999,0.000106571955,0.000057950256,0.0008951027,0.0033907732,0.0003708842,0.00080272474,0.00011476003,0.00016482078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000671022,0.00004479624,0.000017482897,0.0000036501142,0.0000024024441,0.0000067265473,0.0015399744,0.000005347666,0.0035336919,0.9407792,0.00013604535,0.053923987],"study_design_scores_gemma":[0.0005584349,0.0018958559,0.0035838296,0.00013501721,0.000007833718,0.00004497863,0.000190565,0.3086961,0.34745306,0.33667707,0.00015741032,0.00059984386],"about_ca_topic_score_codex":0.0000045917704,"about_ca_topic_score_gemma":3.8475952e-7,"teacher_disagreement_score":0.60410213,"about_ca_system_score_codex":0.000028757322,"about_ca_system_score_gemma":0.00005985626,"threshold_uncertainty_score":0.9993214},"labels":[],"label_agreement":null},{"id":"W3000096852","doi":"10.1007/s00220-021-03979-2","title":"Gibbsian Representations of Continuous Specifications: The Theorems of Kozlov and Sullivan Revisited","year":2021,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Israel Science Foundation; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Lattice (music); Characterization (materials science); Algebra over a field; Complete lattice; Uniform continuity; Continuous function (set theory)","score_opus":0.06212556313151681,"score_gpt":0.3152315522961542,"score_spread":0.2531059891646374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000096852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025986636,0.0035014409,0.91308403,0.008864098,0.000045458033,0.0006126036,0.000030308154,0.00009225157,0.04778318],"genre_scores_gemma":[0.89414215,0.00046480438,0.10521757,0.000059232127,0.000009996684,0.000024481416,0.000011945587,0.0000068365707,0.00006295936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883896,0.0002931511,0.00046297908,0.00015801754,0.00014794801,0.00009896369],"domain_scores_gemma":[0.9946482,0.0018232176,0.0001945101,0.0031294397,0.00017827177,0.000026329206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005052477,0.000079010206,0.00023080687,0.00003703514,0.00009710483,0.000043764325,0.0013783284,0.000030680032,0.000014351236],"category_scores_gemma":[0.00041449768,0.000061564046,0.000059026326,0.00071796967,0.0004999368,0.00015735868,0.00067856547,0.00014782323,0.0000068639447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.334154e-7,0.00024652996,0.00016541063,0.000035838446,0.000012506111,3.4296306e-7,0.0018370686,0.000008497237,0.0015132757,0.98843217,0.00006540362,0.007682315],"study_design_scores_gemma":[0.00013607477,0.000009107782,0.0020864403,0.00013843241,0.000013475042,0.0000075019475,0.0011372044,0.026103033,0.0029718415,0.9670845,0.00024038668,0.00007194929],"about_ca_topic_score_codex":0.000004650606,"about_ca_topic_score_gemma":0.000002242054,"teacher_disagreement_score":0.86815554,"about_ca_system_score_codex":0.000010473749,"about_ca_system_score_gemma":0.0000396187,"threshold_uncertainty_score":0.25613},"labels":[],"label_agreement":null},{"id":"W3000349095","doi":"10.37236/909","title":"For each $\\alpha &gt; 2$ there is an Infinite Binary Word with Critical Exponent $\\alpha$","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Infimum and supremum; Exponent; Mathematics; Alpha (finance); Combinatorics; Word (group theory); Binary number; Critical exponent; Discrete mathematics; Arithmetic; Statistics; Geometry","score_opus":0.019762076447317534,"score_gpt":0.25544231610733475,"score_spread":0.23568023966001722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000349095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7132585,0.0063607353,0.27470046,0.0045740767,0.000567938,0.00022206621,0.000001990618,0.00007657329,0.0002376865],"genre_scores_gemma":[0.9974561,0.0006969534,0.0007913649,0.00062385807,0.00017779312,0.000010762042,8.543878e-7,0.000032589112,0.00020977689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753684,0.00021938917,0.00048670653,0.00025178722,0.0006583589,0.0008469371],"domain_scores_gemma":[0.9978097,0.00060516095,0.00032765613,0.0006801068,0.00039997153,0.00017740941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014027131,0.00025647995,0.0003747897,0.00014852604,0.00046358927,0.00011782642,0.0018905106,0.00008901354,0.000011964766],"category_scores_gemma":[0.00007870525,0.00015864136,0.00017988979,0.0005283744,0.00018100624,0.00083255675,0.00012527478,0.000724128,0.000008643049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024596,0.0005969151,0.0002507167,0.000018849985,0.0001222469,0.000112556314,0.002050286,0.00003459122,0.0005958565,0.99094546,0.0021898642,0.002836725],"study_design_scores_gemma":[0.0032190722,0.007921333,0.0019884033,0.00011280938,0.00010281046,0.0036949757,0.00040843798,0.011699282,0.0041714935,0.9488877,0.017220654,0.0005730269],"about_ca_topic_score_codex":0.0000035988007,"about_ca_topic_score_gemma":0.0000011964332,"teacher_disagreement_score":0.28419757,"about_ca_system_score_codex":0.00020580324,"about_ca_system_score_gemma":0.00067226996,"threshold_uncertainty_score":0.6469207},"labels":[],"label_agreement":null},{"id":"W3000767751","doi":"10.1016/j.jcss.2017.05.011","title":"Complexity of suffix-free regular languages","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki","keywords":"Suffix; Regular language; Computer science; Abstract family of languages; Mathematics; Programming language; Theoretical computer science; Linguistics; Second-generation programming language; Automaton; Fifth-generation programming language; Philosophy","score_opus":0.03649435107061784,"score_gpt":0.28232251809877423,"score_spread":0.2458281670281564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000767751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63737714,0.0014204147,0.35431567,0.0014672844,0.0013184908,0.000076316166,0.0000033657384,0.000033883032,0.003987455],"genre_scores_gemma":[0.9419882,0.000012472558,0.057743773,0.000036176323,0.00019966044,1.8601497e-7,3.4380324e-8,0.0000018571485,0.000017592483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987523,0.000095923235,0.0003943749,0.0001573234,0.0004497728,0.00015031414],"domain_scores_gemma":[0.9983131,0.00009658886,0.0007961553,0.0005736551,0.0001358763,0.000084600586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018755865,0.000089505455,0.00032064063,0.00012303433,0.0003937563,0.0005045019,0.0028481875,0.000029109302,0.0000016720502],"category_scores_gemma":[0.000032223747,0.000058695274,0.00008753087,0.00008602991,0.0005855166,0.00087008666,0.0005347389,0.00007065694,9.793595e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010539999,0.00006622849,0.0071812426,0.00019035765,0.000049998765,0.00011617702,0.001535062,0.000079613455,0.0008826244,0.9453676,0.0021400913,0.04238049],"study_design_scores_gemma":[0.0041362997,0.0032444794,0.42079672,0.0032999422,0.00007821489,0.0067120255,0.0037716306,0.42726204,0.010016031,0.11753094,0.002098136,0.0010535439],"about_ca_topic_score_codex":0.000028541954,"about_ca_topic_score_gemma":0.0000026792584,"teacher_disagreement_score":0.82783663,"about_ca_system_score_codex":0.00001038685,"about_ca_system_score_gemma":0.0000602367,"threshold_uncertainty_score":0.52926886},"labels":[],"label_agreement":null},{"id":"W3003895073","doi":"10.48550/arxiv.2001.11763","title":"Lengths of extremal square-free ternary words","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ternary operation; Square (algebra); Square-free integer; Mathematics; Combinatorics; Statistics; Computer science; Geometry","score_opus":0.06753658856910162,"score_gpt":0.18090390546365465,"score_spread":0.11336731689455302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003895073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2824017,0.00019472564,0.7083006,0.00043450802,0.0008335244,0.00024221849,0.000049459606,0.0004791965,0.007064054],"genre_scores_gemma":[0.9952343,0.00010492572,0.0037573304,0.00014152877,0.00011950385,5.6767493e-7,0.000010050335,0.000021509824,0.00061029155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980315,0.0001457915,0.00026696865,0.0010888008,0.00014610075,0.00032081504],"domain_scores_gemma":[0.9970201,0.0001503681,0.00033770656,0.0022208616,0.00008578729,0.00018514975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021078839,0.00033043927,0.00045302662,0.0002137823,0.000073481904,0.00007141007,0.0046554124,0.0002544859,0.00007041781],"category_scores_gemma":[0.00005766083,0.000374886,0.00032450902,0.0005366215,0.00014178806,0.00035897776,0.006199626,0.00054259005,0.00006889965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009244613,0.00026165505,0.0044325897,0.0004183751,0.00023876558,0.0016952758,0.0012083363,0.021247229,0.00052024965,0.96162343,0.0028223412,0.00543932],"study_design_scores_gemma":[0.00088124303,0.00014139783,0.0032130433,0.0002923912,0.00008661603,0.00001250065,0.00019771437,0.649504,0.00088931527,0.34303787,0.0009851007,0.0007587851],"about_ca_topic_score_codex":0.00012228319,"about_ca_topic_score_gemma":0.000011006976,"teacher_disagreement_score":0.71283257,"about_ca_system_score_codex":0.00008843753,"about_ca_system_score_gemma":0.00017631761,"threshold_uncertainty_score":0.9998703},"labels":[],"label_agreement":null},{"id":"W3004372759","doi":"10.24963/ijcai.2020/203","title":"Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem","year":2020,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Carleton University; University of Waterloo","funders":"","keywords":"Mathematical proof; Satisfiability; Boolean satisfiability problem; Conjunctive normal form; Symbolic computation; Terabyte; Resolution (logic)","score_opus":0.01563664605867351,"score_gpt":0.23311389027598106,"score_spread":0.21747724421730755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004372759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019633293,0.00006723812,0.95399535,0.015613977,0.00011773525,0.0008478532,0.0000062280715,0.00043418663,0.009284164],"genre_scores_gemma":[0.85404575,0.0000027089768,0.14313723,0.0023747818,0.000068539055,0.00010607998,0.0000033462845,0.000008536891,0.00025302087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893767,0.000049072023,0.00022695368,0.0004106269,0.00012989131,0.00024579855],"domain_scores_gemma":[0.99937785,0.00014293734,0.0000411105,0.00031460682,0.00003385337,0.0000896238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038543827,0.00010597963,0.00015850442,0.000029144687,0.000039813116,0.00007985687,0.0006265346,0.00004837508,0.000071863105],"category_scores_gemma":[0.0000550976,0.000083510284,0.00005116176,0.00033020563,0.000028252087,0.00034479346,0.00018242007,0.00008256528,0.00002683716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017873685,0.000105292005,0.0044882405,0.00012285943,0.00000828838,0.000004165876,0.0011834269,0.000045137207,0.0007422682,0.8920789,0.008435942,0.092767626],"study_design_scores_gemma":[0.0019121417,0.00043514874,0.006877844,0.000052133306,0.0000062038766,0.0000053136027,0.00009709428,0.48811963,0.013848063,0.42250043,0.06557045,0.00057555764],"about_ca_topic_score_codex":0.00002712297,"about_ca_topic_score_gemma":0.00005146042,"teacher_disagreement_score":0.83441246,"about_ca_system_score_codex":0.000037865782,"about_ca_system_score_gemma":0.000060378694,"threshold_uncertainty_score":0.34054503},"labels":[],"label_agreement":null},{"id":"W3005704136","doi":"10.5802/jtnb.1135","title":"The upper density of an automatic set is rational","year":2020,"lang":"fr","type":"preprint","venue":"Journal de Théorie des Nombres de Bordeaux","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Natural density; Natural number; Upper and lower bounds; Rational number; Mathematics; Set (abstract data type); Combinatorics; BETA (programming language); Alpha (finance); Discrete mathematics; Natural (archaeology); Computer science; Statistics; Mathematical analysis","score_opus":0.028402395063456556,"score_gpt":0.2867220647542983,"score_spread":0.25831966969084175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005704136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7322035,0.003353703,0.23616734,0.02368177,0.0024349561,0.00038924735,0.00014001885,0.00016348076,0.0014660257],"genre_scores_gemma":[0.88926965,0.0019096611,0.10226605,0.0034239367,0.0018313555,0.000023712195,0.00002834766,0.00008294064,0.0011643537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994768,0.0012850947,0.0013022922,0.0006535413,0.0009979461,0.0009931147],"domain_scores_gemma":[0.99505687,0.0010113305,0.0012263437,0.0011930184,0.0007451332,0.0007672909],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0033700743,0.0005901338,0.0007561171,0.00013544378,0.0012665853,0.0017883336,0.0033061982,0.00042882073,0.0002578614],"category_scores_gemma":[0.0006516744,0.0004665472,0.00061124616,0.00043432592,0.0007177048,0.0009059208,0.0013651783,0.0019047284,0.00007947762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026766147,0.0005089186,0.010795973,0.0006476304,0.0010992946,0.0009623051,0.022045072,0.0038213602,0.0035245733,0.76879495,0.022844596,0.16468765],"study_design_scores_gemma":[0.00038985146,0.0002544249,0.074551314,0.00035494863,0.00012843753,0.0024080127,0.0004179253,0.3601024,0.0014538682,0.5503436,0.009186693,0.0004085734],"about_ca_topic_score_codex":0.00018587055,"about_ca_topic_score_gemma":0.00004780817,"teacher_disagreement_score":0.356281,"about_ca_system_score_codex":0.0005859662,"about_ca_system_score_gemma":0.0031272047,"threshold_uncertainty_score":0.9997786},"labels":[],"label_agreement":null},{"id":"W3006271837","doi":"10.3390/math8020240","title":"Unicyclic Graphs Whose Completely Regular Endomorphisms form a Monoid","year":2020,"lang":"en","type":"article","venue":"Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Henan University; University of Waterloo; Henan University of Science and Technology; National Natural Science Foundation of China","keywords":"Endomorphism; Monoid; Combinatorics; Mathematics; Graph; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.03347713955722071,"score_gpt":0.22032938706903338,"score_spread":0.18685224751181267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006271837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062139284,0.00021371777,0.9290112,0.00312346,0.00014482532,0.0003248134,0.000009526082,0.00072852214,0.0043046405],"genre_scores_gemma":[0.6752812,0.000029322742,0.32121775,0.0031203916,0.00008067169,0.000028959743,0.0000068386453,0.000038931168,0.0001959244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868333,0.000035583376,0.0003472373,0.00030947555,0.0003109717,0.0003133692],"domain_scores_gemma":[0.99872416,0.00016973828,0.00015136399,0.0007321943,0.000038096736,0.00018445245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024219173,0.00019352214,0.0003077753,0.000060098933,0.00011464484,0.00016435898,0.0012558831,0.000057658537,0.00004221536],"category_scores_gemma":[0.00007355641,0.00016714928,0.0001297509,0.00043069024,0.00006507329,0.00029406612,0.0003888233,0.00013505496,0.0002852423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002470322,0.0001177639,0.000015102403,0.00010766917,0.000034079047,0.000051597282,0.00732779,0.000012840662,0.0043849726,0.9685695,0.0031406465,0.016235534],"study_design_scores_gemma":[0.00066605455,0.00015305424,0.000050286817,0.000064271015,0.000020965264,0.000069153764,0.00026566745,0.49178466,0.00894189,0.48763362,0.009948614,0.0004017571],"about_ca_topic_score_codex":0.0000032892904,"about_ca_topic_score_gemma":7.216092e-7,"teacher_disagreement_score":0.61314195,"about_ca_system_score_codex":0.000018301744,"about_ca_system_score_gemma":0.000024012625,"threshold_uncertainty_score":0.68161494},"labels":[],"label_agreement":null},{"id":"W3006400177","doi":"10.4153/s0008414x20000085","title":"Universal Alternating Semiregular Polytopes","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Connection (principal bundle); Regular polygon; Group (periodic table); Quotient; Geometry; Physics","score_opus":0.017790368026394235,"score_gpt":0.19585083179491197,"score_spread":0.17806046376851775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006400177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35890338,0.0006411965,0.6264667,0.010193024,0.0004417443,0.00007352743,0.0000058313935,0.000044997363,0.003229626],"genre_scores_gemma":[0.90260404,0.000005363947,0.09615707,0.000989232,0.00018061465,1.2619877e-7,1.8137943e-7,0.000010034811,0.000053351836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993048,0.000023535864,0.00025269532,0.000076926124,0.00015736936,0.00018468626],"domain_scores_gemma":[0.99893856,0.00006600843,0.00021190522,0.00015561003,0.0000786004,0.0005492977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024396057,0.00007915545,0.00016109279,0.00009244486,0.00007062436,0.00013403925,0.0009204297,0.00002912967,0.000041242514],"category_scores_gemma":[0.00014980717,0.000069714115,0.000071495044,0.00017272917,0.000032594875,0.00031725052,0.000035269095,0.00013007065,0.000022459402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002994358,0.000047994963,0.001035483,0.00019891083,0.00019389144,0.0031697396,0.037040412,0.000916032,0.0038102467,0.8994857,0.019368455,0.034730133],"study_design_scores_gemma":[0.002536876,0.00090496126,0.00091468834,0.0012501227,0.00014551899,0.004028832,0.011855035,0.7041915,0.02502094,0.15204671,0.09554428,0.0015605206],"about_ca_topic_score_codex":0.000119113894,"about_ca_topic_score_gemma":0.00013203706,"teacher_disagreement_score":0.747439,"about_ca_system_score_codex":0.00004760067,"about_ca_system_score_gemma":0.00042343148,"threshold_uncertainty_score":0.2842859},"labels":[],"label_agreement":null},{"id":"W3008205532","doi":"10.1007/978-3-030-40608-0_13","title":"Alternating Finite Automata with Limited Universal Branching","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computation; Bounded function; Tree (set theory); Automaton; Finite-state machine; Mathematics; Branching (polymer chemistry); Discrete mathematics; Algorithm; Computer science; Combinatorics; Theoretical computer science","score_opus":0.012989202170072269,"score_gpt":0.21414007564872947,"score_spread":0.2011508734786572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008205532","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033286773,0.0001524995,0.9916988,0.001358718,0.00085717486,0.00025832345,0.0000072110124,0.00062526716,0.004709149],"genre_scores_gemma":[0.45894495,0.000027074178,0.536478,0.0036997714,0.00059081666,0.000003875624,0.000010822775,0.00007021388,0.00017451488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607134,0.00004506174,0.0004305169,0.0017282492,0.0010703447,0.00065450644],"domain_scores_gemma":[0.99706644,0.00081551075,0.00036544795,0.0013762253,0.00013695793,0.00023943928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005694721,0.0005994698,0.0005555007,0.0006486093,0.00031345003,0.0008655023,0.004496647,0.0002104688,0.000016026685],"category_scores_gemma":[0.0000990067,0.00051072275,0.00011042089,0.0008201608,0.00050141936,0.0010400282,0.0018915052,0.0010113696,0.000054509397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020099995,0.000031167776,0.000080727594,0.00007323391,0.00003955868,0.0009758783,0.0019391637,0.087854125,0.00025409277,0.0921896,0.000021139826,0.8165212],"study_design_scores_gemma":[0.00044514806,0.00023736397,0.00006597832,0.0006784258,0.000009590542,0.00010324457,3.6500532e-7,0.94523406,0.0006126965,0.05108511,0.0008241295,0.00070387375],"about_ca_topic_score_codex":0.00002644313,"about_ca_topic_score_gemma":0.000025893156,"teacher_disagreement_score":0.85738,"about_ca_system_score_codex":0.0002126386,"about_ca_system_score_gemma":0.00046069248,"threshold_uncertainty_score":0.99973446},"labels":[],"label_agreement":null},{"id":"W3010514372","doi":"10.4171/jems/1244","title":"A height gap theorem for coefficients of Mahler functions","year":2022,"lang":"en","type":"article","venue":"Journal of the European Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Conjecture; Logarithm; Product (mathematics); Function (biology); Algebraic number; Power series; Field (mathematics); Series (stratigraphy); Generating function; Function field; Mathematical analysis; Pure mathematics; Geometry","score_opus":0.022626436104440584,"score_gpt":0.23731925096609657,"score_spread":0.21469281486165598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010514372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02406776,0.000101992046,0.96696484,0.002149357,0.0006070782,0.00018383232,0.000013765411,0.000027698869,0.0058837007],"genre_scores_gemma":[0.9459106,0.000005497581,0.05003433,0.00091891194,0.00022815289,0.000005414225,5.855331e-7,0.00003209413,0.0028644584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841905,0.00037132387,0.00046798377,0.00011036461,0.00046557188,0.00016570822],"domain_scores_gemma":[0.9986059,0.00036736383,0.00046965087,0.0003946669,0.000103932434,0.00005847749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030116627,0.00009142746,0.00020038588,0.000021612028,0.00031223331,0.00004511755,0.0014693724,0.000013329761,0.000112289796],"category_scores_gemma":[0.00013034361,0.000053536067,0.0006481515,0.00025808963,0.00006502721,0.00010205301,0.0006840476,0.00023925898,0.00000968822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006108775,0.002278018,0.00007654876,0.0002925861,0.00054242206,0.000015588472,0.014189345,0.0037519902,0.008131381,0.73030275,0.21590392,0.024454363],"study_design_scores_gemma":[0.0033372946,0.00097162277,0.0009345382,0.00029930653,0.00026303352,0.0009088232,0.0034941095,0.16209145,0.0019452643,0.7480826,0.07711099,0.0005610164],"about_ca_topic_score_codex":1.2922521e-7,"about_ca_topic_score_gemma":1.29142945e-8,"teacher_disagreement_score":0.9218428,"about_ca_system_score_codex":0.00007647687,"about_ca_system_score_gemma":0.000039161034,"threshold_uncertainty_score":0.2730484},"labels":[],"label_agreement":null},{"id":"W3010659905","doi":"10.1007/978-3-030-48516-0_7","title":"The State Complexity of Lexicographically Smallest Words and Computing Successors","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lexicographical order; Combinatorics; Mathematics; Alphabet; Word (group theory); State (computer science); Upper and lower bounds; Regular language; Successor cardinal; Discrete mathematics; Finite-state machine; Matching (statistics); Finite set; Algorithm; Automaton; Computer science; Geometry","score_opus":0.027792817311278778,"score_gpt":0.26906938661235347,"score_spread":0.2412765693010747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010659905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1923139,0.00062707526,0.80162144,0.003966794,0.0010108988,0.00030142255,0.00000661056,0.00013950262,0.000012339197],"genre_scores_gemma":[0.7458874,0.00007433897,0.25332063,0.0006039802,0.00009641375,0.0000041614603,0.0000017764862,0.000011144301,1.7951172e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959001,0.0002524502,0.0007415806,0.0015013801,0.0008725299,0.0007319354],"domain_scores_gemma":[0.9962633,0.0013701341,0.0005166723,0.0014383167,0.00019572896,0.00021579785],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002182566,0.0004465386,0.0006073443,0.0003396411,0.0004973991,0.0011228055,0.005878783,0.00016001312,0.0000012879854],"category_scores_gemma":[0.00025745924,0.0003288821,0.00013600953,0.0020270809,0.003320439,0.00023358512,0.009751638,0.0011755633,0.0000013779061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024021932,0.00007981293,0.005754062,0.0002086208,0.000039681916,0.00005224258,0.0076187407,0.09989209,0.0007968622,0.022134054,0.000006378051,0.8633934],"study_design_scores_gemma":[0.00014187461,0.00006511009,0.00953507,0.00018694627,0.0000033732147,0.000014505436,0.0000017133179,0.6590692,0.0013726212,0.32933208,0.000007654338,0.000269854],"about_ca_topic_score_codex":0.00022916366,"about_ca_topic_score_gemma":0.00019680079,"teacher_disagreement_score":0.8631236,"about_ca_system_score_codex":0.000062920895,"about_ca_system_score_gemma":0.00041145674,"threshold_uncertainty_score":0.9999163},"labels":[],"label_agreement":null},{"id":"W3012040074","doi":"10.4230/lipics.stacs.2020.16","title":"Existential Length Universality","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Universality (dynamical systems); Discrete mathematics; Bounded function; Upper and lower bounds; PSPACE; Exponential function; Binary number; Computational complexity theory; Algorithm; Arithmetic","score_opus":0.023378349384035317,"score_gpt":0.23238747961975506,"score_spread":0.20900913023571974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012040074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09820153,0.000048554837,0.87614346,0.0033163,0.0013679025,0.00097352866,0.00038735682,0.0010784303,0.018482966],"genre_scores_gemma":[0.9568504,0.000029612349,0.036144,0.0061832913,0.00032195845,0.000030701944,0.00019828125,0.000038632224,0.0002031002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766016,0.00005125679,0.00078312407,0.00035317708,0.00047683978,0.0006754466],"domain_scores_gemma":[0.9982437,0.00011033602,0.0003277309,0.0007886674,0.0001618689,0.00036773557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041789602,0.0003471376,0.0004042411,0.00012323681,0.00030346622,0.00048147867,0.0019255523,0.0001676198,0.00006628919],"category_scores_gemma":[0.000084057356,0.00032005773,0.0003020683,0.00043062976,0.0001149981,0.0022873175,0.00077279436,0.0003465574,0.000339594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004154183,0.0007849721,0.0031452796,0.0016346897,0.0006636186,0.00007577738,0.06325292,0.00039332442,0.00064780435,0.75064826,0.061793126,0.11654483],"study_design_scores_gemma":[0.005376058,0.0005881648,0.00081148394,0.00010474567,0.000062021936,0.000067574256,0.0027561954,0.47774062,0.0028980807,0.004060381,0.5043105,0.0012241902],"about_ca_topic_score_codex":0.000014346693,"about_ca_topic_score_gemma":0.000002937032,"teacher_disagreement_score":0.8586489,"about_ca_system_score_codex":0.000078259305,"about_ca_system_score_gemma":0.00008632071,"threshold_uncertainty_score":0.99992514},"labels":[],"label_agreement":null},{"id":"W3017213921","doi":"10.1007/978-3-030-63591-6_7","title":"Exploring Tetris as a Transformation Semigroup","year":2021,"lang":"en","type":"preprint","venue":"Springer proceedings in mathematics & statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Iterated function; Simple (philosophy); Semigroup; Group (periodic table); Mathematics; Transformation (genetics); Abelian group; Mathematical economics; Computer science; Pure mathematics","score_opus":0.05983721058332027,"score_gpt":0.27009752060475956,"score_spread":0.2102603100214393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017213921","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17065516,0.00033090287,0.8202705,0.00019954192,0.0009796759,0.0007375487,0.000044680284,0.00051276386,0.006269258],"genre_scores_gemma":[0.22613454,0.0012380433,0.7717411,0.00010811862,0.0001399503,0.00037198828,0.000038228623,0.000090208945,0.00013784677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961333,0.000026331372,0.0012554395,0.0009283775,0.00095266226,0.00070385425],"domain_scores_gemma":[0.9978187,0.0003142184,0.0006030914,0.00069874566,0.00038933655,0.00017589694],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001244551,0.0006257345,0.0008340549,0.00056110154,0.00013282472,0.0013773014,0.0017692543,0.00029647342,0.000033439017],"category_scores_gemma":[0.00063147635,0.00067307247,0.00015465698,0.00058521435,0.000072454946,0.0012831595,0.0015297544,0.0012486082,0.00005987716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005685371,0.00041337378,0.000106094536,0.0056173615,0.00009354235,0.0001567113,0.07274468,0.00019068128,0.00086084765,0.88975203,0.00021669181,0.029842319],"study_design_scores_gemma":[0.0007365883,0.000101621335,0.0006291034,0.004189131,0.000105956686,0.000117714226,0.007891233,0.30473897,0.008965974,0.6694995,0.0011876045,0.0018366013],"about_ca_topic_score_codex":0.000067301495,"about_ca_topic_score_gemma":0.000013140058,"teacher_disagreement_score":0.30454826,"about_ca_system_score_codex":0.00031403743,"about_ca_system_score_gemma":0.00023698421,"threshold_uncertainty_score":0.99965936},"labels":[],"label_agreement":null},{"id":"W3025609620","doi":"10.1016/j.disc.2020.111958","title":"Sum-free sets generated by the period-<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e22\" altimg=\"si8.svg\"><mml:mi>k</mml:mi></mml:math>-folding sequences and some Sturmian sequences","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"China Scholarship Council; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Sequence (biology); Generalization; Period (music); Folding (DSP implementation); Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.022021716403563683,"score_gpt":0.24535637632110602,"score_spread":0.22333465991754234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025609620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9872509,0.0010962598,0.0074572572,0.002820526,0.00032733878,0.00011326727,0.00015289172,0.00030871268,0.00047282636],"genre_scores_gemma":[0.9826036,0.0002550067,0.014960332,0.001574917,0.00028865624,0.00010303547,0.00009067802,0.000081831386,0.000041942785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704623,0.0001221484,0.0006577725,0.00071178173,0.0008004738,0.0006615713],"domain_scores_gemma":[0.9976452,0.00041235247,0.0005087213,0.0010959563,0.00005154927,0.00028620704],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008022729,0.00042494547,0.00031732087,0.000060528437,0.00073461095,0.0011526654,0.0019342359,0.00025712463,0.00001886361],"category_scores_gemma":[0.00033983053,0.00035590935,0.00021813734,0.00039475656,0.00048934866,0.0009428823,0.0011159169,0.00040746023,0.00017135993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011894128,0.000039495364,0.000008459028,0.0002711968,0.00012140783,0.000115398936,0.0065756296,0.0001753903,0.00413291,0.9868416,0.00075549213,0.0009510937],"study_design_scores_gemma":[0.00030924598,0.00020517362,0.000013494661,0.00025280842,0.0000982321,0.00022527738,0.00253003,0.9774693,0.0074632973,0.010383546,0.000616232,0.00043331544],"about_ca_topic_score_codex":0.0000902932,"about_ca_topic_score_gemma":0.000032246477,"teacher_disagreement_score":0.97729397,"about_ca_system_score_codex":0.000015489011,"about_ca_system_score_gemma":0.000179305,"threshold_uncertainty_score":0.9998893},"labels":[],"label_agreement":null},{"id":"W3026005886","doi":"10.1016/j.tcs.2019.06.024","title":"State grammars with stores","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Embedded pushdown automaton; Rule-based machine translation; Tree-adjoining grammar; L-attributed grammar; Bounded function; State (computer science); Phrase structure grammar; Indexed grammar; Context-sensitive grammar; Terminal and nonterminal symbols; Context-free grammar; Mathematics; Definite clause grammar; Production (economics); Computer science; Algorithm; Artificial intelligence","score_opus":0.0037112011740026846,"score_gpt":0.20199407623767815,"score_spread":0.19828287506367548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026005886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25530583,0.0000145127415,0.74105436,0.00039433557,0.00039281874,0.0001442875,7.673069e-7,0.00028687814,0.0024062349],"genre_scores_gemma":[0.82971996,0.0000017225407,0.16952638,0.000658862,0.00003616244,0.0000034374514,3.281884e-7,0.00000840494,0.000044713994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974991,0.00007517168,0.00018360063,0.000783558,0.00080023636,0.00065831747],"domain_scores_gemma":[0.9981908,0.00020122198,0.00006194557,0.0011618084,0.0001263124,0.00025788383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011195671,0.00019260948,0.0002037477,0.00016159912,0.00021228423,0.0005640226,0.0029447537,0.000028072262,0.000077833814],"category_scores_gemma":[0.000015356329,0.00012940947,0.00004411298,0.0010663909,0.0018475002,0.0009571849,0.0009273306,0.0001753832,0.000437899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010100434,0.00003044818,0.00034084154,0.0000051318552,0.0000035499293,0.000015936519,0.0002967082,0.0002456776,0.00070566277,0.96669513,0.000027291684,0.031623535],"study_design_scores_gemma":[0.00045303116,0.0006457948,0.0029269857,0.0000500241,0.0000030809338,0.000096497315,0.000011309377,0.5424533,0.007182347,0.44534674,0.00038984593,0.00044104495],"about_ca_topic_score_codex":0.000004234404,"about_ca_topic_score_gemma":4.930027e-7,"teacher_disagreement_score":0.57441413,"about_ca_system_score_codex":0.000045631023,"about_ca_system_score_gemma":0.00013320058,"threshold_uncertainty_score":0.68071914},"labels":[],"label_agreement":null},{"id":"W3026976675","doi":"10.1016/j.tcs.2020.10.029","title":"Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Characterization (materials science); Binary number; Mathematics; Least-squares function approximation; Combinatorics; Arithmetic; Statistics; Materials science; Nanotechnology","score_opus":0.012494494510200358,"score_gpt":0.23389598394775504,"score_spread":0.2214014894375547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026976675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5470175,0.000046925543,0.4508206,0.00076469773,0.00075210835,0.00025643344,0.000015713813,0.00007988479,0.00024612757],"genre_scores_gemma":[0.9873385,0.000011411257,0.012010136,0.0004718461,0.0001383168,0.000007898013,0.000002621005,0.000016404898,0.0000029095493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970824,0.00030254747,0.0005283497,0.0009094272,0.00080288283,0.00037435722],"domain_scores_gemma":[0.9975585,0.00027023625,0.00043246397,0.0013429923,0.00023946204,0.00015639106],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001405704,0.0002999398,0.00050929864,0.00015289494,0.00019219202,0.00025092377,0.0037758772,0.00014209,0.000024397386],"category_scores_gemma":[0.00014304297,0.00021317633,0.00015012565,0.00071267475,0.0033896328,0.0003229551,0.0061145164,0.0003741449,0.00000466877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014975513,0.000052557883,0.0005843972,0.00015876924,0.000014775067,0.000004310433,0.0020223043,0.00007187545,0.071098156,0.9223281,0.0000041864155,0.0036455512],"study_design_scores_gemma":[0.00029617813,0.0002980794,0.01859941,0.0008057198,0.000024809691,0.000017858802,0.000027544174,0.8195203,0.035465643,0.12438075,0.000108291395,0.00045540358],"about_ca_topic_score_codex":0.000018476034,"about_ca_topic_score_gemma":3.1406174e-7,"teacher_disagreement_score":0.8194484,"about_ca_system_score_codex":0.000031317093,"about_ca_system_score_gemma":0.00023767352,"threshold_uncertainty_score":0.9993226},"labels":[],"label_agreement":null},{"id":"W3028589106","doi":"10.1142/s0129054121410094","title":"An Inequality for the Number of Periods in a Word","year":2021,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Word (group theory); Mathematics; Prefix; Square-free integer; Inequality; Exponent; Representation (politics); Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis; Linguistics; Geometry; Law","score_opus":0.03514299275799944,"score_gpt":0.3783249735212547,"score_spread":0.3431819807632553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028589106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32513884,0.00006319877,0.67104304,0.0010197498,0.0026030894,0.000090577014,0.000008714251,0.0000057953475,0.000027033366],"genre_scores_gemma":[0.7392375,0.000029421652,0.26043156,0.000100019926,0.00018680994,0.000005214385,0.0000032752816,0.0000036731856,0.0000025498985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973011,0.000115041505,0.0010299468,0.00030987943,0.00108609,0.00015794781],"domain_scores_gemma":[0.994482,0.0005833374,0.001278582,0.0007212578,0.0028721665,0.00006269153],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.003084899,0.00013678405,0.00033038433,0.00043151004,0.00007885067,0.0006262268,0.006578164,0.00005926189,0.000018932642],"category_scores_gemma":[0.0002471863,0.00010547543,0.00022478883,0.00052908587,0.00043924953,0.0013741935,0.0012546391,0.00028771424,5.0441764e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009835682,0.0016002733,0.015022568,0.00013327895,0.00038028334,0.00003822381,0.012661786,0.09127832,0.004371302,0.25361133,0.00013010782,0.6206742],"study_design_scores_gemma":[0.0007470794,0.000122020625,0.09066268,0.0006916401,0.000022819891,0.00020017872,0.00023960738,0.84973246,0.0031906064,0.053865306,0.0002703952,0.00025517997],"about_ca_topic_score_codex":0.00007688514,"about_ca_topic_score_gemma":0.00001762508,"teacher_disagreement_score":0.75845414,"about_ca_system_score_codex":0.00012732213,"about_ca_system_score_gemma":0.0014980286,"threshold_uncertainty_score":0.9987967},"labels":[],"label_agreement":null},{"id":"W3035317803","doi":"10.1016/j.tcs.2021.03.010","title":"The undirected repetition threshold and undirected pattern avoidance","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Conjecture; Infimum and supremum; Mathematics; Word (group theory); Repetition (rhetorical device); Binary number; Discrete mathematics; Arithmetic; Geometry; Philosophy","score_opus":0.008529589075174234,"score_gpt":0.23205111697758085,"score_spread":0.22352152790240662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035317803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13054152,0.0009122976,0.8607365,0.0028615452,0.0024828687,0.000326818,0.0000059800923,0.0006689974,0.0014634648],"genre_scores_gemma":[0.97123086,0.0002633526,0.027312567,0.00084512774,0.00025924738,0.000033353797,0.000008672402,0.000022113141,0.000024678506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953047,0.00038731276,0.00052440196,0.001836633,0.0010729694,0.000873986],"domain_scores_gemma":[0.99566835,0.0008270245,0.00024279545,0.0025271962,0.00040514168,0.00032946785],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0027910755,0.00045504264,0.00044481896,0.00016572318,0.0012692529,0.0039759194,0.004507182,0.00020750804,0.000023057331],"category_scores_gemma":[0.00020575833,0.00032550117,0.00013399542,0.0010452918,0.0043691425,0.00053027435,0.008626279,0.000965793,0.000019504592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005355882,0.00005017243,0.000080192105,0.000038535116,0.000019492029,0.000056291392,0.0005843302,0.00009546268,0.00052552804,0.8823906,0.00007736232,0.11607668],"study_design_scores_gemma":[0.00017364949,0.00007039734,0.004322759,0.00035568106,0.000015127407,0.000104580555,0.000020128675,0.71287566,0.0031168791,0.27828345,0.00012640812,0.00053527806],"about_ca_topic_score_codex":0.000018618053,"about_ca_topic_score_gemma":0.000009866201,"teacher_disagreement_score":0.84068936,"about_ca_system_score_codex":0.00012509774,"about_ca_system_score_gemma":0.00036614627,"threshold_uncertainty_score":0.9999197},"labels":[],"label_agreement":null},{"id":"W3036081150","doi":"10.1142/s0219498821502005","title":"The reduced ring order and lower semi-lattices II","year":2020,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Ottawa","funders":"","keywords":"Mathematics; Bijection, injection and surjection; Commutative ring; Order (exchange); Ring (chemistry); Noncommutative ring; Power series; Von Neumann regular ring; Pure mathematics; Lattice (music); Category of rings; Polynomial ring; Commutative property; Series (stratigraphy); Combinatorics; Primitive ring; Principal ideal ring; Mathematical analysis; Chemistry","score_opus":0.013251322748289102,"score_gpt":0.23975800265973038,"score_spread":0.22650667991144127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036081150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8398844,0.009030787,0.096839674,0.0527598,0.00013609973,0.00021218909,0.000001848006,0.000050520877,0.0010847056],"genre_scores_gemma":[0.99548286,0.00076724915,0.0027330124,0.00077758316,0.00016974678,0.0000053435683,1.2010972e-7,0.000004263622,0.000059842037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994872,0.00001716645,0.00019042628,0.000106166815,0.00010742139,0.00009156912],"domain_scores_gemma":[0.999395,0.00013644608,0.00015414698,0.0001151281,0.00009120821,0.00010807811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019003233,0.00005853396,0.000086408785,0.000020648895,0.00036205366,0.00015714209,0.00033087298,0.000021635806,0.000004666607],"category_scores_gemma":[0.00004061576,0.00003682552,0.000022954002,0.00019205835,0.000032403237,0.0003098484,0.00015090736,0.0001143186,0.0000033894623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018076047,0.00007800504,0.000066779256,0.000029418987,0.00008852366,0.0000059456916,0.0030668718,0.000028024067,0.032415476,0.79979736,0.0028521428,0.16155337],"study_design_scores_gemma":[0.0021009233,0.0011051468,0.008910919,0.0001675046,0.00017247899,0.00078146363,0.0016056038,0.17352009,0.018030595,0.14698924,0.64576226,0.0008538009],"about_ca_topic_score_codex":3.5684187e-7,"about_ca_topic_score_gemma":2.2517641e-7,"teacher_disagreement_score":0.6528081,"about_ca_system_score_codex":0.00000388072,"about_ca_system_score_gemma":0.000028166822,"threshold_uncertainty_score":0.27846605},"labels":[],"label_agreement":null},{"id":"W3036249117","doi":"10.3390/math8061009","title":"Endomorphism Spectra of Double Fan Graphs","year":2020,"lang":"en","type":"article","venue":"Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Henan University; University of Waterloo; Henan University of Science and Technology; National Natural Science Foundation of China","keywords":"Endomorphism; Mathematics; Graph; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.030190528489661576,"score_gpt":0.22810860822804854,"score_spread":0.19791807973838696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036249117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11242781,0.00014497034,0.8734779,0.0018324221,0.00013962323,0.00019737481,0.0000042758716,0.00032173225,0.011453916],"genre_scores_gemma":[0.8329421,0.000008526334,0.1666072,0.00033973577,0.000030036534,0.00000407388,8.60931e-7,0.0000097664315,0.000057677906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928445,0.0000109399325,0.00022519729,0.00014854196,0.00019176558,0.000139111],"domain_scores_gemma":[0.99935365,0.00007517659,0.00010828418,0.00036632543,0.000023622382,0.00007293268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001339953,0.00008875243,0.00018867751,0.000033451997,0.000028096047,0.00003899862,0.0006655838,0.00002801807,0.000051539402],"category_scores_gemma":[0.000021392492,0.000074708834,0.00007220016,0.00026028467,0.00003674784,0.000121814686,0.00014677546,0.00006387695,0.00008347239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001946867,0.000055484335,0.000021218948,0.000083167346,0.000011759054,0.000008575744,0.0029689092,0.000005869469,0.008122434,0.98715657,0.0006130606,0.000950999],"study_design_scores_gemma":[0.0014518612,0.0002064857,0.0001073152,0.000082546496,0.000024923018,0.00004551551,0.00035876306,0.11079482,0.22420703,0.6597944,0.0025458978,0.00038045322],"about_ca_topic_score_codex":0.0000045419433,"about_ca_topic_score_gemma":3.0595314e-7,"teacher_disagreement_score":0.7205143,"about_ca_system_score_codex":0.000006799733,"about_ca_system_score_gemma":0.000015124138,"threshold_uncertainty_score":0.3046538},"labels":[],"label_agreement":null},{"id":"W3036393604","doi":"10.37236/9703","title":"Extremal Overlap-Free and Extremal $\\beta$-Free Binary Words","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Word (group theory); BETA (programming language); Binary number; Combinatorics; Exponent; Mathematics; Sigma; Alphabet; Physics; Arithmetic; Geometry; Computer science; Quantum mechanics; Philosophy; Linguistics","score_opus":0.013599943502214476,"score_gpt":0.2272958911095833,"score_spread":0.21369594760736882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036393604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4144422,0.11589835,0.41269383,0.04468706,0.007988944,0.0009115973,0.00002660491,0.0004529725,0.0028984111],"genre_scores_gemma":[0.9946071,0.0034906357,0.0006611234,0.00041766895,0.000551427,0.000007025046,0.00000216251,0.000055776338,0.00020711067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958065,0.00047047337,0.0009500561,0.0005714802,0.001188438,0.001013047],"domain_scores_gemma":[0.995195,0.0005380585,0.0013034842,0.002419117,0.0002618265,0.00028254942],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002373688,0.0005746134,0.0009220746,0.00025721284,0.0002516809,0.00046354462,0.008755612,0.0003212414,0.000013838997],"category_scores_gemma":[0.00031691298,0.00042057823,0.00043413707,0.00059552287,0.00018428202,0.00049580255,0.006654124,0.0036815586,0.0000072198427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087984685,0.00016093883,0.00014109562,0.000090882706,0.0002832823,0.00018465237,0.00083644467,0.00008912724,0.00027660513,0.9891698,0.005512188,0.0031670013],"study_design_scores_gemma":[0.0015114665,0.0007930696,0.0006927688,0.00019169576,0.00015048032,0.00072984316,0.00011426868,0.007733838,0.00031510156,0.98435247,0.002949798,0.00046521847],"about_ca_topic_score_codex":0.000010649194,"about_ca_topic_score_gemma":0.0000033610718,"teacher_disagreement_score":0.58016485,"about_ca_system_score_codex":0.00044375128,"about_ca_system_score_gemma":0.0014420731,"threshold_uncertainty_score":0.9998246},"labels":[],"label_agreement":null},{"id":"W3037745114","doi":"10.5802/jtnb.1236","title":"Badly approximable numbers, Kronecker’s theorem, and diversity of Sturmian characteristic sequences","year":2023,"lang":"en","type":"article","venue":"Journal de Théorie des Nombres de Bordeaux","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Kronecker delta; Irrational number; Sequence (biology); Dimension (graph theory); Combinatorics; Diophantine approximation; Discrete mathematics; Measure (data warehouse); Pure mathematics; Geometry","score_opus":0.014775413606572798,"score_gpt":0.24650043151737894,"score_spread":0.23172501791080613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037745114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9676331,0.00037768536,0.028951732,0.0006382242,0.00027306026,0.000092401984,0.000017876195,0.00012412899,0.0018917589],"genre_scores_gemma":[0.98850095,0.00071792025,0.0101676965,0.00017264545,0.00011719563,0.000002673155,0.0000029130128,0.000012737033,0.00030528108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984255,0.0001871072,0.00029620682,0.00025602593,0.00031244467,0.0005227566],"domain_scores_gemma":[0.9988675,0.00023077626,0.0002434238,0.00030421594,0.0001086059,0.00024543886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014884439,0.00017768724,0.00027870273,0.00017528012,0.00054753275,0.00028415085,0.00093498366,0.0000860561,0.000024787709],"category_scores_gemma":[0.00014373263,0.00015266106,0.00009624943,0.00047843286,0.00026470778,0.0007017497,0.00071889476,0.00029348463,0.000022170445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035780203,0.0004163206,0.23505187,0.0005935763,0.0005929877,0.0026429084,0.028055867,0.0004938787,0.031948097,0.53315574,0.008169667,0.15852131],"study_design_scores_gemma":[0.0009647485,0.00030586374,0.23120606,0.00023698929,0.00006874681,0.0015817769,0.0014343044,0.029476417,0.0023760137,0.72968,0.0021496592,0.0005194188],"about_ca_topic_score_codex":0.00011073501,"about_ca_topic_score_gemma":0.00001185966,"teacher_disagreement_score":0.19652429,"about_ca_system_score_codex":0.00012023041,"about_ca_system_score_gemma":0.00020897569,"threshold_uncertainty_score":0.62253374},"labels":[],"label_agreement":null},{"id":"W3037965222","doi":"10.1016/j.aam.2016.11.005","title":"Profinite automata","year":2016,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Modulo; Uncountable set; Discrete mathematics; Sequence (biology); Algebraic number; Alphabet; Prime number; Profinite group; Primitive root modulo n; Combinatorics; Prime (order theory); Group (periodic table)","score_opus":0.00865574799174698,"score_gpt":0.24458560634197135,"score_spread":0.23592985835022437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037965222","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032545386,0.0002435714,0.94286597,0.00034035195,0.00017358072,0.00023096237,0.0000023795508,0.00044412934,0.0524445],"genre_scores_gemma":[0.43805432,0.00021581711,0.5612072,0.00017806784,0.000035281144,0.00008963606,5.262579e-7,0.00001688265,0.00020228393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890596,0.000009639371,0.00029344327,0.00028868718,0.00021528642,0.00028697748],"domain_scores_gemma":[0.9986211,0.00046465025,0.0001171211,0.0007374924,0.000011767866,0.000047890604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032564715,0.00014196894,0.00019097008,0.000091485104,0.000037142192,0.000039733917,0.00090043497,0.000045246652,0.000016535805],"category_scores_gemma":[0.000056726563,0.00008964767,0.000028423325,0.00028117048,0.000064202504,0.0004639866,0.0002494839,0.000059377555,0.00028778848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012706498,0.000062249484,0.000035956487,0.000043446627,0.0000014921918,0.000004245702,0.00020403373,0.0000041169596,0.0014939344,0.8236489,0.000048535392,0.17445181],"study_design_scores_gemma":[0.00056994916,0.00002012583,0.00008466201,0.00013475277,0.0000019871225,0.000011906125,0.000054963464,0.005473969,0.0069541475,0.97503424,0.011420758,0.00023852324],"about_ca_topic_score_codex":2.0521387e-7,"about_ca_topic_score_gemma":0.0000014573967,"teacher_disagreement_score":0.4347998,"about_ca_system_score_codex":0.000034523404,"about_ca_system_score_gemma":0.00001978377,"threshold_uncertainty_score":0.36990348},"labels":[],"label_agreement":null},{"id":"W3040025217","doi":"10.1016/j.tcs.2021.02.023","title":"Squarefree words with interior disposable factors","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Square-free integer; Word (group theory); Mathematics; Combinatorics; Ternary operation; Position (finance); Symbol (formal); Property (philosophy); Arithmetic; Computer science; Geometry; Philosophy; Business","score_opus":0.009752978889501072,"score_gpt":0.23538600739585205,"score_spread":0.22563302850635097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040025217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2867472,0.00008979507,0.7090728,0.00044325236,0.0015553724,0.00022526228,0.0000063566363,0.00046948827,0.001390434],"genre_scores_gemma":[0.8243224,0.000008816577,0.17501159,0.00041371436,0.00016678829,0.000018982437,0.000009946771,0.00002665314,0.000021094767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458206,0.00022162753,0.00049875,0.0021929615,0.0014107911,0.0010938116],"domain_scores_gemma":[0.9953134,0.0003401613,0.00021991432,0.0032432694,0.00034693404,0.00053630635],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001367174,0.0006437748,0.000710093,0.0003244456,0.00046571493,0.0034008273,0.008209666,0.00021402127,0.00014187484],"category_scores_gemma":[0.00008558446,0.00045516,0.00020699135,0.0013881742,0.0039644395,0.000989266,0.012352548,0.0009919025,0.000035073008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012697076,0.00010259442,0.00023526572,0.00006822743,0.000027726603,0.00016438533,0.0023402506,0.00039852934,0.00028429818,0.97552216,0.000044551165,0.020799285],"study_design_scores_gemma":[0.00046279133,0.00057644973,0.0030754318,0.0013438454,0.000041063682,0.00020048284,0.00018251309,0.7968337,0.011851989,0.18355161,0.00011985376,0.0017602834],"about_ca_topic_score_codex":0.000022431308,"about_ca_topic_score_gemma":0.0000065162094,"teacher_disagreement_score":0.7964352,"about_ca_system_score_codex":0.00018712951,"about_ca_system_score_gemma":0.00074367074,"threshold_uncertainty_score":0.99979},"labels":[],"label_agreement":null},{"id":"W3042874346","doi":"10.1051/ita/2021001","title":"The simplest binary word with only three squares","year":2021,"lang":"en","type":"preprint","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Word (group theory); Binary number; Property (philosophy); Computer science; Mathematics; Binary operation; Software; Discrete mathematics; Algebra over a field; Theoretical computer science; Arithmetic; Algorithm; Pure mathematics; Programming language; Epistemology; Philosophy","score_opus":0.008547743220322503,"score_gpt":0.23700780590173773,"score_spread":0.22846006268141522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042874346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02276922,0.00059490284,0.9675848,0.0024359992,0.00007595778,0.0007530902,0.000036874477,0.00023105941,0.005518126],"genre_scores_gemma":[0.9089769,0.00064668927,0.08836016,0.0009412546,0.00016132466,0.0006991372,0.00012261789,0.0000322126,0.000059666232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983901,0.000048382786,0.0005473191,0.00030310964,0.0003391445,0.00037198572],"domain_scores_gemma":[0.9971053,0.00074408646,0.0002455306,0.0016005911,0.00013610923,0.00016836642],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047813336,0.00030643816,0.00029855044,0.00005898055,0.0006303172,0.0014202246,0.0014399578,0.00018014498,0.00001682395],"category_scores_gemma":[0.000029286837,0.00018666765,0.000097921176,0.0002856792,0.0009826605,0.00021390304,0.0020133737,0.0005802461,0.000020471842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041119547,0.000041682793,0.000024120232,0.000075762,0.00003577698,0.0000016480394,0.0005312338,0.00018208507,0.0000031422894,0.9189919,0.00014530229,0.079963215],"study_design_scores_gemma":[0.00021102496,0.00006156758,0.0007199717,0.00015991983,0.000048669997,0.00006651458,0.0007878343,0.32258785,0.00004232806,0.66215664,0.012699413,0.00045828286],"about_ca_topic_score_codex":0.000007629549,"about_ca_topic_score_gemma":0.00001784775,"teacher_disagreement_score":0.8862077,"about_ca_system_score_codex":0.00002764282,"about_ca_system_score_gemma":0.00023436542,"threshold_uncertainty_score":0.9996164},"labels":[],"label_agreement":null},{"id":"W3044924055","doi":"10.1017/nmj.2021.5","title":"MAHLER’S AND KOKSMA’S CLASSIFICATIONS IN FIELDS OF POWER SERIES","year":2021,"lang":"en","type":"preprint","venue":"Nagoya Mathematical Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Series (stratigraphy); Prime (order theory); Finite field; Field (mathematics); Mathematics; Power (physics); Power series; Prime power; Combinatorics; Discrete mathematics; Pure mathematics; Physics; Mathematical analysis; Geology; Quantum mechanics","score_opus":0.024934000237615002,"score_gpt":0.2691077440815369,"score_spread":0.24417374384392193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044924055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26301846,0.0013932869,0.7185692,0.010190766,0.0006800068,0.0002236182,0.0000075084868,0.0000705346,0.0058465777],"genre_scores_gemma":[0.8971113,0.00023334142,0.10215344,0.00012816013,0.00005477771,0.00001108716,0.0000017093774,0.00001263496,0.00029352825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983417,0.00013271997,0.00066749885,0.0002948985,0.0003403104,0.0002228986],"domain_scores_gemma":[0.9986209,0.00024106856,0.00028856017,0.00060305255,0.00012290949,0.00012347466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071928365,0.0001771335,0.00046185323,0.00017767755,0.00005613268,0.00039311085,0.0007988278,0.00026100266,0.00017341485],"category_scores_gemma":[0.00024401883,0.00015368285,0.00013354549,0.00015422761,0.00007350631,0.00028780734,0.00092988304,0.00092866295,0.0000063619004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022078331,0.0009860866,0.0004684597,0.0014006599,0.00021237224,0.00051387295,0.016581917,0.00023277143,0.0014079057,0.94055885,0.0019037898,0.035711236],"study_design_scores_gemma":[0.0003304124,0.00006767542,0.0036761404,0.0014201087,0.000025210415,0.0012402628,0.0008642351,0.012233317,0.00092162733,0.97871524,0.00016464305,0.00034111785],"about_ca_topic_score_codex":0.000003723555,"about_ca_topic_score_gemma":0.0000063298053,"teacher_disagreement_score":0.63409287,"about_ca_system_score_codex":0.00005984786,"about_ca_system_score_gemma":0.00019590667,"threshold_uncertainty_score":0.62670046},"labels":[],"label_agreement":null},{"id":"W3080853710","doi":"10.37236/9819","title":"Synchronizing Times for $k$-sets in Automata","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Word (group theory); Synchronizing; Mathematics; Combinatorics; Automaton; State (computer science); Conjecture; Upper and lower bounds; Discrete mathematics; Word length; Algorithm; Computer science; Topology (electrical circuits); Geometry; Theoretical computer science","score_opus":0.007389085431190077,"score_gpt":0.23200268580022293,"score_spread":0.22461360036903286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080853710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4221678,0.02048668,0.5395549,0.012372776,0.0032852138,0.00070825627,0.0000051585166,0.00017221524,0.001246985],"genre_scores_gemma":[0.9993122,0.00011551004,0.00019336666,0.00019840036,0.000037098427,0.000014305239,5.5383845e-7,0.000012175187,0.000116352654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984036,0.00019934871,0.00036166506,0.00012546589,0.00039769834,0.0005122269],"domain_scores_gemma":[0.9988056,0.0004091852,0.0003249088,0.00035711494,0.0000656796,0.00003754375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029499026,0.000105808314,0.00020878656,0.00015877395,0.0002663389,0.00006548244,0.0019743342,0.00002218464,0.000012440927],"category_scores_gemma":[0.00006601265,0.00008012959,0.00011140274,0.00056453753,0.000022880826,0.00027652076,0.00032509552,0.0005908768,0.0000017899687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019608004,0.00011567612,0.000028861303,0.0000058681167,0.000024763709,0.000011795841,0.000402042,0.0005730422,0.000111574314,0.9923465,0.0013468539,0.005013418],"study_design_scores_gemma":[0.0010966458,0.0007260963,0.00010332187,0.000011810302,0.000011359545,0.00037801405,0.00016421489,0.051867966,0.00037267967,0.9342052,0.010947995,0.000114712144],"about_ca_topic_score_codex":0.0000038183193,"about_ca_topic_score_gemma":0.0000011573512,"teacher_disagreement_score":0.57714444,"about_ca_system_score_codex":0.0005713496,"about_ca_system_score_gemma":0.0005529994,"threshold_uncertainty_score":0.3668837},"labels":[],"label_agreement":null},{"id":"W3081350802","doi":"10.48550/arxiv.2008.11164","title":"Concatenation Operations and Restricted Variants of Two-Dimensional Automata","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Diagonal; Closure (psychology); Nondeterministic algorithm; Nondeterministic finite automaton; Automaton; Discrete mathematics; Computer science; Mathematics; Combinatorics; Algorithm; Automata theory; Theoretical computer science","score_opus":0.06388443640970944,"score_gpt":0.19876819439626528,"score_spread":0.13488375798655583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081350802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7115268,0.000042866595,0.28670222,0.00041665827,0.00028918142,0.00021892574,0.000049086604,0.0002531724,0.0005010744],"genre_scores_gemma":[0.9941073,0.000033460845,0.00552965,0.00011960035,0.00002889115,5.221333e-7,0.00004431357,0.000008494884,0.000127741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987703,0.00013303975,0.00019212415,0.0006698275,0.000089491434,0.00014520461],"domain_scores_gemma":[0.998918,0.00010102773,0.00012296453,0.00059593125,0.00014812105,0.0001139352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012943322,0.00017296131,0.00024194732,0.00016502586,0.00010539056,0.000077313,0.00080122467,0.00012934729,0.000016302625],"category_scores_gemma":[0.000052615036,0.0001900516,0.00006329784,0.0004388095,0.00009264449,0.00034751277,0.0016190738,0.00024072341,0.000015952559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014828337,0.00007767669,0.00026080702,0.000047176218,0.000080111284,0.00015274824,0.00021695133,0.21939941,0.0025265475,0.77655375,0.00020072493,0.00046924513],"study_design_scores_gemma":[0.00056651165,0.000036061385,0.0067995396,0.000052201878,0.000036677357,0.0000069609373,0.000013716409,0.94500136,0.0002808851,0.047005285,0.000013405285,0.0001873902],"about_ca_topic_score_codex":0.00021156864,"about_ca_topic_score_gemma":0.00001647384,"teacher_disagreement_score":0.7295485,"about_ca_system_score_codex":0.0000475256,"about_ca_system_score_gemma":0.00021207838,"threshold_uncertainty_score":0.77500796},"labels":[],"label_agreement":null},{"id":"W3087847018","doi":"10.1016/j.disc.2020.112167","title":"Graded alphabets, circular codes, free Lie algebras and comma-free codes","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Generalization; Mathematical proof; Embedding; Characterization (materials science); Degree (music); Discrete mathematics; Combinatorics; Code (set theory); Pure mathematics; Mathematical analysis; Geometry","score_opus":0.021235000057293535,"score_gpt":0.2294300444318054,"score_spread":0.20819504437451186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087847018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28953603,0.0032709597,0.68695915,0.015180185,0.00028367882,0.00074495294,0.00017156333,0.0013531898,0.0025002926],"genre_scores_gemma":[0.8427406,0.0001651081,0.15245779,0.004257014,0.00018711836,0.000029769528,0.000029985553,0.00006497047,0.00006762833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982635,0.00007772536,0.00040261334,0.00045190394,0.00042777488,0.00037650988],"domain_scores_gemma":[0.99771726,0.00028566003,0.00017209709,0.0015147496,0.000039144987,0.0002710791],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034463423,0.000289559,0.00045060922,0.00005151686,0.00017545228,0.00034887745,0.0022434657,0.00009564029,0.00002608893],"category_scores_gemma":[0.0003396124,0.00024836254,0.0001077105,0.00025668397,0.00016184917,0.0004556866,0.0013788044,0.00020229089,0.000049281105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028493325,0.000060036487,0.00007970003,0.0003262084,0.000071970135,0.000045049623,0.0044215373,0.0000052652617,0.002145879,0.9831713,0.008229549,0.0014406792],"study_design_scores_gemma":[0.000999895,0.00012101766,0.00021304897,0.00013331785,0.00005904635,0.000049825176,0.00069190905,0.13690573,0.0058725597,0.85268843,0.0017112602,0.00055397605],"about_ca_topic_score_codex":0.000008769552,"about_ca_topic_score_gemma":0.0000027858187,"teacher_disagreement_score":0.5532046,"about_ca_system_score_codex":0.000017461889,"about_ca_system_score_gemma":0.000032225897,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W3096500228","doi":"10.46298/dmtcs.6915","title":"Graphs containing finite induced paths of unbounded length","year":2022,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Agence Nationale de la Recherche; Canadian Defence Academy","keywords":"Antichain; Mathematics; Combinatorics; Lexicographical order; Induced subgraph; Comparability graph; Pairwise comparison; Discrete mathematics; Graph; Finite set; Path (computing); Partially ordered set; Pathwidth; Line graph; Computer science","score_opus":0.023524839367688503,"score_gpt":0.27372617276941025,"score_spread":0.25020133340172174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096500228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089423016,0.000077686556,0.90168804,0.00029807293,0.0015958118,0.0006413512,0.000042996777,0.0004128567,0.005820145],"genre_scores_gemma":[0.7513931,0.000011757118,0.24816655,0.00025294887,0.000060966522,0.000056930654,0.000012617464,0.00003750616,0.000007668231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932641,0.00037656943,0.0013381606,0.0017337723,0.002231784,0.0010556238],"domain_scores_gemma":[0.993167,0.0016455081,0.00093353185,0.0035053801,0.0003557123,0.00039287715],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0049170004,0.0007165667,0.001163291,0.0006980112,0.00069312647,0.0010506953,0.009588621,0.0002402908,0.00020568683],"category_scores_gemma":[0.00047896992,0.0006196654,0.00047254073,0.0016747253,0.0028628383,0.0005329852,0.015877511,0.0013473834,0.000018633835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008837,0.0001761801,0.000012077868,0.00021104707,0.000044450146,0.00003147529,0.0061925333,0.0005365479,0.00046360763,0.98720616,0.000010528353,0.0051065423],"study_design_scores_gemma":[0.00017975406,0.00023725007,0.000030287541,0.00021832532,0.000024058863,0.000015205858,0.00023306368,0.46140638,0.0010340838,0.53617144,0.000011299555,0.00043887747],"about_ca_topic_score_codex":0.00001175375,"about_ca_topic_score_gemma":5.506821e-7,"teacher_disagreement_score":0.66197,"about_ca_system_score_codex":0.00013699707,"about_ca_system_score_gemma":0.0006272637,"threshold_uncertainty_score":0.9999863},"labels":[],"label_agreement":null},{"id":"W3099960508","doi":"10.1007/978-3-030-62536-8_8","title":"Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Parallelism (grammar); Automaton; Finite-state machine; Parallel computing; Theoretical computer science; Algorithm","score_opus":0.019800135212385092,"score_gpt":0.240125828284948,"score_spread":0.2203256930725629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099960508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016914051,0.0005064818,0.9923715,0.0014616799,0.0010597323,0.00032017188,0.000004932978,0.0003213826,0.002262712],"genre_scores_gemma":[0.720572,0.0001297432,0.2745668,0.0042902427,0.00029094255,0.000011044734,0.000007577893,0.000050354258,0.00008132016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608344,0.00006015791,0.00068841997,0.001746102,0.00075350906,0.0006683746],"domain_scores_gemma":[0.9971454,0.0011321534,0.000342086,0.0010919899,0.00006944141,0.00021888629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089864375,0.0005755772,0.0006797968,0.0008214206,0.0001895903,0.0007819006,0.00311722,0.00028883264,0.0000071432514],"category_scores_gemma":[0.00018979167,0.0005589345,0.00008855194,0.0005832445,0.00048240085,0.0007362163,0.0027244033,0.0010337991,0.00002465188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000782689,0.00003245567,0.00021758363,0.0000783188,0.000012421157,0.0008731735,0.003205472,0.011075474,0.00024033085,0.05945083,0.000009157336,0.92479694],"study_design_scores_gemma":[0.00049647415,0.00013767953,0.00032558455,0.0006063649,0.0000037321192,0.00008289976,3.9531426e-7,0.8397872,0.00023595261,0.15746716,0.0002904758,0.00056609337],"about_ca_topic_score_codex":0.000029096984,"about_ca_topic_score_gemma":0.000028772676,"teacher_disagreement_score":0.9242309,"about_ca_system_score_codex":0.00012453354,"about_ca_system_score_gemma":0.00023899207,"threshold_uncertainty_score":0.99968624},"labels":[],"label_agreement":null},{"id":"W3100652847","doi":"10.5167/uzh-191594","title":"A decorated tree approach to random permutations in substitution-closed classes","year":2020,"lang":"en","type":"article","venue":"Zurich Open Repository and Archive (University of Zurich)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Mathematics; Bijection; Substitution (logic); Combinatorics; Tree (set theory); Constraint (computer-aided design); Decomposition; Discrete mathematics; Computer science","score_opus":0.017864218697264407,"score_gpt":0.2050423370549858,"score_spread":0.1871781183577214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100652847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40969282,0.00006241009,0.57072055,0.0006801306,0.0000499498,0.00046376415,0.000012030373,0.00006730468,0.018251032],"genre_scores_gemma":[0.93607265,0.000013839445,0.06347922,0.00021601752,0.0000175815,0.0000018277602,0.000012614405,0.000005278053,0.0001809465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865526,0.0004036504,0.00015925062,0.0004582265,0.00014549364,0.00017811514],"domain_scores_gemma":[0.9990654,0.0003242928,0.000105515144,0.00025166018,0.000050319934,0.00020280198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030788782,0.00012721811,0.00027714032,0.00014467911,0.00033586874,0.00013360553,0.0011183363,0.00004043889,0.000005819769],"category_scores_gemma":[0.00004496494,0.00013936893,0.000053442523,0.00068213313,0.000114951705,0.0007537487,0.00068950467,0.00012499832,0.000010722634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031670327,0.0027628348,0.03971169,0.00052087137,0.0005299254,0.001558464,0.15023328,0.008742421,0.16253747,0.58351964,0.026117954,0.0205984],"study_design_scores_gemma":[0.015421438,0.0011282815,0.44352853,0.00029409412,0.00016241717,0.00019710019,0.01601211,0.48922846,0.0038811907,0.014056949,0.014313968,0.0017754815],"about_ca_topic_score_codex":0.00024442005,"about_ca_topic_score_gemma":0.0000476789,"teacher_disagreement_score":0.5694627,"about_ca_system_score_codex":0.000020614718,"about_ca_system_score_gemma":0.000108294575,"threshold_uncertainty_score":0.56833},"labels":[],"label_agreement":null},{"id":"W3102860825","doi":"","title":"FROM INDEXED GRAMMARS TO GENERATING FUNCTIONS","year":2016,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rule-based machine translation; Context-free grammar; Computer science; Class (philosophy); Programming language; Tree-adjoining grammar; Series (stratigraphy); Indexed grammar; Context (archaeology); Extended Affix Grammar; L-attributed grammar; Natural language processing; Artificial intelligence; History","score_opus":0.01129816369973855,"score_gpt":0.21564222431273228,"score_spread":0.20434406061299373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102860825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12829524,0.000009979258,0.86735326,0.0023317647,0.0003908757,0.0000383517,0.0000030936565,0.0002641612,0.001313269],"genre_scores_gemma":[0.7877031,0.0000011546621,0.20414484,0.0021477574,0.00026902847,0.000014417366,0.0000012088396,0.00000633396,0.0057121855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993963,0.000022777283,0.00009691155,0.00023307327,0.00010053448,0.00015037261],"domain_scores_gemma":[0.9993902,0.00010414863,0.000017560813,0.0003828407,0.000021035945,0.00008423549],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010167405,0.000060933,0.00005879253,0.000041110892,0.00007549554,0.000089526315,0.0003699385,0.000023629369,0.0002355679],"category_scores_gemma":[0.000031817795,0.00003601623,0.000026831649,0.0001464726,0.000009252852,0.0002466513,0.00018262515,0.00002267346,0.0007869516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016849364,0.00002010701,0.0004776368,3.6983675e-7,0.000011224685,0.000004102409,0.0002801085,0.000021672115,0.15448199,0.11745011,0.02171682,0.70553416],"study_design_scores_gemma":[0.0029161943,0.00046634857,0.020254012,0.0001974645,0.000025530146,0.00003241175,0.0006833085,0.12900387,0.18173775,0.3657177,0.29662573,0.002339654],"about_ca_topic_score_codex":0.00010868214,"about_ca_topic_score_gemma":0.000023505581,"teacher_disagreement_score":0.7031945,"about_ca_system_score_codex":0.00001699105,"about_ca_system_score_gemma":0.000015990323,"threshold_uncertainty_score":0.99999106},"labels":[],"label_agreement":null},{"id":"W3103597113","doi":"","title":"A characterization of model sets by dynamical systems","year":2005,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Aperiodic graph; Dynamical systems theory; Characterization (materials science); Dynamical system (definition); Mathematics; Product (mathematics); Pure mathematics; Combinatorics; Physics; Geometry","score_opus":0.008800566012053684,"score_gpt":0.21940097861315633,"score_spread":0.21060041260110265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103597113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31390628,0.000014179663,0.68489957,0.00022995254,0.000038938575,0.000040159153,0.0000058645633,0.00008040216,0.00078465586],"genre_scores_gemma":[0.99171746,0.0000038642743,0.0073621254,0.00016629806,0.000012567442,0.0000036727938,0.0000112282905,0.0000032261519,0.000719543],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995239,0.000016701308,0.00013553553,0.00012337441,0.000110276625,0.00009026233],"domain_scores_gemma":[0.99968064,0.00001170907,0.00004562903,0.00021036537,0.00002110788,0.000030554987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000095762174,0.000048606413,0.000079240854,0.000025822517,0.000016179434,0.000036181493,0.00027790747,0.000030034294,0.0000070212145],"category_scores_gemma":[0.000002529409,0.000039615938,0.000018884715,0.000077504024,0.000010929012,0.00031606242,0.000060302875,0.000024673927,0.000019292069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020127593,0.00009254241,0.000034840843,0.000017254406,0.0000068386485,4.2091474e-7,0.00025197247,0.0019902128,0.6182912,0.3575965,0.00083056017,0.020885631],"study_design_scores_gemma":[0.00006724837,0.000008152395,0.00007610121,0.0000068173613,8.278997e-7,0.0000029576747,0.0000032078358,0.99191475,0.0073068775,0.0002930135,0.00026930583,0.00005072519],"about_ca_topic_score_codex":0.000006321787,"about_ca_topic_score_gemma":4.4581992e-7,"teacher_disagreement_score":0.98992455,"about_ca_system_score_codex":0.000013661017,"about_ca_system_score_gemma":0.000011652436,"threshold_uncertainty_score":0.1615491},"labels":[],"label_agreement":null},{"id":"W3106242887","doi":"","title":"ON SIMULTANEOUS RATIONAL APPROXIMATIONS TO A REAL NUMBER, ITS SQUARE, AND ITS CUBE","year":2012,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Exponent; Transcendental number; Algebraic number; Rational number; Upper and lower bounds; Square (algebra); Combinatorics; Cube (algebra); Degree (music); Discrete mathematics; Real number; Mathematical analysis; Geometry","score_opus":0.01621041567378072,"score_gpt":0.26720758650858795,"score_spread":0.2509971708348072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106242887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5729641,0.000106556574,0.33413294,0.0032761032,0.0005046773,0.0005229565,0.000017240078,0.0005702974,0.08790514],"genre_scores_gemma":[0.9843131,0.0000064526216,0.012587694,0.0010578815,0.000090646216,0.000020183374,0.000004147884,0.0000059733507,0.001913968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992203,0.00003521028,0.00012307089,0.00019727348,0.00019683504,0.0002272866],"domain_scores_gemma":[0.999178,0.00037645173,0.000026775191,0.00019888395,0.00005329764,0.00016657948],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018044155,0.00009484967,0.00008249283,0.00004684722,0.00011910371,0.000093947485,0.00023242588,0.000036294332,0.00014388551],"category_scores_gemma":[0.00011168619,0.000078781,0.000020523821,0.00018777675,0.00000773262,0.00046143652,0.00012353611,0.000052809086,0.0007836133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003407295,0.00007825852,0.000059741178,0.0000055225237,0.000004012236,0.0000018774165,0.00056427415,0.00023989461,0.00041667,0.9932794,0.0011223403,0.0042246063],"study_design_scores_gemma":[0.00051722745,0.00015184922,0.0026003306,0.000036810732,0.000007604963,0.00011218018,0.00007814164,0.96066606,0.004581947,0.02345583,0.0072800466,0.000511969],"about_ca_topic_score_codex":0.000013237361,"about_ca_topic_score_gemma":0.00000445623,"teacher_disagreement_score":0.96982354,"about_ca_system_score_codex":0.000019596839,"about_ca_system_score_gemma":0.000019232233,"threshold_uncertainty_score":0.9999944},"labels":[],"label_agreement":null},{"id":"W3115281408","doi":"","title":"String Attractors for Automatic Sequences.","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Attractor; String (physics); Combinatorics; Decidability; Sequence (biology); Mathematics; Prefix; Constant (computer programming); Discrete mathematics; Mathematical analysis; Mathematical physics; Computer science","score_opus":0.12056397071989795,"score_gpt":0.20194717572376258,"score_spread":0.08138320500386463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115281408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2497027,0.000049533322,0.7478248,0.00024070482,0.0006558488,0.00036844047,0.0000269387,0.00071911217,0.00041195424],"genre_scores_gemma":[0.99149936,0.000033973258,0.007862256,0.0001925654,0.000111287365,0.000002538488,0.000017975952,0.0000214017,0.00025864333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981346,0.000079670615,0.00022426297,0.0010953748,0.0000906281,0.00037545266],"domain_scores_gemma":[0.9982271,0.00025073616,0.00028153026,0.0009626751,0.00007768582,0.000200244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024920114,0.00031481215,0.00037573508,0.00015961644,0.00015567314,0.00020540917,0.0024511856,0.00023100765,0.000026537315],"category_scores_gemma":[0.00006334714,0.00035365968,0.00029093697,0.00042029377,0.00007742345,0.00043621229,0.0015474975,0.00040779728,0.000065968554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010313052,0.00006457735,0.0011327943,0.0004081798,0.00015821855,0.00028702192,0.00050133193,0.04529445,0.00022995393,0.9471156,0.000634829,0.0041627316],"study_design_scores_gemma":[0.00027293098,0.00004196288,0.00077059446,0.00011299764,0.000043875174,0.0000033011827,0.000063955544,0.79090136,0.00034842922,0.20656672,0.0004663705,0.00040749347],"about_ca_topic_score_codex":0.00005383938,"about_ca_topic_score_gemma":0.00000610643,"teacher_disagreement_score":0.7456069,"about_ca_system_score_codex":0.00017783575,"about_ca_system_score_gemma":0.00023699527,"threshold_uncertainty_score":0.9998915},"labels":[],"label_agreement":null},{"id":"W3116363031","doi":"10.1016/j.tcs.2020.12.028","title":"Decision problems and projection languages for restricted variants of two-dimensional automata","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic finite automaton; Deterministic automaton; Decidability; Mathematics; Nondeterministic algorithm; Discrete mathematics; Deterministic finite automaton; Büchi automaton; Decision problem; Regular language; Combinatorics; Two-way deterministic finite automaton; Quantum finite automata; Unary operation; Equivalence (formal languages); Deterministic pushdown automaton; Automata theory; Automaton; Finite-state machine; Computer science; Algorithm; Theoretical computer science","score_opus":0.017174068509438905,"score_gpt":0.27142118068754834,"score_spread":0.2542471121781094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116363031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17733045,0.000033003347,0.8210356,0.000839084,0.0001665128,0.00028382675,0.000004827542,0.00017405329,0.00013262009],"genre_scores_gemma":[0.6985068,0.0000014822282,0.30110422,0.00031935892,0.000055413166,0.000006174142,9.471077e-7,0.0000046238965,0.0000010038156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831074,0.000060988892,0.00026787922,0.0006039384,0.00046237552,0.00029404508],"domain_scores_gemma":[0.99869245,0.0004978701,0.000091653914,0.00037173138,0.00015894407,0.00018736994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007843555,0.00012992069,0.00019544717,0.00011525091,0.00019542282,0.00017151392,0.001032472,0.00003825768,0.0000065261843],"category_scores_gemma":[0.00023368052,0.000099468,0.000038779337,0.00088637415,0.0008304547,0.000499107,0.0008087315,0.00008825136,0.0000046473147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026458816,0.000045873323,0.000029242303,0.000024939038,0.0000037912855,0.0000033996787,0.00051029987,0.00035966997,0.012381679,0.90681165,0.0000552237,0.07974777],"study_design_scores_gemma":[0.00054701563,0.00040985615,0.0015665445,0.000048770027,0.000004467049,0.00002627039,0.0000046578984,0.8713595,0.0040660943,0.121829435,0.000017438333,0.000119925535],"about_ca_topic_score_codex":0.000004380968,"about_ca_topic_score_gemma":2.393876e-7,"teacher_disagreement_score":0.8709999,"about_ca_system_score_codex":0.000014366886,"about_ca_system_score_gemma":0.00008272311,"threshold_uncertainty_score":0.40561876},"labels":[],"label_agreement":null},{"id":"W3116871471","doi":"10.1142/s0129054120420095","title":"Semilinearity of Families of Languages","year":2020,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Linguistics; Computer science; Sociology; Philosophy","score_opus":0.017634115768495644,"score_gpt":0.30219732675415434,"score_spread":0.2845632109856587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116871471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.294772,0.000068645175,0.7029871,0.0013986113,0.00047980034,0.000026701415,0.000006423333,0.000008640421,0.0002521374],"genre_scores_gemma":[0.83708864,0.000024385356,0.16263528,0.00014336951,0.00010329399,1.7377683e-7,5.7642563e-7,0.0000017811849,0.0000024638673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827975,0.000032618365,0.0006011507,0.00013184334,0.00086806394,0.000086595996],"domain_scores_gemma":[0.9972961,0.0001808415,0.0007267398,0.00020185189,0.0015271661,0.000067317975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006206656,0.000067563706,0.00020002412,0.00031327596,0.000032140753,0.0000633458,0.0027351698,0.000018251943,0.000013387675],"category_scores_gemma":[0.00022258727,0.00005788681,0.00010610757,0.00057029986,0.00040566284,0.0010494323,0.00040020215,0.00008443459,0.0000016873342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079872596,0.00063922396,0.009813723,0.00009743542,0.00026556075,0.000036692963,0.0110138785,0.014878901,0.19573322,0.39785784,0.0008197177,0.36876392],"study_design_scores_gemma":[0.0014328634,0.0009864875,0.04848224,0.00039160842,0.000028436096,0.00019850739,0.0004604512,0.5606331,0.37020066,0.015299148,0.001582441,0.00030401847],"about_ca_topic_score_codex":0.00001752164,"about_ca_topic_score_gemma":8.5679915e-7,"teacher_disagreement_score":0.54575425,"about_ca_system_score_codex":0.000021449912,"about_ca_system_score_gemma":0.00032545725,"threshold_uncertainty_score":0.50826716},"labels":[],"label_agreement":null},{"id":"W3119265231","doi":"10.1016/j.ic.2021.104686","title":"Descriptional Complexity of Formal Systems (DCFS 2019)","year":2021,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Modulo; Alphabet; Congruence (geometry); Computer science; Arithmetic; Mathematics; Combinatorics; Discrete mathematics; Linguistics; Philosophy","score_opus":0.02873548115125589,"score_gpt":0.24258239689671604,"score_spread":0.21384691574546016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119265231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065384716,0.00013686008,0.93220466,0.00024629262,0.0002915382,0.00006274419,0.000009704062,0.000067170215,0.001596305],"genre_scores_gemma":[0.98328364,0.000012812452,0.01635524,0.00020542377,0.000021251704,0.0000029765354,0.00009855746,0.0000013132216,0.000018756646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933064,0.00003580404,0.00029135906,0.00006626989,0.0001845329,0.00009138394],"domain_scores_gemma":[0.99947447,0.000034087985,0.00014535178,0.00009613202,0.00021417,0.000035776146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019670223,0.000056984452,0.000091015965,0.00007172174,0.00008307779,0.00016868723,0.000100266814,0.000030314834,0.000006306862],"category_scores_gemma":[0.000013794612,0.000055539105,0.000023983584,0.00016526024,0.00003975134,0.0024512566,0.00008639615,0.000039801987,0.000021752578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000541961,0.000015771355,0.00011583594,0.00006247738,0.00000931669,7.4766115e-7,0.0009115541,0.003654013,0.00013862512,0.8931116,0.00060195057,0.10137269],"study_design_scores_gemma":[0.00037125146,0.00003687431,0.014002613,0.000027823415,0.0000027658614,0.00007457559,0.00030274247,0.9653954,0.0004235306,0.016716186,0.0025552667,0.000091003596],"about_ca_topic_score_codex":0.000019960358,"about_ca_topic_score_gemma":8.3585945e-7,"teacher_disagreement_score":0.9617413,"about_ca_system_score_codex":0.000013914899,"about_ca_system_score_gemma":0.00005318229,"threshold_uncertainty_score":0.2264819},"labels":[],"label_agreement":null},{"id":"W3120172643","doi":"10.1016/j.tcs.2021.01.018","title":"Ostrowski-automatic sequences: Theory and applications","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Enumeration; Computation; Computer science; Algebra over a field; Order (exchange); Mathematics; Automated theorem proving; Theoretical computer science; Discrete mathematics; Algorithm; Pure mathematics","score_opus":0.007005801093417205,"score_gpt":0.2402572451134385,"score_spread":0.2332514440200213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120172643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018355954,0.00025031908,0.9759145,0.00074299506,0.00021230707,0.00014752497,0.0000020507812,0.00036799491,0.004006388],"genre_scores_gemma":[0.84457433,0.000016467697,0.15397058,0.0012776807,0.00010499777,0.000025366135,0.00000121754,0.000007061601,0.000022273614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759936,0.00026661385,0.00027561633,0.00084047316,0.0005138434,0.00050407666],"domain_scores_gemma":[0.99757326,0.0007949202,0.000063238025,0.0010932584,0.00017973209,0.0002955946],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022865492,0.00018022516,0.00020711952,0.000118230215,0.0005256088,0.0007263491,0.001767229,0.00004934162,0.00010650574],"category_scores_gemma":[0.00013212109,0.00014942318,0.000052145722,0.0012819353,0.0030044948,0.0007249277,0.0013859421,0.00016733691,0.00008766995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.8627763e-7,0.000032164415,0.00003181813,0.000010284709,0.0000037154193,0.000019203771,0.00020461765,0.000010072927,0.0012422662,0.87016344,0.000009965355,0.1282716],"study_design_scores_gemma":[0.00012235911,0.000043666507,0.00049984216,0.000028288596,0.000005211296,0.0002608514,0.000033187673,0.18622495,0.006744666,0.8055239,0.0003117723,0.00020130753],"about_ca_topic_score_codex":9.901703e-7,"about_ca_topic_score_gemma":3.3127665e-7,"teacher_disagreement_score":0.8262184,"about_ca_system_score_codex":0.00003634761,"about_ca_system_score_gemma":0.0002423076,"threshold_uncertainty_score":0.9997088},"labels":[],"label_agreement":null},{"id":"W3120287019","doi":"10.1016/j.ic.2021.104690","title":"Structural properties of NFAs and growth rates of nondeterminism measures","year":2021,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; String (physics); Computation; Nondeterministic algorithm; Combinatorics; Bounded function; Polynomial; Discrete mathematics; Bounding overwatch; Tree (set theory); GF(2); Exponential function; Path (computing); Nondeterministic finite automaton; Finite field; Automaton; Algorithm; Computer science; Automata theory; Theoretical computer science","score_opus":0.022265722468154052,"score_gpt":0.23524108675770072,"score_spread":0.21297536428954666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120287019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90680665,0.00019586502,0.09257566,0.00013359354,0.000056082303,0.00004370903,0.0000014441334,0.000019686117,0.0001673056],"genre_scores_gemma":[0.99554133,0.00002082676,0.004332119,0.0000914336,0.0000041814505,0.0000011622825,0.0000045117954,9.207189e-7,0.000003500763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995709,0.00002439471,0.00020537435,0.00004870979,0.00010775442,0.000042858035],"domain_scores_gemma":[0.9996096,0.000021536265,0.000118378346,0.000052695847,0.00018072996,0.000017085698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008991336,0.00004449743,0.00008092971,0.000053428917,0.00003544297,0.00006547579,0.00005527895,0.000019688137,9.608128e-7],"category_scores_gemma":[0.000025192734,0.00003621963,0.000012094829,0.00008937315,0.00003842671,0.0009663024,0.000053691925,0.000021547816,5.516608e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023477744,0.000019461942,0.0033154846,0.0005685399,0.000035275032,0.0000012720449,0.02296382,0.0005984497,0.015395246,0.15418234,0.000058174523,0.80283844],"study_design_scores_gemma":[0.00066350127,0.0000765782,0.062325034,0.00010726491,0.00000780123,0.000066351044,0.0010027728,0.7076394,0.20671527,0.021175448,0.000067384695,0.00015317863],"about_ca_topic_score_codex":0.000009862889,"about_ca_topic_score_gemma":7.8429173e-7,"teacher_disagreement_score":0.80268526,"about_ca_system_score_codex":0.0000026848136,"about_ca_system_score_gemma":0.000028762346,"threshold_uncertainty_score":0.14769937},"labels":[],"label_agreement":null},{"id":"W3121836531","doi":"10.46298/lmcs-18(3:14)2022","title":"Tameness and the power of programs over monoids in DA","year":2022,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Morphism; Monoid; Class (philosophy); Regular language; Mathematics; Characterization (materials science); Hierarchy; Expressive power; Complexity class; Pure mathematics; Discrete mathematics; Algebra over a field; Computer science; Time complexity; Automaton; Programming language; Physics; Artificial intelligence","score_opus":0.04480822537424823,"score_gpt":0.3572987186146682,"score_spread":0.31249049324042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121836531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25359046,0.00015882832,0.7451154,0.00036689694,0.00038722655,0.00019577511,3.1343774e-7,0.000031023043,0.00015409221],"genre_scores_gemma":[0.52878773,0.0000030362137,0.47073483,0.00042925004,0.000007430709,0.00003315474,6.1813e-8,0.000001793387,0.000002703927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717134,0.0011020801,0.00033737,0.0005824114,0.00046076404,0.00034602146],"domain_scores_gemma":[0.9983,0.0009172079,0.00010464085,0.00059421454,0.0000261926,0.00005770696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009294976,0.00011587777,0.00027349437,0.00018449973,0.00016736836,0.00017638312,0.0023881942,0.00002762264,0.000013881303],"category_scores_gemma":[0.00010232148,0.00007287782,0.00004369805,0.0022082834,0.0010919591,0.00032474042,0.0034244563,0.00028751013,3.600538e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019170662,0.00015416698,0.0030645472,0.000005325603,0.0000016321794,0.000018287485,0.0022117153,0.0013893867,0.00071724784,0.35367227,0.0000036956117,0.63874257],"study_design_scores_gemma":[0.0008090852,0.00020847582,0.03536131,0.000015344209,9.5157117e-7,0.000030486994,0.000067833724,0.7540573,0.0004299418,0.20867658,0.00018905706,0.00015362752],"about_ca_topic_score_codex":0.000044399167,"about_ca_topic_score_gemma":0.000001132528,"teacher_disagreement_score":0.7526679,"about_ca_system_score_codex":0.00004999264,"about_ca_system_score_gemma":0.00005833371,"threshold_uncertainty_score":0.44378987},"labels":[],"label_agreement":null},{"id":"W3121898969","doi":"","title":"Operational state complexity of deterministic unranked tree automata","year":2016,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Tree (set theory); Regular language; Combinatorics; String (physics); Intersection (aeronautics); Tree automaton; State (computer science); Discrete mathematics; Automaton; Deterministic finite automaton; Mathematics; Upper and lower bounds; Time complexity; Computer science; Theoretical computer science; Algorithm","score_opus":0.03509262192747717,"score_gpt":0.2554535460084224,"score_spread":0.22036092408094524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121898969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114837855,0.000009415592,0.87699544,0.0015530303,0.00016248858,0.00008674147,0.00002530511,0.00024784595,0.0060818484],"genre_scores_gemma":[0.9607346,0.00000313994,0.037981283,0.00025617421,0.000015963613,0.000004136319,0.0000016723977,0.0000043903187,0.0009986266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913836,0.00005166228,0.00022949916,0.00021890532,0.00020165693,0.00015991184],"domain_scores_gemma":[0.9991685,0.0001762577,0.000061365645,0.0004813629,0.000054953514,0.000057542355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021413079,0.0000874217,0.00013501379,0.000048858612,0.00005004408,0.000042302647,0.0006736328,0.000019818026,0.00019115332],"category_scores_gemma":[0.000036032852,0.000051680097,0.000041818745,0.00010567521,0.00016716679,0.0003427284,0.00019914647,0.000021890244,0.00009965222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007718315,0.00007594317,0.00028161312,0.000008916791,0.0000131978795,0.0000074902446,0.00012764208,0.0000033478982,0.021562286,0.8420341,0.0009312009,0.13494657],"study_design_scores_gemma":[0.0028815747,0.00039918305,0.109337635,0.00011803684,0.000010965973,0.00007265125,0.000021096908,0.30916733,0.08208461,0.49191263,0.0033505238,0.0006437426],"about_ca_topic_score_codex":0.000020705851,"about_ca_topic_score_gemma":0.000020172469,"teacher_disagreement_score":0.8458968,"about_ca_system_score_codex":0.000015636959,"about_ca_system_score_gemma":0.00005962379,"threshold_uncertainty_score":0.21074532},"labels":[],"label_agreement":null},{"id":"W3124826634","doi":"10.1109/ccc.1997.612315","title":"Circuits and expressions with non-associative gates","year":2002,"lang":"en","type":"preprint","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Chengdu University of Information Technology","keywords":"Iterated function; Multiplication (music); Associative property; Semigroup; Abelian group; Mathematics; Expression (computer science); Discrete mathematics; Class (philosophy); Value (mathematics); Algebra over a field; Arithmetic; Computer science; Pure mathematics; Combinatorics","score_opus":0.01329980603729951,"score_gpt":0.2157967089046736,"score_spread":0.20249690286737407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124826634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15103061,0.001174794,0.7276258,0.0023187427,0.00067957334,0.00077463576,0.00004108048,0.0010928081,0.11526194],"genre_scores_gemma":[0.97528243,0.00012626147,0.020385949,0.00038104062,0.000065022476,0.000050602786,0.0000043905675,0.000015901287,0.0036884085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987645,0.00005108269,0.00014659284,0.0005767238,0.00021956686,0.00024149538],"domain_scores_gemma":[0.99891603,0.0001731393,0.00014473088,0.00060155295,0.000059746882,0.00010480376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014925988,0.00022332616,0.00026376167,0.00007510669,0.0001153604,0.00028690978,0.0007296413,0.0001538905,0.00008129203],"category_scores_gemma":[0.000018524132,0.0001543407,0.000043398493,0.000106288455,0.000056482644,0.00019320937,0.0014022419,0.00032289923,0.000029141063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015259944,0.0013885442,0.018983457,0.00097351964,0.001415686,0.0005566902,0.07501542,0.00072887866,0.006991735,0.41028187,0.07570188,0.4079471],"study_design_scores_gemma":[0.0032552995,0.0006118382,0.09340806,0.0039035075,0.00015625842,0.00015333867,0.0018765179,0.5510964,0.021605138,0.31283194,0.0059506483,0.005151077],"about_ca_topic_score_codex":0.000044452077,"about_ca_topic_score_gemma":0.0000050336844,"teacher_disagreement_score":0.82425183,"about_ca_system_score_codex":0.000030063571,"about_ca_system_score_gemma":0.00004388669,"threshold_uncertainty_score":0.6293831},"labels":[],"label_agreement":null},{"id":"W3126348830","doi":"10.1007/978-3-030-67731-2_11","title":"Concatenation Operations and Restricted Variants of Two-Dimensional Automata","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Diagonal; Closure (psychology); Computer science; Nondeterministic algorithm; Automaton; Nondeterministic finite automaton; Discrete mathematics; Algorithm; Automata theory; Combinatorics; Mathematics; Theoretical computer science","score_opus":0.015236191860627867,"score_gpt":0.24741043209524152,"score_spread":0.23217424023461367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126348830","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031150265,0.00046080854,0.9940394,0.0006181341,0.0008085516,0.00020296781,0.000012759685,0.000102994454,0.0006393176],"genre_scores_gemma":[0.48655534,0.00004320433,0.5119446,0.00095310726,0.00017773079,0.0000057236684,0.000029191935,0.000023099486,0.00026800216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975814,0.00005050301,0.00045224282,0.0009601885,0.0006634751,0.0002921577],"domain_scores_gemma":[0.998134,0.00039788728,0.00014373146,0.00088446,0.00033683443,0.000103077095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050448795,0.00028367422,0.0003855777,0.00050790166,0.00018381349,0.0003183743,0.0012340865,0.0001700794,0.00002309364],"category_scores_gemma":[0.00011815943,0.0002570543,0.00005467168,0.0005452884,0.0004666558,0.0005588792,0.001164248,0.00033428983,0.000005616181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000511099,0.00007931847,0.00003519993,0.000053159758,0.000031308395,0.00018345463,0.00065025565,0.12953877,0.008413506,0.4526904,0.000026022673,0.4082935],"study_design_scores_gemma":[0.00036980375,0.00007256815,0.0007897057,0.00028341962,0.000007682971,0.00013192625,1.1677034e-7,0.9304971,0.0019087802,0.065607525,0.000037471975,0.0002938838],"about_ca_topic_score_codex":0.00004832056,"about_ca_topic_score_gemma":0.000054380125,"teacher_disagreement_score":0.80095834,"about_ca_system_score_codex":0.000085707274,"about_ca_system_score_gemma":0.00063072686,"threshold_uncertainty_score":0.99998814},"labels":[],"label_agreement":null},{"id":"W3126750858","doi":"10.1142/s0129054121410033","title":"Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Separable space; Mathematics; Partition (number theory); Zero (linguistics); Embedding; Word (group theory); Constructive; Rational number; Combinatorics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.011756043757670224,"score_gpt":0.26541966523242494,"score_spread":0.25366362147475474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126750858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038192146,0.00034272426,0.9514493,0.008131992,0.0010926934,0.00007168786,0.0000029533371,0.0000157641,0.0007007945],"genre_scores_gemma":[0.8488767,0.00010452723,0.15063417,0.00023139885,0.00010404285,0.000002386089,0.0000027012884,0.0000029605008,0.000041108742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979188,0.00016321999,0.00058941124,0.00021382813,0.00097593584,0.00013883554],"domain_scores_gemma":[0.9968547,0.00069548556,0.00047959003,0.0002291767,0.0016733691,0.00006763261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024343983,0.000090064874,0.00016265822,0.00044715797,0.00035153524,0.0006120102,0.0012647273,0.000025437703,0.000017832734],"category_scores_gemma":[0.00028618926,0.000068197616,0.000100565005,0.0010525654,0.00044869995,0.002469807,0.0002164718,0.00018412166,0.000004842688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017931441,0.00009837301,0.00038178085,0.0000045044744,0.00006971513,0.000010159099,0.0010232324,0.0060863164,0.0016698061,0.932225,0.00044769578,0.05796548],"study_design_scores_gemma":[0.0029762713,0.00013636319,0.011084563,0.00022507146,0.000043903703,0.0014114046,0.00013398028,0.53189933,0.013487602,0.43430972,0.0040265303,0.0002652253],"about_ca_topic_score_codex":0.0000068745967,"about_ca_topic_score_gemma":0.00000184098,"teacher_disagreement_score":0.81068456,"about_ca_system_score_codex":0.00008487739,"about_ca_system_score_gemma":0.0006554364,"threshold_uncertainty_score":0.5901629},"labels":[],"label_agreement":null},{"id":"W3130346675","doi":"10.46298/lmcs-20(3:12)2024","title":"Decidability for Sturmian words","year":2024,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Decidability; Mathematics; Computer science; Calculus (dental); Discrete mathematics; Medicine","score_opus":0.07095395759748904,"score_gpt":0.4281744339669295,"score_spread":0.35722047636944043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130346675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060089133,0.0002967145,0.9888331,0.00088504987,0.002791293,0.00031906928,0.0000014025223,0.0004474691,0.0004169569],"genre_scores_gemma":[0.17700467,0.0000037581706,0.822115,0.0006559174,0.00015298888,0.00004818148,1.9785348e-7,0.000005112893,0.0000141486025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971454,0.0003139353,0.00036159426,0.0012172249,0.000362651,0.0005991552],"domain_scores_gemma":[0.99630624,0.0026090052,0.000035898407,0.00080921984,0.000067957175,0.0001716993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008576192,0.0001781185,0.00025630044,0.00027814662,0.00017128671,0.0008978748,0.0027401121,0.00008094511,0.000010308306],"category_scores_gemma":[0.000439634,0.00012877287,0.00011659126,0.0024076952,0.00047502184,0.0008714931,0.0010562949,0.0002400287,0.000014725253],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019686872,0.000038370476,0.000077604884,0.000017899787,0.0000015649686,0.000013704231,0.00024450652,0.00018655854,0.0010952922,0.26646164,0.000034582394,0.7318263],"study_design_scores_gemma":[0.00007476374,0.000103108505,0.003722271,0.00003669238,0.0000011247487,0.000016336904,0.000003435525,0.64198154,0.0018785194,0.35032746,0.0017079092,0.00014685084],"about_ca_topic_score_codex":0.000005110448,"about_ca_topic_score_gemma":0.00000192861,"teacher_disagreement_score":0.73167944,"about_ca_system_score_codex":0.00012811444,"about_ca_system_score_gemma":0.00017036188,"threshold_uncertainty_score":0.8658228},"labels":[],"label_agreement":null},{"id":"W3131929699","doi":"","title":"Asymptotic behaviour of functional identities","year":2012,"lang":"en","type":"article","venue":"Bulgarian Digital Mathematics Library (BulDML) at IMI-BAS (Institute of Mathematics and Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Psychology; Mathematics; Computer science","score_opus":0.0124899196269221,"score_gpt":0.18865477312232784,"score_spread":0.17616485349540573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131929699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66599125,0.00058705057,0.27386302,0.00021752325,0.0010900754,0.00086056377,0.00023018719,0.00043434248,0.056726012],"genre_scores_gemma":[0.80129516,0.00012768396,0.19607167,0.0001611863,0.00012140302,0.000033262582,0.00010441537,0.00007109209,0.0020141096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962433,0.000017212571,0.002029948,0.00022461647,0.0008547797,0.0006301239],"domain_scores_gemma":[0.996848,0.00034129655,0.0012585951,0.0010838821,0.00011207021,0.00035616488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005015843,0.00052479486,0.00089478533,0.0004044268,0.00020746511,0.00056773314,0.0011096026,0.00020620761,0.00016650789],"category_scores_gemma":[0.00016636556,0.0004504449,0.0002911261,0.0004119451,0.00047129163,0.010377126,0.0013791057,0.00020472195,0.00013018353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010629354,0.0011021021,0.0017016908,0.0034474968,0.00018800392,0.0000050798203,0.008149765,0.000111797766,0.0001814073,0.979954,0.0032164317,0.0019315853],"study_design_scores_gemma":[0.0063678334,0.0013037529,0.0065166857,0.0059456876,0.0008401012,0.0032115174,0.013579328,0.25467858,0.03906525,0.6480521,0.015138346,0.0053008203],"about_ca_topic_score_codex":0.0000021541355,"about_ca_topic_score_gemma":4.0017122e-7,"teacher_disagreement_score":0.3319019,"about_ca_system_score_codex":0.000041109488,"about_ca_system_score_gemma":0.00013696213,"threshold_uncertainty_score":0.9997947},"labels":[],"label_agreement":null},{"id":"W3136852318","doi":"10.48550/arxiv.2103.10904","title":"Frobenius Numbers and Automatic Sequences","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics; Mathematical proof; Discrete mathematics; Set (abstract data type); Integer (computer science); Automaton; Computer science; Theoretical computer science","score_opus":0.04365410181395647,"score_gpt":0.17349913350985474,"score_spread":0.12984503169589828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136852318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7501801,0.00029415623,0.24622145,0.00010395713,0.00049514876,0.00012038369,0.0000053693225,0.00039532105,0.0021840932],"genre_scores_gemma":[0.9930483,0.00023827181,0.0058918106,0.00016369513,0.000038190625,6.6372223e-7,0.000009413123,0.000012321966,0.00059731567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982587,0.00015755075,0.0001675885,0.0010289986,0.00008861076,0.00029856054],"domain_scores_gemma":[0.9984318,0.0001343881,0.00017854523,0.0010232324,0.00006979561,0.00016220994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022789059,0.00027701823,0.0003381351,0.00013894535,0.0001431698,0.00037100923,0.0013566085,0.00022176642,0.00007202474],"category_scores_gemma":[0.00002721971,0.00030719125,0.00013928383,0.00038854638,0.00015162354,0.0005067162,0.002330588,0.00037715302,0.000033757187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012691989,0.0002446968,0.014831826,0.0007598468,0.00055236876,0.0053379526,0.0040810653,0.044207826,0.00044996213,0.91291803,0.0008745642,0.015729165],"study_design_scores_gemma":[0.00035203295,0.000029284265,0.003954269,0.00029227452,0.00006870758,0.000052563715,0.0006100654,0.8804987,0.00028653958,0.11300728,0.00016565513,0.00068260875],"about_ca_topic_score_codex":0.00033382754,"about_ca_topic_score_gemma":0.000059983602,"teacher_disagreement_score":0.8362909,"about_ca_system_score_codex":0.00009537768,"about_ca_system_score_gemma":0.00019280842,"threshold_uncertainty_score":0.999938},"labels":[],"label_agreement":null},{"id":"W3150719485","doi":"","title":"Transition complexity of incomplete dfas","year":2011,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Intersection (aeronautics); Descriptive complexity theory; Transition system; Finite-state machine; Deterministic finite automaton; Computational complexity theory; Automaton; Theoretical computer science; Computer science; State (computer science); Algorithmic complexity; Nondeterministic finite automaton; Transition (genetics); Mathematics; Algorithm; Automata theory","score_opus":0.0924043149423218,"score_gpt":0.23169189708273552,"score_spread":0.1392875821404137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150719485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08372278,0.000011683289,0.88059974,0.00019857948,0.00008213167,0.000047478134,0.0000021493815,0.0001498443,0.03518559],"genre_scores_gemma":[0.89695245,0.0000010082708,0.10274931,0.0002580175,0.000008623997,0.0000012189014,9.724268e-7,0.0000020780546,0.000026305444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999527,0.00003130707,0.00012840806,0.00012414852,0.00009227686,0.00009687281],"domain_scores_gemma":[0.9996002,0.000016431275,0.000036295958,0.00028811945,0.000026931266,0.000032044867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014426411,0.0000515617,0.00009029687,0.000039546387,0.000028338518,0.000009007924,0.00039843773,0.000019139381,0.0002563752],"category_scores_gemma":[0.0000024372832,0.00004249963,0.000041096362,0.00012124244,0.0000852315,0.00022105848,0.000060142407,0.000030576284,0.000038255315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031888026,0.000051892697,0.000045766228,0.000007262709,0.0000049966325,0.0000019833385,0.0014316238,7.931617e-7,0.002912686,0.9885384,0.0001217027,0.0068797446],"study_design_scores_gemma":[0.000414616,0.0001754673,0.033389155,0.000021098256,0.000005699829,0.00002286705,0.00014041095,0.069005385,0.112374485,0.7838654,0.00035850224,0.00022692027],"about_ca_topic_score_codex":0.00014804253,"about_ca_topic_score_gemma":0.000009111023,"teacher_disagreement_score":0.8132297,"about_ca_system_score_codex":0.000004605182,"about_ca_system_score_gemma":0.000008974514,"threshold_uncertainty_score":0.28071287},"labels":[],"label_agreement":null},{"id":"W3154979563","doi":"10.1016/j.jnt.2021.03.005","title":"On quadratic numbers and forms, and Markoff theory","year":2021,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Quadratic equation; Word (group theory); Pure mathematics; Discrete mathematics; Combinatorics; Geometry","score_opus":0.005763016727419214,"score_gpt":0.23177856977853492,"score_spread":0.2260155530511157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154979563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86573356,0.0024476738,0.089715555,0.0014314033,0.0008171386,0.00010263239,0.00001328661,0.00006847988,0.03967029],"genre_scores_gemma":[0.98732513,0.00022925166,0.008333551,0.0022852425,0.00012444073,0.0000018739364,0.0000012087698,0.000019054347,0.0016802624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852544,0.00042889843,0.00035236575,0.00020890411,0.00027002936,0.00021436322],"domain_scores_gemma":[0.9975502,0.0016136913,0.00025100622,0.00032261544,0.000097966855,0.00016453004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018034732,0.00015591226,0.0002757523,0.00006882584,0.00011282627,0.0001983323,0.00033424122,0.00006785287,0.0005339271],"category_scores_gemma":[0.00034488615,0.00011622785,0.00009277168,0.00016009218,0.000115691444,0.00057937065,0.00018291091,0.00027225804,0.000026220292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000727923,0.00007257737,0.00021529282,0.000024514004,0.000071847426,0.00029337106,0.00088958954,0.0000022775725,0.00029671265,0.94803184,0.00329798,0.046731196],"study_design_scores_gemma":[0.0005968627,0.00010074962,0.0018525904,0.00016579646,0.000026693502,0.002957239,0.0006850575,0.00021400503,0.0007883286,0.9890815,0.0033557839,0.00017537523],"about_ca_topic_score_codex":7.4263716e-7,"about_ca_topic_score_gemma":0.0000012216213,"teacher_disagreement_score":0.121591575,"about_ca_system_score_codex":0.000029882194,"about_ca_system_score_gemma":0.00008692524,"threshold_uncertainty_score":0.5846127},"labels":[],"label_agreement":null},{"id":"W3158013313","doi":"10.1142/s0129054121410045","title":"Generalizations of Checking Stack Automata: Characterizations and Hierarchies","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Decidability; Turing machine; Computer science; Automaton; Stack (abstract data type); Theoretical computer science; Bounded function; Expressive power; Pushdown automaton; Automata theory; PSPACE; Discrete mathematics; Mathematics; Computational complexity theory; Programming language; Algorithm; Computation","score_opus":0.014366912644291241,"score_gpt":0.28497822296240233,"score_spread":0.2706113103181111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158013313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22379476,0.00007456706,0.7733001,0.001644046,0.0010104082,0.00002782264,0.00000886396,0.000013761371,0.00012566218],"genre_scores_gemma":[0.7551937,0.000117222946,0.24445143,0.00010813032,0.00010399323,6.6663483e-7,0.000004457499,0.000003257134,0.00001714072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983303,0.00005021593,0.00060644624,0.000181924,0.00071286847,0.000118232376],"domain_scores_gemma":[0.996624,0.00014976853,0.00061257544,0.00029082573,0.0022507769,0.000072039176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052621344,0.00008344631,0.00018168737,0.0005562095,0.00012768361,0.00031934705,0.0013961854,0.000020958936,0.00001431665],"category_scores_gemma":[0.000173368,0.00007909733,0.000071187,0.00081764633,0.00038849362,0.0020445285,0.000501653,0.00007708318,9.4993925e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007402383,0.0003362848,0.0024052188,0.00002306923,0.00012853202,0.000030919768,0.002391385,0.00393437,0.09999858,0.774386,0.000116724914,0.11624154],"study_design_scores_gemma":[0.0017268467,0.00029663436,0.14031596,0.0006063897,0.000045420333,0.0017102138,0.00016092858,0.6531101,0.13965619,0.057956234,0.003963265,0.00045184392],"about_ca_topic_score_codex":0.0000043653336,"about_ca_topic_score_gemma":0.0000015677304,"teacher_disagreement_score":0.71642977,"about_ca_system_score_codex":0.00003761402,"about_ca_system_score_gemma":0.0006209204,"threshold_uncertainty_score":0.32254952},"labels":[],"label_agreement":null},{"id":"W3159641609","doi":"10.48550/arxiv.2105.01179","title":"Degrees of Restriction for Two-Dimensional Automata","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Automaton; Closure (psychology); Deterministic automaton; Nested word; Computer science; Automata theory; Mobile automaton; ω-automaton; Bounded function; Quantum finite automata; Discrete mathematics; Alphabet; Mathematics; Algorithm; Theoretical computer science","score_opus":0.06975635240950788,"score_gpt":0.1995490897455659,"score_spread":0.129792737336058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159641609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5238947,0.00008698291,0.47457898,0.00004939658,0.0006660706,0.00019195878,0.000027869688,0.00019322828,0.00031082355],"genre_scores_gemma":[0.9829397,0.000035731373,0.01654558,0.00003574931,0.000058905443,0.0000013592594,0.00005177369,0.000012594091,0.00031855627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855447,0.00009917663,0.00021002608,0.00080830377,0.00009893145,0.00022911112],"domain_scores_gemma":[0.9980726,0.00023253824,0.00028409134,0.0011000973,0.00022594466,0.000084685445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000275387,0.00020831157,0.00030935014,0.0002074958,0.00010152599,0.00007082184,0.0012056587,0.00017992187,0.000016488872],"category_scores_gemma":[0.00004734388,0.0002370462,0.0002569983,0.00040866953,0.0000702567,0.00032082843,0.0016092889,0.00021805096,0.0000067542496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003671543,0.00018171486,0.00044704461,0.00014844153,0.00012558751,0.00012398079,0.00011263838,0.5525981,0.0008834279,0.4433439,0.00055232894,0.0014460912],"study_design_scores_gemma":[0.0005943667,0.000053301683,0.0018616361,0.00014390063,0.000054159136,0.000006230357,0.000045771118,0.9662556,0.00095411594,0.029686049,0.00007366512,0.00027118422],"about_ca_topic_score_codex":0.00015871767,"about_ca_topic_score_gemma":0.000027481794,"teacher_disagreement_score":0.45904505,"about_ca_system_score_codex":0.00009038395,"about_ca_system_score_gemma":0.0002558198,"threshold_uncertainty_score":0.9666464},"labels":[],"label_agreement":null},{"id":"W3159934812","doi":"10.11575/cdm.v16i1.69831","title":"Lengths of extremal square-free ternary words","year":2020,"lang":"en","type":"article","venue":"University of Calgary","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Ternary operation; Word (group theory); Square (algebra); Alphabet; Square-free integer; Mathematics; Combinatorics; Sigma; Discrete mathematics; Geometry; Computer science; Linguistics; Physics; Philosophy","score_opus":0.011476607508859989,"score_gpt":0.17807640045272488,"score_spread":0.1665997929438649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159934812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28314435,0.00029013402,0.6892286,0.0022035923,0.0001343829,0.00011000604,0.000010631306,0.00018304074,0.024695272],"genre_scores_gemma":[0.96492904,0.000024784635,0.034482453,0.00025899903,0.000025555912,2.9102855e-8,0.0000020888638,0.0000044986,0.00027256543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939954,0.000039094346,0.00009100013,0.0001792643,0.00018252652,0.0001085984],"domain_scores_gemma":[0.99936163,0.00006040431,0.000081383325,0.00038008628,0.00003395931,0.000082538165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007361541,0.00006835193,0.00015090586,0.000048998918,0.0000382541,0.0000056162967,0.0012261239,0.00004264782,0.000098213466],"category_scores_gemma":[0.00002068673,0.000077074415,0.000087901506,0.00018055292,0.00009447577,0.00025455598,0.0006345388,0.00007516017,0.000013580657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047003926,0.0005356176,0.013184493,0.0005109124,0.00022432678,0.0010557459,0.025645556,0.0001575958,0.03179435,0.5515906,0.030726427,0.34410432],"study_design_scores_gemma":[0.0092124,0.0022004684,0.08558945,0.00051060825,0.00016239047,0.000060245897,0.0055198753,0.7411429,0.035290744,0.028193494,0.09039517,0.0017222564],"about_ca_topic_score_codex":0.00009320423,"about_ca_topic_score_gemma":0.000004004864,"teacher_disagreement_score":0.74098533,"about_ca_system_score_codex":0.000010677459,"about_ca_system_score_gemma":0.00004206017,"threshold_uncertainty_score":0.31430036},"labels":[],"label_agreement":null},{"id":"W3161227694","doi":"10.11575/cdm.v16i1.70710","title":"Symmetric association schemes arising from abstract regular polytopes","year":2020,"lang":"en","type":"article","venue":"University of Calgary","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Coxeter group; Mathematics; Combinatorics; Polytope; Coset; Vertex (graph theory); Type (biology); Symmetric group; Graph","score_opus":0.010077732651104067,"score_gpt":0.17369821090648002,"score_spread":0.16362047825537596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161227694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6576789,0.00048606782,0.32825884,0.003100737,0.00013440465,0.00007879006,0.000008853672,0.00025047697,0.010002949],"genre_scores_gemma":[0.9718884,0.000028965904,0.02746596,0.00038157767,0.000036519617,1.4633486e-8,0.0000071378445,0.0000033649014,0.00018803918],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994167,0.000027735563,0.000072597424,0.00017803957,0.0002004854,0.00010445945],"domain_scores_gemma":[0.99949867,0.00012328553,0.000117706055,0.00015582958,0.00003806999,0.000066420034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010253488,0.00005752799,0.00011871991,0.00006119951,0.000072654635,0.000026431835,0.00046395353,0.000061117054,0.000058502705],"category_scores_gemma":[0.000058903228,0.00006820237,0.000063297826,0.00029014872,0.000018607547,0.00035784906,0.00017334496,0.000087887456,0.000038251466],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010488149,0.00029965164,0.035987087,0.00010134088,0.00053818454,0.00039331825,0.00880683,0.00008305449,0.0759484,0.24768068,0.020896338,0.60916024],"study_design_scores_gemma":[0.0033327742,0.00027907346,0.469507,0.00019775752,0.00017619754,0.0000034961897,0.0017584524,0.27839157,0.07548874,0.021567082,0.14803891,0.0012589518],"about_ca_topic_score_codex":0.00026710925,"about_ca_topic_score_gemma":0.0000023028952,"teacher_disagreement_score":0.6079013,"about_ca_system_score_codex":0.00005045562,"about_ca_system_score_gemma":0.000032661843,"threshold_uncertainty_score":0.27812117},"labels":[],"label_agreement":null},{"id":"W3169538887","doi":"10.1017/jsl.2021.38","title":"CONTRIBUTIONS TO THE THEORY OF <i>F</i>-AUTOMATIC SETS","year":2021,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Endomorphism; Injective function; NIP; Abelian group; Mathematics; Automaticity; Prime (order theory); Combinatorics; Set (abstract data type); Multiplication (music); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.015106567953820968,"score_gpt":0.27411389948587456,"score_spread":0.2590073315320536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169538887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3611269,0.004611237,0.60097915,0.028418811,0.0014745587,0.00019969494,0.00002638409,0.0000714025,0.0030918808],"genre_scores_gemma":[0.9912088,0.00005669354,0.0058674556,0.0026512956,0.00012258458,0.000002027108,4.3786946e-7,0.0000044275985,0.00008630176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862146,0.00030310644,0.00046394445,0.00010783542,0.00031173808,0.00019191415],"domain_scores_gemma":[0.99821943,0.00048021437,0.00032051335,0.00044468517,0.00043460418,0.00010057447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014639042,0.00009106703,0.00027985265,0.000084276995,0.00008982722,0.00007049627,0.00093399285,0.00004024346,0.000064290856],"category_scores_gemma":[0.0005711777,0.00005246558,0.00016817357,0.0005065054,0.000048237303,0.00019027002,0.00020616838,0.00017128182,0.00003421108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072007906,0.00017816984,0.00011442388,0.000022534003,0.00010351666,0.00015002642,0.0017697434,0.00025657722,0.008970958,0.93910867,0.0056917337,0.043626443],"study_design_scores_gemma":[0.0009937984,0.00038479778,0.016284766,0.0003174003,0.00009593977,0.002993839,0.0012092196,0.0050161304,0.029652063,0.93262726,0.010138058,0.00028670253],"about_ca_topic_score_codex":0.0000012841816,"about_ca_topic_score_gemma":8.149939e-7,"teacher_disagreement_score":0.6300819,"about_ca_system_score_codex":0.000035371708,"about_ca_system_score_gemma":0.00021382642,"threshold_uncertainty_score":0.21394843},"labels":[],"label_agreement":null},{"id":"W3169850973","doi":"10.1142/s0129054121420028","title":"Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lexicographical order; Regular language; Mathematics; State (computer science); Combinatorics; Word (group theory); Discrete mathematics; Computer science; Automaton; Artificial intelligence; Algorithm","score_opus":0.012540010066171578,"score_gpt":0.2983123553723818,"score_spread":0.28577234530621026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169850973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5214005,0.00017182187,0.47608078,0.001561971,0.0005985225,0.00001977,6.8574474e-7,0.000009239744,0.00015671695],"genre_scores_gemma":[0.7888292,0.00004966511,0.2108567,0.00016104846,0.00009502386,2.267452e-7,7.574066e-7,0.0000025311983,0.000004843437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833226,0.000067032415,0.0005377183,0.00023702206,0.0006679937,0.00015798262],"domain_scores_gemma":[0.9980848,0.00026820615,0.0003880581,0.00021705493,0.00096580153,0.00007610061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013239185,0.00008670634,0.00017585643,0.00068643806,0.00008561063,0.00043267928,0.0015948266,0.000027376485,0.000007945368],"category_scores_gemma":[0.00021514155,0.000082201346,0.00006606272,0.0009797541,0.00029034246,0.0011085476,0.00056298333,0.00015313257,8.303572e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017571829,0.0003133932,0.03504903,0.000019499186,0.000095061565,0.00043867575,0.003667397,0.0038511027,0.016066449,0.23945902,0.00004589292,0.7009769],"study_design_scores_gemma":[0.0029119242,0.000369831,0.3788392,0.0018396464,0.00002565728,0.0040730224,0.0010583361,0.48794764,0.031113574,0.09017645,0.00090182346,0.0007429093],"about_ca_topic_score_codex":0.000014640516,"about_ca_topic_score_gemma":0.000016319142,"teacher_disagreement_score":0.700234,"about_ca_system_score_codex":0.000047465215,"about_ca_system_score_gemma":0.0003323632,"threshold_uncertainty_score":0.41723362},"labels":[],"label_agreement":null},{"id":"W3176232965","doi":"10.1007/978-3-030-79121-6_7","title":"Degrees of Restriction for Two-Dimensional Automata","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Automaton; Computer science; Closure (psychology); Mobile automaton; Deterministic automaton; Automata theory; Nested word; ω-automaton; Quantum finite automata; Deterministic finite automaton; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics","score_opus":0.01989656258438412,"score_gpt":0.25560705739146267,"score_spread":0.23571049480707854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176232965","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004453798,0.0006129853,0.99555063,0.00037210566,0.0018864041,0.00030842065,0.000017384586,0.00014552013,0.00066114176],"genre_scores_gemma":[0.0764744,0.000026762726,0.9220151,0.00058068975,0.000479437,0.000015249378,0.000024906583,0.000036824684,0.00034667872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700344,0.00003120803,0.0005296689,0.0011890352,0.00080389564,0.0004427351],"domain_scores_gemma":[0.99701214,0.0008930771,0.00034669062,0.0012923804,0.00035266095,0.000103064966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008631375,0.00036389724,0.0005067937,0.00059116585,0.00017504604,0.00021707865,0.002204411,0.0002154373,0.000015695845],"category_scores_gemma":[0.00012787516,0.00033180512,0.00018420191,0.0005165348,0.00040910023,0.00044176294,0.0011250316,0.00033828936,0.0000067401907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012045547,0.000064938955,0.000019487474,0.000091908776,0.000023806608,0.000055867342,0.00019740201,0.13129686,0.001999485,0.2784535,0.000096524716,0.58768815],"study_design_scores_gemma":[0.00039252505,0.00016268744,0.00013623283,0.00044834302,0.00000972602,0.000063633386,1.0707358e-7,0.8478768,0.003870499,0.14624001,0.00040495335,0.00039447556],"about_ca_topic_score_codex":0.000023400207,"about_ca_topic_score_gemma":0.000034152217,"teacher_disagreement_score":0.71658,"about_ca_system_score_codex":0.00014121688,"about_ca_system_score_gemma":0.0006283479,"threshold_uncertainty_score":0.9999134},"labels":[],"label_agreement":null},{"id":"W3183377724","doi":"10.1007/s00236-021-00399-6","title":"On the size of partial derivatives and the word membership problem","year":2021,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Fundação para a Ciência e a Tecnologia; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Word (group theory); Computer science; Mathematics; Linguistics; Algorithm; Philosophy","score_opus":0.011602762286817978,"score_gpt":0.21218272425894133,"score_spread":0.20057996197212336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183377724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8168854,0.0001742591,0.014370631,0.056087844,0.00023384247,0.0006620389,0.000004961023,0.00015521386,0.11142579],"genre_scores_gemma":[0.9941646,0.000014178964,0.003447635,0.002267126,0.000011832594,0.000015844184,3.8445708e-7,0.0000023345253,0.000076085766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928993,0.00010374455,0.00022087504,0.00007263113,0.00017867557,0.00013416095],"domain_scores_gemma":[0.99702233,0.0023638865,0.000110464665,0.0004401008,0.000036787358,0.000026432923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056091626,0.00007463815,0.00012080045,0.0000114908125,0.000112538895,0.00013584587,0.0004749204,0.000022681214,0.00008430855],"category_scores_gemma":[0.0005007284,0.000034692177,0.000038827828,0.0001825592,0.00018967708,0.0003685356,0.00025972287,0.000099525554,0.000012018889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013126026,0.000013219654,0.0000106837715,0.000023521021,0.000022610539,8.137813e-7,0.00999752,0.0000045838588,0.00008927456,0.9824948,0.0008771376,0.0064527183],"study_design_scores_gemma":[0.0029383264,0.00018161316,0.0035894606,0.00039116296,0.00004473634,0.00009021196,0.007463969,0.116394676,0.054844268,0.7953657,0.018184029,0.0005118837],"about_ca_topic_score_codex":0.0000026219825,"about_ca_topic_score_gemma":7.221756e-7,"teacher_disagreement_score":0.18712912,"about_ca_system_score_codex":0.00000431788,"about_ca_system_score_gemma":0.000039270606,"threshold_uncertainty_score":0.14147058},"labels":[],"label_agreement":null},{"id":"W3183587779","doi":"10.55016/ojs/cdm.v16i2.71729","title":"Reconstructing the topology on monoids and polymorphism clones of reducts of the rationals","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rational number; Monoid; Endomorphism; Mathematics; Combinatorics","score_opus":0.011116799403799933,"score_gpt":0.2674111510308947,"score_spread":0.25629435162709474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183587779","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80370754,0.00064626784,0.16048051,0.03267952,0.00056112657,0.00037630618,0.00016959477,0.00003992128,0.0013392292],"genre_scores_gemma":[0.9879912,0.000012734844,0.011597776,0.00021491328,0.000038340826,0.000010956462,0.0000021428887,0.000003955598,0.00012794205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991659,0.00010963649,0.00031160619,0.00014347924,0.00014068087,0.00012873349],"domain_scores_gemma":[0.99837136,0.0006180144,0.00018273761,0.000598007,0.0001976758,0.000032225405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003855848,0.00008023084,0.00018580367,0.000033334047,0.00018277783,0.000035367215,0.0003960162,0.00003978109,0.000012061385],"category_scores_gemma":[0.0010049692,0.000047191188,0.00006334795,0.0003126599,0.00018480099,0.000066879904,0.00028932063,0.000077672994,0.0000024791245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012928062,0.000025633593,0.00008205228,0.000015244584,0.000020772653,6.1787676e-7,0.00095492415,0.000023607496,0.011912752,0.9857627,0.000164437,0.001035974],"study_design_scores_gemma":[0.0004676672,0.00007530849,0.0028277223,0.00031767032,0.000057375193,0.00020177366,0.0018980642,0.018291138,0.3833062,0.59185153,0.00049364025,0.0002119388],"about_ca_topic_score_codex":0.000005155668,"about_ca_topic_score_gemma":0.0000017819418,"teacher_disagreement_score":0.39391118,"about_ca_system_score_codex":0.00001573142,"about_ca_system_score_gemma":0.00009182598,"threshold_uncertainty_score":0.19244008},"labels":[],"label_agreement":null},{"id":"W3186614868","doi":"","title":"Mesosome Avoidance.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alphabet; Conjugate; Mathematics; Combinatorics; Pure mathematics; Mathematical analysis; Philosophy; Linguistics","score_opus":0.05169880687379649,"score_gpt":0.1681797954940208,"score_spread":0.1164809886202243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186614868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36902392,0.00037056618,0.6235512,0.00016096322,0.0011136128,0.00013314538,0.000008124553,0.0005049872,0.005133467],"genre_scores_gemma":[0.9939382,0.00025075141,0.0028942889,0.00029795853,0.00010095511,7.2766017e-7,0.00001667654,0.000017758692,0.0024826692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793553,0.0001668266,0.00017222058,0.0012479326,0.00009971318,0.00037777497],"domain_scores_gemma":[0.99754703,0.000102409664,0.00018201293,0.0018840827,0.00011747238,0.00016696333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024444278,0.00030518757,0.0003549684,0.00016955829,0.00013804957,0.00028042297,0.0025276565,0.0002719251,0.00011234325],"category_scores_gemma":[0.000027849836,0.0003566927,0.00027821076,0.00055596296,0.00008755805,0.00050073885,0.0036206862,0.0005910118,0.0001544714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000107985215,0.00017270296,0.0010783431,0.00013704345,0.00017180461,0.0025288463,0.0006470319,0.04550671,0.00030890986,0.94519186,0.0011444618,0.003101514],"study_design_scores_gemma":[0.0006757327,0.00004783094,0.0027707457,0.00033150124,0.000083836974,0.000034629116,0.0003356804,0.75932634,0.0015293133,0.23088793,0.0026622228,0.0013142038],"about_ca_topic_score_codex":0.00006871731,"about_ca_topic_score_gemma":0.00001590772,"teacher_disagreement_score":0.7143039,"about_ca_system_score_codex":0.00014467689,"about_ca_system_score_gemma":0.00023400593,"threshold_uncertainty_score":0.9998885},"labels":[],"label_agreement":null},{"id":"W3189147489","doi":"10.1051/ita/2022006","title":"Automatic sequences of rank two","year":2022,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Decidability; Rank (graph theory); Concatenation (mathematics); Property (philosophy); Combinatorics; Class (philosophy); Mathematics; Word (group theory); Set (abstract data type); Integer (computer science); Discrete mathematics; Computer science; Artificial intelligence; Linguistics","score_opus":0.0063962751302120155,"score_gpt":0.2407304873681937,"score_spread":0.23433421223798168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189147489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056705605,0.0001507305,0.929541,0.00071567326,0.000044607536,0.0003766327,0.00003417395,0.00018049519,0.012251104],"genre_scores_gemma":[0.95254827,0.00001641218,0.04673259,0.000429973,0.000015887876,0.00022801865,0.000008323462,0.00000484637,0.000015706573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990032,0.000049387974,0.00041547528,0.00010943027,0.0002517289,0.00017078276],"domain_scores_gemma":[0.9990223,0.00025702873,0.00014939735,0.00045232242,0.000036743633,0.00008217822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052373274,0.00009698668,0.00016355036,0.000073823874,0.0002960112,0.00007429885,0.0006597178,0.000019857816,0.00029704886],"category_scores_gemma":[0.000014099906,0.000082850886,0.00004985622,0.00032074112,0.0003700486,0.00021435873,0.0004868002,0.0001289962,0.000016846221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.1813073e-7,0.00004029039,0.000013413672,0.000028021472,0.0000066888633,2.2379963e-7,0.0006661302,0.00016352489,0.00017011006,0.95904535,0.00007345806,0.039791998],"study_design_scores_gemma":[0.00019071464,0.000044896053,0.000038692466,0.0000059611048,0.000007666336,0.000029127988,0.00046004105,0.5431325,0.00044775457,0.4528938,0.002647448,0.000101412974],"about_ca_topic_score_codex":0.000002342992,"about_ca_topic_score_gemma":8.5996916e-8,"teacher_disagreement_score":0.8958426,"about_ca_system_score_codex":0.000016642227,"about_ca_system_score_gemma":0.00004005403,"threshold_uncertainty_score":0.3378561},"labels":[],"label_agreement":null},{"id":"W3196411836","doi":"10.1016/j.tcs.2022.03.013","title":"Positive planar satisfiability problems under 3-connectivity constraints","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Bangladesh University of Engineering and Technology","keywords":"Combinatorics; Mathematics; Planar graph; Planarity testing; Satisfiability; Discrete mathematics; Planar; Matching (statistics); Graph; Time complexity; Computer science","score_opus":0.009563311863093891,"score_gpt":0.2284865948402183,"score_spread":0.2189232829771244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196411836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14205226,0.000017983926,0.8513893,0.0018977924,0.0006642787,0.00029349627,0.000020672811,0.0003381548,0.003326042],"genre_scores_gemma":[0.96142364,6.3915763e-7,0.036674023,0.0018006669,0.000055121036,0.00002960188,0.0000023798698,0.00000847654,0.0000054365087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962586,0.00051696145,0.00030205384,0.0011177107,0.001065964,0.0007387197],"domain_scores_gemma":[0.99767786,0.0007569758,0.00010023081,0.0010655643,0.00011521696,0.00028416328],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0037477922,0.00022699941,0.00026479102,0.00017774841,0.0013825173,0.0003731575,0.0031039456,0.000035326262,0.00031918875],"category_scores_gemma":[0.00007407601,0.0002037538,0.000092537455,0.0013532158,0.004814401,0.00066985894,0.0022753545,0.00042532446,0.000042492007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006671807,0.00013656818,0.0001338778,0.0000041395047,0.000006285751,0.000017225442,0.00067120476,0.0008881727,0.0009854828,0.96594965,0.00004122612,0.031159462],"study_design_scores_gemma":[0.00025782196,0.00032144415,0.0066647525,0.000009969093,0.000003696356,0.00018840234,0.000046378795,0.2898913,0.0013198872,0.70095474,0.000041284227,0.0003003444],"about_ca_topic_score_codex":0.00001511294,"about_ca_topic_score_gemma":9.951813e-7,"teacher_disagreement_score":0.8193714,"about_ca_system_score_codex":0.00024068938,"about_ca_system_score_gemma":0.0002662609,"threshold_uncertainty_score":0.99991757},"labels":[],"label_agreement":null},{"id":"W3199131588","doi":"10.1142/s0129054121420090","title":"Space Complexity of Stack Automata Models","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decidability; Automaton; Measure (data warehouse); Stack (abstract data type); Bounded function; Computer science; Word (group theory); Discrete mathematics; Function (biology); Mathematics; Pushdown automaton; Theoretical computer science; Programming language","score_opus":0.051088884067070364,"score_gpt":0.31622316539600487,"score_spread":0.2651342813289345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199131588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080399424,0.00006807042,0.9142918,0.0026489976,0.0017408971,0.000033328055,0.000009191063,0.000018866467,0.00078943354],"genre_scores_gemma":[0.6471613,0.000022707247,0.35262802,0.00009113832,0.00007769825,2.764861e-7,0.0000013568798,0.0000025669815,0.000014887641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974704,0.00006601137,0.00070454075,0.00022737842,0.0013707547,0.000160925],"domain_scores_gemma":[0.9949333,0.00018360738,0.0008010519,0.0005138468,0.0034720947,0.000096111085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010280322,0.00010078465,0.00024398397,0.00044974912,0.00008444416,0.00026503883,0.0034422847,0.000025155994,0.000027357186],"category_scores_gemma":[0.00012668657,0.000093323164,0.00014276126,0.0008002124,0.0006770081,0.0026630359,0.00080036424,0.00011725585,0.00000398321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009485984,0.00030854307,0.00013771112,0.000010132244,0.00006883455,0.00003331388,0.0006873613,0.013164955,0.010807064,0.94034445,0.00029953115,0.03412864],"study_design_scores_gemma":[0.0005735988,0.000121799436,0.0041825688,0.00015553889,0.000008595559,0.00045104828,0.000042057,0.737878,0.040895704,0.21502294,0.0005386059,0.00012950873],"about_ca_topic_score_codex":0.0000134124875,"about_ca_topic_score_gemma":0.000002853246,"teacher_disagreement_score":0.7253215,"about_ca_system_score_codex":0.00008395932,"about_ca_system_score_gemma":0.0010066058,"threshold_uncertainty_score":0.63966787},"labels":[],"label_agreement":null},{"id":"W3200958393","doi":"10.4153/s0008439521000564","title":"On semidirectly closed pseudovarieties of finite semigroups and monoids","year":2021,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Semigroup; Combinatorics","score_opus":0.006739570748546352,"score_gpt":0.189201737907681,"score_spread":0.18246216715913463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200958393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7208917,0.0015853456,0.13832918,0.026957996,0.00041428578,0.00048510366,0.000088510256,0.00037434342,0.11087349],"genre_scores_gemma":[0.9793142,0.000023383032,0.016742025,0.0019590028,0.000030141839,0.000011934702,0.000004574387,0.000017751881,0.0018969612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876386,0.00008944601,0.00027738346,0.00033387018,0.00020009659,0.00033531722],"domain_scores_gemma":[0.9981087,0.0008272067,0.000058269612,0.0005632834,0.00007381503,0.0003687113],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003424306,0.00015933835,0.0002863753,0.00010843742,0.00008887436,0.00010726993,0.00036885028,0.000105379855,0.0016687],"category_scores_gemma":[0.0005862633,0.00014866715,0.000067795714,0.00022356975,0.00011140796,0.00004525598,0.00010589438,0.00015594436,0.00066870864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003141946,0.00004574577,0.000025274343,0.000105536266,0.000021289916,0.0001341067,0.0006287635,0.000012591318,0.0005426301,0.98577017,0.008353394,0.0043573333],"study_design_scores_gemma":[0.0007256261,0.00019091085,0.00074545643,0.00050425384,0.00003114629,0.000183708,0.0003738751,0.02619653,0.018738408,0.9183232,0.0332637,0.00072313874],"about_ca_topic_score_codex":0.00021601934,"about_ca_topic_score_gemma":0.00013406314,"teacher_disagreement_score":0.2584225,"about_ca_system_score_codex":0.000042935088,"about_ca_system_score_gemma":0.00018580335,"threshold_uncertainty_score":0.9992439},"labels":[],"label_agreement":null},{"id":"W3202595936","doi":"10.1142/s0218196723500133","title":"Cogrowth series for free products of finite groups","year":2022,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Generating set of a group; Cayley graph; Alphabet; Symmetric group; Free product; Group (periodic table); Discrete mathematics; Graph","score_opus":0.010833698914913082,"score_gpt":0.24161646759643685,"score_spread":0.23078276868152375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202595936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38249394,0.00032379333,0.61216795,0.0036136087,0.0012299055,0.000083779094,0.000019362209,0.000015554337,0.000052082847],"genre_scores_gemma":[0.97382706,0.000015915479,0.025798744,0.00018036364,0.00014146137,0.0000044585186,0.000007150533,0.0000043437703,0.000020519767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991098,0.000048048954,0.000303112,0.00010205203,0.00037194762,0.00006505415],"domain_scores_gemma":[0.9989099,0.0001783907,0.00038799777,0.000076418386,0.00042240266,0.000024903744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004000127,0.00005834541,0.00011202205,0.00017075316,0.000070411545,0.000062681545,0.0006015475,0.000011605396,0.0000062172726],"category_scores_gemma":[0.00009835892,0.00005468342,0.000052159823,0.0001207756,0.000028912535,0.0004983243,0.00022636128,0.000073389165,2.1950699e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004598539,0.00034151506,0.0008352699,0.000061426115,0.00032942483,0.000051081697,0.004742694,0.011108933,0.005340435,0.81608194,0.0041599297,0.15648748],"study_design_scores_gemma":[0.0024049997,0.0014364216,0.0068122097,0.00005562129,0.000026779086,0.0008452457,0.00062809704,0.09679298,0.0075429697,0.8797295,0.0035165506,0.00020859204],"about_ca_topic_score_codex":0.0000021547958,"about_ca_topic_score_gemma":3.2853265e-7,"teacher_disagreement_score":0.5913331,"about_ca_system_score_codex":0.000023947834,"about_ca_system_score_gemma":0.000060387396,"threshold_uncertainty_score":0.22299251},"labels":[],"label_agreement":null},{"id":"W3203615789","doi":"10.1090/tran/8671","title":"Simultaneous rational approximation to successive powers of a real number","year":2022,"lang":"lv","type":"article","venue":"Transactions of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.009436427657698511,"score_gpt":0.2602173234816138,"score_spread":0.2507808958239153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203615789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19059284,0.000011512539,0.8052924,0.0023263008,0.00017927497,0.0004960356,0.00018627178,0.0000533006,0.00086205464],"genre_scores_gemma":[0.9487161,0.000012204571,0.05021682,0.00040837214,0.000022815444,0.000066059205,0.000003133268,0.000020960475,0.00053356134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997391,0.00030803555,0.0006699313,0.00035885442,0.0009614318,0.00031078444],"domain_scores_gemma":[0.99691576,0.0013726015,0.00067348965,0.0007729123,0.00015091026,0.00011432241],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000599609,0.00021574229,0.0005210056,0.00003747902,0.0005127341,0.00003970547,0.0012936571,0.000038382623,0.00091882463],"category_scores_gemma":[0.000090071386,0.00017790971,0.0006871935,0.0014891843,0.0006924263,0.00015936926,0.0001842872,0.00034786732,0.000025194155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050526747,0.007571723,0.00023233505,0.001434361,0.0018862536,0.000009742357,0.14085561,0.39659595,0.033163957,0.34550527,0.0033655418,0.06887397],"study_design_scores_gemma":[0.00056456943,0.00055076584,0.0003199086,0.00011696469,0.0002510211,0.00005905868,0.015187963,0.9427906,0.0041421903,0.035277028,0.00026564373,0.00047425297],"about_ca_topic_score_codex":0.00022582806,"about_ca_topic_score_gemma":0.0000022166164,"teacher_disagreement_score":0.7581232,"about_ca_system_score_codex":0.00018465222,"about_ca_system_score_gemma":0.00020968706,"threshold_uncertainty_score":0.99999446},"labels":[],"label_agreement":null},{"id":"W3206558031","doi":"10.37236/10799","title":"Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Modulo; Catalan number; Congruence (geometry); Automaton; Combinatorics; Prime (order theory); Discrete mathematics; Congruence relation; Theoretical computer science; Computer science","score_opus":0.005608120209821498,"score_gpt":0.19187676655686822,"score_spread":0.18626864634704673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206558031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9622311,0.018814912,0.009801708,0.0057354583,0.002740253,0.0003429792,0.0000013337823,0.000056295474,0.00027595766],"genre_scores_gemma":[0.99919116,0.00047046554,0.00002042775,0.00014374034,0.000065763605,0.000013905856,2.1854936e-7,0.000012178219,0.000082150655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970348,0.0008205693,0.0006019447,0.00017389035,0.0008869157,0.00048187427],"domain_scores_gemma":[0.9979868,0.0004643578,0.000786831,0.00047756906,0.00022444375,0.000059982256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004417279,0.00018425286,0.0004278276,0.0001016788,0.00055955094,0.00010388636,0.002295425,0.000040410465,0.000010065963],"category_scores_gemma":[0.00011426103,0.000096043535,0.00015125645,0.00058052083,0.000418066,0.0003778767,0.0005525646,0.00086242874,0.0000010812983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001390442,0.00009826408,0.00013926784,0.0000148891595,0.00010050983,0.000007721694,0.0016090887,0.000102454345,0.0016606626,0.9952727,0.0002206237,0.00063477276],"study_design_scores_gemma":[0.0026944587,0.00075778534,0.00012519544,0.00003270039,0.000062536026,0.00091557374,0.00044316432,0.014403247,0.0072795944,0.97136843,0.0017332801,0.000184046],"about_ca_topic_score_codex":0.000064952066,"about_ca_topic_score_gemma":0.0000014031044,"teacher_disagreement_score":0.036960047,"about_ca_system_score_codex":0.00019663012,"about_ca_system_score_gemma":0.000604617,"threshold_uncertainty_score":0.43036702},"labels":[],"label_agreement":null},{"id":"W3209834539","doi":"10.1216/rmj.2023.53.755","title":"SYMBOLIC SUBSTITUTIONS, BRATTELI DIAGRAMS AND OPERATOR ALGEBRAS","year":2023,"lang":"en","type":"article","venue":"Rocky Mountain Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Equivalence relation; Equivalence (formal languages); Pure mathematics; Invariant (physics); Operator (biology); Fibonacci number; Algebra over a field; Discrete mathematics","score_opus":0.0137436395996189,"score_gpt":0.24558725532972486,"score_spread":0.23184361573010595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209834539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8015925,0.0006972877,0.1960734,0.0010531964,0.0002708395,0.000088784414,0.0000026490727,0.00011065615,0.000110680805],"genre_scores_gemma":[0.9715016,0.0003800284,0.02746902,0.00030134595,0.00017700969,0.000003884121,0.0000011567995,0.000017511267,0.00014847008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987037,0.000059230162,0.00049163913,0.00013670186,0.00035886283,0.0002498365],"domain_scores_gemma":[0.99885875,0.00030157427,0.00024979174,0.0003151771,0.00012363044,0.00015109188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010468743,0.000144599,0.00028923372,0.00021191564,0.0001725117,0.00025304663,0.00067218655,0.00005862723,0.000013768129],"category_scores_gemma":[0.00020738963,0.00011144479,0.00007880564,0.000500252,0.0000531169,0.00052093144,0.00020738841,0.00018015903,0.00008595348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005260711,0.00030169022,0.0019001559,0.00025719614,0.00015635071,0.00037970472,0.0074385353,0.00042746207,0.0048363297,0.9594442,0.008975172,0.015877925],"study_design_scores_gemma":[0.0026454371,0.00064160116,0.008297098,0.0012262345,0.00016613814,0.005818397,0.006735528,0.25412342,0.014369393,0.69402975,0.010601938,0.0013450901],"about_ca_topic_score_codex":0.0000019019836,"about_ca_topic_score_gemma":0.0000012073926,"teacher_disagreement_score":0.2654145,"about_ca_system_score_codex":0.000036196132,"about_ca_system_score_gemma":0.000089511654,"threshold_uncertainty_score":0.45445865},"labels":[],"label_agreement":null},{"id":"W3212109522","doi":"10.5802/crmath.408","title":"Prefixes of the Fibonacci word that end with a cube","year":2023,"lang":"en","type":"article","venue":"Comptes Rendus Mathématique","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Prefix; Word (group theory); Mathematics; Cube (algebra); Combinatorics; Arithmetic; Pisano period; Fibonacci polynomials; Discrete mathematics; Geometry; Linguistics","score_opus":0.0173094521457045,"score_gpt":0.22189025039074295,"score_spread":0.20458079824503844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212109522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9672808,0.00046352245,0.022718797,0.002329678,0.00042574308,0.0004094857,0.000019310874,0.0008611398,0.0054914895],"genre_scores_gemma":[0.9932249,0.000049151517,0.005708856,0.0001895313,0.00002932059,0.00003766446,0.0000039229935,0.00001751721,0.00073913817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987749,0.000115662006,0.00021002498,0.00028665166,0.00033531227,0.00027747997],"domain_scores_gemma":[0.99841636,0.00031314173,0.0001787333,0.0009944823,0.000043550903,0.000053754695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030582654,0.00016897026,0.00023191446,0.00009660484,0.00011703172,0.00009490009,0.0014226486,0.0000630093,0.0000809904],"category_scores_gemma":[0.000031174044,0.00009994635,0.00008321223,0.00073700194,0.00010944823,0.0002463253,0.0005829265,0.00016807423,0.000103668885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005190712,0.0003669763,0.02330146,0.0006015129,0.00028361822,0.000104796214,0.012488752,0.0014086574,0.015395114,0.7179364,0.10635503,0.12170581],"study_design_scores_gemma":[0.0018802916,0.00039400515,0.4367768,0.0019433426,0.00006453647,0.000346258,0.0011175309,0.1615807,0.19598739,0.16559139,0.032709375,0.0016083892],"about_ca_topic_score_codex":0.000023541454,"about_ca_topic_score_gemma":0.000012140386,"teacher_disagreement_score":0.552345,"about_ca_system_score_codex":0.000019204961,"about_ca_system_score_gemma":0.00006675952,"threshold_uncertainty_score":0.4075694},"labels":[],"label_agreement":null},{"id":"W3212859878","doi":"10.1137/23m1558513","title":"Extending Dekking’s Construction of an Infinite Binary Word Avoiding Abelian 4-Powers","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Thompson Rivers University; University of Winnipeg","funders":"","keywords":"Abelian group; Word (group theory); Binary number; Construct (python library); Mathematics; Binary operation; Omega; Exponent; Discrete mathematics; Combinatorics; Pure mathematics; Arithmetic; Computer science; Physics; Linguistics; Quantum mechanics; Geometry","score_opus":0.01647246899495382,"score_gpt":0.2752870181134576,"score_spread":0.2588145491185038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212859878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57071245,0.0007264859,0.4223377,0.00045144418,0.0020404512,0.0001386023,0.000008327814,0.00032558478,0.0032589212],"genre_scores_gemma":[0.8583197,0.0001396081,0.14120728,0.0000701378,0.00015823702,0.0000023456764,0.0000017497501,0.000031527845,0.00006938851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823546,0.00012921749,0.00059305225,0.00025787766,0.00047361702,0.00031076645],"domain_scores_gemma":[0.99870354,0.00034719147,0.00029558822,0.0004319805,0.000055259978,0.00016642862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013512026,0.00021276163,0.00028403857,0.00047618445,0.0002527105,0.0005950357,0.00067631254,0.000076857476,0.000053286414],"category_scores_gemma":[0.000110871544,0.00016611183,0.00016923713,0.0005501566,0.00009728493,0.0010222669,0.00012863548,0.0005344556,0.000036905578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000148502295,0.00011884101,0.000036589787,0.0004042265,0.00012940503,0.00038899967,0.0068693478,0.0005124208,0.01072534,0.8801085,0.00023118057,0.10046032],"study_design_scores_gemma":[0.00043724605,0.00063001673,0.0001571678,0.0043448186,0.00007027555,0.003063439,0.0040893042,0.520687,0.008394386,0.45585927,0.001652608,0.00061446504],"about_ca_topic_score_codex":0.0000011097777,"about_ca_topic_score_gemma":3.003753e-7,"teacher_disagreement_score":0.52017456,"about_ca_system_score_codex":0.00007526402,"about_ca_system_score_gemma":0.00007817413,"threshold_uncertainty_score":0.6773844},"labels":[],"label_agreement":null},{"id":"W3217440222","doi":"10.4171/ggd/821","title":"Amenability of quadratic automaton groups","year":2024,"lang":"en","type":"article","venue":"Groups Geometry and Dynamics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Mathematics; Quadratic equation; Degree (music); Combinatorics; Action (physics); Automaton; Discrete mathematics; Orbit (dynamics); Theoretical computer science; Computer science; Geometry","score_opus":0.005864219216535241,"score_gpt":0.22448340880354115,"score_spread":0.2186191895870059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217440222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63025016,0.0011079626,0.36685422,0.00027910728,0.00048329003,0.00010056809,0.000018190914,0.0003854284,0.0005210981],"genre_scores_gemma":[0.9931202,0.00006883897,0.0065166703,0.000101867554,0.000049636164,0.000008821486,0.00001349026,0.000013879249,0.0001065748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847627,0.00007441538,0.00036959234,0.0005197079,0.0002606507,0.0002993537],"domain_scores_gemma":[0.9987975,0.00035503638,0.00006983755,0.00062723574,0.000038409973,0.00011200199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061366224,0.00019623447,0.0002877588,0.0002819806,0.00009112305,0.00023454125,0.00051781296,0.00011183381,0.00002439791],"category_scores_gemma":[0.000059541642,0.0001689969,0.00010562107,0.0010626044,0.0001571067,0.0006626676,0.00033439524,0.00019788099,0.000021734493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004734587,0.000075565826,0.0017469077,0.0004490726,0.000038459515,0.000028105373,0.0005712758,0.00004336936,0.00031483633,0.91151386,0.00009528239,0.085118555],"study_design_scores_gemma":[0.00013337786,0.0001156977,0.009298498,0.00009012007,0.000017112721,0.000071480674,0.00017132022,0.8520099,0.00017323445,0.13747977,0.00021205957,0.00022742125],"about_ca_topic_score_codex":0.000026786978,"about_ca_topic_score_gemma":0.000011671289,"teacher_disagreement_score":0.85196656,"about_ca_system_score_codex":0.00006721736,"about_ca_system_score_gemma":0.000046589415,"threshold_uncertainty_score":0.6891494},"labels":[],"label_agreement":null},{"id":"W32599491","doi":"10.1016/j.media.2020.101758","title":"Operational State Complexity of Prefix-Free Regular Languages.","year":2009,"lang":"en","type":"article","venue":"Automata and Formal Languages","topic":"semigroups and automata theory","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Prefix; Computer science; Regular language; Programming language; State (computer science); Theoretical computer science; Arithmetic; Automaton; Mathematics; Linguistics","score_opus":0.012214209482492586,"score_gpt":0.25001553398118254,"score_spread":0.23780132449868996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32599491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9297104,0.002809972,0.04603039,0.0024644707,0.000113649985,0.00029491488,0.00016797702,0.0007379465,0.01767027],"genre_scores_gemma":[0.97398734,0.000037637226,0.024967203,0.0006232478,0.00003792625,0.000002983662,0.000032041884,0.0000055755495,0.00030605306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990082,0.00003876122,0.00022948993,0.00022699458,0.00023565107,0.00026093],"domain_scores_gemma":[0.99915177,0.000037576498,0.000086228014,0.00061144086,0.000038408692,0.00007455238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028859364,0.0001354126,0.00019467247,0.000074286814,0.00010885095,0.0001004998,0.00068579486,0.000044093926,0.000039434883],"category_scores_gemma":[0.000032175612,0.00010940938,0.000046147732,0.00013261233,0.00011359499,0.00093245704,0.00028280978,0.00007854982,0.000007563517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016635204,0.00010888101,0.00024526543,0.000042145835,0.000025607227,0.00004525787,0.0020452212,0.000014273783,0.005314669,0.81206244,0.0016853539,0.17839427],"study_design_scores_gemma":[0.0056473333,0.0016662006,0.5126088,0.00029177548,0.000060341412,0.0007126624,0.001953262,0.14380547,0.08212306,0.24230652,0.0070887133,0.0017358554],"about_ca_topic_score_codex":0.000056003933,"about_ca_topic_score_gemma":0.000008804394,"teacher_disagreement_score":0.5697559,"about_ca_system_score_codex":0.000008829437,"about_ca_system_score_gemma":0.00002545811,"threshold_uncertainty_score":0.44615853},"labels":[],"label_agreement":null},{"id":"W339857704","doi":"","title":"There are binary circular cube-free words of length n contained within the Thue-Morse word for all positive integers n.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Word (group theory); Morse code; Binary number; Cube (algebra); Combinatorics; Word length; Discrete mathematics; Arithmetic; Geometry; Computer science; Natural language processing; Telecommunications","score_opus":0.01057388134700569,"score_gpt":0.23592382872048187,"score_spread":0.2253499473734762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W339857704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98220026,0.0012312878,0.0051781586,0.007659615,0.0017273722,0.0008568948,0.000032791,0.00025365932,0.000859937],"genre_scores_gemma":[0.99637884,0.000015087981,0.0022910389,0.0010094012,0.00003339585,0.00006380142,0.000008177876,0.00003066153,0.00016959589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982088,0.00018975836,0.00041121914,0.0004512288,0.00034891826,0.00039004194],"domain_scores_gemma":[0.99743885,0.00055158505,0.00036345588,0.0013666359,0.00017809068,0.0001014131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091364526,0.00027168452,0.00037929323,0.00009321943,0.00017861523,0.00010240801,0.0022307385,0.000116351126,0.000012308297],"category_scores_gemma":[0.00018615632,0.00019724818,0.00020614798,0.00036859192,0.00017396269,0.0004661783,0.00045488926,0.0002563086,0.000014970219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007888143,0.00025114257,0.0003968107,0.000029123259,0.00016417803,0.000018403292,0.003801394,0.000113352195,0.0011517471,0.98571,0.0040780418,0.0042069172],"study_design_scores_gemma":[0.004204641,0.00060817547,0.0060326667,0.0003071884,0.000091140166,0.000034609486,0.0030474383,0.050984915,0.0134316,0.9178559,0.0027037447,0.0006979774],"about_ca_topic_score_codex":0.000051873296,"about_ca_topic_score_gemma":0.000017476286,"teacher_disagreement_score":0.06785411,"about_ca_system_score_codex":0.00010237553,"about_ca_system_score_gemma":0.000095025316,"threshold_uncertainty_score":0.8043547},"labels":[],"label_agreement":null},{"id":"W347217945","doi":"10.1017/cbo9780511760860","title":"Noncommutative Rational Series with Applications","year":2010,"lang":"en","type":"preprint","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Noncommutative geometry; Algebra over a field; Series (stratigraphy); Power series; Computer science; Algebraic theory; Automaton; Representation (politics); Commutative property; Algebraic number; Mathematics; Theoretical computer science; Pure mathematics","score_opus":0.012691450552387542,"score_gpt":0.20673531057906763,"score_spread":0.1940438600266801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W347217945","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035194794,0.000030199504,0.7371371,0.00015354075,0.00018163935,0.0005692007,0.00017296376,0.0004189932,0.25781694],"genre_scores_gemma":[0.29908642,0.000049933304,0.32571772,0.0005593513,0.0006388411,0.00014249935,0.0005149811,0.00009647635,0.37319374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987686,0.00009417981,0.00011967574,0.0005688942,0.00023680244,0.00021179071],"domain_scores_gemma":[0.9982955,0.00008956827,0.00019968493,0.0010809709,0.00021512016,0.00011917649],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011724662,0.00024873542,0.00023145012,0.00011217176,0.0003036556,0.00021069094,0.0017951855,0.00021015048,0.0000010390539],"category_scores_gemma":[0.000004255532,0.00025041582,0.00008543859,0.00003847909,0.00027751457,0.00029449642,0.001985257,0.00074286957,0.0000068256377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023683138,0.000026921505,0.000007788904,0.000041399755,0.000061325125,0.000044559747,0.0002403637,0.00009484398,0.00022836406,0.99583775,0.0016970959,0.0016959142],"study_design_scores_gemma":[0.0015602156,0.00017773415,0.0010622676,0.00024110854,0.00019870454,0.00018863709,0.00054622383,0.020349242,0.02051373,0.0012881483,0.95193213,0.0019418647],"about_ca_topic_score_codex":0.000103078666,"about_ca_topic_score_gemma":0.0000060845964,"teacher_disagreement_score":0.9945496,"about_ca_system_score_codex":0.00007371768,"about_ca_system_score_gemma":0.00030275827,"threshold_uncertainty_score":0.9999948},"labels":[],"label_agreement":null},{"id":"W40576911","doi":"10.25596/jalc-2004-333","title":"Context Derivation Sets and Context-Free Normal Forms","year":2004,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Terminal and nonterminal symbols; Symbol (formal); Context-free grammar; Context-sensitive grammar; Computer science; Tree-adjoining grammar; Context (archaeology); Grammar; Mildly context-sensitive grammar formalism; Indexed grammar; Extended Affix Grammar; Mathematics; Combinatory categorial grammar; Rule-based machine translation; Algorithm; Natural language processing; Artificial intelligence; Generative grammar; Programming language; Linguistics; Phrase structure rules","score_opus":0.009273650047310978,"score_gpt":0.19586749789400532,"score_spread":0.18659384784669433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40576911","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82851917,0.000764912,0.15327172,0.005530368,0.0005639314,0.00045455704,0.00003110487,0.0006572522,0.010206986],"genre_scores_gemma":[0.9925663,0.00008503494,0.0052999584,0.0015052913,0.000062575455,0.0000037099626,0.000016810636,0.000017854554,0.0004424534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983641,0.000042949792,0.00023638312,0.0005241247,0.00035349195,0.00047895464],"domain_scores_gemma":[0.99861866,0.00007896841,0.00014304977,0.0008449782,0.00010565625,0.00020869225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024818638,0.00026592996,0.0002765723,0.00019376997,0.0003791231,0.00019786393,0.0013376974,0.00014690435,0.000037512913],"category_scores_gemma":[0.000050619277,0.00025546845,0.000097819626,0.00036042082,0.00015183011,0.0035426456,0.0009588839,0.00020296761,0.00013027589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006601556,0.00013889733,0.00058287045,0.000054575034,0.000105576575,0.00019076008,0.0070345253,0.00011119766,0.0018266937,0.7679653,0.0029064454,0.2190171],"study_design_scores_gemma":[0.052073617,0.003563057,0.096178375,0.0010883498,0.00055852975,0.0013868021,0.057062503,0.032310776,0.036239263,0.5178758,0.19459225,0.00707065],"about_ca_topic_score_codex":0.00031929702,"about_ca_topic_score_gemma":0.00019053087,"teacher_disagreement_score":0.25008953,"about_ca_system_score_codex":0.00021467196,"about_ca_system_score_gemma":0.00014833511,"threshold_uncertainty_score":0.99998975},"labels":[],"label_agreement":null},{"id":"W40607377","doi":"10.1007/978-3-319-04298-5_39","title":"Unary NFAs with Limited Nondeterminism","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Unary operation; Nondeterministic algorithm; Regular language; Computer science; Nondeterministic finite automaton; Discrete mathematics; Automaton; Bounded function; Finite-state machine; Deterministic finite automaton; Exponential function; Mathematics; Combinatorics; Algorithm; Automata theory; Theoretical computer science","score_opus":0.01104340316334352,"score_gpt":0.21656867968437515,"score_spread":0.20552527652103164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40607377","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024351252,0.00021872041,0.9890975,0.00069814204,0.0012017636,0.00030380808,0.0000034135915,0.00038134307,0.007851836],"genre_scores_gemma":[0.3662379,0.00003970924,0.62335175,0.0075566885,0.00095639634,0.000018311894,0.000011608924,0.00010712705,0.0017204678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995723,0.000048292157,0.00048266197,0.0018567103,0.0010812575,0.0008080944],"domain_scores_gemma":[0.9963329,0.0006225393,0.00033457024,0.002286968,0.00018190041,0.00024111127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008595326,0.0006876994,0.00065384485,0.00085176795,0.00027198787,0.00065293594,0.004614451,0.0003531337,0.000030365545],"category_scores_gemma":[0.00004164308,0.0005371981,0.00012954223,0.0006164484,0.0009452718,0.00051083043,0.0014829272,0.0008413811,0.00011357355],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011349236,0.000027733251,0.00003690593,0.000044494096,0.000017150098,0.0003496915,0.0005988873,0.0050700237,0.00015390113,0.07102812,0.00005478586,0.92260695],"study_design_scores_gemma":[0.0006351745,0.0008406629,0.0002421845,0.0009906502,0.000018489913,0.0006068362,2.1488798e-7,0.7434725,0.0019068617,0.24241701,0.0072388,0.0016306094],"about_ca_topic_score_codex":0.000010264401,"about_ca_topic_score_gemma":0.000023121986,"teacher_disagreement_score":0.92097634,"about_ca_system_score_codex":0.00016322716,"about_ca_system_score_gemma":0.00045551287,"threshold_uncertainty_score":0.99970794},"labels":[],"label_agreement":null},{"id":"W4200575172","doi":"10.3390/axioms10040338","title":"Two Extensions of Cover Automata","year":2021,"lang":"en","type":"article","venue":"Axioms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Universitatea din București","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; DFA minimization; Quantum finite automata; Finite-state machine; Deterministic finite automaton; Cover (algebra); Automaton; Automata theory; Computational complexity theory; ω-automaton; Deterministic automaton; Mathematics; Regular language; Theoretical computer science; Transformation (genetics); Nested word; Computer science; Algorithm","score_opus":0.012192135861547021,"score_gpt":0.2524540472500556,"score_spread":0.24026191138850858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200575172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24055871,0.0008400528,0.737272,0.0016402027,0.00097584305,0.000078627614,0.000011096769,0.00039380734,0.018229602],"genre_scores_gemma":[0.9867749,0.000016922337,0.011850916,0.0005078584,0.00003002483,0.00000197373,0.0000032182797,0.000005257653,0.0008089013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993151,0.00003973658,0.00013732583,0.00020644796,0.0001599584,0.00014143661],"domain_scores_gemma":[0.9990289,0.00009558278,0.000046874018,0.0007123922,0.000068985435,0.000047250007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001326007,0.00006357362,0.0001166549,0.000033888024,0.000041396008,0.00003663899,0.000406445,0.000023602646,0.00012050047],"category_scores_gemma":[0.00004630503,0.00005650209,0.000057377085,0.00030716014,0.000035913232,0.000200274,0.00032836696,0.000048131347,0.00018821706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012168812,0.000093593466,0.000038319828,0.00000878442,0.000016218,0.00008055356,0.00031110982,0.00007802733,0.035056535,0.9377664,0.0023778435,0.024171397],"study_design_scores_gemma":[0.0022010216,0.00014566162,0.018965479,0.00019835084,0.000034733042,0.0004857811,0.00030495194,0.587438,0.2955502,0.067485176,0.026447987,0.00074266637],"about_ca_topic_score_codex":0.000020942383,"about_ca_topic_score_gemma":0.0000017238323,"teacher_disagreement_score":0.8702812,"about_ca_system_score_codex":0.000007352696,"about_ca_system_score_gemma":0.00006385409,"threshold_uncertainty_score":0.24192125},"labels":[],"label_agreement":null},{"id":"W4205114821","doi":"10.1016/j.tcs.2019.10.009","title":"Preface","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.004675915981703264,"score_gpt":0.21808375355248175,"score_spread":0.21340783757077847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205114821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15429685,0.000021259837,0.8260482,0.00069900195,0.0009190578,0.00014429678,4.338893e-7,0.0003808032,0.017490115],"genre_scores_gemma":[0.8883473,0.000001490109,0.11053824,0.00097483955,0.00006594518,0.0000026390508,2.1266239e-7,0.0000059309837,0.00006338533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978081,0.00006470544,0.00018634829,0.0007340271,0.00064082775,0.0005659646],"domain_scores_gemma":[0.9981966,0.0001862813,0.000045763933,0.0012594245,0.00009225753,0.0002196852],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012593581,0.00015170491,0.00016908029,0.0001324121,0.00018956332,0.0004649372,0.0035739178,0.000039418457,0.0002047538],"category_scores_gemma":[0.000029087554,0.00011767247,0.00005835485,0.0009881414,0.0011250916,0.0009618804,0.0014583409,0.00015438505,0.0016297896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019226325,0.000024918822,0.00009377165,0.0000037798238,0.0000015092417,0.000003931615,0.00017039428,0.00006510972,0.0018838369,0.96700835,0.000048915383,0.03069355],"study_design_scores_gemma":[0.00018559165,0.00015319635,0.0014192166,0.000020080059,0.0000012826495,0.000039743056,0.000004503354,0.66770184,0.008459629,0.32116842,0.0006146948,0.00023175891],"about_ca_topic_score_codex":0.0000011895049,"about_ca_topic_score_gemma":4.55351e-8,"teacher_disagreement_score":0.73405045,"about_ca_system_score_codex":0.000039919636,"about_ca_system_score_gemma":0.0000921101,"threshold_uncertainty_score":0.99914753},"labels":[],"label_agreement":null},{"id":"W4205168884","doi":"10.1090/crmm/027","title":"Combinatorics on Words","year":2008,"lang":"en","type":"book","venue":"CRM monograph series","topic":"semigroups and automata theory","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Psychology; Computer science; Mathematics","score_opus":0.01141688571781476,"score_gpt":0.19887639996649845,"score_spread":0.18745951424868368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205168884","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044181186,0.0030642534,0.005191564,0.00033722655,0.003247808,0.00031499716,0.000026990187,0.0013245277,0.98605084],"genre_scores_gemma":[0.006471887,0.004786159,0.0029747016,0.0013312654,0.00054357224,0.00008010679,0.000113699294,0.0001399928,0.9835586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981394,0.000045309058,0.00031993294,0.00063707045,0.00045132983,0.0004069546],"domain_scores_gemma":[0.9980771,0.000116159485,0.00021849216,0.0013760242,0.000072722076,0.00013948123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013927551,0.00047255174,0.00047334685,0.00044159443,0.00029696565,0.00023679137,0.0016629858,0.00037068888,0.00001907248],"category_scores_gemma":[0.000012781019,0.00044352483,0.00030636962,0.00038688837,0.000295167,0.00047384473,0.00035198074,0.00050182233,0.00017120324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008987914,0.00004278283,0.000019197743,0.0000317962,0.00004267361,0.000103785256,0.0005247139,0.0000022533536,0.0000016117194,0.90796995,0.08513634,0.0061159246],"study_design_scores_gemma":[0.00015384091,0.00025744856,0.00010910235,0.00013891992,0.00001057004,0.000050568044,0.00001892526,0.00006606329,0.00010514354,0.4166597,0.5819226,0.0005071245],"about_ca_topic_score_codex":0.0000028170816,"about_ca_topic_score_gemma":0.0000014163786,"teacher_disagreement_score":0.49678627,"about_ca_system_score_codex":0.00007242264,"about_ca_system_score_gemma":0.00019858073,"threshold_uncertainty_score":0.99980164},"labels":[],"label_agreement":null},{"id":"W4205254578","doi":"10.1016/j.jda.2011.12.002","title":"Number of holes in unavoidable sets of partial words II","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Winnipeg","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.020873642163818533,"score_gpt":0.26923992195902396,"score_spread":0.24836627979520542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205254578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.927322,0.00038665094,0.06904751,0.00015027903,0.0005261613,0.00007690603,0.000010151527,0.000013945755,0.0024664325],"genre_scores_gemma":[0.9252632,0.000047407368,0.07453628,0.000032419925,0.000060282207,0.000001029067,3.6555414e-7,0.000007701955,0.00005127047],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985178,0.00008899765,0.00069147255,0.00012838675,0.0003601732,0.00021318004],"domain_scores_gemma":[0.99884176,0.00005821864,0.00061119185,0.0002878185,0.00011529329,0.00008572828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077352964,0.000113537,0.00036493424,0.00013678633,0.0000311495,0.00001605511,0.0007769798,0.00006156501,0.00008212892],"category_scores_gemma":[0.00003747588,0.00008684577,0.00015110987,0.00033965972,0.00011032642,0.00060211297,0.00021179196,0.00018132228,0.0000032806186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079076143,0.0044845645,0.115694694,0.0004616781,0.00095523713,0.0011978666,0.07569915,0.0007770278,0.024063261,0.28469297,0.0037007695,0.487482],"study_design_scores_gemma":[0.009508225,0.004116552,0.13312402,0.0025143065,0.00020311803,0.0013581048,0.0039675976,0.118079446,0.42992675,0.29273242,0.0028487449,0.0016206976],"about_ca_topic_score_codex":0.00007448767,"about_ca_topic_score_gemma":0.0000033808897,"teacher_disagreement_score":0.48586133,"about_ca_system_score_codex":0.00002033768,"about_ca_system_score_gemma":0.000089137946,"threshold_uncertainty_score":0.35414678},"labels":[],"label_agreement":null},{"id":"W4205301710","doi":"10.1007/978-3-030-93489-7_8","title":"Width Measures of Alternating Finite Automata","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Automaton; Exponential function; Tree (set theory); Existentialism; Exponential growth; Finite-state machine; Polynomial; Computation; Discrete mathematics; Combinatorics; State (computer science); Algorithm; Computer science; Mathematical analysis; Theoretical computer science","score_opus":0.027431598995972806,"score_gpt":0.24702915329241187,"score_spread":0.21959755429643907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205301710","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025720196,0.0010871416,0.9919548,0.00034234,0.0016457135,0.00017993513,0.000008697368,0.00020597452,0.0043181814],"genre_scores_gemma":[0.34654933,0.00013996435,0.65094507,0.0013155208,0.00050105155,0.000006483575,0.000009054947,0.000054526852,0.00047901375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586225,0.000059288544,0.00070238387,0.0014149332,0.0013717368,0.00058939203],"domain_scores_gemma":[0.9961251,0.0009404996,0.0004977984,0.0019687356,0.0003264797,0.00014139296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013401968,0.0004922143,0.0006882694,0.00068267644,0.00016633584,0.00043862418,0.0044296463,0.00024915586,0.000032536973],"category_scores_gemma":[0.00027764114,0.00045230286,0.00019462773,0.0006577042,0.0005848591,0.00057238794,0.0022464532,0.0006296308,0.000018759809],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024775431,0.000032720716,0.000055659955,0.000066471184,0.000021133541,0.00016248258,0.0005448935,0.021431416,0.0006748787,0.061825786,0.000013503941,0.9151686],"study_design_scores_gemma":[0.00030102197,0.000120983335,0.00012942927,0.0011840416,0.000010424185,0.00009471551,2.4708478e-7,0.7777017,0.010149561,0.208655,0.0009700007,0.0006828906],"about_ca_topic_score_codex":0.000030161382,"about_ca_topic_score_gemma":0.000027702928,"teacher_disagreement_score":0.9144857,"about_ca_system_score_codex":0.00014233611,"about_ca_system_score_gemma":0.0005994946,"threshold_uncertainty_score":0.9997929},"labels":[],"label_agreement":null},{"id":"W4205520528","doi":"10.1016/j.tcs.2018.07.015","title":"Complexity of proper prefix-convex regular languages","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prefix; Regular language; Mathematics; Combinatorics; Regular polygon; Prefix code; Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; Linguistics","score_opus":0.017698645149661598,"score_gpt":0.26388378525127937,"score_spread":0.24618514010161777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205520528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15979026,0.000037430113,0.82946396,0.0007277637,0.00037511557,0.00015169918,0.00000219084,0.0002457156,0.009205859],"genre_scores_gemma":[0.8223314,0.0000010951175,0.17700957,0.00046080767,0.00016562674,0.000002866246,4.2679963e-7,0.0000065462013,0.000021623882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976877,0.00012977027,0.00030301206,0.00066661445,0.00069451536,0.00051836873],"domain_scores_gemma":[0.9979886,0.000111723915,0.00010001881,0.0012820814,0.00032019868,0.00019741055],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016037639,0.0001748241,0.00026684278,0.00015384659,0.000291067,0.00020524343,0.003297191,0.000050004586,0.00013386215],"category_scores_gemma":[0.00008205377,0.00012716034,0.000068832,0.0010097373,0.012552691,0.00061061565,0.0015121879,0.00012581218,0.00012487518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066172843,0.000056995555,0.00004340048,0.000010222965,0.0000039716533,0.000004856171,0.0006129101,0.0000023208743,0.0059129046,0.9660798,0.00008054992,0.027185502],"study_design_scores_gemma":[0.00025103672,0.0004981975,0.0025204767,0.000063344,0.0000052743603,0.00005327941,0.000022707693,0.3252405,0.15285425,0.5179242,0.0002783915,0.0002883745],"about_ca_topic_score_codex":0.000007048477,"about_ca_topic_score_gemma":5.9019436e-7,"teacher_disagreement_score":0.66254115,"about_ca_system_score_codex":0.000028177563,"about_ca_system_score_gemma":0.00010792806,"threshold_uncertainty_score":0.9901346},"labels":[],"label_agreement":null},{"id":"W4205548359","doi":"10.1016/j.tcs.2006.01.028","title":"Sequential?","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université du Québec à Montréal","keywords":"Undecidable problem; Multiplicity (mathematics); Idempotence; Semiring; Automaton; Mathematics; Series (stratigraphy); Discrete mathematics; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Decidability; Theoretical computer science; Geometry","score_opus":0.00672751249240781,"score_gpt":0.22558577782933412,"score_spread":0.21885826533692632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205548359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031962883,0.000030401996,0.94866157,0.00087876694,0.0006761474,0.000079500496,7.072051e-7,0.0004943428,0.017215686],"genre_scores_gemma":[0.84043443,7.7794414e-7,0.1587466,0.00055819674,0.00022124054,0.0000031633697,5.929741e-7,0.0000056126078,0.000029388313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978255,0.000070232025,0.00023296164,0.000650176,0.000627883,0.0005932523],"domain_scores_gemma":[0.99866164,0.00012530733,0.000050219292,0.0009026515,0.00010406116,0.00015613648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011972259,0.00015553072,0.00014960478,0.0001606839,0.00037990793,0.0006341842,0.0028718286,0.000039082617,0.000070769616],"category_scores_gemma":[0.000019958074,0.0001242122,0.00006596502,0.0010844696,0.0021647653,0.00080886134,0.0010681038,0.00012517019,0.00025957444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011011047,0.000036331796,0.000026848033,0.0000018467649,9.314368e-7,0.000016414408,0.00003942988,0.000085488595,0.0022703572,0.97719884,0.0002104899,0.020111926],"study_design_scores_gemma":[0.000109993845,0.00004870911,0.0008198881,0.00000816484,0.0000015291425,0.00005042079,0.0000010398063,0.36595422,0.011720884,0.6206767,0.00043901362,0.00016944144],"about_ca_topic_score_codex":0.0000110802475,"about_ca_topic_score_gemma":4.2064545e-7,"teacher_disagreement_score":0.80847156,"about_ca_system_score_codex":0.00004711987,"about_ca_system_score_gemma":0.00008709745,"threshold_uncertainty_score":0.7976168},"labels":[],"label_agreement":null},{"id":"W4206956776","doi":"10.1016/j.tcs.2017.03.001","title":"Specular sets","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Conseil Régional, Île-de-France; Agence Nationale de la Recherche","keywords":"Generalization; Cardinality (data modeling); Specular reflection; Mathematics; Set (abstract data type); Combinatorics; Interval (graph theory); Natural (archaeology); Group (periodic table); Discrete mathematics; Computer science; Geography; Data mining; Mathematical analysis","score_opus":0.011435490035065918,"score_gpt":0.26523298001445667,"score_spread":0.2537974899793907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206956776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047043256,0.000018705487,0.9314873,0.0022943465,0.0010100957,0.00009273192,8.5029774e-7,0.0002702304,0.01778245],"genre_scores_gemma":[0.85328215,0.0000027684634,0.14591847,0.0006503931,0.00012164719,0.0000025712243,2.1478901e-7,0.0000058984006,0.000015883588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977521,0.000053244254,0.00018637725,0.00074019417,0.00066633796,0.0006017827],"domain_scores_gemma":[0.9965413,0.00009604126,0.00010543757,0.0028513249,0.00010928915,0.00029656224],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0016048922,0.00016838164,0.00018104812,0.00010278337,0.0016182876,0.0022083616,0.008167901,0.000043473367,0.0000761335],"category_scores_gemma":[0.00014582167,0.00013334598,0.00007544601,0.00023601372,0.0041433102,0.0014963648,0.003066318,0.00016012986,0.0003255691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013822956,0.000023596867,0.000053542688,0.0000020954374,0.0000020173172,0.000037903348,0.00010821874,0.000007249764,0.0004521114,0.92025274,0.00007962611,0.07897953],"study_design_scores_gemma":[0.0001625962,0.000070190035,0.004558142,0.00002022857,0.0000021033034,0.000056701898,0.0000018343673,0.42864227,0.005683898,0.5601185,0.00046696555,0.00021658059],"about_ca_topic_score_codex":0.000004027589,"about_ca_topic_score_gemma":2.7874043e-7,"teacher_disagreement_score":0.8062389,"about_ca_system_score_codex":0.000035094756,"about_ca_system_score_gemma":0.000086392974,"threshold_uncertainty_score":0.9996815},"labels":[],"label_agreement":null},{"id":"W4210875876","doi":"10.1017/s000497272100126x","title":"ON A -ADDITIVE UNIQUENESS SET FOR MULTIPLICATIVE FUNCTIONS","year":2022,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplicative function; Uniqueness; Mathematics; Integer (computer science); Combinatorics; Function (biology); Cauchy distribution; Identity (music); Sequence (biology); Mathematical analysis; Physics; Chemistry","score_opus":0.027127586978672583,"score_gpt":0.266332937692701,"score_spread":0.23920535071402843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210875876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06342034,0.00001742208,0.82682127,0.09912985,0.0006668186,0.0032721707,0.0013026126,0.0004965343,0.00487299],"genre_scores_gemma":[0.8915463,0.0000014162024,0.07916551,0.0032935364,0.00006608365,0.0011504401,0.000019626077,0.00003453475,0.02472252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881405,0.00013619525,0.00023748723,0.00027947492,0.00029964937,0.00023311772],"domain_scores_gemma":[0.99812984,0.0009549202,0.0001714072,0.00063535117,0.00005477235,0.000053728058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059616886,0.00013109435,0.00019110352,0.000012600819,0.00045474878,0.00003031478,0.0011265693,0.000044226323,0.0008293837],"category_scores_gemma":[0.00013807416,0.000093228104,0.0004119871,0.00020355408,0.00015177869,0.000021566728,0.0005032128,0.00021082736,0.000047303038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012938796,0.0002877255,0.0000047637654,0.000055297187,0.00006738701,2.948072e-7,0.0019304662,0.0002663527,0.00037470335,0.590539,0.40578076,0.00068034546],"study_design_scores_gemma":[0.0012808003,0.00047094698,0.00048072403,0.0001153397,0.000066667075,0.000031002608,0.0045330897,0.017594427,0.010965722,0.67756116,0.28639677,0.0005033694],"about_ca_topic_score_codex":0.0000072874927,"about_ca_topic_score_gemma":7.257079e-8,"teacher_disagreement_score":0.828126,"about_ca_system_score_codex":0.0000788224,"about_ca_system_score_gemma":0.000031302534,"threshold_uncertainty_score":0.90811694},"labels":[],"label_agreement":null},{"id":"W4211050463","doi":"10.1016/j.ic.2008.03.005","title":"Synchronization","year":2008,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Synchronizing; Synchronization (alternating current); Computer science; Automaton; Coding (social sciences); Conjecture; Sequence (biology); Connection (principal bundle); Theoretical computer science; Mathematics; Discrete mathematics; Computer network; Telecommunications; Transmission (telecommunications)","score_opus":0.009007121495195454,"score_gpt":0.21169090798816587,"score_spread":0.20268378649297042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211050463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05432789,0.00002666892,0.9428116,0.00024820768,0.00009732231,0.000050580093,3.9536195e-7,0.00018005192,0.0022572842],"genre_scores_gemma":[0.9841419,0.000025969277,0.015158255,0.000624032,0.000013208359,0.0000028850097,0.000017872771,0.0000011354532,0.000014737573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963784,0.000013323507,0.00013444437,0.000051630686,0.000102441554,0.00006030907],"domain_scores_gemma":[0.9997713,0.000020146525,0.000060167316,0.00006532182,0.000055123084,0.000027926668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000709567,0.000042972148,0.000039878894,0.000076474375,0.00013583846,0.0000800368,0.00007944115,0.000021100526,0.00000389681],"category_scores_gemma":[0.000010416355,0.000040673953,0.0000097101665,0.0001521465,0.000017761795,0.0021603422,0.00003496126,0.00002597061,0.00007742059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023254497,0.000012265897,0.0004986495,0.00001478832,0.000004387151,0.0000015473028,0.0038178414,0.0029664743,0.000019020981,0.15766704,0.0016661985,0.83332944],"study_design_scores_gemma":[0.00021693265,0.000022040691,0.011263124,0.0000046660634,7.1435545e-7,0.00008072636,0.000041439875,0.97952604,0.000086266424,0.0056692297,0.0030155536,0.00007327765],"about_ca_topic_score_codex":0.0000046137397,"about_ca_topic_score_gemma":1.4430876e-7,"teacher_disagreement_score":0.9765596,"about_ca_system_score_codex":0.000011556544,"about_ca_system_score_gemma":0.000020840253,"threshold_uncertainty_score":0.16586357},"labels":[],"label_agreement":null},{"id":"W4212834144","doi":"10.1016/s0304-3975(03)00311-6","title":"Reducing NFAs by invariant equivalences","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Automaton; Merge (version control); Invariant (physics); Nondeterministic finite automaton; Mathematics; Equivalence (formal languages); Discrete mathematics; Combinatorics; Automata theory; Computer science; Theoretical computer science","score_opus":0.010824583969180577,"score_gpt":0.23935752065838203,"score_spread":0.22853293668920147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212834144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03136501,0.00013796613,0.9506178,0.0007696439,0.0008837363,0.00011804381,0.0000014172903,0.0003168921,0.015789505],"genre_scores_gemma":[0.8528177,0.000008605024,0.14617857,0.0008930097,0.00005808663,0.000005258912,3.8948625e-7,0.000007630361,0.00003074704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968706,0.0002364708,0.0003184727,0.00096141064,0.00079416897,0.0008189033],"domain_scores_gemma":[0.9980323,0.00034464398,0.00008328823,0.0010768368,0.00010560149,0.00035738345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030802034,0.00022231038,0.00022420207,0.0001485033,0.00056543655,0.00078398496,0.003252359,0.00005688745,0.00017239063],"category_scores_gemma":[0.00021721654,0.0001755856,0.000068089816,0.0013317982,0.0024935224,0.0010877881,0.00076058833,0.00020901179,0.0001520249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013102333,0.000048459468,0.000014680401,0.000003934873,0.0000025859854,0.000010895151,0.0002984872,0.00003668099,0.00487328,0.97592914,0.00043627815,0.018344238],"study_design_scores_gemma":[0.00024990895,0.00021987327,0.00009186216,0.000054735207,0.0000047293743,0.0001505866,0.000021267622,0.31645644,0.061070018,0.6199629,0.0012445875,0.00047313614],"about_ca_topic_score_codex":0.0000052789887,"about_ca_topic_score_gemma":8.716716e-8,"teacher_disagreement_score":0.8214527,"about_ca_system_score_codex":0.000055968794,"about_ca_system_score_gemma":0.00017891177,"threshold_uncertainty_score":0.9187487},"labels":[],"label_agreement":null},{"id":"W4213316062","doi":"10.7146/brics.v8i38.21698","title":"Free De Morgan Bisemigroups and Bisemilattices","year":2001,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Computer science","score_opus":0.011783930890360735,"score_gpt":0.23312789835787498,"score_spread":0.22134396746751425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213316062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9125395,0.0011870445,0.07546341,0.0026667654,0.0003552891,0.00011158791,0.0000041651556,0.0005998437,0.0070724455],"genre_scores_gemma":[0.9555918,0.0007362356,0.038559042,0.00071266084,0.00017282882,0.000016724207,0.0000065108406,0.000025642075,0.0041785873],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987604,0.00002942117,0.00027534502,0.00038384373,0.00023352573,0.00031744788],"domain_scores_gemma":[0.9986844,0.00006942073,0.00015260908,0.0008977305,0.000058148635,0.00013770582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046973556,0.00014920958,0.00017351354,0.000088192355,0.00017365774,0.00027545434,0.00061404204,0.00007091727,0.000019753015],"category_scores_gemma":[0.00020793025,0.0001379324,0.000041549793,0.00038971053,0.0001032533,0.00084190303,0.00050009124,0.00009633446,0.0000067590804],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055344026,0.00034481645,0.4452361,0.0001997008,0.00019126387,0.027064094,0.0072570904,0.00007406736,0.03241344,0.36966228,0.033815924,0.08368588],"study_design_scores_gemma":[0.00078547554,0.00025168766,0.27162507,0.000119498465,0.00005693817,0.069129266,0.0007585056,0.009604534,0.020844916,0.28618616,0.33920643,0.0014315369],"about_ca_topic_score_codex":0.000082253915,"about_ca_topic_score_gemma":0.000025089788,"teacher_disagreement_score":0.30539048,"about_ca_system_score_codex":0.000025239722,"about_ca_system_score_gemma":0.000068540976,"threshold_uncertainty_score":0.562472},"labels":[],"label_agreement":null},{"id":"W4214595959","doi":"10.1007/s00453-022-00939-7","title":"Tree Automata and Pigeonhole Classes of Matroids: I","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Douglas College","funders":"Victoria University of Wellington; Royal Society Te Apārangi","keywords":"Matroid; Pigeonhole principle; Combinatorics; Bounded function; Mathematics; Graphic matroid; Discrete mathematics; Oriented matroid; Tree automaton; Tree (set theory); Class (philosophy); Matroid partitioning; Computer science; Automaton; Artificial intelligence","score_opus":0.005874396165787945,"score_gpt":0.20356124901729758,"score_spread":0.19768685285150964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214595959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6070664,0.003845903,0.35787943,0.0072391704,0.00191126,0.00069231313,0.00018200427,0.001716593,0.019466925],"genre_scores_gemma":[0.95165527,0.000020354253,0.04753561,0.00033169007,0.000041623192,0.000026714855,0.000005776701,0.000011881693,0.00037105902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990602,0.00007143698,0.00017446105,0.00026522166,0.00024451656,0.0001841493],"domain_scores_gemma":[0.9992727,0.0001039767,0.00008178595,0.00047202522,0.000018477209,0.00005100934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025916856,0.0000915401,0.0001515938,0.00008778737,0.00014814758,0.000042783813,0.00071799237,0.000019418512,0.00006739401],"category_scores_gemma":[0.000012386009,0.00008925444,0.000042059244,0.0002653443,0.00005764589,0.00020536176,0.0008521844,0.0001042977,0.000008736037],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009751219,0.00022738226,0.00029245403,0.000032627013,0.000048391707,0.000051451923,0.0009835192,0.000027571865,0.0061153728,0.17591353,0.010102418,0.80619556],"study_design_scores_gemma":[0.0022923595,0.001134348,0.014636422,0.00003747288,0.000044118253,0.0005811417,0.0015647023,0.7373075,0.021236092,0.12442473,0.09578851,0.00095259096],"about_ca_topic_score_codex":0.00003283676,"about_ca_topic_score_gemma":0.0000010688627,"teacher_disagreement_score":0.80524296,"about_ca_system_score_codex":0.000015622936,"about_ca_system_score_gemma":0.000038497354,"threshold_uncertainty_score":0.36396906},"labels":[],"label_agreement":null},{"id":"W4221140780","doi":"10.48550/arxiv.2202.01594","title":"Approximate NFA Universality and Related Problems Motivated by Information Theory","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Universality (dynamical systems); Mathematics; Discrete mathematics; Automaton; Probability of error; Combinatorics; Computer science; Algorithm; Theoretical computer science","score_opus":0.022861825507649775,"score_gpt":0.15417579761361974,"score_spread":0.13131397210596996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221140780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46461788,0.00019246127,0.5205344,0.00017507652,0.00061304885,0.00076876924,0.00014829199,0.001183803,0.011766314],"genre_scores_gemma":[0.99759626,0.000210838,0.00032458166,0.00011092942,0.000006835533,0.000001989136,0.0002091331,0.000014683769,0.0015247242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805254,0.00045063774,0.00027718488,0.00075728726,0.00012724745,0.00033512607],"domain_scores_gemma":[0.9982038,0.00013667981,0.00041368313,0.0010161777,0.00008401041,0.00014563353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085626787,0.00032186628,0.00030491923,0.00026927836,0.0003081846,0.00019519108,0.0014934727,0.00025772606,0.00015953321],"category_scores_gemma":[0.00003431812,0.0003653968,0.00011516209,0.0006978456,0.00016562181,0.0014678219,0.0033662645,0.00073653954,0.000026444892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032162825,0.00009267076,0.0006698337,0.00018175188,0.0001620428,0.000054816388,0.0018505487,0.036802553,0.000074946074,0.95728064,0.00072805694,0.002070008],"study_design_scores_gemma":[0.0009069204,0.00006662392,0.0008003264,0.000072208335,0.0000672874,0.000012501273,0.00068120006,0.5788497,0.00008914149,0.4148093,0.0029707944,0.00067403977],"about_ca_topic_score_codex":0.00011652922,"about_ca_topic_score_gemma":0.0000011859869,"teacher_disagreement_score":0.54247135,"about_ca_system_score_codex":0.0002405678,"about_ca_system_score_gemma":0.00011024882,"threshold_uncertainty_score":0.9998798},"labels":[],"label_agreement":null},{"id":"W4224095417","doi":"10.1016/j.tcs.2022.04.006","title":"Properties of a class of Toeplitz words","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toeplitz matrix; Uncountable set; Mathematics; Automaton; Class (philosophy); Permutation (music); Mathematical proof; Set (abstract data type); Discrete mathematics; Combinatorics; Algebra over a field; Theoretical computer science; Computer science; Pure mathematics; Artificial intelligence; Countable set; Programming language","score_opus":0.012783376803217462,"score_gpt":0.2203714539050505,"score_spread":0.20758807710183305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224095417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40949154,0.0001071803,0.58762676,0.00049318594,0.000417907,0.00012360471,0.0000028822105,0.000094797375,0.0016421634],"genre_scores_gemma":[0.96956897,0.0000013053442,0.030128049,0.00025000525,0.00002560059,0.000010391059,1.8285581e-7,0.000005056914,0.000010416065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977969,0.000161662,0.0003386924,0.00044084937,0.00091541646,0.00034646984],"domain_scores_gemma":[0.99865067,0.000115430645,0.00012839228,0.0008871648,0.00011909912,0.000099241384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018832,0.0001155645,0.00023939708,0.0001912066,0.00026965706,0.00006234616,0.0034352771,0.000017398139,0.00007253311],"category_scores_gemma":[0.00004690884,0.00009142808,0.000077397635,0.0013941198,0.002651161,0.00033068305,0.0030601106,0.00015590986,0.0000045399606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012053923,0.00009860158,0.000026944039,0.000015324955,0.0000033812464,0.0000027107465,0.0012118514,0.00031806942,0.01769091,0.9598469,0.000016911112,0.020756334],"study_design_scores_gemma":[0.00024658884,0.0005409694,0.00033668382,0.000040394472,0.000004515868,0.00004478726,0.000095660085,0.6791639,0.11348481,0.20564218,0.00018762467,0.0002119085],"about_ca_topic_score_codex":0.000005707009,"about_ca_topic_score_gemma":8.373918e-8,"teacher_disagreement_score":0.75420475,"about_ca_system_score_codex":0.000041010375,"about_ca_system_score_gemma":0.00017034238,"threshold_uncertainty_score":0.9768313},"labels":[],"label_agreement":null},{"id":"W4229896219","doi":"10.3233/fi-2011-582","title":"Preface","year":2011,"lang":"la","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Magyar Tudományos Akadémia; Queen's University; Universität Wien; Technische Universität Wien; Loughborough University; Friedrich-Schiller-Universität Jena","keywords":"Automaton; Computer science; Cellular automaton; Theoretical computer science; Artificial intelligence","score_opus":0.07323782083805494,"score_gpt":0.21739817564180614,"score_spread":0.1441603548037512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229896219","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16369225,0.00076975574,0.15255722,0.00060037116,0.0042609945,0.0011661694,0.000080462814,0.0009459083,0.67592686],"genre_scores_gemma":[0.95313525,0.00010461396,0.03836547,0.0037613378,0.00014510883,0.000038908347,0.0000147960745,0.000031463667,0.004403033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99746037,0.00007966826,0.0008408031,0.0003240472,0.0005118035,0.00078332645],"domain_scores_gemma":[0.9978511,0.0000890849,0.00034284827,0.0013297122,0.000067114546,0.0003201516],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006319469,0.00037229416,0.00035325377,0.00016024314,0.0002686293,0.0004937306,0.0018948154,0.00015064591,0.004062138],"category_scores_gemma":[0.00003958801,0.00033375047,0.00016560443,0.00042592606,0.00021505529,0.002708952,0.0010082452,0.00030124534,0.010222655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007213405,0.000723005,0.0017826246,0.00060344243,0.00031483464,0.000057487516,0.12536128,0.000008309013,0.00021573869,0.65779424,0.03641239,0.1766545],"study_design_scores_gemma":[0.005789402,0.003060381,0.04226717,0.0017749007,0.00035848413,0.0005659095,0.016736893,0.33533996,0.02166614,0.07716112,0.4901833,0.0050963573],"about_ca_topic_score_codex":0.0000693156,"about_ca_topic_score_gemma":0.0000028673414,"teacher_disagreement_score":0.789443,"about_ca_system_score_codex":0.000103572216,"about_ca_system_score_gemma":0.00012824073,"threshold_uncertainty_score":0.9999114},"labels":[],"label_agreement":null},{"id":"W4230315400","doi":"10.1142/s0129054113400364","title":"MULTIPSEUDOPERIODIC WORDS","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Alphabet; Generalization; Simple (philosophy); Word (group theory); Mathematics; Palindrome; Natural number; Combinatorics; Discrete mathematics; Computer science; Linguistics","score_opus":0.01158208468288874,"score_gpt":0.2736022467836538,"score_spread":0.26202016210076506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230315400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19486865,0.000031818206,0.80040556,0.0018745722,0.0023673428,0.000051251016,7.2645304e-7,0.00001922004,0.0003808548],"genre_scores_gemma":[0.740793,0.000009590416,0.2587888,0.0002212729,0.00016397028,0.000001405124,2.9794006e-7,0.0000023839189,0.000019329073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811465,0.00003177538,0.00053438434,0.00017285986,0.000986018,0.00016032126],"domain_scores_gemma":[0.9970272,0.00013703099,0.00048525148,0.00032328494,0.0019201179,0.00010712303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072775723,0.00008786098,0.00014468284,0.00060008647,0.00010138838,0.0006510362,0.004114349,0.000020427618,0.00008009941],"category_scores_gemma":[0.00011155221,0.00007189651,0.00009870619,0.0005704845,0.0003728081,0.0036685704,0.00045382528,0.00010751557,0.00005563375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007161229,0.00030509272,0.0019193302,0.000005207242,0.00008226913,0.000020891097,0.0018384336,0.002408902,0.021627774,0.17294696,0.0013989735,0.797439],"study_design_scores_gemma":[0.0014514648,0.00045598898,0.07991493,0.00025427286,0.000012095777,0.0011046154,0.00011532154,0.81981534,0.020575365,0.07065511,0.0052054212,0.00044006266],"about_ca_topic_score_codex":0.00002263017,"about_ca_topic_score_gemma":6.119253e-7,"teacher_disagreement_score":0.8174065,"about_ca_system_score_codex":0.00007493572,"about_ca_system_score_gemma":0.0003675128,"threshold_uncertainty_score":0.7645552},"labels":[],"label_agreement":null},{"id":"W4230442289","doi":"10.1007/978-3-642-22321-1_10","title":"Theory of Átomata","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic finite automaton; Deterministic automaton; Büchi automaton; Computer science; Deterministic finite automaton; Two-way deterministic finite automaton; Automaton; Nondeterministic algorithm; Finite-state machine; Regular language; Regular expression; Quotient; Discrete mathematics; Mathematics; Combinatorics; Theoretical computer science; Algorithm; Programming language; Automata theory","score_opus":0.020207786188411674,"score_gpt":0.22664638615806523,"score_spread":0.20643859996965355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230442289","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010043198,0.00078268687,0.97982013,0.00009781305,0.0012982448,0.00020809045,0.0000064516566,0.00018283224,0.017503308],"genre_scores_gemma":[0.4627362,0.00012898397,0.53352547,0.0017637402,0.00047038854,0.000009507065,0.000005704603,0.00007739577,0.0012826272],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969255,0.00005297356,0.00055707904,0.0011928981,0.00073626055,0.00053530454],"domain_scores_gemma":[0.99656296,0.00059061515,0.0003904792,0.0021502431,0.00017166173,0.00013406297],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015667889,0.00045185423,0.00057643274,0.00075412507,0.0001151877,0.00015670968,0.0054025324,0.00028592953,0.00010703379],"category_scores_gemma":[0.00008048323,0.0003843721,0.00016373106,0.0004572482,0.0010749274,0.00054689695,0.001982384,0.00051759207,0.000069370864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003982323,0.000019351735,0.000011191553,0.000026951118,0.000008390839,0.00003240273,0.00060220883,0.00021810562,0.0001296121,0.44490245,0.000012754841,0.5540326],"study_design_scores_gemma":[0.00014782924,0.00013056406,0.00012599087,0.00035992463,0.000007633083,0.000061484505,1.4042233e-7,0.03443045,0.005258683,0.9583758,0.00062692794,0.00047454267],"about_ca_topic_score_codex":0.000013107108,"about_ca_topic_score_gemma":0.0000080923655,"teacher_disagreement_score":0.55355805,"about_ca_system_score_codex":0.00008951897,"about_ca_system_score_gemma":0.00037080987,"threshold_uncertainty_score":0.9999787},"labels":[],"label_agreement":null},{"id":"W4233005118","doi":"10.1007/3-540-44977-9_10","title":"Feedback-Free Circuits in the Algebra of Transients","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; SIGNAL (programming language); Automaton; Electronic circuit; State (computer science); Computer science; Algorithm; Theoretical computer science; Algebra over a field; Mathematics; Arithmetic; Engineering; Electrical engineering; Pure mathematics; Programming language","score_opus":0.014021645481956214,"score_gpt":0.22002589122422989,"score_spread":0.20600424574227366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233005118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009503279,0.00070837414,0.98952174,0.0011119929,0.0011326622,0.00040551132,0.000007486602,0.00005755595,0.0061043254],"genre_scores_gemma":[0.88666975,0.0001031399,0.103581525,0.009089131,0.00027806588,0.000018970286,0.0000053488534,0.000057698446,0.00019639383],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630654,0.000102612656,0.00062289205,0.0011407137,0.0012039577,0.00062328257],"domain_scores_gemma":[0.99646676,0.0006552756,0.000269911,0.0024063291,0.00011717538,0.000084528336],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018062054,0.00044695535,0.0005339693,0.00070706476,0.00012493864,0.00026142763,0.007998153,0.00026527958,0.000020007192],"category_scores_gemma":[0.00010603985,0.00033104132,0.00015703557,0.0010371989,0.00074487703,0.0004728051,0.00063009036,0.00074015156,0.0000145488675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004129772,0.000120547316,0.00010968711,0.00008566694,0.000014206409,0.00016352786,0.0055702105,0.00430979,0.00030393197,0.19843411,0.00015654138,0.7907277],"study_design_scores_gemma":[0.0008602057,0.00023887225,0.001245555,0.000715544,0.000011501252,0.00018088911,0.0000015853674,0.0612101,0.0020642655,0.93096024,0.0016452696,0.0008659933],"about_ca_topic_score_codex":0.000020967303,"about_ca_topic_score_gemma":0.000054991997,"teacher_disagreement_score":0.88594025,"about_ca_system_score_codex":0.00011409391,"about_ca_system_score_gemma":0.00026464625,"threshold_uncertainty_score":0.99991417},"labels":[],"label_agreement":null},{"id":"W4234130960","doi":"10.1142/s012905411940032x","title":"Branching Measures and Nearly Acyclic NFAs","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Nondeterministic algorithm; Nondeterministic finite automaton; Path (computing); String (physics); Discrete mathematics; Computation; Finite-state machine; Directed acyclic graph; Automaton; Algorithm; Computer science; Automata theory","score_opus":0.010147681627145586,"score_gpt":0.27040780591959834,"score_spread":0.26026012429245277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234130960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4339985,0.000060677616,0.5631788,0.0008822163,0.0015652713,0.000031940795,6.04203e-7,0.0000109974235,0.000271032],"genre_scores_gemma":[0.89445305,0.000019721652,0.105172664,0.00020609828,0.00012884273,2.9198335e-7,2.1671195e-7,0.0000026817045,0.000016428412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832785,0.000034759094,0.00039750428,0.00018703684,0.00092280685,0.00013003922],"domain_scores_gemma":[0.9982365,0.00017282275,0.00040374266,0.00025659733,0.00085238676,0.00007795535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010943545,0.000079560414,0.00014622688,0.0004809948,0.000083604034,0.00055559044,0.002330883,0.000018886614,0.000012596204],"category_scores_gemma":[0.00008075392,0.00006749231,0.000065685315,0.00036128878,0.0002159389,0.0028273985,0.00039034046,0.00011299769,0.000011906261],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019351422,0.0001432138,0.008738894,0.000009799884,0.000093791714,0.000015540796,0.0023302727,0.0026107505,0.036396924,0.27157593,0.00014400555,0.67792153],"study_design_scores_gemma":[0.0027817627,0.0008663106,0.24567221,0.0006351763,0.000024852734,0.0020460896,0.00012771093,0.5966804,0.023789573,0.11780937,0.008913635,0.00065292104],"about_ca_topic_score_codex":0.000010629324,"about_ca_topic_score_gemma":9.2244227e-7,"teacher_disagreement_score":0.6772686,"about_ca_system_score_codex":0.000044667482,"about_ca_system_score_gemma":0.00024396375,"threshold_uncertainty_score":0.5357572},"labels":[],"label_agreement":null},{"id":"W4235515712","doi":"10.1142/9789812705808_0007","title":"GRAPH SEMIGROUPS","year":2003,"lang":"en","type":"article","venue":"Advances in Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.00499827380829178,"score_gpt":0.23118717119456214,"score_spread":0.22618889738627035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235515712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11853778,0.027127406,0.75977755,0.0004197588,0.0019627053,0.00027415523,0.0000020609773,0.00065091753,0.09124765],"genre_scores_gemma":[0.95864,0.00070536754,0.039722964,0.00072927616,0.00002483615,0.000019286372,8.6192296e-7,0.000009432513,0.00014802428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893457,0.00007978758,0.00018591853,0.00033439195,0.00016196838,0.00030337763],"domain_scores_gemma":[0.99925375,0.00012945147,0.000052248066,0.0004917607,0.000015066025,0.000057703386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031627854,0.00012071305,0.00013517821,0.00011592377,0.00005319056,0.00005284231,0.0006218237,0.00004009943,0.000043925498],"category_scores_gemma":[0.00006575846,0.000109944864,0.00004616395,0.0006082519,0.00005129073,0.0011643243,0.00007178993,0.00011886453,0.0000836566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.3830914e-7,0.000033360066,0.002218882,0.0000061967125,0.0000019331114,0.000020826476,0.0001322434,0.00007063479,0.0001287377,0.95792055,0.000108082175,0.03935761],"study_design_scores_gemma":[0.00034993602,0.00003905883,0.0013508071,0.000032541524,0.0000013653909,0.000035066936,0.00005874405,0.0009956528,0.004709142,0.9156401,0.07652259,0.00026499253],"about_ca_topic_score_codex":0.0000030145077,"about_ca_topic_score_gemma":0.000012480649,"teacher_disagreement_score":0.8401022,"about_ca_system_score_codex":0.00002171392,"about_ca_system_score_gemma":0.000019470352,"threshold_uncertainty_score":0.44834214},"labels":[],"label_agreement":null},{"id":"W4237199268","doi":"10.1007/3-540-44977-9_6","title":"The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Deterministic finite automaton; Unary operation; Combinatorics; Equivalence relation; Nondeterministic finite automaton; Upper and lower bounds; Cover (algebra); Mathematics; Quantum finite automata; Discrete mathematics; Finite-state machine; Alphabet; DFA minimization; Similarity (geometry); Automaton; Algorithm; Automata theory; Computer science; Theoretical computer science","score_opus":0.011695310336480172,"score_gpt":0.2502640338655513,"score_spread":0.23856872352907113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237199268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012689028,0.0003004446,0.986689,0.0010522327,0.00081397366,0.00033447883,0.000021164135,0.000050345807,0.0094695045],"genre_scores_gemma":[0.83942807,0.00016088212,0.157367,0.0016900382,0.0001476443,0.000014710615,0.000003639886,0.000039053582,0.0011489582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727297,0.00014003874,0.000692502,0.0007365824,0.0007583158,0.00039956454],"domain_scores_gemma":[0.99234617,0.005279103,0.00055164634,0.0015412165,0.00020386775,0.00007802086],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018393758,0.00035712897,0.0005241949,0.00011407199,0.0004061355,0.00027914645,0.0025332249,0.00022227655,0.000037476566],"category_scores_gemma":[0.00043673528,0.00021691353,0.00015173294,0.00041298187,0.0032818476,0.0003144973,0.0011419052,0.00054904225,0.000023421748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061982464,0.00008292121,0.0016514997,0.0001136056,0.000073628566,0.0000349605,0.0025058587,0.0050160876,0.00003724179,0.79141176,0.00026964772,0.19874084],"study_design_scores_gemma":[0.0006019886,0.000037466853,0.00080404675,0.00022523505,0.000027499822,0.00014484512,6.5539894e-7,0.5116752,0.00019542495,0.48447007,0.0014957227,0.00032185524],"about_ca_topic_score_codex":0.000015433216,"about_ca_topic_score_gemma":0.00000886417,"teacher_disagreement_score":0.83815914,"about_ca_system_score_codex":0.000052506333,"about_ca_system_score_gemma":0.00029049558,"threshold_uncertainty_score":0.99943066},"labels":[],"label_agreement":null},{"id":"W4238159413","doi":"10.1017/cbo9780511546563","title":"Automatic Sequences","year":2003,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":609,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Subject (documents); Automaton; Transcendence (philosophy); Computation; Theoretical computer science; Graphics; Graduate students; Algebra over a field; Mathematics; Algorithm; Pure mathematics; Epistemology; Computer graphics (images); World Wide Web","score_opus":0.015414637350007707,"score_gpt":0.19083970741829215,"score_spread":0.17542507006828445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238159413","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007848102,0.00023140157,0.023277473,0.000019521507,0.00054863223,0.00026907926,0.00004431268,0.00067176286,0.97485936],"genre_scores_gemma":[0.00016207313,0.0000347799,0.0029427921,0.00022408114,0.00007034871,9.979519e-7,0.000016503034,0.000026089978,0.9965223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981673,0.00015594994,0.00020474731,0.000696031,0.00036976975,0.00040624742],"domain_scores_gemma":[0.9981571,0.00013287694,0.00026065763,0.0011685077,0.000091922695,0.00018895463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021173933,0.00038985405,0.00042987982,0.00021040629,0.00022446446,0.00018511502,0.0023108858,0.00032535862,0.000006091429],"category_scores_gemma":[0.00001242033,0.0004287047,0.00022187972,0.00003350825,0.00021603731,0.00029918278,0.0006295542,0.0004009163,0.00006210085],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014065917,0.0000074379227,4.6383465e-7,0.000070470494,0.00005237275,0.0003337381,0.000040769428,0.0000014666708,0.000012073717,0.7834352,0.21256946,0.0034751059],"study_design_scores_gemma":[0.00028963247,0.000041911404,0.0000073556544,0.00019668147,0.00005942719,0.00007095209,0.000015223133,0.0039369413,0.00028521148,0.00034496677,0.9941644,0.0005873058],"about_ca_topic_score_codex":0.000025493291,"about_ca_topic_score_gemma":2.7634312e-7,"teacher_disagreement_score":0.7830903,"about_ca_system_score_codex":0.00033033546,"about_ca_system_score_gemma":0.0006220905,"threshold_uncertainty_score":0.9998165},"labels":[],"label_agreement":null},{"id":"W4239483410","doi":"10.1017/9781108674553.015","title":"Appendix: Some Mathematical and Logical Notions Usefulto Linguistics","year":2020,"lang":"en","type":"other","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Université de Montréal","funders":"","keywords":"Linguistics; Appendix; Computer science; Philosophy","score_opus":0.02345099477219713,"score_gpt":0.2495428039868753,"score_spread":0.2260918092146782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239483410","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014878448,0.00031999388,0.37504962,0.00052076863,0.00033230515,0.00013469622,0.000017249457,0.0008615763,0.62276226],"genre_scores_gemma":[0.0011940991,0.00015779195,0.39561552,0.0033305518,0.0021458413,0.00001826752,0.000038390222,0.0002596378,0.5972399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989959,0.0000268606,0.00016988601,0.0004183207,0.00018837066,0.00020066726],"domain_scores_gemma":[0.9992242,0.00011074609,0.000067439505,0.00042176546,0.00001217201,0.00016368364],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000080993064,0.0002044493,0.0002923546,0.00007630374,0.000040879986,0.00015188284,0.0005786145,0.0001979117,0.0029449211],"category_scores_gemma":[0.00020821053,0.000152162,0.00005686703,0.00009658983,0.0000846393,0.00002898483,0.00046509394,0.00018479115,0.0018656706],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.4480156e-7,0.000024943678,0.0000016049765,0.000031644544,0.000014000762,0.000025153333,0.000027085525,1.2062101e-7,0.0000025798577,0.70195216,0.29723862,0.0006818582],"study_design_scores_gemma":[0.00012688163,0.000039926916,0.0000075786384,0.00009018645,0.00001959672,0.000020080899,0.0000081561275,0.011878134,0.00001359032,0.1349152,0.85258317,0.00029750227],"about_ca_topic_score_codex":0.0000064556048,"about_ca_topic_score_gemma":0.0000016738696,"teacher_disagreement_score":0.5670369,"about_ca_system_score_codex":0.0000079162555,"about_ca_system_score_gemma":0.000023695897,"threshold_uncertainty_score":0.9989115},"labels":[],"label_agreement":null},{"id":"W4244389874","doi":"10.1002/9781119105664.oth6","title":"Problem Set 6","year":2015,"lang":"en","type":"other","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Citation; Syntax; Set (abstract data type); Library science; Linguistics; Computer science; Information retrieval; Natural language processing; Programming language; Philosophy","score_opus":0.017582804488957025,"score_gpt":0.24185692555800786,"score_spread":0.22427412106905084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244389874","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.963197e-8,0.00037237094,0.055623338,0.00014429794,0.00024910073,0.00008285656,0.000007798185,0.00114546,0.9423747],"genre_scores_gemma":[0.000006830094,0.0000091649235,0.054761477,0.00035714064,0.00013860357,0.0000050592585,0.0000109868,0.000087227934,0.94462353],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937505,0.000019693205,0.00006900628,0.00023886086,0.00015718571,0.00014020097],"domain_scores_gemma":[0.9993169,0.000007927554,0.000051059676,0.0005468863,0.000012594679,0.000064662774],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013146442,0.00011693377,0.00012630569,0.00008435514,0.0000087489425,0.0000667763,0.0008173959,0.000106239815,0.0015764191],"category_scores_gemma":[0.000002892547,0.00008595195,0.000024324412,0.0001194182,0.00001496216,0.000052873755,0.00022968705,0.00006360087,0.0020461993],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.778237e-8,0.0000049467335,4.8782476e-7,0.00000764434,0.0000053756444,0.0000048613806,0.000031433865,9.7658365e-8,0.0000012043627,0.07899594,0.9145029,0.006445025],"study_design_scores_gemma":[0.000058987604,0.000010891269,3.7342187e-7,0.000030069592,0.0000014100578,0.000006592603,0.0000039270885,0.0005023375,0.000007296291,0.013616394,0.98562783,0.00013388335],"about_ca_topic_score_codex":0.00006762568,"about_ca_topic_score_gemma":0.000023394388,"teacher_disagreement_score":0.07112492,"about_ca_system_score_codex":0.000010372205,"about_ca_system_score_gemma":0.000058104826,"threshold_uncertainty_score":0.9993363},"labels":[],"label_agreement":null},{"id":"W4252967799","doi":"10.1142/s0129054119400355","title":"State Complexity of Suffix Distance","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Suffix; Prefix; Regular language; Mathematics; Upper and lower bounds; Neighbourhood (mathematics); Combinatorics; State (computer science); Discrete mathematics; Automaton; Computer science; Algorithm; Theoretical computer science","score_opus":0.020896797954858718,"score_gpt":0.29279449418749776,"score_spread":0.27189769623263904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252967799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32584623,0.000028930292,0.67132866,0.00055706705,0.001734117,0.00004277431,0.00000590614,0.000009205582,0.0004471417],"genre_scores_gemma":[0.8695776,0.000014419782,0.13024819,0.000063151376,0.0000579788,2.9118564e-7,7.9096696e-7,0.0000026717478,0.000034912173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782276,0.000039800478,0.00066048367,0.00018745061,0.0011427647,0.00014676423],"domain_scores_gemma":[0.99663144,0.00016795156,0.0009066584,0.0003910934,0.0018319449,0.000070909715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010232885,0.00008866883,0.00021604047,0.0004510499,0.0000498923,0.00017295424,0.0037187287,0.000015080102,0.000046956895],"category_scores_gemma":[0.000059486632,0.00007693814,0.000111665715,0.00057571096,0.00062021986,0.0019348471,0.00042923103,0.0001025291,0.00001286421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039553626,0.0003748806,0.0062098247,0.000021974125,0.00009325271,0.00000856704,0.0013966801,0.0073383297,0.014966362,0.8595643,0.00023889169,0.10974735],"study_design_scores_gemma":[0.0018977277,0.00095976435,0.12239692,0.00050656794,0.000013159537,0.0002777268,0.00006662895,0.56827044,0.049754295,0.2508883,0.0045407973,0.00042765136],"about_ca_topic_score_codex":0.000013166332,"about_ca_topic_score_gemma":0.0000023554771,"teacher_disagreement_score":0.608676,"about_ca_system_score_codex":0.00007492911,"about_ca_system_score_gemma":0.00040090038,"threshold_uncertainty_score":0.6910385},"labels":[],"label_agreement":null},{"id":"W4254341276","doi":"10.1016/j.tcs.2020.12.029","title":"Partial derivatives of regular expressions over alphabet-invariant and user-defined labels","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; St. Mary's University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Regular language; Prefix; Free monoid; Regular expression; Invariant (physics); Mathematics; Bounded function; Discrete mathematics; Word (group theory); Existential quantification; Combinatorics; Set (abstract data type); Alphabet; Combinatorics on words; Automaton; Monoid; Computer science; Theoretical computer science","score_opus":0.014049410970877715,"score_gpt":0.24079460233805858,"score_spread":0.22674519136718085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254341276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24847151,0.000056838777,0.7483945,0.0024757069,0.00012777276,0.00010567755,0.0000036718573,0.0001346614,0.00022966872],"genre_scores_gemma":[0.8493814,0.0000064537726,0.14933595,0.0011888035,0.00007447758,0.0000037230175,4.52138e-7,0.000006828899,0.000001913661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978389,0.0001541505,0.0003188333,0.0007072174,0.000551998,0.0004288637],"domain_scores_gemma":[0.998436,0.00036943407,0.000105363884,0.00061577064,0.00009053119,0.00038290385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007422532,0.00018417944,0.00028979094,0.0000790221,0.00025026064,0.00022896635,0.0017332137,0.000050920196,0.000053945932],"category_scores_gemma":[0.00017737827,0.00014142386,0.000052663105,0.00084367016,0.0026384233,0.00073891017,0.0018109658,0.00014137484,0.000010507342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001045763,0.000038383107,0.00009298065,0.000011865529,0.0000054169514,0.0000098770815,0.0010975493,0.000027040118,0.045275632,0.9478065,0.000087238324,0.00553711],"study_design_scores_gemma":[0.0006299923,0.0004407988,0.0051799393,0.00009311201,0.000010520857,0.000017384315,0.000030846142,0.7074733,0.13429658,0.15109937,0.00036032384,0.00036786695],"about_ca_topic_score_codex":0.0000021476872,"about_ca_topic_score_gemma":5.0537995e-8,"teacher_disagreement_score":0.7967071,"about_ca_system_score_codex":0.000010464055,"about_ca_system_score_gemma":0.00007603824,"threshold_uncertainty_score":0.97213805},"labels":[],"label_agreement":null},{"id":"W4281846588","doi":"10.1007/s00233-022-10285-3","title":"The stylic monoid","year":2022,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Monoid; Free monoid; Mathematics; Bijection; Combinatorics; Syntactic monoid; Quotient","score_opus":0.004120705925906042,"score_gpt":0.1916066612687809,"score_spread":0.18748595534287485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281846588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32727686,0.01976163,0.3940692,0.11747974,0.014169631,0.0022441675,0.000097161326,0.0054325997,0.119468994],"genre_scores_gemma":[0.99040645,0.00003729319,0.0012473502,0.0029412874,0.00007475908,0.0001434333,0.000005219973,0.000018466999,0.00512571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984733,0.00013040785,0.00018725486,0.00031645945,0.00038540654,0.00050717406],"domain_scores_gemma":[0.99869794,0.00020723122,0.000082918275,0.0009243562,0.000016903174,0.00007068293],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006818428,0.00012416775,0.000102968675,0.000049264196,0.0015264945,0.0001986943,0.0020836382,0.000021573114,0.00006465336],"category_scores_gemma":[0.000021345406,0.00009123494,0.00009974159,0.0004183475,0.000050726063,0.00025488506,0.0015120609,0.00025317527,0.000091389404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069766497,0.00004400999,0.0003356259,0.000002071144,0.000017079019,0.000016810842,0.000448594,0.00012037338,0.0009739081,0.85170394,0.058371827,0.08795876],"study_design_scores_gemma":[0.00025113375,0.00013584613,0.0005723675,0.0000028084391,0.000003439701,0.00007699842,0.0012415157,0.04104894,0.0008288141,0.081827395,0.87376803,0.00024273488],"about_ca_topic_score_codex":0.000032758166,"about_ca_topic_score_gemma":0.00001197327,"teacher_disagreement_score":0.8153962,"about_ca_system_score_codex":0.0000741289,"about_ca_system_score_gemma":0.000042405944,"threshold_uncertainty_score":0.9997734},"labels":[],"label_agreement":null},{"id":"W4285104990","doi":"10.1007/978-3-662-64821-6_2","title":"Preliminaries","year":2022,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Psychology","score_opus":0.09760787903452407,"score_gpt":0.3414662935045868,"score_spread":0.24385841447006273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285104990","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013824724,0.029018605,0.48221382,0.0021006488,0.0036884858,0.00054302864,0.000048512004,0.0004246451,0.48194844],"genre_scores_gemma":[0.1256637,0.017257756,0.25851038,0.005753527,0.0010756778,0.0005294732,0.00024791312,0.00027744766,0.5906841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979573,0.000040030005,0.000530228,0.00065320963,0.00057542673,0.00024381098],"domain_scores_gemma":[0.99787545,0.001266709,0.00022130304,0.00043046748,0.00016677294,0.000039312898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003944552,0.00032092075,0.0004084692,0.0002837963,0.00022966691,0.000061661245,0.0012842111,0.00008302712,0.0003606666],"category_scores_gemma":[0.00009188432,0.0003277274,0.00011945479,0.00013348936,0.0003745152,0.0002463869,0.0016828533,0.0004684947,0.0001540544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004842842,0.000016101365,0.0000026599826,0.00004219107,0.00007164206,0.00010657995,0.0014190695,0.036724664,7.6478905e-8,0.93056947,0.00195852,0.029084168],"study_design_scores_gemma":[0.000032820004,0.000091343325,0.000011331786,0.00014687747,0.0000072557427,0.000041053634,0.00017801645,0.023878153,0.0000053454955,0.9094704,0.06580313,0.00033428904],"about_ca_topic_score_codex":0.000006074744,"about_ca_topic_score_gemma":0.000006638966,"teacher_disagreement_score":0.22370344,"about_ca_system_score_codex":0.00025847994,"about_ca_system_score_gemma":0.00012772184,"threshold_uncertainty_score":0.9999175},"labels":[],"label_agreement":null},{"id":"W4285278578","doi":"10.1007/978-3-031-05578-2_15","title":"Visit-Bounded Stack Automata","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Stack (abstract data type); Bounded function; Automaton; Computer science; Theoretical computer science; Programming language; Mathematics; Mathematical analysis","score_opus":0.014314477135930469,"score_gpt":0.24041885681952363,"score_spread":0.22610437968359315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285278578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000121834506,0.0005359262,0.98122793,0.00118087,0.003084123,0.00038255678,0.000016727716,0.00068127573,0.012768752],"genre_scores_gemma":[0.13084504,0.00025563498,0.8530641,0.010668046,0.0014479898,0.00005958198,0.00005509109,0.00021023808,0.0033942822],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99451214,0.000073009,0.0006240315,0.0021405956,0.0017114616,0.0009387432],"domain_scores_gemma":[0.99581665,0.000587154,0.00036084082,0.0028737355,0.0001302748,0.00023131975],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014894773,0.0006753488,0.0006571519,0.0009913705,0.0005973461,0.0010348937,0.007467657,0.00026472227,0.00039782308],"category_scores_gemma":[0.00007237812,0.0006464321,0.00020780557,0.0009140537,0.0006686637,0.0011251954,0.004895163,0.0011887365,0.00015035261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005927738,0.00005091656,0.000011939652,0.00003674242,0.000017863658,0.00030514537,0.00071179203,0.005915066,0.000108216234,0.32379118,0.00016061566,0.6688846],"study_design_scores_gemma":[0.00036682986,0.00023774791,0.00006536194,0.00016111814,0.000008751089,0.0001864084,2.698853e-7,0.47832945,0.00045752796,0.4848647,0.034319803,0.0010020144],"about_ca_topic_score_codex":0.000035540175,"about_ca_topic_score_gemma":0.000024827386,"teacher_disagreement_score":0.66788256,"about_ca_system_score_codex":0.00058854575,"about_ca_system_score_gemma":0.0007930222,"threshold_uncertainty_score":0.9995987},"labels":[],"label_agreement":null},{"id":"W4287553630","doi":"10.4230/lipics.cpm.2022.2","title":"String Attractors for Automatic Sequences","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Attractor; String (physics); Combinatorics; Decidability; Sequence (biology); Mathematics; Prefix; Constant (computer programming); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Mathematical physics; Computer science","score_opus":0.0406756292479632,"score_gpt":0.28597792565633673,"score_spread":0.24530229640837353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287553630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10456338,0.00018472702,0.88077885,0.0015279306,0.004417151,0.003915092,0.0019502398,0.0016696517,0.0009929789],"genre_scores_gemma":[0.78431755,0.00006806555,0.21026151,0.002084419,0.0006533948,0.00096699724,0.0013733264,0.00013076926,0.0001439542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99490976,0.00006914088,0.002128575,0.0008430153,0.00081485877,0.0012346477],"domain_scores_gemma":[0.99534386,0.000625271,0.0014815327,0.001768119,0.00034575822,0.00043543626],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010918377,0.0009798971,0.0012282089,0.00040192314,0.00048401405,0.0018053624,0.0045265746,0.00068971596,0.000028033432],"category_scores_gemma":[0.00031749762,0.000899763,0.00088301057,0.00036203445,0.00016282545,0.0019390959,0.0027453955,0.0011124791,0.00011837683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002879899,0.0014940586,0.0057620257,0.04222587,0.0037453347,0.000086074884,0.085559405,0.0065738256,0.00068816607,0.54503226,0.043861084,0.26468393],"study_design_scores_gemma":[0.0023321798,0.00039562746,0.00059782085,0.0012791769,0.00014242365,0.00005675926,0.0011427165,0.89994144,0.0019798323,0.056422967,0.03385843,0.00185062],"about_ca_topic_score_codex":0.000024972182,"about_ca_topic_score_gemma":0.0000070385163,"teacher_disagreement_score":0.89336765,"about_ca_system_score_codex":0.0002893052,"about_ca_system_score_gemma":0.00042296373,"threshold_uncertainty_score":0.9993453},"labels":[],"label_agreement":null},{"id":"W4287635429","doi":"10.48550/arxiv.2010.10956","title":"Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of\\n Dekking's conjecture","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Conjecture; Sequence (biology); Morse code; Mathematics; Combinatorics; Discrete mathematics; Function (biology); Computer science; Biology; Genetics","score_opus":0.13769561284913848,"score_gpt":0.20700951862866188,"score_spread":0.0693139057795234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287635429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7579077,0.00019055024,0.23473255,0.0032897564,0.0009440247,0.0009650864,0.00012562971,0.00019931146,0.0016454174],"genre_scores_gemma":[0.9988099,0.000027835735,0.0006564923,0.00026199225,0.000055555472,9.880738e-7,0.000007327885,0.000014415913,0.00016551993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980765,0.00036269397,0.00030856967,0.00077226764,0.0001963949,0.00028358545],"domain_scores_gemma":[0.9968519,0.00022937871,0.0006796791,0.0019921556,0.00015998734,0.000086859676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038332422,0.00031281155,0.0004578288,0.000078964185,0.00019013904,0.00005685331,0.0049788225,0.00022077895,0.000036659156],"category_scores_gemma":[0.00007539909,0.00021324959,0.00039592703,0.00086821895,0.00087231025,0.00016446484,0.0040903557,0.00075523654,0.000006473084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003240418,0.0000774462,0.0018616616,0.00022199683,0.00013258378,0.00006273404,0.0013338561,0.025968693,0.0005284688,0.9686164,0.00036091058,0.00080281054],"study_design_scores_gemma":[0.00050156686,0.000086953434,0.007287717,0.0003363397,0.00014565629,0.000018685538,0.0002809192,0.33732864,0.011623552,0.64105386,0.0008149034,0.00052121346],"about_ca_topic_score_codex":0.0002737387,"about_ca_topic_score_gemma":0.00006329618,"teacher_disagreement_score":0.32756257,"about_ca_system_score_codex":0.00008535377,"about_ca_system_score_gemma":0.00039213727,"threshold_uncertainty_score":0.9251974},"labels":[],"label_agreement":null},{"id":"W4288413698","doi":"10.48550/arxiv.1903.07522","title":"Scaling limits of permutation classes with a finite specification: a dichotomy","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Random permutation; Permutation (music); Mathematics; Separable space; Limit (mathematics); Substitution (logic); Combinatorics; Discrete mathematics; Limiting; Scaling limit; Scaling; Symmetric group; Computer science","score_opus":0.07142885188841147,"score_gpt":0.18910285177086014,"score_spread":0.11767399988244867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288413698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3804761,0.00005304857,0.6164324,0.00004831209,0.0001898003,0.00021372415,0.0000087934695,0.00012147807,0.0024563596],"genre_scores_gemma":[0.995545,0.00011737757,0.003670814,0.000047624588,0.000049405557,0.0000010603992,0.00002102424,0.000014555762,0.0005331135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862933,0.00009832429,0.0001925333,0.0007641574,0.00011860579,0.00019703244],"domain_scores_gemma":[0.99792105,0.00030225946,0.00039465286,0.0011023801,0.00020687666,0.00007276816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018982575,0.00021931695,0.0002891779,0.00023910221,0.000066739114,0.0000921828,0.0011981145,0.00015881428,0.000020746842],"category_scores_gemma":[0.000028741546,0.00021833023,0.000114744274,0.0005444526,0.00009536049,0.00039668882,0.00045958377,0.0002865512,0.000056141183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009541656,0.00019651347,0.007781289,0.0003498427,0.00016830664,0.00014790114,0.0013270847,0.5550249,0.00033024183,0.43203944,0.00011298392,0.0024260443],"study_design_scores_gemma":[0.0006628294,0.0000993644,0.008076783,0.00046379564,0.000080455946,0.000007880923,0.00028922077,0.96117914,0.0012403913,0.026894497,0.00050743244,0.00049822166],"about_ca_topic_score_codex":0.000028832503,"about_ca_topic_score_gemma":0.000005370901,"teacher_disagreement_score":0.6150689,"about_ca_system_score_codex":0.00008075447,"about_ca_system_score_gemma":0.00019666909,"threshold_uncertainty_score":0.89032483},"labels":[],"label_agreement":null},{"id":"W4297662269","doi":"10.1017/9781108775267","title":"The Logical Approach to Automatic Sequences","year":2022,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical proof; Computation; Theoretical computer science; Phrase; Alphabet; Simple (philosophy); Finite-state machine; Algorithm; Artificial intelligence; Mathematics","score_opus":0.023868392797480875,"score_gpt":0.19979675527474963,"score_spread":0.17592836247726876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297662269","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040086907,0.00017091709,0.047174063,0.000075261094,0.0004205171,0.0005076008,0.00005116941,0.000518935,0.95104146],"genre_scores_gemma":[0.0002699952,0.000022436587,0.0029777195,0.0003255854,0.00009130086,0.000008151144,0.000020605983,0.000020077616,0.9962641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99778384,0.00026961236,0.00020160616,0.00073659176,0.0005622757,0.00044606449],"domain_scores_gemma":[0.9979201,0.00034879494,0.00018615334,0.001276222,0.000060359762,0.00020838392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004605444,0.00032820212,0.0003396671,0.00013095945,0.00095190696,0.00031182155,0.004667682,0.00016442945,0.000003234766],"category_scores_gemma":[0.00002208881,0.0002686611,0.00020997692,0.000056838973,0.000239378,0.00014071686,0.002861478,0.00056906726,0.00002264424],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005457678,0.0000130142525,1.7685228e-7,0.000027273874,0.000044291177,0.00009899827,0.00012119679,0.000035979843,0.0000040384134,0.8260476,0.16880451,0.0047974456],"study_design_scores_gemma":[0.00014182342,0.000064595886,0.0000117535055,0.00003053561,0.00003174213,0.000048088517,0.000097370714,0.009700909,0.00001746836,0.00019172436,0.989282,0.00038195838],"about_ca_topic_score_codex":0.000035695808,"about_ca_topic_score_gemma":3.1147937e-7,"teacher_disagreement_score":0.8258559,"about_ca_system_score_codex":0.00043691832,"about_ca_system_score_gemma":0.00038080267,"threshold_uncertainty_score":0.9999766},"labels":[],"label_agreement":null},{"id":"W4297662415","doi":"10.1017/9781108775267.014","title":"Paperfolding sequences","year":2022,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Section (typography); State (computer science); Computer science; Mathematics; Algorithm; Biology; Genetics","score_opus":0.020684511516727913,"score_gpt":0.1883957201746928,"score_spread":0.1677112086579649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297662415","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005442472,0.00026828845,0.003553164,0.000037792215,0.00052374805,0.00018543257,0.000073593474,0.0004650768,0.9948385],"genre_scores_gemma":[0.0014676184,0.0001405935,0.0008329401,0.00018136611,0.0000903803,8.773028e-7,0.000017549275,0.000028496692,0.9972402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983989,0.000056465364,0.00016019563,0.0006936492,0.00038803264,0.00030274782],"domain_scores_gemma":[0.99857944,0.000109956,0.00020914084,0.00091290293,0.000051769595,0.00013681283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018617108,0.00032233595,0.00031945197,0.00018604977,0.0004633467,0.00012039958,0.0022066473,0.00017065396,0.000040444495],"category_scores_gemma":[0.0000047791877,0.00038067772,0.00021580257,0.000014886245,0.00015328439,0.0003091942,0.0018243514,0.0004978913,0.000020375306],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064254946,0.000003791368,4.347336e-7,0.000023764296,0.000056876615,0.00058633706,0.00005590396,0.000006058538,0.00007159603,0.9837085,0.010060531,0.005419774],"study_design_scores_gemma":[0.00018207406,0.000045141307,0.0000026997038,0.00005887164,0.00004414826,0.000046302517,0.000021408392,0.0007254344,0.000195118,0.00022106669,0.9979997,0.00045800372],"about_ca_topic_score_codex":0.00008714906,"about_ca_topic_score_gemma":4.3067837e-7,"teacher_disagreement_score":0.9879392,"about_ca_system_score_codex":0.00023242539,"about_ca_system_score_gemma":0.00013389907,"threshold_uncertainty_score":0.9998645},"labels":[],"label_agreement":null},{"id":"W4308241043","doi":"10.4171/jems/1291","title":"Disproving Hooley’s conjecture","year":2022,"lang":"en","type":"article","venue":"Journal of the European Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Pure mathematics","score_opus":0.007920951339725382,"score_gpt":0.20045312659938355,"score_spread":0.19253217525965816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308241043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111590885,0.0005215562,0.851138,0.014445154,0.0016029464,0.00022732254,0.0000075392195,0.00014355728,0.02032306],"genre_scores_gemma":[0.96946406,0.0000050736726,0.027700918,0.0018724299,0.0002646379,9.1462016e-7,8.206381e-8,0.000020024001,0.0006718376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983049,0.0005379963,0.0003516267,0.00010901856,0.00052358356,0.00017285667],"domain_scores_gemma":[0.9989414,0.00018244833,0.00036094378,0.00041211813,0.000032068172,0.000070977774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025698773,0.000095858326,0.00016631772,0.000013443622,0.00037925673,0.00011736726,0.0020662386,0.000012069798,0.00012400359],"category_scores_gemma":[0.00010655176,0.00005435342,0.00048619776,0.00021450322,0.00005602893,0.00016457823,0.0013336163,0.0005323464,0.000019909263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016280044,0.000978797,0.0002689596,0.00022154558,0.00045918606,0.00028020664,0.027238326,0.00322658,0.010571478,0.6975529,0.18184398,0.07734177],"study_design_scores_gemma":[0.002251216,0.0005548765,0.0067459815,0.00030550832,0.00016505748,0.0053142216,0.003871611,0.09308056,0.001480061,0.82009006,0.06526119,0.0008796709],"about_ca_topic_score_codex":1.7425367e-7,"about_ca_topic_score_gemma":1.407992e-8,"teacher_disagreement_score":0.8578732,"about_ca_system_score_codex":0.00006869813,"about_ca_system_score_gemma":0.000040855673,"threshold_uncertainty_score":0.38396198},"labels":[],"label_agreement":null},{"id":"W4308675433","doi":"","title":"A characterization of words of linear complexity","year":2019,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Characterization (materials science); Mathematics; Computer science; Materials science; Nanotechnology","score_opus":0.013397088962668894,"score_gpt":0.21632830978130047,"score_spread":0.20293122081863157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308675433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61732805,0.000034873152,0.37493467,0.001234516,0.00007237416,0.000119525255,0.000011497526,0.000070398535,0.006194083],"genre_scores_gemma":[0.9469832,0.00002937295,0.05130229,0.000047771457,0.0000049107125,0.0000039144065,0.0000515742,0.000008698438,0.0015682286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978456,0.0011470865,0.00033853043,0.00027056367,0.0002502897,0.0001479427],"domain_scores_gemma":[0.99716985,0.000408803,0.0003579732,0.0012749891,0.00073413004,0.000054230113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002185736,0.00010198773,0.00021200105,0.000102983664,0.00006432406,0.000044513516,0.0010384885,0.000055510318,0.00010666235],"category_scores_gemma":[0.00018308875,0.000101702884,0.00008257124,0.00047352668,0.0001243892,0.00027838585,0.00038337626,0.00009048559,0.00003076558],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005248624,0.00027947174,0.0035340579,0.00007063914,0.000016667682,3.7559943e-7,0.005255625,0.0000050022736,0.35244456,0.61557347,0.000021588223,0.022793297],"study_design_scores_gemma":[0.00054305024,0.0000012321544,0.034205444,0.0005476999,0.000007567568,0.0000049731507,0.000060496935,0.13025673,0.82463217,0.0070330156,0.0024941673,0.00021343553],"about_ca_topic_score_codex":0.0001398267,"about_ca_topic_score_gemma":0.000035684257,"teacher_disagreement_score":0.6085405,"about_ca_system_score_codex":0.000016136762,"about_ca_system_score_gemma":0.00006495439,"threshold_uncertainty_score":0.41473234},"labels":[],"label_agreement":null},{"id":"W4313382841","doi":"10.1007/978-3-031-21112-6_5","title":"Semantics","year":2023,"lang":"en","type":"book-chapter","venue":"Computer science foundations and applied logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Semantics (computer science); Programming language; Computer science; Philosophy; Linguistics","score_opus":0.03603268007389232,"score_gpt":0.25184359282526986,"score_spread":0.21581091275137754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313382841","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043653366,0.000050851868,0.8079433,0.00070506806,0.0010820717,0.000255319,0.000006079534,0.0006659966,0.18924768],"genre_scores_gemma":[0.07000188,0.00083437184,0.65398115,0.005045275,0.0019903232,0.00009593957,0.00011805655,0.00019032192,0.26774266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977192,0.0000063247335,0.00031761022,0.0010387567,0.0005078113,0.0004102916],"domain_scores_gemma":[0.9984116,0.00013950432,0.0001865875,0.000977094,0.000111441914,0.00017376675],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006148583,0.0003242572,0.0003129864,0.0004599783,0.0007763523,0.0012113876,0.0018025227,0.00013969981,0.000030242041],"category_scores_gemma":[0.0000075141697,0.00028673318,0.0000703198,0.00038503416,0.000837024,0.00038984604,0.0016932865,0.0002605312,0.00071042596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.9811756e-7,0.0000070699134,4.4396774e-7,0.000010801936,0.00000684494,0.0000063064444,0.000075694916,0.000058519257,0.000042431755,0.9062483,0.0005249356,0.093018405],"study_design_scores_gemma":[0.00012606243,0.00005388129,0.00009734958,0.000055833632,0.00001298536,0.000034002784,0.0000047780422,0.06677222,0.000029879067,0.9040045,0.028312085,0.0004964096],"about_ca_topic_score_codex":0.0000012347606,"about_ca_topic_score_gemma":0.0000013859452,"teacher_disagreement_score":0.15396212,"about_ca_system_score_codex":0.000052415584,"about_ca_system_score_gemma":0.00020576456,"threshold_uncertainty_score":0.99995846},"labels":[],"label_agreement":null},{"id":"W4317438149","doi":"10.48550/arxiv.2301.06145","title":"Dyck Words, Pattern Avoidance, and Automatic Sequences","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parenthesis; Binary number; Combinatorics; Mathematics; Word (group theory); Bounded function; Repetition (rhetorical device); Morse code; Upper and lower bounds; Discrete mathematics; Arithmetic; Computer science; Linguistics; Geometry; Mathematical analysis","score_opus":0.06713777086890493,"score_gpt":0.18761574572574571,"score_spread":0.12047797485684078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317438149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55929905,0.00013363968,0.43769267,0.00024284213,0.0007746767,0.00019967472,0.00001839586,0.0010407196,0.0005983044],"genre_scores_gemma":[0.99630153,0.00032033504,0.001033135,0.00017491757,0.00007120306,0.0000017505663,0.000009656152,0.00002298997,0.0020644602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797696,0.00015763835,0.00020857432,0.0011527477,0.00011222896,0.00039185374],"domain_scores_gemma":[0.998192,0.0002230494,0.00022839333,0.0011435014,0.000050461585,0.00016260706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003764888,0.0003269138,0.00035816056,0.00027325557,0.00017443711,0.0002702716,0.0018370389,0.00022331675,0.000028867567],"category_scores_gemma":[0.000028981765,0.000348247,0.00012743061,0.00053707435,0.00017146356,0.00041720681,0.002765394,0.00045983505,0.00023795191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024957297,0.00035416582,0.106186986,0.0022983553,0.0008945524,0.007366542,0.0060111852,0.08513312,0.00023859924,0.6812071,0.005765351,0.10451904],"study_design_scores_gemma":[0.00023481349,0.000031059142,0.011096694,0.00031877414,0.00003466989,0.000011999557,0.00016113296,0.8059238,0.00004504205,0.18144076,0.00019072367,0.0005105037],"about_ca_topic_score_codex":0.00025653077,"about_ca_topic_score_gemma":0.0000633664,"teacher_disagreement_score":0.72079074,"about_ca_system_score_codex":0.00008936816,"about_ca_system_score_gemma":0.00011680172,"threshold_uncertainty_score":0.99989694},"labels":[],"label_agreement":null},{"id":"W4318615114","doi":"10.2139/ssrn.4334369","title":"The Palindromization Map","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Geography; Cartography; Political science","score_opus":0.005689077971307171,"score_gpt":0.22057537200883875,"score_spread":0.2148862940375316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318615114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050671343,0.0035067236,0.92201656,0.02006913,0.0019398513,0.00014115781,6.079593e-7,0.0006171008,0.0010375179],"genre_scores_gemma":[0.9901666,0.003904015,0.00025319925,0.00018711889,0.00031294473,0.000005067441,0.0000018108537,0.000013047424,0.005156165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807966,0.000085011765,0.00014593326,0.00011966765,0.00020910102,0.0013606478],"domain_scores_gemma":[0.99949163,0.000114086855,0.000076383025,0.0002458065,0.00003445234,0.00003766786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025585254,0.00006793984,0.00005833523,0.000060597624,0.0005252648,0.00025070395,0.0008649706,0.00002843547,0.0000032883263],"category_scores_gemma":[0.000041948773,0.00004318698,0.00005741879,0.00038238903,0.000022477152,0.000243571,0.000100123354,0.00058047194,0.0003221822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021410312,0.000004121234,0.000049094077,5.462497e-7,0.000019236908,0.0000033491826,0.000077334385,0.00006948256,0.00007415592,0.9054776,0.00096829893,0.093254656],"study_design_scores_gemma":[0.00017985202,0.00005416125,0.00031700358,0.000005047096,0.0000027697063,0.00019253933,0.00030429594,0.024844382,0.00007327105,0.96201706,0.011933782,0.000075851276],"about_ca_topic_score_codex":0.000003946639,"about_ca_topic_score_gemma":0.00003588273,"teacher_disagreement_score":0.93949527,"about_ca_system_score_codex":0.00015596511,"about_ca_system_score_gemma":0.0005289795,"threshold_uncertainty_score":0.41411075},"labels":[],"label_agreement":null},{"id":"W4319996143","doi":"10.1051/ita/2022010","title":"Properties of a ternary infinite word","year":2023,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Word (group theory); Ternary operation; Exponent; Characterization (materials science); Mathematics; Word length; Abelian group; Point (geometry); Combinatorics; Discrete mathematics; Computer science; Linguistics; Physics; Natural language processing; Geometry","score_opus":0.013153909548090733,"score_gpt":0.22815904913692184,"score_spread":0.2150051395888311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319996143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16487671,0.00014213081,0.8186457,0.0015088548,0.00005137159,0.00055914966,0.000019822324,0.0005442094,0.013652027],"genre_scores_gemma":[0.98759115,0.00009964635,0.011811742,0.00027687592,0.000027042215,0.000117027725,0.000005819209,0.0000059219487,0.0000647823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924725,0.000015246818,0.00033410356,0.00008794454,0.00014518668,0.00017027323],"domain_scores_gemma":[0.9992977,0.000110724824,0.00008155863,0.0003913589,0.000041719966,0.00007698528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027150242,0.00008872516,0.00013032151,0.00009896848,0.00009924101,0.000078477664,0.0004179554,0.0000433345,0.000010722031],"category_scores_gemma":[0.000021397269,0.00006597117,0.00003786955,0.00044833924,0.00036791267,0.00021395284,0.00032508513,0.000078387246,0.00009630454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015886487,0.00001823567,0.000021139236,0.000054794284,0.000006805146,2.0080297e-7,0.0008311684,0.0000240246,0.00037524974,0.9595206,0.00010882008,0.03903739],"study_design_scores_gemma":[0.000207696,0.00003772565,0.00036844172,0.00006909254,0.000009068634,0.000013401822,0.00052740064,0.51601404,0.0023114716,0.47176683,0.008491713,0.00018311838],"about_ca_topic_score_codex":0.0000011559018,"about_ca_topic_score_gemma":8.018639e-8,"teacher_disagreement_score":0.82271445,"about_ca_system_score_codex":0.000004656714,"about_ca_system_score_gemma":0.000019841727,"threshold_uncertainty_score":0.26902264},"labels":[],"label_agreement":null},{"id":"W4320854980","doi":"10.4230/lipics.stacs.2024.26","title":"A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Deterministic automaton; Mathematics; Discrete mathematics; Automata theory; Automaton; ω-automaton; Timed automaton; Combinatorics; Quantum finite automata; Algorithm; Finite-state machine; Computer science; Theoretical computer science","score_opus":0.06458233519008089,"score_gpt":0.21379232699199946,"score_spread":0.14920999180191857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320854980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13659193,0.000022643875,0.8611836,0.0003783735,0.00012733304,0.00081646774,0.00005366056,0.0007312604,0.00009477722],"genre_scores_gemma":[0.9638497,0.00006822114,0.03498367,0.00033695163,0.00006463694,0.000041063257,0.00004645719,0.00003751892,0.0005717745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981787,0.00009179902,0.00016542306,0.0011522507,0.000088921086,0.00032288165],"domain_scores_gemma":[0.99803066,0.00021245515,0.00017281518,0.0013165965,0.000080521364,0.00018692877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002824925,0.0002933225,0.00031899643,0.00024022587,0.00026333405,0.00023329096,0.0016303095,0.00014722763,0.0000026280825],"category_scores_gemma":[0.0000062792324,0.00027267757,0.00009421903,0.00036160622,0.000056463192,0.0002429007,0.0023253385,0.00021784527,0.00002768244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045275432,0.000088172805,0.0004019545,0.00026972085,0.00012483475,0.00006475436,0.00079329114,0.09558453,0.000363914,0.8912142,0.0004660011,0.010583386],"study_design_scores_gemma":[0.0008818123,0.000067784706,0.0010869598,0.0002658501,0.00006502351,0.000008088297,0.0000973901,0.6572999,0.00022666731,0.33850294,0.00091807544,0.0005795075],"about_ca_topic_score_codex":0.00014806855,"about_ca_topic_score_gemma":0.000039695682,"teacher_disagreement_score":0.8272578,"about_ca_system_score_codex":0.00006944263,"about_ca_system_score_gemma":0.000064042084,"threshold_uncertainty_score":0.9999725},"labels":[],"label_agreement":null},{"id":"W4323310070","doi":"10.1016/j.jalgebra.2023.02.011","title":"Corrigendum to “Inverse semigroups associated to subshifts” [J. Algebra 463 (2016) 211–233]","year":2023,"lang":"en","type":"erratum","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Generality; Inverse; Algebra over a field; Pure mathematics; Geometry","score_opus":0.020676528699374194,"score_gpt":0.24789816633314132,"score_spread":0.22722163763376713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323310070","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037594743,0.005084062,0.11507325,0.0405846,0.76896393,0.0030514484,0.00074981945,0.00327145,0.02562671],"genre_scores_gemma":[0.008218787,0.0016656732,0.019515498,0.034195922,0.018459968,0.00008315148,0.00029839925,0.000905784,0.9166568],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99277395,0.00044158785,0.0019553863,0.0010711276,0.0022678704,0.001490093],"domain_scores_gemma":[0.99363285,0.0003410561,0.0019746358,0.0016802426,0.00090910954,0.0014620989],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030425782,0.00097149145,0.0017867606,0.0017916914,0.00031335518,0.00087776023,0.005842186,0.0009959153,0.00031144902],"category_scores_gemma":[0.0013969892,0.0008736934,0.0009678695,0.0028295445,0.000075936194,0.0010162599,0.0015198144,0.0025715886,0.0030969114],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037676797,0.00015621184,0.00003851866,0.00006306385,0.00039401703,0.0011003164,0.0016136741,0.000025704223,0.00021363974,0.0029180623,0.9890977,0.0043414007],"study_design_scores_gemma":[0.0012220772,0.0016267519,0.004598304,0.0029287867,0.00026327177,0.00040163103,0.00042733114,0.002149952,0.00036399814,0.016162634,0.9678138,0.0020414442],"about_ca_topic_score_codex":0.000122029254,"about_ca_topic_score_gemma":0.00020566517,"teacher_disagreement_score":0.89103013,"about_ca_system_score_codex":0.000779186,"about_ca_system_score_gemma":0.0014178456,"threshold_uncertainty_score":0.9997295},"labels":[],"label_agreement":null},{"id":"W4328105802","doi":"10.1016/j.tcs.2023.113830","title":"On the average complexity of partial derivative transducers","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bounded function; Algebraic number; Partial derivative; Expression (computer science); Combinatorics; Discrete mathematics; Pure mathematics; Applied mathematics; Mathematical analysis; Computer science","score_opus":0.03271519382222329,"score_gpt":0.2632422958027282,"score_spread":0.23052710198050488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328105802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26707163,0.0000027885383,0.7266458,0.003620696,0.00036543384,0.0001405385,0.0000036358886,0.00024353384,0.0019059331],"genre_scores_gemma":[0.99101615,0.000001917808,0.00794012,0.00097233296,0.000050460007,0.0000071628215,7.068146e-7,0.0000060614457,0.0000050871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977493,0.00021063966,0.00025409524,0.00052000233,0.00076101965,0.000504888],"domain_scores_gemma":[0.9977399,0.001052461,0.00007126093,0.0009091138,0.000092431765,0.00013480171],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021903014,0.00015647938,0.00019679955,0.00015046573,0.00042444083,0.0001710878,0.0030223462,0.000032611893,0.0000928683],"category_scores_gemma":[0.00013181705,0.00009677603,0.00009045523,0.0020786575,0.006169418,0.00029118717,0.00067171635,0.00018250966,0.00015599624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008199443,0.00003309201,0.0000051476723,0.0000037142306,0.0000043600194,0.0000067452615,0.0012021045,0.00042474436,0.0013286636,0.9900318,0.00012317485,0.0068282606],"study_design_scores_gemma":[0.00009155883,0.00012207642,0.0008195836,0.000017591809,0.0000012394918,0.0000036395288,0.00001222226,0.46844414,0.022360865,0.5080156,0.000019992938,0.000091497226],"about_ca_topic_score_codex":0.0000031795116,"about_ca_topic_score_gemma":1.5731442e-7,"teacher_disagreement_score":0.72394454,"about_ca_system_score_codex":0.000026811074,"about_ca_system_score_gemma":0.0000815083,"threshold_uncertainty_score":0.99653524},"labels":[],"label_agreement":null},{"id":"W4360604354","doi":"10.1016/j.ic.2023.105027","title":"New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines","year":2023,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Computer science; Turing machine; Pushdown automaton; Bounded function; Deterministic pushdown automaton; Deterministic context-free grammar; Model checking; Embedded pushdown automaton; Class (philosophy); Reachability problem; Automaton; Discrete mathematics; Theoretical computer science; Mathematics; Algorithm; Rule-based machine translation; Automata theory; Context-free grammar; Artificial intelligence","score_opus":0.0070638480504548636,"score_gpt":0.230268096332771,"score_spread":0.22320424828231614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360604354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5418651,0.000010599228,0.45724514,0.0004007596,0.00010999882,0.00011447999,0.000006920859,0.0001148295,0.00013215492],"genre_scores_gemma":[0.9770028,0.00005306707,0.022054033,0.0003853371,0.00003741658,0.000006240474,0.00041289482,0.0000040062623,0.000044223907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939275,0.000015952823,0.00028236315,0.00008355391,0.00013360142,0.00009179157],"domain_scores_gemma":[0.9996668,0.000033863264,0.00014015051,0.00008083772,0.000033099168,0.000045254972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015097672,0.0000726027,0.000086653185,0.00020633628,0.00010978627,0.00016059738,0.00010054289,0.000020102569,0.00001988072],"category_scores_gemma":[0.000004640789,0.00007199845,0.000016303273,0.00025465884,0.000014612149,0.0017174159,0.00012338256,0.000030077987,0.0000328087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014111771,0.000019880976,0.0018857647,0.000121780264,0.00004001441,0.0000010129621,0.0065533207,0.0010582829,0.005159075,0.009351014,0.002672602,0.97312313],"study_design_scores_gemma":[0.00065950776,0.0000548002,0.072836086,0.000036058755,0.000007652431,0.000007144597,0.00017792641,0.917722,0.0015607593,0.005733191,0.0010739203,0.00013094388],"about_ca_topic_score_codex":0.00006175382,"about_ca_topic_score_gemma":0.000002106256,"teacher_disagreement_score":0.9729922,"about_ca_system_score_codex":0.00000823225,"about_ca_system_score_gemma":0.000021508622,"threshold_uncertainty_score":0.29360116},"labels":[],"label_agreement":null},{"id":"W4361994958","doi":"10.1051/ita/2022011","title":"Automatic sequences in negative bases and proofs of some conjectures of shevelev","year":2023,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematical proof; Simple (philosophy); Base (topology); Binary number; Automated theorem proving; Mathematics; Discrete mathematics; Computer science; Gas meter prover; Algorithm; Arithmetic; Epistemology; Philosophy","score_opus":0.008010339314147076,"score_gpt":0.24711813972543356,"score_spread":0.2391078004112865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361994958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86800563,0.00017975949,0.12794259,0.00081602816,0.000029746465,0.0008036778,0.000056927693,0.00017065126,0.0019949686],"genre_scores_gemma":[0.98474944,0.00009100652,0.014933231,0.00012156254,0.0000081007665,0.00008235574,0.0000046094547,0.0000036981653,0.000006013581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913937,0.00003069755,0.00044052151,0.00010027923,0.00014095225,0.00014818138],"domain_scores_gemma":[0.998848,0.0006812983,0.00014094642,0.00023626038,0.000036309506,0.00005716017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038145986,0.00009536805,0.0002126458,0.00014545974,0.000052707655,0.000038880193,0.00026649804,0.000047075664,0.000011062996],"category_scores_gemma":[0.000074609896,0.00007261464,0.00002505977,0.00045423376,0.0007006072,0.00025168617,0.0001829476,0.00007199929,0.000003670156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012362682,0.000021787666,0.00013533971,0.0001549426,0.0000069328503,2.2464926e-7,0.0017760221,0.000052591986,0.00017936902,0.9750946,0.000019906385,0.02255705],"study_design_scores_gemma":[0.00016479199,0.000042584477,0.0018769865,0.000063888474,0.0000049550395,0.0000044056746,0.0006275109,0.36177108,0.0026021895,0.63270503,0.000056250054,0.000080334066],"about_ca_topic_score_codex":0.0000056351023,"about_ca_topic_score_gemma":8.690726e-7,"teacher_disagreement_score":0.3617185,"about_ca_system_score_codex":0.0000059493595,"about_ca_system_score_gemma":0.000036064826,"threshold_uncertainty_score":0.29611388},"labels":[],"label_agreement":null},{"id":"W4366547923","doi":"10.1007/978-3-031-30829-1_12","title":"Unboundedness Problems for Machines with Reversal-Bounded Counters","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Algorithm; Computer science; Artificial intelligence; Bounded function; Mathematics; Mathematical analysis","score_opus":0.017781245282572078,"score_gpt":0.23826780013101084,"score_spread":0.22048655484843876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366547923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000935688,0.00016499353,0.9933715,0.001299531,0.0024662293,0.00093430525,0.000023407363,0.00058731774,0.0010591674],"genre_scores_gemma":[0.048816428,0.00013146916,0.9363333,0.005334666,0.0013915376,0.00022159872,0.00006932591,0.00033153026,0.007370119],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569917,0.000027495522,0.0005022906,0.0018722152,0.0010224823,0.00087632827],"domain_scores_gemma":[0.9967903,0.0008265843,0.00035133093,0.0015553089,0.00030414574,0.00017234359],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012341214,0.00067581766,0.00065781054,0.00077235425,0.00042372005,0.0011283577,0.003976008,0.00028823066,0.0000084056455],"category_scores_gemma":[0.00005922601,0.00053064764,0.0001551682,0.00084039423,0.000951198,0.00077563594,0.00096666557,0.0005531342,0.000040772768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060739512,0.00007562328,0.00008469852,0.0005368749,0.00010139089,0.00020934382,0.0028057026,0.038010865,0.00022587307,0.38815933,0.00035430348,0.5693752],"study_design_scores_gemma":[0.0005520674,0.00032379437,0.00003234222,0.00084354746,0.000015600768,0.00009063417,4.4295058e-7,0.47413844,0.0001959446,0.51987004,0.0031017675,0.0008353355],"about_ca_topic_score_codex":0.000046539793,"about_ca_topic_score_gemma":0.00026050245,"teacher_disagreement_score":0.5685399,"about_ca_system_score_codex":0.00030857982,"about_ca_system_score_gemma":0.00065847917,"threshold_uncertainty_score":0.99990857},"labels":[],"label_agreement":null},{"id":"W4377081443","doi":"10.1007/978-3-031-33264-7_14","title":"On the Simon’s Congruence Neighborhood of Languages","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Congruence (geometry); Computer science; Programming language; Theoretical computer science; Mathematics; Geometry","score_opus":0.013643250282226564,"score_gpt":0.2409676931564599,"score_spread":0.22732444287423334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377081443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036392812,0.00021532556,0.9877676,0.0018491409,0.0012193713,0.00030824915,0.000011829232,0.00023823808,0.008026322],"genre_scores_gemma":[0.9726397,0.00006128333,0.022250673,0.0036187489,0.0003061064,0.000013942795,0.0000034961508,0.00005375398,0.0010523227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706846,0.000048339432,0.00041564647,0.0010098254,0.0009675513,0.00049016863],"domain_scores_gemma":[0.9950818,0.0025867468,0.0003001059,0.0018023623,0.0001424091,0.00008660035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001123095,0.00039482868,0.00042718797,0.0004679697,0.0001742248,0.00026744299,0.0048011844,0.00019484584,0.000034076133],"category_scores_gemma":[0.00028695044,0.00026354243,0.00013649595,0.00069199485,0.0008064932,0.00025737818,0.001271472,0.0006303974,0.00011200478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031783668,0.00001805928,0.000022947963,0.000023656257,0.000011847617,0.000076433826,0.0005484771,0.0055129295,0.00016837049,0.78739333,0.000104679195,0.20611611],"study_design_scores_gemma":[0.00013649827,0.00018741006,0.00019574712,0.0005716499,0.000005823822,0.000013580465,0.0000011981244,0.23646611,0.0033668147,0.7584573,0.00015874235,0.00043911987],"about_ca_topic_score_codex":0.000034423272,"about_ca_topic_score_gemma":0.000047895333,"teacher_disagreement_score":0.97227573,"about_ca_system_score_codex":0.00009000591,"about_ca_system_score_gemma":0.0002824415,"threshold_uncertainty_score":0.9999817},"labels":[],"label_agreement":null},{"id":"W4378188697","doi":"10.4153/s0008414x23000342","title":"The first-order theory of binary overlap-free words is decidable","year":2023,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Mathematics; Mathematical proof; Binary number; Class (philosophy); Order (exchange); Discrete mathematics; Combinatorics; Arithmetic; Computer science; Artificial intelligence; Geometry","score_opus":0.01664385980543428,"score_gpt":0.22004236393609145,"score_spread":0.20339850413065716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378188697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72025645,0.0068854843,0.22772047,0.028358648,0.004519788,0.00064818177,0.00008538897,0.00018213059,0.011343445],"genre_scores_gemma":[0.9380609,0.00031296472,0.055215724,0.0018520976,0.00032311722,0.000009393165,0.0000011136059,0.00007507027,0.0041496344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987162,0.0000578915,0.00047703128,0.00009638403,0.00030798896,0.0003445174],"domain_scores_gemma":[0.9973866,0.0010146863,0.00035858076,0.0007871503,0.00019912752,0.00025387062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022764015,0.00011600098,0.00022662252,0.00024964195,0.00026481997,0.00014282594,0.002131023,0.000057524638,0.000059613172],"category_scores_gemma":[0.0007274511,0.00007784101,0.0001260041,0.0007891754,0.0001348124,0.00023535141,0.00012588334,0.00016531744,0.00004537695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000853988,0.00006442075,0.0008898452,0.00018280647,0.00021267701,0.00038749538,0.016054627,0.00034359028,0.0001497194,0.7513195,0.21068087,0.01970588],"study_design_scores_gemma":[0.0005651964,0.00018109294,0.002087767,0.00047655273,0.000041284413,0.00038748785,0.004567809,0.034415074,0.000747286,0.913753,0.042493813,0.00028368642],"about_ca_topic_score_codex":0.000094912466,"about_ca_topic_score_gemma":0.00094129774,"teacher_disagreement_score":0.21780442,"about_ca_system_score_codex":0.00005843734,"about_ca_system_score_gemma":0.0006865757,"threshold_uncertainty_score":0.39600065},"labels":[],"label_agreement":null},{"id":"W4378713939","doi":"10.7561/sacs.2023.1.53","title":"Maximal Existential and Universal Width","year":2023,"lang":"en","type":"article","venue":"Scientific Annals of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Mathematics; Computation; Exponential function; Automaton; Finite-state machine; Polynomial; Tree (set theory); Discrete mathematics; Existentialism; Combinatorics; Algorithm; Mathematical analysis; Computer science","score_opus":0.04369925376803686,"score_gpt":0.28322512489695034,"score_spread":0.2395258711289135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378713939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5444541,0.000085453656,0.44904077,0.0016777196,0.0031701368,0.00013347475,0.000008256751,0.0004158539,0.0010142381],"genre_scores_gemma":[0.9658093,0.000013140221,0.03330355,0.00019477712,0.000067083034,0.0000016263588,0.0000022064098,0.0000056908575,0.0006026146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973501,0.000048759233,0.00025420287,0.0008622172,0.00089052605,0.00059418665],"domain_scores_gemma":[0.9984203,0.00007895956,0.00012799894,0.0008347719,0.00030835957,0.00022959584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027703901,0.00013922462,0.0001822476,0.00072552805,0.00057881046,0.00091197947,0.002401652,0.000033272354,0.000011206109],"category_scores_gemma":[0.000034592635,0.00012570366,0.000070780654,0.00386183,0.0021528052,0.0017015552,0.0017379792,0.00007986364,0.000085467684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001279154,0.00010769238,0.00043364355,0.000050100967,0.00001707607,0.00006931075,0.0030972788,0.00055361824,0.02136389,0.5526019,0.018970096,0.40272266],"study_design_scores_gemma":[0.00031715145,0.0001901735,0.019011494,0.00006904269,0.0000036131116,0.000044346354,0.0000761007,0.8887175,0.023783384,0.060139615,0.0072571696,0.00039041482],"about_ca_topic_score_codex":0.000007625453,"about_ca_topic_score_gemma":8.90758e-7,"teacher_disagreement_score":0.88816386,"about_ca_system_score_codex":0.000009438568,"about_ca_system_score_gemma":0.00023144847,"threshold_uncertainty_score":0.8794239},"labels":[],"label_agreement":null},{"id":"W4381304074","doi":"10.1007/978-3-031-33180-0_17","title":"Dyck Words, Pattern Avoidance, and Automatic Sequences","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg; Thompson Rivers University","funders":"","keywords":"Parenthesis; Binary number; Bounded function; Word (group theory); Combinatorics; Repetition (rhetorical device); Discrete mathematics; Morse code; Mathematics; Upper and lower bounds; Computer science; Arithmetic; Geometry; Linguistics; Telecommunications","score_opus":0.015110211002564853,"score_gpt":0.2345265728146961,"score_spread":0.21941636181213126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381304074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008520039,0.00059480465,0.9931451,0.0009837099,0.0019849723,0.0003035139,0.000008017931,0.000680111,0.0014477677],"genre_scores_gemma":[0.68240774,0.00050656433,0.30685458,0.005864552,0.0012012535,0.00004702956,0.000013614472,0.00016435441,0.002940318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960232,0.000049598755,0.0005385101,0.0016742065,0.000957113,0.00075740844],"domain_scores_gemma":[0.9972319,0.0008352759,0.00028968713,0.0013471593,0.00009457819,0.00020139325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011815401,0.00057604525,0.00059708336,0.0008165349,0.0003033612,0.0009251793,0.0032536378,0.00028456355,0.000024459194],"category_scores_gemma":[0.000083702726,0.0004978089,0.0001023826,0.00074600434,0.0009474688,0.000733824,0.0019144783,0.0007118527,0.00014955002],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.919123e-7,0.000009715068,0.00018080622,0.000081341954,0.000011345372,0.00018442058,0.00089787756,0.0013223616,0.000053837473,0.017614333,0.00003309867,0.97961015],"study_design_scores_gemma":[0.00016220837,0.00009787062,0.0007507856,0.00083070924,0.0000064432547,0.00011722034,5.5523765e-7,0.62695295,0.00022721423,0.3698127,0.00036297148,0.00067836716],"about_ca_topic_score_codex":0.000039088696,"about_ca_topic_score_gemma":0.00008430438,"teacher_disagreement_score":0.9789318,"about_ca_system_score_codex":0.00013784743,"about_ca_system_score_gemma":0.00031652366,"threshold_uncertainty_score":0.99974734},"labels":[],"label_agreement":null},{"id":"W4381304387","doi":"10.1007/978-3-031-33180-0_14","title":"Smallest and Largest Block Palindrome Factorizations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Factorization; Palindrome; Word (group theory); Prefix; Combinatorics; Mathematics; Suffix; Suffix array; Computer science; Arithmetic; Discrete mathematics; Algorithm; Linguistics","score_opus":0.018882904818249592,"score_gpt":0.23172284785981276,"score_spread":0.21283994304156317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381304387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004672739,0.00025661066,0.99468505,0.0007500565,0.0017887256,0.00024295296,0.000016899465,0.000389244,0.0014031979],"genre_scores_gemma":[0.761132,0.00039632522,0.23198867,0.0023255318,0.0010495833,0.00002344388,0.00003184882,0.00013806875,0.0029145377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705416,0.000024364335,0.00038602113,0.0013234623,0.000645137,0.00056683033],"domain_scores_gemma":[0.99780184,0.0005864414,0.00017734292,0.0011225981,0.00012183612,0.00018991572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006058786,0.00043341922,0.00041600547,0.0006998011,0.0003159733,0.0006553032,0.002256308,0.00028882598,0.000014831101],"category_scores_gemma":[0.000091447895,0.00039494692,0.00007828315,0.00067859364,0.0005017183,0.00033800118,0.001693381,0.00055929937,0.0000837636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035577987,0.000059656857,0.0010415205,0.00011250236,0.00004692773,0.0005309541,0.002061143,0.010779118,0.00046979345,0.54186887,0.00010318962,0.44292277],"study_design_scores_gemma":[0.0004022833,0.0001959741,0.0031360728,0.0006011972,0.00001573659,0.00024942087,4.568733e-7,0.398809,0.00052305136,0.59256804,0.0021397758,0.0013590205],"about_ca_topic_score_codex":0.000024330608,"about_ca_topic_score_gemma":0.0000797223,"teacher_disagreement_score":0.7626964,"about_ca_system_score_codex":0.000090115675,"about_ca_system_score_gemma":0.0002574806,"threshold_uncertainty_score":0.9998502},"labels":[],"label_agreement":null},{"id":"W4381304603","doi":"10.1007/978-3-031-33180-0_18","title":"Rudin-Shapiro Sums via Automata Theory and Logic","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Computer science; Mathematical proof; Automaton; Automata theory; Proof theory; Theoretical computer science; Algorithm; Mathematics","score_opus":0.019670691568446357,"score_gpt":0.24566659605152943,"score_spread":0.22599590448308307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381304603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015574967,0.0007354184,0.9920192,0.00087246916,0.0021243382,0.0003329933,0.000009040021,0.0008841763,0.0028666581],"genre_scores_gemma":[0.3530011,0.00093782763,0.6210155,0.015293518,0.0022032056,0.00006481969,0.000039601466,0.0003641252,0.0070803277],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955257,0.00010306732,0.0005479938,0.0020106726,0.0009453808,0.00086719345],"domain_scores_gemma":[0.9957139,0.0017377961,0.00028372934,0.0019061834,0.00011984147,0.00023854263],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028899563,0.00067241694,0.00065508875,0.00090599386,0.00035748296,0.00076599687,0.0040527396,0.00040272277,0.00003052833],"category_scores_gemma":[0.00016734748,0.0005685493,0.00013788122,0.0007334836,0.0012154382,0.0006756962,0.0034416295,0.0008052605,0.00021026706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005239352,0.00001537928,0.000016934486,0.00003872467,0.000012679196,0.00018521682,0.00039519373,0.0007037781,0.00016997957,0.42961338,0.000035338795,0.56880814],"study_design_scores_gemma":[0.00018774216,0.00011046207,0.00023911774,0.00024603677,0.0000075642206,0.00014307087,2.3957386e-7,0.24463665,0.00029511764,0.7530475,0.0004993401,0.00058711297],"about_ca_topic_score_codex":0.000014518664,"about_ca_topic_score_gemma":0.000024255394,"teacher_disagreement_score":0.56822103,"about_ca_system_score_codex":0.00014929485,"about_ca_system_score_gemma":0.0002453497,"threshold_uncertainty_score":0.9996766},"labels":[],"label_agreement":null},{"id":"W4381570207","doi":"10.12697/acutm.2023.27.02","title":"On dominions of certain ample monoids","year":2023,"lang":"en","type":"article","venue":"Acta et Commentationes Universitatis Tartuensis de Mathematica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Eesti Teadusfondi; Wilfrid Laurier University","keywords":"Mathematics; Semigroup; Inverse semigroup; Unary operation; Bijection, injection and surjection; Pure mathematics; Inverse; Monoid; Dominion; Inverse element; Combinatorics; Discrete mathematics; Special classes of semigroups; Law; Geometry","score_opus":0.020680379028901387,"score_gpt":0.2754125346414683,"score_spread":0.2547321556125669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381570207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61058515,0.00001210425,0.3469712,0.034217592,0.00019473201,0.00042832014,0.00007362752,0.0006371558,0.006880133],"genre_scores_gemma":[0.94041634,0.000023013128,0.057977322,0.0012653318,0.000005884144,0.000008029945,0.000036698453,0.00001317355,0.00025421564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894375,0.00016644369,0.00022485256,0.00020862157,0.00023582543,0.00022050273],"domain_scores_gemma":[0.99707234,0.002180555,0.0001458027,0.0004697223,0.000055448378,0.00007613506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038322373,0.00012985907,0.00020222356,0.00031031464,0.00014125077,0.000054405624,0.000528159,0.00004052352,0.00009979456],"category_scores_gemma":[0.00011422665,0.00012983696,0.00008325984,0.00058032776,0.00005773387,0.00037710712,0.0001957031,0.00007632997,0.0001364154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102411095,0.00011439428,0.00005363812,0.00004168989,0.000062367246,0.000016793605,0.011327308,0.00017794436,0.0028785875,0.9496218,0.03304197,0.0026532926],"study_design_scores_gemma":[0.0022854183,0.00046547037,0.006085104,0.0002559067,0.00009051452,0.000030131923,0.016450929,0.15392181,0.009036018,0.8067874,0.0039199465,0.00067136774],"about_ca_topic_score_codex":0.000029964594,"about_ca_topic_score_gemma":0.0000061514775,"teacher_disagreement_score":0.3298312,"about_ca_system_score_codex":0.00005708372,"about_ca_system_score_gemma":0.0000401958,"threshold_uncertainty_score":0.5294597},"labels":[],"label_agreement":null},{"id":"W4381856060","doi":"10.1007/978-3-031-34326-1_4","title":"Existential and Universal Width of Alternating Finite Automata","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decidability; Bounded function; Computation; Automaton; Finite-state machine; String (physics); Nondeterministic finite automaton; Deterministic finite automaton; Integer (computer science); Existentialism; Nondeterministic algorithm; Discrete mathematics; Deterministic automaton; Computer science; Mathematics; Algorithm; Automata theory; Theoretical computer science; Mathematical analysis","score_opus":0.01791347460222524,"score_gpt":0.23648603760099757,"score_spread":0.2185725629987723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381856060","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077800907,0.000116652125,0.99426115,0.00023003071,0.0014219064,0.00016327284,0.000011275728,0.00026663113,0.0027510885],"genre_scores_gemma":[0.49487892,0.00023229551,0.5023518,0.0006565257,0.00058626017,0.000004340658,0.000011323477,0.000084031424,0.0011944642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973092,0.000030039508,0.0004282781,0.0010562835,0.00073737314,0.00043879388],"domain_scores_gemma":[0.99768716,0.0007735841,0.00032969032,0.0009818717,0.000113167356,0.000114521725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008069665,0.0003484402,0.0004451317,0.00079665723,0.0001479862,0.00028317547,0.002504503,0.00018180291,0.000009002185],"category_scores_gemma":[0.00009429457,0.00032825448,0.000092447764,0.00051392906,0.0007067403,0.0005103448,0.0023314096,0.0004087007,0.000016944003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006008267,0.00001935207,0.00006769982,0.00009506672,0.000022894228,0.0002084711,0.0010445634,0.011324726,0.00029033807,0.14172445,0.0000146975235,0.84518176],"study_design_scores_gemma":[0.00028952895,0.00012376011,0.00018509169,0.00050509296,0.000007759619,0.000042683347,3.3967038e-7,0.81595623,0.00074454676,0.18155582,0.0002086881,0.0003804404],"about_ca_topic_score_codex":0.00004939317,"about_ca_topic_score_gemma":0.00002529398,"teacher_disagreement_score":0.8448013,"about_ca_system_score_codex":0.00007614736,"about_ca_system_score_gemma":0.00022602933,"threshold_uncertainty_score":0.999917},"labels":[],"label_agreement":null},{"id":"W4381895020","doi":"10.1007/978-3-031-34326-1","title":"Descriptional Complexity of Formal Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Szegedi Tudományegyetem; Eötvös Loránd Tudományegyetem; Université de Bordeaux; Debreceni Egyetem; Universität Trier; Universidade do Porto; Univerzita Komenského v Bratislave; Slovenská Akadémia Vied; Universität Potsdam; Santa Clara University; Hebrew University of Jerusalem; Università degli Studi di Milano; Yonsei University; Queen's University","keywords":"Computer science; Automaton; Formal language; Rule-based machine translation; Programming language; Grammar systems theory; Formal system; Formal grammar; Formal methods; Theoretical computer science; Natural language processing; Artificial intelligence","score_opus":0.03960981579574425,"score_gpt":0.25225768808996296,"score_spread":0.21264787229421872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381895020","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023881055,0.00034870813,0.99337715,0.00016701553,0.0040701693,0.00030175253,0.00002523065,0.0002925125,0.0011786224],"genre_scores_gemma":[0.44667596,0.000059703507,0.54634833,0.0011483593,0.001972093,0.000052660787,0.00007572461,0.00011149528,0.0035556487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962634,0.00007681097,0.0006465678,0.001033773,0.0012367956,0.0007426383],"domain_scores_gemma":[0.99743426,0.0005501268,0.00037622915,0.0012570162,0.00024852043,0.0001338611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016899678,0.00038257477,0.0006070074,0.0008373928,0.00020690069,0.00038848032,0.004279553,0.00024754144,0.00000728482],"category_scores_gemma":[0.0000860844,0.00034221986,0.00014727065,0.0013540164,0.0013265554,0.0008892506,0.0020022679,0.0005376018,0.000061947125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000170681,0.0001304712,0.00013513667,0.0005708584,0.000044698758,0.0001526522,0.001644597,0.097772434,0.00049956766,0.5816959,0.0011648149,0.3161718],"study_design_scores_gemma":[0.0001625977,0.00012346458,0.00045011865,0.00044515412,0.0000038748485,0.000060396473,3.3261597e-7,0.72428876,0.000254577,0.27353376,0.0003280194,0.0003489651],"about_ca_topic_score_codex":0.000043101576,"about_ca_topic_score_gemma":0.000024143505,"teacher_disagreement_score":0.6265163,"about_ca_system_score_codex":0.00034004197,"about_ca_system_score_gemma":0.0011203605,"threshold_uncertainty_score":0.99990296},"labels":[],"label_agreement":null},{"id":"W4383554657","doi":"10.1145/3607471","title":"Co-lexicographically Ordering Automata and Regular Languages - Part I","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"European Commission","keywords":"Lexicographical order; Regular language; Mathematics; Automaton; Discrete mathematics; Constant (computer programming); Nondeterministic finite automaton; ω-automaton; Combinatorics; Prefix; Deterministic automaton; Regular expression; Order (exchange); State (computer science); Nested word; Closure (psychology); Finite-state machine; Quantum finite automata; Automata theory; Computer science; Algorithm; Theoretical computer science","score_opus":0.015142524035447458,"score_gpt":0.27059090535303626,"score_spread":0.2554483813175888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383554657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768587,0.00045698695,0.0013408889,0.020240672,0.0006172688,0.00004590226,0.0000015697508,0.00013242268,0.0003055863],"genre_scores_gemma":[0.986607,0.00035949948,0.011075303,0.0011165064,0.00039666655,0.0000013740645,3.8610517e-7,0.000014736574,0.00042850646],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992619,0.00006722197,0.00018714926,0.00009137485,0.00024908799,0.00014325419],"domain_scores_gemma":[0.9987378,0.00014300113,0.00015956818,0.00087046705,0.000033200384,0.00005596504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007870161,0.000065265995,0.00011796538,0.00009718695,0.00010111748,0.00011366855,0.0021832143,0.000030481546,0.0000062560857],"category_scores_gemma":[0.00044811884,0.00003887921,0.000080418795,0.00038332827,0.000051166462,0.00024226688,0.00067329,0.00014033302,0.000009385803],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006900587,0.00024442002,0.025264805,0.00019106257,0.00055973855,0.0012450883,0.005887133,0.0004940793,0.12720767,0.094694644,0.4800383,0.26410407],"study_design_scores_gemma":[0.00264077,0.0005438337,0.33024958,0.0010086838,0.00009608623,0.0035033845,0.0012895843,0.02223606,0.033582136,0.4320403,0.17197695,0.00083261717],"about_ca_topic_score_codex":0.0000017158447,"about_ca_topic_score_gemma":6.5331375e-7,"teacher_disagreement_score":0.33734566,"about_ca_system_score_codex":0.000006563412,"about_ca_system_score_gemma":0.000023715244,"threshold_uncertainty_score":0.40569916},"labels":[],"label_agreement":null},{"id":"W4384344706","doi":"10.1109/lics56636.2023.10175828","title":"Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees","year":2023,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Unary operation; Mathematics; Counting problem; Class (philosophy); Discrete mathematics; Node (physics); Completeness (order theory); Combinatorics; Tree (set theory); Binary tree; Equivalence relation; Monadic predicate calculus; Computer science; Theoretical computer science; Description logic; Higher-order logic; Artificial intelligence","score_opus":0.02875314544626035,"score_gpt":0.2594140852382687,"score_spread":0.23066093979200836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384344706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056214213,0.000092363196,0.9367222,0.0017658924,0.0003207611,0.00075587333,0.000039871302,0.00090510293,0.003183682],"genre_scores_gemma":[0.866146,0.000020411391,0.13102733,0.0011465283,0.00009407317,0.0002495875,0.00006093302,0.000047986872,0.001207113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978408,0.00006605067,0.00042119587,0.000679995,0.0003954656,0.0005964849],"domain_scores_gemma":[0.9971717,0.0012795351,0.00027495238,0.00077279896,0.00042681268,0.00007420321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005044516,0.00032933563,0.0005070781,0.00019125413,0.0004800266,0.00018287974,0.0009755276,0.000099310186,0.00012929594],"category_scores_gemma":[0.00020218294,0.00023152532,0.00008073929,0.0014336103,0.00017421656,0.00046224665,0.00030503664,0.00011791946,0.0000331741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018609391,0.00024002083,0.0011828814,0.00027371733,0.00012598255,0.000029346118,0.001280681,0.06665821,0.003294453,0.92200184,0.0035522757,0.0011744857],"study_design_scores_gemma":[0.0040888744,0.0010306835,0.0037530432,0.00054903905,0.000048423117,0.000020802592,0.0010226297,0.8793326,0.006292185,0.09556499,0.0072966157,0.0010001044],"about_ca_topic_score_codex":0.00038177695,"about_ca_topic_score_gemma":0.00048468477,"teacher_disagreement_score":0.8264369,"about_ca_system_score_codex":0.000034483728,"about_ca_system_score_gemma":0.000089846384,"threshold_uncertainty_score":0.94413286},"labels":[],"label_agreement":null},{"id":"W4384937916","doi":"10.1016/j.tcs.2023.114078","title":"On Simon's congruence closure of a string","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning","keywords":"Alphabet; Congruence (geometry); Mathematics; Combinatorics; String (physics); Closure (psychology); Regular language; Discrete mathematics; Computer science; Automaton; Linguistics; Theoretical computer science","score_opus":0.009520618453839953,"score_gpt":0.24837631272311528,"score_spread":0.23885569426927533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384937916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45532864,0.0000078662715,0.54138386,0.0005250736,0.0004995035,0.00009905482,0.0000023279972,0.0004270534,0.0017265839],"genre_scores_gemma":[0.9826476,0.000003776005,0.016955396,0.00031774084,0.000052248324,0.00000397123,5.498905e-7,0.0000071976783,0.000011543199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757844,0.000088599496,0.0002721661,0.0006501497,0.0008396048,0.0005710117],"domain_scores_gemma":[0.99784005,0.0007391008,0.00008380139,0.0010047234,0.00013879641,0.00019353162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018569031,0.00016315067,0.00022329553,0.0003217537,0.00023585938,0.00019994372,0.0030813625,0.000046375684,0.000025726065],"category_scores_gemma":[0.00019028124,0.00013048823,0.00007615346,0.0026735892,0.0020431646,0.0004595241,0.0011731808,0.00017018757,0.00017108287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005090646,0.000029756253,0.00015863874,0.0000082453325,0.0000026493562,0.000021449896,0.00020326192,0.0004885582,0.0010041863,0.98024213,0.000116799914,0.017719245],"study_design_scores_gemma":[0.00016748816,0.00023383978,0.0017519067,0.000061579645,0.0000018038974,0.000006582067,0.000011433599,0.5033423,0.014592798,0.47963104,0.00003530405,0.0001639804],"about_ca_topic_score_codex":0.0000027108683,"about_ca_topic_score_gemma":2.2742529e-7,"teacher_disagreement_score":0.5273189,"about_ca_system_score_codex":0.000029320885,"about_ca_system_score_gemma":0.00008588437,"threshold_uncertainty_score":0.7528125},"labels":[],"label_agreement":null},{"id":"W4384938342","doi":"10.1016/j.tcs.2023.114076","title":"Approximate NFA universality and related problems motivated by information theory","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Universality (dynamical systems); Mathematics; Discrete mathematics; Automaton; Combinatorics; Computer science; Theoretical computer science","score_opus":0.005101673044156291,"score_gpt":0.2008103065029248,"score_spread":0.19570863345876852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384938342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11329735,0.000021993314,0.8803579,0.0010207493,0.00034717974,0.0002436584,0.000007056715,0.0012366986,0.0034673985],"genre_scores_gemma":[0.9920061,0.000015761878,0.007559287,0.0003484119,0.000013235621,0.000005839475,0.000010851323,0.000006736309,0.000033746517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786425,0.00020487458,0.00031571233,0.0005118139,0.00053091894,0.00057244045],"domain_scores_gemma":[0.99859077,0.00031516675,0.000099038145,0.00064046256,0.00011824523,0.000236296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034388902,0.00018747099,0.00018469505,0.00026774989,0.0004541213,0.0005759192,0.0015769902,0.000075738004,0.000028079938],"category_scores_gemma":[0.00010973585,0.00015134302,0.000038176586,0.0023987633,0.00225754,0.0024401918,0.0013383736,0.00019746397,0.00016196592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034311217,0.000016459266,0.000024367111,0.000014012669,0.000004965562,0.00000311615,0.0012855865,0.000096045704,0.00074543833,0.96156025,0.0002040295,0.036042325],"study_design_scores_gemma":[0.00020431496,0.000060317747,0.0006816283,0.000021850223,0.0000025268153,0.000019787658,0.000029952142,0.5449545,0.0010663042,0.45265102,0.00014833466,0.00015947272],"about_ca_topic_score_codex":0.0000033161648,"about_ca_topic_score_gemma":3.5262037e-8,"teacher_disagreement_score":0.8787088,"about_ca_system_score_codex":0.00004449587,"about_ca_system_score_gemma":0.000059041067,"threshold_uncertainty_score":0.8318},"labels":[],"label_agreement":null},{"id":"W4385071507","doi":"10.1016/j.dam.2023.07.008","title":"The palindromization map","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Suffix; Combinatorics; Rank (graph theory); Automaton; Context (archaeology); Deterministic automaton; Discrete mathematics; Algorithm; Theoretical computer science; Finite-state machine; Computer science; Linguistics; Geography","score_opus":0.011529498334838609,"score_gpt":0.23470012158322162,"score_spread":0.22317062324838302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385071507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005758523,0.00004963656,0.9752835,0.0019036777,0.0003567389,0.00035233903,0.0000037107404,0.0011841946,0.015107663],"genre_scores_gemma":[0.81396395,0.0001707027,0.18072581,0.00067768863,0.00027124642,0.00033390865,0.00006245867,0.00009049252,0.0037037183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909544,0.000011662793,0.00021148632,0.00018023494,0.0002450804,0.00025608097],"domain_scores_gemma":[0.9988438,0.0003208014,0.00009042997,0.0006835898,0.000017849452,0.000043553522],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051640364,0.00010622262,0.00010812721,0.000041087398,0.00028625302,0.000244459,0.0008334945,0.00003953619,0.0000062311683],"category_scores_gemma":[0.000029102604,0.0000673613,0.000044389442,0.00040655016,0.000046554364,0.00009201408,0.00028282305,0.00006956602,0.00084526936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.041025e-7,0.000007529141,0.0000010941147,0.000021201884,0.000008788828,0.0000020290822,0.0007904887,0.0000617391,0.00065452256,0.9867932,0.0044031553,0.0072555235],"study_design_scores_gemma":[0.00017062326,0.000008638517,0.000060278642,0.000016419255,0.000006576959,0.0000036866954,0.00058342936,0.2718906,0.0018438906,0.7170663,0.008182676,0.00016687851],"about_ca_topic_score_codex":5.8533027e-7,"about_ca_topic_score_gemma":6.8544495e-7,"teacher_disagreement_score":0.8082054,"about_ca_system_score_codex":0.000011194216,"about_ca_system_score_gemma":0.000015425789,"threshold_uncertainty_score":0.9999327},"labels":[],"label_agreement":null},{"id":"W4385173070","doi":"10.1007/s00224-023-10124-0","title":"Visit-Bounded Stack Automata","year":2023,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stack (abstract data type); Bounded function; Automaton; Computer science; Theoretical computer science; Mathematics; Discrete mathematics; Programming language; Mathematical analysis","score_opus":0.022901813855657052,"score_gpt":0.26026232340574407,"score_spread":0.23736050955008703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385173070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5225712,0.0002560031,0.46568042,0.00014056567,0.002105728,0.00027491603,0.0000064857736,0.002765027,0.0061996668],"genre_scores_gemma":[0.99706924,0.0000050915987,0.0019647384,0.00006397295,0.0001642435,0.0000034106508,0.000005670808,0.000022544835,0.0007010983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997682,0.0004957771,0.0005282492,0.0004051094,0.00044122702,0.00044767192],"domain_scores_gemma":[0.9975417,0.00088977424,0.00029809496,0.001091752,0.00008898422,0.000089654124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035726621,0.00019416364,0.00039858336,0.00025702195,0.00018448375,0.00019663242,0.0015862606,0.00007544324,0.0000067911064],"category_scores_gemma":[0.000084179825,0.0001757042,0.00010955454,0.0009006922,0.000100863945,0.00024310901,0.0005950097,0.000119048025,0.00038463308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006924799,0.00003221329,0.00007097511,0.00014776953,0.000045378434,0.00002060783,0.002076061,0.0016457177,0.0013828787,0.97836506,0.0016945422,0.01451187],"study_design_scores_gemma":[0.00062330154,0.00012190949,0.0026684597,0.00043648639,0.0000121179955,0.00006986065,0.00074127346,0.8841877,0.0014114468,0.107085355,0.0022291562,0.00041290873],"about_ca_topic_score_codex":0.000020253765,"about_ca_topic_score_gemma":2.2235183e-7,"teacher_disagreement_score":0.882542,"about_ca_system_score_codex":0.000037008296,"about_ca_system_score_gemma":0.000060207854,"threshold_uncertainty_score":0.716501},"labels":[],"label_agreement":null},{"id":"W4385240321","doi":"10.1017/jsl.2023.55","title":"FRACTAL DIMENSIONS OF <i>k</i>-AUTOMATIC SETS","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hausdorff dimension; Minkowski–Bouligand dimension; Mathematics; Fractal; Digraph; Automaton; Box counting; Fractal dimension; Cellular automaton; Effective dimension; Packing dimension; Characterization (materials science); Hausdorff measure; Dimension function; Measure (data warehouse); Discrete mathematics; Hausdorff space; Dimension (graph theory); Entropy (arrow of time); Combinatorics; Fractal analysis; Theoretical computer science; Computer science; Algorithm; Data mining; Mathematical analysis","score_opus":0.02116319322224567,"score_gpt":0.270180949605909,"score_spread":0.24901775638366333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385240321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98892707,0.00036924926,0.0075982143,0.0014139616,0.0007034541,0.00006243006,0.0000023956852,0.00012540026,0.0007978118],"genre_scores_gemma":[0.9933843,0.00013020639,0.00597387,0.00037061147,0.00007270384,9.436832e-7,5.31121e-7,0.00000719452,0.000059654947],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867404,0.00008114713,0.0005167619,0.000113751325,0.00039199882,0.00022230821],"domain_scores_gemma":[0.99872655,0.00027785648,0.00046060636,0.000312719,0.00011782781,0.00010444991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075799576,0.00010418625,0.00032131321,0.00028651202,0.000057815338,0.00003838796,0.00077029155,0.00005532919,0.000032722],"category_scores_gemma":[0.00013287929,0.00006498972,0.00016657611,0.000698808,0.0000495829,0.00035887607,0.00019995737,0.00016947987,0.00010063326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044919998,0.0014446821,0.0065292525,0.00048787592,0.00070159376,0.0029763624,0.013694604,0.002788623,0.18229008,0.34139937,0.08929197,0.35835066],"study_design_scores_gemma":[0.0026071111,0.0014793039,0.118820176,0.000910811,0.00012765611,0.0032595687,0.0012009662,0.2012902,0.01666807,0.64739674,0.0053913663,0.0008480121],"about_ca_topic_score_codex":0.000003102404,"about_ca_topic_score_gemma":2.1736305e-7,"teacher_disagreement_score":0.35750264,"about_ca_system_score_codex":0.000019048517,"about_ca_system_score_gemma":0.00008190085,"threshold_uncertainty_score":0.2650204},"labels":[],"label_agreement":null},{"id":"W4385360076","doi":"10.37236/11659","title":"The Lexicographically Least Square-Free Word with a Given Prefix","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Lexicographical order; Prefix; Mathematics; Combinatorics; Word (group theory); Morphism; Square-free integer; Alphabet; Sequence (biology); Arithmetic; Ruler; Discrete mathematics; Linguistics","score_opus":0.00559057445222522,"score_gpt":0.2058071930271715,"score_spread":0.20021661857494627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385360076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6635482,0.012911363,0.24209632,0.07549675,0.0022135305,0.00065880455,0.0000025445365,0.00062018714,0.002452309],"genre_scores_gemma":[0.998233,0.001069417,0.000042862932,0.00013096456,0.000090283786,0.0000062824943,2.5385202e-7,0.000018708326,0.00040819493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772924,0.00023652065,0.0003546494,0.00015842152,0.0007533272,0.0007678336],"domain_scores_gemma":[0.99771357,0.0006608649,0.0003835678,0.00092758395,0.00023054636,0.000083865314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00254535,0.00016900607,0.0002137077,0.00013963388,0.0004834581,0.0002485456,0.0038638778,0.000050628933,0.0000017522091],"category_scores_gemma":[0.00012001991,0.00008048377,0.00015209372,0.001866042,0.00015778148,0.00030716826,0.00034046298,0.00084896636,0.00001628002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060732265,0.000052127718,0.0001267102,0.000004441125,0.000105412786,0.0000248295,0.00032973647,0.000068952664,0.00007503342,0.9892146,0.0027452933,0.0071921353],"study_design_scores_gemma":[0.0008657809,0.00092395005,0.0017520153,0.00004352617,0.000028447423,0.00033361308,0.00017534995,0.0018320081,0.00022060542,0.9780952,0.015587378,0.0001421719],"about_ca_topic_score_codex":0.0000037747677,"about_ca_topic_score_gemma":0.000011199691,"teacher_disagreement_score":0.33468485,"about_ca_system_score_codex":0.00011150594,"about_ca_system_score_gemma":0.00044132918,"threshold_uncertainty_score":0.7180111},"labels":[],"label_agreement":null},{"id":"W4385710887","doi":"10.1007/978-3-031-40247-0_20","title":"Transduction of Automatic Sequences and Applications","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Fibonacci number; Computer science; Transduction (biophysics); Software; Theoretical computer science; Artificial intelligence; Algebra over a field; Combinatorics; Mathematics; Programming language; Pure mathematics","score_opus":0.015946788389805955,"score_gpt":0.24140513683281806,"score_spread":0.2254583484430121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385710887","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021837636,0.00034515077,0.99732214,0.00036735673,0.00046078197,0.0003057554,0.000005266996,0.00024542125,0.0007297558],"genre_scores_gemma":[0.4588737,0.00042985607,0.53874344,0.0006062851,0.0005860454,0.00007274855,0.000009804531,0.000065004526,0.0006131111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980557,0.00001947171,0.00037622292,0.00079368294,0.0004859576,0.00026899728],"domain_scores_gemma":[0.99850863,0.00037994626,0.00020493867,0.0007419465,0.00008940384,0.00007515691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064953876,0.00024307746,0.0003333245,0.00056967145,0.00013245,0.00016155394,0.0014591936,0.00015200334,0.000008966889],"category_scores_gemma":[0.000021441896,0.00021669855,0.000062024155,0.0005996076,0.0007542972,0.0003739247,0.00037425428,0.00026172912,0.000016332919],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.7210366e-7,0.000008789678,0.000015900243,0.00009454185,0.0000064993574,0.0000066381226,0.0004866271,0.0025346694,0.00037598505,0.120241225,0.000002331973,0.8762263],"study_design_scores_gemma":[0.00008878767,0.000069239264,0.00023732417,0.00030536563,0.0000069422654,0.00004976314,4.4927359e-7,0.3562998,0.0015263526,0.6409202,0.00021202806,0.00028371817],"about_ca_topic_score_codex":0.00001445937,"about_ca_topic_score_gemma":0.000016643311,"teacher_disagreement_score":0.8759426,"about_ca_system_score_codex":0.000054369742,"about_ca_system_score_gemma":0.0001941854,"threshold_uncertainty_score":0.88367105},"labels":[],"label_agreement":null},{"id":"W4386143380","doi":"10.1016/j.ic.2023.105080","title":"On the complexity of decision problems for some classes of machines and applications","year":2023,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Decision problem; Discrete mathematics; Regular language; Automaton; Mathematics; Bounded function; NP; Equivalence (formal languages); Theoretical computer science; Computer science; Time complexity; Turing machine; Algorithm","score_opus":0.036784323443912706,"score_gpt":0.2845674218857239,"score_spread":0.24778309844181123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386143380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1615186,0.000021439011,0.83732706,0.00059002737,0.000032098258,0.00033135965,0.000013170124,0.000051491403,0.00011472998],"genre_scores_gemma":[0.9949886,0.000022934664,0.0047405064,0.00016924378,0.0000069136677,0.000041006133,0.00002680736,0.0000013729127,0.0000025954903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958086,0.000013506954,0.00020759249,0.00005230477,0.00009907756,0.000046675897],"domain_scores_gemma":[0.99927205,0.00041598495,0.00014414905,0.00008607,0.0000683582,0.000013412567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025381637,0.000041776435,0.00006620191,0.00009616891,0.000087074666,0.000045726694,0.000101798934,0.000014797897,6.4982095e-7],"category_scores_gemma":[0.000029300707,0.000028662007,0.000015662117,0.00019391782,0.000068477086,0.0004718001,0.000048841343,0.000020501919,0.0000029996547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041591593,0.0000067862734,0.000021926113,0.00005081667,0.0000027653537,6.8821646e-9,0.00042075192,0.0019688285,0.000051857536,0.75759536,0.00019505703,0.23968169],"study_design_scores_gemma":[0.00013257477,0.000036375175,0.0037950515,0.000016318705,0.000001265219,9.882887e-7,0.000058302703,0.56951916,0.00016654428,0.42593592,0.0003134338,0.000024055838],"about_ca_topic_score_codex":0.0000050322124,"about_ca_topic_score_gemma":8.349118e-7,"teacher_disagreement_score":0.83347,"about_ca_system_score_codex":0.0000030962628,"about_ca_system_score_gemma":0.000009799295,"threshold_uncertainty_score":0.11688027},"labels":[],"label_agreement":null},{"id":"W4386297699","doi":"10.1007/978-3-031-42753-4_18","title":"Proving Results About OEIS Sequences with Walnut","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encyclopedia; Computer science; Integer sequence; Line (geometry); Software; Algorithm; Discrete mathematics; Mathematics; Programming language; Geometry; Library science","score_opus":0.016788354721212297,"score_gpt":0.232384581580104,"score_spread":0.2155962268588917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386297699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017867934,0.000263537,0.9882565,0.0013209328,0.0015614261,0.0004306464,0.000016710623,0.00077714375,0.007194388],"genre_scores_gemma":[0.22006609,0.00020414071,0.76705503,0.0036085397,0.00161659,0.00005159266,0.00003067732,0.00019253933,0.0071748076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99484605,0.000044537857,0.00062173273,0.0021867515,0.0013749432,0.0009259835],"domain_scores_gemma":[0.9964074,0.0008404621,0.00042253017,0.0018987498,0.0002266069,0.0002042479],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015678538,0.0006430896,0.0005900066,0.00087599905,0.00038238958,0.0010385455,0.0047662724,0.00029972417,0.000007783798],"category_scores_gemma":[0.00014188705,0.0004867509,0.000114846305,0.0011024623,0.0010192705,0.0009291793,0.0015878718,0.0008598869,0.00013299863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025004447,0.000024232435,0.000038012404,0.000088430024,0.000025882626,0.0007138642,0.002037084,0.019866837,0.00016357841,0.07298739,0.00009743361,0.9039323],"study_design_scores_gemma":[0.0007468824,0.00063018245,0.00036098948,0.0027272338,0.000017573999,0.00029861552,0.0000012405723,0.6092213,0.0024020658,0.37907335,0.0026936783,0.0018269035],"about_ca_topic_score_codex":0.00008160618,"about_ca_topic_score_gemma":0.00019048914,"teacher_disagreement_score":0.90210533,"about_ca_system_score_codex":0.0002410065,"about_ca_system_score_gemma":0.00082868023,"threshold_uncertainty_score":0.99999845},"labels":[],"label_agreement":null},{"id":"W4386399952","doi":"10.4204/eptcs.386.18","title":"A General Approach to Proving Properties of Fibonacci Representations via Automata Theory","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Fibonacci number; Automaton; Computer science; Representation (politics); Mathematical proof; Automata theory; Expression (computer science); Computation; Theoretical computer science; Algorithm; Mathematics; Algebra over a field; Discrete mathematics; Pure mathematics; Programming language","score_opus":0.011136977253306984,"score_gpt":0.2418375955661348,"score_spread":0.23070061831282782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386399952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4505789,0.00003704668,0.5444608,0.00061013456,0.00015032946,0.00048885186,6.5976167e-7,0.0005573314,0.0031159627],"genre_scores_gemma":[0.9553469,0.0000068623904,0.044178057,0.0002298141,0.00007977994,0.000103862345,7.8518195e-7,0.000017155411,0.00003682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626344,0.00006601976,0.0004948918,0.0010983994,0.0008457405,0.0012315328],"domain_scores_gemma":[0.9987663,0.0001210773,0.000119229604,0.0005823826,0.00021851351,0.0001924812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004280696,0.00024396213,0.00031470618,0.00078831846,0.00028120575,0.00035152867,0.0035786608,0.00006711689,0.000004061102],"category_scores_gemma":[0.00032482596,0.00020003323,0.00007582298,0.0052678357,0.0010607134,0.001092034,0.0019382575,0.00031753516,0.000029897248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014412356,0.00009891808,0.00010146607,0.000039821865,0.0000053133354,0.0000013516641,0.0024625505,0.0003623498,0.023413112,0.961377,0.000043690947,0.01208001],"study_design_scores_gemma":[0.00018038269,0.00015971428,0.0009696249,0.00006240289,0.0000029112773,0.000031042702,0.00007125857,0.6784519,0.023709806,0.29612365,0.000018240173,0.0002190443],"about_ca_topic_score_codex":0.0000072752955,"about_ca_topic_score_gemma":4.047088e-7,"teacher_disagreement_score":0.67808956,"about_ca_system_score_codex":0.00018022061,"about_ca_system_score_gemma":0.00032248776,"threshold_uncertainty_score":0.81571186},"labels":[],"label_agreement":null},{"id":"W4386476920","doi":"10.46298/dmtcs.10063","title":"Antisquares and Critical Exponents","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of Winnipeg; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Word (group theory); Binary number; Complement (music); Combinatorics; Repetition (rhetorical device); Word length; Exponential function; Exponent; Polynomial; Discrete mathematics; Arithmetic; Mathematical analysis; Linguistics; Geometry","score_opus":0.01649650406576732,"score_gpt":0.2822118731444805,"score_spread":0.2657153690787132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386476920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090426035,0.000035340523,0.9045629,0.0018368295,0.00045440329,0.0001487549,0.000004356637,0.00070453546,0.0018268687],"genre_scores_gemma":[0.80386156,0.000012830968,0.19575998,0.0002669907,0.00006315859,0.000010046975,0.0000012109637,0.000013531603,0.000010698404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707586,0.000079721474,0.00036857458,0.00079413695,0.0008849455,0.00079675013],"domain_scores_gemma":[0.997494,0.0009796009,0.0000592366,0.0009819785,0.000113778646,0.00037143604],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019079868,0.00024712516,0.00029611491,0.00030095835,0.0005616147,0.0010154638,0.0021210583,0.00006187766,0.000036291913],"category_scores_gemma":[0.00040443565,0.00019230285,0.000073035895,0.0014834747,0.0032585314,0.00085499074,0.0022778348,0.000173166,0.00024145524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012168108,0.000036695397,0.000026628992,0.000043408243,0.0000037382367,0.000037594877,0.0011961841,0.000005805823,0.0010392914,0.9900414,0.00010952436,0.007458517],"study_design_scores_gemma":[0.00008474077,0.00006324434,0.00041903154,0.000057306275,0.0000038735016,0.000049113027,0.000055076613,0.52481073,0.0008556998,0.47340092,0.00002419079,0.00017607537],"about_ca_topic_score_codex":0.0000010329355,"about_ca_topic_score_gemma":9.011306e-8,"teacher_disagreement_score":0.71343553,"about_ca_system_score_codex":0.000017681446,"about_ca_system_score_gemma":0.000048824095,"threshold_uncertainty_score":0.999454},"labels":[],"label_agreement":null},{"id":"W4386573223","doi":"10.1016/j.tcs.2023.114144","title":"Quantitative estimates for the size of an intersection of sparse automatic sets","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Intersection (aeronautics); Extension (predicate logic); Bounded function; Automaton; Mathematics; Natural number; Cellular automaton; Discrete mathematics; Fully automatic; Algorithm; Combinatorics; Computer science; Theoretical computer science","score_opus":0.025482411979982925,"score_gpt":0.3108738027439796,"score_spread":0.28539139076399667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386573223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35766777,0.000010813912,0.6413039,0.00025709294,0.00035685886,0.00017793552,0.0000038904345,0.00015530332,0.00006641884],"genre_scores_gemma":[0.7931552,0.0000010860084,0.20674492,0.000064127016,0.000015891981,0.000011464119,6.119674e-7,0.0000051737447,0.0000015315528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998501,0.00008363907,0.0003155997,0.00037135844,0.00041102796,0.00031738312],"domain_scores_gemma":[0.99539626,0.003505162,0.00014406283,0.00067852,0.00019484614,0.00008118166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024632355,0.000121307974,0.00021746742,0.00014423074,0.00021594275,0.00010954551,0.0020200685,0.000029912226,0.000013135302],"category_scores_gemma":[0.0005007966,0.000077931865,0.000077840785,0.0013588218,0.0023905884,0.0005326798,0.0005419558,0.000071051625,0.00001178955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011694594,0.000041782383,0.000011257714,0.000028527702,0.000008507928,0.0000012210475,0.0015399464,0.00081744324,0.0042533334,0.95195836,0.00002238053,0.04130555],"study_design_scores_gemma":[0.00011048017,0.00042152777,0.002090477,0.000038948303,0.000006727981,0.000006904339,0.00008362637,0.68922126,0.015989678,0.29196146,0.0000015200611,0.000067365865],"about_ca_topic_score_codex":0.0000065815916,"about_ca_topic_score_gemma":7.6038015e-7,"teacher_disagreement_score":0.68840384,"about_ca_system_score_codex":0.000019305644,"about_ca_system_score_gemma":0.00007791841,"threshold_uncertainty_score":0.8808223},"labels":[],"label_agreement":null},{"id":"W4387210513","doi":"10.48550/arxiv.2309.16100","title":"Generating functions of substitutions","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Substitution (logic); Aperiodic graph; Fibonacci number; Transcendental number; Mathematics; Generating function; Transcendental function; Combinatorics; Discrete mathematics; Pure mathematics; Computer science; Programming language; Mathematical analysis","score_opus":0.10465305964806462,"score_gpt":0.189659855983854,"score_spread":0.08500679633578936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387210513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23938021,0.00004202387,0.75820607,0.000060042305,0.0008833792,0.000093227674,0.000029421488,0.00040550096,0.0009001551],"genre_scores_gemma":[0.99352884,0.00006488436,0.002950158,0.000029185849,0.00007319074,8.902103e-7,0.000022942117,0.000011067279,0.0033188208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988715,0.0000752291,0.00017453745,0.0006107364,0.00006327808,0.00020473514],"domain_scores_gemma":[0.99850196,0.00011122479,0.00018265497,0.0010187608,0.000108551125,0.00007685129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021647027,0.00016233252,0.00020756098,0.00024512727,0.00018160725,0.000057004054,0.0011349429,0.0001501498,0.000022892602],"category_scores_gemma":[0.000037038302,0.00018840804,0.00017981854,0.00066290866,0.000103840575,0.00021834241,0.0014577619,0.00028788418,0.00014934003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017850198,0.00003750668,0.00075881754,0.00003101147,0.000052631694,0.000063318555,0.00010423553,0.46424195,0.0002183811,0.5335488,0.0005905567,0.0003510471],"study_design_scores_gemma":[0.00014837958,0.000017560347,0.0011068042,0.000079579506,0.000043769385,0.0000029539642,0.00009509733,0.9400469,0.00019175083,0.057673026,0.00034633314,0.00024786888],"about_ca_topic_score_codex":0.00016007456,"about_ca_topic_score_gemma":0.00004172209,"teacher_disagreement_score":0.7552559,"about_ca_system_score_codex":0.00007127624,"about_ca_system_score_gemma":0.00017008986,"threshold_uncertainty_score":0.7683057},"labels":[],"label_agreement":null},{"id":"W4387579616","doi":"10.1016/j.ipl.2023.106452","title":"Ranking and unranking bordered and unbordered words","year":2023,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of Winnipeg","keywords":"Suffix; Prefix; Word (group theory); Rank (graph theory); Ranking (information retrieval); Alphabet; Combinatorics; Space (punctuation); Mathematics; Computer science; Unit (ring theory); Arithmetic; Artificial intelligence; Linguistics; Geometry","score_opus":0.006699653823596698,"score_gpt":0.21484779076425592,"score_spread":0.20814813694065923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387579616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51423347,0.00015691912,0.47568318,0.008212909,0.00017291337,0.00012471179,0.0000014514623,0.00087566633,0.00053875375],"genre_scores_gemma":[0.98672503,0.000023927365,0.007936017,0.0052524423,0.000025453215,0.000010683331,0.0000101470005,0.000005988998,0.000010333383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919826,0.00002075595,0.00022846105,0.00013798679,0.00019405052,0.00022049391],"domain_scores_gemma":[0.99960357,0.000060209397,0.000118682205,0.00014128028,0.000031928692,0.00004433666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004039967,0.00010688271,0.000100673395,0.0002532218,0.00028752963,0.00081238104,0.00021137543,0.000036877937,0.0000019251572],"category_scores_gemma":[0.0000423138,0.000101001184,0.00001379879,0.0005967001,0.000054789667,0.0035257197,0.00015172937,0.00008785098,0.000017368266],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054688817,0.0000030522704,0.0006512957,0.00018938207,0.000008910389,0.000004509151,0.01351042,0.00020346249,0.0018280935,0.004926592,0.00081935053,0.9778495],"study_design_scores_gemma":[0.0017908037,0.000033040917,0.02226221,0.00046080234,0.000014659163,0.00010149663,0.0013466135,0.94344205,0.0011957566,0.010091262,0.01854171,0.0007196055],"about_ca_topic_score_codex":0.000007096303,"about_ca_topic_score_gemma":5.017667e-7,"teacher_disagreement_score":0.9771299,"about_ca_system_score_codex":0.0000130749895,"about_ca_system_score_gemma":0.000022977878,"threshold_uncertainty_score":0.78338087},"labels":[],"label_agreement":null},{"id":"W4387672295","doi":"10.46298/dmtcs.9919","title":"Pseudoperiodic Words and a Question of Shevelev","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Word (group theory); Exponent; Combinatorics; Linguistics; Philosophy","score_opus":0.01141992789671988,"score_gpt":0.2606217039301331,"score_spread":0.24920177603341323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387672295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17741743,0.00002847214,0.8201673,0.00054352835,0.00019965266,0.00014454877,0.000002875163,0.00030740214,0.0011888116],"genre_scores_gemma":[0.78247005,0.000015394202,0.21736217,0.00009236676,0.000030770665,0.000007650329,0.0000010019471,0.000009104413,0.000011513551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978032,0.000077445795,0.00039778458,0.0005508394,0.0006949978,0.00047573028],"domain_scores_gemma":[0.99837947,0.0003790169,0.000120445715,0.00081675674,0.00010450433,0.00019981866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024603826,0.00019347474,0.00029915053,0.00029545178,0.0002550953,0.0003771545,0.0016402656,0.00005315054,0.000019383806],"category_scores_gemma":[0.00017615159,0.0001477276,0.000065248736,0.0017426733,0.0024278108,0.00054459,0.001398639,0.00012742354,0.0000537734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016214718,0.000027548325,0.000029091316,0.0000530596,0.0000042986826,0.0000072408498,0.0025649483,0.000020139436,0.0016996138,0.98257905,0.000022701353,0.012990657],"study_design_scores_gemma":[0.00009053727,0.00007477621,0.00035069895,0.00009220409,0.000004314634,0.00002830105,0.0000676014,0.5779083,0.0015771498,0.41966438,0.000009196247,0.00013259755],"about_ca_topic_score_codex":0.0000018700983,"about_ca_topic_score_gemma":1.7774494e-7,"teacher_disagreement_score":0.6050526,"about_ca_system_score_codex":0.000017495535,"about_ca_system_score_gemma":0.00007242302,"threshold_uncertainty_score":0.89453703},"labels":[],"label_agreement":null},{"id":"W4387793828","doi":"10.1016/j.jcta.2023.105828","title":"Non-expansive matrix number systems with bases similar to certain Jordan blocks","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Expansive; Dimension (graph theory); Numerical digit; Eigenvalues and eigenvectors; Matrix (chemical analysis); Block (permutation group theory); Set (abstract data type); Base (topology); Context (archaeology); Jordan matrix; Logarithm; Combinatorics; Arithmetic; Representation (politics); Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.006912436830327222,"score_gpt":0.24505233938173857,"score_spread":0.23813990255141135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387793828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94073117,0.00023799246,0.035495073,0.0028386256,0.017019741,0.0006357563,0.00001840807,0.00037872145,0.002644502],"genre_scores_gemma":[0.9946878,0.000028270626,0.0027054413,0.00024180129,0.0009877429,0.000015057427,0.0000015518625,0.000038362887,0.0012939986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977039,0.00026631763,0.0005899147,0.00027348733,0.0007058461,0.00046051067],"domain_scores_gemma":[0.9977029,0.0005101451,0.00044916786,0.0005607813,0.00047786825,0.0002991126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018303848,0.00027896705,0.0005636039,0.0002612268,0.00021908313,0.0003931971,0.0012751848,0.00009551623,0.000052377527],"category_scores_gemma":[0.00018555524,0.00020514916,0.000159653,0.0011055061,0.000087058055,0.0009513305,0.00028598742,0.00028651697,0.00007995782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010602457,0.00013253083,0.0003459906,0.000058544705,0.00021185202,0.0010171146,0.002748731,0.002104456,0.0013652871,0.97398275,0.016225277,0.000747243],"study_design_scores_gemma":[0.004806471,0.00440045,0.0006332778,0.0009965554,0.0001300548,0.0021946456,0.008041244,0.0026584412,0.011014743,0.89561176,0.06827416,0.0012381985],"about_ca_topic_score_codex":0.000013578574,"about_ca_topic_score_gemma":8.6981504e-7,"teacher_disagreement_score":0.07837097,"about_ca_system_score_codex":0.000082247236,"about_ca_system_score_gemma":0.00022355978,"threshold_uncertainty_score":0.836574},"labels":[],"label_agreement":null},{"id":"W4388038106","doi":"10.4171/jems/1376","title":"A Tits alternative for endomorphisms of the projective line","year":2023,"lang":"en","type":"article","venue":"Journal of the European Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Endomorphism; Mathematics; Semigroup; Bounded function; Combinatorics; Field (mathematics); Finitely-generated abelian group; Line (geometry); Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.03220973432744556,"score_gpt":0.26607491508387443,"score_spread":0.23386518075642887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388038106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13641538,0.00008379916,0.84676564,0.007845315,0.0013234074,0.0008446614,0.000023406596,0.00008989749,0.0066084806],"genre_scores_gemma":[0.95099384,0.000027444674,0.0454657,0.00074688136,0.0005917598,0.0000059996073,2.4444955e-7,0.000037455688,0.0021306537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998673,0.00028668807,0.00039722273,0.00010235096,0.00038177607,0.00015893685],"domain_scores_gemma":[0.99828786,0.0006125971,0.0005350772,0.00035463524,0.00017024,0.00003957708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002458763,0.00009405668,0.00020269734,0.000017402926,0.0001243426,0.00004351595,0.0016426331,0.000020044185,0.0000053066055],"category_scores_gemma":[0.00053749484,0.000041998377,0.00061122153,0.00037191622,0.00012818235,0.0001252884,0.00056788884,0.0001998972,0.000017119204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007193579,0.0011012135,0.00013634756,0.0007257663,0.0013491422,0.00003752257,0.061959542,0.002058118,0.04167163,0.7368484,0.1263184,0.027721956],"study_design_scores_gemma":[0.0022357965,0.00038444856,0.0028002108,0.0009554806,0.00013638195,0.00023397947,0.0012902108,0.22404362,0.03437042,0.72954684,0.003707141,0.00029546217],"about_ca_topic_score_codex":3.750999e-7,"about_ca_topic_score_gemma":5.249285e-8,"teacher_disagreement_score":0.8145785,"about_ca_system_score_codex":0.000030706342,"about_ca_system_score_gemma":0.000045742712,"threshold_uncertainty_score":0.30524483},"labels":[],"label_agreement":null},{"id":"W4388127845","doi":"10.1007/s12188-023-00270-0","title":"An example of Tateno disproving conjectures of Bonato–Tardif, Thomasse, and Tyomkyn","year":2023,"lang":"de","type":"article","venue":"Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Counterexample; Exposition (narrative); Mathematics; Conjecture; Calculus (dental); Combinatorics; Discrete mathematics; Medicine; Literature","score_opus":0.022345725724244484,"score_gpt":0.24257450578485876,"score_spread":0.22022878006061428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388127845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90154016,0.028342064,0.065678105,0.0002472428,0.0007190762,0.0009832953,0.00022323274,0.00052252715,0.00174432],"genre_scores_gemma":[0.98597217,0.0011323841,0.011175238,0.00006375373,0.000117404,0.0000074615086,0.00006902738,0.000084022504,0.0013785703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962188,0.0003459731,0.00080189336,0.0010923146,0.00073250517,0.0008085364],"domain_scores_gemma":[0.9961603,0.0009255975,0.00080848584,0.0014742656,0.00026653064,0.00036479908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013246189,0.000610319,0.0011286235,0.0006223867,0.00033947921,0.00017768082,0.0014697256,0.00036341324,0.00013203527],"category_scores_gemma":[0.000072687006,0.000600853,0.00025885287,0.0012706415,0.00054814795,0.0017979662,0.0010428589,0.00032357805,0.00007580823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005511438,0.0016853693,0.00940033,0.0070158043,0.007814488,0.0023364068,0.17197946,0.00064423407,0.20719554,0.49443182,0.023340313,0.073605075],"study_design_scores_gemma":[0.012230288,0.0054653916,0.030493157,0.00931053,0.010956491,0.00091153267,0.047819685,0.3885919,0.27881768,0.15481758,0.05219279,0.008392999],"about_ca_topic_score_codex":0.0007185703,"about_ca_topic_score_gemma":0.0000297703,"teacher_disagreement_score":0.38794765,"about_ca_system_score_codex":0.00007169107,"about_ca_system_score_gemma":0.00020846953,"threshold_uncertainty_score":0.9996443},"labels":[],"label_agreement":null},{"id":"W4388317930","doi":"10.1093/oso/9780198505617.003.0005","title":"Interacting models of walks and polygons","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Combinatorics; Connection (principal bundle); Lattice (music); Order (exchange); Discrete mathematics; Physics; Geometry","score_opus":0.01825915297163308,"score_gpt":0.21343921491232112,"score_spread":0.19518006194068804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388317930","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000110224595,0.0004298039,0.045987163,0.000086739965,0.000112497655,0.000060337978,0.000005965316,0.000102983075,0.95310426],"genre_scores_gemma":[0.1696292,0.00057994545,0.029611243,0.00060518464,0.00011941505,0.0000028920006,0.000004796893,0.000050707684,0.79939663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923253,0.000006624985,0.00022427682,0.0002868526,0.0001299291,0.00011980711],"domain_scores_gemma":[0.99926704,0.00012655141,0.00011266362,0.00042178243,0.000021617505,0.000050342762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009443435,0.00016157758,0.00023327208,0.00010966409,0.000031635474,0.000054540888,0.00042485536,0.00011257207,0.00042703954],"category_scores_gemma":[0.000002364624,0.00013738972,0.00006900168,0.000015025458,0.00004412944,0.00029951386,0.00025500334,0.00015662065,0.000020309988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015472091,0.0000037224197,1.8391371e-7,0.000009854842,0.00001561235,0.0000047511,0.00022513406,0.000012669542,0.00004216612,0.90546125,0.00036312427,0.09385998],"study_design_scores_gemma":[0.00012228756,0.00004858796,0.0000017805058,0.00031690756,0.000015205443,0.00006917325,0.000017348759,0.1029842,0.00038300667,0.87420845,0.021494193,0.000338891],"about_ca_topic_score_codex":0.00003754101,"about_ca_topic_score_gemma":0.0000039911824,"teacher_disagreement_score":0.16951898,"about_ca_system_score_codex":0.000009406323,"about_ca_system_score_gemma":0.000023328406,"threshold_uncertainty_score":0.56025904},"labels":[],"label_agreement":null},{"id":"W4388976593","doi":"10.1007/s00605-023-01923-1","title":"Infinite products involving the period-doubling sequence","year":2023,"lang":"de","type":"article","venue":"Monatshefte für Mathematik","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Period (music); Sequence (biology); Period-doubling bifurcation; Mathematics; Chemistry; Physics; Nonlinear system; Biochemistry","score_opus":0.061072183985952704,"score_gpt":0.2963607394206391,"score_spread":0.2352885554346864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388976593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80713755,0.039718084,0.01581818,0.09781361,0.017772278,0.0046756137,0.00019767472,0.0080064405,0.008860545],"genre_scores_gemma":[0.9789814,0.0016887429,0.007876771,0.0017746738,0.0017990401,0.0002232108,0.00005736331,0.00018207081,0.0074167764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948743,0.00036052224,0.0009766546,0.001280395,0.0011918203,0.0013163321],"domain_scores_gemma":[0.9954688,0.0008687516,0.0005494132,0.0025932735,0.0003109842,0.0002087784],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003608936,0.0006591267,0.00061769906,0.00041670765,0.0011803474,0.0017193811,0.0034606638,0.00021961618,0.00016247427],"category_scores_gemma":[0.0010752693,0.00048777487,0.00025639773,0.0035937754,0.000427374,0.0011571423,0.001996807,0.0008099789,0.005817547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004763909,0.00049079396,0.00041898724,0.003032378,0.0006663589,0.0013204972,0.13248461,0.0023464693,0.033996463,0.6674327,0.09285827,0.0649048],"study_design_scores_gemma":[0.00077225914,0.00016373473,0.001282291,0.0016330051,0.000157628,0.00021848624,0.0036862036,0.71541864,0.005764055,0.14994667,0.119152784,0.0018042424],"about_ca_topic_score_codex":0.000042695152,"about_ca_topic_score_gemma":0.0000044260464,"teacher_disagreement_score":0.7130722,"about_ca_system_score_codex":0.00013019175,"about_ca_system_score_gemma":0.00034342406,"threshold_uncertainty_score":0.9997574},"labels":[],"label_agreement":null},{"id":"W4389314516","doi":"10.1145/3636362.3636364","title":"Complexity Column","year":2023,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Undecidable problem; Word problem (mathematics education); Decidability; Semigroup; Intersection (aeronautics); Mathematics; Group (periodic table); Column (typography); Decision problem; Computational complexity theory; Word (group theory); Discrete mathematics; Computer science; Theoretical computer science; Algebra over a field; Algorithm; Arithmetic; Pure mathematics","score_opus":0.06774780822632265,"score_gpt":0.28834727794661924,"score_spread":0.2205994697202966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389314516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80089116,0.00028373866,0.11418723,0.031143295,0.0036528497,0.0006419007,0.000028734987,0.007697579,0.04147351],"genre_scores_gemma":[0.96517843,0.000038009646,0.027804442,0.003915319,0.00022495196,0.00002656465,0.000018886672,0.000018158475,0.0027752167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900633,0.000058275444,0.00014434301,0.000303457,0.00017827842,0.00030929066],"domain_scores_gemma":[0.99843735,0.00023509676,0.00004409602,0.0011788419,0.000022643033,0.00008196068],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002568048,0.000095931675,0.00013204926,0.000072816634,0.00012854117,0.00012156821,0.0017609877,0.00004503014,0.000083160514],"category_scores_gemma":[0.00016543717,0.00008939292,0.00005823435,0.0006704933,0.00006451898,0.0002449986,0.0009538431,0.00008630574,0.0024481546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043823497,0.000058015245,0.0041301576,0.000016022354,0.000022310845,0.00011466054,0.0008383735,0.000029984529,0.0038361012,0.46658507,0.3721539,0.15221104],"study_design_scores_gemma":[0.00055881223,0.00010546459,0.06249384,0.000019928793,0.0000056532062,0.00003103154,0.00015861438,0.03549786,0.0018098328,0.71532047,0.18354154,0.00045695243],"about_ca_topic_score_codex":0.00012629952,"about_ca_topic_score_gemma":0.00004541925,"teacher_disagreement_score":0.24873541,"about_ca_system_score_codex":0.000017736591,"about_ca_system_score_gemma":0.000029030807,"threshold_uncertainty_score":0.99832857},"labels":[],"label_agreement":null},{"id":"W4389719752","doi":"10.1016/j.tcs.2023.114343","title":"A note on the Lie complexity and beyond","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Simple Lie group; Lie theory; Representation of a Lie group; Adjoint representation of a Lie algebra; Prefix; Algebra over a field; Discrete mathematics; Pure mathematics; Lie group; Lie conformal algebra; Linguistics; Philosophy","score_opus":0.02409785001389637,"score_gpt":0.2646157875610625,"score_spread":0.24051793754716616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389719752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17320918,0.000014292694,0.7898198,0.026612803,0.0006616799,0.00021215477,0.0000033721328,0.00073088444,0.008735847],"genre_scores_gemma":[0.9743629,0.0000057304014,0.020977825,0.0045275316,0.000094012285,0.000006963427,4.7913e-7,0.0000065066542,0.000018040866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997883,0.00013287511,0.00016965633,0.0006357102,0.0006289521,0.00054976495],"domain_scores_gemma":[0.9976858,0.0010683385,0.000041028045,0.0009501834,0.000059987433,0.0001947001],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024244958,0.0001611833,0.00015163326,0.00015354776,0.00076860597,0.0006017765,0.002468853,0.00003499023,0.000031535317],"category_scores_gemma":[0.00012656182,0.00009690671,0.00004452017,0.0016254914,0.004533845,0.00032700383,0.001810092,0.00021027346,0.00038749547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028442105,0.000016366395,0.000006570012,0.0000022595561,0.0000014628502,0.000011375067,0.0005033686,0.000010373495,0.0002684161,0.9627701,0.00042236468,0.035984498],"study_design_scores_gemma":[0.00006631067,0.00008726135,0.0013658106,0.000010152135,0.000001029571,0.000015241163,0.000007650916,0.42181307,0.0009030102,0.57541466,0.00021511775,0.000100719786],"about_ca_topic_score_codex":0.0000014134414,"about_ca_topic_score_gemma":3.0949707e-7,"teacher_disagreement_score":0.8011537,"about_ca_system_score_codex":0.000023273655,"about_ca_system_score_gemma":0.000052886644,"threshold_uncertainty_score":0.99817526},"labels":[],"label_agreement":null},{"id":"W4390338595","doi":"10.1016/j.tcs.2023.114363","title":"Proving properties of some greedily-defined integer recurrences via automata theory","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Simple (philosophy); Conjecture; Automaton; Integer (computer science); Property (philosophy); Sequence (biology); Integer sequence; Discrete mathematics; Mathematics; Automata theory; Computer science; Combinatorics; Integer programming; Algorithm; Theoretical computer science; Generating function; Programming language","score_opus":0.01861407997515179,"score_gpt":0.2358628531487552,"score_spread":0.21724877317360342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390338595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2379868,0.00013505768,0.75606775,0.0012655732,0.0018703792,0.0003061307,0.0000037544726,0.0013475304,0.0010170459],"genre_scores_gemma":[0.9817321,0.000014873086,0.017714808,0.00029620712,0.000179775,0.000018621808,0.0000012400209,0.000014320328,0.000028094491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964058,0.0002707084,0.0005280762,0.00091426424,0.001056526,0.0008246377],"domain_scores_gemma":[0.9976588,0.0004633383,0.00017106796,0.0012573688,0.00022304112,0.00022639817],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0047584632,0.00028206338,0.00038030007,0.00049965625,0.00039759532,0.00036931134,0.0045758854,0.00007541631,0.000023260525],"category_scores_gemma":[0.00033805103,0.00019849613,0.00011523583,0.002534784,0.0045313155,0.00161776,0.0026830048,0.00024540894,0.00021779553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013324015,0.000055899654,0.00003595776,0.00004219951,0.000006808978,0.000010376627,0.0011235595,0.00004470755,0.011070911,0.91325754,0.000059636397,0.074279055],"study_design_scores_gemma":[0.00015263626,0.0001865228,0.0004023238,0.00015659536,0.0000051823513,0.000025296958,0.000033464366,0.49926955,0.022292567,0.47718826,0.00003939015,0.00024822436],"about_ca_topic_score_codex":0.000006349661,"about_ca_topic_score_gemma":2.8116943e-7,"teacher_disagreement_score":0.74374527,"about_ca_system_score_codex":0.00004268608,"about_ca_system_score_gemma":0.00022432218,"threshold_uncertainty_score":0.99817777},"labels":[],"label_agreement":null},{"id":"W4390604910","doi":"10.1007/s00283-023-10316-z","title":"On the Three-Distance Theorem","year":2024,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Mathematics","score_opus":0.03363884972925238,"score_gpt":0.2801526812953224,"score_spread":0.24651383156607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390604910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026905457,0.0007007225,0.9501919,0.011109149,0.00036647648,0.00022229052,0.0000019983977,0.00037885425,0.03433805],"genre_scores_gemma":[0.99461937,0.000023289529,0.0017487735,0.0018216171,0.00011722204,0.00006083653,2.5010948e-7,0.000018896246,0.0015897526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986996,0.00009665244,0.000241173,0.00030107933,0.0003726735,0.00028880753],"domain_scores_gemma":[0.9954809,0.0033276302,0.000030505142,0.0010875505,0.000024937332,0.000048505888],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012643081,0.00016975508,0.00013343361,0.000033447704,0.00019411069,0.0005266597,0.0019963707,0.000044076118,0.0012049291],"category_scores_gemma":[0.00018909786,0.00006622849,0.00013185256,0.0004234936,0.00029850056,0.00014199893,0.00026262988,0.00031293064,0.004483776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002763649,0.000024193168,2.2395533e-7,0.000020420011,0.000019107427,0.000009069796,0.0010784322,0.000017534663,0.00003422207,0.9685313,0.004098817,0.026163934],"study_design_scores_gemma":[0.0000067378996,0.000025377489,0.0000021239155,0.0001278362,0.0000056590234,0.000017015947,0.00006817198,0.2529011,0.001719588,0.74217963,0.0028650817,0.00008166958],"about_ca_topic_score_codex":0.0000024195308,"about_ca_topic_score_gemma":0.000001748275,"teacher_disagreement_score":0.9919288,"about_ca_system_score_codex":0.000028754901,"about_ca_system_score_gemma":0.000027201602,"threshold_uncertainty_score":0.9997081},"labels":[],"label_agreement":null},{"id":"W4390659634","doi":"10.5802/alco.322","title":"A <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>q</mml:mi> </mml:math> -analog of the Markoff injectivity conjecture holds","year":2024,"lang":"en","type":"article","venue":"Algebraic Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Conjecture; Uniqueness; Mathematics; Christoffel symbols; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis","score_opus":0.011110837522224365,"score_gpt":0.2229008874173038,"score_spread":0.21179004989507944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390659634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891579,0.001125617,0.0033433163,0.0007182142,0.0026218512,0.00006782549,0.000022279813,0.00030634736,0.0026366322],"genre_scores_gemma":[0.9987173,0.00006770431,0.00028927106,0.0005140894,0.00014039742,0.000053723918,0.000010997445,0.000057097244,0.00014939367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758834,0.00015381788,0.00041985625,0.0006189097,0.0007240087,0.00049505435],"domain_scores_gemma":[0.99751675,0.00068874145,0.00026287496,0.0013363869,0.000059492693,0.00013573235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009357593,0.000286651,0.00022681266,0.00012051896,0.0003212169,0.0003757498,0.0015029154,0.00034407544,0.000031949632],"category_scores_gemma":[0.0002500011,0.00026939384,0.00042224358,0.001038809,0.0002536724,0.00046752716,0.001168046,0.0005928578,0.00019728375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104166265,0.00010703591,0.0000305236,0.0001865999,0.00014042293,0.000112757065,0.00094840856,0.00003587719,0.00033752032,0.9927721,0.0024610113,0.0028573377],"study_design_scores_gemma":[0.0005549218,0.0004623246,0.0009848065,0.000381905,0.00019158714,0.00041643725,0.00020342742,0.739056,0.012586684,0.23722775,0.007363926,0.00057023397],"about_ca_topic_score_codex":0.00014381965,"about_ca_topic_score_gemma":0.000023950974,"teacher_disagreement_score":0.75554436,"about_ca_system_score_codex":0.00003178695,"about_ca_system_score_gemma":0.0003823601,"threshold_uncertainty_score":0.9999758},"labels":[],"label_agreement":null},{"id":"W4390714611","doi":"10.55016/ojs/cdm.v17i1.67951","title":"Pushes in words-a primitive sorting algorithm","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Alphabet; Sorting; Combinatorics; Mathematics; Statistic; Order (exchange); Word (group theory); Degree (music); Function (biology); Algorithm; Discrete mathematics; Arithmetic; Statistics; Geometry","score_opus":0.010191505785043426,"score_gpt":0.2709214146603092,"score_spread":0.2607299088752658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014120199,0.00013614866,0.98102736,0.0020641228,0.00019569248,0.0004415725,0.00016118799,0.0002217604,0.0016319661],"genre_scores_gemma":[0.81541014,0.0000042039283,0.18312915,0.0005716966,0.00005948912,0.00041729145,0.000029837385,0.000020045065,0.00035816955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983857,0.000113637165,0.0004198815,0.00031823086,0.00033049882,0.00043200175],"domain_scores_gemma":[0.9988398,0.00029169148,0.00013411559,0.0005553816,0.000070983144,0.000108054155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009339133,0.00015041728,0.00025306092,0.00019323909,0.000406183,0.00014359024,0.000891198,0.000029826511,0.00006788693],"category_scores_gemma":[0.0003801153,0.00014898725,0.000084023595,0.0009052229,0.000032932116,0.00024003278,0.001042254,0.00023555846,0.00005458295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022179827,0.00019496353,0.000052061376,0.000013544712,0.000020346377,0.000042433778,0.0056133713,0.0006578742,0.0005361619,0.9652336,0.00056680903,0.027066581],"study_design_scores_gemma":[0.00085620163,0.00015843251,0.0007340172,0.000100398545,0.000020600295,0.00008629031,0.0043396913,0.6785365,0.0019042018,0.30612874,0.0065045212,0.0006304199],"about_ca_topic_score_codex":0.000011895671,"about_ca_topic_score_gemma":0.0000040491964,"teacher_disagreement_score":0.8012899,"about_ca_system_score_codex":0.00027183053,"about_ca_system_score_gemma":0.0000886851,"threshold_uncertainty_score":0.60755235},"labels":[],"label_agreement":null},{"id":"W4391197450","doi":"10.1016/j.disc.2024.113902","title":"An upper bound of the number of distinct powers in binary words","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Binary number; Upper and lower bounds; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.009969578661615004,"score_gpt":0.2774593452152697,"score_spread":0.2674897665536547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391197450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9653566,0.00014611482,0.02886833,0.00021386184,0.00026503066,0.000113805836,0.000014220665,0.00006218664,0.0049598734],"genre_scores_gemma":[0.9881421,0.0000038105986,0.011640428,0.0000243848,0.000013783831,0.0000043741306,0.0000015374203,0.000012124439,0.0001574574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909294,0.00004916577,0.00030646322,0.00016867807,0.00023643981,0.0001463153],"domain_scores_gemma":[0.99903303,0.00015217045,0.00007980472,0.0006886243,0.00001721918,0.000029151919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038315353,0.000103746395,0.00017811687,0.000053039454,0.000025702517,0.00006970789,0.0008088047,0.00003948364,0.000053907213],"category_scores_gemma":[0.000033585806,0.00006410001,0.00009576214,0.00045085832,0.000117229436,0.0002339611,0.00020749484,0.00009554053,0.000013859557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003065428,0.00019272346,0.0035456766,0.0005675559,0.00002816382,0.00001686499,0.014156749,0.000028553543,0.003253778,0.9744085,0.00019935475,0.003598983],"study_design_scores_gemma":[0.00027628234,0.000084066705,0.020163989,0.0016001388,0.000036063397,0.00007480798,0.0023889341,0.4492408,0.0055671395,0.51973486,0.0004395075,0.00039337415],"about_ca_topic_score_codex":0.00001640047,"about_ca_topic_score_gemma":0.0000032609812,"teacher_disagreement_score":0.45467365,"about_ca_system_score_codex":0.000017380858,"about_ca_system_score_gemma":0.000044224293,"threshold_uncertainty_score":0.26139224},"labels":[],"label_agreement":null},{"id":"W4391425602","doi":"10.1016/j.aam.2024.102673","title":"Block-counting sequences are not purely morphic","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Block (permutation group theory); Arithmetic; Combinatorics; Discrete mathematics","score_opus":0.013040888794188792,"score_gpt":0.25576779638567254,"score_spread":0.24272690759148374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391425602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07386082,0.0133703975,0.84972364,0.0013193395,0.0017508987,0.000777468,0.000013860807,0.0022976876,0.05688589],"genre_scores_gemma":[0.81696486,0.0002498159,0.18230984,0.00023082101,0.000085223444,0.00005932147,9.196311e-7,0.000020210276,0.00007900901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985061,0.000010612319,0.00037680438,0.00042886037,0.00034190642,0.00033569586],"domain_scores_gemma":[0.9988205,0.0005150336,0.00012181492,0.00048131603,0.000016131351,0.00004521457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005394072,0.00020007252,0.00025652253,0.00015455055,0.00007431933,0.0002850107,0.0008730012,0.00006757733,0.000010697747],"category_scores_gemma":[0.00004839222,0.00016814894,0.000051105555,0.000612979,0.00008027568,0.0005563596,0.00021444153,0.00022974185,0.00016917272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010116185,0.000043685253,0.000024722405,0.00047027817,0.0000063744037,0.00005965956,0.00092319655,0.00057994906,0.0016684415,0.9685974,0.00005982636,0.02756544],"study_design_scores_gemma":[0.00013821313,0.000015325853,0.000034726294,0.0005974238,0.00000957275,0.00006562037,0.00053536496,0.1745353,0.007538174,0.8070491,0.009090992,0.00039017128],"about_ca_topic_score_codex":0.0000015901326,"about_ca_topic_score_gemma":0.00000680137,"teacher_disagreement_score":0.74310404,"about_ca_system_score_codex":0.000047523914,"about_ca_system_score_gemma":0.000035735993,"threshold_uncertainty_score":0.6856914},"labels":[],"label_agreement":null},{"id":"W4391582431","doi":"10.2139/ssrn.4718463","title":"Strongly K-Recursive Sequences","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009025874379821783,"score_gpt":0.24931339586989018,"score_spread":0.2402875214900684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391582431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1207562,0.11707699,0.72544354,0.012803706,0.012547379,0.00059422804,0.00003460627,0.001223077,0.009520297],"genre_scores_gemma":[0.9849146,0.0067602023,0.003668524,0.00017163139,0.0014478961,0.00002190953,0.000008406319,0.00005288761,0.0029539692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99519175,0.00017873681,0.00044619406,0.0007246705,0.0005623754,0.002896278],"domain_scores_gemma":[0.9986249,0.00007925989,0.00031901925,0.0007141267,0.00011849762,0.00014415276],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024075753,0.00040806082,0.000384059,0.00030300196,0.0001936406,0.00099333,0.0030885471,0.00026954568,0.000022910244],"category_scores_gemma":[0.00003958488,0.00033711985,0.00037897823,0.00026886395,0.00008205789,0.00027091653,0.0020392989,0.008557352,0.0002684226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040502887,0.000022438175,0.000010609287,0.000028132843,0.00026794316,0.000058173544,0.00036656237,0.00032618575,0.000048925132,0.94682384,0.0005188608,0.051524278],"study_design_scores_gemma":[0.00011895594,0.00015960225,0.000013096721,0.0002138028,0.000049516133,0.001068179,0.00052637927,0.0053853574,0.00011376768,0.9907923,0.0011789663,0.00038010292],"about_ca_topic_score_codex":0.000071916955,"about_ca_topic_score_gemma":0.00012150616,"teacher_disagreement_score":0.8641584,"about_ca_system_score_codex":0.0015040492,"about_ca_system_score_gemma":0.008290367,"threshold_uncertainty_score":0.9999081},"labels":[],"label_agreement":null},{"id":"W4392637423","doi":"10.1007/978-3-031-42891-3_4","title":"Polák Theorem","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lattice (music); Mathematics; Combinatorics; Discrete mathematics; Physics","score_opus":0.01263921902068846,"score_gpt":0.22713107458747436,"score_spread":0.2144918555667859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392637423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003585432,0.0016314188,0.5008784,0.0003620286,0.000357118,0.0002169305,0.00055619824,0.00028361508,0.49571067],"genre_scores_gemma":[0.0032607112,0.001740105,0.6161623,0.001031677,0.00043478596,0.000042996835,0.00003515687,0.0003246091,0.37696767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823636,0.00001507596,0.00041775312,0.0005795921,0.0004576185,0.00029359982],"domain_scores_gemma":[0.996781,0.0020066472,0.00020088966,0.00082798814,0.000055228204,0.00012823612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032254177,0.0005213022,0.0005728059,0.00022982545,0.00013753473,0.00049032294,0.00066853367,0.00027352266,0.00024571366],"category_scores_gemma":[0.00018252054,0.00039136538,0.000118869335,0.00004007782,0.00014850851,0.000044383884,0.00025029486,0.00041843278,0.0003897344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021550766,0.000018060258,2.5525903e-8,0.0003617117,0.000105794395,0.000083471605,0.00029942516,0.0000030899478,0.000013518976,0.9322126,0.0069800797,0.05992008],"study_design_scores_gemma":[0.000035804547,0.00006575421,6.28465e-7,0.0006424347,0.000107277694,0.000049360966,0.000009430705,0.018045176,0.00016863064,0.94494873,0.035490155,0.00043659715],"about_ca_topic_score_codex":0.0000015947841,"about_ca_topic_score_gemma":0.0000033015838,"teacher_disagreement_score":0.118743,"about_ca_system_score_codex":0.00004216135,"about_ca_system_score_gemma":0.000056491874,"threshold_uncertainty_score":0.99985385},"labels":[],"label_agreement":null},{"id":"W4392637424","doi":"10.1007/978-3-031-42891-3","title":"Completely Regular Semigroup Varieties","year":2024,"lang":"en","type":"book","venue":"Synthesis lectures on mathematics and statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semigroup; Mathematics; Pure mathematics; Algebra over a field","score_opus":0.013641426260821954,"score_gpt":0.2234866828034824,"score_spread":0.20984525654266045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392637424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000054522357,0.00265809,0.8689007,0.0003301967,0.0004967824,0.0003135776,0.0008527624,0.00041066436,0.12603177],"genre_scores_gemma":[0.0004526049,0.0009455562,0.68900955,0.00089526403,0.00042553118,0.00012366273,0.00009525153,0.00025202124,0.30780056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748695,0.00006366854,0.0005791998,0.0007537142,0.0006942314,0.00042222737],"domain_scores_gemma":[0.99519384,0.0031937133,0.00028272404,0.0010890325,0.00008598308,0.0001546822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000503997,0.0006589714,0.00085407443,0.00028076675,0.00021826399,0.000838042,0.0009612221,0.00037116822,0.0001352592],"category_scores_gemma":[0.00034475038,0.0005270001,0.0001469308,0.00010783422,0.00022092594,0.00006897871,0.00037953383,0.0005904432,0.00024044319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026185935,0.00003392126,4.319823e-8,0.00096650596,0.00013675338,0.00009185732,0.0005677187,0.0000076153206,0.00001481223,0.7906995,0.18417151,0.023307191],"study_design_scores_gemma":[0.00004967444,0.00009679313,0.0000015511018,0.0007345233,0.00014845084,0.00006294208,0.000018417879,0.037797675,0.00012797724,0.83186305,0.12855995,0.0005390143],"about_ca_topic_score_codex":0.0000031886,"about_ca_topic_score_gemma":0.0000053389854,"teacher_disagreement_score":0.18176879,"about_ca_system_score_codex":0.000101491576,"about_ca_system_score_gemma":0.00019456187,"threshold_uncertainty_score":0.9997181},"labels":[],"label_agreement":null},{"id":"W4392666729","doi":"10.1007/978-3-031-42891-3_1","title":"Fully Invariant Relations","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Unary operation; Semigroup; Mathematics; Congruence relation; Invariant (physics); Pure mathematics; Special classes of semigroups; Simple (philosophy); Lattice (music); Discrete mathematics; Physics; Mathematical physics; Philosophy","score_opus":0.014132907423223737,"score_gpt":0.2223231287260272,"score_spread":0.20819022130280346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392666729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016679932,0.0007223608,0.582641,0.00043311462,0.00024127535,0.00018685241,0.0004671723,0.00019151028,0.415115],"genre_scores_gemma":[0.0015740157,0.00070464314,0.65733135,0.00048178528,0.00021156817,0.000037145925,0.00003602718,0.00016559946,0.33945787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984079,0.000015106105,0.00044118843,0.0005026446,0.00039783728,0.00023532867],"domain_scores_gemma":[0.9963229,0.0025789116,0.0002065148,0.00071599614,0.000060420534,0.00011526734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029006804,0.00042090812,0.00047133924,0.00023539264,0.00017211467,0.00045527812,0.00049859245,0.00026604603,0.00032472576],"category_scores_gemma":[0.00031281318,0.0003342709,0.00009592246,0.00004611147,0.000101266865,0.00005433071,0.0002084214,0.00042941773,0.0007734203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001435244,0.000018408055,3.8160678e-8,0.00021847652,0.00010107354,0.00008432135,0.00031933596,0.000013115777,0.000010595428,0.965283,0.012851224,0.021098988],"study_design_scores_gemma":[0.00003415256,0.000047582,0.0000013570174,0.0005565179,0.00012461754,0.000045367833,0.000007197598,0.03406555,0.00004273967,0.9155117,0.049195725,0.00036745353],"about_ca_topic_score_codex":0.0000021509738,"about_ca_topic_score_gemma":0.0000077057075,"teacher_disagreement_score":0.07565714,"about_ca_system_score_codex":0.000049359576,"about_ca_system_score_gemma":0.000082080245,"threshold_uncertainty_score":0.99991095},"labels":[],"label_agreement":null},{"id":"W4392733094","doi":"10.1017/9781108874144.021","title":"Residue forms and classical Morse theory","year":2024,"lang":"en","type":"other","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Residue (chemistry); Morse code; Mathematics; Computer science; Chemistry; Biochemistry; Telecommunications","score_opus":0.007096372368530567,"score_gpt":0.23025699159241575,"score_spread":0.2231606192238852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392733094","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004943155,0.0028846064,0.07610779,0.00076201436,0.00037641404,0.00010115276,0.0000064585647,0.0011525506,0.9186041],"genre_scores_gemma":[0.0002927713,0.00009817508,0.0076372353,0.0008373347,0.00020719918,0.000009594837,0.0000028482339,0.00017430489,0.99074054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990267,0.000037002526,0.000116217474,0.00046740496,0.00015242385,0.00020021424],"domain_scores_gemma":[0.9992318,0.000060478567,0.000039070965,0.0005815571,0.000004662557,0.00008240667],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002591953,0.00019507947,0.0001964345,0.00016395758,0.000018541037,0.00020088008,0.0005387933,0.00019800189,0.00070526305],"category_scores_gemma":[0.000011832846,0.00012474916,0.00005702428,0.00012237536,0.00008649977,0.00008278182,0.0004706974,0.00018848138,0.0016393155],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.170899e-7,0.0000047193653,4.0767856e-7,0.000027334296,0.000013414793,0.000024201652,0.000028861963,9.962526e-9,0.0000033647643,0.527459,0.46287608,0.009562065],"study_design_scores_gemma":[0.000059523096,0.000019071937,0.0000074112213,0.00011693124,0.000008709984,0.000026351521,0.000013840783,0.000782174,0.000029812221,0.34848705,0.65026665,0.00018249583],"about_ca_topic_score_codex":0.000019201118,"about_ca_topic_score_gemma":0.000024987688,"teacher_disagreement_score":0.18739052,"about_ca_system_score_codex":0.000009942113,"about_ca_system_score_gemma":0.000025958405,"threshold_uncertainty_score":0.999138},"labels":[],"label_agreement":null},{"id":"W4392869357","doi":"10.1016/j.tcs.2024.114506","title":"Converting finite width AFAs to nondeterministic and universal finite automata","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic finite automaton; Mathematics; Deterministic finite automaton; Multiplicative function; Finite-state machine; Discrete mathematics; Combinatorics; Deterministic automaton; ω-automaton; String (physics); Automaton; Quantum finite automata; Algorithm; Automata theory; Computer science; Mathematical analysis; Theoretical computer science","score_opus":0.008332763396113298,"score_gpt":0.24151685799936656,"score_spread":0.23318409460325326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392869357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029432828,0.00006651143,0.9642003,0.0022428646,0.001070983,0.00015708034,0.000005907182,0.0008185094,0.0020049934],"genre_scores_gemma":[0.9112746,0.0000058141827,0.0871994,0.00134142,0.0001238481,0.0000043691325,7.691958e-7,0.000013628133,0.000036149817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727404,0.00009755846,0.0002912315,0.0010747806,0.0005762907,0.00068609184],"domain_scores_gemma":[0.9973768,0.001225053,0.000035964575,0.00081517745,0.000077519195,0.00046948742],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014366453,0.00025058366,0.00023743013,0.00036755527,0.00038676907,0.001416113,0.0020972798,0.000056793164,0.000042562864],"category_scores_gemma":[0.00019634077,0.00020946104,0.000058326463,0.0015077968,0.0021328302,0.00094027864,0.0021865321,0.00022901697,0.00029319612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004747222,0.000016180491,0.000011666916,0.00002427345,0.0000046637333,0.00014516774,0.0010113209,0.000119039505,0.0004696637,0.8815321,0.000056566518,0.11660466],"study_design_scores_gemma":[0.0001238733,0.0002312368,0.0002579628,0.00015316902,0.0000071288136,0.00008006045,0.0000105679765,0.8660677,0.0009361424,0.13120124,0.00065157237,0.0002793635],"about_ca_topic_score_codex":0.000003452925,"about_ca_topic_score_gemma":3.1931165e-7,"teacher_disagreement_score":0.8818418,"about_ca_system_score_codex":0.000060880284,"about_ca_system_score_gemma":0.00018036239,"threshold_uncertainty_score":0.9996205},"labels":[],"label_agreement":null},{"id":"W4392927464","doi":"10.4171/jca/86","title":"MV polytopes and reduced double Bruhat cells","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Combinatorics; Mathematics","score_opus":0.008454146210108456,"score_gpt":0.23359797268799598,"score_spread":0.22514382647788753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392927464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95398736,0.0066160792,0.006577157,0.002946861,0.028041633,0.000111465255,0.0000013662786,0.00015387469,0.0015642331],"genre_scores_gemma":[0.99698764,0.00015315443,0.0015566924,0.00011987032,0.0009975085,8.8019874e-7,1.7829308e-7,0.000012595693,0.00017149979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882597,0.00005760144,0.00036937266,0.0001857468,0.00035749996,0.00020378371],"domain_scores_gemma":[0.9992286,0.00017093067,0.00013860516,0.00022028688,0.000088273526,0.00015332537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067099737,0.00013404357,0.00024980208,0.0001781584,0.00007432235,0.00065320195,0.0006244974,0.0000723776,0.000024044517],"category_scores_gemma":[0.000017904391,0.000102611266,0.000118026925,0.000299261,0.000046020592,0.000989703,0.00017839599,0.00027175015,0.000026287104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004353859,0.000060326354,0.0000103323755,0.000033036675,0.000060896975,0.00019697662,0.0005549883,0.0000023604002,0.03388366,0.9394496,0.0072208783,0.018483408],"study_design_scores_gemma":[0.002332204,0.0007581338,0.00030574555,0.00032794755,0.000052819356,0.0007013732,0.00006844067,0.0017106247,0.15986493,0.7870968,0.046412643,0.00036833892],"about_ca_topic_score_codex":0.0000073037627,"about_ca_topic_score_gemma":1.6951334e-7,"teacher_disagreement_score":0.1523528,"about_ca_system_score_codex":0.000037797017,"about_ca_system_score_gemma":0.00014367215,"threshold_uncertainty_score":0.6298841},"labels":[],"label_agreement":null},{"id":"W4394793213","doi":"10.61091/ars158-11","title":"Prefixes of Stanley’s Catalan Paths with Odd Returns to the \\(x\\)-axis–Standard Version and Skew Catalan-Stanley Paths","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Catalan number; Catalan; Combinatorics; Skew; Tuple; Alphabet; Order (exchange); Set (abstract data type); Discrete mathematics; Computer science; Humanities; Telecommunications","score_opus":0.006239565600843324,"score_gpt":0.2159879738433406,"score_spread":0.20974840824249727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9897013,0.0027208426,0.0019293006,0.0018541499,0.0019808419,0.0004644865,0.00017047906,0.00033396756,0.00084467616],"genre_scores_gemma":[0.99845624,0.000107770335,0.00095351966,0.00015327462,0.000018641102,0.000020028661,0.000018428089,0.000027263754,0.00024481968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981585,0.00010059695,0.0002716509,0.0005633518,0.00054719864,0.0003586968],"domain_scores_gemma":[0.99845624,0.00025751474,0.00008315191,0.00093151134,0.00010813118,0.00016346748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503867,0.0002475435,0.00029558508,0.0001225689,0.00017791949,0.00030763738,0.0008904784,0.000080695594,0.000011468414],"category_scores_gemma":[0.000049069517,0.0001596266,0.000061867,0.0006366215,0.00011596937,0.00044831246,0.00049522135,0.00023097292,0.000034440138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010046582,0.00008276468,0.0011253936,0.00020366836,0.00009750503,0.00016030224,0.01252275,0.000009912148,0.0016598771,0.95397204,0.017116034,0.012949297],"study_design_scores_gemma":[0.0037633514,0.0056298836,0.011314775,0.0030544004,0.00023868411,0.00040507602,0.0033728518,0.008474256,0.05621215,0.7073978,0.19783275,0.0023040227],"about_ca_topic_score_codex":0.00011215045,"about_ca_topic_score_gemma":0.00004960767,"teacher_disagreement_score":0.24657422,"about_ca_system_score_codex":0.000085246895,"about_ca_system_score_gemma":0.00015757614,"threshold_uncertainty_score":0.65093833},"labels":[],"label_agreement":null},{"id":"W4394868300","doi":"10.4230/lipics.icalp.2024.43","title":"Robot Positioning Using Torus Packing for Multisets","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nokia (Canada); McGill University; Bell (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Position (finance); Constant (computer programming); Computer science; De Bruijn sequence; Window (computing); Code (set theory); Intersection (aeronautics); Autonomous robot; Torus; Theoretical computer science; Algorithm; Artificial intelligence; Mobile robot; Mathematics; Discrete mathematics; Geometry; Engineering; Programming language","score_opus":0.10768418472347757,"score_gpt":0.21603687344914627,"score_spread":0.1083526887256687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394868300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21332279,0.00022475742,0.78387004,0.00007999496,0.0013328699,0.000278052,0.000029948538,0.00044389794,0.00041764154],"genre_scores_gemma":[0.9672737,0.000022441343,0.032045588,0.000094145726,0.00017121057,0.0000013663997,0.00001753841,0.00003006559,0.0003439285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824595,0.00006708513,0.00017859558,0.0010578518,0.00007142263,0.00037910434],"domain_scores_gemma":[0.998398,0.0001476958,0.00016057564,0.001082204,0.00009790007,0.00011359352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026511442,0.00028580843,0.0002758305,0.00025410324,0.00024753695,0.0003682644,0.0015935767,0.00022904808,0.0000105259915],"category_scores_gemma":[0.00003144714,0.00033618152,0.00028151972,0.00035039487,0.000053130218,0.0002927366,0.0036672093,0.00040546045,0.000037833215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019162753,0.000058462523,0.00017076684,0.00033280952,0.0001781606,0.0004871973,0.00056927104,0.44785276,0.0018947535,0.54500884,0.00028106957,0.0031467865],"study_design_scores_gemma":[0.00019008912,0.000018658917,0.00009048016,0.0003460405,0.00007319744,0.000010688203,0.00004430737,0.7885297,0.0005716607,0.20970078,0.00009210086,0.0003323355],"about_ca_topic_score_codex":0.00011704271,"about_ca_topic_score_gemma":0.0000089603855,"teacher_disagreement_score":0.7539509,"about_ca_system_score_codex":0.00028252957,"about_ca_system_score_gemma":0.00015007009,"threshold_uncertainty_score":0.99990904},"labels":[],"label_agreement":null},{"id":"W4394992383","doi":"10.1051/ita/2024011","title":"A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2","year":2024,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Abelian group; Exponent; Mathematics; Fixed point; Critical exponent; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.03330787741572297,"score_gpt":0.2718876770391584,"score_spread":0.23857979962343542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394992383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005855561,0.00021273782,0.9726465,0.018669633,0.00010998146,0.0006726384,0.000055316992,0.0002878129,0.0014898694],"genre_scores_gemma":[0.9414118,0.00003998405,0.05633165,0.0011504918,0.000165301,0.00081661274,0.00003153471,0.000018703493,0.00003393491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987315,0.00004504725,0.00043775173,0.00024667205,0.00018332544,0.0003557313],"domain_scores_gemma":[0.9979401,0.00096056046,0.00004231282,0.0007348836,0.00010574608,0.00021637922],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007749991,0.0001870872,0.00017396943,0.00007339771,0.0005217121,0.001178902,0.00078864984,0.00009458815,0.000019716037],"category_scores_gemma":[0.000071733004,0.00012096091,0.000084771236,0.0003265132,0.0006351861,0.00038980079,0.00025732417,0.00021128668,0.00004196809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031046175,0.000056167555,0.0000012071813,0.00008741606,0.0000132761415,4.5732284e-7,0.0017387238,0.000015016436,0.00008827867,0.966521,0.00034605616,0.031129284],"study_design_scores_gemma":[0.000098601275,0.00006147249,0.000024791403,0.00003644818,0.000020573581,0.000026828826,0.00057496765,0.49253985,0.00020558601,0.4935948,0.012672642,0.00014344121],"about_ca_topic_score_codex":0.000004937523,"about_ca_topic_score_gemma":0.0000040024584,"teacher_disagreement_score":0.93555623,"about_ca_system_score_codex":0.000020600035,"about_ca_system_score_gemma":0.000069941794,"threshold_uncertainty_score":0.99985796},"labels":[],"label_agreement":null},{"id":"W4396697277","doi":"10.2139/ssrn.4819005","title":"Cornering Robots to Synchronize a Dfa","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Robot; Synchronization (alternating current); Computer science; Artificial intelligence; Computer network","score_opus":0.008451019599908616,"score_gpt":0.24259134608042224,"score_spread":0.2341403264805136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396697277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052054342,0.024361169,0.909828,0.005485287,0.004990151,0.00037614242,0.0000060541956,0.00073201617,0.0021668244],"genre_scores_gemma":[0.98647547,0.0023250217,0.0063657174,0.00054621877,0.0014243093,0.000036831847,0.0000033664983,0.00008301127,0.0027400397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948492,0.00011831616,0.0004897125,0.00083157315,0.0005131455,0.0031980674],"domain_scores_gemma":[0.9984635,0.000066124296,0.00019887372,0.0009294635,0.00009059928,0.00025141393],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024480738,0.0004375245,0.00044126087,0.00039106284,0.00018884295,0.0010787497,0.002881879,0.0002357603,0.000021187174],"category_scores_gemma":[0.000057946992,0.00039011438,0.00033739497,0.0003996009,0.000028395216,0.000179877,0.0038670197,0.0067970394,0.0005297784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000958091,0.00004004303,0.000010381178,0.00007417209,0.00031064515,0.000119639866,0.0005582361,0.0040897666,0.0003368412,0.73914915,0.0010646621,0.25423688],"study_design_scores_gemma":[0.00016542898,0.0001798096,0.00003256393,0.00047610526,0.000044005534,0.0016404846,0.0001390608,0.030839805,0.00012826914,0.9642278,0.0015860875,0.0005405628],"about_ca_topic_score_codex":0.00005885626,"about_ca_topic_score_gemma":0.00012784846,"teacher_disagreement_score":0.9344211,"about_ca_system_score_codex":0.0022266074,"about_ca_system_score_gemma":0.0052220738,"threshold_uncertainty_score":0.9999582},"labels":[],"label_agreement":null},{"id":"W4398195493","doi":"10.1016/j.jcta.2024.105910","title":"Power-free complementary binary morphisms","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Binary number; Power (physics); Mathematics; Computer science; Arithmetic; Pure mathematics; Physics; Thermodynamics","score_opus":0.008167672429959087,"score_gpt":0.2369642211132666,"score_spread":0.2287965486833075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398195493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.508463,0.027223716,0.20836875,0.029511178,0.19374266,0.00087223604,0.00010258851,0.0016791227,0.030036721],"genre_scores_gemma":[0.9918429,0.00011336027,0.006197056,0.00040066833,0.0010307549,0.0000032476917,0.0000018396719,0.0000315954,0.00037853027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796635,0.00030111155,0.00062589836,0.00023176134,0.00056145363,0.00031345023],"domain_scores_gemma":[0.99834174,0.00045342668,0.0002305557,0.00066613784,0.00014730913,0.00016085053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020726563,0.00022027896,0.0003645747,0.00027495678,0.00014438338,0.00043007414,0.002128074,0.00007378833,0.0004199086],"category_scores_gemma":[0.00011647255,0.00017432841,0.00027503815,0.000474147,0.00013959687,0.0019590075,0.0006043437,0.00039531424,0.000032947908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017483415,0.00008702103,0.000008481797,0.000024268225,0.00012594377,0.0006602817,0.00081780786,0.0000087126,0.0019743843,0.97160804,0.021047285,0.0034629437],"study_design_scores_gemma":[0.0007323197,0.0010341586,0.000057185225,0.00014439532,0.000022323517,0.0006754752,0.00030290792,0.00022961454,0.0019840722,0.880281,0.114342846,0.00019373036],"about_ca_topic_score_codex":0.0000020636267,"about_ca_topic_score_gemma":1.4358105e-7,"teacher_disagreement_score":0.48337993,"about_ca_system_score_codex":0.0000913192,"about_ca_system_score_gemma":0.00018884076,"threshold_uncertainty_score":0.71089065},"labels":[],"label_agreement":null},{"id":"W4399602825","doi":"10.37236/12115","title":"Asymptotic Bounds for the Number of Closed and Privileged Words","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Combinatorics; Word (group theory); Suffix; Prefix; Mathematics; Upper and lower bounds; Alphabet; Linguistics; Geometry; Philosophy; Mathematical analysis","score_opus":0.005746212735170773,"score_gpt":0.2510511144270334,"score_spread":0.2453049016918626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399602825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30987495,0.03725185,0.6446774,0.0053659766,0.002045997,0.00027870605,0.0000014524805,0.00005631686,0.00044735995],"genre_scores_gemma":[0.99857056,0.00093171553,0.00009909291,0.0000776025,0.00010086796,0.0000035977132,1.16395775e-7,0.000011839786,0.00020457832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887604,0.000088684355,0.0003108572,0.00010489508,0.0002925903,0.00032695825],"domain_scores_gemma":[0.9981482,0.0012188085,0.00018372429,0.0003043443,0.0001086016,0.000036311052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00205551,0.000106770305,0.00018846232,0.00005215956,0.00013297285,0.00016490812,0.0009998506,0.000039341583,0.0000043936675],"category_scores_gemma":[0.00007091402,0.000055179615,0.00013032071,0.0004003799,0.00008776088,0.0002349793,0.00010396968,0.00039825405,0.0000018431463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013492454,0.000029843237,0.00004713537,0.000025214467,0.00011265973,0.0000022916377,0.0005345236,0.000008398661,0.00017605627,0.9906326,0.00044699165,0.007970801],"study_design_scores_gemma":[0.0004224131,0.00026959332,0.00030162273,0.00006999703,0.000073812735,0.00032812209,0.00007198563,0.015890619,0.00088230846,0.97320235,0.008407181,0.00007997777],"about_ca_topic_score_codex":0.0000019191966,"about_ca_topic_score_gemma":6.8814325e-7,"teacher_disagreement_score":0.68869567,"about_ca_system_score_codex":0.00009090923,"about_ca_system_score_gemma":0.0003748718,"threshold_uncertainty_score":0.22501594},"labels":[],"label_agreement":null},{"id":"W4399803900","doi":"10.4204/eptcs.403.7","title":"Power Quotients of Plactic-like Monoids","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Monoid; Quotient; Congruence relation; Syntactic monoid; Mathematics; Free monoid; Pure mathematics; Set (abstract data type); Generator (circuit theory); Power (physics); Combinatorics; Algebra over a field; Computer science; Physics","score_opus":0.0032465031534163933,"score_gpt":0.22655064517696422,"score_spread":0.2233041420235478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399803900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37874684,0.00069148693,0.60792416,0.00081937003,0.0012600935,0.00027134703,0.0000010446273,0.00050979864,0.009775876],"genre_scores_gemma":[0.98620373,0.000018933371,0.01344378,0.00023584883,0.000053919117,0.000011674467,2.11155e-7,0.00001411769,0.000017786024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672925,0.000022983837,0.00041531908,0.0009743678,0.00079574133,0.0010623592],"domain_scores_gemma":[0.9990649,0.0001931185,0.00006887619,0.00037120588,0.00014443316,0.00015743764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023551867,0.00023222514,0.00026420574,0.0005583057,0.00012466595,0.0005496406,0.0028574425,0.000079975405,0.000038987353],"category_scores_gemma":[0.00008975658,0.00019327001,0.00008665703,0.0028971513,0.0013622512,0.001568207,0.00093704497,0.0004985726,0.000037646747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008582024,0.000066659326,0.00008753953,0.000029519455,0.000006140252,0.000008299366,0.0009678851,0.000011163861,0.0023688667,0.9845255,0.00009221156,0.01182764],"study_design_scores_gemma":[0.000174543,0.0004417914,0.00036484672,0.0001538833,0.0000034420812,0.00007826191,0.000022124903,0.48586127,0.0134156365,0.49874038,0.00048651025,0.00025731075],"about_ca_topic_score_codex":0.0000022542217,"about_ca_topic_score_gemma":2.0307539e-7,"teacher_disagreement_score":0.6074569,"about_ca_system_score_codex":0.00026359354,"about_ca_system_score_gemma":0.00038540296,"threshold_uncertainty_score":0.78813225},"labels":[],"label_agreement":null},{"id":"W4399804111","doi":"10.4204/eptcs.403.29","title":"On the Orthogonality of Generalized Pattern Sequences","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Integer (computer science); Combinatorics; Mathematics; Orthogonality; Word (group theory); Binary number; Finite set; Set (abstract data type); Discrete mathematics; Arithmetic","score_opus":0.007625491408060929,"score_gpt":0.24426465859038907,"score_spread":0.23663916718232814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399804111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50649357,0.0003647946,0.48557374,0.004344311,0.0003816173,0.00021741337,0.000001185072,0.00023228054,0.002391095],"genre_scores_gemma":[0.99640894,0.00002644214,0.002596965,0.00086046744,0.00007258362,0.000020204736,2.0128375e-7,0.000008066687,0.000006139557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972838,0.000054995264,0.0003479441,0.00077944476,0.0007716022,0.00076220045],"domain_scores_gemma":[0.9988526,0.0005260404,0.00006551401,0.00036742282,0.00010492845,0.00008349463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004114339,0.00019331396,0.0002087137,0.00023886058,0.00017184735,0.0005318408,0.003066493,0.000050741353,0.000046976977],"category_scores_gemma":[0.00013370684,0.00011669396,0.000085597756,0.002131012,0.0018071345,0.00060129864,0.00058794906,0.00045205173,0.00002069367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041145627,0.000030878986,0.00004787134,0.000019717705,0.0000051384363,0.0000050774674,0.00046329372,0.000018093815,0.0014032488,0.9604681,0.000054855445,0.037479613],"study_design_scores_gemma":[0.00005626349,0.00015563253,0.00014971118,0.00009594295,0.0000017533578,0.000024298295,0.0000064114292,0.38302094,0.0095220925,0.6067794,0.00007859791,0.00010898074],"about_ca_topic_score_codex":0.0000062660206,"about_ca_topic_score_gemma":7.331451e-7,"teacher_disagreement_score":0.48991537,"about_ca_system_score_codex":0.00015084952,"about_ca_system_score_gemma":0.000311196,"threshold_uncertainty_score":0.6658462},"labels":[],"label_agreement":null},{"id":"W4399830286","doi":"10.4204/eptcs.403.26","title":"A Symmetry Property of Christoffel Words","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Christoffel symbols; Symmetry (geometry); Cardinality (data modeling); Property (philosophy); Mathematics; Bivariate analysis; Pure mathematics; Algebra over a field; Computer science; Geometry; Philosophy; Statistics; Epistemology","score_opus":0.004598778382710914,"score_gpt":0.22805784423766448,"score_spread":0.22345906585495356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399830286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15345524,0.0015351404,0.83000684,0.0018131651,0.00080696377,0.00037343142,9.659304e-7,0.000690564,0.011317697],"genre_scores_gemma":[0.9807689,0.000047099093,0.018809697,0.00020413128,0.00010777107,0.000018341427,1.9258789e-7,0.000013928642,0.000029917599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968028,0.000024174173,0.00041115872,0.0009877081,0.0007477528,0.0010264125],"domain_scores_gemma":[0.99914813,0.00015366891,0.000062023486,0.00036370463,0.0001287943,0.00014370774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002981815,0.00022779922,0.00028444524,0.000591849,0.00012541968,0.000526085,0.0030570864,0.000078897545,0.000016908429],"category_scores_gemma":[0.00012040668,0.00015045196,0.00008893133,0.003972264,0.0016488573,0.0012544118,0.00096976856,0.0005387563,0.000026349482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006062458,0.000053836542,0.000039013157,0.000054567383,0.0000050852873,0.000008196721,0.00072240055,0.000003116839,0.0031399834,0.90260017,0.000080704755,0.09328684],"study_design_scores_gemma":[0.00011791264,0.00027007645,0.00013036215,0.00020435902,0.0000032890257,0.000086450484,0.000013771786,0.52926433,0.016610062,0.45249328,0.00059907115,0.00020703398],"about_ca_topic_score_codex":0.0000049768837,"about_ca_topic_score_gemma":3.6670244e-7,"teacher_disagreement_score":0.82731366,"about_ca_system_score_codex":0.00027193903,"about_ca_system_score_gemma":0.000499609,"threshold_uncertainty_score":0.6135253},"labels":[],"label_agreement":null},{"id":"W4399830315","doi":"10.4204/eptcs.403.28","title":"Perfectly Clustering Words and Iterated Palindromes over a Ternary Alphabet","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Palindrome; Alphabet; Ternary operation; Iterated function; Combinatorics; Cluster analysis; Mathematics; Word (group theory); Computer science; Biology; Genetics; Linguistics; Statistics; Philosophy","score_opus":0.0036366341824186185,"score_gpt":0.2320275942637919,"score_spread":0.2283909600813733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399830315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5985472,0.001312684,0.39659786,0.000949024,0.00049508124,0.00021242467,8.035959e-7,0.0005749087,0.0013100265],"genre_scores_gemma":[0.9878001,0.00006685589,0.011469731,0.00046585154,0.00013928824,0.00002042232,4.2697832e-7,0.000018801426,0.000018481773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673307,0.000029166062,0.0003313087,0.0012094139,0.0005495977,0.0011474319],"domain_scores_gemma":[0.9992473,0.00018318422,0.000042827396,0.00027459723,0.000057920886,0.00019416225],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020784023,0.0002893986,0.00026377055,0.00052120455,0.00022159962,0.001993084,0.0017431917,0.000085467706,0.000026981572],"category_scores_gemma":[0.000055149354,0.00023928375,0.000056090907,0.0021829414,0.0010754314,0.0018057809,0.0013479724,0.00056720973,0.000016332378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008150456,0.000028282993,0.00026467338,0.00004947504,0.000007775681,0.000042526503,0.0016670455,0.000011043142,0.0023774873,0.94692045,0.00002891638,0.048594154],"study_design_scores_gemma":[0.00018507228,0.00025852755,0.000830396,0.00023746843,0.0000037934485,0.00032709845,0.0000137022835,0.79620427,0.0015782855,0.19989666,0.00018681522,0.00027792348],"about_ca_topic_score_codex":0.000003950771,"about_ca_topic_score_gemma":0.0000010370316,"teacher_disagreement_score":0.7961932,"about_ca_system_score_codex":0.00022910425,"about_ca_system_score_gemma":0.00020627517,"threshold_uncertainty_score":0.9990429},"labels":[],"label_agreement":null},{"id":"W4400596818","doi":"10.55016/ojs/cdm.v16i1.70710","title":"Symmetric association schemes arising from abstract regular polytopes","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coxeter group; Mathematics; Combinatorics; Polytope; Coset; Vertex (graph theory); Symmetric group; Type (biology); Finite group; Group (periodic table); Graph; Physics","score_opus":0.009539156373322692,"score_gpt":0.2651140095327008,"score_spread":0.2555748531593781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06560869,0.00082886865,0.9250113,0.005213279,0.0003319452,0.00019345862,0.000281195,0.00033239002,0.0021989064],"genre_scores_gemma":[0.85559285,0.000031004398,0.14263532,0.0005194935,0.00018924357,0.000025559735,0.00010333878,0.000019984747,0.0008832396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982984,0.000062458465,0.00042941188,0.0003758877,0.0004349335,0.00039892845],"domain_scores_gemma":[0.9976612,0.0007306931,0.00022455922,0.000829574,0.00039370457,0.00016031197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005812567,0.00017939143,0.00031951873,0.00013957894,0.0002741799,0.00058372825,0.00057346205,0.00012583213,0.00008347602],"category_scores_gemma":[0.002694092,0.00017231808,0.00014418579,0.0010405224,0.00001724643,0.00041915305,0.00034574425,0.00016939202,0.00030129246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016858022,0.00021005838,0.0002920148,0.000029425664,0.00018212377,0.000044975095,0.00078168523,0.000048387396,0.017805206,0.9663168,0.004032967,0.010254665],"study_design_scores_gemma":[0.0013274893,0.00006494116,0.011024719,0.0005830334,0.00022159705,0.000039107013,0.0008625176,0.08619252,0.20902963,0.64965683,0.039657112,0.0013405058],"about_ca_topic_score_codex":0.000016650252,"about_ca_topic_score_gemma":0.000004883204,"teacher_disagreement_score":0.7899841,"about_ca_system_score_codex":0.00031606603,"about_ca_system_score_gemma":0.0001311841,"threshold_uncertainty_score":0.7026927},"labels":[],"label_agreement":null},{"id":"W4400596853","doi":"10.55016/ojs/cdm.v16i1.69831","title":"Lengths of extremal square-free ternary words","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Square-free integer; Ternary operation; Word (group theory); Mathematics; Square (algebra); Alphabet; Combinatorics; Sigma; Discrete mathematics; Geometry; Computer science; Linguistics; Physics","score_opus":0.010786793229228257,"score_gpt":0.27178721306637393,"score_spread":0.26100041983714567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019864405,0.00041295285,0.9720138,0.0032740352,0.00023370625,0.00019837303,0.00025973766,0.00017933089,0.0035637158],"genre_scores_gemma":[0.8145308,0.000019886373,0.18415865,0.0002601221,0.00010001107,0.000039398245,0.000025835983,0.000019395227,0.00084591337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847823,0.0000702661,0.0004671855,0.00030738642,0.0003361798,0.00034071945],"domain_scores_gemma":[0.9974066,0.000337947,0.00014111112,0.0016386634,0.00032018565,0.00015547987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038736433,0.00017098084,0.00034004523,0.00009734092,0.00012697953,0.00012071788,0.0011683437,0.0000736333,0.00009617811],"category_scores_gemma":[0.0010822874,0.00015526061,0.00016262737,0.00061501854,0.00006123522,0.00025686025,0.00093274977,0.000116622294,0.000084387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002965144,0.00019758768,0.000058631464,0.000074274125,0.000044389217,0.000048181337,0.0012184465,0.000051290113,0.0052776868,0.9869715,0.0027287286,0.0033263396],"study_design_scores_gemma":[0.0020942613,0.000260424,0.0015334572,0.00092227844,0.00012892486,0.0003194098,0.0015828756,0.16162057,0.092525855,0.7250692,0.012851856,0.0010908575],"about_ca_topic_score_codex":0.0000043732443,"about_ca_topic_score_gemma":0.0000053816116,"teacher_disagreement_score":0.7946664,"about_ca_system_score_codex":0.000060821556,"about_ca_system_score_gemma":0.00013785347,"threshold_uncertainty_score":0.6331344},"labels":[],"label_agreement":null},{"id":"W4400914530","doi":"10.3233/fi-242180","title":"Descriptional Complexity of Finite Automata – Selected Highlights","year":2024,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Queen's University","funders":"","keywords":"DFA minimization; Automaton; Deterministic finite automaton; Computer science; Theoretical computer science; Finite-state machine; Nondeterministic finite automaton; Mathematics; Automata theory; Discrete mathematics; Algorithm","score_opus":0.032925345192854935,"score_gpt":0.25028295416166,"score_spread":0.21735760896880507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400914530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14696161,0.0003921222,0.82073426,0.0032037362,0.0019970357,0.00051289285,0.00017683371,0.0024124251,0.023609104],"genre_scores_gemma":[0.9593539,0.000017112761,0.039887134,0.00038478032,0.00004606355,0.000015225899,0.00006461383,0.000008663471,0.00022247367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860984,0.000037423866,0.00049808546,0.0001776376,0.00040455995,0.00027245464],"domain_scores_gemma":[0.99907607,0.0001920838,0.000089751,0.0004789221,0.00007353334,0.00008965372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030075936,0.00015393629,0.00019633374,0.0002044776,0.000097628516,0.00034596235,0.00078780117,0.000051564777,0.00029719662],"category_scores_gemma":[0.000034790985,0.00012639016,0.00007739797,0.00071726734,0.00015828213,0.001535458,0.00030645693,0.00012398967,0.00058790925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006499764,0.000061108796,0.000049086888,0.00021920112,0.00006115524,0.0000069744083,0.0016278928,0.000025767009,0.0007545275,0.98203903,0.008452316,0.006696427],"study_design_scores_gemma":[0.00036509108,0.0001940764,0.0045877863,0.00024886368,0.000016586073,0.000056846824,0.00007489876,0.9031163,0.0035640702,0.043183625,0.04429981,0.00029205086],"about_ca_topic_score_codex":0.000013383599,"about_ca_topic_score_gemma":0.0000019986787,"teacher_disagreement_score":0.9388554,"about_ca_system_score_codex":0.000067266956,"about_ca_system_score_gemma":0.00012554113,"threshold_uncertainty_score":0.75565803},"labels":[],"label_agreement":null},{"id":"W4401033940","doi":"10.1007/978-3-031-66159-4_12","title":"Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decidability; Computer science; Programming language; Algorithm; Theoretical computer science","score_opus":0.013464643293944919,"score_gpt":0.25891717032706923,"score_spread":0.2454525270331243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401033940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009761949,0.0004997279,0.9942336,0.00088330416,0.00091441313,0.0009408565,0.000015173887,0.000109618886,0.00142713],"genre_scores_gemma":[0.73429185,0.0000093344315,0.2645545,0.00052144605,0.0002642292,0.000047850957,0.000001405675,0.000033629043,0.0002757545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977482,0.000036307236,0.0005014573,0.00076224183,0.00062701455,0.00032478414],"domain_scores_gemma":[0.99699014,0.0009787536,0.00030212163,0.0015220423,0.0001699261,0.0000370081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017536929,0.00029241148,0.00039079096,0.0002220591,0.00017029754,0.0002373937,0.0048633125,0.00017608378,0.0000059129825],"category_scores_gemma":[0.00008527591,0.00015882088,0.00025868564,0.000579145,0.0011802843,0.00025736858,0.0018627371,0.00042328672,0.0000010148489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065642707,0.000032831307,0.00005872789,0.00037256698,0.000023277158,0.0000033003464,0.0049442807,0.0009419195,0.0024440002,0.3042861,0.000029363142,0.6868571],"study_design_scores_gemma":[0.000069070746,0.0000941364,0.000056695742,0.0008413643,0.000016710195,0.000014471296,0.0000032987598,0.07728194,0.07014144,0.8506726,0.000540364,0.00026789118],"about_ca_topic_score_codex":0.000028871433,"about_ca_topic_score_gemma":0.000040134004,"teacher_disagreement_score":0.73331565,"about_ca_system_score_codex":0.00011355315,"about_ca_system_score_gemma":0.00035747475,"threshold_uncertainty_score":0.90373254},"labels":[],"label_agreement":null},{"id":"W4401033946","doi":"10.1007/978-3-031-66159-4_6","title":"Universal Rewriting Rules for the Parikh Matrix Injectivity Problem","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Rewriting; Computer science; Matrix (chemical analysis); Programming language; Theoretical computer science; Algorithm","score_opus":0.01327607138326478,"score_gpt":0.24817184624092264,"score_spread":0.23489577485765786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401033946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000617234,0.0017212739,0.99051887,0.0021319035,0.0017064853,0.00068074255,0.000021253107,0.00036149702,0.0027962306],"genre_scores_gemma":[0.15824437,0.00014439746,0.83400226,0.001706988,0.0020365051,0.000065141016,0.000011926637,0.00012425036,0.003664174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968307,0.000036314494,0.00039010463,0.0014310314,0.00064766273,0.00066420034],"domain_scores_gemma":[0.99531776,0.0030023644,0.00020686528,0.0012189453,0.00015730933,0.00009674696],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021389402,0.00046877644,0.000405734,0.0004632593,0.0004993239,0.0011624539,0.0037928643,0.0002520991,0.000009234782],"category_scores_gemma":[0.00011343749,0.00033440287,0.0002130777,0.0004987051,0.00066015765,0.00059220503,0.0019094449,0.0008158105,0.000045373603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006666269,0.0000117360505,0.0000065410263,0.00009278527,0.000020852498,0.000040958446,0.0006179401,0.0060197967,0.00006358994,0.5204248,0.00008368967,0.47261068],"study_design_scores_gemma":[0.000111291185,0.000080976395,0.000017283852,0.00037563097,0.000014928222,0.000058103782,8.143637e-7,0.49054646,0.00023867554,0.50232506,0.005875823,0.00035498478],"about_ca_topic_score_codex":0.00004180945,"about_ca_topic_score_gemma":0.000051843672,"teacher_disagreement_score":0.48452666,"about_ca_system_score_codex":0.0002740181,"about_ca_system_score_gemma":0.0004387955,"threshold_uncertainty_score":0.9999108},"labels":[],"label_agreement":null},{"id":"W4401259877","doi":"10.46298/cm.12695","title":"Dyck Words, Pattern Avoidance, and Automatic Sequences","year":2024,"lang":"en","type":"article","venue":"Communications in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Thompson Rivers University; University of Waterloo","funders":"","keywords":"Mathematics; Binary number; Bounded function; Parenthesis; Combinatorics; Word (group theory); Repetition (rhetorical device); Morse code; Upper and lower bounds; Discrete mathematics; Counterexample; Arithmetic; Computer science; Geometry; Mathematical analysis; Linguistics","score_opus":0.03426910240024929,"score_gpt":0.3052477267424467,"score_spread":0.27097862434219744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401259877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07713513,0.016741097,0.88242984,0.007311008,0.00031663786,0.00043538064,0.000008807521,0.0012288033,0.014393277],"genre_scores_gemma":[0.799001,0.00073424214,0.19989842,0.00011262496,0.000010391904,0.000049419745,0.0000025430222,0.0000104711535,0.00018089131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991365,0.000089924855,0.00030749617,0.00018362045,0.0001273831,0.00015504893],"domain_scores_gemma":[0.9973361,0.0007859251,0.000050950308,0.0017731778,0.0000174335,0.00003645153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062497344,0.00010965345,0.00014877772,0.00015948717,0.00010892308,0.00035550684,0.0017801342,0.000044002976,0.000014235765],"category_scores_gemma":[0.00006551221,0.0000953289,0.000029254868,0.00049278996,0.00015008997,0.00038857723,0.0007762338,0.00020458663,0.00008647057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.618436e-8,0.00010867111,0.0004732824,0.00035576645,0.00001782884,0.000010206339,0.010944158,0.000010811151,0.00012495538,0.78018314,0.00039754072,0.20737359],"study_design_scores_gemma":[0.000042925338,0.000007632812,0.0004084603,0.00048584535,0.000004319681,0.00003461988,0.00034458184,0.7243934,0.000033780176,0.27271053,0.0014237193,0.00011014039],"about_ca_topic_score_codex":0.000010094992,"about_ca_topic_score_gemma":0.000024168325,"teacher_disagreement_score":0.72438264,"about_ca_system_score_codex":0.000035415458,"about_ca_system_score_gemma":0.00004149126,"threshold_uncertainty_score":0.38873994},"labels":[],"label_agreement":null},{"id":"W4401382307","doi":"10.1007/978-3-031-52163-8_4","title":"Sums of Proper Divisors with Missing Digits","year":2024,"lang":"en","type":"book-chapter","venue":"Association for Women in Mathematics series","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Arithmetic; Computer science","score_opus":0.011121901017395387,"score_gpt":0.21117165137403882,"score_spread":0.20004975035664344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401382307","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016657753,0.0002885466,0.003958859,0.0007427345,0.00035055637,0.00093784876,0.000105784624,0.00029368015,0.99165624],"genre_scores_gemma":[0.0066352547,0.000028732775,0.007304808,0.000013332618,0.000038276252,0.00007800899,0.000012901228,0.000056061195,0.98583263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859464,0.000008193473,0.00046252325,0.00026430463,0.0003831521,0.0002871807],"domain_scores_gemma":[0.9986743,0.00029119843,0.0005488897,0.00031495534,0.00012902766,0.000041628537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075276004,0.00022679553,0.00047969044,0.00018503217,0.000048166716,0.0002109202,0.00038135768,0.0001672067,0.000015741743],"category_scores_gemma":[0.00009390933,0.00017811287,0.000082325976,0.00009685295,0.000038997863,0.00036847207,0.00013161851,0.00013977295,0.000022565842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042754273,0.000022943032,0.00004038088,0.00090753514,0.00012475894,0.000002900472,0.010448034,0.000005916681,0.000027490923,0.98764193,0.00024130946,0.00053251133],"study_design_scores_gemma":[0.00014422998,0.00010511533,0.000012574725,0.0007941691,0.000015196776,0.0000031861932,0.00029959314,0.0009213804,0.00021343165,0.9805857,0.016670689,0.00023471616],"about_ca_topic_score_codex":0.0000010396926,"about_ca_topic_score_gemma":0.0000057058623,"teacher_disagreement_score":0.01642938,"about_ca_system_score_codex":0.00040470937,"about_ca_system_score_gemma":0.000095776566,"threshold_uncertainty_score":0.7263232},"labels":[],"label_agreement":null},{"id":"W4401560526","doi":"10.1016/j.tcs.2024.114780","title":"On the difference set of two transductions","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Mathematics; Combinatorics; Discrete mathematics; Computer science; Programming language","score_opus":0.015666242829783853,"score_gpt":0.26695198594823516,"score_spread":0.2512857431184513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401560526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10441045,0.000043664048,0.88804495,0.0042787897,0.0008471524,0.00009915903,0.000003963034,0.00024040154,0.0020314592],"genre_scores_gemma":[0.9844989,0.0000040122745,0.014883709,0.00048003803,0.00010346271,0.0000066928524,2.5809473e-7,0.0000056062017,0.000017312706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982307,0.000118150885,0.00020755596,0.0005269557,0.0005755864,0.00034106107],"domain_scores_gemma":[0.99781865,0.0011144016,0.000025976811,0.0008709655,0.00006337767,0.00010663676],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013681559,0.00013902398,0.00013693089,0.00016049304,0.00027296614,0.00042023428,0.0026291835,0.000023581048,0.00009343106],"category_scores_gemma":[0.000050961837,0.00007818526,0.000085930216,0.0014763407,0.0028268534,0.00028566903,0.00038471873,0.00022252483,0.00008661839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014857854,0.000017991068,0.000001610384,0.0000067427454,0.000003747899,0.000005274702,0.00063878176,0.000052743642,0.002699708,0.94687915,0.00005835052,0.049634416],"study_design_scores_gemma":[0.000036102363,0.000087370165,0.00011889366,0.000056042507,0.0000027619685,0.000022079403,0.0000045849592,0.40717953,0.012177301,0.5801975,0.000041071326,0.000076769866],"about_ca_topic_score_codex":0.000003404732,"about_ca_topic_score_gemma":2.6832546e-7,"teacher_disagreement_score":0.88008845,"about_ca_system_score_codex":0.000024187857,"about_ca_system_score_gemma":0.00010121174,"threshold_uncertainty_score":0.9998869},"labels":[],"label_agreement":null},{"id":"W4402145822","doi":"10.1007/978-3-031-71112-1_10","title":"From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Emulation; Lemma (botany); Computer science; Algebra over a field; Relation (database); Interpretation (philosophy); Transformation (genetics); Theoretical computer science; Programming language; Mathematics; Pure mathematics; Data mining","score_opus":0.010909739660623159,"score_gpt":0.2545275003182736,"score_spread":0.24361776065765042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402145822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009505546,0.00012921788,0.98685104,0.0010085437,0.001477845,0.0008098533,0.000044494685,0.00007883182,0.000094642106],"genre_scores_gemma":[0.8612324,0.000007824867,0.13775405,0.0006196006,0.00029052413,0.000018903203,0.000032118696,0.000020632859,0.000023958763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979792,0.00002648606,0.00057092117,0.00072202313,0.0004694,0.00023192477],"domain_scores_gemma":[0.99842256,0.00062364165,0.0002526121,0.0005089893,0.00013370957,0.00005846938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055484526,0.00027717254,0.0002813156,0.00039611134,0.00015651678,0.0003838231,0.00084758236,0.0001483342,0.000006975177],"category_scores_gemma":[0.000020773092,0.00022694413,0.00010698803,0.0003845499,0.00012532179,0.0008395001,0.00043781826,0.00023696115,0.0000051466563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012808009,0.000006448744,0.00006817693,0.00010622969,0.000021126942,0.0000011793837,0.013846162,0.08946166,0.00062806276,0.066702954,0.0000135014625,0.82913166],"study_design_scores_gemma":[0.00019602514,0.000099736186,0.0011767918,0.00048583274,0.000016078757,0.0000047261506,0.000002582651,0.7768889,0.002159457,0.21855031,0.00020632311,0.000213227],"about_ca_topic_score_codex":0.000052530577,"about_ca_topic_score_gemma":0.00009365259,"teacher_disagreement_score":0.85172683,"about_ca_system_score_codex":0.00015628789,"about_ca_system_score_gemma":0.000110566674,"threshold_uncertainty_score":0.92545134},"labels":[],"label_agreement":null},{"id":"W4402161717","doi":"10.1016/j.tcs.2024.114782","title":"Binary distinguishability operation","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Mathematics; Algorithm; Programming language","score_opus":0.008019538985371126,"score_gpt":0.2567818053675138,"score_spread":0.2487622663821427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402161717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04815766,0.00012117867,0.9428938,0.0017089141,0.0016088024,0.000109276494,0.0000015154487,0.0009276821,0.004471142],"genre_scores_gemma":[0.9149469,0.0000021764924,0.0844067,0.00039615738,0.00022252083,0.0000059196664,8.8803034e-7,0.000006453087,0.000012281217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788463,0.00009506576,0.00022281842,0.0008437345,0.00052523124,0.00042853068],"domain_scores_gemma":[0.9985776,0.00032610833,0.000017519715,0.0008073546,0.00008327371,0.00018814762],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020951615,0.0001492156,0.00013112651,0.00015289728,0.00036256804,0.001505563,0.0020341466,0.000038135157,0.00008523021],"category_scores_gemma":[0.00010579901,0.00011200975,0.00006442086,0.0011533771,0.0018292079,0.0011123855,0.0010788611,0.00018097706,0.00030031367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011456624,0.000024804478,0.000014659362,0.000012764203,0.0000016454301,0.000027674985,0.00030331954,0.000068189074,0.0011346843,0.9159249,0.000107126194,0.082379065],"study_design_scores_gemma":[0.00003282108,0.000081450096,0.0006490022,0.000033881355,0.000001677648,0.000033503373,0.0000023136006,0.72342896,0.0016189687,0.2736622,0.00032500536,0.00013021717],"about_ca_topic_score_codex":0.000002582644,"about_ca_topic_score_gemma":1.3587747e-7,"teacher_disagreement_score":0.8667892,"about_ca_system_score_codex":0.00007254182,"about_ca_system_score_gemma":0.00015245247,"threshold_uncertainty_score":0.999531},"labels":[],"label_agreement":null},{"id":"W4402509715","doi":"10.46298/cm.12627","title":"Proving Properties of $\\varphi$-Representations with the Walnut Theorem-Prover","year":2024,"lang":"en","type":"article","venue":"Communications in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple (philosophy); Mathematical proof; Mathematics; Automaton; Automated theorem proving; Algebra over a field; Mathematical induction; Calculus (dental); Discrete mathematics; Pure mathematics; Algorithm; Theoretical computer science; Computer science; Epistemology","score_opus":0.045360690033433244,"score_gpt":0.2867431072126072,"score_spread":0.24138241717917397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402509715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1312974,0.010930997,0.77537537,0.030843662,0.00022118521,0.0020609917,0.000011940732,0.00085252087,0.048405915],"genre_scores_gemma":[0.918505,0.00008018282,0.08091825,0.00004765489,0.000007985085,0.000113762486,0.0000013794581,0.000011472339,0.0003142914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992198,0.00010803016,0.00025347594,0.00013295384,0.00016909005,0.000116702206],"domain_scores_gemma":[0.9969207,0.0005578656,0.000074901014,0.002370825,0.00006037388,0.000015314747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060345343,0.00008897484,0.0001159611,0.000101380836,0.0001327585,0.00016845363,0.0022876,0.000025644349,0.0000055925652],"category_scores_gemma":[0.00007978137,0.00004944192,0.000036063575,0.0005803305,0.00030202616,0.00032915335,0.00064815744,0.00017951748,0.000018332272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.499184e-7,0.00010535272,0.000027745267,0.00013848976,0.000018313129,8.5530473e-7,0.014790527,0.00007899145,0.0015049458,0.9782526,0.00019669317,0.004884759],"study_design_scores_gemma":[0.00012330037,0.000029352967,0.00011104007,0.0008706966,0.000024733628,0.000028624208,0.0038579998,0.775206,0.003864434,0.21404602,0.0016700587,0.00016772482],"about_ca_topic_score_codex":0.000016909364,"about_ca_topic_score_gemma":0.000030285462,"teacher_disagreement_score":0.7872076,"about_ca_system_score_codex":0.000025191235,"about_ca_system_score_gemma":0.00008393339,"threshold_uncertainty_score":0.4250968},"labels":[],"label_agreement":null},{"id":"W4403165746","doi":"10.61091/ars-160-11","title":"The Monophonic-triangular Number of a Graph","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.006335626600193409,"score_gpt":0.23845258957322277,"score_spread":0.23211696297302936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9549187,0.008606331,0.0064947098,0.0026492176,0.013681239,0.00029336257,0.000004681459,0.0007861038,0.012565668],"genre_scores_gemma":[0.9987742,0.00009047463,0.0006838328,0.00006651211,0.000008888573,0.000011928262,5.654419e-7,0.000010334821,0.00035329096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909467,0.000065651286,0.00019090161,0.0002253471,0.00021686192,0.00020656416],"domain_scores_gemma":[0.99890023,0.00033871512,0.00004019815,0.00063658226,0.000038193404,0.000046072942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004916559,0.00009726583,0.000114453345,0.00003951065,0.00011066528,0.0001997157,0.00090905884,0.000044273685,0.000015690972],"category_scores_gemma":[0.00003274735,0.00006573507,0.00011013263,0.0005688859,0.00007112084,0.0002245506,0.00020509002,0.00011862521,0.00015489712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017310196,0.000019079507,0.00008927867,0.000011255497,0.00002824138,0.00001765975,0.0002633596,9.884156e-7,0.00034340302,0.98477054,0.0042874683,0.010167011],"study_design_scores_gemma":[0.00014785164,0.00002268519,0.00031164126,0.000036174588,0.000006173813,0.000017248116,0.00002702594,0.005209456,0.0029130972,0.97413856,0.0170781,0.000091999216],"about_ca_topic_score_codex":0.000022493901,"about_ca_topic_score_gemma":6.8836897e-7,"teacher_disagreement_score":0.04385549,"about_ca_system_score_codex":0.000013186568,"about_ca_system_score_gemma":0.000057693484,"threshold_uncertainty_score":0.26805982},"labels":[],"label_agreement":null},{"id":"W4403577631","doi":"10.48550/arxiv.2410.12173","title":"Relative position in binary substitutions","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; MacEwan University","keywords":"Position (finance); Binary number; Mathematics; Economics; Arithmetic","score_opus":0.04864594281658247,"score_gpt":0.1861836278559793,"score_spread":0.13753768503939684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403577631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66769546,0.00040955056,0.3180646,0.00049132074,0.0010916172,0.00026535004,0.000028027978,0.00055873726,0.011395319],"genre_scores_gemma":[0.9977084,0.00009459693,0.00088128814,0.00006541566,0.000040776005,0.0000012477906,0.000021317062,0.000010426767,0.0011765608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858797,0.0001239456,0.000150636,0.000845235,0.000058672034,0.00023354495],"domain_scores_gemma":[0.9989826,0.00008677145,0.0000833461,0.00072688214,0.000044427677,0.000075958065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002144073,0.00020748141,0.00019424084,0.0004672664,0.000088925895,0.00010447201,0.00095595024,0.00023270582,0.000021406924],"category_scores_gemma":[0.000013114402,0.00023657986,0.00014752697,0.0008842991,0.00009816015,0.00041775455,0.0021211149,0.0007512077,0.0003479912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006207389,0.000056948746,0.00025612992,0.00004054644,0.00002982484,0.0012106687,0.0003235843,0.043918632,0.00005257787,0.95373905,0.00017641752,0.00018941432],"study_design_scores_gemma":[0.00012685203,0.000020163458,0.0017256213,0.00023162788,0.000025684403,0.0000075290236,0.00004133504,0.4200364,0.00004521938,0.57741153,0.00010299618,0.00022501848],"about_ca_topic_score_codex":0.00013140704,"about_ca_topic_score_gemma":0.00003314293,"teacher_disagreement_score":0.37632748,"about_ca_system_score_codex":0.00033514868,"about_ca_system_score_gemma":0.00018690509,"threshold_uncertainty_score":0.9647447},"labels":[],"label_agreement":null},{"id":"W4404194047","doi":"10.1017/s0960129524000276","title":"Optimal approximate minimization of one-letter weighted finite automata","year":2024,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Canadian Institute for Advanced Research; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Minification; Automaton; DFA minimization; Computer science; Mathematics; Algorithm; Nondeterministic finite automaton; Mathematical optimization; Automata theory; Theoretical computer science","score_opus":0.014219542662139094,"score_gpt":0.25226532507429367,"score_spread":0.23804578241215457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404194047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040534,0.00008719302,0.9572521,0.0006482277,0.0006110169,0.00018549386,0.000004137926,0.00032780468,0.0003500282],"genre_scores_gemma":[0.5175095,0.0000025206828,0.48216632,0.00023052953,0.00006814143,0.000006591191,0.0000012981693,0.000008327261,0.000006740635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745876,0.00006411916,0.0005363915,0.0007181049,0.0007649828,0.00045765968],"domain_scores_gemma":[0.9984699,0.00043605774,0.000087504915,0.000832976,0.00006653137,0.000107056236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008014215,0.0002123229,0.00030239267,0.00044291906,0.00009406403,0.00060891017,0.0021457062,0.00006613963,0.00006328289],"category_scores_gemma":[0.00006743492,0.00016567014,0.00007524837,0.0016671404,0.00050412514,0.00095299986,0.00095078466,0.00018826115,0.000027105456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042475,0.00009998214,0.00003592741,0.000315129,0.0000113728365,0.000053540723,0.001534321,0.0049318196,0.0010092135,0.8631479,0.0002875027,0.12856904],"study_design_scores_gemma":[0.00011635178,0.000027581733,0.00048760657,0.00017122144,0.0000034383934,0.000034113447,0.0000024419157,0.77770853,0.003808326,0.21740648,0.00007646319,0.00015746913],"about_ca_topic_score_codex":0.0000024442652,"about_ca_topic_score_gemma":2.0385424e-7,"teacher_disagreement_score":0.77277666,"about_ca_system_score_codex":0.000057884605,"about_ca_system_score_gemma":0.000105683495,"threshold_uncertainty_score":0.67558324},"labels":[],"label_agreement":null},{"id":"W4404312157","doi":"10.1103/8sbs-t24w","title":"The Product Structure of Matrix Product States under Permutations","year":2025,"lang":"en","type":"preprint","venue":"PRX Quantum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Ministerio de Ciencia e Innovación; Government of Canada; Agencia Estatal de Investigación; International Max Planck Research School for Quantum Science and Technology; Austrian Science Fund; European Commission; International Max Planck Research School for Advanced Methods in Process and Systems Engineering; International Max Planck Research School for Environmental, Cellular and Molecular Microbiology","keywords":"Product (mathematics); Combinatorics; Mathematics; Computer science; Geometry","score_opus":0.013577309723948494,"score_gpt":0.28552048709218525,"score_spread":0.27194317736823675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404312157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54435533,0.040916923,0.34179735,0.04732684,0.01624899,0.00499808,0.0013591684,0.0017334872,0.0012638369],"genre_scores_gemma":[0.9920013,0.00033928448,0.0058262567,0.00011519262,0.00019223584,0.000039749404,0.00007166132,0.000017409604,0.0013969197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978223,0.00020410618,0.00047491578,0.00078275625,0.0003819522,0.00033400932],"domain_scores_gemma":[0.99702996,0.00032103504,0.00036209184,0.0019677733,0.00027180972,0.000047304227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004445921,0.00029253692,0.00033429716,0.00013346458,0.00026820268,0.00029638954,0.0021644316,0.00008907162,0.0000136789195],"category_scores_gemma":[0.00017004512,0.00019626078,0.00013852384,0.0003756701,0.00016182047,0.0001543714,0.0015762907,0.0005329196,0.000007895993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013020374,0.00008974355,0.00014997227,0.000623417,0.00019334976,0.0000035653134,0.0021813412,0.013058672,0.0016339225,0.9627119,0.0065485593,0.012792567],"study_design_scores_gemma":[0.00013815411,0.000033614437,0.0022724764,0.00021987231,0.000054512362,0.000011972163,0.00022580377,0.079419956,0.010020795,0.90131295,0.0058940407,0.00039584332],"about_ca_topic_score_codex":0.000095543066,"about_ca_topic_score_gemma":0.000022220956,"teacher_disagreement_score":0.44764596,"about_ca_system_score_codex":0.000050643524,"about_ca_system_score_gemma":0.00052808895,"threshold_uncertainty_score":0.80032825},"labels":[],"label_agreement":null},{"id":"W4404582541","doi":"10.1007/978-3-031-77019-7_7","title":"On Concurrent Program Algebra and Demonic Automata","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Automaton; Programming language; Algebra over a field; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.012291815710185047,"score_gpt":0.257131009493719,"score_spread":0.24483919378353391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404582541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043500031,0.0034632434,0.98501104,0.0012463966,0.0027951787,0.00065346557,0.000008875216,0.0010503795,0.0053364136],"genre_scores_gemma":[0.6646036,0.0005295672,0.32666662,0.004721411,0.00093392294,0.00009708088,0.000019566427,0.00017428577,0.0022539343],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961545,0.000025488123,0.00042280662,0.001883273,0.00085164106,0.00066229247],"domain_scores_gemma":[0.9977216,0.0005425255,0.0001539964,0.0012925023,0.000076829354,0.0002125131],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074832706,0.00058701925,0.00048467726,0.0006879066,0.00019913315,0.0013434421,0.0025449747,0.00027659646,0.000020181295],"category_scores_gemma":[0.0000461499,0.00047952254,0.0001188273,0.0004855229,0.00083069416,0.00042639687,0.0019589344,0.0009123159,0.00014851472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010610748,0.00002143407,0.0000015514883,0.00004227141,0.000008068233,0.00008921398,0.00017972267,0.00030524406,0.000006774003,0.36500734,0.000058516584,0.6342788],"study_design_scores_gemma":[0.00014642188,0.00027759984,0.000026031337,0.0007651317,0.000008068402,0.000098110206,7.236916e-8,0.44187135,0.00016386386,0.5534187,0.0027824398,0.00044224932],"about_ca_topic_score_codex":0.0000058711307,"about_ca_topic_score_gemma":0.000010999477,"teacher_disagreement_score":0.6641686,"about_ca_system_score_codex":0.0001842394,"about_ca_system_score_gemma":0.00028776785,"threshold_uncertainty_score":0.99976563},"labels":[],"label_agreement":null},{"id":"W4404601874","doi":"10.1007/978-3-476-05416-6_17","title":"Modularität","year":2024,"lang":"de","type":"book-chapter","venue":"J.B. Metzler eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Medicine","score_opus":0.023153044902375502,"score_gpt":0.23388886953971774,"score_spread":0.21073582463734225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404601874","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001011477,0.010050761,0.018256007,0.0007303995,0.009204317,0.0007400774,0.00012012071,0.0011618283,0.9596353],"genre_scores_gemma":[0.017888576,0.00015940919,0.006368272,0.0017842721,0.0023880342,0.000054178152,0.00003935648,0.00030728485,0.9710106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944503,0.00007989076,0.0010903426,0.0021923056,0.0011614803,0.0010257076],"domain_scores_gemma":[0.9958699,0.00024582742,0.00037381862,0.0028625848,0.00018172432,0.00046619136],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0009626587,0.001281625,0.0011797579,0.0006573655,0.00031274787,0.0012416436,0.0026950133,0.0009835564,0.0011554544],"category_scores_gemma":[0.000023489907,0.0011833884,0.001009045,0.00008713902,0.00043327425,0.0002546104,0.002035643,0.0016598229,0.023140267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010293052,0.000020544643,7.812814e-7,0.00021245176,0.0005416906,0.00080174924,0.0008171432,0.000005121554,0.00040789702,0.9074301,0.0024163052,0.08733594],"study_design_scores_gemma":[0.00020661773,0.000097082455,0.0000040287186,0.000682891,0.0002989854,0.00008310689,0.000013314034,0.008065724,0.0006040841,0.43102565,0.55796784,0.0009506587],"about_ca_topic_score_codex":0.000039318886,"about_ca_topic_score_gemma":0.00000855174,"teacher_disagreement_score":0.5555515,"about_ca_system_score_codex":0.00017586788,"about_ca_system_score_gemma":0.00023873994,"threshold_uncertainty_score":0.99999356},"labels":[],"label_agreement":null},{"id":"W4405466740","doi":"10.1016/j.aam.2024.102834","title":"Letter frequency vs factor frequency in pure morphic words","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Factor (programming language); Frequency factor; Arithmetic; Combinatorics; Statistics; Discrete mathematics; Computer science; Physics; Programming language","score_opus":0.010677687350299388,"score_gpt":0.25297696468321423,"score_spread":0.24229927733291484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405466740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046017606,0.011487798,0.89517105,0.001576512,0.0013970787,0.0008216102,0.000019373088,0.0009628443,0.042546116],"genre_scores_gemma":[0.75269747,0.0002464894,0.24607956,0.0006397306,0.00011437857,0.00012630208,0.000003196081,0.000032348184,0.000060497998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981674,0.000020807127,0.00052059046,0.00051938294,0.00032707994,0.0004447702],"domain_scores_gemma":[0.9987528,0.00040562663,0.00008296189,0.0006896093,0.00001064621,0.00005838281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033503675,0.00026829832,0.00033208882,0.000292946,0.000037264057,0.00018344917,0.0010186172,0.0001134951,0.000067840185],"category_scores_gemma":[0.000039117458,0.0002297702,0.000060062554,0.0009045932,0.000074621676,0.0007338533,0.00017799075,0.00040248557,0.00021115923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011253902,0.000082964994,0.00021492767,0.0004014019,0.0000051486913,0.00011398809,0.0021480918,0.00007825711,0.0013452533,0.9712858,0.00012312965,0.024199862],"study_design_scores_gemma":[0.00019526936,0.00002097841,0.00014250848,0.0003590992,0.0000034786187,0.000017956509,0.0000832196,0.016128955,0.0010660071,0.97882926,0.002808307,0.00034498167],"about_ca_topic_score_codex":0.0000046494147,"about_ca_topic_score_gemma":0.000032627075,"teacher_disagreement_score":0.7066799,"about_ca_system_score_codex":0.000112310954,"about_ca_system_score_gemma":0.000050778777,"threshold_uncertainty_score":0.9369757},"labels":[],"label_agreement":null},{"id":"W4405697651","doi":"10.1142/s0129054124420061","title":"Compressed Structures for Partial Derivative Automata Constructions","year":2024,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Combinatorics; Quadratic equation; Discrete mathematics; Star (game theory); Expression (computer science); Computer science; Geometry; Mathematical analysis","score_opus":0.019820882502079015,"score_gpt":0.3248887273504064,"score_spread":0.3050678448483274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405697651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02308543,0.00009329598,0.9677165,0.0019964552,0.006801367,0.00009489952,0.000021429425,0.00006263512,0.00012796721],"genre_scores_gemma":[0.6945466,0.000008389559,0.30502456,0.000079686615,0.00032571316,0.0000027119925,0.0000021643395,0.0000038242524,0.000006387508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982677,0.00003182041,0.0005520437,0.00024029265,0.00074603845,0.00016208449],"domain_scores_gemma":[0.9975063,0.00044047396,0.00032000476,0.0002634967,0.001389562,0.000080162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006752704,0.00010633887,0.00016811333,0.000660108,0.00015485816,0.00083046546,0.002570937,0.000026780435,0.000018181765],"category_scores_gemma":[0.00012615915,0.00008940491,0.0001441843,0.0005669706,0.00052712223,0.002297537,0.00028742146,0.000111827496,0.000003480159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011344176,0.000054323064,0.000035671863,0.000011977109,0.000109472625,0.000010298195,0.00062132627,0.0031437685,0.006008257,0.84139436,0.0008087384,0.14779043],"study_design_scores_gemma":[0.0004970052,0.0001858555,0.0015724569,0.00016001209,0.00001693909,0.0005231523,0.000034184774,0.822782,0.019887337,0.14598078,0.00821333,0.00014697047],"about_ca_topic_score_codex":0.0000048303514,"about_ca_topic_score_gemma":6.1823476e-7,"teacher_disagreement_score":0.8196382,"about_ca_system_score_codex":0.000083483406,"about_ca_system_score_gemma":0.0006965889,"threshold_uncertainty_score":0.80081975},"labels":[],"label_agreement":null},{"id":"W4405718309","doi":"10.1109/tit.2024.3521236","title":"On Constructing Bent Functions From Cyclotomic Mappings","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; Natural Science Foundation of Hubei Province; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bent molecular geometry; Bent function; Mathematics; Discrete mathematics; Computer science; Boolean function; Combinatorics; Algebra over a field; Pure mathematics; Engineering; Structural engineering","score_opus":0.00626930448683798,"score_gpt":0.20340754927411842,"score_spread":0.19713824478728043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405718309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024530092,0.00003448873,0.9625588,0.00032581534,0.0034469087,0.00018152547,0.00010777186,0.0011482191,0.0076663783],"genre_scores_gemma":[0.99476576,0.000014723252,0.0035208876,0.0012037741,0.00005937047,0.0000621651,0.000016232889,0.000012381947,0.00034473298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987929,0.00008284769,0.0003924558,0.00023487558,0.00027483178,0.00022211338],"domain_scores_gemma":[0.99864256,0.00069269474,0.00007696706,0.00046062804,0.000043183158,0.000083986364],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003987579,0.00018832221,0.00013220026,0.00044983864,0.0003029317,0.0005058908,0.0003771673,0.000092348935,0.00046406817],"category_scores_gemma":[0.000010660035,0.00017115062,0.00014530405,0.00042367136,0.000068019384,0.002278533,0.000004059248,0.0003565195,0.0028454605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035616507,0.00004232336,4.986443e-7,0.000028256003,0.00009104346,0.0000035105177,0.0029573515,0.0075302045,0.0005809973,0.51885015,0.0009099517,0.46897012],"study_design_scores_gemma":[0.0013249398,0.00036135112,0.000079780046,0.0008234402,0.00010914921,0.00014275135,0.0042944793,0.4372317,0.05525136,0.46849954,0.030667191,0.0012143251],"about_ca_topic_score_codex":0.000016006608,"about_ca_topic_score_gemma":0.0000011251767,"teacher_disagreement_score":0.97023565,"about_ca_system_score_codex":0.00012301187,"about_ca_system_score_gemma":0.00007243124,"threshold_uncertainty_score":0.99793094},"labels":[],"label_agreement":null},{"id":"W4406150722","doi":"10.5802/alco.386","title":"Torsors and Tilings from Toric Toggling","year":2025,"lang":"en","type":"article","venue":"Algebraic Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Harvard University; National Science Foundation","keywords":"Computer science","score_opus":0.0021959821081968646,"score_gpt":0.19712789959254468,"score_spread":0.19493191748434782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406150722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92577446,0.0036012505,0.061441835,0.0011046914,0.003165393,0.00013571096,0.0000020637558,0.00046406413,0.004310545],"genre_scores_gemma":[0.9966513,0.00009586693,0.00175873,0.0006928444,0.0000446591,0.000008271178,0.000002684632,0.000008347357,0.00073729974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889225,0.00004390729,0.0002108623,0.00042459398,0.00017774511,0.00025064542],"domain_scores_gemma":[0.99885964,0.00040767604,0.000059353093,0.000541486,0.000049789196,0.000082070575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023306682,0.00015632932,0.00019784772,0.00012852838,0.00016329392,0.0001876076,0.0006801994,0.00008769158,0.000012958726],"category_scores_gemma":[0.00009755133,0.00015399001,0.000048873873,0.0006639107,0.00003668923,0.00031179286,0.00049722963,0.0001572372,0.000020825848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017698691,0.000040508923,0.0025623182,0.000010993005,0.000021520991,0.000008906487,0.0004034718,0.0000010173375,0.00021372052,0.9701236,0.0014060572,0.025206102],"study_design_scores_gemma":[0.0004846243,0.000037596234,0.0074132537,0.000053083888,0.00001602288,0.00000245685,0.00008029119,0.01096786,0.002274341,0.96577626,0.012655657,0.00023854498],"about_ca_topic_score_codex":0.00009950789,"about_ca_topic_score_gemma":0.0000023794328,"teacher_disagreement_score":0.07087685,"about_ca_system_score_codex":0.000059719718,"about_ca_system_score_gemma":0.000055464545,"threshold_uncertainty_score":0.62795305},"labels":[],"label_agreement":null},{"id":"W4406486971","doi":"10.1016/s0197-2510(10)70261-8","title":"10.1016/s0197-2510(10)70261-8","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.004565753882900736,"score_gpt":0.16226693367637665,"score_spread":0.15770117979347592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406486971","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003446326,0.000077470875,0.00022757544,0.00052032666,0.0000037370419,0.00011161929,0.0000051212055,0.00049206574,0.99821746],"genre_scores_gemma":[0.00018863223,1.791487e-7,0.0019985498,0.00016312028,0.0001273437,0.0000115586045,0.000004323408,0.000015963,0.99749035],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988073,0.00005338612,0.00018180466,0.00037430832,0.0002276523,0.00035556045],"domain_scores_gemma":[0.9989721,0.000075457596,0.000032417895,0.0007208811,0.00003306991,0.00016603724],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00024731556,0.00015575917,0.0001635374,0.000076180855,0.000104611565,0.00016090066,0.0010591131,0.000055914978,0.99404466],"category_scores_gemma":[0.00002151918,0.00014419074,0.00006868276,0.0003534494,0.000029450743,0.0003087541,0.00017738696,0.00009054159,0.99712324],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000887136,0.00003159425,1.9286189e-8,0.0000022574693,0.0000063146817,0.000009050315,0.000032712887,0.000038537237,0.000052847085,0.00006612142,0.31281078,0.6869409],"study_design_scores_gemma":[0.00015074055,0.00010343292,0.000018767954,0.000015042006,0.0000039270467,0.000017413662,5.889867e-7,0.008327806,0.00023173388,0.00023811076,0.9906844,0.0002080362],"about_ca_topic_score_codex":0.000012784425,"about_ca_topic_score_gemma":5.892292e-8,"teacher_disagreement_score":0.6867328,"about_ca_system_score_codex":0.000026936146,"about_ca_system_score_gemma":0.000029228468,"threshold_uncertainty_score":0.5879928},"labels":[],"label_agreement":null},{"id":"W4406779735","doi":"10.1007/s00224-025-10214-1","title":"Rudin-Shapiro Sums Via Automata Theory and Logic","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Automaton; Computer science; Discrete mathematics; Algebra over a field; Calculus (dental); Pure mathematics; Theoretical computer science","score_opus":0.012222276497982786,"score_gpt":0.2517760887789627,"score_spread":0.23955381228097988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406779735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14157146,0.0029584737,0.84441125,0.0001345629,0.0012530773,0.0002769968,0.0000030027265,0.0005991852,0.008791973],"genre_scores_gemma":[0.9961701,0.000013807472,0.002701937,0.00032378559,0.00008263477,0.0000049971677,0.0000018840727,0.000014801159,0.0006860545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970101,0.0011924766,0.0006121821,0.000527775,0.0002604852,0.00039699],"domain_scores_gemma":[0.9962796,0.0022302158,0.00031564792,0.0010026834,0.000091934155,0.00007994681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00593823,0.00026612825,0.00053776184,0.00026118706,0.00023030971,0.0001749099,0.0013223574,0.00011709526,0.000006445773],"category_scores_gemma":[0.00015340663,0.00022559897,0.000098641605,0.00045621744,0.0002671062,0.00020992315,0.00078207307,0.00017222196,0.000021402238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022969303,0.000047669284,0.00018001061,0.00022539312,0.00006736364,0.000007846556,0.00080303376,0.00019440766,0.0015889078,0.96064794,0.00020279239,0.03601164],"study_design_scores_gemma":[0.00073519885,0.00011109275,0.0034003097,0.0008269621,0.000035848072,0.000100409925,0.00050507364,0.20079602,0.0014584789,0.7909569,0.00067591056,0.00039776482],"about_ca_topic_score_codex":0.000019762118,"about_ca_topic_score_gemma":3.6202633e-7,"teacher_disagreement_score":0.85459864,"about_ca_system_score_codex":0.00003883042,"about_ca_system_score_gemma":0.000057528006,"threshold_uncertainty_score":0.91996586},"labels":[],"label_agreement":null},{"id":"W4407127330","doi":"10.1007/978-3-031-48825-2","title":"Completely Regular Semigroup Varieties","year":2025,"lang":"en","type":"book","venue":"Synthesis lectures on mathematics and statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semigroup; Mathematics; Pure mathematics","score_opus":0.011285050740788147,"score_gpt":0.22099848980265546,"score_spread":0.20971343906186732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407127330","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028139882,0.00095175864,0.84083146,0.00023276612,0.00027006827,0.0002798849,0.00060720794,0.00021540567,0.15660866],"genre_scores_gemma":[0.00019569595,0.0006967676,0.6846301,0.0011064174,0.00017791643,0.0000972554,0.00008272819,0.00009585902,0.31291726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976219,0.000083161336,0.00059230876,0.0006841427,0.0006065499,0.0004119245],"domain_scores_gemma":[0.9935773,0.0045807813,0.0003771745,0.0012155448,0.0001206348,0.0001285754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047225866,0.0006252786,0.00092657324,0.0002928856,0.00029651486,0.00051877316,0.001113271,0.0003823409,0.00010810526],"category_scores_gemma":[0.00060504134,0.00052675075,0.00013176468,0.00011270646,0.00020798182,0.00006543284,0.00037745998,0.00047993186,0.000045302164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003935752,0.0000478247,1.3299704e-7,0.0007241499,0.00012074004,0.00003397178,0.00031737587,0.0000107165415,0.000009560444,0.8097819,0.15623292,0.03271679],"study_design_scores_gemma":[0.00009095878,0.000085319676,0.0000047525814,0.00073088217,0.00012666671,0.000022992837,0.00001715686,0.026328791,0.00017283976,0.8675364,0.10434505,0.0005381485],"about_ca_topic_score_codex":0.000004157411,"about_ca_topic_score_gemma":0.000006043233,"teacher_disagreement_score":0.1563086,"about_ca_system_score_codex":0.000099097844,"about_ca_system_score_gemma":0.00027657836,"threshold_uncertainty_score":0.9997184},"labels":[],"label_agreement":null},{"id":"W4407774368","doi":"10.37256/cm.6120256175","title":"Word Motifs and a Generalized Hamming Distance","year":2025,"lang":"en","type":"article","venue":"Contemporary Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"China Scholarship Council","keywords":"Mathematics; Hamming distance; Word (group theory); Hamming graph; Hamming code; Combinatorics; Algorithm; Geometry; Decoding methods","score_opus":0.019554020566804376,"score_gpt":0.24775935032072055,"score_spread":0.22820532975391616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407774368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030563047,0.0030556782,0.94713444,0.0010460176,0.00023032974,0.00019361936,0.0000025728168,0.00028521987,0.017489092],"genre_scores_gemma":[0.86129594,0.000031337986,0.132617,0.000650231,0.00002473433,0.000021711981,0.000002103787,0.0000106599155,0.0053463094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913144,0.000038752267,0.00028589342,0.0002632331,0.00011854303,0.00016214914],"domain_scores_gemma":[0.99905145,0.00019803428,0.000096295385,0.0005689727,0.00003086661,0.000054376964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032617766,0.00014067955,0.00023871822,0.00008291499,0.000107941625,0.00019283134,0.0005080461,0.00004623909,0.000004292555],"category_scores_gemma":[0.0000695614,0.00012138255,0.000044589822,0.00026082268,0.00006263353,0.00034378175,0.00028257945,0.00007950294,0.000008990583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030971294,0.00006121183,0.00022325484,0.000177832,0.00002724971,0.000021270489,0.0012777526,0.0000023206849,0.00051768555,0.97952825,0.0060184253,0.012141627],"study_design_scores_gemma":[0.0011208713,0.0000295951,0.00039406025,0.00061934727,0.000014675838,0.000022573025,0.00041283376,0.277718,0.0024080605,0.67434555,0.04246069,0.0004537171],"about_ca_topic_score_codex":0.000004712164,"about_ca_topic_score_gemma":0.0000011457042,"teacher_disagreement_score":0.8307329,"about_ca_system_score_codex":0.000016128162,"about_ca_system_score_gemma":0.00006212311,"threshold_uncertainty_score":0.4949837},"labels":[],"label_agreement":null},{"id":"W4408444984","doi":"10.5070/c65165014","title":"On the number of squares in a finite word","year":2025,"lang":"en","type":"article","venue":"Combinatorial Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université du Québec à Montréal","keywords":"Word (group theory); Computer science; Least-squares function approximation; Mathematics; Arithmetic; Statistics; Geometry","score_opus":0.008094390021761747,"score_gpt":0.25462337723611894,"score_spread":0.2465289872143572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408444984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85305387,0.0003157507,0.03152445,0.0024326786,0.009633587,0.00044640203,0.000004192421,0.00022277924,0.10236631],"genre_scores_gemma":[0.998939,0.0000054149664,0.00009893209,0.0005058247,0.000037581234,0.00001934112,3.9277333e-7,0.0000046483015,0.00038890677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989207,0.00035687408,0.00019092743,0.00020473693,0.00015477958,0.00017197653],"domain_scores_gemma":[0.9960857,0.003135618,0.00006582413,0.00065865426,0.000034002343,0.00002016839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012344663,0.0001041166,0.0001629797,0.0000909156,0.00006071496,0.000046937595,0.001067808,0.000060001952,0.00007566979],"category_scores_gemma":[0.0005659446,0.00007150875,0.000066996334,0.0005915158,0.00009823466,0.00009810513,0.00026622872,0.00016949099,0.000040241393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047090725,0.00009678305,0.00024331825,0.000007392073,0.000009311818,0.000003545541,0.00026356993,0.000011299297,0.00006562835,0.9909616,0.0008879369,0.007402514],"study_design_scores_gemma":[0.00048195673,0.000021975915,0.0006522975,0.00010325008,0.000002383043,4.1274367e-7,0.000050619456,0.00077279774,0.0024410144,0.9942825,0.001117123,0.00007366386],"about_ca_topic_score_codex":0.0000075133325,"about_ca_topic_score_gemma":5.192813e-7,"teacher_disagreement_score":0.14588511,"about_ca_system_score_codex":0.000027115484,"about_ca_system_score_gemma":0.000058237572,"threshold_uncertainty_score":0.29160422},"labels":[],"label_agreement":null},{"id":"W4408567163","doi":"10.61091/jcmcc124-27","title":"Graphs of reduced words and some connections","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Linguistics; Combinatorics; Computer science; Philosophy","score_opus":0.009923363222652895,"score_gpt":0.2516400508154038,"score_spread":0.24171668759275092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408567163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95198524,0.0011262909,0.030765949,0.00045265543,0.014691216,0.0001812887,0.0000011044498,0.00005288121,0.00074338453],"genre_scores_gemma":[0.9904399,0.000087664026,0.009152671,0.000040681018,0.0002592049,0.0000010333052,2.1215858e-7,0.000010733184,0.0000079261445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805975,0.00010826671,0.0010080752,0.00021266274,0.00037304376,0.00023818688],"domain_scores_gemma":[0.9973942,0.00096911704,0.0008580042,0.00031605494,0.00034004616,0.0001225766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014828352,0.0002136267,0.00069675536,0.00039042966,0.00023244228,0.00021425773,0.00060872646,0.00012582277,0.0000014677988],"category_scores_gemma":[0.00039575543,0.00018866493,0.00014736969,0.00055602676,0.00013372056,0.00040294303,0.000437763,0.00032667277,3.0753452e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021023496,0.00025468442,0.000072014016,0.00014565492,0.000098732125,0.0000063150183,0.00084857154,0.000006153443,0.002229968,0.9924724,0.00012708473,0.0037173678],"study_design_scores_gemma":[0.0023532081,0.00036259423,0.00017355777,0.00047704743,0.00006208791,0.00006470708,0.00030058538,0.007877676,0.003764857,0.98419434,0.00019956812,0.00016979237],"about_ca_topic_score_codex":0.0000067176456,"about_ca_topic_score_gemma":9.33094e-8,"teacher_disagreement_score":0.038454644,"about_ca_system_score_codex":0.000033906523,"about_ca_system_score_gemma":0.00015365894,"threshold_uncertainty_score":0.7693533},"labels":[],"label_agreement":null},{"id":"W4408707386","doi":"10.1016/j.disc.2025.114487","title":"Combinatorics on words and generating Dirichlet series of automatic sequences","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Mathematics; Combinatorics; Series (stratigraphy); Dirichlet distribution; Dirichlet series; Discrete mathematics","score_opus":0.011094295410950547,"score_gpt":0.2498030594622259,"score_spread":0.23870876405127534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408707386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.652684,0.0004587076,0.3357573,0.0008336882,0.0003280818,0.00023610644,0.0000076242786,0.00026945074,0.009425058],"genre_scores_gemma":[0.91309166,0.000031784537,0.08624901,0.00014859455,0.000010758942,0.000012453472,0.0000015965165,0.0000075804705,0.00044656466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990717,0.000044384487,0.00032462826,0.00019412341,0.00020365427,0.0001614804],"domain_scores_gemma":[0.99906546,0.0002693267,0.00015180322,0.00044355995,0.00003464447,0.00003522314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034204504,0.00014137056,0.00025937814,0.00010115908,0.000109186825,0.00013252946,0.0004451715,0.00004638369,0.000005093172],"category_scores_gemma":[0.00012926207,0.00011033671,0.000041387942,0.0003667736,0.00009898231,0.0002253454,0.00022281888,0.000077225464,0.0000032205721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.833295e-7,0.000041053932,0.00016691575,0.00034730462,0.000021782915,0.0000032585128,0.0021738394,0.00003757169,0.0007884375,0.9926716,0.000104112805,0.0036434482],"study_design_scores_gemma":[0.000217509,0.00011353916,0.00030265533,0.0005799649,0.000019640636,0.000011570821,0.0010882841,0.41830987,0.009739623,0.5693039,0.000103393235,0.0002100467],"about_ca_topic_score_codex":0.0000032259238,"about_ca_topic_score_gemma":9.0179515e-7,"teacher_disagreement_score":0.4233677,"about_ca_system_score_codex":0.000016942535,"about_ca_system_score_gemma":0.000036502854,"threshold_uncertainty_score":0.44994003},"labels":[],"label_agreement":null},{"id":"W4409442370","doi":"10.1142/s0129054125430026","title":"Language Quotients Revisited","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Quotient; Mathematics; Computer science; Linguistics; Programming language; Pure mathematics; Discrete mathematics; Philosophy","score_opus":0.008207469668431198,"score_gpt":0.3085720398270894,"score_spread":0.3003645701586582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409442370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07902198,0.00009627231,0.9156285,0.0014294196,0.0025228905,0.000037753645,0.0000018028287,0.000019347912,0.0012420593],"genre_scores_gemma":[0.8514156,0.000012525389,0.14801419,0.00040100224,0.000096982236,4.4285517e-7,7.903005e-7,0.0000015751563,0.00005693067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984853,0.00003423764,0.00047473828,0.00016012877,0.0007267561,0.000118785014],"domain_scores_gemma":[0.99776936,0.00013554058,0.00039353504,0.0003165691,0.0013343696,0.0000506571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000882873,0.00007146635,0.00013720687,0.00087581703,0.00008221769,0.0003146542,0.003540557,0.000018006023,0.000013820519],"category_scores_gemma":[0.00015372824,0.00006157215,0.00008933757,0.0009295407,0.00021185225,0.0014912816,0.00046539525,0.00009187892,0.0000070628353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014685316,0.00023595808,0.0014217235,0.000010402388,0.00009969488,0.000028528779,0.0011510194,0.0008928959,0.0131613305,0.5860351,0.0015489658,0.39539975],"study_design_scores_gemma":[0.0041175443,0.00066438026,0.12020283,0.002023637,0.00006301277,0.00072245876,0.00027544223,0.5864124,0.10663881,0.1560001,0.022103125,0.0007763251],"about_ca_topic_score_codex":0.000006430519,"about_ca_topic_score_gemma":4.884283e-7,"teacher_disagreement_score":0.7723936,"about_ca_system_score_codex":0.00008484392,"about_ca_system_score_gemma":0.00040275292,"threshold_uncertainty_score":0.6579295},"labels":[],"label_agreement":null},{"id":"W4410091070","doi":"10.1016/j.tcs.2025.115280","title":"Maximal universal width of an AFA is NP-hard","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Computer science; Algorithm; Discrete mathematics","score_opus":0.006597708026147521,"score_gpt":0.2374176688564213,"score_spread":0.23081996083027378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410091070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15053363,0.000023289229,0.840888,0.001261761,0.0005278689,0.000096157586,0.000003324703,0.00018897622,0.006476973],"genre_scores_gemma":[0.82399446,0.0000023599725,0.17442507,0.0014951181,0.000038867052,0.0000013813253,5.0230085e-7,0.0000043595105,0.000037921563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997782,0.00011773676,0.00028303184,0.00075081957,0.0005685209,0.0004978943],"domain_scores_gemma":[0.99813664,0.00018953692,0.000073617426,0.001215033,0.00018053946,0.00020466227],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012857885,0.00017975883,0.0002527903,0.00030337507,0.00025431847,0.00026467413,0.00396357,0.000059962254,0.00007393839],"category_scores_gemma":[0.00003809901,0.0001519916,0.000081624705,0.0016488279,0.0030016927,0.0009848209,0.0014583047,0.00016194567,0.000032039596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012787728,0.000078002864,0.000049058443,0.000008808143,0.00000521841,0.0000101403175,0.00037223872,0.000029838931,0.0016866168,0.9396119,0.000125313,0.05801004],"study_design_scores_gemma":[0.00028363147,0.00022146845,0.0015952687,0.00003844204,0.000006435786,0.000017779535,0.000014664705,0.49452108,0.024539838,0.47831142,0.000266884,0.00018310381],"about_ca_topic_score_codex":0.0000076117885,"about_ca_topic_score_gemma":2.5321103e-7,"teacher_disagreement_score":0.6734608,"about_ca_system_score_codex":0.000049178543,"about_ca_system_score_gemma":0.00022728517,"threshold_uncertainty_score":0.9997116},"labels":[],"label_agreement":null},{"id":"W4410231175","doi":"10.1007/s00233-025-10527-0","title":"Descending chains of varieties of completely regular semigroups","year":2025,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Algebra over a field; Regular semigroup; Pure mathematics; Semigroup; Arithmetic; Special classes of semigroups; Combinatorics; Discrete mathematics","score_opus":0.005350251740365935,"score_gpt":0.2239998652729443,"score_spread":0.21864961353257836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410231175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14964782,0.0020765287,0.8337931,0.0015405152,0.00093560806,0.0003806277,0.000032121792,0.00037211957,0.011221565],"genre_scores_gemma":[0.98458403,0.000050301624,0.013929276,0.0003945967,0.000026778685,0.0000123624795,0.000009069277,0.000015778429,0.0009778083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978911,0.00010420647,0.00065861916,0.00045100693,0.0003795365,0.0005154748],"domain_scores_gemma":[0.9980845,0.00029473306,0.00031872877,0.0010936494,0.0001348662,0.00007355657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006692311,0.0002510968,0.00053523196,0.00036476905,0.00014129939,0.000051507013,0.0015196843,0.0001407438,0.000021850017],"category_scores_gemma":[0.00009020713,0.00023998591,0.00023005265,0.0009723179,0.00023837364,0.00039790993,0.0007209174,0.00018277409,0.0000063102734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016856697,0.00010452491,0.0031057035,0.00017704573,0.00007537205,0.000004889797,0.0006555825,0.000047238846,0.034341473,0.9468675,0.0036719434,0.01093185],"study_design_scores_gemma":[0.0025180893,0.00062730745,0.015641313,0.0015425824,0.00011762806,0.000056564833,0.0036533342,0.112180345,0.43705493,0.40035057,0.025010934,0.0012464015],"about_ca_topic_score_codex":0.00010746227,"about_ca_topic_score_gemma":0.000019059553,"teacher_disagreement_score":0.8349362,"about_ca_system_score_codex":0.000055168777,"about_ca_system_score_gemma":0.00009214464,"threshold_uncertainty_score":0.9786341},"labels":[],"label_agreement":null},{"id":"W4410741100","doi":"10.1016/j.jalgebra.2025.05.012","title":"Generalised power series determined by linear recurrence relations","year":2025,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Series (stratigraphy); Recurrence relation; Power (physics); Power series; Statistics; Combinatorics; Mathematical analysis; Thermodynamics; Geology","score_opus":0.006032807190838684,"score_gpt":0.23703522189640114,"score_spread":0.23100241470556246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410741100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5409445,0.002286307,0.4392235,0.011689198,0.0023041544,0.00010438707,0.0000074223394,0.000093210736,0.003347335],"genre_scores_gemma":[0.92858446,0.00010194559,0.06620323,0.0014833191,0.00011765284,0.00000210428,0.0000016467374,0.000008245329,0.0034974248],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999149,0.00006503332,0.0003571886,0.00011581156,0.00017619782,0.00013676398],"domain_scores_gemma":[0.99922204,0.000099078934,0.0002221306,0.00025407146,0.00013992618,0.00006277527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033470916,0.000087511304,0.0001565598,0.00013235418,0.000091291084,0.0001002297,0.0006467386,0.00004806727,0.00004718914],"category_scores_gemma":[0.00011718939,0.00007075118,0.00009222738,0.0003439066,0.000038016147,0.000811384,0.00009655999,0.00017068138,0.000015342694],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011537349,0.00038491318,0.0027391007,0.000037977486,0.00025344396,0.00018995395,0.0023003833,0.00018972716,0.049410246,0.41345748,0.45710257,0.07381883],"study_design_scores_gemma":[0.004602492,0.0016474157,0.019826522,0.0010739933,0.00015310603,0.0010645755,0.0003825909,0.05003829,0.11920149,0.36277238,0.4378366,0.0014005676],"about_ca_topic_score_codex":0.0000015967463,"about_ca_topic_score_gemma":5.7761633e-7,"teacher_disagreement_score":0.38763994,"about_ca_system_score_codex":0.000028973238,"about_ca_system_score_gemma":0.000121908626,"threshold_uncertainty_score":0.28851494},"labels":[],"label_agreement":null},{"id":"W4411169467","doi":"10.1007/s11047-025-10022-z","title":"Algorithms for maximal existential and universal width","year":2025,"lang":"en","type":"article","venue":"Natural Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Existentialism; Theory of computation; Computer science; Mathematics; Algorithm; Epistemology; Philosophy","score_opus":0.010669383250928591,"score_gpt":0.2648285221914973,"score_spread":0.2541591389405687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411169467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09547505,0.00080656476,0.8999428,0.00072518026,0.0014558586,0.00016243641,0.0000019180159,0.0002619166,0.0011682893],"genre_scores_gemma":[0.86205035,0.0000018064317,0.1371239,0.00036202246,0.000100242716,7.533062e-7,0.0000026531966,0.0000036821245,0.0003546034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992391,0.000026030806,0.0001228725,0.000294642,0.00008984834,0.00022749206],"domain_scores_gemma":[0.9995172,0.00019145895,0.00004504154,0.00016142233,0.00005237619,0.00003248193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021311581,0.00009911584,0.0001220455,0.00008237183,0.00022520707,0.00016205107,0.00040532651,0.00004571454,0.0000010815988],"category_scores_gemma":[0.000030074854,0.00009030244,0.000053598196,0.00020219716,0.00003921231,0.00020437442,0.00038421608,0.00012807232,0.0000013600085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013283679,0.000013962485,0.000104060724,0.00003309631,0.000026199617,0.000008170324,0.00020183335,0.000031080486,0.0008594351,0.3546723,0.0009888472,0.6430477],"study_design_scores_gemma":[0.000693666,0.00003942278,0.0019265894,0.0000521341,0.000008833927,0.000016796032,0.000049901315,0.9751585,0.00085858593,0.016762266,0.004278762,0.00015450778],"about_ca_topic_score_codex":0.000010527197,"about_ca_topic_score_gemma":9.3206904e-7,"teacher_disagreement_score":0.97512746,"about_ca_system_score_codex":0.000028077477,"about_ca_system_score_gemma":0.000030367572,"threshold_uncertainty_score":0.36824268},"labels":[],"label_agreement":null},{"id":"W4411300943","doi":"10.1007/s11047-025-10032-x","title":"On decidability of problems involving insertion operations","year":2025,"lang":"en","type":"article","venue":"Natural Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Theory of computation; Computer science; Mathematics; Calculus (dental); Algorithm","score_opus":0.008204423882996022,"score_gpt":0.25574242990320906,"score_spread":0.24753800602021303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411300943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82015383,0.0002887307,0.17785598,0.00035016803,0.00047556602,0.00013389245,2.7621476e-7,0.00014018163,0.0006013662],"genre_scores_gemma":[0.9841519,0.0000012847165,0.015369497,0.00041582028,0.00001876943,0.0000017376096,0.0000017384427,0.0000023382356,0.000036931815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991668,0.000078414094,0.0002419336,0.00023722477,0.00013774424,0.00013788756],"domain_scores_gemma":[0.9992236,0.00029566928,0.00004874577,0.0003066143,0.00010670834,0.00001864901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004185748,0.000080462145,0.00011879847,0.00010705426,0.00017082445,0.000079134654,0.0004497229,0.000041260446,0.0000020519842],"category_scores_gemma":[0.00024036241,0.00006812471,0.000048058708,0.0004935055,0.000026672076,0.00020219006,0.00023766755,0.00017696618,0.0000034704203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067984074,0.000113371956,0.0020006788,0.00008626308,0.000020024185,0.0000011066561,0.0008865302,0.02170652,0.028374458,0.8110966,0.0002468245,0.13546084],"study_design_scores_gemma":[0.00016450555,0.00003116249,0.018961996,0.00018601953,0.0000021864344,0.0000010765177,0.000024112072,0.9486299,0.007758367,0.024127277,0.00003263852,0.00008076481],"about_ca_topic_score_codex":0.000039997307,"about_ca_topic_score_gemma":0.0000113068145,"teacher_disagreement_score":0.9269234,"about_ca_system_score_codex":0.000053522777,"about_ca_system_score_gemma":0.000047909172,"threshold_uncertainty_score":0.2778045},"labels":[],"label_agreement":null},{"id":"W4411442212","doi":"10.1007/978-3-662-69359-9_521","title":"Recursive Partitioning","year":2025,"lang":"en","type":"book-chapter","venue":"International Encyclopedia of Statistical Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science","score_opus":0.008509289670155485,"score_gpt":0.2628516792246103,"score_spread":0.2543423895544548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411442212","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031689635,0.000048081376,0.34442154,0.0004046243,0.0011601611,0.000068976165,0.00014046286,0.000042516094,0.6537105],"genre_scores_gemma":[0.009828236,0.0011450899,0.2944056,0.00085977046,0.00044424064,0.000027072407,0.00009985192,0.000027036001,0.6931631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767876,0.000010843975,0.00043855567,0.00059785374,0.0010328509,0.00024111946],"domain_scores_gemma":[0.9981986,0.00058253837,0.00024823102,0.00039852006,0.0004472187,0.00012487435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042798935,0.00018837125,0.00023832654,0.00030630804,0.000109772765,0.00012328473,0.0022476895,0.00008957281,0.00059968553],"category_scores_gemma":[0.00061297964,0.0001785064,0.000065762746,0.00013581086,0.00078650395,0.00045356093,0.0006667062,0.00022771812,0.00009994093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028370048,0.000013347949,0.0000072730077,0.000010006967,0.000013403631,0.000020959644,0.000047199468,0.000006682915,0.000013254727,0.93475324,0.004605539,0.06050626],"study_design_scores_gemma":[0.00009276967,0.000042118558,0.00024038168,0.00024388712,0.000011235654,0.000009020596,0.0000041302796,0.0045637228,0.00006924886,0.8198593,0.17465463,0.00020954334],"about_ca_topic_score_codex":0.00002000726,"about_ca_topic_score_gemma":0.0000031838638,"teacher_disagreement_score":0.17004909,"about_ca_system_score_codex":0.00014182946,"about_ca_system_score_gemma":0.0005319424,"threshold_uncertainty_score":0.727928},"labels":[],"label_agreement":null},{"id":"W4411450127","doi":"10.37236/13499","title":"The Repetition Threshold for Ternary Rich Words","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ternary operation; Repetition (rhetorical device); Conjecture; Mathematics; Combinatorics; Binary number; Polynomial; Root (linguistics); Discrete mathematics; Arithmetic; Computer science; Mathematical analysis; Linguistics; Philosophy","score_opus":0.004598387732743194,"score_gpt":0.23934507771130026,"score_spread":0.23474668997855708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411450127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06160131,0.015477329,0.90076905,0.016554372,0.002607543,0.0002648421,5.002981e-7,0.000056768535,0.0026682944],"genre_scores_gemma":[0.99707556,0.001066401,0.00007639093,0.0003593351,0.000100658894,0.000008375198,2.1079387e-7,0.000006674958,0.0013064067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987844,0.00008838379,0.00033587968,0.000108472836,0.00026655255,0.00041629712],"domain_scores_gemma":[0.9983595,0.00065954163,0.0002843047,0.00048195085,0.00018646326,0.00002824535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024001333,0.000102203005,0.00014588116,0.00007181076,0.00042286728,0.0001733271,0.0018698474,0.000041770607,9.925527e-7],"category_scores_gemma":[0.00010002293,0.00005455585,0.00013315536,0.0004690082,0.000051436375,0.00022239017,0.00013671245,0.00042905257,0.0000017749212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002937126,0.000040326184,0.00005138797,0.000004753692,0.000054146087,0.0000018091757,0.00008869837,0.000024964065,0.00010938233,0.9910098,0.0033115973,0.005273819],"study_design_scores_gemma":[0.0004609284,0.00025860927,0.00015592345,0.000032134576,0.000023904762,0.000061504485,0.00006431855,0.004829952,0.0013073258,0.96825635,0.02448624,0.00006278931],"about_ca_topic_score_codex":0.0000011092669,"about_ca_topic_score_gemma":0.0000014751598,"teacher_disagreement_score":0.9354742,"about_ca_system_score_codex":0.0002266043,"about_ca_system_score_gemma":0.00038498902,"threshold_uncertainty_score":0.34746727},"labels":[],"label_agreement":null},{"id":"W4411720705","doi":"10.61091/ars163-01","title":"Monophonic and edge monophonic numbers of corona product graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Corona (planetary geology); Enhanced Data Rates for GSM Evolution; Product (mathematics); Combinatorics; Telecommunications; Computer science; Geometry; Physics","score_opus":0.005726198067973053,"score_gpt":0.2221859811168071,"score_spread":0.21645978304883404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910806,0.0026121382,0.00035276383,0.00035547646,0.0025437078,0.0002085879,0.0000018907232,0.00014836875,0.0026964636],"genre_scores_gemma":[0.9983534,0.0001440564,0.0010101489,0.00013202586,0.0000029755167,0.000015395684,0.0000014229871,0.000008556036,0.0003320078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988008,0.00006951024,0.0002653294,0.00044124428,0.00016018616,0.0002629119],"domain_scores_gemma":[0.99884725,0.00013277086,0.00010399891,0.00078267686,0.000068406145,0.00006491367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003244555,0.00016130449,0.00025687972,0.00014317909,0.00009827359,0.00006301675,0.00073834654,0.000056518198,0.000007179046],"category_scores_gemma":[0.000046536174,0.00015676876,0.00006615617,0.0006936354,0.00012345257,0.0003558434,0.0003725937,0.00013394041,0.000012539694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076030424,0.00009060199,0.0032487442,0.000044741693,0.00003747637,0.0000045332567,0.00028267127,0.0000025641293,0.0027310671,0.9794376,0.0017394157,0.012372999],"study_design_scores_gemma":[0.0007503487,0.0000743996,0.017803427,0.00006400237,0.00001433054,0.0000060070724,0.00004404492,0.0017663277,0.016714865,0.9616896,0.00088713126,0.00018554612],"about_ca_topic_score_codex":0.0000810199,"about_ca_topic_score_gemma":0.0000029694606,"teacher_disagreement_score":0.017748013,"about_ca_system_score_codex":0.000036134854,"about_ca_system_score_gemma":0.00011538549,"threshold_uncertainty_score":0.63928443},"labels":[],"label_agreement":null},{"id":"W4411772012","doi":"10.1007/978-3-031-97548-6_8","title":"Words Avoiding Half-Flips","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Artificial intelligence; Algorithm","score_opus":0.013169856159038025,"score_gpt":0.23666817123818085,"score_spread":0.22349831507914283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040996703,0.0009206244,0.97505975,0.0012590539,0.00340586,0.00027234372,0.0000037353818,0.0004010127,0.018636605],"genre_scores_gemma":[0.22338355,0.00017309857,0.75764585,0.008222406,0.0014686146,0.000024253884,0.000011379272,0.000082270824,0.008988588],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957604,0.00006305525,0.0005588232,0.0018402252,0.0009495384,0.00082799565],"domain_scores_gemma":[0.99637324,0.0010364873,0.0002505802,0.0020042348,0.0001590353,0.00017641453],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001591224,0.0006153394,0.00061339064,0.0011679855,0.00047065062,0.0008963189,0.0054487474,0.00037548746,0.000040836476],"category_scores_gemma":[0.000178096,0.00056542363,0.00019318506,0.00096699956,0.0005704384,0.0007045183,0.0026613353,0.0012809087,0.00008421104],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025724637,0.000017520124,0.0000152686,0.000042898035,0.000011495584,0.000099175675,0.0006288088,0.0027733706,0.00010681587,0.22230855,0.00013359974,0.7738599],"study_design_scores_gemma":[0.00022882604,0.00008100713,0.000031704072,0.0009750654,0.000009778959,0.00006747954,3.401093e-7,0.4606398,0.0017013262,0.5262346,0.0091745695,0.00085548783],"about_ca_topic_score_codex":0.000025332798,"about_ca_topic_score_gemma":0.00003424302,"teacher_disagreement_score":0.7730044,"about_ca_system_score_codex":0.00033515392,"about_ca_system_score_gemma":0.00068975164,"threshold_uncertainty_score":0.9999322},"labels":[],"label_agreement":null},{"id":"W4411772245","doi":"10.1007/978-3-031-97548-6_4","title":"Maximal 2-Dimensional Binary Words of Bounded Degree","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Montreal Police Service; Université du Québec à Montréal","funders":"","keywords":"Degree (music); Computer science; Bounded function; Binary number; Algorithm; Arithmetic; Mathematics; Mathematical analysis; Physics","score_opus":0.017779266767959392,"score_gpt":0.2397637187666649,"score_spread":0.22198445199870553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772245","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048303374,0.00092784635,0.988903,0.0007818039,0.0020847055,0.00025405287,0.000010960238,0.00016405915,0.006390574],"genre_scores_gemma":[0.1497323,0.000037041267,0.84474725,0.0025244453,0.00037043018,0.000009593312,0.000011983261,0.000039736584,0.002527239],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962715,0.00004239839,0.00062359235,0.0013868916,0.0010748224,0.0006008243],"domain_scores_gemma":[0.9969982,0.0006881406,0.0003230598,0.0016275913,0.00023049976,0.00013249926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009282753,0.00050944235,0.0006504854,0.0010878196,0.00020316384,0.00024495067,0.004007611,0.0003327979,0.000049925606],"category_scores_gemma":[0.00008008842,0.00045588595,0.00020163214,0.00083082705,0.000992634,0.00047455385,0.0026251536,0.00067319814,0.00002328734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018873658,0.00006795809,0.00003996519,0.00008848163,0.000025861256,0.00016174922,0.00031165103,0.00472235,0.00058194494,0.1855579,0.00021526028,0.808208],"study_design_scores_gemma":[0.0003597492,0.00022972423,0.0002952451,0.0009343107,0.00001275933,0.00007782728,1.5093138e-7,0.4357316,0.0026659209,0.55765396,0.0013661783,0.00067260384],"about_ca_topic_score_codex":0.000026238939,"about_ca_topic_score_gemma":0.000022390604,"teacher_disagreement_score":0.8075354,"about_ca_system_score_codex":0.00019787728,"about_ca_system_score_gemma":0.0010474658,"threshold_uncertainty_score":0.9997893},"labels":[],"label_agreement":null},{"id":"W4411772259","doi":"10.1007/978-3-031-97548-6_18","title":"Purely Automatic Sequences with the Uniform Distribution Property","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Property (philosophy); Distribution (mathematics); Theoretical computer science; Mathematics; Mathematical analysis","score_opus":0.009956550483565524,"score_gpt":0.21527595654168058,"score_spread":0.20531940605811505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000094439994,0.00029597516,0.9888201,0.0052937805,0.00065463834,0.00052320573,0.00001253641,0.00030744015,0.003997897],"genre_scores_gemma":[0.62709445,0.00011780494,0.35597247,0.008575181,0.00075546006,0.00010620832,0.00006449414,0.00007341191,0.007240554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689263,0.000049736016,0.00036911535,0.0011347869,0.00096308015,0.00059065217],"domain_scores_gemma":[0.9974186,0.00049314526,0.00026827276,0.0015152717,0.00020876872,0.00009597517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010672003,0.000490252,0.0004141868,0.0002657188,0.0005135824,0.0008971261,0.004510194,0.00020624169,0.000014626427],"category_scores_gemma":[0.000058916132,0.00023208167,0.000094981704,0.00090911094,0.0011630757,0.0006668785,0.0010988142,0.0007176107,0.00002426774],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004292522,0.000020119349,0.000023912504,0.00006677164,0.000019404451,0.00006473774,0.00045407054,0.005764342,0.000024478892,0.11741411,0.00023905201,0.8759047],"study_design_scores_gemma":[0.00020306243,0.00022379571,0.00018309726,0.0009571114,0.000017381395,0.00013255335,7.8212145e-7,0.8481287,0.0006109114,0.14150748,0.007406537,0.000628622],"about_ca_topic_score_codex":0.000044278284,"about_ca_topic_score_gemma":0.000092617425,"teacher_disagreement_score":0.8752761,"about_ca_system_score_codex":0.00031935805,"about_ca_system_score_gemma":0.0009912206,"threshold_uncertainty_score":0.9464016},"labels":[],"label_agreement":null},{"id":"W4411772264","doi":"10.1007/978-3-031-97548-6_3","title":"Avoiding Abelian and Additive Powers in Rich Words","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of Victoria","funders":"","keywords":"Computer science; Abelian group; Algebra over a field; Artificial intelligence; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.008010118868852199,"score_gpt":0.22909934543379187,"score_spread":0.22108922656493968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005841927,0.0011802486,0.98804903,0.0007283271,0.0013315844,0.0002812535,0.000009913015,0.00014019766,0.0076952623],"genre_scores_gemma":[0.7050965,0.0004973051,0.2868891,0.005366992,0.000420598,0.00001576188,0.000010918995,0.00005160797,0.0016512397],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967829,0.00007618239,0.00042610412,0.0015168577,0.00056072045,0.00063720933],"domain_scores_gemma":[0.99758875,0.0011781811,0.00017056912,0.0008442969,0.00008973249,0.0001284507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014351738,0.00046668478,0.0004995749,0.0013854045,0.00027486487,0.00051754015,0.0023033093,0.00028255334,0.000016642553],"category_scores_gemma":[0.00019459357,0.0004372956,0.00006849024,0.0010335309,0.000563111,0.0005985623,0.0016758429,0.0012093445,0.000013625695],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004324845,0.00001812444,0.000070136186,0.000032041462,0.000008456941,0.0001800964,0.0023931672,0.0010241779,0.000062411316,0.06463532,0.000057918453,0.93151385],"study_design_scores_gemma":[0.0006383336,0.00017290183,0.000751466,0.0027760842,0.0000106657435,0.00012188351,0.000005370971,0.49467945,0.0015728256,0.49501666,0.002872662,0.0013816869],"about_ca_topic_score_codex":0.00003254522,"about_ca_topic_score_gemma":0.00007878633,"teacher_disagreement_score":0.93013215,"about_ca_system_score_codex":0.00027003148,"about_ca_system_score_gemma":0.00039762352,"threshold_uncertainty_score":0.9998079},"labels":[],"label_agreement":null},{"id":"W4411806180","doi":"10.1007/978-3-031-97100-6_15","title":"Small Balanced Vertex Separators in NFA to Regular Expression Conversion","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Vertex (graph theory); Expression (computer science); Parallel computing; Algorithm; Arithmetic; Theoretical computer science; Programming language; Mathematics; Graph","score_opus":0.010585043622686908,"score_gpt":0.2266176578072556,"score_spread":0.21603261418456868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411806180","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018770954,0.00033425738,0.9916617,0.0006984484,0.002295071,0.00048660842,0.0000047352214,0.00019120456,0.0024508592],"genre_scores_gemma":[0.38375685,0.00009121431,0.6017875,0.011321028,0.00038883594,0.000040754367,0.00001732249,0.000070684386,0.0025258344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961929,0.00006490774,0.00052068953,0.0018023235,0.0007132883,0.0007059322],"domain_scores_gemma":[0.99734354,0.00047855522,0.00017655868,0.0016619707,0.00012841218,0.00021094197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009003313,0.0005291114,0.0006070567,0.0012718188,0.00017244542,0.00035019784,0.0039037275,0.00037417654,0.000022278833],"category_scores_gemma":[0.000106865955,0.0004833651,0.000119565346,0.0010799317,0.00025440572,0.0004305372,0.0023459524,0.0006564964,0.000060691113],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058940193,0.0001045404,0.00040062642,0.00020218163,0.000015539968,0.00046332375,0.0024747034,0.029899146,0.008910311,0.04901004,0.00119395,0.9072667],"study_design_scores_gemma":[0.0011201481,0.00033691063,0.00069613464,0.004766475,0.000009663175,0.00003981126,0.0000012365238,0.73730093,0.0530646,0.1913729,0.009474985,0.0018162313],"about_ca_topic_score_codex":0.000027301692,"about_ca_topic_score_gemma":0.00003741963,"teacher_disagreement_score":0.90545046,"about_ca_system_score_codex":0.00039356094,"about_ca_system_score_gemma":0.00046897988,"threshold_uncertainty_score":0.9997618},"labels":[],"label_agreement":null},{"id":"W4412648270","doi":"10.55016/ojs/cdm.v13i1.62475","title":"String C-groups of order 1024","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council of the Philippines; Commission on Higher Education","keywords":"Mathematics; Combinatorics; Order (exchange); String (physics); Mathematical physics","score_opus":0.01049363309361958,"score_gpt":0.2827691279041704,"score_spread":0.27227549481055086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052402034,0.000051064166,0.94390917,0.00073749165,0.00019946291,0.00022121398,0.00007092164,0.00017089154,0.0022377782],"genre_scores_gemma":[0.8821428,0.0000026375883,0.11736873,0.00012918709,0.00010821145,0.000018046796,0.0000050792078,0.000010416647,0.00021490116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998822,0.000032218606,0.0003706377,0.00023023882,0.00023318535,0.000311757],"domain_scores_gemma":[0.99831736,0.00017493017,0.00012554994,0.00081397267,0.00044514306,0.00012306366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044460702,0.00013709738,0.00024636879,0.00011935365,0.00015986012,0.00009548827,0.0008108084,0.000056560777,0.000064522756],"category_scores_gemma":[0.00053843285,0.00011617335,0.00007254593,0.00074069086,0.00010773671,0.00022719368,0.00040921554,0.0000744257,0.00025749093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001797226,0.000056747223,0.000021401353,0.000022373937,0.000022205088,0.0000014425523,0.0009804694,0.000011173349,0.0031245418,0.99328965,0.0008503735,0.0016178375],"study_design_scores_gemma":[0.0012651703,0.00060034485,0.0009485454,0.00055147614,0.00009008201,0.000059120684,0.0007889848,0.21818984,0.10688233,0.65615326,0.013524002,0.000946821],"about_ca_topic_score_codex":0.0000047617705,"about_ca_topic_score_gemma":0.0000036151084,"teacher_disagreement_score":0.82974076,"about_ca_system_score_codex":0.00004681258,"about_ca_system_score_gemma":0.00006338174,"threshold_uncertainty_score":0.47374117},"labels":[],"label_agreement":null},{"id":"W4412656973","doi":"10.1016/j.ejc.2025.104224","title":"Stability properties for subgroups generated by return words","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Mathematics; Combinatorics; Stability (learning theory)","score_opus":0.019218019895092715,"score_gpt":0.22186009486592484,"score_spread":0.20264207497083211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412656973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3646606,0.003255025,0.6250712,0.0014960092,0.0024263035,0.00018088837,0.0000043705404,0.000097292796,0.002808307],"genre_scores_gemma":[0.99649906,0.000057415185,0.0024237323,0.00035525655,0.00006572462,0.0000015246857,0.0000012117392,0.000015679494,0.0005803844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982383,0.0004897712,0.0005784362,0.00020007616,0.00025346677,0.00023989685],"domain_scores_gemma":[0.9985778,0.00012721789,0.00031636286,0.00041881873,0.00046213658,0.0000977017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024775816,0.0001533882,0.00025878052,0.00011295862,0.00014985524,0.00023457265,0.0012848842,0.000027220585,0.0000047560347],"category_scores_gemma":[0.000259428,0.000118339296,0.00013249344,0.00049539626,0.000056831854,0.00040819935,0.00019174916,0.00024019397,0.0000038689072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000385463,0.001619259,0.0032265352,0.00039026348,0.00038850718,0.00021158221,0.003637007,0.00006650363,0.1033693,0.5929585,0.21476763,0.07897941],"study_design_scores_gemma":[0.01186542,0.003823919,0.005378457,0.000967735,0.00019163363,0.00020944419,0.0009057194,0.04901117,0.30186263,0.18528014,0.43872464,0.0017790903],"about_ca_topic_score_codex":6.4745177e-7,"about_ca_topic_score_gemma":1.16448874e-7,"teacher_disagreement_score":0.63183844,"about_ca_system_score_codex":0.0000857778,"about_ca_system_score_gemma":0.00012423604,"threshold_uncertainty_score":0.48257363},"labels":[],"label_agreement":null},{"id":"W4412755235","doi":"10.1007/978-3-031-97274-4_2","title":"Binary Right-Distinguishability Operation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Binary number; Arithmetic; Mathematics","score_opus":0.01011225097890231,"score_gpt":0.2407523893566184,"score_spread":0.2306401383777161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412755235","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012241976,0.00041053636,0.9786438,0.00095312204,0.002498593,0.0003480538,0.00000726851,0.0003233435,0.016692862],"genre_scores_gemma":[0.30137354,0.000040591935,0.6901804,0.0046450915,0.0010356453,0.00002445563,0.00002552655,0.000043616896,0.002631103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996429,0.0000558479,0.00053136965,0.0017178319,0.0007244729,0.000541437],"domain_scores_gemma":[0.9969786,0.0006187211,0.00019611581,0.0018553601,0.00022576255,0.00012548192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012481405,0.00047952842,0.00048083812,0.00065121386,0.00037552495,0.00068902253,0.0037205683,0.00030458713,0.000063330066],"category_scores_gemma":[0.0002020763,0.00042014444,0.00013785655,0.00057393475,0.00059254136,0.0006106857,0.0019080418,0.0006833013,0.000054248303],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048224656,0.00005130797,0.00006394019,0.00008047592,0.000010382622,0.00012048771,0.0004043518,0.008234137,0.00020768515,0.24898455,0.00020013271,0.7416377],"study_design_scores_gemma":[0.00015954248,0.00010014602,0.0002428712,0.0003828825,0.000005787263,0.00002603985,6.902484e-8,0.6308257,0.0010547339,0.36400834,0.002658253,0.0005356386],"about_ca_topic_score_codex":0.00002869769,"about_ca_topic_score_gemma":0.00003587942,"teacher_disagreement_score":0.7411021,"about_ca_system_score_codex":0.00034046982,"about_ca_system_score_gemma":0.00071540603,"threshold_uncertainty_score":0.99982506},"labels":[],"label_agreement":null},{"id":"W4413160469","doi":"10.1016/j.ic.2025.105337","title":"Existential and universal width of alternating finite automata","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; Yonsei University","keywords":"Existentialism; Automaton; Finite-state machine; Mathematics; Computer science; Philosophy; Algorithm; Theoretical computer science; Epistemology","score_opus":0.006225159939000734,"score_gpt":0.2358706380819668,"score_spread":0.22964547814296604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413160469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15844497,0.000021893973,0.8371097,0.00019393263,0.00011667876,0.000051696068,0.0000017116726,0.00006972078,0.003989735],"genre_scores_gemma":[0.9849246,0.00001776501,0.014808776,0.0002157046,0.000004794701,9.150696e-7,0.000009536936,7.399179e-7,0.000017171194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961454,0.00001735568,0.00017795734,0.00005773715,0.00008014007,0.0000522739],"domain_scores_gemma":[0.9996947,0.00006927371,0.00010337842,0.00006588274,0.00004973987,0.000017025774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012759831,0.00004491891,0.000061151535,0.00014984481,0.000060147853,0.000110281915,0.000093748946,0.000020622263,0.0000011626795],"category_scores_gemma":[0.000017249034,0.000044168133,0.000011051558,0.0001519442,0.000025370118,0.0011361433,0.00010225627,0.000028649743,0.0000019253591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006153461,0.00000829973,0.00031904035,0.00006299335,0.000010523016,3.6170303e-7,0.0014646836,0.0019552049,0.000045270408,0.26743203,0.00010954188,0.7285859],"study_design_scores_gemma":[0.0004362587,0.000022886266,0.0071308897,0.00003784655,0.00000323842,0.0000031700804,0.00012975535,0.98143345,0.00020823548,0.009828011,0.00072030094,0.000045942164],"about_ca_topic_score_codex":0.000023359067,"about_ca_topic_score_gemma":6.646109e-7,"teacher_disagreement_score":0.97947824,"about_ca_system_score_codex":0.0000073509445,"about_ca_system_score_gemma":0.000020952051,"threshold_uncertainty_score":0.18011242},"labels":[],"label_agreement":null},{"id":"W4413290211","doi":"10.1007/978-3-032-01475-7_9","title":"Left Quotients of Deterministic Context-Free Languages","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Quotient; Context-free language; Programming language; Context (archaeology); Theoretical computer science; Natural language processing; Mathematics; Combinatorics; Rule-based machine translation; History","score_opus":0.009272351827042124,"score_gpt":0.24334797840927214,"score_spread":0.23407562658223002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413290211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021729367,0.0008450395,0.9875863,0.00032135617,0.0014857777,0.00026312607,0.000023398996,0.00014512635,0.009112549],"genre_scores_gemma":[0.7781928,0.000050156414,0.21631634,0.002671961,0.00028455575,0.000005796986,0.0000083176665,0.000038430426,0.002431623],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969759,0.000038100097,0.0005698676,0.0011333484,0.0007833577,0.0004994144],"domain_scores_gemma":[0.99624604,0.0008053953,0.00033222727,0.0023143615,0.00019224886,0.000109737906],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006168605,0.00044187641,0.00063225493,0.0007892656,0.00012816982,0.00022279765,0.006076348,0.00025126012,0.000030163555],"category_scores_gemma":[0.0002803175,0.00039542365,0.00015751497,0.00035273784,0.0007103897,0.0003310066,0.0027212214,0.000466193,0.000017501261],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005631301,0.00003566595,0.000084252926,0.00011639487,0.000016729751,0.000099483856,0.0007657608,0.0006847563,0.00015302356,0.115187205,0.00012751932,0.88272357],"study_design_scores_gemma":[0.0009966905,0.00045556622,0.00052594015,0.002758865,0.000035814035,0.00013138104,0.000001965064,0.33193496,0.00833583,0.6503218,0.0030975805,0.0014036148],"about_ca_topic_score_codex":0.000028663113,"about_ca_topic_score_gemma":0.000075394564,"teacher_disagreement_score":0.88131994,"about_ca_system_score_codex":0.00012549298,"about_ca_system_score_gemma":0.000475467,"threshold_uncertainty_score":0.99984974},"labels":[],"label_agreement":null},{"id":"W4413302136","doi":"10.1007/978-3-032-01475-7_5","title":"Relativized Codes, Finite Decodability, and Bounded Languages","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Bounded function; Programming language; Theoretical computer science; Algorithm; Mathematics","score_opus":0.010051892593447598,"score_gpt":0.25190771235810155,"score_spread":0.24185581976465395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413302136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001987251,0.0016854994,0.9859074,0.0009694331,0.00074224937,0.00030965536,0.000011190335,0.00025935547,0.00991654],"genre_scores_gemma":[0.14873473,0.00023740187,0.8426049,0.0042118076,0.00033915957,0.00001792022,0.000015261641,0.000044554297,0.0037942606],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689424,0.00006511468,0.00044810286,0.001488925,0.0005811882,0.00052240415],"domain_scores_gemma":[0.99609876,0.002025294,0.00019708122,0.0014179845,0.00012390171,0.00013695724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012008477,0.00046966938,0.0005768888,0.0006425199,0.00027483026,0.0007200284,0.002319444,0.00031725215,0.00002310706],"category_scores_gemma":[0.0002872027,0.0004135155,0.00010256183,0.00050675555,0.00090461393,0.00050765136,0.0021112962,0.00068986806,0.00001704062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066148846,0.000023011053,0.00012912451,0.000071599155,0.0000165854,0.000080523045,0.00065934943,0.00069123704,0.000048619408,0.22228552,0.00005195492,0.7759358],"study_design_scores_gemma":[0.00030309742,0.00007432988,0.00018028256,0.00042398516,0.000009483472,0.000034630193,2.8089914e-7,0.3489643,0.00040684897,0.6470376,0.002066703,0.00049846363],"about_ca_topic_score_codex":0.00004239934,"about_ca_topic_score_gemma":0.00011334424,"teacher_disagreement_score":0.7754374,"about_ca_system_score_codex":0.0001682729,"about_ca_system_score_gemma":0.00044955005,"threshold_uncertainty_score":0.9998317},"labels":[],"label_agreement":null},{"id":"W4413333548","doi":"10.1007/s00224-025-10234-x","title":"The Reflection Complexity of Sequences Over Finite Alphabets","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts; Fonds De La Recherche Scientifique - FNRS","keywords":"Reflection (computer programming); Computer science; Mathematics; Theoretical computer science; Programming language","score_opus":0.03375936000535939,"score_gpt":0.29392277937979244,"score_spread":0.26016341937443305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413333548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31005794,0.0015598144,0.67668456,0.0001604994,0.0019619332,0.00022795385,0.0000030370559,0.0001831443,0.009161109],"genre_scores_gemma":[0.9985254,0.000008906618,0.0010623707,0.00005548788,0.000049995186,0.0000022660527,7.24384e-7,0.0000046077635,0.0002902838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814814,0.0006491776,0.0005247826,0.00022296105,0.00024470495,0.0002102104],"domain_scores_gemma":[0.9968977,0.0019231905,0.00040265976,0.0006264178,0.00012575093,0.00002429503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030285588,0.00012127644,0.00028812463,0.00010698344,0.00027234497,0.00008575463,0.0010661039,0.000050195315,0.000001904682],"category_scores_gemma":[0.00012446762,0.00008507517,0.00008943545,0.00048230976,0.00040667102,0.00012001312,0.00025716645,0.00010449336,0.0000030647582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014195214,0.000021458747,0.00019005024,0.00010182585,0.000047564226,6.993185e-7,0.0006446639,0.0013726323,0.001996415,0.98257,0.00016536067,0.012875152],"study_design_scores_gemma":[0.00041166347,0.00011916384,0.006153491,0.0009011631,0.000020736863,0.000013886769,0.0007229432,0.41424948,0.009865217,0.56623137,0.001102533,0.00020833696],"about_ca_topic_score_codex":0.00007532656,"about_ca_topic_score_gemma":0.0000036146296,"teacher_disagreement_score":0.68846744,"about_ca_system_score_codex":0.00003224462,"about_ca_system_score_gemma":0.00006815171,"threshold_uncertainty_score":0.34692645},"labels":[],"label_agreement":null},{"id":"W4413433805","doi":"10.1007/978-3-032-02602-6_17","title":"Self-verifying Predicates in Büchi Arithmetic","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Arithmetic; Programming language; Theoretical computer science; Mathematics","score_opus":0.008840546809535327,"score_gpt":0.2269995450683038,"score_spread":0.21815899825876847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413433805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001094442,0.001276039,0.9870478,0.0008363137,0.001656181,0.00038650853,0.0000041281382,0.0004080428,0.008275568],"genre_scores_gemma":[0.12997597,0.00024675654,0.8652981,0.0032111534,0.00042510658,0.000028112834,0.000007016592,0.000046545825,0.00076125574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959888,0.00005524994,0.00062007137,0.001726947,0.0008264918,0.00078244985],"domain_scores_gemma":[0.9972211,0.0007796787,0.00022501792,0.0015285957,0.00010447159,0.00014109824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012289494,0.00054938096,0.00061341183,0.0015128482,0.0001869068,0.0005869072,0.0046533807,0.00037091886,0.000016776503],"category_scores_gemma":[0.000117799376,0.0005103837,0.00012875917,0.0011459934,0.00042790946,0.00060976215,0.0021766752,0.0010490443,0.000036168043],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046859695,0.00008904723,0.00025423654,0.00021576426,0.000020536303,0.0002656205,0.0013757482,0.0063707167,0.000080697464,0.10271554,0.00006122508,0.88854617],"study_design_scores_gemma":[0.0002829849,0.00007780946,0.0002609871,0.0009236146,0.000007692824,0.000046100362,2.2293318e-7,0.7111021,0.0007346175,0.28377384,0.0021795726,0.0006104277],"about_ca_topic_score_codex":0.000028513827,"about_ca_topic_score_gemma":0.000049029957,"teacher_disagreement_score":0.88793576,"about_ca_system_score_codex":0.00036289095,"about_ca_system_score_gemma":0.00072709686,"threshold_uncertainty_score":0.99973476},"labels":[],"label_agreement":null},{"id":"W4413470498","doi":"10.1007/978-3-031-84869-8_2","title":"On Constructing Finite Automata by Relational Programming","year":2025,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Programming language; Automaton; Theoretical computer science","score_opus":0.014394458148780332,"score_gpt":0.23842962934714856,"score_spread":0.22403517119836824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413470498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004257622,0.00017539202,0.66109097,0.00012297755,0.000447062,0.0006603965,0.00023301938,0.0005057259,0.3367219],"genre_scores_gemma":[0.00040977704,0.000093818984,0.92560667,0.0001509688,0.00007172815,0.000043977347,0.000054234675,0.00008359682,0.07348523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968567,0.0000071420773,0.0010254915,0.0008056023,0.0007984015,0.00050666806],"domain_scores_gemma":[0.9970283,0.0013555778,0.0007926721,0.00047178377,0.00024511098,0.00010657383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076894206,0.0005923417,0.00065936014,0.00046051023,0.00015737311,0.0004307042,0.0011053418,0.00037037206,0.000056258858],"category_scores_gemma":[0.00083261996,0.000621165,0.000093793315,0.00014507346,0.00016535097,0.00026008772,0.0005946599,0.00092834583,0.00009102561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029934024,0.00006193849,0.000013623366,0.0006983549,0.000044996872,0.000024897437,0.0005043231,0.000006204342,0.000010874374,0.9527899,0.005423194,0.040418673],"study_design_scores_gemma":[0.0003580421,0.00006907417,0.000004700552,0.002421653,0.000042318115,0.000018832288,0.00004735908,0.058607094,0.00005171716,0.9077529,0.029952608,0.0006737092],"about_ca_topic_score_codex":0.0000022730242,"about_ca_topic_score_gemma":0.0000012259798,"teacher_disagreement_score":0.26451573,"about_ca_system_score_codex":0.00022302534,"about_ca_system_score_gemma":0.00016519944,"threshold_uncertainty_score":0.99962395},"labels":[],"label_agreement":null},{"id":"W4413477173","doi":"10.1007/978-3-031-84869-8_3","title":"Skeleton Key: Subduction Classes in Finite Transformation Semigroups and Green’s Relations","year":2025,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transformation (genetics); Key (lock); Subduction; Skeleton (computer programming); Geology; Pure mathematics; Computer science; Mathematics; Paleontology; Chemistry; Tectonics; Programming language; Computer security","score_opus":0.011172413936260332,"score_gpt":0.22784367110798887,"score_spread":0.21667125717172853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413477173","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010605301,0.000495956,0.82503057,0.000547318,0.00036338554,0.0009866573,0.000121048186,0.00028841768,0.17110611],"genre_scores_gemma":[0.02022009,0.0026610864,0.86457086,0.00021681724,0.00019935281,0.00015351886,0.000109130306,0.00015859836,0.11171053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976794,0.0000096310305,0.000991492,0.0005477271,0.00042239102,0.00034936244],"domain_scores_gemma":[0.9985621,0.00046232998,0.00044176643,0.00028275652,0.00017796685,0.00007309782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006942536,0.0004419172,0.00055207015,0.0008343347,0.00010745106,0.0002634999,0.00049778476,0.00037190167,0.000024741254],"category_scores_gemma":[0.00020164839,0.00047842175,0.000057373745,0.0002032523,0.0001027587,0.0007933886,0.00020817648,0.00072293275,0.00002635087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035126252,0.000042408472,0.000060776678,0.0012108875,0.000018317793,0.0000109477305,0.005361207,0.000016675061,0.000026675783,0.97747463,0.0003108175,0.015463162],"study_design_scores_gemma":[0.00032655938,0.000044074128,0.00020422284,0.0014723154,0.000042227286,0.000015721898,0.00018198593,0.09774909,0.000038398794,0.8919327,0.0075203627,0.00047232944],"about_ca_topic_score_codex":0.000031335563,"about_ca_topic_score_gemma":0.00011953776,"teacher_disagreement_score":0.09773242,"about_ca_system_score_codex":0.0002554651,"about_ca_system_score_gemma":0.000105552084,"threshold_uncertainty_score":0.99976677},"labels":[],"label_agreement":null},{"id":"W4413477249","doi":"10.1007/978-3-031-84869-8_4","title":"The Attractor-Cycle Notation for Finite Transformations","year":2025,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Notation; Attractor; Computer science; Algebra over a field; Mathematics; Pure mathematics; Arithmetic; Mathematical analysis","score_opus":0.014884106416907796,"score_gpt":0.25057014519092946,"score_spread":0.23568603877402167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413477249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009860563,0.0001958915,0.8819008,0.00031447093,0.00038137005,0.000912028,0.00022343839,0.00015022645,0.1159119],"genre_scores_gemma":[0.0011241831,0.0008819497,0.89027655,0.00018193584,0.00015575101,0.00028354855,0.00005569282,0.00009335715,0.106947035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979744,0.0000041082326,0.0008594624,0.00037817552,0.0004028981,0.00038095814],"domain_scores_gemma":[0.99685854,0.0018889739,0.00047950324,0.00035462662,0.00035803294,0.000060348913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079753366,0.0003659548,0.00039131558,0.00022922819,0.0003422879,0.00053581124,0.0010853295,0.00021544188,0.0000104401715],"category_scores_gemma":[0.00044579804,0.00030739047,0.000114013754,0.000093692724,0.000098695295,0.00031041796,0.00014968103,0.00040644646,0.0000308871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003480432,0.000026217678,0.0000010234305,0.00069998275,0.0000325538,0.0000015510836,0.0017185045,0.000017028602,0.00001072945,0.96673745,0.0022833555,0.02846814],"study_design_scores_gemma":[0.00020722288,0.000032016233,0.000009760358,0.00046070793,0.00004254727,0.0000024089795,0.00006634715,0.14161897,0.000050934166,0.80213463,0.055082265,0.00029219824],"about_ca_topic_score_codex":0.0000019582758,"about_ca_topic_score_gemma":0.000014045076,"teacher_disagreement_score":0.16460282,"about_ca_system_score_codex":0.00012952278,"about_ca_system_score_gemma":0.0001340739,"threshold_uncertainty_score":0.99993783},"labels":[],"label_agreement":null},{"id":"W4413876139","doi":"10.1017/s0004972725100440","title":"RUNS IN PAPERFOLDING SEQUENCES","year":2025,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics","score_opus":0.014247800964222474,"score_gpt":0.25413000553046466,"score_spread":0.23988220456624218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413876139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67679507,0.00020982683,0.061491795,0.2109215,0.000865487,0.0011262273,0.000009037971,0.00042449968,0.04815656],"genre_scores_gemma":[0.93747056,0.000008556181,0.054186717,0.0011165778,0.000016779242,0.000014096602,1.8847963e-7,0.000005262962,0.007181275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998971,0.000061277504,0.00031765882,0.00020862352,0.00020120296,0.00024023395],"domain_scores_gemma":[0.99906164,0.00028123002,0.00008316032,0.0005225657,0.000020158759,0.000031257456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006848123,0.00011020844,0.00020229243,0.000017555083,0.00008759135,0.00005577716,0.0012946322,0.00008209888,0.00026559178],"category_scores_gemma":[0.00011132229,0.000072102695,0.0002277941,0.00034229472,0.0001786574,0.000036893074,0.00037575336,0.0001707163,0.000043010743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015983677,0.00014869441,0.0009049548,0.0002753026,0.000039114944,0.0000014922541,0.0010825575,0.000056381603,0.004166159,0.941354,0.05003841,0.0019313715],"study_design_scores_gemma":[0.0006839841,0.000034639837,0.012634958,0.0014146626,0.000032875705,0.00001335659,0.0011923637,0.0071561914,0.031757306,0.90665966,0.038027614,0.00039238614],"about_ca_topic_score_codex":0.000027763077,"about_ca_topic_score_gemma":6.406794e-7,"teacher_disagreement_score":0.26067546,"about_ca_system_score_codex":0.00003937417,"about_ca_system_score_gemma":0.00003451116,"threshold_uncertainty_score":0.29402626},"labels":[],"label_agreement":null},{"id":"W4413966079","doi":"10.70930/tac/adc8tpfc","title":"Finitely presentable morphisms in exact sequences","year":2010,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Morphism; Mathematics; Pure mathematics; Finitely-generated abelian group","score_opus":0.00910223455600371,"score_gpt":0.24638602555346836,"score_spread":0.23728379099746466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72754395,0.0005631886,0.26281005,0.0004846795,0.00009767733,0.00032676617,0.000009657647,0.00013320986,0.008030819],"genre_scores_gemma":[0.996284,0.000038158927,0.00319505,0.000048786485,0.000032395248,0.00009900762,0.000003184736,0.0000038324742,0.00029558025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994036,0.000049646627,0.00016035387,0.00018397134,0.0000796915,0.00012271898],"domain_scores_gemma":[0.9990985,0.00035753992,0.00006682932,0.00041719823,0.00002979902,0.000030124196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061687053,0.00007612322,0.00011294181,0.00008397538,0.00008113129,0.00005167219,0.0005070696,0.00004275295,0.000038531663],"category_scores_gemma":[0.000030003353,0.00006462488,0.000018572871,0.0002894091,0.00027267443,0.00035629413,0.00011461967,0.000111780064,0.00000769784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052301857,0.000032039705,0.000426841,0.000010269064,0.0000029169782,4.4800228e-7,0.00041583984,0.000005733058,0.012763216,0.96432984,0.00001937045,0.021988288],"study_design_scores_gemma":[0.000089323665,0.000014163141,0.0013117022,0.0000039192405,0.0000026673376,0.000008271923,0.00023686117,0.00039349662,0.03526451,0.9595688,0.0030229108,0.00008338187],"about_ca_topic_score_codex":0.000033986453,"about_ca_topic_score_gemma":0.000009726462,"teacher_disagreement_score":0.26874006,"about_ca_system_score_codex":0.0000026061,"about_ca_system_score_gemma":0.000029671839,"threshold_uncertainty_score":0.2635326},"labels":[],"label_agreement":null},{"id":"W4414163255","doi":"10.1080/00029890.2025.2545706","title":"A Lebesgue Integral Variant of the Additive Square Problem","year":2025,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lebesgue integration; Square (algebra); Riemann integral; Lebesgue–Stieltjes integration; Lebesgue measure; Mean square","score_opus":0.0049397729517786605,"score_gpt":0.2273676459635397,"score_spread":0.22242787301176103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414163255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015741345,0.00009133489,0.6936024,0.0058272304,0.00021546987,0.0007187251,0.000047412046,0.00028666182,0.2834694],"genre_scores_gemma":[0.93599564,0.0000018528012,0.062607415,0.00079646753,0.000015556614,0.00005639929,0.0000010570839,0.000008314246,0.0005172872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876654,0.00012933176,0.00033647488,0.00027584936,0.0002407358,0.00025106664],"domain_scores_gemma":[0.9984185,0.00051224726,0.00017774405,0.0007669857,0.000071065646,0.00005347304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024956916,0.00015085663,0.00033112598,0.00006640918,0.00007812224,0.000053215954,0.0011978579,0.000031871034,0.000035909456],"category_scores_gemma":[0.00021697854,0.00009002468,0.00015673377,0.0008222562,0.00044258588,0.00012952421,0.00045841996,0.00016422599,0.000026875769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045041006,0.00013701557,0.000037273938,0.000039741564,0.000034505694,0.000004940215,0.0007885576,0.000011626732,0.00012497768,0.9786966,0.0014526774,0.018667623],"study_design_scores_gemma":[0.00019623876,0.00012185691,0.002225103,0.0004069227,0.00002628391,0.000008348562,0.00081753713,0.039713763,0.0020468337,0.95301545,0.0012532227,0.00016842048],"about_ca_topic_score_codex":0.00009998332,"about_ca_topic_score_gemma":0.0000073935485,"teacher_disagreement_score":0.9202543,"about_ca_system_score_codex":0.00003390263,"about_ca_system_score_gemma":0.000094180985,"threshold_uncertainty_score":0.36711},"labels":[],"label_agreement":null},{"id":"W4414533853","doi":"10.5539/jmr.v17n3p1","title":"On the Palindromic Complexity of Words by Substitution of Letter Power in Modulo-recurrent Words","year":2025,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Palindrome; Word (group theory); Substitution (logic); Integer (computer science); Power (physics); Word length; Combinatorics on words","score_opus":0.08914577765917518,"score_gpt":0.3731454157720771,"score_spread":0.2839996381129019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414533853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9215249,0.00025973318,0.07363674,0.0032469528,0.00019209468,0.00015726307,0.0000046279865,0.0000041282506,0.00097356585],"genre_scores_gemma":[0.9957618,0.000036193815,0.00403925,0.00007471536,0.000014343724,0.0000027105425,2.9848206e-7,0.0000040691025,0.00006659266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770164,0.00033198102,0.0006839399,0.00011159039,0.0009477975,0.00022306225],"domain_scores_gemma":[0.99773186,0.0011930092,0.00031023388,0.00046377705,0.00026282182,0.00003829411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005528864,0.000087389184,0.0003001346,0.0004444429,0.00005452099,0.00005205799,0.0012771238,0.000052982316,0.000047267386],"category_scores_gemma":[0.00046908887,0.000054149958,0.00010391407,0.00069676916,0.0003055291,0.00013260775,0.00023795199,0.00055710314,0.000005378476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061782885,0.0012293581,0.00018380256,0.00024250495,0.00006103618,0.000013582624,0.0025867517,0.0001295572,0.012217678,0.9659245,0.014967317,0.0023821555],"study_design_scores_gemma":[0.0011064258,0.0005118703,0.0022320244,0.0024964146,0.000010546893,0.00002441042,0.00080821273,0.07117458,0.041860722,0.87906444,0.0005529818,0.00015738326],"about_ca_topic_score_codex":0.000010158215,"about_ca_topic_score_gemma":0.000004143623,"teacher_disagreement_score":0.08686004,"about_ca_system_score_codex":0.000096097654,"about_ca_system_score_gemma":0.00013864611,"threshold_uncertainty_score":0.2420367},"labels":[],"label_agreement":null},{"id":"W4414699161","doi":"10.4230/lipics.itcs.2026.9","title":"On Closure Properties of Read-Once Oblivious Algebraic Branching Programs","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Université Savoie Mont Blanc; Bhabha Atomic Research Centre; Agence Nationale de la Recherche; Villum Fonden","keywords":"Symmetric polynomial; Polynomial; Branching (polymer chemistry); Difference polynomials; Algebraic number; Elementary symmetric polynomial; Exponential function; Sequence (biology); Lift (data mining)","score_opus":0.04169909323450253,"score_gpt":0.2504516048642412,"score_spread":0.20875251162973865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414699161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98391694,0.0019179893,0.008849841,0.00054922677,0.0012366149,0.00060294353,0.000007938586,0.0005946522,0.0023238496],"genre_scores_gemma":[0.99595433,0.000082462124,0.0022323935,0.0005034346,0.00012822659,0.00009549797,0.000012074752,0.000023415889,0.00096816174],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740994,0.00019987779,0.00055150135,0.00096889207,0.00043132392,0.00043848643],"domain_scores_gemma":[0.9974567,0.00012513812,0.00037616986,0.0018253267,0.00013497521,0.000081645194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000575164,0.00041718956,0.00057273306,0.00020520021,0.00013364715,0.00017925166,0.002371964,0.000299357,0.000010477339],"category_scores_gemma":[0.00014557513,0.00034407515,0.00025865147,0.00038766148,0.0001386366,0.00024002904,0.0020535048,0.0008105008,0.000042227242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020131552,0.002298423,0.19082531,0.00734344,0.0010429355,0.00020124397,0.023151219,0.002385656,0.014646468,0.2277925,0.002124245,0.52798724],"study_design_scores_gemma":[0.005765556,0.0031384854,0.20466633,0.08064628,0.00066029595,0.0001487586,0.0013784315,0.0777881,0.28376445,0.3194806,0.012140135,0.01042257],"about_ca_topic_score_codex":0.0001299025,"about_ca_topic_score_gemma":0.0000135145565,"teacher_disagreement_score":0.51756465,"about_ca_system_score_codex":0.00006545172,"about_ca_system_score_gemma":0.00025881693,"threshold_uncertainty_score":0.9999011},"labels":[],"label_agreement":null},{"id":"W4415311421","doi":"10.48550/arxiv.2506.14072","title":"A generalization of Deterministic Finite Automata related to discharging","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Killam Trusts","keywords":"Generalization; Deterministic finite automaton; Finite-state machine; Büchi automaton; Vertex (graph theory); State (computer science); Automaton; String (physics); Deterministic automaton; Path (computing)","score_opus":0.025927597049094264,"score_gpt":0.28203219298740223,"score_spread":0.256104595938308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415311421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6524965,0.00016009132,0.34302375,0.000650471,0.0013831327,0.0003516823,0.00004714407,0.00048594686,0.001401267],"genre_scores_gemma":[0.9870735,0.000038186576,0.011009291,0.00046278661,0.00004522091,0.000047462374,0.000059952985,0.000017408203,0.0012462235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806017,0.00012929837,0.00057670305,0.0007123324,0.00023828764,0.00028321688],"domain_scores_gemma":[0.9978162,0.00018836578,0.0002990378,0.0015031733,0.00009957445,0.00009364959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003647251,0.00027236436,0.00040053795,0.00030170742,0.00008884733,0.00009639656,0.001626794,0.0002045188,0.000022053955],"category_scores_gemma":[0.00023911272,0.00026822655,0.00013578637,0.0005150243,0.000038032922,0.00015804215,0.002612745,0.00027421658,0.000076595956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008707841,0.0010759417,0.2925796,0.004342501,0.0010218007,0.0004040094,0.025283283,0.13582912,0.02075077,0.37359563,0.005447735,0.13958254],"study_design_scores_gemma":[0.00048406253,0.00008771744,0.077637814,0.0017683514,0.00008230675,0.000009396569,0.000035384834,0.8971942,0.0056823073,0.0148321185,0.0013678989,0.000818428],"about_ca_topic_score_codex":0.00003606442,"about_ca_topic_score_gemma":0.0000032489281,"teacher_disagreement_score":0.7613651,"about_ca_system_score_codex":0.000052549432,"about_ca_system_score_gemma":0.00017487475,"threshold_uncertainty_score":0.999977},"labels":[],"label_agreement":null},{"id":"W4415651320","doi":"10.1215/00127094-2025-0017","title":"Reciprocity obstructions in semigroup orbits in SL(2,Z)","year":2025,"lang":"","type":"article","venue":"Duke Mathematical Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Semigroup; Conjecture; Reciprocity (cultural anthropology); Algebraic number; Finite set; Rational number; Congruence (geometry); Hausdorff dimension","score_opus":0.012829907226058982,"score_gpt":0.273142923055323,"score_spread":0.260313015829264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415651320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49144068,0.0018381445,0.46028793,0.00615929,0.0025549396,0.00060256093,0.00000849741,0.00011354223,0.036994442],"genre_scores_gemma":[0.9604572,0.00034660284,0.036079958,0.00079917995,0.0002738923,0.000031386247,0.0000011050009,0.000031231593,0.001979442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99488974,0.0005740015,0.0020370835,0.0006991243,0.00069865346,0.0011013832],"domain_scores_gemma":[0.99735767,0.0009665679,0.00037271497,0.0008172859,0.00015187265,0.00033389963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031204012,0.000474589,0.0009260027,0.0010675305,0.00034820198,0.00088991644,0.0017993345,0.00038054914,0.00066223496],"category_scores_gemma":[0.0011368797,0.00043305987,0.00030858684,0.0026960303,0.00026756807,0.0009913717,0.00071275537,0.0022226856,0.00023494885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047797028,0.0015019195,0.0021790918,0.0003939317,0.000072754585,0.00068774127,0.0038961647,0.0002389252,0.00060677517,0.9106901,0.0015277943,0.07815696],"study_design_scores_gemma":[0.0017033668,0.00009722029,0.008561162,0.0035451553,0.000035736644,0.0011961254,0.0007995628,0.15950063,0.000492622,0.82250494,0.0010620576,0.0005014172],"about_ca_topic_score_codex":0.00001645865,"about_ca_topic_score_gemma":0.00003822698,"teacher_disagreement_score":0.46901652,"about_ca_system_score_codex":0.0005922357,"about_ca_system_score_gemma":0.0005070254,"threshold_uncertainty_score":0.9998121},"labels":[],"label_agreement":null},{"id":"W4415937484","doi":"10.46298/dmtcs.15140","title":"On the conjugates of Christoffel words","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Christoffel symbols; Graph; Conjugate; Integer (computer science); Algebra over a field","score_opus":0.008876415764861333,"score_gpt":0.25009222166563855,"score_spread":0.2412158059007772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415937484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030146593,0.00004513294,0.9459367,0.00330235,0.0004043515,0.0002468923,0.0000029999626,0.00013512251,0.019779855],"genre_scores_gemma":[0.9158942,0.000004143025,0.08281284,0.0012103277,0.00002359107,0.000013100106,3.8969532e-7,0.0000071399722,0.000034270804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771965,0.00010983827,0.00045906467,0.0005326656,0.0007205773,0.00045821271],"domain_scores_gemma":[0.99599004,0.002021294,0.00015243905,0.0015835098,0.00014842548,0.00010429395],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023192533,0.00022979811,0.00032027045,0.00020732451,0.00040322013,0.0003904135,0.004261029,0.000052945565,0.00005790921],"category_scores_gemma":[0.0003987329,0.00013335221,0.00013207027,0.0014322025,0.0034872382,0.00025711433,0.0013274722,0.0002216184,0.000043310312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035628018,0.00008169874,0.000004739518,0.00003232333,0.000010871097,0.000002142694,0.00084635837,0.00003349622,0.0007335948,0.9947509,0.00024555455,0.003254749],"study_design_scores_gemma":[0.00008441791,0.00006478315,0.00004052231,0.00014866494,0.0000057533,0.0000034490802,0.000046572524,0.39726317,0.0077804686,0.5944326,0.000028760043,0.00010082201],"about_ca_topic_score_codex":0.0000014632002,"about_ca_topic_score_gemma":1.462177e-7,"teacher_disagreement_score":0.8857476,"about_ca_system_score_codex":0.000029700897,"about_ca_system_score_gemma":0.00013637832,"threshold_uncertainty_score":0.9992247},"labels":[],"label_agreement":null},{"id":"W4416007859","doi":"","title":"Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abelian group; Bounded function; Equivalence (formal languages); Substitution (logic); Fixed point; Type (biology); Function (biology)","score_opus":0.04945202475005005,"score_gpt":0.3168927961153011,"score_spread":0.267440771365251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416007859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6669067,0.00020081014,0.33122867,0.00028850298,0.0004422482,0.00033379896,0.000006933365,0.00009108531,0.0005012147],"genre_scores_gemma":[0.9837869,0.000008102857,0.015707888,0.00034478577,0.000031043943,0.000031039486,0.000010950091,0.0000045195143,0.00007477313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991101,0.00010034795,0.00021088189,0.00029861362,0.00010170865,0.0001783301],"domain_scores_gemma":[0.99914545,0.00026373146,0.00011687077,0.00024226523,0.00019845502,0.000033213466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002924326,0.00011778387,0.00022532139,0.00010058009,0.0001311216,0.00003127135,0.0004218691,0.000049985712,0.0000043741793],"category_scores_gemma":[0.00008870206,0.000104154984,0.00007200119,0.000500826,0.00017055184,0.0002180919,0.00010496582,0.000060981438,0.000014281261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012884906,0.00019340366,0.081235744,0.00020851527,0.00019865001,0.000005629267,0.0013481365,0.0008771106,0.039238498,0.85223716,0.0009866452,0.023341663],"study_design_scores_gemma":[0.0022482248,0.0004665034,0.5206148,0.00026638203,0.000057499612,0.000004224504,0.00015801933,0.12558515,0.14392512,0.20496707,0.0012621104,0.00044490452],"about_ca_topic_score_codex":0.00011436509,"about_ca_topic_score_gemma":0.000019766161,"teacher_disagreement_score":0.6472701,"about_ca_system_score_codex":0.0000443856,"about_ca_system_score_gemma":0.00008164164,"threshold_uncertainty_score":0.4247317},"labels":[],"label_agreement":null},{"id":"W4416348003","doi":"10.1051/ita/2025016","title":"A symmetry property of Christoffel words","year":2025,"lang":"","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Christoffel symbols; Property (philosophy); Cardinality (data modeling); Symmetry (geometry); Bivariate analysis","score_opus":0.005791708219538981,"score_gpt":0.240717505541032,"score_spread":0.23492579732149302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416348003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032060917,0.0010422468,0.91493136,0.0018137452,0.00013229491,0.00097460486,0.00005838646,0.000094693845,0.07774656],"genre_scores_gemma":[0.9711594,0.0006560186,0.025884574,0.0012327599,0.0000672362,0.00021343253,0.000012721756,0.000013889223,0.00075999514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975721,0.00007680596,0.0012721812,0.0003041427,0.0003241237,0.00045063221],"domain_scores_gemma":[0.9976162,0.00047222225,0.00033807536,0.0011620694,0.00019343007,0.00021801994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086816476,0.00032775526,0.00052707363,0.00025862388,0.0003652545,0.00028535057,0.0011014885,0.00023717254,0.00009031794],"category_scores_gemma":[0.00009458439,0.00023038527,0.00015972064,0.001230941,0.0020131934,0.00034586774,0.0009025046,0.00037315162,0.000050627947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010261304,0.00018816504,0.000028509869,0.0004707122,0.000051103234,2.1626201e-7,0.00086591736,0.000010618107,0.00006464644,0.7843234,0.0004955391,0.21349093],"study_design_scores_gemma":[0.0005455351,0.00009497914,0.00015669785,0.00036884093,0.00010492363,0.000011405536,0.0008054479,0.4743621,0.0008940894,0.49258992,0.02973343,0.00033260463],"about_ca_topic_score_codex":0.000007632729,"about_ca_topic_score_gemma":3.3701025e-7,"teacher_disagreement_score":0.96795326,"about_ca_system_score_codex":0.000040444378,"about_ca_system_score_gemma":0.00021263886,"threshold_uncertainty_score":0.9394839},"labels":[],"label_agreement":null},{"id":"W4416802214","doi":"10.37236/13609","title":"Word Length, Bias and Bijections in Penney's Ante","year":2025,"lang":"","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection, injection and surjection; Conjecture; Word (group theory); Simple (philosophy); Alphabet; Binary number","score_opus":0.010032848477251673,"score_gpt":0.24379329358904528,"score_spread":0.2337604451117936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416802214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7772019,0.098596245,0.10286359,0.014374331,0.004727907,0.00036651146,0.0000014561972,0.000040802664,0.0018272438],"genre_scores_gemma":[0.9808206,0.017733704,0.00002708394,0.00031397896,0.00009249063,0.000002622755,1.5279669e-7,0.000015343625,0.0009940274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964638,0.0007410593,0.0010363937,0.00030355147,0.00044936084,0.0010058638],"domain_scores_gemma":[0.99713147,0.0011709317,0.00069362705,0.00061357685,0.00028016162,0.000110262925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00504787,0.00031353632,0.0006166857,0.000701329,0.00040546214,0.00035466993,0.0017490136,0.00014952432,0.00001379274],"category_scores_gemma":[0.00040405904,0.00023432857,0.00021597928,0.0027455245,0.00022354926,0.00061927206,0.00042406208,0.0020729771,0.0000054598004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006211026,0.00030549683,0.0007073272,0.000029936878,0.00015586891,0.000030062654,0.0009739746,0.00007403279,0.000103551734,0.9652417,0.0006328545,0.03168312],"study_design_scores_gemma":[0.0018143102,0.00069589855,0.0038018995,0.00039601533,0.00012704656,0.00050709955,0.00053786824,0.014077524,0.00046696875,0.9684791,0.008839063,0.00025723068],"about_ca_topic_score_codex":0.000039606104,"about_ca_topic_score_gemma":0.000046283072,"teacher_disagreement_score":0.20361868,"about_ca_system_score_codex":0.00059240503,"about_ca_system_score_gemma":0.0016833298,"threshold_uncertainty_score":0.9555642},"labels":[],"label_agreement":null},{"id":"W4417182444","doi":"10.1017/s0963548325100242","title":"Sidorenko’s conjecture for subdivisions and theta substitutions","year":2025,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Bipartite graph; Conjecture; Line graph; Graph; Graph minor; Edge-transitive graph; Voltage graph; Homomorphism; 1-planar graph","score_opus":0.012298313793150262,"score_gpt":0.26165046518098756,"score_spread":0.24935215138783728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417182444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16714594,0.0006951703,0.82614154,0.0021470783,0.0011181951,0.00068824546,0.0000061109386,0.00045293197,0.001604779],"genre_scores_gemma":[0.9839961,0.0000069407547,0.015602698,0.00021586988,0.000024103405,0.000019628042,0.0000051441016,0.000006752919,0.00012277187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846554,0.00010116144,0.00032972323,0.0006075415,0.0001383799,0.00035767385],"domain_scores_gemma":[0.9978685,0.0010240265,0.00009309038,0.0007484806,0.00017746071,0.00008847983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009597792,0.00019245055,0.00026683565,0.00012007256,0.0006890335,0.00024489284,0.0007934242,0.00010676378,0.0000013323933],"category_scores_gemma":[0.00047189268,0.00017660714,0.000098991586,0.0006707973,0.00015734993,0.00020855917,0.0007221128,0.00020391628,0.000002093756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020209382,0.00010599558,0.002059389,0.000085607164,0.00001617457,8.640977e-7,0.00023175373,0.00011539697,0.000059573966,0.9853548,0.0002948374,0.011673628],"study_design_scores_gemma":[0.00048716576,0.00004720895,0.003936662,0.00005989702,0.000013407887,0.0000054438997,0.000019790594,0.11348839,0.00041755498,0.8785575,0.0027919116,0.00017505712],"about_ca_topic_score_codex":0.000009960227,"about_ca_topic_score_gemma":0.0000028938673,"teacher_disagreement_score":0.8168501,"about_ca_system_score_codex":0.000095041665,"about_ca_system_score_gemma":0.00015405109,"threshold_uncertainty_score":0.72018296},"labels":[],"label_agreement":null},{"id":"W4417293759","doi":"10.48550/arxiv.2512.10017","title":"Complexity of Linear Subsequences of $k$-Automatic Sequences","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Construct (python library); Sequence (biology); State (computer science); Base (topology); Time complexity; Automaton","score_opus":0.11134954949633394,"score_gpt":0.31482737259856325,"score_spread":0.2034778231022293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417293759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96454984,0.0024248401,0.025557924,0.00081270485,0.0023543343,0.0007860575,0.00023799481,0.0002402206,0.0030360636],"genre_scores_gemma":[0.9756309,0.0007393601,0.022688944,0.0002141509,0.0001605073,0.000041092266,0.00003552374,0.000022382721,0.00046714264],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928801,0.00081839354,0.0027160223,0.0016578961,0.001089528,0.00083808094],"domain_scores_gemma":[0.9924077,0.00097432773,0.002569716,0.0030615402,0.0007590959,0.00022765854],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002158308,0.00089562533,0.0021698861,0.000540053,0.00030152622,0.00009921875,0.0060066865,0.0005734238,0.0005103722],"category_scores_gemma":[0.00042711705,0.0008379237,0.0007939253,0.0015257166,0.0033568724,0.0005963624,0.003713225,0.0009493584,0.0000902741],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010333806,0.0020039235,0.6798458,0.017201535,0.0017993457,0.00013791434,0.015960678,0.004952175,0.02326457,0.21457438,0.00027994133,0.039876405],"study_design_scores_gemma":[0.0011032033,0.00071661075,0.3583374,0.010716578,0.0004218225,0.000047470818,0.0016223764,0.36537984,0.16052566,0.09868527,0.00039745728,0.0020462936],"about_ca_topic_score_codex":0.0015741257,"about_ca_topic_score_gemma":0.00007581452,"teacher_disagreement_score":0.36042765,"about_ca_system_score_codex":0.000120815406,"about_ca_system_score_gemma":0.0014863765,"threshold_uncertainty_score":0.9994072},"labels":[],"label_agreement":null},{"id":"W48869925","doi":"10.1007/978-3-642-31623-4_20","title":"State Complexity and Limited Nondeterminism","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; State (computer science); Theoretical computer science; Programming language","score_opus":0.029295499903910758,"score_gpt":0.24702390674879915,"score_spread":0.2177284068448884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48869925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009863743,0.0011615977,0.9935696,0.0004729998,0.0012506895,0.00027893952,0.000011100231,0.0002499956,0.0020186813],"genre_scores_gemma":[0.4688828,0.00022418862,0.525977,0.003717262,0.00059036585,0.000009718073,0.000009179513,0.000066642446,0.00052284496],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666005,0.000044756434,0.00045954343,0.001309612,0.00071331713,0.0008127043],"domain_scores_gemma":[0.9974593,0.0004661662,0.0002682934,0.0013955424,0.00011676576,0.0002939477],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097508397,0.0005475847,0.00055286154,0.0006172381,0.00026960246,0.00060088193,0.0025330733,0.0002358517,0.000028678349],"category_scores_gemma":[0.000038888404,0.00048723118,0.00009320904,0.00035344245,0.0013330077,0.0008411479,0.002201186,0.00068941904,0.000057279023],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034875661,0.000023320837,0.000063716405,0.000033146873,0.000008691619,0.000062266045,0.0010046624,0.00023801504,0.00016677003,0.045052566,0.000012936805,0.9533304],"study_design_scores_gemma":[0.00032825934,0.00015947036,0.0012842788,0.0002791037,0.000009467675,0.000244054,1.590089e-7,0.3391628,0.0011430143,0.65382254,0.0025920845,0.0009747752],"about_ca_topic_score_codex":0.000018439581,"about_ca_topic_score_gemma":0.000027743448,"teacher_disagreement_score":0.9523556,"about_ca_system_score_codex":0.00012850374,"about_ca_system_score_gemma":0.00020343093,"threshold_uncertainty_score":0.99975795},"labels":[],"label_agreement":null},{"id":"W49365848","doi":"10.46298/dmtcs.279","title":"Defect Effect of Bi-infinite Words in the Two-element Case","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Word (group theory); Element (criminal law); Sharpening; Set (abstract data type); Alphabet; Mathematics; Word problem (mathematics education); Maximal element; Closure (psychology); Discrete mathematics; Combinatorics; Pure mathematics; Algebra over a field; Arithmetic; Computer science; Artificial intelligence; Linguistics; Geometry","score_opus":0.010857745900750023,"score_gpt":0.2739245430268805,"score_spread":0.2630667971261305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49365848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3265932,0.000047194913,0.6695109,0.00052036584,0.00017163067,0.00036139524,0.0000020279185,0.000074305746,0.00271897],"genre_scores_gemma":[0.9212937,0.000006823807,0.07815937,0.0004542563,0.000042705848,0.000028269427,6.879804e-7,0.000011697544,0.0000025235877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965184,0.00044078074,0.0006335622,0.0006492148,0.0010378932,0.00072018034],"domain_scores_gemma":[0.9958286,0.0021410014,0.00019001884,0.0016051824,0.000079004196,0.00015616973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074385637,0.0003173102,0.00044130548,0.0003017716,0.00029297578,0.0004548375,0.003373149,0.000044556717,0.000042207314],"category_scores_gemma":[0.0002140936,0.00018403158,0.0002083201,0.0021853833,0.0017569456,0.00046919953,0.0010551104,0.00027671125,0.00003303973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008736429,0.00010031517,0.00014166877,0.00003930015,0.000008485756,0.0005229422,0.0033052145,0.00017877498,0.0002360572,0.9804767,0.000021834687,0.014959993],"study_design_scores_gemma":[0.00053809525,0.00046590972,0.00006647716,0.00012747604,0.000018499646,0.0017589307,0.000136494,0.82091516,0.0013871082,0.1742607,0.000065178836,0.00025994016],"about_ca_topic_score_codex":0.0000116367155,"about_ca_topic_score_gemma":0.0000036012261,"teacher_disagreement_score":0.8207364,"about_ca_system_score_codex":0.000040455187,"about_ca_system_score_gemma":0.000055135995,"threshold_uncertainty_score":0.750459},"labels":[],"label_agreement":null},{"id":"W5713621","doi":"10.1007/bfb0035863","title":"Darwin: Computer algebra and enumerative combinatorics","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumerative combinatorics; Darwin (ADL); Extremal combinatorics; Combinatorics; Algebra over a field; Mathematics; Algebraic combinatorics; Computer science; Pure mathematics","score_opus":0.008530677949465895,"score_gpt":0.21402830139210896,"score_spread":0.20549762344264305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5713621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002105439,0.0009852503,0.98989695,0.0006406813,0.0022347725,0.00035794466,0.000009194467,0.00028052705,0.005384104],"genre_scores_gemma":[0.4176876,0.0001394219,0.57345706,0.0055515035,0.0017488564,0.000021165491,0.00003218135,0.0001301834,0.0012320507],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957171,0.0000612469,0.00058400136,0.0019008323,0.0009650733,0.00077171193],"domain_scores_gemma":[0.9972145,0.0006438966,0.00031886052,0.0013842032,0.00021912622,0.000219437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008293702,0.0007298786,0.0007239291,0.0007183121,0.00038803773,0.0010356577,0.002813199,0.00039182475,0.000021889286],"category_scores_gemma":[0.000026610121,0.0006633835,0.00012683334,0.00059013464,0.0010248179,0.00083969266,0.0022248668,0.0009035126,0.000040156698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039340744,0.000058729216,0.00007498349,0.000050698105,0.000020854857,0.0002310974,0.00079325185,0.004242298,0.00005851315,0.3259346,0.00050856266,0.66802245],"study_design_scores_gemma":[0.00040276756,0.00023187703,0.00034208572,0.00027518306,0.000009657597,0.00014716585,1.4143357e-7,0.48954204,0.0005818965,0.50496525,0.0025980736,0.0009038649],"about_ca_topic_score_codex":0.000029415427,"about_ca_topic_score_gemma":0.0000133009125,"teacher_disagreement_score":0.6671186,"about_ca_system_score_codex":0.00022665344,"about_ca_system_score_gemma":0.0003174459,"threshold_uncertainty_score":0.99958175},"labels":[],"label_agreement":null},{"id":"W593488378","doi":"10.71781/27187","title":"Approches algorithmiques pour l’inférence d’histoires de duplication en tandem avec inversions et délétions pour des familles multigéniques","year":2009,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Geology; Philosophy","score_opus":0.04339017769682606,"score_gpt":0.32686682869411887,"score_spread":0.2834766509972928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W593488378","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.612355,0.0028235342,0.35645434,0.0031751813,0.00042813225,0.0016076796,0.00014355972,0.000095912896,0.02291668],"genre_scores_gemma":[0.25941172,0.0020628567,0.71378475,0.0004520295,0.00022138667,0.00020445467,0.0007704826,0.000057200094,0.02303513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644804,0.00068768486,0.0006935054,0.00115549,0.000375867,0.00063943234],"domain_scores_gemma":[0.99711007,0.0007239885,0.00059319165,0.0008201189,0.00045929977,0.00029331754],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012689689,0.0006177217,0.00057533593,0.00029086496,0.0009675676,0.0012859578,0.0027469778,0.0005608045,0.00034082023],"category_scores_gemma":[0.00046164583,0.00064181635,0.00022889453,0.0004997776,0.00024035676,0.00173063,0.00044627505,0.0005650329,0.00040953082],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028080562,0.0006429033,0.00077606965,0.000073922434,0.00009993613,0.000047176858,0.065686636,0.0002090624,0.02653582,0.015738787,0.002373835,0.88778776],"study_design_scores_gemma":[0.0018179837,0.0005680904,0.14342952,0.005187522,0.00048048704,0.00030376718,0.031618588,0.5004544,0.15865932,0.1024618,0.05149977,0.0035187493],"about_ca_topic_score_codex":0.0018715905,"about_ca_topic_score_gemma":0.0016191097,"teacher_disagreement_score":0.884269,"about_ca_system_score_codex":0.00044827184,"about_ca_system_score_gemma":0.0016227033,"threshold_uncertainty_score":0.9997508},"labels":[],"label_agreement":null},{"id":"W61028124","doi":"10.1007/978-3-642-31623-4_22","title":"State Complexity of Projection and Quotient on Unranked Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Quotient; Concatenation (mathematics); Tree (set theory); State (computer science); String (physics); Combinatorics; Computer science; Finite-state machine; Discrete mathematics; Automaton; Tree automaton; Mathematics; Theoretical computer science; Algorithm","score_opus":0.030803970627065858,"score_gpt":0.24875383992393624,"score_spread":0.21794986929687038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61028124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004628437,0.000457195,0.9919242,0.0002571511,0.0010069914,0.00035706276,0.000010063506,0.000116645824,0.0012422228],"genre_scores_gemma":[0.88399845,0.000081160004,0.11500911,0.000548306,0.00019636472,0.0000056662357,0.0000040700056,0.000025288824,0.00013158166],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974851,0.000047361813,0.00041530293,0.0009052582,0.0006927078,0.00045425564],"domain_scores_gemma":[0.9982534,0.0003007127,0.0003168134,0.0008855928,0.000118391756,0.00012506245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081011356,0.00037607888,0.0004586758,0.0006125565,0.00015113446,0.00017038839,0.0012876298,0.00014667798,0.000010784857],"category_scores_gemma":[0.000031306223,0.000311777,0.00007960139,0.00034239798,0.0011888611,0.00043645257,0.0007495184,0.0004151166,0.000009999523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015593301,0.00006647841,0.00011796035,0.000054732376,0.000011370513,0.000009269759,0.0015663079,0.0018400024,0.00042977778,0.101646766,0.0000080031805,0.89423376],"study_design_scores_gemma":[0.0005785287,0.0008109926,0.004996973,0.0007761019,0.000014244102,0.00007924625,6.530051e-7,0.37928116,0.00970524,0.6020176,0.0008011674,0.0009380762],"about_ca_topic_score_codex":0.000051955034,"about_ca_topic_score_gemma":0.000072037175,"teacher_disagreement_score":0.89329565,"about_ca_system_score_codex":0.0001285541,"about_ca_system_score_gemma":0.00014757321,"threshold_uncertainty_score":0.9999334},"labels":[],"label_agreement":null},{"id":"W6135152","doi":"10.1159/000407528","title":"Characterizing hardness in parameterized complexity","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Complexity class; Mathematical proof; Bounded function; Normalization (sociology); Theoretical computer science; Descriptive complexity theory; Computational complexity theory; Parametric statistics; Mathematics; Discrete mathematics; Completeness (order theory); Generality; Computer science; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.040739438232526695,"score_gpt":0.3152530219448646,"score_spread":0.2745135837123379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6135152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84718704,0.0001815914,0.08451693,0.00019567748,0.004427576,0.0005483702,0.000009487906,0.00079504424,0.06213829],"genre_scores_gemma":[0.8424108,0.00007822863,0.13226272,0.0024194173,0.0002839258,0.00010134005,0.001471333,0.0000967552,0.020875463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99833447,0.000066412926,0.0004277371,0.00052196573,0.00027271954,0.00037668023],"domain_scores_gemma":[0.99902487,0.00008310428,0.00018991213,0.000584344,0.000045047214,0.000072711795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055564666,0.00026136893,0.00041557092,0.00032718162,0.0000582317,0.00022440327,0.0010635341,0.00022895698,0.00013223584],"category_scores_gemma":[0.00002974396,0.0002444205,0.000103561084,0.00039796403,0.000023906152,0.00038153832,0.00008890793,0.00031119664,0.00010912003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023375057,0.0005298802,0.000498245,0.0006021982,0.00008744166,0.00042214355,0.00841257,0.0000020559232,0.056554258,0.51721597,0.0008675269,0.41457394],"study_design_scores_gemma":[0.004589218,0.0002948813,0.5727827,0.0022869855,0.000053603773,0.00009404381,0.003240009,0.11454628,0.12120038,0.15088366,0.0242332,0.005795059],"about_ca_topic_score_codex":0.00014983509,"about_ca_topic_score_gemma":0.00022268631,"teacher_disagreement_score":0.57228446,"about_ca_system_score_codex":0.000056146248,"about_ca_system_score_gemma":0.00006397753,"threshold_uncertainty_score":0.9967178},"labels":[],"label_agreement":null},{"id":"W644746544","doi":"","title":"Canadian sum set","year":2013,"lang":"en","type":"article","venue":"AeroSafety world./AeroSafety world","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Aeronautics; Engineering; Transport engineering; Operations research; Computer science","score_opus":0.010138403264871818,"score_gpt":0.21261695351951265,"score_spread":0.20247855025464084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W644746544","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069670916,0.003453032,0.08400827,0.32846367,0.016439851,0.0076368186,0.0004248245,0.009281293,0.48062134],"genre_scores_gemma":[0.9199422,0.000053478572,0.014441656,0.010093069,0.00046170384,0.00020792705,0.00008728302,0.00011170279,0.05460098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938634,0.00029256544,0.0011135107,0.0015449212,0.0008475707,0.002338012],"domain_scores_gemma":[0.99449974,0.00048931106,0.00032821432,0.002833425,0.00026732867,0.0015819754],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00097234873,0.00085635105,0.0007907385,0.0010650146,0.0009603047,0.00092156214,0.0037349921,0.00017297604,0.0027020506],"category_scores_gemma":[0.00007186593,0.00082537107,0.00041946166,0.003929169,0.00025054766,0.0023693796,0.00086194294,0.0008548996,0.005603896],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025946847,0.0001965003,0.013035212,0.000057532903,0.00018623762,0.00013367787,0.0010488145,0.00024540978,0.0018786927,0.62517995,0.31035942,0.047652636],"study_design_scores_gemma":[0.0027866354,0.00015979861,0.23238832,0.0003696002,0.00007456737,0.00014947221,0.00025223682,0.01400088,0.0049889926,0.046482842,0.694358,0.0039886744],"about_ca_topic_score_codex":0.07974914,"about_ca_topic_score_gemma":0.28804862,"teacher_disagreement_score":0.8502713,"about_ca_system_score_codex":0.000837709,"about_ca_system_score_gemma":0.00064836425,"threshold_uncertainty_score":0.9994197},"labels":[],"label_agreement":null},{"id":"W68106085","doi":"10.1007/978-3-319-09704-6_14","title":"Computation Width and Deviation Number","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Computation; Algorithm; Computer science; Measure (data warehouse); Tree (set theory); Mathematics; Discrete mathematics; Combinatorics; Data mining","score_opus":0.010084060871777527,"score_gpt":0.23601668796522018,"score_spread":0.22593262709344267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68106085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041537045,0.00016778296,0.9944955,0.0005119097,0.000971392,0.00021173574,0.0000016344925,0.00019345162,0.003031199],"genre_scores_gemma":[0.52114177,0.000036391633,0.47622508,0.0018994322,0.0004024556,0.0000050305903,0.00000883951,0.00003112868,0.0002498607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974077,0.000042414278,0.00038454073,0.0011323219,0.000631941,0.00040112814],"domain_scores_gemma":[0.99831605,0.00047835786,0.00026370175,0.0006673696,0.00014498572,0.00012954864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008880032,0.0003764782,0.0003834161,0.00035718855,0.00021315193,0.00058346917,0.0012599609,0.00023113866,0.000015065293],"category_scores_gemma":[0.00005446521,0.00034605805,0.00006251414,0.00031704077,0.00041644793,0.00048777155,0.00078872906,0.00039578063,0.000079705984],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001563011,0.000006900956,0.000119315795,0.00002664195,0.000004676307,0.0000123742975,0.00027175227,0.0053152135,0.00003727964,0.09576986,0.000023483093,0.8984109],"study_design_scores_gemma":[0.00016011242,0.000048962745,0.0004454188,0.00016842884,0.000004337568,0.00007244139,4.952072e-8,0.616956,0.00014213163,0.38092762,0.0007151049,0.00035938428],"about_ca_topic_score_codex":0.0000116840565,"about_ca_topic_score_gemma":0.000014961776,"teacher_disagreement_score":0.89805156,"about_ca_system_score_codex":0.00013113188,"about_ca_system_score_gemma":0.0001557321,"threshold_uncertainty_score":0.99989915},"labels":[],"label_agreement":null},{"id":"W6891618358","doi":"10.48550/arxiv.1405.5605","title":"Similarity density of the Thue-Morse word with overlap-free infinite binary words","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Complement (music); Word (group theory); Generalization; Similarity (geometry); Measure (data warehouse); Binary number","score_opus":0.03220823274732787,"score_gpt":0.16721629180853217,"score_spread":0.1350080590612043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891618358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8502631,0.000030111516,0.14666596,0.00018633869,0.0005226901,0.00027242562,0.000023249291,0.00020873577,0.0018273378],"genre_scores_gemma":[0.9974219,0.00004015958,0.0015605636,0.0002962,0.000064444925,6.8950015e-7,0.0000053284616,0.000021156495,0.00058955984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775714,0.00034036324,0.0002532221,0.0010289028,0.00022646812,0.00039393036],"domain_scores_gemma":[0.9947262,0.00026029482,0.0005314878,0.0041614645,0.00018636929,0.00013418794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005337473,0.00041099015,0.000530291,0.00019728819,0.00021838646,0.000093471805,0.005028938,0.00031843624,0.000018220311],"category_scores_gemma":[0.00007943814,0.00032487806,0.00030856498,0.0008690512,0.00042548386,0.0003341682,0.0073417774,0.0008562586,0.000017826891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039203925,0.0006356314,0.14956604,0.00054835895,0.00052683323,0.00066569645,0.0015069606,0.18176737,0.00028156795,0.6596895,0.0022622389,0.0021577603],"study_design_scores_gemma":[0.0020910716,0.00023884092,0.18538518,0.0009309768,0.00032127005,0.000033298686,0.0002441722,0.5341028,0.0013304132,0.27291986,0.0008704968,0.0015316084],"about_ca_topic_score_codex":0.00024964378,"about_ca_topic_score_gemma":0.00013813704,"teacher_disagreement_score":0.38676962,"about_ca_system_score_codex":0.00011758313,"about_ca_system_score_gemma":0.00026773574,"threshold_uncertainty_score":0.9999203},"labels":[],"label_agreement":null},{"id":"W6903307295","doi":"10.1051/ita/2016010/pdf","title":"Decision algorithms for Fibonacci-automatic Words, I: Basic results","year":2016,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Class (philosophy); Fibonacci number; Morphism; Word (group theory); Point (geometry); Decision tree","score_opus":0.016612907101449106,"score_gpt":0.25247097542458025,"score_spread":0.23585806832313114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903307295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19107004,0.00034012762,0.79427177,0.009574051,0.0022293054,0.0005406331,0.00003751087,0.0014391951,0.0004973858],"genre_scores_gemma":[0.4770565,0.000092127724,0.52221644,0.00013547837,0.00015083457,0.00008469798,0.0000030601984,0.00002633103,0.00023454467],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976694,0.000014334144,0.000737657,0.0007608298,0.00029769944,0.0005200971],"domain_scores_gemma":[0.99744576,0.0002366684,0.00035079053,0.0017333765,0.00014420824,0.00008920211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064893794,0.0002878223,0.00043445636,0.00070012646,0.00015776062,0.00005154021,0.0022327688,0.00035030168,0.000008877983],"category_scores_gemma":[0.0008369148,0.00020283271,0.00018269681,0.0008261596,0.00032898193,0.00072606583,0.00078021263,0.0001806244,0.00008350997],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018674036,0.000055676825,0.00008614888,0.000024911393,0.000029428573,0.000008559132,0.000031765292,0.0000072030725,0.007878453,0.13458951,0.0006070385,0.85666263],"study_design_scores_gemma":[0.0072714374,0.0007987653,0.003957711,0.0022614957,0.00005635791,0.00009098396,0.000032900272,0.02900943,0.1915376,0.39896205,0.36473364,0.0012876189],"about_ca_topic_score_codex":0.000008012314,"about_ca_topic_score_gemma":0.000007915725,"teacher_disagreement_score":0.855375,"about_ca_system_score_codex":0.00007660549,"about_ca_system_score_gemma":0.00012072946,"threshold_uncertainty_score":0.8271278},"labels":[],"label_agreement":null},{"id":"W6910534332","doi":"10.48550/arxiv.1308.4368","title":"Maximally Atomic Languages","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Regular language; Semigroup; Class (philosophy); Rank (graph theory); Transitive relation; Upper and lower bounds","score_opus":0.03786647705391654,"score_gpt":0.173637450744865,"score_spread":0.13577097369094845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910534332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70624405,0.0001524535,0.2822738,0.00012715023,0.00045794016,0.00020540846,0.000010522246,0.0006261067,0.009902605],"genre_scores_gemma":[0.9935435,0.00015248453,0.0028440135,0.00024189772,0.00008602583,0.0000010838108,0.000012079195,0.000019346291,0.0030995912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835426,0.00010645497,0.00015020728,0.00095240236,0.0000767344,0.0003599489],"domain_scores_gemma":[0.99801177,0.00008173786,0.00017971243,0.0014993696,0.00007729036,0.00015013258],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017993963,0.00029270418,0.00028726566,0.00022261795,0.00009569255,0.00021505264,0.002657235,0.0002538475,0.00015573879],"category_scores_gemma":[0.000015645617,0.00031388726,0.00019627999,0.00030853672,0.00008594618,0.00041264342,0.0028147139,0.00044323134,0.0009924558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069549687,0.000069211565,0.0011161542,0.00006788428,0.00008587415,0.0005406112,0.00026259778,0.005896523,0.00011380862,0.98661304,0.0021155507,0.0031118046],"study_design_scores_gemma":[0.000555147,0.00004681004,0.003719605,0.00014618471,0.000058561796,0.00002200376,0.00020272836,0.6542394,0.00040800823,0.3370519,0.0025442329,0.0010054036],"about_ca_topic_score_codex":0.0002884198,"about_ca_topic_score_gemma":0.000013128271,"teacher_disagreement_score":0.6495611,"about_ca_system_score_codex":0.00011925565,"about_ca_system_score_gemma":0.00012124482,"threshold_uncertainty_score":0.99993134},"labels":[],"label_agreement":null},{"id":"W6922026402","doi":"10.1051/ita/2018015/pdf","title":"Randomized generation of error control codes with automata and transducers","year":2019,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Block (permutation group theory); Code (set theory); Synchronization (alternating current); Automaton; Error detection and correction; Substitution (logic); Block code","score_opus":0.014277441038391934,"score_gpt":0.22923656828082614,"score_spread":0.2149591272424342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6922026402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84987706,0.0003339469,0.1463867,0.0017518371,0.0003094373,0.00055646803,0.000005502433,0.0003092051,0.00046982476],"genre_scores_gemma":[0.93603384,0.000055131637,0.063758746,0.00006247106,0.00002454918,0.00002501219,0.0000020761313,0.000009862469,0.000028317805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883455,0.000032913464,0.0003912795,0.00036521492,0.00018105458,0.00019501202],"domain_scores_gemma":[0.9988808,0.000046355086,0.00025793232,0.0006969927,0.00008225365,0.000035673354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004986248,0.0001753598,0.00064063387,0.00034761097,0.000046359582,0.000025102829,0.0006306727,0.00017132895,0.000006178567],"category_scores_gemma":[0.000054062697,0.00013225946,0.000079181664,0.0003463333,0.00057991024,0.00040997466,0.00010884519,0.00016059946,0.000005307066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022919767,0.00014547112,0.0022282894,0.00023865601,0.0004074206,0.000011484567,0.0003863955,0.0010667652,0.18976404,0.7451998,0.00003749596,0.058222227],"study_design_scores_gemma":[0.22196503,0.0008063133,0.0016331954,0.00059946196,0.00023873083,0.000093511095,0.00008509733,0.4143569,0.34550184,0.010035017,0.0037687714,0.0009161298],"about_ca_topic_score_codex":0.000025974556,"about_ca_topic_score_gemma":0.000009128242,"teacher_disagreement_score":0.73516476,"about_ca_system_score_codex":0.00001395427,"about_ca_system_score_gemma":0.00007630972,"threshold_uncertainty_score":0.53933847},"labels":[],"label_agreement":null},{"id":"W6929454940","doi":"10.48660/08060180","title":"Non-Gaussianities from modified initial states","year":2008,"lang":"en","type":"other","venue":"PIRSA","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"State (computer science); Work (physics); Set (abstract data type); Feature (linguistics); Product (mathematics)","score_opus":0.017544952221732565,"score_gpt":0.23696681339591022,"score_spread":0.21942186117417767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929454940","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026032503,0.0014735513,0.08774795,0.00014682193,0.0010221535,0.00016790323,0.00020351105,0.000981883,0.9079959],"genre_scores_gemma":[0.033885676,0.0017032011,0.021714283,0.0023663447,0.0034925083,0.0000771955,0.00044194903,0.0007073746,0.9356115],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988046,0.000035419238,0.00017906279,0.00043583484,0.00025930986,0.00028573367],"domain_scores_gemma":[0.99896854,0.00007688576,0.000142735,0.0007198092,0.000013791554,0.00007825767],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000051511357,0.00027471822,0.00032169433,0.00017009741,0.0000640562,0.00013723559,0.001061189,0.00019659639,0.0009766057],"category_scores_gemma":[0.0000061546407,0.0002434168,0.000090071,0.00010688835,0.000095727875,0.00012855169,0.00025703062,0.0001797675,0.00086737826],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033742397,0.000044621494,0.000008718813,0.000020166279,0.00007140363,0.00015178735,0.0013214053,0.0000062590675,0.00001728201,0.0090561975,0.97891206,0.0103867],"study_design_scores_gemma":[0.00054138666,0.000052704057,0.0001435788,0.00025706462,0.000018275226,0.000016171227,0.00007629952,0.011353619,0.00045246456,0.017573906,0.9687429,0.0007716499],"about_ca_topic_score_codex":0.001783507,"about_ca_topic_score_gemma":0.00006623677,"teacher_disagreement_score":0.06603366,"about_ca_system_score_codex":0.000022948912,"about_ca_system_score_gemma":0.00007151908,"threshold_uncertainty_score":0.99993664},"labels":[],"label_agreement":null},{"id":"W6930119680","doi":"10.5281/zenodo.11744478","title":"Nissan qashqai 2021 bedienungsanleitung deutsch pdf","year":2024,"lang":"de","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Population; Corporate governance; Investment (military); Sustainable development; Event (particle physics)","score_opus":0.02263068288089578,"score_gpt":0.2391320038926278,"score_spread":0.216501321011732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930119680","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000131104,0.004459364,0.018906977,0.0015552274,0.0021494355,0.0008173598,0.00043412295,0.0018794962,0.9696669],"genre_scores_gemma":[0.018178096,0.0020734451,0.0025078044,0.0007878173,0.0045836954,2.513815e-7,0.0038355838,0.018613454,0.94941986],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.994404,0.000838601,0.0006660491,0.0018659845,0.0010682568,0.0011570882],"domain_scores_gemma":[0.9965775,0.000057806006,0.0003384007,0.0019496463,0.00052005623,0.00055657176],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016402366,0.0006657627,0.0005661488,0.0008952442,0.002148378,0.0057834415,0.0051547443,0.0004103845,0.3662923],"category_scores_gemma":[0.00046758092,0.0006966199,0.00027611246,0.001708705,0.00047280928,0.000480248,0.0066863396,0.0012157564,0.74335015],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018066747,0.00016546817,4.0883444e-7,0.00032229384,0.00023996219,0.00024022663,0.0015070083,0.00000879882,0.00091516133,0.035696078,0.8387348,0.1221517],"study_design_scores_gemma":[0.0004065542,0.00027475037,0.000021880403,0.0006381177,0.00009992729,0.0002658597,0.0002316692,0.0029145558,0.00020393672,0.0020522634,0.992147,0.00074346067],"about_ca_topic_score_codex":0.000028058203,"about_ca_topic_score_gemma":6.728018e-7,"teacher_disagreement_score":0.37705788,"about_ca_system_score_codex":0.00030313706,"about_ca_system_score_gemma":0.000020740314,"threshold_uncertainty_score":0.9995485},"labels":[],"label_agreement":null},{"id":"W6930519633","doi":"10.5281/zenodo.15717730","title":"astropy/astropy-iers-data: v0.2025.6.23.0.39.50","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Process (computing); Identification (biology); Work (physics)","score_opus":0.03354579442460469,"score_gpt":0.25337827385756984,"score_spread":0.21983247943296513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930519633","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000056493195,0.0005116646,0.29601258,0.00079725473,0.00053282763,0.00042865283,0.00087573257,0.003339608,0.697496],"genre_scores_gemma":[0.0019033863,0.0005746747,0.021536428,0.0008229327,0.0012117694,1.5766207e-7,0.009305614,0.009481702,0.95516336],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964898,0.00049955415,0.00037049624,0.0012933253,0.00067028665,0.00067652017],"domain_scores_gemma":[0.9961888,0.000041366486,0.00027020785,0.0029748892,0.00027384429,0.00025086565],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0008231592,0.00039522443,0.00038319433,0.0006914675,0.0011523906,0.0018804308,0.008308711,0.00022790075,0.022870192],"category_scores_gemma":[0.00041793694,0.000409058,0.00010073551,0.00089877023,0.00021706485,0.00045997935,0.009314978,0.00059327605,0.018073907],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009810845,0.00007853934,3.3399076e-7,0.0000767212,0.00008640737,0.000028849274,0.00009142633,0.000005344786,0.00021131917,0.027887927,0.8781271,0.093396224],"study_design_scores_gemma":[0.00038237675,0.0001102631,0.000027367943,0.00017970294,0.00002469476,0.00004528866,0.000059134414,0.001810132,0.000041544325,0.00047533654,0.996481,0.00036317453],"about_ca_topic_score_codex":0.000056883364,"about_ca_topic_score_gemma":8.4395634e-7,"teacher_disagreement_score":0.27447617,"about_ca_system_score_codex":0.00014345309,"about_ca_system_score_gemma":0.000026976011,"threshold_uncertainty_score":0.99983615},"labels":[],"label_agreement":null},{"id":"W6932125911","doi":"10.5683/sp3/jihz4u","title":"Reference Mysteries, Part One","year":2004,"lang":"en","type":"dataset","venue":"Borealis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada; University of Alberta; University of New Brunswick","funders":"","keywords":"Desk; Reference data; Component (thermodynamics); Term (time); Reference desk","score_opus":0.034466271637968365,"score_gpt":0.24800944539779768,"score_spread":0.2135431737598293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6932125911","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.0573815e-7,0.00038291785,0.0018911193,0.0002966546,0.00033326013,0.00012951893,0.99555945,0.00022606167,0.0011801056],"genre_scores_gemma":[0.000004654663,0.00051701383,0.0016837049,0.00097315887,0.00028264662,0.000038238093,0.9963743,0.0000128220445,0.000113453454],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981751,0.00007331225,0.0003296651,0.00060520903,0.0004306191,0.0003860899],"domain_scores_gemma":[0.9972929,0.0000599335,0.00021219689,0.002236621,0.000059854432,0.00013854183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025770985,0.0002996904,0.00037366932,0.00011161726,0.00010269752,0.00029136735,0.0024250736,0.00028085872,0.00011631341],"category_scores_gemma":[0.000048210168,0.00027691302,0.00007631304,0.0001960465,0.00007806022,0.00028052836,0.00061175565,0.0003145075,0.00017734204],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002468819,0.000052021718,1.337313e-7,0.0000616552,0.00002064684,0.00005658945,0.00002306509,9.838118e-7,0.0000018093143,0.011047537,0.985708,0.0030251152],"study_design_scores_gemma":[0.00014389711,0.000059892034,0.000035066343,0.00021868446,0.000018482848,0.00002305144,0.0000035249634,0.000010956888,0.000036228525,0.0056730025,0.9934322,0.00034501558],"about_ca_topic_score_codex":0.017241552,"about_ca_topic_score_gemma":0.0029510069,"teacher_disagreement_score":0.014290546,"about_ca_system_score_codex":0.0000940167,"about_ca_system_score_gemma":0.00026020536,"threshold_uncertainty_score":0.9999683},"labels":[],"label_agreement":null},{"id":"W6948345171","doi":"10.48550/arxiv.math-ph/0509053","title":"Dynamique des nombres et physique des oscillateurs","year":2005,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Arithmetic function; Natural number; Spectrum (functional analysis); Natural (archaeology); Multiple","score_opus":0.06089217963575034,"score_gpt":0.1929795415762158,"score_spread":0.13208736194046547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948345171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53186756,0.00014778599,0.4618773,0.00009128256,0.00020244456,0.00014200354,0.000010759416,0.00046417688,0.005196733],"genre_scores_gemma":[0.9905448,0.0009211164,0.0064436463,0.00032632085,0.000077653174,0.0000012901984,0.000012362357,0.00002940539,0.0016433902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978469,0.0002718542,0.00019276697,0.001120704,0.00008703894,0.00048073116],"domain_scores_gemma":[0.998019,0.0001527446,0.00020472828,0.0012888493,0.00013807596,0.00019662471],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037645636,0.00040771608,0.00035877037,0.00024785317,0.00023318267,0.00024329785,0.00229948,0.0002900337,0.000026867341],"category_scores_gemma":[0.00003296229,0.00044686563,0.00026728777,0.0004879104,0.00039685273,0.0007829001,0.0024050851,0.0005735641,0.00011894738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023385046,0.00020319229,0.0028136119,0.00018460472,0.00014192339,0.00040890096,0.0012213656,0.27419353,0.00040207803,0.70386595,0.0003554836,0.01618602],"study_design_scores_gemma":[0.00041536283,0.00006818553,0.015350001,0.00029244088,0.00004763644,0.000023122035,0.00013818513,0.46343064,0.00071005337,0.5178064,0.00079709996,0.0009208271],"about_ca_topic_score_codex":0.00040907293,"about_ca_topic_score_gemma":0.00045027255,"teacher_disagreement_score":0.4586773,"about_ca_system_score_codex":0.0003147781,"about_ca_system_score_gemma":0.00020293392,"threshold_uncertainty_score":0.9997983},"labels":[],"label_agreement":null},{"id":"W6950569497","doi":"10.5683/sp3/85uio7","title":"Published or Perished: thoughts on the publication of mediocrity","year":2024,"lang":"en","type":"dataset","venue":"Borealis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Discoverability; Mediocrity principle; Publishing; Foundation (evidence); Government (linguistics); Position (finance)","score_opus":0.02170709880225972,"score_gpt":0.2700045867916483,"score_spread":0.24829748798938858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6950569497","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031069749,0.00018634931,0.00030202494,0.011346784,0.0007633886,0.00025892037,0.98552346,0.00017238563,0.0014435645],"genre_scores_gemma":[0.000047486796,0.00014264164,0.00028473735,0.001589137,0.0007594464,0.000092152964,0.996834,0.000016026766,0.00023438064],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782896,0.0001966872,0.0004214306,0.00060018443,0.0006893438,0.00026340762],"domain_scores_gemma":[0.9961625,0.0004888564,0.00026561963,0.0028035322,0.0001928514,0.00008665257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011534329,0.00026929396,0.0003279545,0.00023291374,0.00010112731,0.00087246485,0.0035651776,0.00023022623,0.00018033182],"category_scores_gemma":[0.0009318316,0.00014007435,0.00014645344,0.00069438404,0.00011380282,0.00047258934,0.0006094793,0.00046402958,0.00015139011],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070246656,0.00005764376,2.6886997e-7,0.00008626808,0.000035563884,0.0000140596685,0.000085441,1.8495446e-7,0.0000012260745,0.018217273,0.9796833,0.0018117419],"study_design_scores_gemma":[0.00005988962,0.00006684895,0.000052477975,0.000112602014,0.000028676088,0.000013059453,0.00002170135,0.0003752081,0.00013463003,0.0077093947,0.99125063,0.00017487118],"about_ca_topic_score_codex":0.0022775284,"about_ca_topic_score_gemma":0.0010347842,"teacher_disagreement_score":0.011567336,"about_ca_system_score_codex":0.000050376246,"about_ca_system_score_gemma":0.00024833684,"threshold_uncertainty_score":0.84131986},"labels":[],"label_agreement":null},{"id":"W6958675902","doi":"10.71352/ac.58.170125","title":"New families of normal numbers constructed from existing ones","year":2025,"lang":"en","type":"article","venue":"Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio computatorica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nucleofection; Gestational period; Dysgeusia; TSG101; Liquation; Diafiltration; Emperipolesis; Fusible alloy; Hyporeflexia","score_opus":0.006754939549440321,"score_gpt":0.21971335200467756,"score_spread":0.21295841245523725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958675902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35511974,0.00046367777,0.63433623,0.0006050982,0.0012030392,0.00015587742,0.000047642858,0.00032586762,0.007742805],"genre_scores_gemma":[0.83434594,0.000028389048,0.16488595,0.00015289162,0.000071636256,0.0000011401155,0.000028378628,0.000013587223,0.00047210246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751055,0.00021109419,0.0004922784,0.00077612186,0.0004214139,0.0005885561],"domain_scores_gemma":[0.997328,0.001050561,0.00036345486,0.0006302909,0.00037970542,0.0002479833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003621759,0.0003416771,0.0005192156,0.00078185287,0.00048791853,0.00024277669,0.0013215141,0.00013018664,0.000057571],"category_scores_gemma":[0.00018008146,0.00037435975,0.00019674365,0.0024715788,0.00025859018,0.00081873295,0.0007102873,0.0002501878,0.000019337223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006472601,0.0006350863,0.24945322,0.000407664,0.0017830208,0.00077989564,0.014241885,0.016924147,0.01710999,0.18962277,0.13834566,0.37004942],"study_design_scores_gemma":[0.010778058,0.00062828546,0.30266616,0.0012548139,0.0007133558,0.00042218305,0.008885691,0.5523001,0.02538787,0.055170003,0.038881883,0.0029115945],"about_ca_topic_score_codex":0.0024745427,"about_ca_topic_score_gemma":0.00015531518,"teacher_disagreement_score":0.53537595,"about_ca_system_score_codex":0.00016662024,"about_ca_system_score_gemma":0.00068915443,"threshold_uncertainty_score":0.99987084},"labels":[],"label_agreement":null},{"id":"W6959215644","doi":"10.7282/t38k7dgb","title":"Better Complexity Bounds for Cost Register Automata","year":2018,"lang":"en","type":"article","venue":"View","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Semiring; Automaton; Class (philosophy); Set (abstract data type); Polynomial; State (computer science); Time complexity; Finite-state machine","score_opus":0.07476690809554878,"score_gpt":0.31480131052407545,"score_spread":0.24003440242852667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6959215644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073002335,0.00043146062,0.96969086,0.009539342,0.0011858036,0.0005619512,0.000025446716,0.0006222087,0.01064272],"genre_scores_gemma":[0.54753244,0.00006741028,0.3893309,0.05630446,0.0020805942,0.0002864256,0.000050188657,0.00007136571,0.0042762323],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990468,0.000040699517,0.0001773304,0.00032064796,0.00013450386,0.00028000594],"domain_scores_gemma":[0.998876,0.00007422107,0.000069540874,0.0008444154,0.00006773716,0.000068127585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038998804,0.00011397618,0.00016703407,0.000037630525,0.00018385696,0.00021194924,0.000881366,0.00004035954,0.00009036008],"category_scores_gemma":[0.00002398131,0.00009355434,0.000075072676,0.00016135706,0.00017538914,0.00031692616,0.00024337911,0.000048952406,0.00040561752],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000768298,0.00007050556,0.00010345153,0.00009250325,0.000021959784,0.000004759016,0.0003493151,9.146253e-8,0.00033470718,0.41542974,0.14743887,0.43614644],"study_design_scores_gemma":[0.00033794143,0.000103409526,0.0014728915,0.00006166779,0.0000061707574,0.000018895607,0.0000035589062,0.01982117,0.00069692155,0.06438704,0.912911,0.00017933665],"about_ca_topic_score_codex":0.0000111080535,"about_ca_topic_score_gemma":0.000012775901,"teacher_disagreement_score":0.7654721,"about_ca_system_score_codex":0.000024184304,"about_ca_system_score_gemma":0.000027166125,"threshold_uncertainty_score":0.52135277},"labels":[],"label_agreement":null},{"id":"W6966730854","doi":"10.48550/arxiv.2309.02765","title":"A General Approach to Proving Properties of Fibonacci Representations via Automata Theory","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Fibonacci number; Automaton; Representation (politics); Mathematical proof; Automata theory","score_opus":0.10933613675663038,"score_gpt":0.20021450915030511,"score_spread":0.09087837239367473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966730854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35385808,0.00002896032,0.6427645,0.00008230634,0.0003146808,0.000494699,0.000016389484,0.00063374906,0.0018066493],"genre_scores_gemma":[0.9854777,0.000020870035,0.009974924,0.000066920205,0.000070986884,0.000009950631,0.000017668865,0.000032565524,0.0043284367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997688,0.0002884952,0.0003031826,0.0012049424,0.00015357396,0.0003617808],"domain_scores_gemma":[0.9974195,0.000099729645,0.00025893407,0.0019259647,0.00014789902,0.00014799446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061766745,0.0002966266,0.00038089338,0.0004357891,0.00015407275,0.00012377238,0.0026115002,0.00018186244,0.00000621455],"category_scores_gemma":[0.00008896857,0.00029894843,0.00021503528,0.0008616701,0.00011752828,0.00038508952,0.0042658504,0.0003223415,0.00006867539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046105215,0.00027528967,0.0007611546,0.00041598655,0.00018495393,0.000063857864,0.002727276,0.31060532,0.0026930235,0.6802312,0.00053492107,0.0014609285],"study_design_scores_gemma":[0.0002487409,0.0000359146,0.0018093637,0.00017274973,0.00005149742,0.000005664197,0.00036447166,0.9037855,0.0015023487,0.09154502,0.000043587777,0.0004351157],"about_ca_topic_score_codex":0.00033827763,"about_ca_topic_score_gemma":0.000010779832,"teacher_disagreement_score":0.63278955,"about_ca_system_score_codex":0.00010689101,"about_ca_system_score_gemma":0.0002063968,"threshold_uncertainty_score":0.99994624},"labels":[],"label_agreement":null},{"id":"W6967093038","doi":"10.48550/arxiv.2406.16410","title":"Perfectly Clustering Words and Iterated Palindromes over a Ternary Alphabet","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Palindrome; Alphabet; Iterated function; Ternary operation; Cluster analysis; Characterization (materials science); Word (group theory)","score_opus":0.03537752939519934,"score_gpt":0.18425379905808842,"score_spread":0.14887626966288908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967093038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90375966,0.0007087457,0.09213895,0.000111589834,0.0009826578,0.00019471145,0.000025309986,0.00058224757,0.0014961418],"genre_scores_gemma":[0.9966753,0.0002116403,0.0007971121,0.00017654011,0.00009947855,0.0000011721089,0.000011608771,0.000029351728,0.0019977733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997995,0.00011624528,0.00018828618,0.001250143,0.00009115402,0.00035917328],"domain_scores_gemma":[0.99866104,0.0001002436,0.00011720498,0.0009216588,0.000036964488,0.00016290294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024929506,0.00037485204,0.00034867483,0.00033724954,0.00011352553,0.0004945343,0.0011799105,0.00025890494,0.00004944242],"category_scores_gemma":[0.0000101968535,0.00039280413,0.00016072055,0.0004723418,0.00009802213,0.0003241971,0.0057944516,0.00065545336,0.000075402895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037245773,0.00079212664,0.03559749,0.0051913084,0.003085008,0.037905738,0.019741997,0.13202357,0.0032729823,0.6995693,0.0055921567,0.056855865],"study_design_scores_gemma":[0.0003308308,0.00005136177,0.0019178033,0.0004491384,0.00006756442,0.00004985229,0.00006530309,0.9323323,0.00007564643,0.06377993,0.00036171518,0.000518563],"about_ca_topic_score_codex":0.00011334907,"about_ca_topic_score_gemma":0.000019678446,"teacher_disagreement_score":0.8003087,"about_ca_system_score_codex":0.000109818255,"about_ca_system_score_gemma":0.00009237331,"threshold_uncertainty_score":0.99985236},"labels":[],"label_agreement":null},{"id":"W6967846720","doi":"10.5281/zenodo.10822743","title":"IOT FUNDAMENTALS AND COMPREHENSIVE INTRODUCTION","year":2024,"lang":"en","type":"book","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Internet of Things; Key (lock); Automation; Focus (optics)","score_opus":0.026488963487036363,"score_gpt":0.23348331822156,"score_spread":0.20699435473452363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967846720","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069679035,0.0044614356,0.024319721,0.0061567123,0.0018738097,0.0012502595,0.0005082103,0.005914256,0.9548188],"genre_scores_gemma":[0.008483692,0.0014978199,0.0043096063,0.0015220711,0.004793984,1.7071207e-7,0.006304067,0.0067333123,0.96635526],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981362,0.00018021927,0.0002476763,0.00077700836,0.0003689993,0.00028985282],"domain_scores_gemma":[0.99875176,0.000031659227,0.00011319082,0.00068274833,0.00027732688,0.00014329562],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003857083,0.00023199226,0.00022515688,0.00033239834,0.0010672883,0.0021296565,0.0012963905,0.0001234631,0.003061132],"category_scores_gemma":[0.000066255554,0.00023832357,0.000062325744,0.0002634663,0.00020491381,0.00023671307,0.003190514,0.00045746064,0.011280666],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060621423,0.000019330624,1.2754287e-8,0.0001422501,0.00005234715,0.00002346638,0.0004964044,0.0000044222215,0.00067830796,0.122442804,0.7318625,0.1442721],"study_design_scores_gemma":[0.00014324182,0.00014393937,0.000009092515,0.00008539165,0.000018204077,0.00034827954,0.000054969736,0.00094455044,0.00010418552,0.012396039,0.9855157,0.0002363758],"about_ca_topic_score_codex":0.000002250175,"about_ca_topic_score_gemma":3.9934747e-8,"teacher_disagreement_score":0.25365323,"about_ca_system_score_codex":0.00024075303,"about_ca_system_score_gemma":0.000008413138,"threshold_uncertainty_score":0.99890625},"labels":[],"label_agreement":null},{"id":"W6968884023","doi":"10.5281/zenodo.8099770","title":"Proof of a Conjecture of Krawchuk and Rampersad on the Cyclic Complexity of the Thue-Morse Sequence","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Sequence (biology); Class (philosophy); Counterexample; Constant (computer programming)","score_opus":0.07561945392711303,"score_gpt":0.2598799954518017,"score_spread":0.18426054152468865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968884023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9764511,0.00006680356,0.0036745516,0.0055326098,0.000095277814,0.0007110763,0.0002003791,0.00035182384,0.012916355],"genre_scores_gemma":[0.99954414,0.000016646958,0.000118797325,0.000093443945,0.000012158995,2.903971e-8,0.000017721033,0.00010663637,0.00009043636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987796,0.00035056533,0.00019190228,0.00020573843,0.0003168972,0.00015530435],"domain_scores_gemma":[0.99888796,0.00009802839,0.0001623703,0.000636565,0.00017718176,0.00003790738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007858596,0.00007851168,0.00013406941,0.0000855726,0.00046945008,0.000089794376,0.0015455792,0.000029015639,0.00031985267],"category_scores_gemma":[0.0004452144,0.000048698,0.00004471518,0.0008231926,0.0006436171,0.000098920005,0.0013906372,0.00014083803,0.00007573521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000618283,0.0001697864,0.00003476696,0.00026864055,0.00006956473,0.0000056410545,0.009237587,0.00026835076,0.09637604,0.8175811,0.01869569,0.05723096],"study_design_scores_gemma":[0.002963066,0.0028974207,0.047157012,0.0011775307,0.000074923664,0.0003330575,0.0042765294,0.09627712,0.48407355,0.11261321,0.2471621,0.0009944835],"about_ca_topic_score_codex":0.00001591099,"about_ca_topic_score_gemma":3.2588548e-7,"teacher_disagreement_score":0.7049679,"about_ca_system_score_codex":0.00001665987,"about_ca_system_score_gemma":0.000005220741,"threshold_uncertainty_score":0.3610678},"labels":[],"label_agreement":null},{"id":"W6979243950","doi":"","title":"Words with factor complexity $2n+1$ and minimal critical exponent","year":2025,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Exponent; Morphism; Word (group theory); Factor (programming language); Zero (linguistics); Critical exponent; Point (geometry)","score_opus":0.0628256291133757,"score_gpt":0.19627006834454125,"score_spread":0.13344443923116556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979243950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60775864,0.000033467037,0.38962188,0.00033456282,0.000083523366,0.000054250086,0.00000461738,0.00012071534,0.0019883453],"genre_scores_gemma":[0.9962583,0.000009893662,0.0027877076,0.00024905053,0.000012571026,2.6514445e-7,8.1780485e-7,0.000003861259,0.0006775328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991118,0.00006139042,0.00007874975,0.00046059638,0.000051306128,0.00023616677],"domain_scores_gemma":[0.9992408,0.00018764267,0.000025548488,0.00039298512,0.0000443121,0.00010867314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007897277,0.00012654133,0.00014420324,0.00010843194,0.000158997,0.00008535881,0.00048595524,0.00004736555,0.00003861946],"category_scores_gemma":[0.000021921896,0.00011737577,0.00003619793,0.00042124308,0.00028673172,0.00038941487,0.0003375339,0.000109480956,0.000015211036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003790658,0.00006729877,0.0063258717,0.000018642098,0.000020837417,0.00013571269,0.00015218434,0.000044966968,0.0001298655,0.9918385,0.00014201216,0.0010861978],"study_design_scores_gemma":[0.0031385873,0.0005784429,0.2104033,0.00026779826,0.00010201124,0.0000489078,0.0012147232,0.49423343,0.0024006902,0.28214818,0.004273355,0.0011905928],"about_ca_topic_score_codex":0.00003702418,"about_ca_topic_score_gemma":0.000018260776,"teacher_disagreement_score":0.70969033,"about_ca_system_score_codex":0.000040928684,"about_ca_system_score_gemma":0.00004806281,"threshold_uncertainty_score":0.4786445},"labels":[],"label_agreement":null},{"id":"W6980074172","doi":"","title":"Aspects of endomorphism monoids of certain algebras","year":2023,"lang":"en","type":"dissertation","venue":"White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Endomorphism; Monoid; Semigroup; Ideal (ethics); Free monoid; Bicyclic semigroup; Isomorphism (crystallography); Algebra over a field","score_opus":0.016108120118876544,"score_gpt":0.2044737606117129,"score_spread":0.18836564049283636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980074172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97300047,0.0005623389,0.013033339,0.0013408797,0.00048438174,0.0006971115,0.00076583074,0.00020588623,0.009909793],"genre_scores_gemma":[0.9761403,0.0015797539,0.007804473,0.000016302669,0.000031443557,1.40529215e-8,0.00033632622,0.000034742017,0.014056647],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9972006,0.00037244326,0.00041549472,0.0006990392,0.00087861024,0.00043380045],"domain_scores_gemma":[0.9949122,0.00090892694,0.0018920536,0.001371921,0.000742328,0.00017254167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006433425,0.00046562,0.0014049952,0.0010161282,0.00042015905,0.00001020756,0.004746891,0.00071183656,0.000388443],"category_scores_gemma":[0.00008019197,0.00058353826,0.00091973325,0.0014024484,0.0012275091,0.0005206101,0.001034307,0.0007287687,0.000014845871],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0095857,0.0069099814,0.0046705506,0.010002956,0.008777713,0.0013955663,0.55993026,0.0094082225,0.0532557,0.1941501,0.017292319,0.12462092],"study_design_scores_gemma":[0.010456498,0.0027741392,0.05304747,0.0055128755,0.0033013348,0.000030673542,0.8713113,0.019160675,0.009421156,0.011259048,0.01096362,0.0027612275],"about_ca_topic_score_codex":0.011933096,"about_ca_topic_score_gemma":0.007532785,"teacher_disagreement_score":0.311381,"about_ca_system_score_codex":0.00011529345,"about_ca_system_score_gemma":0.00055956806,"threshold_uncertainty_score":0.9996616},"labels":[],"label_agreement":null},{"id":"W7006278250","doi":"","title":"There are Ternary Circular Square-Free Words of Length n for n ≥ 18","year":2018,"lang":"en","type":"article","venue":"WinnSpace (University of Winnipeg)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Ternary operation; Word (group theory); Integer (computer science)","score_opus":0.016225733882351604,"score_gpt":0.21164643216202794,"score_spread":0.19542069827967634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7006278250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.470704,0.00039688285,0.51953125,0.0049009137,0.00036238052,0.0003331975,0.000070494796,0.00020576814,0.0034951405],"genre_scores_gemma":[0.9666909,0.000018401683,0.031252343,0.00010034005,0.000115728326,4.029876e-7,0.0000036439546,0.000014376226,0.0018038386],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99887085,0.00006426961,0.00012460578,0.0003786312,0.0002806844,0.0002809845],"domain_scores_gemma":[0.9981549,0.00010186691,0.0002893699,0.0011497526,0.00021670596,0.000087454144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003166601,0.00015614842,0.00031046444,0.00016539442,0.00018914603,0.000020408293,0.001971042,0.000108028726,0.000117086594],"category_scores_gemma":[0.000039176794,0.00017780719,0.00019751056,0.00040863213,0.00034972286,0.00055251404,0.0005446759,0.00008847492,0.00002083059],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012493898,0.0024669056,0.070979096,0.002653646,0.0017791761,0.00052344234,0.075012125,0.0002981002,0.07304241,0.29696995,0.3172195,0.15780626],"study_design_scores_gemma":[0.018511806,0.005421544,0.33745813,0.002528083,0.0005446196,0.00013570131,0.06413097,0.1753402,0.03139712,0.11646043,0.24417114,0.0039002306],"about_ca_topic_score_codex":0.0002358573,"about_ca_topic_score_gemma":0.00008260851,"teacher_disagreement_score":0.49598694,"about_ca_system_score_codex":0.000037112968,"about_ca_system_score_gemma":0.000067280525,"threshold_uncertainty_score":0.7250767},"labels":[],"label_agreement":null},{"id":"W7007562860","doi":"","title":"Adolescence and identity in Inuit territory: filmed introspections","year":2021,"lang":"fr","type":"article","venue":"Publication Database IASS (Institute for Advanced Sustainability Studies (IASS))","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Identity (music); Population; Colonisation; Poison control; Portrait","score_opus":0.0304305812654177,"score_gpt":0.3470000003685839,"score_spread":0.3165694191031662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7007562860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08904898,0.041887697,0.66950864,0.18061137,0.0078676315,0.0049471157,0.0053187306,0.0006644195,0.0001453971],"genre_scores_gemma":[0.8602395,0.010290727,0.11077227,0.0030734516,0.0012539827,0.0041402495,0.0020041144,0.000114235874,0.00811148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99453884,0.00044209303,0.0011840701,0.002070561,0.00057668105,0.0011877508],"domain_scores_gemma":[0.9922212,0.00076963543,0.00044990858,0.0022773573,0.003917885,0.00036405312],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024241523,0.0005899175,0.0008441314,0.0003898607,0.0010245113,0.0007921291,0.0010612684,0.00019776967,0.000036113233],"category_scores_gemma":[0.018324057,0.000682241,0.0002087279,0.0024684293,0.0014397519,0.012887377,0.0022250107,0.00060579524,0.000011170367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012724889,0.0017898227,0.008025518,0.004951529,0.00025461148,0.00010904861,0.00924448,0.0010085639,0.00046532927,0.80097777,0.011030257,0.1620158],"study_design_scores_gemma":[0.005912229,0.00030536114,0.0694825,0.001336945,0.0002530909,0.00018282616,0.03336888,0.03877392,0.0016586399,0.20024763,0.6460954,0.002382571],"about_ca_topic_score_codex":0.0005775027,"about_ca_topic_score_gemma":0.021011109,"teacher_disagreement_score":0.7711905,"about_ca_system_score_codex":0.0032412705,"about_ca_system_score_gemma":0.0016577009,"threshold_uncertainty_score":0.99956286},"labels":[],"label_agreement":null},{"id":"W7018230187","doi":"","title":"Computation Widths for Alternating Finite Automata","year":2025,"lang":"en","type":"dissertation","venue":"QSpace (Queen's University Library)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Finite-state machine; Decidability; Automaton; Generalization; Set (abstract data type); Parallelism (grammar); Integer (computer science); Computation; Exponential function","score_opus":0.007969632091149615,"score_gpt":0.21204069502908976,"score_spread":0.20407106293794014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018230187","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028860074,0.0001153117,0.8545697,0.037626885,0.0047068703,0.0020618257,0.00039638652,0.004939958,0.066723],"genre_scores_gemma":[0.09380965,0.00030683607,0.21827097,0.00089299533,0.00033138663,0.000013202662,0.0053797266,0.00012562651,0.6808696],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814147,0.00012315752,0.0002374849,0.0008000178,0.00029925525,0.00039859646],"domain_scores_gemma":[0.9981351,0.00065081264,0.00039157216,0.00059915066,0.00009764484,0.00012570406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000089471265,0.00038170695,0.0004059853,0.000623016,0.00038381582,0.00038266063,0.0017518372,0.00030286,0.000031670144],"category_scores_gemma":[0.000057147,0.00045890512,0.00025290766,0.0007064633,0.000025713878,0.0022932203,0.0003832501,0.0003074876,0.0000294627],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034886974,0.00031560028,0.00044130397,0.001790541,0.0004779825,0.0002813837,0.0034248005,0.0032477872,0.000029695104,0.36397314,0.53700674,0.08866213],"study_design_scores_gemma":[0.006475812,0.0007912043,0.008115805,0.0041799587,0.00054771436,0.0000020079813,0.0047570015,0.29528904,0.011906407,0.07850755,0.5844993,0.004928177],"about_ca_topic_score_codex":0.00055429136,"about_ca_topic_score_gemma":0.000020622554,"teacher_disagreement_score":0.6362987,"about_ca_system_score_codex":0.00009110788,"about_ca_system_score_gemma":0.00041825097,"threshold_uncertainty_score":0.99978626},"labels":[],"label_agreement":null},{"id":"W7022341136","doi":"","title":"","year":2024,"lang":"es","type":"other","venue":"Directory of Open access Books (OAPEN Foundation)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; McGill University","keywords":"Center (category theory); Unit (ring theory); Socialism; Research center; History of science","score_opus":0.08062522829405998,"score_gpt":0.40759108183262066,"score_spread":0.32696585353856067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022341136","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068243286,0.002594031,0.0138935875,0.0018691054,0.0098744,0.006222193,0.00003501261,0.0012087007,0.95747864],"genre_scores_gemma":[0.1388513,0.001540623,0.008616169,0.0023996935,0.0015886892,0.0011985415,0.0005064151,0.001840396,0.8434582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98698604,0.0012767205,0.0032262984,0.004662785,0.0022661334,0.0015820371],"domain_scores_gemma":[0.98852354,0.0010092368,0.003754486,0.005317199,0.0007167459,0.0006787648],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"category_scores_codex":[0.0038034436,0.0022560763,0.0034086104,0.0024193707,0.0007015437,0.046829123,0.04190634,0.0005306201,0.028808847],"category_scores_gemma":[0.0003998092,0.0022248523,0.0009580826,0.0023480777,0.0013647856,0.020188421,0.029731102,0.0012969777,0.015135609],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015337426,0.0005405709,0.0015650628,0.0019002368,0.001441119,0.00017245386,0.001000968,0.000030274312,0.001126425,0.5274681,0.013284547,0.4513169],"study_design_scores_gemma":[0.0016530185,0.00021303871,0.013417995,0.00717124,0.00046954895,0.000053188658,0.00014317204,0.0030236826,0.003921243,0.060217083,0.9067309,0.0029859133],"about_ca_topic_score_codex":0.0065025897,"about_ca_topic_score_gemma":0.00080983754,"teacher_disagreement_score":0.8934463,"about_ca_system_score_codex":0.0005321414,"about_ca_system_score_gemma":0.0019329668,"threshold_uncertainty_score":0.99901783},"labels":[],"label_agreement":null},{"id":"W7023854535","doi":"","title":"The physiographical basis of human geography in Quebec","year":2016,"lang":"en","type":"other","venue":"OpenBU (Boston University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Basis (linear algebra); Field (mathematics); Human geography; Work (physics)","score_opus":0.005272788216648633,"score_gpt":0.20318014255734423,"score_spread":0.1979073543406956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023854535","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012882992,0.00029103647,0.0018188057,0.000417654,0.00027101152,0.00031490388,0.000026615347,0.0001780975,0.9953936],"genre_scores_gemma":[0.014901512,0.00058997644,0.00047883805,0.00007282045,0.000071227,0.0000014530523,0.000007440504,0.000098253615,0.9837785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879885,0.00015509599,0.00014294474,0.0004035351,0.00022535077,0.0002742111],"domain_scores_gemma":[0.9986988,0.00011008449,0.00021490881,0.00088223716,0.000027260194,0.00006670988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001714201,0.00020269543,0.00028929466,0.0010410136,0.00012686844,0.00006231312,0.0023501473,0.00017779434,0.00031300465],"category_scores_gemma":[0.0000044128583,0.00014553084,0.00021697558,0.00095280475,0.00032564442,0.00019708226,0.00058045133,0.00016236398,0.000047157348],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021667383,0.00015925517,0.0015766632,0.000043517368,0.0001638156,0.00012367229,0.00016037752,4.4024137e-7,0.0007394784,0.8108968,0.14135754,0.044756733],"study_design_scores_gemma":[0.00055801024,0.000048109578,0.0022738748,0.00030216717,0.000017473134,8.432e-7,0.00009377721,0.000015968277,0.00024329801,0.0013407124,0.9947934,0.00031233157],"about_ca_topic_score_codex":0.011653964,"about_ca_topic_score_gemma":0.014924598,"teacher_disagreement_score":0.8534359,"about_ca_system_score_codex":0.000037197115,"about_ca_system_score_gemma":0.000058536036,"threshold_uncertainty_score":0.9949275},"labels":[],"label_agreement":null},{"id":"W7025205473","doi":"","title":"Trois-Rivières – Rivière du Petit-Carbet","year":2022,"lang":"fr","type":"other","venue":"Industrias Culturais (Universidade de Coimbra)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"West indies; Medium term; Context (archaeology); Field (mathematics)","score_opus":0.021747198421171503,"score_gpt":0.22196300152248002,"score_spread":0.20021580310130851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025205473","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018521978,0.0025269794,0.0060521513,0.06190248,0.004945151,0.0016040022,0.0010521727,0.0015828701,0.9018122],"genre_scores_gemma":[0.042589612,0.00026416918,0.002322106,0.0019534046,0.0025852032,0.00006648505,0.00047945062,0.00040201686,0.94933754],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99354935,0.0011258466,0.0006235883,0.001874772,0.0011758929,0.0016505662],"domain_scores_gemma":[0.9957647,0.00059526006,0.0008732786,0.0018113112,0.00020324229,0.00075226405],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity","insufficient_payload"],"category_scores_codex":[0.0008043486,0.0012456217,0.0011971366,0.00079346966,0.0011095919,0.0009678722,0.004834505,0.0014901274,0.10473839],"category_scores_gemma":[0.00039156736,0.0013173319,0.00077857217,0.00220887,0.0006209566,0.0012025471,0.002320331,0.0026107223,0.0019211876],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060545433,0.00042382427,0.0023148605,0.000108479166,0.0007153108,0.0026532754,0.005768942,0.00051383034,0.0009509628,0.27221322,0.68185985,0.03241692],"study_design_scores_gemma":[0.002202107,0.00034110394,0.029821265,0.00035579465,0.00030101088,0.0006121775,0.004308645,0.006091439,0.00020582587,0.00071431894,0.9532978,0.0017485328],"about_ca_topic_score_codex":0.0042540864,"about_ca_topic_score_gemma":0.00087667006,"teacher_disagreement_score":0.2714989,"about_ca_system_score_codex":0.0015620462,"about_ca_system_score_gemma":0.00076381164,"threshold_uncertainty_score":0.99980617},"labels":[],"label_agreement":null},{"id":"W7097080367","doi":"","title":"On Sparse Languages Such That LL= \\\\Sigma*","year":2007,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cardinality (data modeling); Notation; Generalization; Fraction (chemistry); Set (abstract data type); Constant (computer programming); Regular language","score_opus":0.015787304185732133,"score_gpt":0.26086181464364183,"score_spread":0.2450745104579097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097080367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17509533,0.000115470255,0.6863573,0.0005006893,0.00028752213,0.00006669342,6.653021e-7,0.0004898002,0.13708651],"genre_scores_gemma":[0.98537093,0.00000411812,0.008807983,0.0023078641,0.00006265858,0.0000011878549,0.0000010291102,0.0000059228496,0.003438299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991956,0.000018721701,0.00009044118,0.00023497861,0.00020012002,0.00026016636],"domain_scores_gemma":[0.99918973,0.0002090394,0.0000284207,0.00048637443,0.000012246482,0.00007415886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046766034,0.000091690425,0.00008300331,0.00007588193,0.000054294618,0.00008433706,0.00055574055,0.000040302155,0.00019020587],"category_scores_gemma":[0.00001559475,0.00006796107,0.00004124435,0.00015368668,0.000021563561,0.00019345793,0.000114621114,0.00007405999,0.00037167352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047462054,0.000054225282,0.00048460698,0.000002973761,0.000005725066,0.00009292016,0.00032788535,0.000006886635,0.0008337888,0.898336,0.0058073616,0.09404291],"study_design_scores_gemma":[0.002185634,0.00071550364,0.085821606,0.00015041583,0.000017744404,0.00022169035,0.0024671769,0.034713436,0.5869345,0.24675962,0.038045235,0.0019674383],"about_ca_topic_score_codex":0.000040677,"about_ca_topic_score_gemma":0.000019831587,"teacher_disagreement_score":0.8102756,"about_ca_system_score_codex":0.000016369695,"about_ca_system_score_gemma":0.000009735293,"threshold_uncertainty_score":0.47772354},"labels":[],"label_agreement":null},{"id":"W7099777956","doi":"","title":"Council of Canada.","year":2012,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.02242976058912066,"score_gpt":0.18304500531874285,"score_spread":0.1606152447296222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099777956","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15825163,0.0008730572,0.3427864,0.0013216876,0.0013882037,0.00007238105,0.0000027637775,0.00017297412,0.4951309],"genre_scores_gemma":[0.9916019,5.728674e-7,0.005620009,0.00044282197,0.000021272797,4.8020746e-7,5.878957e-8,0.0000010142036,0.0023119007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957865,0.0000067149003,0.000051618077,0.000038946902,0.00020561166,0.00011845761],"domain_scores_gemma":[0.9996994,0.000028053359,0.000016062262,0.00017551136,0.000037621103,0.000043335618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023477363,0.000024288978,0.000038126007,0.0000045546685,0.000013868684,0.0000047966996,0.00022181495,0.000007379353,0.000062435094],"category_scores_gemma":[0.000016601733,0.000018189465,0.000007825699,0.000058790003,0.0000063948596,0.00014071917,0.00005111957,0.000013254631,0.0000056574186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.0345726e-7,0.000020490295,0.0013709039,0.00000423356,0.000004191586,6.8000287e-7,0.00043971895,0.00000269613,0.00089044013,0.9354965,0.05458531,0.007184543],"study_design_scores_gemma":[0.00048511926,0.000037847378,0.064685844,0.000021621205,0.0000062333856,0.000045951638,0.00029471214,0.03077948,0.105559364,0.015315953,0.78223974,0.0005281551],"about_ca_topic_score_codex":0.07422389,"about_ca_topic_score_gemma":0.038257375,"teacher_disagreement_score":0.92018056,"about_ca_system_score_codex":0.00007896174,"about_ca_system_score_gemma":0.0006842733,"threshold_uncertainty_score":0.9792919},"labels":[],"label_agreement":null},{"id":"W7110165342","doi":"10.4230/lipics.cpm.2025.11","title":"On Palindromic Periodicities","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Palindrome; Prefix; Palindromic sequence; Word (group theory); Sequence (biology)","score_opus":0.006257707685843562,"score_gpt":0.24302485724839054,"score_spread":0.236767149562547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110165342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43481895,0.00014788756,0.5121239,0.0016744689,0.0033922824,0.0012946676,0.00030890314,0.0009516899,0.04528724],"genre_scores_gemma":[0.9780565,0.000028282719,0.012413135,0.0073365234,0.00008545975,0.00013141679,0.00012185436,0.000026568223,0.0018002555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780685,0.000037170386,0.00081978703,0.0003045557,0.0003639156,0.0006677285],"domain_scores_gemma":[0.99814624,0.00028667942,0.0002336419,0.0010808815,0.00012980457,0.00012273167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005124252,0.0003651966,0.00041444894,0.000403493,0.00044453787,0.0006865135,0.0016900296,0.00018774715,0.000040150047],"category_scores_gemma":[0.000097474636,0.00031591815,0.00025633269,0.00038230568,0.00014065015,0.0011027959,0.00048561374,0.00033983015,0.0002688144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080912534,0.0002552715,0.00070129713,0.00041258446,0.00015824253,0.000007920125,0.006808063,0.00014644407,0.00007056018,0.93819296,0.022354495,0.030811267],"study_design_scores_gemma":[0.010825915,0.0011961642,0.0035197693,0.0016088602,0.000107406675,0.00012814258,0.005030828,0.45847443,0.008773914,0.17859697,0.32932562,0.0024119806],"about_ca_topic_score_codex":0.000010192543,"about_ca_topic_score_gemma":0.0000040628506,"teacher_disagreement_score":0.759596,"about_ca_system_score_codex":0.00012351437,"about_ca_system_score_gemma":0.00011754963,"threshold_uncertainty_score":0.9999293},"labels":[],"label_agreement":null},{"id":"W7116681940","doi":"10.1016/j.tcs.2025.115721","title":"A self-generating sequence","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Sequence (biology); Mathematical proof; Connection (principal bundle); Term (time); Property (philosophy)","score_opus":0.00951093124382479,"score_gpt":0.2583813853861232,"score_spread":0.24887045414229841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116681940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019612312,0.000064746666,0.9656688,0.0014137828,0.0008532926,0.00012745798,6.0259276e-7,0.00076630723,0.011492681],"genre_scores_gemma":[0.6122317,0.0000031147626,0.38593432,0.0017467852,0.00005596699,0.0000058370965,2.0107599e-7,0.000003052593,0.00001904844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977217,0.00011110477,0.00027294605,0.00080160145,0.0004878207,0.0006048842],"domain_scores_gemma":[0.99828804,0.00027637114,0.000050589257,0.0010587174,0.00015522153,0.0001710547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001686532,0.00018156553,0.00018729904,0.00024122557,0.0006242628,0.00078676565,0.0035879125,0.00004903725,0.000017582632],"category_scores_gemma":[0.00008933603,0.00014917461,0.000062273575,0.0020614478,0.0014077413,0.00078025943,0.0016846159,0.0001889204,0.0000743776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010614167,0.000033901015,0.000018741417,0.000007891021,0.000003692013,0.000010719935,0.00020362364,0.00005264525,0.002795747,0.92519593,0.000058948768,0.07161712],"study_design_scores_gemma":[0.00010372454,0.0000410115,0.00008182111,0.00003115145,0.000002752472,0.000020420954,0.0000035911996,0.7350049,0.008476452,0.25574937,0.00033887505,0.00014589395],"about_ca_topic_score_codex":0.0000021856702,"about_ca_topic_score_gemma":2.3098482e-7,"teacher_disagreement_score":0.7349523,"about_ca_system_score_codex":0.000089391215,"about_ca_system_score_gemma":0.00028513238,"threshold_uncertainty_score":0.7586799},"labels":[],"label_agreement":null},{"id":"W7133057181","doi":"","title":"Canonical equivalence relations","year":2002,"lang":"","type":"dissertation","venue":"TSpace","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Equivalence relation; Equivalence (formal languages); Quotient algebra; Property (philosophy); Type (biology); Logical equivalence; Relation (database); Congruence relation","score_opus":0.03317110921045126,"score_gpt":0.3327673224710263,"score_spread":0.29959621326057506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133057181","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3017126,0.020535665,0.18970388,0.007909481,0.014196945,0.0019880175,0.000043318567,0.0017247823,0.46218532],"genre_scores_gemma":[0.6514724,0.0007652831,0.007719272,0.0003237434,0.00041848945,0.000058515077,0.00011013599,0.00007860661,0.33905354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958419,0.00026660922,0.0007312311,0.001346458,0.0008957532,0.0009180183],"domain_scores_gemma":[0.9965345,0.0005179734,0.0005696308,0.0017516562,0.00024750357,0.00037872817],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00051998167,0.0006525529,0.0006063929,0.0002715475,0.00066980015,0.0005125637,0.002212356,0.0006581774,0.0059500146],"category_scores_gemma":[0.00025852805,0.0006985386,0.0003554241,0.0010686093,0.00017067572,0.00060547696,0.0003143269,0.0010535194,0.005233011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087142,0.0011112186,0.00047216535,0.0005969362,0.00035159945,0.00045321175,0.15539385,0.00091340364,0.006122393,0.59230196,0.05257121,0.18962489],"study_design_scores_gemma":[0.0023279972,0.0009654972,0.017228339,0.0035834382,0.00061596575,0.00030378284,0.013513817,0.81763554,0.005271321,0.030711832,0.10186207,0.0059803883],"about_ca_topic_score_codex":0.0003715591,"about_ca_topic_score_gemma":0.000092025555,"teacher_disagreement_score":0.81672215,"about_ca_system_score_codex":0.00021921222,"about_ca_system_score_gemma":0.00051700603,"threshold_uncertainty_score":0.9995466},"labels":[],"label_agreement":null},{"id":"W72689024","doi":"10.1007/978-1-4614-1695-1_26","title":"Decidable Containment Problems of Rational Word Relations","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Decidability; Containment (computer programming); Relation (database); Word (group theory); Rational number; Mathematics; Prefix; Closure (psychology); Arity; Constant (computer programming); Commutative property; Combinatorics; Discrete mathematics; Computer science; Linguistics; Programming language; Law; Philosophy","score_opus":0.008888405961319621,"score_gpt":0.18622989849271201,"score_spread":0.1773414925313924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72689024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035876954,0.0019463786,0.9869381,0.00010574298,0.00014598657,0.00025414713,0.00000269393,0.00012335229,0.010447694],"genre_scores_gemma":[0.86002713,0.00022458505,0.13289566,0.00025695263,0.0002955862,0.000097203665,0.00004335786,0.00013234495,0.0060271583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998673,0.000010295057,0.00041193908,0.00034729711,0.00027172721,0.00028574324],"domain_scores_gemma":[0.9989306,0.00047664967,0.00012904173,0.00035329242,0.00004908625,0.00006137445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017328939,0.00025899385,0.00034680162,0.00032874342,0.000028500222,0.000027007382,0.00047346402,0.00030130794,0.000100713114],"category_scores_gemma":[0.00013627202,0.00024760628,0.0001060489,0.00020750277,0.00001940184,0.00011460539,0.000095844895,0.00057685334,0.000016097534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005271737,0.000030634892,0.00001812084,0.000035908895,0.000045461704,0.000012626936,0.00015847753,0.07250068,0.0008064635,0.88862985,0.00003389472,0.037722576],"study_design_scores_gemma":[0.0004374216,0.00018466864,0.00022832362,0.00046729905,0.000027939315,0.00003185281,1.0283357e-7,0.40713483,0.0035692279,0.57375884,0.013443433,0.0007160913],"about_ca_topic_score_codex":0.000011846694,"about_ca_topic_score_gemma":0.000008283332,"teacher_disagreement_score":0.85999125,"about_ca_system_score_codex":0.00017712703,"about_ca_system_score_gemma":0.00008820398,"threshold_uncertainty_score":0.9999976},"labels":[],"label_agreement":null},{"id":"W75575088","doi":"","title":"Minimum Degree and the Number of Chords.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics","score_opus":0.01162912980185739,"score_gpt":0.2325658678797465,"score_spread":0.2209367380778891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75575088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9693236,0.00045015456,0.0009647165,0.0003645156,0.0011012597,0.00011435516,5.92711e-7,0.000055937104,0.027624888],"genre_scores_gemma":[0.9983588,0.000025581076,0.0012523691,0.00016847391,0.0000024289775,0.000006210048,1.7049719e-7,0.0000051037628,0.00018085024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992974,0.0001278259,0.00014552874,0.0001394084,0.00014515089,0.00014467986],"domain_scores_gemma":[0.9991318,0.00026480964,0.00006837441,0.00045808492,0.000036595855,0.0000403336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053666433,0.00008175295,0.00014422706,0.00001768338,0.00006996625,0.00004603301,0.0004435343,0.000035221332,0.000020649222],"category_scores_gemma":[0.00009290498,0.000054047665,0.0000412706,0.00018644138,0.00014967631,0.00014412083,0.000116290015,0.00007226994,0.000022415228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037158877,0.000024963429,0.001811509,0.0000043240743,0.00000969465,0.0000015214027,0.0003916985,1.3278476e-7,0.00005289798,0.9948161,0.0005738559,0.0023095896],"study_design_scores_gemma":[0.0013377225,0.000014928738,0.003043743,0.000009954994,0.000005753556,0.00002625741,0.00005901302,0.0006164982,0.0016218643,0.99135494,0.0018240844,0.000085246895],"about_ca_topic_score_codex":0.000015284671,"about_ca_topic_score_gemma":4.0551367e-7,"teacher_disagreement_score":0.029035231,"about_ca_system_score_codex":0.0000065524596,"about_ca_system_score_gemma":0.000024133951,"threshold_uncertainty_score":0.22039998},"labels":[],"label_agreement":null},{"id":"W76241432","doi":"10.1007/978-3-642-39310-5_21","title":"Comparisons between Measures of Nondeterminism on Finite Automata","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; TRACE (psycholinguistics); Tree (set theory); Nondeterministic finite automaton; Computation; Automaton; Exponential function; Computer science; Function (biology); Finite-state machine; Deterministic finite automaton; Discrete mathematics; Tree automaton; Mathematics; Algorithm; Combinatorics; Automata theory; Theoretical computer science","score_opus":0.04331961617756693,"score_gpt":0.26054602926907344,"score_spread":0.2172264130915065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76241432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034952353,0.00017803482,0.9883645,0.00048213298,0.0011321629,0.00040613208,0.000024310017,0.00026582042,0.0087973755],"genre_scores_gemma":[0.7243351,0.00003180809,0.2734774,0.0011153079,0.0004701966,0.000013362124,0.0000110144765,0.0000566681,0.0004891657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541795,0.000069837886,0.0008449736,0.0015035573,0.0014446652,0.00071898644],"domain_scores_gemma":[0.9948463,0.0016615862,0.0005867859,0.0024550336,0.00022700586,0.0002232878],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010558809,0.0006630245,0.0009895861,0.0010468115,0.00020460752,0.00040955568,0.0055082017,0.00040423352,0.00003945038],"category_scores_gemma":[0.0001267763,0.00057037966,0.00021958843,0.00052224105,0.0009413055,0.00054558937,0.0015943185,0.00087095285,0.00018875844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043529876,0.00005750911,0.00015378183,0.00005482936,0.000029609833,0.00003904708,0.0005377289,0.006130452,0.00015059595,0.04031809,0.0002701544,0.9522539],"study_design_scores_gemma":[0.0007028363,0.0008412137,0.0021010395,0.0014986485,0.000030801995,0.000037590882,3.602589e-7,0.7249614,0.007820567,0.25376254,0.0066754916,0.0015675484],"about_ca_topic_score_codex":0.000031103737,"about_ca_topic_score_gemma":0.000010276314,"teacher_disagreement_score":0.9506863,"about_ca_system_score_codex":0.00014428493,"about_ca_system_score_gemma":0.0004042191,"threshold_uncertainty_score":0.99987245},"labels":[],"label_agreement":null},{"id":"W779556307","doi":"10.1007/978-3-319-19225-3_18","title":"Quasi-Distances and Weighted Finite Automata","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Automaton; Finite-state machine; Algorithm; Theoretical computer science","score_opus":0.01961018906781621,"score_gpt":0.24542673802829337,"score_spread":0.22581654896047715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W779556307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000121062854,0.0027847318,0.9889734,0.0008112069,0.0014546099,0.00024310908,0.000012798126,0.00039005483,0.0052090324],"genre_scores_gemma":[0.2284358,0.00036452356,0.765708,0.0027756512,0.0009573552,0.000017901672,0.00002060568,0.00009270794,0.001627423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619985,0.000046830017,0.00048071038,0.0015973513,0.0010332871,0.0006419628],"domain_scores_gemma":[0.9970131,0.0006701625,0.0002801284,0.0015511657,0.00020798897,0.00027746632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012849558,0.0005575539,0.00058860827,0.00063852634,0.00023525897,0.00078594073,0.0032451292,0.00029952038,0.00002139668],"category_scores_gemma":[0.000096736076,0.000473096,0.00008099952,0.0005384469,0.00096574257,0.0008700589,0.0017599727,0.00060070574,0.000056322115],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006230475,0.000044561264,0.000026875681,0.000043631724,0.000011800054,0.00013958348,0.000755127,0.00077399676,0.000023908256,0.13846608,0.00015627212,0.8595519],"study_design_scores_gemma":[0.0002460951,0.00018593713,0.000035007924,0.00026289356,0.0000053236095,0.000067396715,1.9401497e-7,0.5373775,0.000110163004,0.45415244,0.0070383023,0.00051878963],"about_ca_topic_score_codex":0.000018392595,"about_ca_topic_score_gemma":0.000041711137,"teacher_disagreement_score":0.85903317,"about_ca_system_score_codex":0.00017634171,"about_ca_system_score_gemma":0.000477127,"threshold_uncertainty_score":0.9997721},"labels":[],"label_agreement":null},{"id":"W785014139","doi":"","title":"Exactness of Proximal Groupoid Homomorphisms","year":2015,"lang":"tr","type":"article","venue":"DergiPark (Istanbul University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Homomorphism; Mathematics; Humanities; Combinatorics; Philosophy","score_opus":0.029678235323987362,"score_gpt":0.20481526789448384,"score_spread":0.17513703257049648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W785014139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7243287,0.0012980662,0.120915934,0.0011423985,0.0024191008,0.0007624682,0.00018955214,0.00056721363,0.14837655],"genre_scores_gemma":[0.984478,0.00007559379,0.005898968,0.00010847229,0.0001329296,8.466199e-7,0.000016158361,0.000035205147,0.009253807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969585,0.0002832054,0.00044156986,0.0008587941,0.0007387568,0.0007191931],"domain_scores_gemma":[0.997179,0.00017498437,0.0004810446,0.0010745605,0.00052944745,0.0005609738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070608355,0.00043744358,0.0006370521,0.00058677286,0.00021326203,0.00017323425,0.0024135464,0.00025943754,0.00011606585],"category_scores_gemma":[0.00007774202,0.0005003889,0.0002511142,0.0019153747,0.0005536821,0.0013212699,0.0010543278,0.0003396883,0.0001547426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004039532,0.00073495874,0.0010503943,0.00017298025,0.00019160678,0.0014489775,0.0044707255,0.00020506243,0.00070186355,0.9772668,0.010556423,0.0027962846],"study_design_scores_gemma":[0.012472151,0.002453568,0.0062236246,0.0007287434,0.0006343694,0.00046473366,0.019898865,0.04485869,0.012625234,0.036298472,0.8596388,0.0037027593],"about_ca_topic_score_codex":0.00017463154,"about_ca_topic_score_gemma":0.000023051793,"teacher_disagreement_score":0.9409683,"about_ca_system_score_codex":0.00034609853,"about_ca_system_score_gemma":0.00057209085,"threshold_uncertainty_score":0.9997448},"labels":[],"label_agreement":null},{"id":"W796701085","doi":"10.1007/s00236-015-0245-y","title":"State complexity of deletion and bipolar deletion","year":2015,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Deterministic finite automaton; Theory of computation; Combinatorics; State (computer science); Regular language; Matching (statistics); Mathematics; Finite-state machine; Nondeterministic finite automaton; Discrete mathematics; Computational complexity theory; Time complexity; DFA minimization; Automaton; Automata theory; Algorithm; Computer science; Theoretical computer science","score_opus":0.03540657342730158,"score_gpt":0.23946816796394238,"score_spread":0.2040615945366408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W796701085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7561382,0.00010730695,0.24040966,0.00061059813,0.000109857705,0.0001272677,0.0000068188265,0.00012258785,0.0023677216],"genre_scores_gemma":[0.974381,0.00002190353,0.025332788,0.00023481662,0.000007795197,0.0000023038651,0.000005838792,0.000002433434,0.0000111197905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993509,0.000028047256,0.00024058275,0.00006754003,0.00018510273,0.00012781726],"domain_scores_gemma":[0.9994232,0.00003813763,0.00011998429,0.0002559233,0.00007677392,0.00008598984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042165926,0.00006758806,0.00011305282,0.000066246415,0.000037478083,0.0000607808,0.0002616176,0.00002602402,0.0000052192354],"category_scores_gemma":[0.000053867574,0.000056881847,0.000017711545,0.00013283263,0.00009207311,0.0010508421,0.00016541209,0.000054163735,0.000026242631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004970587,0.00014580434,0.0019229033,0.00030564016,0.000060156515,0.0000042903334,0.023347992,0.00008632259,0.002498644,0.5699022,0.007910532,0.39376587],"study_design_scores_gemma":[0.0011415915,0.0003898352,0.012047145,0.00008013201,0.000012656114,0.00008348327,0.0005015793,0.7887721,0.0076217344,0.14705458,0.041905515,0.00038966179],"about_ca_topic_score_codex":0.00002733623,"about_ca_topic_score_gemma":0.000002316469,"teacher_disagreement_score":0.78868574,"about_ca_system_score_codex":0.000016128026,"about_ca_system_score_gemma":0.000031864573,"threshold_uncertainty_score":0.23195745},"labels":[],"label_agreement":null},{"id":"W801472226","doi":"10.1007/978-3-319-19225-3_4","title":"Nondeterministic Tree Width of Regular Languages","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Prince Edward Island","funders":"","keywords":"Computer science; Nondeterministic algorithm; Programming language; Tree (set theory); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.01794984032262465,"score_gpt":0.2570241980910572,"score_spread":0.23907435776843255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W801472226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017093412,0.0012782663,0.98697,0.00021903,0.00090007304,0.00020650784,0.000009171401,0.00015173128,0.010094269],"genre_scores_gemma":[0.43615985,0.000040324583,0.56048936,0.0008706791,0.0006311951,0.000007796533,0.000010325745,0.0000657235,0.0017247241],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996771,0.00003931763,0.0005214267,0.0011148981,0.0010506063,0.00050274975],"domain_scores_gemma":[0.996994,0.00039434983,0.00037001845,0.0018277111,0.00023831073,0.00017560506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010939599,0.0004439603,0.00062813755,0.0006508353,0.00008685748,0.00020707007,0.0038927326,0.00026316935,0.000023561897],"category_scores_gemma":[0.00012756338,0.00038287003,0.00013509078,0.0004520147,0.00084087776,0.000394702,0.0013378244,0.0004314812,0.000034786863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004998005,0.0000278255,0.000014299244,0.000055004053,0.000010864402,0.00018561374,0.0006495482,0.0018189797,0.00044439288,0.071716145,0.00009498241,0.92497736],"study_design_scores_gemma":[0.00045050753,0.0004213915,0.0001409437,0.0007201993,0.000015369962,0.0001886726,6.887422e-7,0.27086997,0.0045279986,0.71875167,0.002995961,0.0009166099],"about_ca_topic_score_codex":0.000015405927,"about_ca_topic_score_gemma":0.00002460413,"teacher_disagreement_score":0.92406076,"about_ca_system_score_codex":0.00015088008,"about_ca_system_score_gemma":0.0004708254,"threshold_uncertainty_score":0.9998623},"labels":[],"label_agreement":null},{"id":"W847683642","doi":"10.1016/j.tcs.2015.07.006","title":"Operational state complexity of unary NFAs with finite nondeterminism","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Science Council","keywords":"Unary operation; Concatenation (mathematics); TRACE (psycholinguistics); Regular language; State (computer science); Discrete mathematics; Upper and lower bounds; Property (philosophy); Mathematics; Tree (set theory); Computer science; Combinatorics; Finite-state machine; Algorithm; Theoretical computer science; Automaton","score_opus":0.033405676861885426,"score_gpt":0.2602477206608893,"score_spread":0.22684204379900388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W847683642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120785154,0.0000136697545,0.875298,0.0006816927,0.00026179524,0.000118723794,0.0000060559714,0.0001288407,0.0027060215],"genre_scores_gemma":[0.75801516,6.943121e-7,0.24136534,0.00055617583,0.00004167575,0.000003256253,0.000001464052,0.000005709606,0.000010509053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756646,0.0001288091,0.00030916536,0.0005820496,0.0009750124,0.00043851818],"domain_scores_gemma":[0.9980909,0.00024943746,0.00010028985,0.0008266799,0.00037071155,0.00036193742],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015774054,0.0001839887,0.00025125674,0.0001577242,0.00019395132,0.0002643225,0.0023219555,0.000031039206,0.00002532219],"category_scores_gemma":[0.000059384478,0.00013097216,0.000041798714,0.0008839383,0.005792852,0.00089191855,0.0010070772,0.00014732691,0.000044708435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022051367,0.000077232115,0.000107171014,0.0000051732254,0.0000043164514,0.000022909313,0.0008933781,0.0009790703,0.000259633,0.98989683,0.00003828468,0.00769393],"study_design_scores_gemma":[0.00035957745,0.00050954206,0.0010801455,0.000027239199,0.0000024053522,0.00006597055,0.000010764187,0.62840915,0.005368815,0.36393753,0.00004643262,0.00018243268],"about_ca_topic_score_codex":0.0000069939874,"about_ca_topic_score_gemma":7.5520853e-7,"teacher_disagreement_score":0.63723,"about_ca_system_score_codex":0.000040407776,"about_ca_system_score_gemma":0.00041779748,"threshold_uncertainty_score":0.99691284},"labels":[],"label_agreement":null},{"id":"W92501153","doi":"10.37236/12156","title":"Computation in Coxeter Groups—I. Multiplication","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Coxeter group; Mathematics; Coxeter element; Artin group; Coxeter complex; Multiplication (music); Computation; Mathematical proof; Reflection (computer programming); Combinatorics; Algebra over a field; Algorithm; Pure mathematics; Computer science; Geometry; Programming language","score_opus":0.010280974980870687,"score_gpt":0.21943738770983814,"score_spread":0.20915641272896746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92501153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34628898,0.0027645768,0.64709145,0.0027177092,0.00042518115,0.00011612296,1.257696e-7,0.00003547013,0.00056037016],"genre_scores_gemma":[0.9992648,0.00029641765,0.00017177622,0.00016190771,0.00004419564,0.000001992203,2.1350718e-7,0.000006746329,0.00005195311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988133,0.00014524192,0.00034577824,0.00009987247,0.00028480502,0.0003110239],"domain_scores_gemma":[0.99912083,0.00021340737,0.00029555158,0.00023012649,0.00010367461,0.00003638172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009927595,0.00008961975,0.00014549238,0.00012736817,0.00006799239,0.00006506856,0.0008248604,0.00003885228,0.0000059162903],"category_scores_gemma":[0.000040964656,0.00006310579,0.000063885265,0.0005072108,0.000026323843,0.0003937869,0.00006002638,0.00040592262,0.000017130626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060581497,0.00016497134,0.00023514556,0.0000036819317,0.000014549193,0.000006848316,0.00093967543,0.00048159945,0.0002756271,0.98231137,0.00041738662,0.015143084],"study_design_scores_gemma":[0.0009887037,0.0002812904,0.0019735238,0.000019932299,0.000007687877,0.00019431245,0.00005333373,0.18819074,0.00046781334,0.80675125,0.0009577366,0.000113671515],"about_ca_topic_score_codex":0.0000027060362,"about_ca_topic_score_gemma":0.0000015763951,"teacher_disagreement_score":0.65297586,"about_ca_system_score_codex":0.00022572851,"about_ca_system_score_gemma":0.000043420197,"threshold_uncertainty_score":0.25733796},"labels":[],"label_agreement":null},{"id":"W95660754","doi":"","title":"Languages convex with respect to binary relations, and their closure properties","year":2009,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Closure (psychology); Suffix; Mathematics; Regular language; Prefix code; Abstract family of languages; Set (abstract data type); Regular polygon; Combinatorics; Discrete mathematics; Computer science; Linguistics; Theoretical computer science; Programming language; Algorithm; Second-generation programming language; Decoding methods; Block code; Linear code","score_opus":0.008254940453334412,"score_gpt":0.2102712785417305,"score_spread":0.20201633808839609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95660754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97433937,0.0011538606,0.0014073296,0.013320512,0.000029701496,0.00020158115,0.0000020456775,0.0002469424,0.009298649],"genre_scores_gemma":[0.9923858,0.000018749686,0.0052601323,0.0012334754,0.000036450852,0.000006179196,0.0000010719583,0.0000071065792,0.0010510286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992825,0.00004909282,0.000100648926,0.00027141414,0.00011271184,0.00018365258],"domain_scores_gemma":[0.9993818,0.00006486171,0.000029124047,0.00041017617,0.000029099348,0.00008498295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013220857,0.000119502416,0.00012189603,0.000062652674,0.00008517001,0.00013059094,0.00033705868,0.000038863043,0.000018362298],"category_scores_gemma":[0.000031758107,0.00007370957,0.000017317272,0.00019156211,0.000051080326,0.0002071623,0.00009375322,0.0000890253,0.000033261967],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031720902,0.0004678308,0.0067106965,0.000046433357,0.0001471733,0.00024537093,0.04101469,0.00007988358,0.16473714,0.5520362,0.045665745,0.18853164],"study_design_scores_gemma":[0.0026171273,0.006428465,0.7279903,0.0008942821,0.00006332283,0.00066269265,0.00380099,0.015401267,0.084121406,0.047854483,0.107696496,0.0024691164],"about_ca_topic_score_codex":0.00001386383,"about_ca_topic_score_gemma":0.000004672143,"teacher_disagreement_score":0.7212797,"about_ca_system_score_codex":0.000011138595,"about_ca_system_score_gemma":0.000026806178,"threshold_uncertainty_score":0.3005789},"labels":[],"label_agreement":null}]}