{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1153,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":1153,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"4423166447e2","filters":{"topic":"semigroups and automata theory"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean‐Paul Allouche","is_ca":false},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01541463735000771,"gpt":0.1908397074182921,"spread":0.1754250700682844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002423111,0.0006041258,0.0003280565,0.001383749,0.001356892,0.002591205,0.0005104131,0.0005313461,0.0489228],"category_scores_gemma":[0.001047742,0.0002925313,0.0005029996,0.001208681,0.001318284,0.003397545,0.001156721,0.001209429,0.01582845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008830904,"about_ca_system_score_gemma":0.0006669736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004319408,"about_ca_topic_score_gemma":0.0007466666,"domain_scores_codex":[0.9995189,0.00006318867,0.00002797335,0.0001167182,0.0002307577,0.00004242913],"domain_scores_gemma":[0.999622,0.0001134688,0.0000245443,0.00007245391,0.0001369409,0.00003055465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000008882454,0.000008418084,0.0000386835,0.00009209652,0.000002758979,0.00005745484,0.0003184029,0.0002739395,0.00148948,0.9112782,0.02374281,0.06268887],"study_design_scores_gemma":[0.000004141878,0.00001454515,0.0001187208,0.00006756415,0.000003337115,0.0002973078,0.00009365818,0.0009995505,0.001184873,0.2981683,0.6990393,0.000008688154],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.005131461,0.005703499,0.08831704,0.00109749,0.002412356,0.00009169836,0.0005297712,0.0009585522,0.8957582],"genre_scores_gemma":[0.1151024,0.007157173,0.07211664,0.000890679,0.001296752,0.0002330059,0.001624038,0.0006205708,0.8009586],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.0489228,"threshold_uncertainty_score":0.1636631,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean‐Paul Allouche","is_ca":false},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007250582662101844,"gpt":0.2241170024500957,"spread":0.2168664197879939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634659,0.0002773802,0.0005482268,0.0008620934,0.001054478,0.003616972,0.0004940616,0.00039078,0.004026213],"category_scores_gemma":[0.001405398,0.0002620719,0.000452995,0.0009402175,0.003014373,0.005375158,0.0009565377,0.001549389,0.001308977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009831791,"about_ca_system_score_gemma":0.0005267918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004241717,"about_ca_topic_score_gemma":0.0002161725,"domain_scores_codex":[0.9995438,0.0001001817,0.00003343253,0.0001561973,0.00009890053,0.00006741183],"domain_scores_gemma":[0.9993514,0.0002674634,0.00008833234,0.0001089395,0.00009243792,0.00009139183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004000812,0.000006069088,0.0001410723,0.00004596604,0.000004237303,0.00002357995,0.0002102756,0.0003598346,0.0007423646,0.9896743,0.002338892,0.006413431],"study_design_scores_gemma":[0.000008964042,0.00002290002,0.000327869,0.00001815711,0.000005897517,0.0001113097,0.0001113946,0.001089405,0.000535933,0.9764758,0.02128357,0.000008809115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2528693,0.0428872,0.2001099,0.01141221,0.003491667,0.0000976608,0.001768286,0.0007859623,0.4865778],"genre_scores_gemma":[0.9087186,0.005452738,0.02654158,0.0006878597,0.001546531,0.00007417869,0.0004335712,0.00008556744,0.05645942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004026213,"threshold_uncertainty_score":0.01346898,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008768383314324668,"gpt":0.202186131174794,"spread":0.1934177478604693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002725776,0.0009195002,0.0009684869,0.001248196,0.0008561042,0.002757223,0.0007363917,0.0009378296,0.1463011],"category_scores_gemma":[0.001152461,0.0004468356,0.0009185323,0.001429622,0.0007008374,0.002909156,0.0009232576,0.00315149,0.07048532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00151048,"about_ca_system_score_gemma":0.001251533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009571056,"about_ca_topic_score_gemma":0.002255444,"domain_scores_codex":[0.9996803,0.00002976771,0.000010976,0.00007654337,0.0001701037,0.00003240698],"domain_scores_gemma":[0.999468,0.0002089425,0.00002367541,0.00006536331,0.0001536271,0.00008036803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002069267,0.000049731,0.0001568246,0.0002398793,0.000008840514,0.0001428839,0.0003593474,0.0007888785,0.001639584,0.08179349,0.7358274,0.1789724],"study_design_scores_gemma":[0.000003177939,0.00001383645,0.0001898795,0.00008276728,0.000002457708,0.0001693902,0.0000403011,0.0003409672,0.0002457141,0.01684721,0.9820597,0.000004635911],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001859431,0.01051722,0.04027123,0.006502252,0.008753312,0.0001175526,0.001706652,0.002440905,0.9278315],"genre_scores_gemma":[0.005279153,0.003483345,0.007660087,0.001390743,0.0007894754,0.00006670648,0.001065766,0.0004971401,0.9797677],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1463011,"threshold_uncertainty_score":0.4894261,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean Berstel","is_ca":false},{"name":"Christophe Reutenauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01269145055238754,"gpt":0.2067353105790676,"spread":0.1940438600266801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005932062,0.0008484995,0.0009319835,0.002021057,0.001440533,0.002814115,0.0005758799,0.0007364812,0.01222067],"category_scores_gemma":[0.00208285,0.0002934237,0.0005790617,0.002808135,0.002161591,0.003009509,0.002439279,0.002198702,0.0025203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001531809,"about_ca_system_score_gemma":0.0004529579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004284485,"about_ca_topic_score_gemma":0.0004741451,"domain_scores_codex":[0.9993735,0.0001792531,0.00003692512,0.0001317616,0.0002252114,0.00005340019],"domain_scores_gemma":[0.999301,0.0003218156,0.0000511008,0.00009725559,0.000159195,0.0000696659],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005737612,0.000009915671,0.00004019061,0.00005837275,0.000002777901,0.00006534863,0.0001621454,0.0006861137,0.0003355617,0.9851264,0.002640027,0.01086755],"study_design_scores_gemma":[0.000003613808,0.00001023294,0.00008704603,0.00003344061,0.000003221915,0.0001498966,0.0000890903,0.002955718,0.000202147,0.93684,0.05961836,0.000007174781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.03303263,0.04803329,0.1303268,0.005636493,0.004539168,0.00006280184,0.0002143485,0.0004835485,0.7776708],"genre_scores_gemma":[0.7151685,0.03629329,0.05679788,0.001443584,0.006409658,0.0001950806,0.0002580888,0.0002407909,0.1831932],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01222067,"threshold_uncertainty_score":0.04088223,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00977277697568894,"gpt":0.255818919786288,"spread":0.246046142810599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001025467,0.0007220216,0.0009288944,0.00179325,0.001584484,0.003021399,0.001295002,0.00130573,0.00668837],"category_scores_gemma":[0.001769128,0.0004335354,0.001330442,0.001709196,0.005456045,0.007009558,0.002102695,0.004702095,0.001045959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001863388,"about_ca_system_score_gemma":0.0008880227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00138085,"about_ca_topic_score_gemma":0.001123865,"domain_scores_codex":[0.9993826,0.0002126235,0.0000388613,0.0001272977,0.000179429,0.00005917848],"domain_scores_gemma":[0.999347,0.0002974649,0.00003288451,0.0001008605,0.0001316912,0.00009012715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003163931,0.000004602781,0.0000114229,0.000007522935,0.000001365752,0.00001419212,0.0001048849,0.0001739837,0.0001391683,0.998023,0.0002598625,0.001256736],"study_design_scores_gemma":[0.000004299981,0.000007316293,0.00001507308,0.000004848686,0.000002156197,0.00002209626,0.00003035618,0.001150003,0.00008232173,0.9939628,0.004715038,0.000003758706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03416259,0.004952486,0.8408087,0.005631753,0.001499612,0.00007116317,0.0001975394,0.0002501659,0.112426],"genre_scores_gemma":[0.6272911,0.005252171,0.2890861,0.002251431,0.003245378,0.0002621289,0.0003771352,0.0002200975,0.07201446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00668837,"threshold_uncertainty_score":0.02237481,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Amy Glen","is_ca":true},{"name":"Jacques Justin","is_ca":false},{"name":"Steve Widmer","is_ca":false},{"name":"Luca Q. Zamboni","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01561513954250889,"gpt":0.1937676582586337,"spread":0.1781525187161248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001267583,0.0006163145,0.00133067,0.002282084,0.002652851,0.004275796,0.0009598722,0.0009786936,0.02176339],"category_scores_gemma":[0.003725098,0.0006008295,0.001209832,0.001730628,0.00368428,0.01045702,0.004335294,0.003326277,0.002992325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009338381,"about_ca_system_score_gemma":0.0004637166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002096535,"about_ca_topic_score_gemma":0.0002190718,"domain_scores_codex":[0.9984043,0.0003392012,0.0001329004,0.0005063366,0.000383705,0.0002334978],"domain_scores_gemma":[0.9971468,0.001262295,0.0002220544,0.0007113029,0.0003620159,0.000295569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001535847,0.000008727323,0.00008851457,0.00002200096,0.000004172785,0.00003441277,0.0001623996,0.00007695305,0.0003808423,0.9949183,0.0006641338,0.003624074],"study_design_scores_gemma":[0.000009170837,0.0000107854,0.0001433354,0.000008962154,0.000009728679,0.0002265203,0.00007917296,0.0004315079,0.0004032926,0.991546,0.007124041,0.000007465685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2064551,0.001815835,0.2091031,0.004499907,0.0006046887,0.0001063149,0.0009873612,0.001011442,0.5754163],"genre_scores_gemma":[0.9240908,0.0007109314,0.02181737,0.0006383039,0.0006007171,0.00009392554,0.0005772202,0.0002881991,0.05118258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02176339,"threshold_uncertainty_score":0.07280576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988560957","doi":"10.1142/s012905410200100x","title":"UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Concatenation (mathematics); Unary operation; Regular language; Intersection (aeronautics); State (computer science); Mathematics; Symbol (formal); Alphabet; Discrete mathematics; Function (biology); Finite-state machine; Connection (principal bundle); Automaton; Combinatorics; Computer science; Algorithm; Theoretical computer science; Programming language","authors":[{"name":"Giovanni Pighizzini","is_ca":false},{"name":"JEFFREY SHALLIT","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02369577806896057,"gpt":0.2801950661256422,"spread":0.2564992880566816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001931417,0.000906055,0.001200214,0.001565384,0.001228548,0.00352002,0.002052621,0.001188796,0.007256537],"category_scores_gemma":[0.009501645,0.0004306402,0.001028871,0.001858462,0.004324009,0.01199916,0.0022718,0.002351001,0.0009400007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002942091,"about_ca_system_score_gemma":0.001626368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001122223,"about_ca_topic_score_gemma":0.001324844,"domain_scores_codex":[0.9977909,0.0003611724,0.0001305085,0.0002813637,0.0008775665,0.0005584907],"domain_scores_gemma":[0.9852825,0.01055906,0.0007553835,0.002351179,0.0006356636,0.0004162041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004055391,0.0001098505,0.001687902,0.0001879348,0.00002245298,0.0001146508,0.0002704202,0.04996889,0.004823766,0.8965191,0.002372849,0.04351666],"study_design_scores_gemma":[0.00003715778,0.0001253168,0.0006677863,0.0000346103,0.00004584376,0.0001418593,0.00009682226,0.1656391,0.01076936,0.8179304,0.004459183,0.00005266731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5543284,0.002273705,0.3890897,0.003117055,0.0002061894,0.0001441671,0.0005429266,0.001395308,0.04890245],"genre_scores_gemma":[0.9194372,0.0008728427,0.07064664,0.0001883037,0.0001388375,0.0001724647,0.0003019615,0.0003278701,0.007913838],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007256537,"threshold_uncertainty_score":0.02427554,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Sketch; Computer science; Regular expression; Theoretical computer science; Programming language; Algorithm","authors":[{"name":"Keith Ellul","is_ca":true},{"name":"Bryan Krawetz","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true},{"name":"Ming‐Wei Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0232650438718394,"gpt":0.2315811275553838,"spread":0.2083160836835445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01179476,0.002285093,0.003587921,0.005758942,0.003095748,0.01068407,0.004864434,0.004214255,0.01202063],"category_scores_gemma":[0.02184083,0.001772349,0.00408311,0.008186156,0.0182804,0.06214674,0.006444599,0.01372869,0.004393344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003469535,"about_ca_system_score_gemma":0.00186638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00138949,"about_ca_topic_score_gemma":0.0008320215,"domain_scores_codex":[0.9921013,0.002720006,0.0006770656,0.001840731,0.002124104,0.0005368211],"domain_scores_gemma":[0.9600866,0.03203243,0.0009151997,0.003498547,0.002408289,0.001058922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006005435,0.0000856823,0.000310946,0.0007497186,0.00004016239,0.000182595,0.000648583,0.001342274,0.000264825,0.9322502,0.01101349,0.05305145],"study_design_scores_gemma":[0.00001048322,0.00001572059,0.00008308865,0.0001358326,0.00001407567,0.0001672933,0.0002211187,0.002105755,0.0001508296,0.977573,0.01949794,0.00002483344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02881624,0.2569432,0.5118285,0.07534999,0.005908687,0.0001351839,0.001142599,0.001635612,0.1182399],"genre_scores_gemma":[0.3002919,0.2934745,0.3051217,0.01480765,0.0437234,0.0004673426,0.003087578,0.002410041,0.03661603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01202063,"threshold_uncertainty_score":0.06237739,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lucian Ilie","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009556904921695659,"gpt":0.2247056589438139,"spread":0.2151487540221183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003849077,0.0008117252,0.0006378587,0.0011477,0.002014645,0.004127518,0.0009579354,0.001221875,0.1192834],"category_scores_gemma":[0.002830754,0.0004754738,0.0009156168,0.001090275,0.001268047,0.006799798,0.001956876,0.002156978,0.07109369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001110814,"about_ca_system_score_gemma":0.000933457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00153556,"about_ca_topic_score_gemma":0.001757352,"domain_scores_codex":[0.9995073,0.00006999625,0.00003060985,0.0001883804,0.000134875,0.00006885673],"domain_scores_gemma":[0.9984389,0.0003786494,0.00005943925,0.0005903817,0.0004398763,0.00009277158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005854927,0.00004238192,0.0002563539,0.00008137426,0.00001099856,0.0001207745,0.0003235281,0.0003492676,0.001519499,0.8883502,0.05692345,0.05196361],"study_design_scores_gemma":[0.00002432615,0.00002371326,0.000218683,0.00002955562,0.00001858976,0.0001950042,0.0001554116,0.001812019,0.003065414,0.6641359,0.330303,0.00001838263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0177335,0.001156988,0.2367877,0.005374275,0.002139866,0.000422588,0.006914678,0.007062869,0.7224075],"genre_scores_gemma":[0.226749,0.001586755,0.04239464,0.0017978,0.000626042,0.0005152268,0.005204509,0.002022574,0.7191035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1192834,"threshold_uncertainty_score":0.3990428,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jean‐Paul Allouche","is_ca":false},{"name":"Michael Baake","is_ca":false},{"name":"Julien Cassaigne","is_ca":false},{"name":"David Damanik","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01940488099735775,"gpt":0.2512589619389404,"spread":0.2318540809415826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003766989,0.0004736367,0.0007910444,0.001115762,0.001446678,0.002585623,0.0008776155,0.0008593112,0.02092458],"category_scores_gemma":[0.001799382,0.0003589237,0.0007108072,0.001294887,0.001764944,0.007339383,0.001735638,0.002946652,0.002642205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018323,"about_ca_system_score_gemma":0.0004606956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003046389,"about_ca_topic_score_gemma":0.0002856285,"domain_scores_codex":[0.9994856,0.00008671862,0.00002787184,0.0001743172,0.0001578081,0.00006768083],"domain_scores_gemma":[0.999028,0.0004811517,0.00006368547,0.0002022859,0.0001297392,0.00009518981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000147021,0.00001278645,0.00006814761,0.00002600152,0.000003408144,0.00002823456,0.00009197774,0.000232033,0.0003793293,0.9917974,0.001886563,0.005459447],"study_design_scores_gemma":[0.000005042639,0.000007125912,0.00008279864,0.000004761898,0.000004481712,0.00007764545,0.00002516016,0.001073709,0.0002950105,0.9923746,0.006045692,0.000004044686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2075434,0.004234321,0.1729766,0.008316202,0.0008291545,0.00008222615,0.000857337,0.0007911086,0.6043696],"genre_scores_gemma":[0.8987065,0.001489582,0.01908726,0.0008384365,0.0008564433,0.00007740797,0.0006839642,0.0001910148,0.07806949],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02092458,"threshold_uncertainty_score":0.06999964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980577621","doi":"10.1142/s012905410400242x","title":"ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Combinatorics on words; Set (abstract data type); Product (mathematics); Enumeration; Simple (philosophy); Combinatorics; Existential quantification; Discrete mathematics; Word (group theory); Computer science","authors":[{"name":"Srečko Brlek","is_ca":true},{"name":"Sylvie Hamel","is_ca":true},{"name":"Maurice Nivat","is_ca":false},{"name":"Christophe Reutenauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03640076233099542,"gpt":0.301955305417043,"spread":0.2655545430860475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001316542,0.0004778468,0.0009281465,0.001367556,0.001293887,0.003640761,0.001187078,0.001418074,0.004308236],"category_scores_gemma":[0.01328376,0.000660231,0.0008240293,0.001351218,0.003605915,0.006949874,0.001882669,0.001964067,0.0004917739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001561082,"about_ca_system_score_gemma":0.0005630857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005779496,"about_ca_topic_score_gemma":0.0005203598,"domain_scores_codex":[0.9986225,0.0003461805,0.0001261686,0.0003197287,0.0004015906,0.0001838735],"domain_scores_gemma":[0.9851665,0.01219413,0.001103122,0.0006125353,0.000555089,0.0003685936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001776874,0.00008867344,0.001910393,0.0003330489,0.00002410232,0.0004597357,0.001612781,0.02608203,0.006284865,0.9439925,0.0008164374,0.0182178],"study_design_scores_gemma":[0.00003507749,0.00007488931,0.0006257821,0.00005044958,0.00001866287,0.0002558623,0.0002448566,0.03422474,0.002445436,0.9596136,0.002380346,0.00003017289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7932621,0.001697415,0.168922,0.002312523,0.00006894378,0.0001030328,0.000323506,0.0001848652,0.03312578],"genre_scores_gemma":[0.9617866,0.0007426891,0.03091213,0.000163393,0.0002109888,0.000136935,0.000388357,0.00006923293,0.005589597],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004308236,"threshold_uncertainty_score":0.01441246,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Arto Salomaa","is_ca":false},{"name":"Derick Wood","is_ca":false},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01521811981985313,"gpt":0.2520598938413013,"spread":0.2368417740214482,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003786319,0.000705508,0.00207307,0.001865988,0.001848933,0.006591196,0.002713078,0.002592255,0.01001211],"category_scores_gemma":[0.04039308,0.001134144,0.001687006,0.001844581,0.004753659,0.01686279,0.003822509,0.0054285,0.0005952989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002648927,"about_ca_system_score_gemma":0.001699215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002006033,"about_ca_topic_score_gemma":0.001832304,"domain_scores_codex":[0.9965854,0.001097128,0.000245697,0.000516514,0.0009078889,0.0006474087],"domain_scores_gemma":[0.8886279,0.09863131,0.003861961,0.004793499,0.0020269,0.002058438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009230719,0.000227215,0.004350541,0.0002416503,0.00007244809,0.0002622679,0.0009823656,0.0680748,0.003483574,0.9012039,0.003033128,0.01714503],"study_design_scores_gemma":[0.0000663212,0.00006126729,0.0009641165,0.00001972465,0.0000379036,0.00008500362,0.0001371177,0.1377611,0.0009102997,0.8593513,0.0005663488,0.0000394384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.838025,0.001278409,0.1233501,0.004877187,0.0001564797,0.0001175293,0.0009531145,0.0005041488,0.03073814],"genre_scores_gemma":[0.9880474,0.0004011449,0.007271347,0.000165956,0.0001712905,0.00007287613,0.0004305629,0.0001401365,0.003299396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01001211,"threshold_uncertainty_score":0.03349388,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008332151884208635,"gpt":0.2361555253071758,"spread":0.2278233734229672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001266866,0.0006810166,0.001103512,0.002236592,0.002070104,0.00437149,0.0009077473,0.001609192,0.00716133],"category_scores_gemma":[0.004121486,0.0005636767,0.0007989659,0.002200048,0.005255343,0.007533314,0.001589488,0.00331664,0.000837767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001874281,"about_ca_system_score_gemma":0.000772335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008596232,"about_ca_topic_score_gemma":0.0006796035,"domain_scores_codex":[0.9993882,0.000236298,0.00003671918,0.0001024986,0.0001425933,0.00009369141],"domain_scores_gemma":[0.9976484,0.001614738,0.0001648946,0.0001992299,0.0002287663,0.0001439156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000626812,0.000004741552,0.00003202726,0.000008105556,0.000001490949,0.00001141289,0.0001130948,0.000147846,0.00008568072,0.9976518,0.0003840599,0.001553511],"study_design_scores_gemma":[0.000004322232,0.000003075028,0.00003062828,0.00000397161,0.000001871206,0.00002284759,0.00002718009,0.0006113013,0.00005207781,0.9977152,0.001523557,0.000003961019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3294743,0.02238379,0.3431525,0.02430198,0.002699758,0.0000622599,0.0004776497,0.0005924454,0.2768553],"genre_scores_gemma":[0.9425566,0.003425003,0.0168632,0.0008202863,0.001795436,0.00008821458,0.0001794268,0.00009344725,0.03417841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00716133,"threshold_uncertainty_score":0.02395701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083735143","doi":"10.1142/s012905410300214x","title":"A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Queen's University; University of Prince Edward Island","funders":"","keywords":"Regular expression; Regular language; Computer science; Pumping lemma for regular languages; Context-free language; Context (archaeology); Theoretical computer science; Programming language; Artificial intelligence; Automaton; Biology; Rule-based machine translation; Programming paradigm; Fifth-generation programming language","authors":[{"name":"Cezar Câmpeanu","is_ca":true},{"name":"Kai Salomaa","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02637070741872171,"gpt":0.3423945622337794,"spread":0.3160238548150577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006285204,0.0009480452,0.0006959275,0.001480015,0.001951529,0.004305024,0.001702767,0.001531222,0.005449885],"category_scores_gemma":[0.01343328,0.001023704,0.001451682,0.00233618,0.0117636,0.01278266,0.002627136,0.004492398,0.0009879364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002443261,"about_ca_system_score_gemma":0.001641614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001282418,"about_ca_topic_score_gemma":0.0006739059,"domain_scores_codex":[0.9939721,0.002323994,0.000564099,0.001302325,0.001392219,0.0004450853],"domain_scores_gemma":[0.985837,0.009533812,0.001107167,0.001804688,0.001398354,0.0003189734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005847624,0.000007816318,0.00005758181,0.00004747744,0.000002822125,0.00008797855,0.0003335796,0.0006810165,0.0003266375,0.9955654,0.0003471595,0.002536822],"study_design_scores_gemma":[0.00001825271,0.00004171875,0.0001177684,0.0001126129,0.00001781715,0.0004946262,0.0004157349,0.01048642,0.001985574,0.9107783,0.07550994,0.00002114673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02633624,0.003254746,0.905077,0.005541334,0.0003069598,0.0002196946,0.0002816281,0.0005745373,0.05840777],"genre_scores_gemma":[0.5367483,0.00394132,0.4287268,0.001731754,0.000957115,0.0007519803,0.0006275937,0.0004339858,0.02608118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006285204,"threshold_uncertainty_score":0.03323972,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Paul Beame","is_ca":false},{"name":"Richard M. Karp","is_ca":false},{"name":"Toniann Pitassi","is_ca":false},{"name":"Michael Saks","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01238206213594669,"gpt":0.2277696652962964,"spread":0.2153876031603497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012765,0.001243154,0.001845995,0.002612568,0.001715577,0.00424498,0.00534784,0.00291092,0.006684665],"category_scores_gemma":[0.08314525,0.001120962,0.002596946,0.003007903,0.004111991,0.008675055,0.003747622,0.003183863,0.001450398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004381455,"about_ca_system_score_gemma":0.003659958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002651485,"about_ca_topic_score_gemma":0.002898542,"domain_scores_codex":[0.9822687,0.006978582,0.001012667,0.003174532,0.004884012,0.001681518],"domain_scores_gemma":[0.901414,0.07960596,0.004047791,0.01181191,0.002378569,0.0007418272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001955009,0.0005684898,0.006228774,0.0009315158,0.0004751428,0.0003288478,0.0008816493,0.2295157,0.02331573,0.4576891,0.007182367,0.2709277],"study_design_scores_gemma":[0.0003044179,0.0002484125,0.000863625,0.00009219063,0.0001603338,0.0003095231,0.0001245288,0.7073575,0.0344134,0.2520943,0.003957056,0.00007477027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1501866,0.001977166,0.8200033,0.002739765,0.00009993261,0.0004930202,0.0004128915,0.002687637,0.02139957],"genre_scores_gemma":[0.599511,0.000793856,0.3930417,0.0006773879,0.00009044449,0.0005366975,0.0005335561,0.0006508604,0.004164502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.012765,"threshold_uncertainty_score":0.06750852,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01474289125043253,"gpt":0.2537533366990527,"spread":0.2390104454486202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001126617,0.0008536929,0.0008550651,0.001724133,0.001402513,0.004494464,0.001057665,0.00157558,0.00540918],"category_scores_gemma":[0.004725789,0.0005091315,0.0006607846,0.001907719,0.004411452,0.007909301,0.002069943,0.003433805,0.0007459256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001360208,"about_ca_system_score_gemma":0.0006969766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005804551,"about_ca_topic_score_gemma":0.0003425254,"domain_scores_codex":[0.9994593,0.0001901476,0.00003294508,0.0001167575,0.0001198856,0.00008085388],"domain_scores_gemma":[0.9979771,0.001321866,0.0001814582,0.0001709482,0.0002212738,0.0001274571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001037856,0.000006436811,0.00006602536,0.00001533056,0.000002181945,0.00002467901,0.000201744,0.0001643775,0.0002403408,0.9957476,0.0005152985,0.00300565],"study_design_scores_gemma":[0.000004228161,0.00000636008,0.00005713857,0.000007986995,0.000003920017,0.00005960211,0.00007037688,0.001231576,0.0002163892,0.9967778,0.001558706,0.000005876702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.31933,0.01196838,0.4834723,0.01351956,0.001510841,0.00007239624,0.0003034396,0.000418745,0.1694044],"genre_scores_gemma":[0.9481047,0.00201903,0.02088063,0.0006420292,0.001201522,0.00009718126,0.0001257374,0.00009967997,0.02682946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00540918,"threshold_uncertainty_score":0.01809549,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"B. John Oommen","is_ca":true},{"name":"Timothy Roberts","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01753760132844699,"gpt":0.2125178869210948,"spread":0.1949802855926479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357527,0.0008268504,0.0009328924,0.0006240812,0.00064758,0.001415648,0.00162583,0.001583259,0.005158228],"category_scores_gemma":[0.003282793,0.0004324033,0.0008410921,0.0007365015,0.001427187,0.001111341,0.001292607,0.001753554,0.000604961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001081865,"about_ca_system_score_gemma":0.001453167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002743382,"about_ca_topic_score_gemma":0.003428462,"domain_scores_codex":[0.999455,0.000170682,0.00003688547,0.0001456108,0.0001151138,0.00007669652],"domain_scores_gemma":[0.9976739,0.001685198,0.0001218884,0.0001963469,0.0002178365,0.0001047667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009576975,0.00008697104,0.0003384099,0.0001786158,0.00004099736,0.000113794,0.0001816772,0.8169832,0.001683957,0.1275315,0.001979537,0.05078562],"study_design_scores_gemma":[0.00002009637,0.00002135753,0.0000332042,0.000007401703,0.000005552043,0.00001529967,0.00001763766,0.9511563,0.0004162782,0.04734706,0.0009529743,0.000006767744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02541015,0.0005079554,0.963569,0.0003917578,0.00009394094,0.0000609647,0.0001164503,0.0004838906,0.009365875],"genre_scores_gemma":[0.5970802,0.0007009833,0.3916563,0.0001569226,0.0001218163,0.000400493,0.0003626301,0.0001306701,0.009389971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005158228,"threshold_uncertainty_score":0.01725596,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Queen's University","funders":"","keywords":"State (computer science); Intersection (aeronautics); Combined operations; Star (game theory); Computer science; Theoretical computer science; Computational complexity theory; Mathematics; Algorithm; Engineering; Political science","authors":[{"name":"Arto Salomaa","is_ca":false},{"name":"Kai Salomaa","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01896866439580035,"gpt":0.2679945130767457,"spread":0.2490258486809453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001905198,0.0005659639,0.001477771,0.00188845,0.00170461,0.007728068,0.001926194,0.001902531,0.01246029],"category_scores_gemma":[0.01621721,0.0007860365,0.001739207,0.002239801,0.003161974,0.0153263,0.003432479,0.003849751,0.0007162648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002522371,"about_ca_system_score_gemma":0.001642885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001736362,"about_ca_topic_score_gemma":0.00155006,"domain_scores_codex":[0.9965952,0.0007610429,0.0002104499,0.0006092298,0.00124283,0.0005813547],"domain_scores_gemma":[0.9659581,0.02693775,0.001365397,0.002797299,0.001801539,0.001139924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004421741,0.0001279348,0.001816361,0.0001089185,0.00004682431,0.0001390726,0.000680519,0.0282535,0.002781167,0.9516364,0.001287607,0.01267954],"study_design_scores_gemma":[0.00003410183,0.00003704903,0.0006940136,0.00001196056,0.00003778733,0.0000631021,0.0001089513,0.1183684,0.00199878,0.877999,0.0006202644,0.00002650372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7962264,0.0004388911,0.1703231,0.001672201,0.00006850754,0.00008707926,0.0008685769,0.0004010206,0.02991424],"genre_scores_gemma":[0.9875305,0.0001434392,0.007756694,0.00006188558,0.00007091036,0.00008299249,0.0003955453,0.00007798385,0.003880116],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01246029,"threshold_uncertainty_score":0.04168385,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michael Baake","is_ca":false},{"name":"Daniel Lenz","is_ca":false},{"name":"Robert V. Moody","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008800566012053684,"gpt":0.2194009786131563,"spread":0.2106004126011027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001010031,0.0003661261,0.0006291874,0.001427993,0.0008365629,0.002248699,0.0008459351,0.0009124894,0.003148591],"category_scores_gemma":[0.006169462,0.0004082577,0.0007181854,0.0007813333,0.002829023,0.003787573,0.001898683,0.001221469,0.0003266493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009710671,"about_ca_system_score_gemma":0.0002629925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004488812,"about_ca_topic_score_gemma":0.0002741003,"domain_scores_codex":[0.9988181,0.0002863909,0.00007889478,0.0003838809,0.0003204852,0.0001121763],"domain_scores_gemma":[0.996006,0.002292822,0.0005347983,0.0006325304,0.0002912765,0.0002427144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006421515,0.00003267358,0.002431527,0.00008216517,0.00003408796,0.000285296,0.0009042718,0.01509914,0.005425579,0.9663715,0.0006026237,0.008666835],"study_design_scores_gemma":[0.00001873207,0.0000636913,0.001194587,0.00003895023,0.00002202286,0.00046421,0.0002811503,0.1395124,0.00258116,0.8505471,0.005249692,0.00002625711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4180608,0.0006721999,0.5565025,0.0006392976,0.00007053034,0.0001033232,0.0003422359,0.0004158057,0.02319319],"genre_scores_gemma":[0.9615902,0.0001270328,0.03615434,0.00006433953,0.00004725748,0.00008193552,0.0001818271,0.00004566909,0.001707413],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003148591,"threshold_uncertainty_score":0.01053309,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alexandru Mateescu","is_ca":false},{"name":"Arto Salomaa","is_ca":false},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01107804895600222,"gpt":0.2151253469048074,"spread":0.2040472979488052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106982,0.000396223,0.0008948646,0.002065212,0.003216137,0.004067587,0.00115832,0.0011586,0.01670809],"category_scores_gemma":[0.009956483,0.0007115391,0.000703686,0.001872302,0.003092706,0.008507027,0.002329866,0.001965477,0.002360049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001246186,"about_ca_system_score_gemma":0.0009838477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001117303,"about_ca_topic_score_gemma":0.0009939129,"domain_scores_codex":[0.9989228,0.0003045669,0.00009259304,0.0002225033,0.0002536076,0.0002039011],"domain_scores_gemma":[0.9908246,0.005591472,0.0007286263,0.001417696,0.0006974928,0.0007401954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009767726,0.00002467935,0.0002773148,0.0000325541,0.000005731096,0.0001487811,0.0007009548,0.0007518822,0.001011927,0.9860706,0.0008832678,0.009994557],"study_design_scores_gemma":[0.000008921359,0.00001261578,0.00006918766,0.000005323662,0.000004943503,0.00008453266,0.0001155008,0.002798395,0.0005187202,0.9945045,0.001866854,0.00001050611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4875654,0.001184123,0.4159357,0.003789985,0.000622206,0.0001766758,0.0008795435,0.001916283,0.08793001],"genre_scores_gemma":[0.9486861,0.0003612371,0.02283113,0.0002379661,0.0003325677,0.0001153826,0.0002834591,0.0002309229,0.02692112],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01670809,"threshold_uncertainty_score":0.0558942,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean‐Paul Allouche","is_ca":false},{"name":"J. L. Davison","is_ca":true},{"name":"Martine Queffélec","is_ca":false},{"name":"Luca Q. Zamboni","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02011537859127649,"gpt":0.2793692237711556,"spread":0.2592538451798791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001334742,0.001128657,0.001163,0.003777791,0.001932676,0.003842703,0.0009548677,0.00134392,0.007890864],"category_scores_gemma":[0.005240713,0.0005189159,0.001128414,0.001565458,0.005216376,0.006511184,0.002426432,0.00249851,0.001062349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001746779,"about_ca_system_score_gemma":0.0006443175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005966372,"about_ca_topic_score_gemma":0.0004549985,"domain_scores_codex":[0.9993599,0.0001493151,0.00003757121,0.0001403622,0.000173685,0.0001391621],"domain_scores_gemma":[0.998099,0.0009722736,0.0002025477,0.0001891499,0.0002452179,0.000291883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002832271,0.00000664676,0.00006639003,0.00001334792,0.000004168777,0.00006447525,0.0001935709,0.0001835952,0.0002689422,0.9969625,0.000261212,0.001946719],"study_design_scores_gemma":[0.00001274648,0.00001509572,0.00008335081,0.000008446737,0.000007469491,0.0001069232,0.00004146447,0.0009358001,0.0002527883,0.996797,0.001730751,0.000008192763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.5300359,0.004746736,0.1432215,0.003578798,0.001352365,0.00006978361,0.0003023176,0.0005621299,0.3161305],"genre_scores_gemma":[0.9664692,0.0009535069,0.007855765,0.00038331,0.0007727506,0.00005219032,0.0001015379,0.00008962927,0.02332205],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.007890864,"threshold_uncertainty_score":0.02639753,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Ternary operation; Combinatorics; Square (algebra); Geometry; Computer science","authors":[{"name":"James D. Currie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01556969058956936,"gpt":0.2225624394145583,"spread":0.206992748824989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002303916,0.0005082887,0.0004251123,0.0004153584,0.001568767,0.001213297,0.000463633,0.0009999493,0.01336825],"category_scores_gemma":[0.001621733,0.0003767348,0.0006194714,0.0005123695,0.001356618,0.002251999,0.001558387,0.0006881564,0.002731197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005168855,"about_ca_system_score_gemma":0.0006109387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000752075,"about_ca_topic_score_gemma":0.001725741,"domain_scores_codex":[0.9997169,0.00003067185,0.00002247781,0.0000877393,0.00005506668,0.00008706671],"domain_scores_gemma":[0.9984452,0.0006713889,0.0003567215,0.0001435664,0.0001902382,0.0001929841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003747862,0.0003183456,0.02279878,0.00128172,0.0001234913,0.00549442,0.006135843,0.003039332,0.19645,0.5641672,0.0171779,0.1792652],"study_design_scores_gemma":[0.0001910267,0.0004031962,0.02166258,0.0002945458,0.0001679759,0.005351512,0.005146491,0.006263485,0.1165085,0.7081625,0.1355928,0.000255419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8800553,0.001485838,0.03744588,0.001707979,0.0004001004,0.00005057637,0.000973698,0.0005620379,0.07731848],"genre_scores_gemma":[0.94451,0.00049542,0.03007493,0.0004629964,0.00007880626,0.0001191295,0.0009581378,0.0001268761,0.02317368],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01336825,"threshold_uncertainty_score":0.04472125,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Valérie Berthé","is_ca":false},{"name":"Aldo de Luca","is_ca":false},{"name":"Christophe Reutenauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01025562220827607,"gpt":0.226067542029621,"spread":0.2158119198213449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001433097,0.0007616404,0.001002651,0.003133574,0.004196262,0.003240813,0.0009572475,0.001684881,0.005747616],"category_scores_gemma":[0.003026335,0.0006250464,0.001513901,0.002739854,0.005620833,0.00476937,0.003115746,0.0023246,0.0009302754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001959137,"about_ca_system_score_gemma":0.0007337015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001735282,"about_ca_topic_score_gemma":0.001574928,"domain_scores_codex":[0.9989674,0.000226775,0.00006572614,0.0001789597,0.0002346184,0.0003264703],"domain_scores_gemma":[0.998081,0.0009291047,0.0001807677,0.000194173,0.0003011722,0.0003138778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000358582,0.00001548057,0.0001372805,0.0000115802,0.000004183192,0.0001401073,0.0005316109,0.0002437635,0.0005925641,0.9950767,0.0003012547,0.002909577],"study_design_scores_gemma":[0.000008946771,0.00001837307,0.0001787773,0.000008913285,0.000007819381,0.0001110998,0.0001450046,0.00115734,0.0004887195,0.9960352,0.001825011,0.00001481256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6907412,0.001620645,0.1572586,0.001555928,0.001074699,0.00004871533,0.0001616514,0.0004977343,0.1470409],"genre_scores_gemma":[0.9638668,0.0005615805,0.01227284,0.0002989332,0.0003680084,0.00003835408,0.0001164372,0.0001523489,0.02232465],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005747616,"threshold_uncertainty_score":0.01922768,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","authors":[{"name":"Cezar Câmpeanu","is_ca":true},{"name":"Nicolae Sântean","is_ca":true},{"name":"S. Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0108842540742893,"gpt":0.2659373913081476,"spread":0.2550531372338584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009460466,0.0009874104,0.001682845,0.001862156,0.002880252,0.004486844,0.001537513,0.002042355,0.008827207],"category_scores_gemma":[0.004923667,0.00109944,0.002052828,0.001912631,0.002939269,0.008575628,0.002706598,0.003608861,0.001082774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002134868,"about_ca_system_score_gemma":0.0009888456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001347221,"about_ca_topic_score_gemma":0.001888459,"domain_scores_codex":[0.9986602,0.0002769654,0.00009828229,0.0003225842,0.0004357743,0.0002061214],"domain_scores_gemma":[0.9937237,0.004780998,0.0002812959,0.0004844447,0.0003709378,0.0003586038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001225765,0.00004471388,0.0003886566,0.0001147158,0.00002915832,0.000167238,0.0009094427,0.002699685,0.001859059,0.9827291,0.002038885,0.00889665],"study_design_scores_gemma":[0.0000173487,0.00001120157,0.0001078194,0.00001170802,0.00001675705,0.00007281653,0.00007497179,0.007618218,0.0005443098,0.9897639,0.001751396,0.000009596938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3125212,0.003507225,0.6133115,0.004274701,0.0003190455,0.0001913345,0.002053621,0.002220005,0.06160133],"genre_scores_gemma":[0.9179646,0.000933816,0.06260452,0.0004572382,0.0003987619,0.0003407906,0.002337421,0.0003716567,0.01459129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008827207,"threshold_uncertainty_score":0.02952993,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andris Ambainis","is_ca":true},{"name":"Martin Beaudry","is_ca":true},{"name":"Marats Golovkins","is_ca":false},{"name":"Arnolds Ķikusts","is_ca":true},{"name":"Mark Mercer","is_ca":true},{"name":"Denis Thérien","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01856083936426342,"gpt":0.2465511724309238,"spread":0.2279903330666604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001864862,0.001032287,0.001705156,0.003579676,0.004083213,0.004912531,0.001799087,0.001508989,0.01094024],"category_scores_gemma":[0.005104671,0.0008613261,0.001756255,0.003518874,0.007454019,0.01379355,0.004033673,0.005375017,0.001152601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003594064,"about_ca_system_score_gemma":0.001359352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0021508,"about_ca_topic_score_gemma":0.00155059,"domain_scores_codex":[0.9980965,0.0004653974,0.0001220447,0.0003706459,0.0007258297,0.0002195652],"domain_scores_gemma":[0.9952126,0.002906669,0.0002379421,0.0005047807,0.0007763768,0.0003616118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004384145,0.000006192289,0.00002038546,0.0000141634,0.000002174724,0.000007173672,0.00005871865,0.0001708925,0.00006059859,0.9985163,0.0004042411,0.0007348131],"study_design_scores_gemma":[0.000005752952,0.000003246895,0.00003411033,0.000004421318,0.000003955915,0.00001001672,0.0000190307,0.0009562444,0.00005894923,0.9968887,0.002011306,0.000004250736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1357517,0.0103585,0.4303502,0.01588246,0.002947485,0.00013477,0.0009234856,0.0005948551,0.4030566],"genre_scores_gemma":[0.9016817,0.005607364,0.04250741,0.002261242,0.004086036,0.0002594196,0.0005695635,0.000245083,0.0427822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01094024,"threshold_uncertainty_score":0.0365988,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Hellis Tamm","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008109070715470214,"gpt":0.2257240771487832,"spread":0.217615006433313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001470013,0.0008675841,0.001167287,0.002538227,0.00380235,0.006441815,0.002031477,0.001893068,0.02114282],"category_scores_gemma":[0.004149072,0.00111372,0.00198848,0.00252752,0.006445509,0.01417478,0.003932702,0.004408286,0.004537241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002964493,"about_ca_system_score_gemma":0.001598809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002536098,"about_ca_topic_score_gemma":0.001792186,"domain_scores_codex":[0.9981064,0.0005593454,0.0001356008,0.0004902254,0.0004785334,0.0002298123],"domain_scores_gemma":[0.9980881,0.0007979865,0.0001063667,0.000447242,0.0004556718,0.0001046644],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005662326,0.000003499274,0.00004102324,0.00001823893,0.000002638468,0.00001157181,0.0000961605,0.0001101758,0.00007021626,0.9965431,0.001189291,0.0019085],"study_design_scores_gemma":[0.000006318178,0.000002809718,0.00003145191,0.00001084674,0.000005636475,0.00002883651,0.00003657136,0.0006812157,0.0001412027,0.9882089,0.0108419,0.000004331571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03444231,0.0068938,0.5524624,0.007958856,0.001484874,0.000175151,0.0020801,0.001899591,0.392603],"genre_scores_gemma":[0.721853,0.004239105,0.1533687,0.002603213,0.001532894,0.0004869973,0.002683909,0.0008907774,0.1123414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02114282,"threshold_uncertainty_score":0.07072973,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Psychology; Computer science; Mathematics","authors":[{"name":"Jean Berstel","is_ca":false},{"name":"Aaron Lauve","is_ca":false},{"name":"Christophe Reutenauer","is_ca":true},{"name":"Franco Saliola","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01141688571781476,"gpt":0.1988763999664984,"spread":0.1874595142486837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002222201,0.001125214,0.0008740895,0.002160802,0.001667525,0.003954857,0.0007424569,0.0004920653,0.03645454],"category_scores_gemma":[0.0008576861,0.0005828675,0.0005902568,0.00321954,0.002627143,0.00534855,0.001668843,0.00225716,0.01817989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002161942,"about_ca_system_score_gemma":0.001173193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001594421,"about_ca_topic_score_gemma":0.002298106,"domain_scores_codex":[0.9996417,0.00006721407,0.00001935817,0.0000719467,0.0001639045,0.0000360284],"domain_scores_gemma":[0.9997583,0.00007076756,0.0000158188,0.00006894954,0.00005925665,0.00002689509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009142513,0.00001102972,0.00004177622,0.00009492779,0.00000560822,0.00003162397,0.0002708665,0.0003193658,0.0003776907,0.8812606,0.06482799,0.05274939],"study_design_scores_gemma":[0.000004000839,0.000006095114,0.00008621642,0.00004705511,0.000005581453,0.00008176167,0.00008059916,0.0003716378,0.0002245962,0.5613154,0.4377702,0.000006811722],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00368832,0.01232114,0.02906064,0.002264821,0.001963764,0.00004150278,0.0004000114,0.0004562962,0.9498035],"genre_scores_gemma":[0.06893191,0.01303781,0.01285359,0.001086355,0.002424335,0.0001808829,0.0008859059,0.000650464,0.8999488],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.03645454,"threshold_uncertainty_score":0.1219525,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Exponential growth; Binary number; Mathematics; Exponential function; Polynomial; Repetition (rhetorical device); Combinatorics; Discrete mathematics; Exponential polynomial; Arithmetic; Mathematical analysis","authors":[{"name":"Juhani Karhumäki","is_ca":false},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007989040553793911,"gpt":0.2220420646739751,"spread":0.2140530241201812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00234335,0.0005858171,0.0009318871,0.001555543,0.001419797,0.004008056,0.001619696,0.001329565,0.009559363],"category_scores_gemma":[0.02991718,0.0007396667,0.0007625329,0.001549021,0.003611556,0.009077644,0.002267141,0.002463706,0.001407102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001639961,"about_ca_system_score_gemma":0.001330743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001521123,"about_ca_topic_score_gemma":0.001538665,"domain_scores_codex":[0.9980094,0.0005084398,0.0001114771,0.0003329636,0.0005388517,0.0004989889],"domain_scores_gemma":[0.9518539,0.03934684,0.002132128,0.00283785,0.002205938,0.001623409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007214127,0.00009463417,0.002551179,0.0001580408,0.0000143662,0.0003587131,0.001200227,0.01474925,0.005429684,0.9520447,0.002804898,0.01987289],"study_design_scores_gemma":[0.00005543729,0.00005962398,0.0007939847,0.00003339662,0.00002622051,0.0003381893,0.0001928121,0.05128794,0.003316225,0.9419506,0.001908406,0.00003705705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.834541,0.00150539,0.1137201,0.004347743,0.000226736,0.00007046659,0.0005966977,0.0008268174,0.04416498],"genre_scores_gemma":[0.9761676,0.0005575229,0.01011589,0.0002420352,0.000344716,0.00006228851,0.000230792,0.0002127888,0.01206647],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009559363,"threshold_uncertainty_score":0.03197926,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Pedro V. Silva","is_ca":false},{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01168071292187287,"gpt":0.2636204136391523,"spread":0.2519397007172794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005730811,0.0006812461,0.0006066138,0.001240976,0.001751909,0.001924983,0.0006551335,0.001403401,0.005137525],"category_scores_gemma":[0.002021007,0.0002943478,0.0014551,0.0008128622,0.003120179,0.003628535,0.002234337,0.001514055,0.0007121212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008712822,"about_ca_system_score_gemma":0.0005278717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001093547,"about_ca_topic_score_gemma":0.0007670588,"domain_scores_codex":[0.9993661,0.0001233543,0.00003709207,0.0001896925,0.0001369731,0.0001468089],"domain_scores_gemma":[0.998689,0.0005868291,0.0002072618,0.0002243675,0.00009796377,0.000194593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005561687,0.0000382076,0.0007994998,0.0000502422,0.00001383199,0.0005174544,0.00115588,0.003513213,0.004008794,0.9840364,0.0005831164,0.005227702],"study_design_scores_gemma":[0.00004000408,0.0001102477,0.0006022619,0.00002404748,0.00001602563,0.000395745,0.0003034208,0.01300752,0.001264062,0.9749482,0.009262713,0.00002574967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6819102,0.001825151,0.2234877,0.001536979,0.0002741697,0.0002383523,0.0004211956,0.0006496263,0.08965667],"genre_scores_gemma":[0.9534869,0.0008002481,0.02226715,0.0003100738,0.0004071984,0.0002265811,0.0005282703,0.0001203686,0.02185328],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005137525,"threshold_uncertainty_score":0.01718676,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean‐Paul Allouche","is_ca":false},{"name":"Narad Rampersad","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01089730851088301,"gpt":0.2616924037423216,"spread":0.2507950952314386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007772082,0.0002650587,0.0004784507,0.001206648,0.001398259,0.001463063,0.0006053367,0.0008813474,0.003175672],"category_scores_gemma":[0.004324805,0.0003596125,0.000592884,0.0006326875,0.002442354,0.002809315,0.0009839723,0.0008719192,0.0003461485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004364827,"about_ca_system_score_gemma":0.0004445122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004658321,"about_ca_topic_score_gemma":0.0004713435,"domain_scores_codex":[0.9992557,0.0001617213,0.00007731183,0.000183726,0.0002095841,0.0001120123],"domain_scores_gemma":[0.9948995,0.002954462,0.0006689494,0.0007659828,0.0003602281,0.0003509623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003142681,0.0000439227,0.002035565,0.00006243662,0.00001675564,0.0005773235,0.001144251,0.002674871,0.01232873,0.9621822,0.0006459418,0.01797375],"study_design_scores_gemma":[0.00002885654,0.0001057023,0.001538057,0.0000190423,0.00001825555,0.0006065476,0.0001978929,0.02261191,0.003922986,0.9689098,0.002007087,0.00003382105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8608581,0.0003598293,0.1197501,0.0003534102,0.0001454434,0.000030482,0.0002235597,0.0002921998,0.01798682],"genre_scores_gemma":[0.9768773,0.000128525,0.01773842,0.00003840944,0.0001246817,0.00004841836,0.0001671483,0.00005368816,0.004823396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003175672,"threshold_uncertainty_score":0.01062369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570053645","doi":"10.1142/s0129054112400448","title":"ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Decidability; Enumeration; Recursively enumerable language; Mathematics; Combinatorics; Class (philosophy); Discrete mathematics; Function (biology); Sequence (biology); Computer science; Biology; Artificial intelligence","authors":[{"name":"Émilie Charlier","is_ca":true},{"name":"Narad Rampersad","is_ca":true},{"name":"JEFFREY SHALLIT","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02306499012198243,"gpt":0.278462639676021,"spread":0.2553976495540386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063018,0.0004625844,0.0003958074,0.0009485151,0.00109934,0.00191605,0.001175314,0.000693583,0.003677712],"category_scores_gemma":[0.006650012,0.0004289941,0.001078287,0.001032865,0.002540268,0.00432832,0.001426856,0.001836107,0.0004360247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141092,"about_ca_system_score_gemma":0.0007205314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006543523,"about_ca_topic_score_gemma":0.0008350373,"domain_scores_codex":[0.9984025,0.0003832766,0.0001598391,0.0004242983,0.0004063693,0.000223679],"domain_scores_gemma":[0.9915759,0.006455371,0.0006909456,0.0006815016,0.0004028467,0.0001934801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001446904,0.0001146228,0.002190377,0.0001970756,0.00002309192,0.0005229223,0.001124685,0.01685335,0.01634671,0.926371,0.001128522,0.03498292],"study_design_scores_gemma":[0.00002323124,0.00004880004,0.0005640399,0.00003732541,0.00001936742,0.0004065455,0.0001514284,0.05186465,0.01278738,0.9301479,0.003918521,0.00003082154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5097392,0.0005943916,0.4482947,0.0007935938,0.00007621153,0.00009015438,0.0004220656,0.00112332,0.03886637],"genre_scores_gemma":[0.936739,0.0002495025,0.05623218,0.0001156804,0.0001006048,0.0001224527,0.0004907629,0.0001163467,0.0058334],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003677712,"threshold_uncertainty_score":0.01230323,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Mathematics; Computer science; Arithmetic; Pure mathematics","authors":[{"name":"Jean-Pierre Borel","is_ca":false},{"name":"Christophe Reutenauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005503843000699254,"gpt":0.2344277857572929,"spread":0.2289239427565936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007122549,0.0006220802,0.0004758282,0.002143135,0.001713229,0.002269819,0.0006211835,0.0006992152,0.01173309],"category_scores_gemma":[0.002601548,0.000203886,0.0006055739,0.001468244,0.003787492,0.004788756,0.001836882,0.001191799,0.001263345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001721264,"about_ca_system_score_gemma":0.0002907801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006489265,"about_ca_topic_score_gemma":0.0003886581,"domain_scores_codex":[0.9990156,0.0001369377,0.00005752104,0.0002592549,0.0002816244,0.0002491015],"domain_scores_gemma":[0.9985025,0.0005649994,0.0002550412,0.0001967953,0.0002303457,0.0002503767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002734039,0.00001751484,0.0004844767,0.00002033098,0.000003073873,0.00004403773,0.0001536375,0.0004133284,0.0015171,0.9887243,0.0006029232,0.007991781],"study_design_scores_gemma":[0.00001416951,0.00006110206,0.001621133,0.00001843816,0.00001028523,0.0002418212,0.0002174969,0.004524419,0.003688118,0.9779544,0.01162507,0.00002367952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6939188,0.001017976,0.1341739,0.00121356,0.0002612112,0.0001107234,0.0003754528,0.0002829247,0.1686455],"genre_scores_gemma":[0.9682898,0.0005376876,0.01265302,0.0002328075,0.0002857035,0.00008258274,0.0002611063,0.00008722792,0.01757014],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01173309,"threshold_uncertainty_score":0.03925109,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Anne Preller","is_ca":false},{"name":"Joachim Lambek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01365252177737777,"gpt":0.2680591647508541,"spread":0.2544066429734764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001130102,0.0004513162,0.0003771919,0.001449361,0.001317446,0.002300046,0.0009869048,0.0009981532,0.008713147],"category_scores_gemma":[0.002579716,0.0003274538,0.0006984238,0.0006633413,0.002365574,0.005621262,0.00259498,0.0009049803,0.0008832315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008649856,"about_ca_system_score_gemma":0.0004555451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009992289,"about_ca_topic_score_gemma":0.00110867,"domain_scores_codex":[0.9986386,0.0003115305,0.0001403214,0.0003281455,0.0003879632,0.0001934163],"domain_scores_gemma":[0.9983792,0.0006794615,0.0001243018,0.0002405748,0.0004351534,0.0001413922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001983977,0.000006322628,0.0001766651,0.00003282557,0.00000543174,0.0001000952,0.0005210363,0.0004204555,0.001453384,0.98994,0.0006354594,0.006688419],"study_design_scores_gemma":[0.000009397588,0.00002417676,0.0003553172,0.00001939044,0.000008495431,0.0001655222,0.0002054189,0.003482502,0.002175047,0.975201,0.01833453,0.00001920801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2548456,0.001598314,0.6600605,0.001112647,0.0003946529,0.000192093,0.001157652,0.00119708,0.07944151],"genre_scores_gemma":[0.8656728,0.0003251002,0.1104017,0.0004643897,0.0002496081,0.0001854475,0.0008428429,0.0002339156,0.02162421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008713147,"threshold_uncertainty_score":0.0291484,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yo-Sub Han","is_ca":false},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01509453296345085,"gpt":0.2619686901403702,"spread":0.2468741571769193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00179733,0.0005340814,0.001456983,0.001210077,0.001447567,0.006524659,0.001957416,0.001666862,0.01002472],"category_scores_gemma":[0.01590323,0.000764378,0.001430165,0.001680075,0.002756045,0.01331641,0.002565832,0.002800237,0.0006607213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002353061,"about_ca_system_score_gemma":0.002054681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002193313,"about_ca_topic_score_gemma":0.002419237,"domain_scores_codex":[0.9974954,0.0004793327,0.0002154587,0.0004397656,0.0007694227,0.0006005297],"domain_scores_gemma":[0.9609974,0.0316106,0.001770742,0.002777135,0.001592235,0.001251771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002016346,0.0003959902,0.006099879,0.0002737407,0.0000870497,0.0003048705,0.001953715,0.07114,0.01240842,0.87819,0.002811559,0.02431835],"study_design_scores_gemma":[0.0001008877,0.0001143825,0.001518029,0.00001619871,0.00005461707,0.0001002858,0.0002429295,0.2048938,0.005347736,0.7869834,0.0005775558,0.00005019684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9209095,0.0002011775,0.06808453,0.0008173691,0.00003195988,0.00006497258,0.000865517,0.0004337119,0.008591223],"genre_scores_gemma":[0.9903054,0.0001167331,0.006364046,0.00004809711,0.00005279563,0.00005635474,0.0006121635,0.00008749353,0.002356843],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01002472,"threshold_uncertainty_score":0.03353608,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","authors":[{"name":"Christophe Hohlweg","is_ca":true},{"name":"Christophe Reutenauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007157902298393804,"gpt":0.231608064031918,"spread":0.2244501617335242,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009162906,0.0006057564,0.0008325363,0.00185236,0.001987948,0.0040728,0.0007616252,0.001879917,0.007358905],"category_scores_gemma":[0.003689258,0.0005200595,0.0005612895,0.003735679,0.005634122,0.007898853,0.001651305,0.001860715,0.00108307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001279251,"about_ca_system_score_gemma":0.0007799296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001726519,"about_ca_topic_score_gemma":0.002207612,"domain_scores_codex":[0.9992312,0.0002705014,0.00005301413,0.0001781361,0.000165265,0.0001019268],"domain_scores_gemma":[0.9984919,0.0009892004,0.0001772376,0.0001339871,0.0001006239,0.0001071178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003505582,0.000009497719,0.0001928596,0.00005519085,0.000003588727,0.00006794446,0.0005523069,0.0005088541,0.0004198963,0.9868663,0.001564564,0.009723861],"study_design_scores_gemma":[0.000005838652,0.000006470705,0.00008029491,0.00001020693,0.000003918278,0.00006639754,0.000105301,0.0005767794,0.00008897742,0.9937536,0.005295794,0.000006429112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3643395,0.05897049,0.3359802,0.01243189,0.002105219,0.000111399,0.0009752157,0.0007714992,0.2243146],"genre_scores_gemma":[0.9043967,0.01089822,0.0320884,0.0009005935,0.001498947,0.0001465328,0.0006425268,0.00009884659,0.0493294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007358905,"threshold_uncertainty_score":0.02461803,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Mathematics; Psychology; Artificial intelligence","authors":[{"name":"James D. Currie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00609221224695569,"gpt":0.2281018574035141,"spread":0.2220096451565584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001953447,0.0004545661,0.0008621534,0.00200496,0.002541463,0.006234679,0.002096038,0.001991692,0.005212737],"category_scores_gemma":[0.0060873,0.0004455073,0.0007108465,0.003020343,0.0108696,0.01191479,0.003480967,0.003261338,0.0005773715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00196483,"about_ca_system_score_gemma":0.0008028915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00089866,"about_ca_topic_score_gemma":0.0008077141,"domain_scores_codex":[0.9984519,0.000429171,0.0001064914,0.000444767,0.0004058623,0.0001617355],"domain_scores_gemma":[0.9968895,0.001654078,0.0002192827,0.0005987383,0.0004219745,0.0002163567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009564759,0.000009621334,0.0001587983,0.00003279862,0.00000414814,0.00002790634,0.0005072041,0.000353164,0.0001840803,0.9906272,0.0008946536,0.007190986],"study_design_scores_gemma":[0.000004265978,0.000005192261,0.0001290057,0.00001180483,0.000003007674,0.00007790417,0.000235573,0.000944102,0.00009227794,0.9924379,0.006053087,0.000005932158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2054491,0.04752266,0.4573059,0.0332859,0.001419728,0.0001128982,0.000433667,0.0005730271,0.253897],"genre_scores_gemma":[0.9119684,0.01237663,0.05239311,0.001433376,0.001539181,0.0001936307,0.0002252653,0.0002299469,0.01964049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006234679,"threshold_uncertainty_score":0.01743829,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Birgit Jenner","is_ca":false},{"name":"Johannes Köbler","is_ca":false},{"name":"Pierre McKenzie","is_ca":true},{"name":"Jacobo Torán","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02881157589070679,"gpt":0.249631771147468,"spread":0.2208201952567612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005856978,0.00170898,0.003404589,0.004954451,0.007931065,0.008246262,0.004609533,0.004211517,0.01832318],"category_scores_gemma":[0.02216072,0.003276238,0.006268322,0.006281532,0.009616517,0.04374237,0.009717498,0.01580021,0.002767075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002147946,"about_ca_system_score_gemma":0.003147337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003158746,"about_ca_topic_score_gemma":0.003113522,"domain_scores_codex":[0.9937413,0.001729977,0.0004991689,0.00179951,0.001450438,0.0007795022],"domain_scores_gemma":[0.9524364,0.03285274,0.001092056,0.006973485,0.004747678,0.001897649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001392236,0.0001600485,0.0007373889,0.0002691941,0.00009049124,0.0001226445,0.001161751,0.001808417,0.0007591718,0.976004,0.006977018,0.01177054],"study_design_scores_gemma":[0.00002234416,0.00001106556,0.0001470396,0.00001286552,0.00004064583,0.00006761689,0.0001074273,0.002197075,0.0005125512,0.9946695,0.002195816,0.00001617949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1419553,0.002813536,0.6797259,0.01786002,0.0008702619,0.0005215972,0.00462721,0.002730296,0.1488959],"genre_scores_gemma":[0.7805052,0.003519563,0.1595937,0.004484997,0.002039745,0.0009844473,0.009099137,0.001805075,0.03796816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01832318,"threshold_uncertainty_score":0.06129718,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Olexandr Ganyushkin","is_ca":false},{"name":"Volodymyr Mazorchuk","is_ca":false},{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0136250332330557,"gpt":0.2586210798826071,"spread":0.2449960466495514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001330543,0.0004852014,0.0004358416,0.001284728,0.001097008,0.00191738,0.0004920519,0.0006026007,0.002316796],"category_scores_gemma":[0.002681815,0.000288801,0.0007630083,0.0007873552,0.004606429,0.003946175,0.002042626,0.00173796,0.0004083897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001056149,"about_ca_system_score_gemma":0.000578536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005662285,"about_ca_topic_score_gemma":0.0002778844,"domain_scores_codex":[0.9993876,0.0001982196,0.00003322669,0.0001200302,0.0001548199,0.0001060436],"domain_scores_gemma":[0.9991614,0.0004146484,0.00007005795,0.000154641,0.0001063121,0.00009291161],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006501396,0.000003894524,0.00003917831,0.000007926546,0.000001142912,0.00002267611,0.000218351,0.0002568219,0.0003746623,0.9968895,0.0001637307,0.002015563],"study_design_scores_gemma":[0.000004539389,0.00001188373,0.00008223367,0.0000112386,0.000002785996,0.00005783853,0.00004530673,0.001306993,0.0004641495,0.9934945,0.004512847,0.000005878917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.425035,0.006351389,0.3371238,0.003754675,0.0006411927,0.00007459596,0.0002665278,0.0003401794,0.2264126],"genre_scores_gemma":[0.9498489,0.001711894,0.03011673,0.0003676166,0.0005902244,0.00004642775,0.0001372015,0.0000713551,0.01710959],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002316796,"threshold_uncertainty_score":0.007750452,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Fredrick Arnold","is_ca":true},{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004610918180651434,"gpt":0.2074310921395586,"spread":0.2028201739589072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040223,0.0007159966,0.001100501,0.00190368,0.001843249,0.003163574,0.0007773219,0.001458053,0.01053341],"category_scores_gemma":[0.00278532,0.000489029,0.0008149756,0.002544143,0.005522648,0.007156843,0.002674568,0.002700176,0.001431846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001101464,"about_ca_system_score_gemma":0.0006960999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005253214,"about_ca_topic_score_gemma":0.0003691173,"domain_scores_codex":[0.9989223,0.0003655272,0.00006721928,0.0003245245,0.0002034574,0.0001169633],"domain_scores_gemma":[0.9977911,0.001362396,0.0001681013,0.000338285,0.0001808293,0.000159431],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008535042,0.000006361211,0.0000437204,0.00001739408,0.000002448402,0.00002109399,0.0002117059,0.0002841388,0.0001896565,0.9958575,0.0006426835,0.002714659],"study_design_scores_gemma":[0.000005224056,0.000005525966,0.00002394519,0.000004674911,0.000003152254,0.00002406109,0.00004575635,0.0007424956,0.0001222007,0.9954689,0.003551126,0.000002914524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2118795,0.0173582,0.5005787,0.01349307,0.002910718,0.0001671819,0.0005314404,0.001145883,0.2519352],"genre_scores_gemma":[0.9168092,0.004089545,0.02929823,0.0009360061,0.001981005,0.0002216666,0.0004024584,0.0001839169,0.04607794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01053341,"threshold_uncertainty_score":0.03523779,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Morteza Mohammad-Noori","is_ca":false},{"name":"James D. Currie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00414040258297324,"gpt":0.1786910934205255,"spread":0.1745506908375522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001820548,0.0008047382,0.001576888,0.001964695,0.005162189,0.003489655,0.001418316,0.003714751,0.01148304],"category_scores_gemma":[0.006143414,0.000787481,0.001355664,0.002253833,0.006910946,0.01129159,0.003559091,0.003963433,0.001369278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002068095,"about_ca_system_score_gemma":0.0008588585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002266249,"about_ca_topic_score_gemma":0.002714845,"domain_scores_codex":[0.9987986,0.0003113012,0.00007010549,0.0003420873,0.0002198057,0.0002581216],"domain_scores_gemma":[0.9970151,0.001778534,0.0001697358,0.0004528162,0.0003589563,0.000224905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004320101,0.0000146459,0.0001541562,0.00002141225,0.00000470024,0.00005823508,0.0002416458,0.0003327723,0.0001330786,0.9948992,0.002054821,0.002042112],"study_design_scores_gemma":[0.00001020215,0.000004486222,0.0000824141,0.000004665595,0.000003149808,0.00003333802,0.00005630899,0.000545606,0.00006877601,0.9968448,0.002340211,0.000005930703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.438769,0.003796401,0.08683373,0.0370162,0.002338071,0.00006335269,0.0006831082,0.0005597706,0.4299403],"genre_scores_gemma":[0.9521302,0.0007216901,0.01120913,0.002815609,0.0009741939,0.00008596045,0.0004475586,0.00009262704,0.03152296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01148304,"threshold_uncertainty_score":0.0384146,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Word (group theory); Simple (philosophy); Scroll; Mathematics; Computer science; Theology; Philosophy; Geometry","authors":[{"name":"Lucian Ilie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01523654024083817,"gpt":0.2316709412900469,"spread":0.2164344010492087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001646239,0.001283491,0.0007974678,0.0007116178,0.002453503,0.002061903,0.001321046,0.001354873,0.04713961],"category_scores_gemma":[0.006122123,0.0008209007,0.002700454,0.0007416133,0.002835738,0.006208493,0.004886511,0.003278025,0.0145945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00099844,"about_ca_system_score_gemma":0.001951743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001493605,"about_ca_topic_score_gemma":0.003245684,"domain_scores_codex":[0.9983991,0.0002484345,0.0001568591,0.0005393938,0.0004700461,0.0001862283],"domain_scores_gemma":[0.9949552,0.002151518,0.0003417972,0.0008536972,0.001356051,0.0003416476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005666144,0.0003766718,0.001699476,0.001475648,0.0001986085,0.001785485,0.002551634,0.001389036,0.05913178,0.6622698,0.1519082,0.1166469],"study_design_scores_gemma":[0.0001769597,0.000278991,0.002156111,0.0002492419,0.0001616904,0.002475864,0.000649762,0.004255858,0.02847569,0.7575288,0.2034468,0.000144224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03068328,0.0008606575,0.7210879,0.01238762,0.004600397,0.000904555,0.003352564,0.003687001,0.2224359],"genre_scores_gemma":[0.4544552,0.001040955,0.3638878,0.00836513,0.002069672,0.00104051,0.003583799,0.001360967,0.1641959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04713961,"threshold_uncertainty_score":0.1576977,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Galina Jirásková","is_ca":false},{"name":"Chenglong Zou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02442731279508152,"gpt":0.2479190127007407,"spread":0.2234916999056592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001699195,0.0006749138,0.001434543,0.002188575,0.001780798,0.00602391,0.001924048,0.00114501,0.00910635],"category_scores_gemma":[0.008268035,0.0004948904,0.001388275,0.00189536,0.004562197,0.01630747,0.00332341,0.003919006,0.0005316997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003602619,"about_ca_system_score_gemma":0.001149795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00224263,"about_ca_topic_score_gemma":0.001339143,"domain_scores_codex":[0.9976497,0.0006245903,0.0001432817,0.0004355269,0.0008154596,0.0003313573],"domain_scores_gemma":[0.9925992,0.005041363,0.0003533943,0.0006538259,0.0007293176,0.0006228182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003711844,0.0000149038,0.0002420385,0.00002400284,0.000006457863,0.00003075361,0.0002606743,0.0009822876,0.00025551,0.9955984,0.0004324141,0.0021154],"study_design_scores_gemma":[0.000007987701,0.000004875739,0.0001015279,0.000003170991,0.000004726178,0.00002127999,0.00003510077,0.004811764,0.0001602015,0.9942075,0.0006367349,0.000005080285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5508351,0.002960683,0.3051485,0.008036699,0.0003066286,0.00009697003,0.0009273144,0.0005535056,0.1311344],"genre_scores_gemma":[0.9770799,0.0005510002,0.0103908,0.0002482936,0.0003157193,0.00008974211,0.0004616666,0.00008979776,0.01077293],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00910635,"threshold_uncertainty_score":0.03046376,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Mark Kambites","is_ca":false},{"name":"Pedro V. Silva","is_ca":false},{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009193522760611693,"gpt":0.2132131024672273,"spread":0.2040195797066156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003312712,0.000905205,0.002948528,0.001547458,0.003414948,0.006887977,0.001949101,0.003830278,0.01382967],"category_scores_gemma":[0.01325551,0.0009072566,0.001715388,0.002611351,0.006305016,0.0219959,0.004081188,0.004872259,0.001141431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002269457,"about_ca_system_score_gemma":0.001210126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001918348,"about_ca_topic_score_gemma":0.001565389,"domain_scores_codex":[0.9981118,0.0007540946,0.0001260435,0.000367201,0.0003307157,0.0003101564],"domain_scores_gemma":[0.9871469,0.01105525,0.0002997345,0.0007108212,0.0003687669,0.0004186037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001822003,0.00006232665,0.0003708201,0.0001248906,0.00002481472,0.0001230065,0.0005850073,0.004259087,0.0003944402,0.9766797,0.006438719,0.01075514],"study_design_scores_gemma":[0.00002954515,0.000008903397,0.00006236489,0.00001594933,0.000008291989,0.00003828977,0.0002018839,0.005788612,0.0001377493,0.9917879,0.001913,0.000007682685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4030577,0.007040416,0.3746838,0.05101499,0.001025593,0.0002083349,0.0009014087,0.0007209629,0.1613468],"genre_scores_gemma":[0.9100628,0.003712878,0.0550213,0.001649964,0.001382946,0.0001650336,0.001382673,0.0003201449,0.02630223],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01382967,"threshold_uncertainty_score":0.04626489,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Filippo Bonchi","is_ca":false},{"name":"Marcello Bonsangue","is_ca":false},{"name":"Helle Hvid Hansen","is_ca":false},{"name":"Prakash Panangaden","is_ca":true},{"name":"Jan Rutten","is_ca":false},{"name":"Alexandra Silva","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01645680513454797,"gpt":0.2515546325590415,"spread":0.2350978274244935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008469889,0.0004448334,0.0006271465,0.0006329924,0.0006316231,0.001200068,0.002087863,0.0007569004,0.006072032],"category_scores_gemma":[0.002104144,0.0004236725,0.0008213941,0.0006580192,0.001027244,0.00249036,0.00173137,0.001340618,0.001378752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00113688,"about_ca_system_score_gemma":0.001425635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002326424,"about_ca_topic_score_gemma":0.004450927,"domain_scores_codex":[0.9993342,0.0001159349,0.00006109598,0.0001970101,0.0002048864,0.00008687739],"domain_scores_gemma":[0.9997185,0.0001169391,0.00001594652,0.00006222696,0.00006878142,0.00001764069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001453651,0.00009975469,0.0005219424,0.0001734648,0.0000402713,0.00007342505,0.0002893094,0.04189232,0.01099937,0.8141315,0.003689154,0.1279441],"study_design_scores_gemma":[0.00006286461,0.00006559878,0.0002545308,0.00003379571,0.00004234536,0.00009470932,0.00008795618,0.2725425,0.01684557,0.695824,0.0141107,0.00003553551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01088107,0.00007986724,0.9825283,0.0002303415,0.00004433951,0.00005023463,0.00007707585,0.0005689,0.005539757],"genre_scores_gemma":[0.1954401,0.0001745645,0.7928756,0.0002155423,0.00003386521,0.0002579045,0.0002873442,0.0004868805,0.01022809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006072032,"threshold_uncertainty_score":0.02031302,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Valérie Berthé","is_ca":false},{"name":"Clelia De Felice","is_ca":false},{"name":"Francesco Dolce","is_ca":false},{"name":"Julien Leroy","is_ca":false},{"name":"Dominique Perrin","is_ca":false},{"name":"Christophe Reutenauer","is_ca":true},{"name":"Giuseppina Rindone","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01175038979836887,"gpt":0.2496250604831532,"spread":0.2378746706847844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007654531,0.0006158078,0.0006110205,0.002901807,0.00210535,0.004020525,0.001018253,0.001602752,0.008008561],"category_scores_gemma":[0.006385936,0.0008508936,0.0008117746,0.003114153,0.002662219,0.005719602,0.001785642,0.001778041,0.000866916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001124045,"about_ca_system_score_gemma":0.0007339813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001685667,"about_ca_topic_score_gemma":0.002071723,"domain_scores_codex":[0.9989812,0.0001963921,0.00009673198,0.0002836343,0.0003202024,0.0001218691],"domain_scores_gemma":[0.994065,0.004265153,0.0004528923,0.0004119046,0.0004348635,0.0003702227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005554536,0.00002665431,0.0005784456,0.00007604455,0.00001340979,0.0001887137,0.0006620697,0.002526113,0.0012263,0.9848953,0.001635563,0.008115879],"study_design_scores_gemma":[0.00001291765,0.00000978196,0.0003671683,0.00001776286,0.00001473888,0.0002600283,0.0001592664,0.004940264,0.0004426159,0.9890726,0.00469198,0.00001086138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4955404,0.002930098,0.3907333,0.002338244,0.0002629684,0.0001335409,0.003494625,0.0009211974,0.1036457],"genre_scores_gemma":[0.895177,0.001685972,0.06367879,0.0004947805,0.0003291462,0.0002725339,0.003072508,0.0002402369,0.0350491],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008008561,"threshold_uncertainty_score":0.02679133,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yuan Gao","is_ca":true},{"name":"Kai Salomaa","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03127157510158429,"gpt":0.2525004377000977,"spread":0.2212288625985134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001764768,0.0007114764,0.001034591,0.001504419,0.0012569,0.004792007,0.001314366,0.001151546,0.007220926],"category_scores_gemma":[0.01573914,0.0005032758,0.001499151,0.001205168,0.002907128,0.009193416,0.002868444,0.002601041,0.0005212615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002065208,"about_ca_system_score_gemma":0.001488786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219875,"about_ca_topic_score_gemma":0.001344206,"domain_scores_codex":[0.9973481,0.00054674,0.0001800337,0.0005750495,0.0007312897,0.000618826],"domain_scores_gemma":[0.9704279,0.02357109,0.001792229,0.002102897,0.001288797,0.0008170827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001092769,0.0001852204,0.004525646,0.0003959134,0.0001042159,0.0003889073,0.0007759368,0.08077283,0.01320287,0.8543055,0.002042552,0.04220755],"study_design_scores_gemma":[0.00004370589,0.0002938729,0.001757622,0.00005042987,0.000128408,0.0003988694,0.0003416472,0.308711,0.01366359,0.6717713,0.002739167,0.0001003463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6852477,0.0009968358,0.2845443,0.001104775,0.000144939,0.0001536757,0.0005546031,0.0005328119,0.02672042],"genre_scores_gemma":[0.9692367,0.0004554435,0.0258992,0.0000657425,0.00008764075,0.0001351717,0.0003886023,0.0001335091,0.003597996],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007220926,"threshold_uncertainty_score":0.02415639,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michael Benedikt","is_ca":false},{"name":"Leonid Libkin","is_ca":true},{"name":"Thomas Schwentick","is_ca":false},{"name":"Luc Segoufin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007487091163718904,"gpt":0.2248419636290246,"spread":0.2173548724653057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003686951,0.0007011025,0.0008069732,0.001573977,0.001483144,0.006055765,0.002357538,0.001847663,0.006157507],"category_scores_gemma":[0.01445242,0.0006612833,0.002116705,0.002482676,0.005977697,0.01745045,0.002388905,0.003779812,0.0007271271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003678406,"about_ca_system_score_gemma":0.001624068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003111702,"about_ca_topic_score_gemma":0.001602485,"domain_scores_codex":[0.994727,0.001428077,0.0004018471,0.001105489,0.001731508,0.0006060692],"domain_scores_gemma":[0.9848241,0.01100934,0.001264074,0.001512904,0.0009208349,0.0004687291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001822316,0.00002699559,0.000150495,0.00003871531,0.000005399083,0.00005484898,0.0002709059,0.002815193,0.0007319785,0.9925715,0.0002422591,0.0030734],"study_design_scores_gemma":[0.00001291627,0.00002438549,0.0000877371,0.00001189205,0.000008849748,0.00009354309,0.00008419974,0.02095069,0.001126426,0.9744716,0.003114639,0.00001313201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1265285,0.001398241,0.8399268,0.003419395,0.000129227,0.0001848982,0.0005415824,0.001170344,0.02670101],"genre_scores_gemma":[0.7647955,0.001391675,0.2216718,0.001076671,0.0004099603,0.0003426604,0.000772805,0.0002596965,0.009279211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006157507,"threshold_uncertainty_score":0.02668887,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786516640","doi":"10.1142/s0129054113400133","title":"IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Regular language; Combinatorics; Concatenation (mathematics); State (computer science); Quotient; Alphabet; Permutation (music); Discrete mathematics; Integer (computer science); Binary logarithm; Automaton; Algorithm; Computer science; Physics","authors":[{"name":"Janusz Brzozowski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02001200027157618,"gpt":0.3211004986114298,"spread":0.3010884983398536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001866657,0.0007884946,0.001219034,0.002279284,0.0007150092,0.003333818,0.001083364,0.0008816142,0.003002575],"category_scores_gemma":[0.0115194,0.0007697021,0.00138356,0.001988752,0.001612241,0.004411703,0.001857539,0.001303066,0.0008935669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009645471,"about_ca_system_score_gemma":0.001172531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006855727,"about_ca_topic_score_gemma":0.0007644857,"domain_scores_codex":[0.9979324,0.0005036138,0.0001505986,0.0005805328,0.0006518752,0.0001809005],"domain_scores_gemma":[0.9924743,0.004991744,0.0009450942,0.000808412,0.0005649064,0.0002155219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002001089,0.0003361681,0.02072025,0.002984109,0.0004596819,0.002527007,0.002365127,0.1364291,0.04960427,0.4663493,0.00862449,0.3075994],"study_design_scores_gemma":[0.0001087758,0.0003859713,0.002437828,0.0001738336,0.000142439,0.001454511,0.000944577,0.4785227,0.01619657,0.4777402,0.02181,0.00008248621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2255992,0.001547799,0.7609836,0.0008504508,0.00006696692,0.0002515362,0.000882489,0.001278253,0.008539733],"genre_scores_gemma":[0.5550705,0.0013457,0.4327017,0.0003500005,0.0002428569,0.0004005947,0.002603388,0.000391908,0.006893323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003333818,"threshold_uncertainty_score":0.01004463,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michael Albert","is_ca":false},{"name":"Murray Elder","is_ca":false},{"name":"Andrew Rechnitzer","is_ca":false},{"name":"P. Westcott","is_ca":false},{"name":"Mike Zabrocki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009003227470727602,"gpt":0.2391318660253993,"spread":0.2301286385546717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002329527,0.0006395351,0.001711605,0.001970087,0.005662748,0.00447611,0.001679853,0.003273329,0.008380382],"category_scores_gemma":[0.01037668,0.00070045,0.001614222,0.0021418,0.00638191,0.008259844,0.003577356,0.004763096,0.001413222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001774054,"about_ca_system_score_gemma":0.001419223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002055216,"about_ca_topic_score_gemma":0.001358343,"domain_scores_codex":[0.9986768,0.0003218333,0.0000682983,0.0003016038,0.0003067463,0.0003246203],"domain_scores_gemma":[0.9954971,0.002611308,0.0003396794,0.0005553553,0.0004786207,0.000517972],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006392227,0.00003029131,0.0002911818,0.00002966406,0.000005681231,0.00009726545,0.0003684332,0.0008624439,0.0004072759,0.9941332,0.001194984,0.002515623],"study_design_scores_gemma":[0.00001478122,0.00001221884,0.0001297966,0.000009212919,0.000004218046,0.00007832865,0.0001071523,0.001762811,0.0001884622,0.9963344,0.001346068,0.00001255331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7261763,0.001788877,0.06850599,0.01111595,0.0007540183,0.00005994751,0.0003021758,0.0004195591,0.1908772],"genre_scores_gemma":[0.9592828,0.0007768819,0.01174881,0.00123146,0.0005309849,0.00008207637,0.0003183506,0.0001544556,0.02587417],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008380382,"threshold_uncertainty_score":0.02803516,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Kalle Saari","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01167135948446676,"gpt":0.2300102654376719,"spread":0.2183389059532051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006260012,0.0005162359,0.0006253437,0.001316935,0.0009573108,0.00241685,0.000473267,0.0004399002,0.005083234],"category_scores_gemma":[0.003257075,0.000451721,0.0007520384,0.000798945,0.001534783,0.002997166,0.001138454,0.0009830362,0.0007645783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006886297,"about_ca_system_score_gemma":0.0003223305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003186757,"about_ca_topic_score_gemma":0.0003688649,"domain_scores_codex":[0.9993806,0.00009605449,0.00006109742,0.0001848596,0.0001430345,0.0001342897],"domain_scores_gemma":[0.9982166,0.0009511867,0.0003119568,0.0001737346,0.0001807892,0.0001657107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002340312,0.00002942821,0.002084347,0.0001845473,0.00003244273,0.0003775136,0.000778665,0.003072043,0.02050671,0.949335,0.001433463,0.02193183],"study_design_scores_gemma":[0.00004087876,0.000137724,0.00298807,0.00007442152,0.00005485348,0.000976684,0.0003485676,0.0146705,0.01471398,0.9500974,0.01583239,0.0000645618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.722352,0.002141586,0.2068767,0.0004928974,0.0002255098,0.00005991009,0.0007555429,0.0006083836,0.06648745],"genre_scores_gemma":[0.9667641,0.0005142582,0.02676444,0.0001063181,0.0002662794,0.000086144,0.0003496777,0.0001470267,0.005001675],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005083234,"threshold_uncertainty_score":0.01700509,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}