{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002117393,0.000389854,0.0004298798,0.0002104063,0.0002244645,0.000185115,0.002310886,0.0003253586,0.000006091429],"category_scores_gemma":[0.00001242033,0.0004287047,0.0002218797,0.00003350825,0.0002160373,0.0002991828,0.0006295542,0.0004009163,0.00006210085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003303355,"about_ca_system_score_gemma":0.0006220905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002549329,"about_ca_topic_score_gemma":2.763431e-7,"domain_scores_codex":[0.9981673,0.0001559499,0.0002047473,0.000696031,0.0003697698,0.0004062474],"domain_scores_gemma":[0.9981571,0.0001328769,0.0002606576,0.001168508,0.00009192269,0.0001889546],"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.000001406592,0.000007437923,4.638347e-7,0.00007047049,0.00005237275,0.0003337381,0.00004076943,0.000001466671,0.00001207372,0.7834352,0.2125695,0.003475106],"study_design_scores_gemma":[0.0002896325,0.0000419114,0.000007355654,0.0001966815,0.00005942719,0.00007095209,0.00001522313,0.003936941,0.0002852115,0.0003449668,0.9941644,0.0005873058],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00007848102,0.0002314016,0.02327747,0.00001952151,0.0005486322,0.0002690793,0.00004431268,0.0006717629,0.9748594],"genre_scores_gemma":[0.0001620731,0.0000347799,0.002942792,0.0002240811,0.00007034871,9.979519e-7,0.00001650303,0.00002608998,0.9965223],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7830903,"threshold_uncertainty_score":0.9998165,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003444177,0.0001425567,0.0001651167,0.00008337495,0.001074432,0.0002811292,0.003373552,0.00003457067,0.00001757615],"category_scores_gemma":[0.0001845667,0.00008803337,0.00007025162,0.001101017,0.004385062,0.0004818471,0.0009340388,0.0001412458,0.00001767535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003224643,"about_ca_system_score_gemma":0.0001326174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002071462,"about_ca_topic_score_gemma":2.592753e-7,"domain_scores_codex":[0.9978111,0.0001734737,0.0002965047,0.0004808563,0.0006891305,0.0005488676],"domain_scores_gemma":[0.9980484,0.0004313071,0.00009462692,0.0011208,0.000144865,0.0001599877],"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.000001228867,0.00002125532,0.00001565225,0.000002514642,0.000002636933,0.000003173074,0.0002313445,0.00006797411,0.001797286,0.9692131,0.00001922225,0.0286246],"study_design_scores_gemma":[0.0001261935,0.0001453928,0.0001974533,0.00002621384,0.000002594456,0.00005489817,0.00001562626,0.2003952,0.05067858,0.7471231,0.001073825,0.0001610135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06710277,0.0001709264,0.9233615,0.0005763442,0.0006494941,0.0001010314,4.288276e-7,0.000122133,0.00791537],"genre_scores_gemma":[0.9023858,0.000009474594,0.09736092,0.0001847061,0.00003261021,0.00000335261,6.353857e-8,0.000004479934,0.00001859055],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.835283,"threshold_uncertainty_score":0.9983245,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003092063,0.0003195918,0.0003847714,0.0002237562,0.0001572512,0.00008467307,0.001229698,0.0002909254,0.000003198193],"category_scores_gemma":[0.000008449202,0.0003538978,0.00009822175,0.00002489239,0.0002657819,0.0004709415,0.00121026,0.000437614,0.000007492858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001327014,"about_ca_system_score_gemma":0.0002936593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002692812,"about_ca_topic_score_gemma":0.000004385362,"domain_scores_codex":[0.9985016,0.0001466126,0.0001706551,0.0005639832,0.0002127028,0.0004044727],"domain_scores_gemma":[0.9986772,0.0002016302,0.0001575159,0.0007817788,0.00004005905,0.0001418257],"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.0000246326,0.00001958586,0.000003903268,0.00008384993,0.00004457609,0.001441372,0.0003861359,5.951974e-7,0.0000180262,0.9528691,0.03517373,0.009934503],"study_design_scores_gemma":[0.00156959,0.00009600029,0.0006823865,0.0002779035,0.00005446774,0.0003534957,0.0001580813,0.002479966,0.0001980856,0.0002082565,0.9931183,0.000803449],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.003310729,0.0007224564,0.003628631,0.00001121356,0.0001337926,0.0002775952,0.0001348418,0.0003243986,0.9914563],"genre_scores_gemma":[0.003162892,0.0001336088,0.0005191051,0.0001428916,0.00006283703,0.000001096354,0.00002547036,0.00002383718,0.9959283],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9579446,"threshold_uncertainty_score":0.9998913,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001172466,0.0002487354,0.0002314501,0.0001121718,0.0003036556,0.0002106909,0.001795185,0.0002101505,0.000001039054],"category_scores_gemma":[0.000004255532,0.0002504158,0.00008543859,0.00003847909,0.0002775146,0.0002944964,0.001985257,0.0007428696,0.000006825638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007371768,"about_ca_system_score_gemma":0.0003027583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001030787,"about_ca_topic_score_gemma":0.000006084596,"domain_scores_codex":[0.9987686,0.00009417981,0.0001196757,0.0005688942,0.0002368024,0.0002117907],"domain_scores_gemma":[0.9982955,0.00008956827,0.0001996849,0.001080971,0.0002151202,0.0001191765],"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.00002368314,0.00002692151,0.000007788904,0.00004139975,0.00006132512,0.00004455975,0.0002403637,0.00009484398,0.0002283641,0.9958377,0.001697096,0.001695914],"study_design_scores_gemma":[0.001560216,0.0001777342,0.001062268,0.0002411085,0.0001987045,0.0001886371,0.0005462238,0.02034924,0.02051373,0.001288148,0.9519321,0.001941865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.003519479,0.0000301995,0.7371371,0.0001535408,0.0001816393,0.0005692007,0.0001729638,0.0004189932,0.2578169],"genre_scores_gemma":[0.2990864,0.0000499333,0.3257177,0.0005593513,0.0006388411,0.0001424994,0.0005149811,0.00009647635,0.3731937],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9945496,"threshold_uncertainty_score":0.9999948,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004431464,0.0002147026,0.0002921939,0.0001598127,0.00006410101,0.0001057431,0.001190781,0.00005890472,0.000007736204],"category_scores_gemma":[0.00009875111,0.0001833353,0.00006575356,0.0007081701,0.00003845725,0.001100641,0.0001933172,0.0001546512,0.00009365345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005026912,"about_ca_system_score_gemma":0.00001549207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000199285,"about_ca_topic_score_gemma":0.000004628914,"domain_scores_codex":[0.9984552,0.00004095367,0.0003710109,0.0004193876,0.0003083555,0.0004051293],"domain_scores_gemma":[0.998809,0.0001316112,0.0001070166,0.000802154,0.00002322195,0.000127042],"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.000003612035,0.0002957535,0.00004335275,0.00006916686,0.000004497437,0.00001489107,0.004453365,0.001098217,0.0003973057,0.9602575,0.000549884,0.03281246],"study_design_scores_gemma":[0.0003626856,0.0001185369,0.0003566396,0.0001209665,0.000005612909,0.00004457928,0.0004537066,0.1424926,0.0005706415,0.8469334,0.008085603,0.0004550224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0140744,0.0005759099,0.9420643,0.0003909855,0.0001593435,0.0003284024,0.000002495595,0.0002914419,0.04211275],"genre_scores_gemma":[0.1842774,0.0001360834,0.8131328,0.002033873,0.00006366925,0.00003582874,0.000003398359,0.00001614116,0.0003007459],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.170203,"threshold_uncertainty_score":0.7476196,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105399,0.0001072154,0.0001869644,0.0001333851,0.0001243525,0.00005603688,0.001386018,0.00001481564,0.000008838007],"category_scores_gemma":[0.0000681688,0.00008864268,0.0001099455,0.0003557804,0.0000454146,0.0004092082,0.0001750457,0.0002386625,0.0001018855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003128217,"about_ca_system_score_gemma":0.00006369351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.826191e-7,"about_ca_topic_score_gemma":6.861487e-9,"domain_scores_codex":[0.9986449,0.0003204185,0.000402936,0.0001142885,0.0003405096,0.0001769001],"domain_scores_gemma":[0.9989157,0.00008034684,0.0003518108,0.0003447143,0.0001746799,0.0001327128],"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.00004003777,0.0009134642,0.008542565,0.00003609323,0.0001397717,0.02075714,0.00415024,0.0002218126,0.002126905,0.890632,0.0394342,0.03300576],"study_design_scores_gemma":[0.0154396,0.005240466,0.3077445,0.0005541828,0.0001141136,0.0556534,0.0003685566,0.01157911,0.01372298,0.2578592,0.3288181,0.002905833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6839716,0.0008405576,0.2981847,0.0004011765,0.00255275,0.00003742468,4.204285e-7,0.00008985566,0.01392148],"genre_scores_gemma":[0.9963782,0.0001268497,0.002951283,0.0001763769,0.0001171954,9.134688e-8,1.46324e-7,0.00001501433,0.0002348852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6327729,"threshold_uncertainty_score":0.3614743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988560957","doi":"10.1142/s012905410200100x","title":"UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Concatenation (mathematics); Unary operation; Regular language; Intersection (aeronautics); State (computer science); Mathematics; Symbol (formal); Alphabet; Discrete mathematics; Function (biology); Finite-state machine; Connection (principal bundle); Automaton; Combinatorics; Computer science; Algorithm; Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02369577806896057,"gpt":0.2801950661256422,"spread":0.2564992880566816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006767123,0.00008729793,0.0001322754,0.0004668607,0.0001555135,0.0004408195,0.001465638,0.00001673071,0.0000498011],"category_scores_gemma":[0.00006087452,0.00007679475,0.00005443954,0.0004064646,0.0004064534,0.002534981,0.0003156612,0.0001072927,0.00001037375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005660755,"about_ca_system_score_gemma":0.00008977614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001886329,"about_ca_topic_score_gemma":0.000003823117,"domain_scores_codex":[0.9984963,0.00004732483,0.0004357657,0.0001850142,0.0007084411,0.0001271868],"domain_scores_gemma":[0.998478,0.00009830068,0.0002573681,0.0002390115,0.0008395807,0.00008776417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002205008,0.0004566666,0.001185815,0.00001158455,0.0001253593,0.00005660246,0.005051815,0.008758323,0.0113805,0.2549134,0.0009345284,0.7171033],"study_design_scores_gemma":[0.0007349667,0.000331271,0.03034985,0.0000874015,0.00001064862,0.00063873,0.00007886842,0.9426056,0.002690879,0.02115416,0.001124005,0.0001936417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2537917,0.0001771358,0.7431424,0.001402553,0.001201529,0.0000399305,0.000003712067,0.00001979396,0.0002212772],"genre_scores_gemma":[0.867025,0.00004660935,0.1325084,0.0002566651,0.0001223317,7.022726e-7,0.00000112825,0.000002796797,0.00003639206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9338472,"threshold_uncertainty_score":0.4250832,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004181437,0.0002688136,0.0003143267,0.0001742217,0.0004184904,0.0004880263,0.002760198,0.0001472424,0.00002710304],"category_scores_gemma":[0.00005411505,0.0002484622,0.00007503122,0.0005118416,0.0001058119,0.003877193,0.002794545,0.0002178258,0.000140364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001562122,"about_ca_system_score_gemma":0.0003653792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000844984,"about_ca_topic_score_gemma":0.00004426174,"domain_scores_codex":[0.9979772,0.00008153517,0.0002811709,0.0008291875,0.0003533839,0.0004775306],"domain_scores_gemma":[0.9981808,0.00007707997,0.0001687662,0.001138553,0.00006700491,0.000367804],"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.0002747681,0.00047943,0.00008715987,0.000110211,0.0002213262,0.0006605845,0.02238549,0.001846734,0.01567311,0.776288,0.05951975,0.1224534],"study_design_scores_gemma":[0.02485062,0.00126206,0.004801169,0.001795616,0.0001998869,0.0003598535,0.007183351,0.004709738,0.01064677,0.3851541,0.5561827,0.002854059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2376695,0.006266295,0.4743706,0.06372786,0.002903437,0.005206567,0.000140592,0.003648947,0.2060663],"genre_scores_gemma":[0.7619237,0.0009653628,0.1975989,0.002523004,0.0004937344,0.00002106047,0.00006685561,0.0000916137,0.03631575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5242543,"threshold_uncertainty_score":0.9999968,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002019414,0.00005520454,0.00005118402,0.00007914181,0.00008843455,0.0002324979,0.00009912835,0.00002507395,0.000005985386],"category_scores_gemma":[0.00002646253,0.00005102137,0.00001561735,0.000153464,0.00001086445,0.001953847,0.00002715883,0.00003221788,0.00009767753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001001729,"about_ca_system_score_gemma":0.00002189467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000293059,"about_ca_topic_score_gemma":2.483504e-7,"domain_scores_codex":[0.9995511,0.00002910861,0.0001569405,0.00006392269,0.0001150393,0.00008389002],"domain_scores_gemma":[0.9997202,0.00003241027,0.00006646724,0.0001027264,0.00004003298,0.00003822057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.996964e-7,0.000007570055,0.00005519853,0.000008167655,0.00000314703,3.679655e-7,0.0007732029,0.0003314012,0.00001259102,0.5976205,0.0007433203,0.4004436],"study_design_scores_gemma":[0.0006953179,0.00004354256,0.003194215,0.00001030339,0.000002303856,0.00004829923,0.0001550389,0.893082,0.0003512068,0.06465684,0.03760453,0.0001564365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02709728,0.00002548184,0.958279,0.0002398164,0.0001921048,0.00006664002,5.993554e-7,0.0002382742,0.01386086],"genre_scores_gemma":[0.9647955,0.000007779603,0.03433308,0.0008186159,0.000005686275,0.000004472786,0.000008832393,0.000001491174,0.00002459683],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9376982,"threshold_uncertainty_score":0.2241982,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00229663,0.0001968921,0.000219361,0.0001611818,0.0005124065,0.0005292414,0.002959863,0.0000479771,0.0001850768],"category_scores_gemma":[0.0001299204,0.0001590072,0.00007779185,0.001331831,0.003754936,0.0007336222,0.0007098365,0.0001937404,0.0003207526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005069088,"about_ca_system_score_gemma":0.0001307367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000165288,"about_ca_topic_score_gemma":1.886071e-7,"domain_scores_codex":[0.9973189,0.0001980984,0.0002655481,0.0007856686,0.0007067015,0.0007250482],"domain_scores_gemma":[0.9980213,0.0002208614,0.00005926494,0.001223339,0.0001233044,0.0003519332],"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.000001114992,0.00005134463,0.00003964219,0.000002749309,0.000002123075,0.000015461,0.0001528271,0.00001641549,0.0003530816,0.9891718,0.00004471756,0.01014871],"study_design_scores_gemma":[0.0001793349,0.0000990507,0.0008066484,0.00001143879,0.000001872619,0.0001363102,0.00000481185,0.1818199,0.005623507,0.8104509,0.0006232769,0.0002430285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03651332,0.00002922217,0.9418839,0.0005525567,0.0007906695,0.000109522,9.46995e-7,0.0003872848,0.01973257],"genre_scores_gemma":[0.7528226,0.000001477695,0.2462545,0.0008587171,0.00004239865,0.000003322405,2.728363e-7,0.000005791199,0.00001093319],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7163092,"threshold_uncertainty_score":0.9989563,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980577621","doi":"10.1142/s012905410400242x","title":"ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Combinatorics on words; Set (abstract data type); Product (mathematics); Enumeration; Simple (philosophy); Combinatorics; Existential quantification; Discrete mathematics; Word (group theory); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03640076233099542,"gpt":0.301955305417043,"spread":0.2655545430860475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00128672,0.0000868381,0.0001578198,0.0004570236,0.0001123564,0.0001905739,0.004043789,0.00001890352,0.0000214463],"category_scores_gemma":[0.0001758714,0.0000598622,0.0001185734,0.0006146571,0.000921796,0.0009339536,0.0003561817,0.0001420917,0.00000856442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009108692,"about_ca_system_score_gemma":0.0004844705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001736568,"about_ca_topic_score_gemma":0.000002285132,"domain_scores_codex":[0.9980136,0.00004386978,0.0005748803,0.0001473013,0.001094249,0.0001261467],"domain_scores_gemma":[0.9974175,0.0003462192,0.0007314147,0.0003838768,0.001065108,0.00005585931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001036425,0.0001452764,0.00008429526,0.000001831836,0.00003169762,0.000005317605,0.0006497346,0.008763928,0.001845656,0.9743941,0.00004535182,0.01402238],"study_design_scores_gemma":[0.001059328,0.0005105085,0.02051703,0.0003584225,0.000009362366,0.0003063214,0.00004963679,0.05912041,0.02570017,0.8918371,0.0003567259,0.0001749296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3585956,0.00001297536,0.6363704,0.003543126,0.001151195,0.00003795069,0.000002875083,0.000007745337,0.0002780675],"genre_scores_gemma":[0.9106402,0.000007519161,0.0889467,0.0003082253,0.00009085509,5.748906e-7,3.964242e-7,0.000002386929,0.000003101818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5520446,"threshold_uncertainty_score":0.7514433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001923823,0.000125904,0.0002198223,0.0001058346,0.0001477621,0.00007219854,0.002775993,0.00002424594,0.00002943789],"category_scores_gemma":[0.0001365901,0.00007637068,0.00007495566,0.0008339825,0.006155908,0.0002320988,0.0007255087,0.0001236348,0.00001746413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002869053,"about_ca_system_score_gemma":0.00007819841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001679302,"about_ca_topic_score_gemma":4.58066e-7,"domain_scores_codex":[0.9982391,0.0001227407,0.0002842534,0.0003689864,0.00067395,0.0003109816],"domain_scores_gemma":[0.9981025,0.0004408742,0.0001365373,0.001090948,0.000137761,0.00009139721],"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.000006859019,0.00006278033,0.000003489387,0.000008168926,0.000003948789,0.000004388206,0.0007823117,0.0004871474,0.003898061,0.9905009,0.00001996004,0.00422193],"study_design_scores_gemma":[0.0001578647,0.0002063078,0.0005871889,0.00006880288,0.000002036402,0.000008685327,0.00001708642,0.0253466,0.1255782,0.8479343,0.000004775947,0.00008821042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3601982,0.00002094887,0.6369161,0.001397813,0.0001083026,0.000101687,0.000003754652,0.00005624818,0.001196946],"genre_scores_gemma":[0.9362475,0.000002596685,0.06321209,0.0005101979,0.00001736362,0.000001533204,2.270994e-7,0.000004144418,0.000004391817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5760492,"threshold_uncertainty_score":0.9965488,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002190989,0.0001626485,0.0002904573,0.0001673965,0.0002092889,0.0002336754,0.0005653215,0.00008599357,0.00008271622],"category_scores_gemma":[0.0003174026,0.000133585,0.0001309321,0.0002930962,0.0001442716,0.002139018,0.0001846646,0.0002678514,0.00001378385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005358042,"about_ca_system_score_gemma":0.00007433712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001475261,"about_ca_topic_score_gemma":5.311766e-7,"domain_scores_codex":[0.9982697,0.0004769414,0.0004985692,0.0001974248,0.0003387531,0.0002185862],"domain_scores_gemma":[0.9982387,0.0006087192,0.0004242888,0.0003815796,0.0002023468,0.0001443517],"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.0002930451,0.00008434226,0.00006322345,0.000005507288,0.00005949918,0.00001843848,0.0009753935,0.0000295499,0.001275752,0.9527577,0.001186383,0.0432512],"study_design_scores_gemma":[0.001115993,0.0004262825,0.0003760233,0.00003756999,0.00003633617,0.0006016986,0.0008988946,0.00020967,0.003410579,0.9617262,0.0309825,0.0001781814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6102312,0.004847224,0.3411076,0.005448659,0.01762177,0.0004016895,0.000008812221,0.0003591561,0.01997395],"genre_scores_gemma":[0.9926629,0.0001545954,0.004186951,0.0002734553,0.001324937,0.000003920542,9.702038e-7,0.0000159732,0.001376265],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3824318,"threshold_uncertainty_score":0.5447439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083735143","doi":"10.1142/s012905410300214x","title":"A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Queen's University; University of Prince Edward Island","funders":"","keywords":"Regular expression; Regular language; Computer science; Pumping lemma for regular languages; Context-free language; Context (archaeology); Theoretical computer science; Programming language; Artificial intelligence; Automaton; Biology; Rule-based machine translation; Programming paradigm; Fifth-generation programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02637070741872171,"gpt":0.3423945622337794,"spread":0.3160238548150577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001743176,0.00008719952,0.000186606,0.0005686728,0.0001194925,0.000179964,0.002198556,0.00002142869,0.00002101167],"category_scores_gemma":[0.0003485237,0.00007135206,0.00008917927,0.0006029476,0.0002578607,0.003202815,0.0003678169,0.0001283058,0.00000250341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005013187,"about_ca_system_score_gemma":0.0005836465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005422406,"about_ca_topic_score_gemma":0.000001003038,"domain_scores_codex":[0.9975227,0.0001080782,0.0007047938,0.0001794959,0.001323256,0.0001616612],"domain_scores_gemma":[0.9967362,0.0002743884,0.000798884,0.000391433,0.001705232,0.00009387257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004110778,0.003349039,0.002173557,0.000008345903,0.0001787197,0.0000749652,0.005135695,0.004355939,0.01927537,0.9170356,0.0004138038,0.04795779],"study_design_scores_gemma":[0.01357042,0.009559941,0.1004732,0.001198864,0.0001802426,0.007743404,0.004620526,0.4355917,0.175953,0.237117,0.01244483,0.001546853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3509693,0.00001232509,0.6472813,0.0003126385,0.001082198,0.00005732466,7.320129e-7,0.000007524959,0.000276592],"genre_scores_gemma":[0.7733172,0.00000379254,0.2265732,0.00004166742,0.0000532488,0.000001054094,1.578148e-7,0.000002305332,0.000007349495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6799187,"threshold_uncertainty_score":0.40855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008886337,0.0000923079,0.0001120174,0.00007197296,0.0006418093,0.0002284727,0.0005690077,0.00002788222,0.000003134219],"category_scores_gemma":[0.0001754883,0.00005844015,0.00004899755,0.0002247747,0.00007551815,0.0001533137,0.00015386,0.0002292147,0.000006588543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002044855,"about_ca_system_score_gemma":0.00001979299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001003344,"about_ca_topic_score_gemma":3.361247e-7,"domain_scores_codex":[0.9989191,0.0001031732,0.000291723,0.0001603045,0.0002823675,0.0002433623],"domain_scores_gemma":[0.9990555,0.0003493105,0.0002485718,0.00021397,0.00006506935,0.0000675827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002267501,0.0002709052,0.0008264873,0.00006487774,0.00004760146,0.00006215707,0.004542011,0.004651112,0.002840043,0.2048143,0.00630003,0.7755578],"study_design_scores_gemma":[0.0003675537,0.0003133189,0.003375367,0.0002544956,0.0000045541,0.000640563,0.0001245207,0.9855584,0.0009643945,0.006467827,0.001780749,0.000148254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7292856,0.005335193,0.2578576,0.002768347,0.0009110674,0.0001435533,5.290106e-7,0.0001199176,0.00357818],"genre_scores_gemma":[0.9956006,0.0001432079,0.003893848,0.0001589593,0.0001517552,2.620022e-7,5.185373e-8,0.000005049134,0.00004623051],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9809073,"threshold_uncertainty_score":0.4936343,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002423106,0.0001208069,0.000170415,0.00009282395,0.0002181753,0.00004013558,0.0001767759,0.00004113287,0.000008318299],"category_scores_gemma":[0.0000886089,0.0001027417,0.00002251388,0.0001585991,0.0001357399,0.00123723,0.0002057088,0.00009174448,0.000005899255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001380686,"about_ca_system_score_gemma":0.000008014988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002934827,"about_ca_topic_score_gemma":0.000004932772,"domain_scores_codex":[0.9991927,0.00003552506,0.0002322256,0.0002385774,0.0001315323,0.0001694087],"domain_scores_gemma":[0.9990718,0.0004567509,0.00009641217,0.0003107324,0.00002343527,0.00004086569],"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.00001397319,0.0002094158,0.004775105,0.0001837354,0.00001993674,0.00003245211,0.02743255,0.00007339432,0.00122842,0.845028,0.00009529466,0.1209077],"study_design_scores_gemma":[0.0008826157,0.0001160621,0.01282021,0.0001803056,0.00001375895,0.0004744433,0.003212629,0.08393472,0.001543689,0.8928415,0.003535634,0.000444418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7613825,0.002418458,0.2321034,0.0001300141,0.000172359,0.0002073252,0.000004032475,0.00014937,0.003432515],"genre_scores_gemma":[0.9285338,0.002252487,0.06739808,0.0001710665,0.00005340423,0.00004558065,0.000003841258,0.00001396964,0.001527797],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1671513,"threshold_uncertainty_score":0.4189683,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004251467,0.0002069486,0.0001792841,0.0001115769,0.0008608213,0.0002822262,0.001035566,0.00005796775,0.0001156383],"category_scores_gemma":[0.000002028346,0.0001624002,0.0001222692,0.0005881494,0.00006335358,0.0002971379,0.000008626394,0.0003687377,0.0006707277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001062514,"about_ca_system_score_gemma":0.00004418847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008757124,"about_ca_topic_score_gemma":0.00001691074,"domain_scores_codex":[0.9982569,0.000209657,0.0002563249,0.0004628752,0.0003446393,0.0004696067],"domain_scores_gemma":[0.998853,0.0002075046,0.00004819894,0.0006879341,0.00004383659,0.0001595853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007547553,0.0001648149,0.000001566177,0.000003580487,0.00003847592,0.000005360863,0.001303542,0.4656299,0.0002379421,0.001541073,0.003076217,0.52799],"study_design_scores_gemma":[0.0006023038,0.0004555811,0.0002243889,0.0001054606,0.00002569651,0.0001102332,0.00008130094,0.9340823,0.001915858,0.0006573726,0.06125674,0.0004827111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00683424,0.00001155686,0.9854761,0.004696338,0.0008038623,0.0003636419,0.00000868964,0.0008025006,0.001003078],"genre_scores_gemma":[0.9526874,0.00001625624,0.04443141,0.00172113,0.0000681624,0.00008620055,0.000001077452,0.00001774272,0.0009706391],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9458531,"threshold_uncertainty_score":0.8621072,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003049233,0.0001417626,0.0002136406,0.0002038854,0.000320406,0.0001988184,0.002500884,0.00002959613,0.00004122468],"category_scores_gemma":[0.00006453324,0.0001156642,0.00006012397,0.001260939,0.005257633,0.0006071354,0.0009846165,0.0001359135,0.0000394046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003669326,"about_ca_system_score_gemma":0.0001032026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001057412,"about_ca_topic_score_gemma":0.000003448245,"domain_scores_codex":[0.9979126,0.00006900405,0.0003924806,0.0004758928,0.0006222273,0.0005277745],"domain_scores_gemma":[0.9983377,0.0002449325,0.00005867234,0.0008691497,0.0002465429,0.0002429604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007947692,0.00008249321,0.00004508792,0.000004007342,0.000002737931,0.000006588264,0.000432065,0.0001687269,0.003510064,0.9760783,0.00001266397,0.01964937],"study_design_scores_gemma":[0.0002235758,0.0002010073,0.004684904,0.00001580476,0.000001736867,0.00001652287,0.000007326389,0.4982521,0.04057647,0.4558494,0.00001881505,0.0001523132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1967539,0.000009147967,0.8000614,0.0004198877,0.0003495873,0.0001071965,0.000002138135,0.0001558395,0.002140905],"genre_scores_gemma":[0.7629954,0.000001042315,0.2366159,0.0003457542,0.00002954592,0.000001005721,6.294954e-7,0.000004017064,0.000006706471],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5662415,"threshold_uncertainty_score":0.9974495,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009576217,0.00004860641,0.00007924085,0.00002582252,0.00001617943,0.00003618149,0.0002779075,0.00003003429,0.000007021215],"category_scores_gemma":[0.000002529409,0.00003961594,0.00001888472,0.00007750402,0.00001092901,0.0003160624,0.00006030287,0.00002467393,0.00001929207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001366102,"about_ca_system_score_gemma":0.00001165244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006321787,"about_ca_topic_score_gemma":4.458199e-7,"domain_scores_codex":[0.9995239,0.00001670131,0.0001355355,0.0001233744,0.0001102766,0.00009026233],"domain_scores_gemma":[0.9996806,0.00001170907,0.00004562903,0.0002103654,0.00002110788,0.00003055499],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002012759,0.00009254241,0.00003484084,0.00001725441,0.000006838648,4.209147e-7,0.0002519725,0.001990213,0.6182912,0.3575965,0.0008305602,0.02088563],"study_design_scores_gemma":[0.00006724837,0.000008152395,0.00007610121,0.000006817361,8.278997e-7,0.000002957675,0.000003207836,0.9919147,0.007306878,0.0002930135,0.0002693058,0.00005072519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3139063,0.00001417966,0.6848996,0.0002299525,0.00003893858,0.00004015915,0.000005864563,0.00008040216,0.0007846559],"genre_scores_gemma":[0.9917175,0.000003864274,0.007362125,0.0001662981,0.00001256744,0.000003672794,0.00001122829,0.000003226152,0.000719543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9899246,"threshold_uncertainty_score":0.1615491,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00160917,0.00009333878,0.0002282746,0.0001598941,0.0002384977,0.0004782082,0.0004544168,0.00002728391,0.000001277812],"category_scores_gemma":[0.00001154556,0.00006091829,0.00003983407,0.0002691484,0.0001488762,0.000801656,0.00007826765,0.00006703436,9.49865e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001874713,"about_ca_system_score_gemma":0.00007531189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004397205,"about_ca_topic_score_gemma":6.439012e-7,"domain_scores_codex":[0.9989023,0.0001331071,0.0003246325,0.00017024,0.0003122334,0.000157527],"domain_scores_gemma":[0.9992667,0.000174091,0.0002707019,0.0001086735,0.00007434964,0.0001054607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004357337,0.00002907827,0.008999269,0.0001203244,0.00002365062,0.00007335679,0.002367788,0.00006361748,0.00009906599,0.9527311,0.00137928,0.03410906],"study_design_scores_gemma":[0.006538895,0.008446256,0.07851058,0.002601542,0.000229542,0.06400061,0.01408643,0.4300501,0.003381457,0.1228143,0.2656213,0.00371897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4006418,0.008880431,0.5838747,0.0005443615,0.002791549,0.00009526719,4.867827e-7,0.00005590028,0.003115517],"genre_scores_gemma":[0.9504158,0.00004966172,0.04932545,0.00007124713,0.0001103502,4.331754e-7,1.217963e-8,0.000001886275,0.0000251587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8299169,"threshold_uncertainty_score":0.4611373,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00103806,0.0001094307,0.0002690321,0.0001036588,0.00006303789,0.00004472038,0.0008462911,0.00005997788,0.001528763],"category_scores_gemma":[0.0001501899,0.00007671757,0.0001750752,0.0003469557,0.00008883717,0.0006568577,0.00003895067,0.0002577434,0.00003239099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002437456,"about_ca_system_score_gemma":0.0001058073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006010034,"about_ca_topic_score_gemma":0.000004913378,"domain_scores_codex":[0.9986811,0.0002104397,0.000486963,0.0001183607,0.0003213718,0.000181809],"domain_scores_gemma":[0.99835,0.000563365,0.0004718881,0.0003302348,0.0001806487,0.0001038279],"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.002574802,0.003232919,0.01058797,0.0001682567,0.001133107,0.003964684,0.009908964,0.0004404253,0.04445796,0.4840855,0.1521045,0.2873409],"study_design_scores_gemma":[0.006168924,0.001260585,0.05874361,0.001253841,0.0002947807,0.02337908,0.003055088,0.002482839,0.01420476,0.6239898,0.2639233,0.001243468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4640451,0.0004276747,0.525942,0.001611132,0.001506232,0.0001738521,0.0002507463,0.0000934234,0.005949799],"genre_scores_gemma":[0.9931577,0.0001013225,0.005709987,0.0003183718,0.0001501898,0.000001460154,0.000002531875,0.000008175614,0.0005502134],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5291126,"threshold_uncertainty_score":0.999384,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001411338,0.0001775538,0.0003608244,0.0001177849,0.0001341703,0.00006096052,0.002889347,0.00007455754,0.00002739419],"category_scores_gemma":[0.0001039102,0.0001212775,0.0002813306,0.0004149495,0.00006403985,0.0003334704,0.0001776747,0.0004856964,0.000004075478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001701984,"about_ca_system_score_gemma":0.0001219732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003436784,"about_ca_topic_score_gemma":0.000001056801,"domain_scores_codex":[0.9981364,0.000159415,0.0004969581,0.000157482,0.0005058239,0.0005439352],"domain_scores_gemma":[0.9976894,0.0003815762,0.0007724494,0.0008542462,0.0002300906,0.00007222693],"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.00003187917,0.0003273418,0.0004054668,0.00005685428,0.0002349965,0.00002394767,0.00102669,0.00009428849,0.0004675711,0.9873982,0.004669967,0.005262808],"study_design_scores_gemma":[0.00176814,0.001040239,0.000507098,0.0001003019,0.00007079644,0.0002806936,0.0002645572,0.01387437,0.002579047,0.9737142,0.005591516,0.000208989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.426359,0.04720258,0.5182015,0.005131393,0.001422052,0.0004197735,0.000006272639,0.00008588729,0.001171574],"genre_scores_gemma":[0.998369,0.0009263416,0.0001516479,0.0001202865,0.0001218968,0.00000434163,2.211441e-7,0.00002127965,0.0002850133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.57201,"threshold_uncertainty_score":0.5369174,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002937275,0.0001022495,0.0001725514,0.0002117632,0.00006183374,0.00004622481,0.0006240068,0.00002082358,0.00000192856],"category_scores_gemma":[0.00007596759,0.00008608388,0.00005108391,0.0002796174,0.00005723184,0.0003806845,0.00009987254,0.000225159,0.000004098283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003820582,"about_ca_system_score_gemma":0.00002615926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001021369,"about_ca_topic_score_gemma":2.49558e-7,"domain_scores_codex":[0.9987132,0.000249668,0.0004183076,0.0001214275,0.0003407799,0.0001566046],"domain_scores_gemma":[0.9988918,0.0001086632,0.0004321836,0.0002787722,0.0001284187,0.0001601906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00008384487,0.0005253395,0.001576733,0.00002489196,0.00003220313,0.0005775406,0.002742266,0.00006984456,0.004141865,0.9210687,0.0009835572,0.06817321],"study_design_scores_gemma":[0.008941604,0.01578997,0.5179004,0.0008213779,0.00008884332,0.001548012,0.001261827,0.008252328,0.01841514,0.413789,0.0118835,0.001308001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8044008,0.0004379378,0.1921906,0.0000845489,0.0006990794,0.00002942633,3.989277e-7,0.00002169716,0.002135465],"genre_scores_gemma":[0.9975116,0.00004274673,0.002202882,0.000125338,0.00007395655,3.700877e-8,2.562978e-7,0.0000119923,0.00003117699],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5163237,"threshold_uncertainty_score":0.3510399,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001506819,0.000211451,0.0002309924,0.0001799845,0.0004246264,0.0006097996,0.003286829,0.00005907168,0.00006933901],"category_scores_gemma":[0.0001915241,0.0001714478,0.0001036467,0.0009447043,0.001535342,0.0008561254,0.001015378,0.0001213158,0.0002013676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004040587,"about_ca_system_score_gemma":0.0001028816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002026117,"about_ca_topic_score_gemma":1.914381e-7,"domain_scores_codex":[0.9975528,0.00006496729,0.0002729378,0.0007925907,0.0005601638,0.0007565017],"domain_scores_gemma":[0.9976035,0.0008604829,0.00007285747,0.001057976,0.0001438315,0.0002613954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001440204,0.00006331205,0.00003169626,0.000006545579,0.000003567015,0.00001870272,0.0002150439,0.00009821014,0.0006721432,0.9305323,0.00032408,0.06801994],"study_design_scores_gemma":[0.0004370485,0.0002925964,0.0004094237,0.00002530984,0.000004675978,0.00007883849,0.00001152863,0.8375713,0.003818084,0.1538194,0.003249617,0.0002821213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02922505,0.0000495616,0.9620371,0.001565727,0.0005254345,0.0002241961,0.000006470128,0.0005192121,0.005847239],"genre_scores_gemma":[0.8030336,0.000007879313,0.1952347,0.00141621,0.000213682,0.00001617517,0.000001984429,0.00001019614,0.00006560934],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8374731,"threshold_uncertainty_score":0.6991439,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003508482,0.0002229776,0.0003920674,0.0001886687,0.0001485586,0.0001230944,0.001529076,0.00008326391,0.000003943015],"category_scores_gemma":[0.0001423557,0.0001908805,0.0001089672,0.0003164985,0.00009295484,0.0002290188,0.0002797412,0.0001616882,0.0002360228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005271844,"about_ca_system_score_gemma":0.00004569772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001410756,"about_ca_topic_score_gemma":3.327004e-7,"domain_scores_codex":[0.9974395,0.0005424063,0.0007144012,0.0004738432,0.0004388835,0.0003909501],"domain_scores_gemma":[0.9969974,0.001130773,0.0004344606,0.001268754,0.00007329636,0.00009534602],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003634782,0.00009206709,0.000005319902,0.0000427229,0.00002575907,0.000005658167,0.001542194,0.004612152,0.0004723646,0.9538585,0.001529652,0.03777726],"study_design_scores_gemma":[0.001237094,0.0003157291,0.0008357941,0.0006718183,0.000009837233,0.00008259965,0.000220849,0.9559972,0.002736508,0.03214293,0.005328824,0.0004208511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5343831,0.0006139514,0.4358933,0.0008592631,0.002215834,0.0004153698,0.00001540108,0.001636194,0.02396761],"genre_scores_gemma":[0.9961641,0.000003171245,0.002843246,0.0002319097,0.0003689293,0.000002314441,0.000003486922,0.00001937619,0.0003634003],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.951385,"threshold_uncertainty_score":0.7783881,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004151332,0.0001577246,0.0002412859,0.0001878008,0.0002048842,0.0001821686,0.00399438,0.00004345965,0.00006135212],"category_scores_gemma":[0.0002054943,0.000120417,0.00007598566,0.0009792264,0.003284552,0.0005897746,0.001398931,0.0001238806,0.0000877495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001852634,"about_ca_system_score_gemma":0.00006479108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.017009e-7,"about_ca_topic_score_gemma":5.786863e-8,"domain_scores_codex":[0.9977653,0.0002373028,0.0003021041,0.0005819786,0.0006389376,0.0004743951],"domain_scores_gemma":[0.9974782,0.000697205,0.00009751048,0.001380328,0.0001412788,0.0002054396],"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.000003562988,0.00003551892,0.00002197939,0.00000637226,0.000002184247,0.00000129239,0.0001671187,0.00001593875,0.001417531,0.8676618,0.00002631027,0.1306403],"study_design_scores_gemma":[0.0001168939,0.0001266894,0.0006389722,0.00002037815,0.000002280233,0.00001867391,0.00000348299,0.3524771,0.01406677,0.6322647,0.0001382,0.0001258698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0393731,0.0000204183,0.9500754,0.0004046887,0.0004624536,0.00007467416,7.997906e-7,0.0002503319,0.009338075],"genre_scores_gemma":[0.8512846,0.000001440543,0.1480742,0.0005424862,0.00008024972,0.000002193188,2.600588e-7,0.00000599867,0.00000861605],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8119115,"threshold_uncertainty_score":0.9994279,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001392755,0.0004725517,0.0004733469,0.0004415944,0.0002969656,0.0002367914,0.001662986,0.0003706889,0.00001907248],"category_scores_gemma":[0.00001278102,0.0004435248,0.0003063696,0.0003868884,0.000295167,0.0004738447,0.0003519807,0.0005018223,0.0001712032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007242264,"about_ca_system_score_gemma":0.0001985807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002817082,"about_ca_topic_score_gemma":0.000001416379,"domain_scores_codex":[0.9981394,0.00004530906,0.0003199329,0.0006370705,0.0004513298,0.0004069546],"domain_scores_gemma":[0.9980771,0.0001161595,0.0002184922,0.001376024,0.00007272208,0.0001394812],"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.000008987914,0.00004278283,0.00001919774,0.0000317962,0.00004267361,0.0001037853,0.0005247139,0.000002253354,0.000001611719,0.90797,0.08513634,0.006115925],"study_design_scores_gemma":[0.0001538409,0.0002574486,0.0001091024,0.0001389199,0.00001057004,0.00005056804,0.00001892526,0.00006606329,0.0001051435,0.4166597,0.5819226,0.0005071245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0004418119,0.003064253,0.005191564,0.0003372265,0.003247808,0.0003149972,0.00002699019,0.001324528,0.9860508],"genre_scores_gemma":[0.006471887,0.004786159,0.002974702,0.001331265,0.0005435722,0.00008010679,0.0001136993,0.0001399928,0.9835586],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.4967863,"threshold_uncertainty_score":0.9998016,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001618246,0.0002084061,0.0003889628,0.0003276009,0.0001251347,0.0001835844,0.001674565,0.0001253137,0.00005073114],"category_scores_gemma":[0.0005291582,0.0001882862,0.0002110737,0.0005122453,0.0001504883,0.00183928,0.0003998055,0.0004018925,0.000009745196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002099495,"about_ca_system_score_gemma":0.0003078594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000189792,"about_ca_topic_score_gemma":0.000003763467,"domain_scores_codex":[0.9979616,0.0002810582,0.000678625,0.0002281652,0.0005116247,0.0003388616],"domain_scores_gemma":[0.9984447,0.0002890478,0.0004431726,0.0005137648,0.0001634132,0.0001459294],"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.003150994,0.0002758528,0.00003373059,0.00001003547,0.00004501676,0.0003991211,0.001011113,0.00005738287,0.001239714,0.9922506,0.0008150358,0.0007113837],"study_design_scores_gemma":[0.0109524,0.001718689,0.000495674,0.0001366364,0.00001807447,0.0002385934,0.0004136752,0.00001759546,0.007108821,0.976518,0.002104817,0.0002769678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9482509,0.0005239435,0.01072142,0.002995119,0.03455149,0.0001729964,0.000005427883,0.0001150295,0.002663703],"genre_scores_gemma":[0.9950374,0.00007679139,0.003438627,0.00008669975,0.001296768,0.000003858262,0.000001018907,0.0000176073,0.0000412483],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04678651,"threshold_uncertainty_score":0.7678089,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003389106,0.0001043828,0.0001643177,0.0002697112,0.00003765041,0.0001355481,0.0005467817,0.00004121897,0.00001096743],"category_scores_gemma":[0.00002722594,0.00008736652,0.00008551822,0.0001012913,0.0000336424,0.0007133456,0.0001083021,0.0001107291,0.000007217191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004830077,"about_ca_system_score_gemma":0.00003342123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000295502,"about_ca_topic_score_gemma":0.000001217678,"domain_scores_codex":[0.9987248,0.00005888066,0.000464335,0.0001433591,0.0005044935,0.0001041166],"domain_scores_gemma":[0.9989542,0.000167622,0.0004402192,0.0001025496,0.0002760836,0.00005926716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007457103,0.0002060423,0.0002508739,0.000009534238,0.0001394363,0.00003640293,0.001228403,0.004955966,0.003304305,0.7239259,0.00115597,0.2647126],"study_design_scores_gemma":[0.003025405,0.0007013214,0.01843213,0.0003279762,0.00002946632,0.0009249175,0.0001160108,0.6227397,0.008381891,0.342912,0.002058112,0.000351157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6408274,0.0001174547,0.3561606,0.002099011,0.0004937038,0.00002936854,0.000001690866,0.00002215338,0.0002485196],"genre_scores_gemma":[0.9751537,0.00003989147,0.02368766,0.0007789836,0.0003155497,8.080965e-7,0.000003240071,0.000006574133,0.00001361],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6177837,"threshold_uncertainty_score":0.3562703,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001408421,0.0001533775,0.000225514,0.0001757001,0.000308821,0.0003415459,0.001834095,0.00004264034,0.0000261947],"category_scores_gemma":[0.00008138558,0.0001251654,0.00003632142,0.0008273093,0.002605362,0.001164846,0.0004647329,0.0001241252,0.00001072765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002479018,"about_ca_system_score_gemma":0.0001047166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003276813,"about_ca_topic_score_gemma":2.299859e-7,"domain_scores_codex":[0.9980543,0.0001140914,0.0002974573,0.0006061535,0.0005436991,0.00038425],"domain_scores_gemma":[0.9984839,0.0001371258,0.00008822846,0.000895453,0.0001288444,0.0002664772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001410845,0.00005512064,0.00001462603,0.000005507811,9.02727e-7,0.0000110854,0.0003782233,0.000008104656,0.004265521,0.8477492,0.00000401239,0.1475063],"study_design_scores_gemma":[0.0001121369,0.0004118939,0.004358042,0.0000480682,0.000002791306,0.0001537273,0.00000792835,0.5983232,0.005360688,0.3910698,0.000007994084,0.0001437383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5447168,0.00003477831,0.4530858,0.0007930283,0.000112318,0.00009210124,0.000001554464,0.000221527,0.0009421636],"genre_scores_gemma":[0.7992152,0.000005021388,0.2000561,0.000684599,0.00003238347,0.000001414015,4.968316e-7,0.000002881683,0.000001928014],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5983151,"threshold_uncertainty_score":0.9599566,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570053645","doi":"10.1142/s0129054112400448","title":"ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Decidability; Enumeration; Recursively enumerable language; Mathematics; Combinatorics; Class (philosophy); Discrete mathematics; Function (biology); Sequence (biology); Computer science; Biology; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02306499012198243,"gpt":0.278462639676021,"spread":0.2553976495540386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001203883,0.00006694927,0.0001392329,0.0003998544,0.00007930295,0.000188229,0.001282378,0.00001680524,0.000008062646],"category_scores_gemma":[0.0001202744,0.00005179356,0.00004425035,0.0003358425,0.0003707255,0.003670096,0.0002293171,0.00005523771,0.000001916138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004342069,"about_ca_system_score_gemma":0.0002579687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000120036,"about_ca_topic_score_gemma":6.957993e-7,"domain_scores_codex":[0.9985412,0.00003856032,0.0004810204,0.00009677353,0.0007182183,0.0001241757],"domain_scores_gemma":[0.9981824,0.00009410113,0.0005497794,0.0001627254,0.0009412133,0.00006976682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001873251,0.0005637087,0.0186322,0.00006832753,0.00016259,0.000004881341,0.00938771,0.002506475,0.2032661,0.383257,0.0001771719,0.3819551],"study_design_scores_gemma":[0.000862866,0.0004301498,0.0871254,0.0007837439,0.00002709492,0.0009542365,0.0001899837,0.5713896,0.3133016,0.02388675,0.0007227951,0.0003257779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.499198,0.0002012587,0.4994515,0.0003586093,0.0006896254,0.00003195227,5.470461e-7,0.000008560097,0.00005989272],"genre_scores_gemma":[0.8366163,0.00002098155,0.163202,0.00005034659,0.0001018028,8.233233e-7,1.781058e-7,0.000001645632,0.000005912007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5688832,"threshold_uncertainty_score":0.2660731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002057018,0.0001152355,0.0001153177,0.00005801428,0.000183738,0.0001698735,0.0004336373,0.00005782914,0.00005343955],"category_scores_gemma":[0.00002037483,0.00009010233,0.00003889416,0.0001634134,0.0002565012,0.0002642513,0.0001475431,0.0001280847,0.0002950218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001700887,"about_ca_system_score_gemma":0.0000168178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.285293e-7,"about_ca_topic_score_gemma":1.527775e-7,"domain_scores_codex":[0.9992388,0.00001464077,0.0002744691,0.0001206216,0.000154842,0.0001966281],"domain_scores_gemma":[0.9990338,0.0002795826,0.00006466123,0.00046394,0.00002812789,0.0001298648],"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.000001178944,0.00004529587,0.000002071089,0.000008115573,0.000003789432,9.159692e-8,0.0001923646,0.00004843458,0.00001860314,0.914645,0.0008548173,0.08418024],"study_design_scores_gemma":[0.0001965093,0.00004576679,0.00005315882,0.00001297404,0.000005668462,0.00001331621,0.00007989478,0.3142241,0.0003712373,0.6091459,0.07568579,0.0001657413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006741637,0.00005891765,0.9391026,0.002092737,0.0000225605,0.0002174894,0.000008072863,0.0001991219,0.05155685],"genre_scores_gemma":[0.9373593,0.00005770521,0.05960417,0.002682503,0.00009500223,0.0001009512,0.000007063475,0.000007072133,0.00008624723],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9306176,"threshold_uncertainty_score":0.3792007,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002114247,0.0002179408,0.000270573,0.0003369357,0.0002232657,0.0005324039,0.004523253,0.0000537961,0.0000439399],"category_scores_gemma":[0.0001777238,0.0001649822,0.00006142207,0.001434954,0.0007367734,0.0008513307,0.001164917,0.000220477,0.0000294725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001015426,"about_ca_system_score_gemma":0.00008224811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001180553,"about_ca_topic_score_gemma":0.00000560538,"domain_scores_codex":[0.9972956,0.00003489161,0.0004496041,0.0006263118,0.0008204667,0.0007731222],"domain_scores_gemma":[0.9977895,0.0004563608,0.00009364911,0.00135966,0.00007110162,0.0002297524],"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.000002584756,0.00004057209,0.0004318394,0.00001523683,0.00000192094,0.00005260887,0.0007048489,0.0001521111,0.0004202761,0.9341575,0.0002023687,0.06381815],"study_design_scores_gemma":[0.0002043053,0.0000288872,0.01870657,0.00002226759,0.000001002286,0.000116917,0.00001481369,0.175779,0.004108579,0.8006948,0.0001173946,0.0002054511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06610508,0.00005035279,0.9298465,0.0004921433,0.0006414775,0.0001322192,0.000001187301,0.0002334246,0.00249761],"genre_scores_gemma":[0.7569553,7.008875e-7,0.2424859,0.0004470846,0.0000948409,9.814136e-7,2.546793e-7,0.000006169664,0.000008772951],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6908503,"threshold_uncertainty_score":0.8405403,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00125406,0.0001788263,0.0002454411,0.0001909158,0.0003032263,0.0002703997,0.003610773,0.00003391401,0.00003911123],"category_scores_gemma":[0.0001202123,0.0001403183,0.00007313582,0.0009440394,0.002787153,0.0005152381,0.0006524608,0.0001616464,0.00003857333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003704624,"about_ca_system_score_gemma":0.00009048989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006352477,"about_ca_topic_score_gemma":9.94709e-7,"domain_scores_codex":[0.9977987,0.0001364897,0.0003029054,0.0005939807,0.0007103673,0.000457595],"domain_scores_gemma":[0.99777,0.0001654905,0.00005684226,0.001652804,0.0001588242,0.0001961142],"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.000006756129,0.0001208656,0.000005212481,0.000003033605,0.000002225696,0.00001001633,0.000403608,0.0005681486,0.003175422,0.965611,0.00009160969,0.03000215],"study_design_scores_gemma":[0.0002494635,0.0005065933,0.003124386,0.00003727872,0.000002446332,0.00001700142,0.000009239863,0.3457735,0.03513508,0.6149406,0.00002258927,0.0001817355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2122439,0.00002920239,0.7808465,0.003126746,0.0001854811,0.0001389633,0.000007851463,0.0002186308,0.003202721],"genre_scores_gemma":[0.8748524,0.000003051465,0.1236912,0.001378042,0.00005364564,0.000001622272,0.000001176757,0.000004398963,0.00001443122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6626086,"threshold_uncertainty_score":0.9999267,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158179,0.0001420991,0.0001423983,0.0001476913,0.0004527937,0.000530422,0.001106643,0.00003322589,0.00005431369],"category_scores_gemma":[0.0001171878,0.0001132155,0.00003520957,0.0008565207,0.002106342,0.000687151,0.0003947959,0.0001163164,0.00004442532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002304536,"about_ca_system_score_gemma":0.00008056855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001506535,"about_ca_topic_score_gemma":4.88722e-7,"domain_scores_codex":[0.9983041,0.0001176309,0.0001748932,0.000580019,0.0003913534,0.0004319908],"domain_scores_gemma":[0.9987844,0.0002782905,0.00003714122,0.0005897539,0.00006936124,0.0002410457],"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":[8.335003e-7,0.00002559645,0.00006363233,0.000001852789,0.000001551338,0.000006556457,0.0004856518,0.00001805571,0.0004532649,0.9713011,0.00003127664,0.02761056],"study_design_scores_gemma":[0.0001978888,0.0001005535,0.002100328,0.00001590626,0.00000331756,0.000128043,0.00002578473,0.3285806,0.002993361,0.6652718,0.0003667748,0.0002156792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08667138,0.00008140658,0.9039443,0.0006130493,0.000317545,0.00008418306,6.554388e-7,0.0001984966,0.008088958],"genre_scores_gemma":[0.8708805,0.00000689653,0.1285273,0.0005268582,0.00003212361,0.000004291493,2.109335e-7,0.000004786515,0.00001695604],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7842092,"threshold_uncertainty_score":0.7760906,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009126617,0.0001413457,0.0001364299,0.0001195292,0.0004296692,0.0005400221,0.001629788,0.00003488096,0.0000541913],"category_scores_gemma":[0.00004193067,0.0001104878,0.00003286819,0.0005591465,0.00148802,0.0009477434,0.0009896827,0.0001351512,0.0001009379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002971483,"about_ca_system_score_gemma":0.00005377902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002057902,"about_ca_topic_score_gemma":5.142664e-7,"domain_scores_codex":[0.9983329,0.0000661776,0.0001909673,0.0005697252,0.0004131966,0.0004270209],"domain_scores_gemma":[0.9987742,0.0002364251,0.00004596825,0.0006616026,0.00007711947,0.0002047379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[5.055128e-7,0.00002237235,0.00004251716,0.000001653193,0.000001405673,0.000001683288,0.0004777226,0.00002279692,0.0002508886,0.7223579,0.0000350423,0.2767856],"study_design_scores_gemma":[0.0001387676,0.00005284141,0.00223518,0.00001400775,0.000002294343,0.0000444626,0.000005548325,0.7728022,0.001788989,0.2223218,0.0004259733,0.0001678852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02783089,0.0000815842,0.9650983,0.004034085,0.0002442421,0.00008247797,0.000001216466,0.0002546273,0.002372612],"genre_scores_gemma":[0.848543,0.000007996278,0.1495634,0.001686906,0.0001776295,0.000004383024,2.475641e-7,0.000004758493,0.00001171249],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8207121,"threshold_uncertainty_score":0.548267,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003036736,0.0001096351,0.0002974863,0.000204979,0.0002977158,0.0003733103,0.0007873471,0.00003218973,4.142161e-7],"category_scores_gemma":[0.00002544495,0.00007280405,0.0001085462,0.0003269427,0.0001317052,0.000564154,0.0000589446,0.00006119031,0.000001205113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001445061,"about_ca_system_score_gemma":0.00008536407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002237507,"about_ca_topic_score_gemma":3.869807e-7,"domain_scores_codex":[0.9985223,0.0001490744,0.0005463351,0.0002233211,0.0003413954,0.0002175095],"domain_scores_gemma":[0.9987392,0.0003829864,0.0004177566,0.0001707994,0.0001778875,0.0001114156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002065795,0.00004973856,0.0003006939,0.00008657519,0.00003177844,0.00003389129,0.0008413321,0.0005749939,0.0002615665,0.9785562,0.004600868,0.01464172],"study_design_scores_gemma":[0.01044463,0.006189441,0.008484251,0.001886631,0.00008569611,0.01547558,0.002635759,0.7422851,0.003558231,0.1443942,0.06297674,0.001583729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03850731,0.0007060911,0.9574459,0.0003944921,0.001759494,0.0001021818,0.000003125901,0.00002976479,0.001051658],"genre_scores_gemma":[0.8753679,0.00001173931,0.1242924,0.0001569254,0.0001500888,0.000001367128,1.125506e-7,0.000002616247,0.00001683572],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8368606,"threshold_uncertainty_score":0.359984,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005628578,0.0001199929,0.0002603309,0.00001853307,0.0001300805,0.00005380102,0.001407929,0.00002361989,0.00001676815],"category_scores_gemma":[0.0005108618,0.00006287336,0.0003202613,0.0008406169,0.0004350411,0.0001530377,0.0002230063,0.0001586684,0.000008254839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001893288,"about_ca_system_score_gemma":0.00001964462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006006977,"about_ca_topic_score_gemma":2.370968e-8,"domain_scores_codex":[0.9988471,0.00001385465,0.0003037383,0.0002261561,0.0004072196,0.0002018982],"domain_scores_gemma":[0.998245,0.0007383324,0.0004611684,0.000400857,0.0001105753,0.00004404785],"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.000004115667,0.0001724176,0.00005934781,0.00002949242,0.00002673862,4.144063e-8,0.002734679,0.00001258183,0.014732,0.9734023,0.007243403,0.001582884],"study_design_scores_gemma":[0.000104684,0.0001912056,0.002538285,0.0001276282,0.0000210327,0.000005257526,0.001709586,0.02766799,0.02034266,0.9471231,0.00005238854,0.0001161981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9304195,0.00002849217,0.02931122,0.01701134,0.00004459256,0.000413379,0.000005140721,0.0001376463,0.02262871],"genre_scores_gemma":[0.975258,0.00001065993,0.02284431,0.001669607,0.00002081588,0.00001236563,1.103446e-7,0.000006371978,0.0001777411],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04483854,"threshold_uncertainty_score":0.2616305,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00132196,0.0001881748,0.0001881064,0.0001591227,0.0004971663,0.0008247059,0.001952985,0.00004665354,0.00002195587],"category_scores_gemma":[0.00002988364,0.000153621,0.0000405553,0.0007330048,0.002570244,0.001012681,0.001561606,0.0001438003,0.00007042917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004654322,"about_ca_system_score_gemma":0.00006392507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001047727,"about_ca_topic_score_gemma":4.585272e-7,"domain_scores_codex":[0.9977589,0.00007126134,0.0002463627,0.0007670955,0.0005456785,0.0006107295],"domain_scores_gemma":[0.9986297,0.0002271658,0.00005659651,0.0008279247,0.0000711271,0.0001875251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001271959,0.00003276433,0.00005379653,0.000005581176,0.000001200271,0.00001766398,0.00008087698,0.00002644583,0.0008634767,0.9539915,0.00007371444,0.04485165],"study_design_scores_gemma":[0.0001574522,0.00006494814,0.002765816,0.00001939424,0.000002077221,0.0001077299,0.000002803036,0.5767783,0.001610987,0.4182111,0.0001019548,0.0001774342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1452484,0.00009315015,0.8483028,0.0008502076,0.0003581703,0.00008865991,7.877691e-7,0.0005188282,0.004538943],"genre_scores_gemma":[0.8525067,0.000003853523,0.1469061,0.0004004991,0.000163221,0.000003446579,5.42331e-7,0.000007194921,0.000008442998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7072583,"threshold_uncertainty_score":0.947017,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009520731,0.0001182098,0.0001717394,0.000113097,0.00008391722,0.0001899854,0.0006752803,0.00001846447,0.000004175837],"category_scores_gemma":[0.00003362672,0.00009357301,0.00006198049,0.0002327365,0.00004213888,0.0003130408,0.0001546757,0.0002411617,0.00001119945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002499888,"about_ca_system_score_gemma":0.00003129319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001390223,"about_ca_topic_score_gemma":3.351616e-7,"domain_scores_codex":[0.9988542,0.0002643746,0.0003323343,0.0001238815,0.0002563142,0.0001688522],"domain_scores_gemma":[0.99921,0.00008249593,0.0002804672,0.0002324973,0.00009441921,0.0001001086],"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.000009231665,0.0001384599,0.003107282,0.00001544988,0.00002619725,0.001368764,0.0005041011,0.00004173466,0.0004652512,0.9569021,0.01188786,0.02553361],"study_design_scores_gemma":[0.005588599,0.001863119,0.1684633,0.0002675349,0.00006713536,0.004135505,0.0002419709,0.00211715,0.002488269,0.5859444,0.227818,0.001005134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7305189,0.00387541,0.2410074,0.001546041,0.002013289,0.00007070748,0.000001432077,0.0001079948,0.02085884],"genre_scores_gemma":[0.9966867,0.00004287519,0.002685865,0.0001808456,0.0001758559,7.857437e-8,2.896995e-7,0.00001404373,0.0002134694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3709577,"threshold_uncertainty_score":0.3815797,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002191106,0.000419064,0.0004422425,0.0001932663,0.0006899423,0.0006217165,0.001744716,0.0004023496,0.0005696763],"category_scores_gemma":[0.0006672453,0.0004679765,0.0006551644,0.0004711596,0.0006108708,0.001750685,0.001059598,0.0006339637,0.00009566436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004480095,"about_ca_system_score_gemma":0.0005714325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005476865,"about_ca_topic_score_gemma":0.00004891428,"domain_scores_codex":[0.9960573,0.000347744,0.001079282,0.0005099871,0.001240545,0.0007651788],"domain_scores_gemma":[0.9958411,0.000978724,0.001585571,0.001059624,0.000185692,0.0003492604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001598602,0.000313839,0.00001785856,0.0001542679,0.0003222938,0.0002510005,0.002086229,0.0002317893,0.001032943,0.9823927,0.006491491,0.005106993],"study_design_scores_gemma":[0.007125124,0.005421069,0.0003168705,0.001494634,0.0006426884,0.002784101,0.002674825,0.1302695,0.4665495,0.2800707,0.1007909,0.001860117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9902675,0.0008065588,0.001756086,0.0005571657,0.003306941,0.00006829729,0.00005667115,0.0001147101,0.003066075],"genre_scores_gemma":[0.9962326,0.0001347515,0.001727544,0.0003297525,0.001283811,0.00004690642,0.00002487893,0.0001026802,0.0001170965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.702322,"threshold_uncertainty_score":0.9997772,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001232685,0.0001368576,0.0003914699,0.0001058149,0.00005999473,0.00005091294,0.0009703396,0.00004770158,0.00002295067],"category_scores_gemma":[0.00004661596,0.0001137163,0.00009377233,0.0002108495,0.000231045,0.0001552464,0.0002733566,0.00007964016,0.00004332475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001802623,"about_ca_system_score_gemma":0.00002483318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002155467,"about_ca_topic_score_gemma":3.999223e-7,"domain_scores_codex":[0.9983271,0.0004232484,0.0005098768,0.0002264819,0.0002788369,0.0002344354],"domain_scores_gemma":[0.9982559,0.0004547449,0.0004147523,0.0006716794,0.0001440661,0.00005886463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003552063,0.00006781546,0.0002239608,0.0001701407,0.00003275048,0.000001377339,0.002344917,0.0005947466,0.006275971,0.9809688,0.0002705406,0.009045415],"study_design_scores_gemma":[0.001448123,0.0004771208,0.05262851,0.001343066,0.0000309948,0.00008765712,0.005548912,0.6431879,0.02868062,0.2654893,0.0002446733,0.0008330423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7030852,0.0004334663,0.2908066,0.00004795851,0.0004512504,0.000250069,0.000002945488,0.0001743404,0.004748171],"genre_scores_gemma":[0.9942707,0.000001077296,0.005493982,0.00004110542,0.00007091604,0.000002813097,0.000001720923,0.000009510618,0.0001082009],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7154795,"threshold_uncertainty_score":0.4637216,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007997958,0.00006548461,0.00009646703,0.00004323112,0.0001140447,0.0001260274,0.0005475032,0.00002429063,0.000027199],"category_scores_gemma":[0.00003706472,0.00003697371,0.0001076537,0.0001123504,0.00002171933,0.0002783324,0.00003236256,0.0001002911,0.00001120296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002037702,"about_ca_system_score_gemma":0.00005418343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001265824,"about_ca_topic_score_gemma":0.000001451901,"domain_scores_codex":[0.9992406,0.00004175235,0.0002565532,0.00007848153,0.0002466608,0.0001359851],"domain_scores_gemma":[0.9990297,0.000456134,0.0002345546,0.0001510187,0.0001015907,0.00002700576],"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.00001087813,0.00003881277,0.0000384968,0.000002462088,0.000009623442,0.000004066384,0.00004234862,0.0002523327,0.0004598335,0.9346919,0.06338955,0.001059704],"study_design_scores_gemma":[0.0003192647,0.0001960449,0.002524076,0.00002483789,0.000005041568,0.00008140396,0.00001034966,0.003746854,0.001481503,0.9857515,0.005795004,0.00006408148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3556978,0.0002298373,0.6230612,0.0179881,0.000627048,0.0002296869,0.000005099775,0.00003703537,0.002124233],"genre_scores_gemma":[0.9687165,0.000002857119,0.0289804,0.001473478,0.0006325634,0.000005697237,0.000001409474,0.000006561615,0.000180555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6130187,"threshold_uncertainty_score":0.1507744,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004778799,0.0001893186,0.0002008083,0.0002774752,0.0001934985,0.000121791,0.0007906117,0.00009741655,0.00009673936],"category_scores_gemma":[0.00006828116,0.0001860146,0.00009364541,0.0006625865,0.00006076703,0.0004559747,0.00002315733,0.0002118311,0.0001683602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007018301,"about_ca_system_score_gemma":0.00005750421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002824345,"about_ca_topic_score_gemma":0.0000098419,"domain_scores_codex":[0.9982145,0.0002585567,0.0003685827,0.0005022957,0.0003814789,0.0002745198],"domain_scores_gemma":[0.998311,0.0008652849,0.00009353099,0.0005523815,0.00008849375,0.00008926471],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001105483,0.0004496937,0.00007439437,0.00001307713,0.00002158615,0.00000885293,0.0003383507,0.2672625,0.00002534059,0.2269261,0.0001332375,0.5047357],"study_design_scores_gemma":[0.000460012,0.00008714887,0.00799774,0.00001558791,0.000004108579,0.00001815495,0.00001561727,0.5569309,0.0001385272,0.4338293,0.0003211233,0.0001817693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006430177,0.0000221498,0.9896711,0.00250242,0.0003650301,0.0001566418,0.0000118582,0.000284143,0.0005564507],"genre_scores_gemma":[0.6803432,0.00000499687,0.3178011,0.001690916,0.00003885641,0.00002615612,0.00002848372,0.000009806734,0.00005656051],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.673913,"threshold_uncertainty_score":0.7585456,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009305643,0.0005730304,0.0007488887,0.0002167836,0.0003356208,0.0006342402,0.001264643,0.0002735793,0.0002676099],"category_scores_gemma":[0.0003802663,0.00051648,0.0001739364,0.0004303807,0.0002560552,0.0005575594,0.0008417828,0.0003714219,0.001465288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004679522,"about_ca_system_score_gemma":0.00004812524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003124864,"about_ca_topic_score_gemma":0.000008487086,"domain_scores_codex":[0.9965859,0.0003326373,0.0007061632,0.00101915,0.0005696173,0.0007865537],"domain_scores_gemma":[0.9967486,0.0009486159,0.000390283,0.001450293,0.000105942,0.0003562418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002993095,0.0004190811,0.0002589536,0.0005774709,0.0002368558,0.00007343999,0.006597176,0.00001537036,0.002830313,0.5339983,0.0176745,0.4372886],"study_design_scores_gemma":[0.001857702,0.0003383873,0.006460133,0.0005464586,0.0001615248,0.000136579,0.0001992827,0.5721883,0.002975621,0.3439836,0.06982147,0.001330893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5926505,0.02366836,0.3212586,0.01049675,0.005247765,0.00184878,0.0001075546,0.002500888,0.04222085],"genre_scores_gemma":[0.9740391,0.0005053664,0.02111167,0.00168083,0.0005009941,0.00004662658,0.00002363895,0.00009850398,0.001993232],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5721729,"threshold_uncertainty_score":0.9997287,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004492489,0.00008170673,0.0001836889,0.0000637494,0.0001495776,0.00003180852,0.0003930732,0.0000158024,0.00001299848],"category_scores_gemma":[0.00003964096,0.00005807372,0.00003224246,0.0001788106,0.0004478066,0.0007096348,0.000196279,0.00005525527,0.000003554623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002191779,"about_ca_system_score_gemma":0.00006913815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002239333,"about_ca_topic_score_gemma":0.00002667451,"domain_scores_codex":[0.9988824,0.00005212764,0.0005883736,0.00007171229,0.0002780157,0.0001274473],"domain_scores_gemma":[0.9990932,0.0001452292,0.0002382442,0.0003512658,0.0001341238,0.00003789667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000172832,0.0004313369,0.003817347,0.0005623153,0.0002531187,0.000002957087,0.06031155,0.0009582615,0.012711,0.9075485,0.001987646,0.01124309],"study_design_scores_gemma":[0.004246203,0.001119229,0.04779093,0.0001984909,0.0000304578,0.00003200144,0.00313122,0.8376162,0.05613612,0.04844951,0.0008591126,0.0003905008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.985636,0.00006154774,0.0133954,0.0002265145,0.00006952976,0.0002346941,0.00004484908,0.0000219997,0.0003094931],"genre_scores_gemma":[0.9818788,0.00009427071,0.01786666,0.00009622404,0.000003345962,0.000005211058,0.00001238298,0.00000284803,0.00004029097],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.859099,"threshold_uncertainty_score":0.2368178,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003675387,0.00004636405,0.00007324709,0.00003890636,0.0001112072,0.0000745787,0.0007765152,0.00002428547,0.0000280791],"category_scores_gemma":[0.0007961386,0.00002803915,0.00004409561,0.0001555717,0.00002050084,0.0003306373,0.0002451471,0.0001234562,0.000004885514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001752757,"about_ca_system_score_gemma":0.00003679089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009127526,"about_ca_topic_score_gemma":0.000003206426,"domain_scores_codex":[0.9995526,0.00004387222,0.0001291241,0.00005803253,0.0001262969,0.00009003923],"domain_scores_gemma":[0.9991506,0.0001580687,0.0001387732,0.0004799175,0.00004073568,0.00003194252],"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.00001699648,0.0002137725,0.1005613,0.00004440994,0.0001652937,0.0001106788,0.004604148,0.001452283,0.004189582,0.7407504,0.1389541,0.008937067],"study_design_scores_gemma":[0.001710286,0.0001827742,0.2340394,0.0002984579,0.00007421678,0.001757808,0.0007239991,0.00309695,0.006325576,0.5952015,0.1561613,0.0004278215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9742234,0.002228286,0.01332641,0.006672132,0.0003716874,0.00004564207,6.587838e-7,0.00001927566,0.003112514],"genre_scores_gemma":[0.9663825,0.00005847741,0.03179639,0.0005038165,0.00004437579,4.096021e-7,2.864457e-8,0.000004572994,0.001209404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1455489,"threshold_uncertainty_score":0.1442971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786516640","doi":"10.1142/s0129054113400133","title":"IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Regular language; Combinatorics; Concatenation (mathematics); State (computer science); Quotient; Alphabet; Permutation (music); Discrete mathematics; Integer (computer science); Binary logarithm; Automaton; Algorithm; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02001200027157618,"gpt":0.3211004986114298,"spread":0.3010884983398536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009455902,0.00007050746,0.0001668949,0.0006315371,0.00003926563,0.0001881515,0.003056004,0.00001902721,0.00007609857],"category_scores_gemma":[0.00007994068,0.00006078355,0.00006137758,0.000758235,0.0003704451,0.002313855,0.0004061298,0.00009921287,0.00001036078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006472368,"about_ca_system_score_gemma":0.0002948848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000110827,"about_ca_topic_score_gemma":0.000002991134,"domain_scores_codex":[0.9981487,0.00004965871,0.0005648053,0.000145916,0.0009491352,0.0001417357],"domain_scores_gemma":[0.997526,0.0001698909,0.0003758504,0.0002792968,0.00158718,0.0000617874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001754108,0.0006864331,0.006036578,0.0000263109,0.00009491568,0.00005638964,0.003591978,0.01068631,0.1620249,0.506346,0.002230338,0.3082024],"study_design_scores_gemma":[0.001464413,0.0004218086,0.2420136,0.000346461,0.000006511012,0.0005132818,0.0002894202,0.633272,0.06449486,0.05578048,0.001096761,0.0003003974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4225866,0.00003431498,0.573899,0.002458834,0.0005802387,0.00005927449,0.0000018453,0.000006837909,0.0003730448],"genre_scores_gemma":[0.8389134,0.000009175461,0.1608174,0.000160094,0.00008009828,7.753796e-7,6.601872e-7,0.0000021984,0.00001611271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6225857,"threshold_uncertainty_score":0.5678866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003359244,0.00009836169,0.0001877589,0.00005945491,0.00005479978,0.0000191259,0.0003445163,0.00003167321,0.000008379304],"category_scores_gemma":[0.00009330753,0.00006632658,0.00002297356,0.0002078904,0.0001020546,0.0001310511,0.00007782849,0.0001172882,0.000002720909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001291625,"about_ca_system_score_gemma":0.00001570923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.627827e-7,"about_ca_topic_score_gemma":0.000007164873,"domain_scores_codex":[0.9992785,0.00001788383,0.0002825765,0.000140486,0.0001653807,0.0001151481],"domain_scores_gemma":[0.9980897,0.001347423,0.000191992,0.0003357059,0.00001639816,0.00001878885],"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.00000209233,0.00006452653,0.000009910782,0.00008117905,0.000004167603,3.235901e-7,0.005061795,0.001507447,0.002037597,0.9813505,0.00001721057,0.009863228],"study_design_scores_gemma":[0.0002729848,0.00005319044,0.00003852738,0.0001561539,0.000007393072,0.000005887761,0.002022298,0.05580134,0.02407164,0.9170743,0.0003690395,0.0001272409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3368505,0.001061142,0.6471567,0.0005927067,0.00005351634,0.0004131109,0.000008514287,0.00005785964,0.01380606],"genre_scores_gemma":[0.8897727,0.00008601089,0.1099918,0.0001041013,0.00001055166,0.00001732106,4.653282e-7,0.000006095617,0.00001090348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5529222,"threshold_uncertainty_score":0.270472,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001595867,0.00009953547,0.0001954527,0.00007619703,0.0001072151,0.00002137714,0.0003952727,0.00005431771,0.00003295302],"category_scores_gemma":[0.00002393626,0.00007727805,0.00005813694,0.0002825125,0.0008224287,0.0001908011,0.0001793636,0.00008290591,0.000006582413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005171207,"about_ca_system_score_gemma":0.00003275542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002552346,"about_ca_topic_score_gemma":1.079089e-7,"domain_scores_codex":[0.9991572,0.00001540032,0.0004444275,0.000079556,0.0001658083,0.0001375851],"domain_scores_gemma":[0.9990806,0.000199943,0.0001580387,0.0004107261,0.00006247734,0.00008823881],"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.000001529915,0.00004532684,0.0003917884,0.00003530414,0.000008332619,8.693307e-8,0.002465325,0.00001746481,0.000128052,0.9907274,0.00002340773,0.006155956],"study_design_scores_gemma":[0.001148038,0.0003665215,0.01466969,0.000129936,0.00005423957,0.0000984431,0.003650255,0.3212796,0.01406037,0.6289079,0.01483407,0.0008009843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.295137,0.00005740681,0.6957011,0.00008084098,0.00001637414,0.0001583111,0.00002254648,0.00004628684,0.00878014],"genre_scores_gemma":[0.9758405,0.0000716287,0.02396619,0.00006181607,0.00001213709,0.00001887048,0.00000589021,0.000004299946,0.0000186358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6807035,"threshold_uncertainty_score":0.3151307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}